The Experts below are selected from a list of 312 Experts worldwide ranked by ideXlab platform
W F Smyth - One of the best experts on this subject based on the ideXlab platform.
-
a Simple Algorithm for computing the lempel ziv factorization
Data Compression Conference, 2008Co-Authors: Maxime Crochemore, Lucian Ilie, W F SmythAbstract:We give a space-efficient Simple Algorithm for computing the Lempel-Ziv factorization of a string. For a string of length n over an integer alphabet, it runs in O(n) time independently of alphabet size and uses o(n) additional space.
-
DCC - A Simple Algorithm for Computing the Lempel Ziv Factorization
Data Compression Conference (dcc 2008), 2008Co-Authors: Maxime Crochemore, Lucian Ilie, W F SmythAbstract:We give a space-efficient Simple Algorithm for computing the Lempel-Ziv factorization of a string. For a string of length n over an integer alphabet, it runs in O(n) time independently of alphabet size and uses o(n) additional space.
Włodzisław Duch - One of the best experts on this subject based on the ideXlab platform.
-
Intelligent Information Systems - SBL-PM: A Simple Algorithm for Selection of Reference Instances for Similarity Based Methods
Intelligent Information Systems, 2000Co-Authors: Karol Grudziński, Włodzisław DuchAbstract:SBL-PM is a Simple Algorithm for selection of reference instances, a first step towards building a partial memory learner. A batch and on-line version of the Algorithm is presented, allowing to find a compromise between the number of reference cases retained and the accuracy of the system. Preliminary experiments on real and artificial datasets illustrate these relations.
Maxime Crochemore - One of the best experts on this subject based on the ideXlab platform.
-
a Simple Algorithm for computing the lempel ziv factorization
Data Compression Conference, 2008Co-Authors: Maxime Crochemore, Lucian Ilie, W F SmythAbstract:We give a space-efficient Simple Algorithm for computing the Lempel-Ziv factorization of a string. For a string of length n over an integer alphabet, it runs in O(n) time independently of alphabet size and uses o(n) additional space.
-
DCC - A Simple Algorithm for Computing the Lempel Ziv Factorization
Data Compression Conference (dcc 2008), 2008Co-Authors: Maxime Crochemore, Lucian Ilie, W F SmythAbstract:We give a space-efficient Simple Algorithm for computing the Lempel-Ziv factorization of a string. For a string of length n over an integer alphabet, it runs in O(n) time independently of alphabet size and uses o(n) additional space.
Yutaka Asako - One of the best experts on this subject based on the ideXlab platform.
-
Outflow velocity for Simple Algorithm for unsteady forced convection flows with variable density
International Communications in Heat and Mass Transfer, 2018Co-Authors: Yutaka Asako, Mohammad Faghri, Lit Ken Tan, Nor Azwadi Che SidikAbstract:Abstract The Simple Algorithm for the pressure-velocity coupling has been adopted by many commercial and non-commercial CFD codes. The Simple Algorithm requires all normal velocities at the boundaries before solving the pressure correction equation. These velocities must imply an overall mass balance. In this paper, a new procedure to recalculate the outflow velocity for the Neumann type outflow boundary for forced convection with variable density is proposed. As an example of the utilization of this procedure, the outflow normal velocity of a circular duct was computed and the results were compared with the results using the new modified procedure.
-
Modification of Simple Algorithm to handle supercritical natural circulation in a loop
International Journal of Heat and Mass Transfer, 2018Co-Authors: Yutaka Asako, Manish SharmaAbstract:Abstract The conventional Simple Algorithm for the pressure–velocity coupling has been adopted by many commercial CFD codes. Since it encounters convergence problem when it is used for numerical analysis of a two-dimensional unsteady natural convection flow in a rectangular cavity with zero-isothermal compressibility, the modification of Simple Algorithm has been proposed for such a fluid. In this paper, differences between solutions for a one dimensional natural circulation of a super-critical carbon dioxide in a loop with a horizontal heater and a horizontal cooler configuration obtained by using the conventional Simple Algorithm and the modified version of the Algorithm are investigated. The modification of the Algorithm includes updating the density at each time step based on its value at the previous time step to satisfy the mass conservation. The differences of the velocity and temperature are relatively small comparing with the two-dimensional natural convection case. As an example of utilizing the modified Simple Algorithm, characteristics of the unsteady natural circulation of super-critical carbon dioxide in a rectangular loop are revealed.
-
modification of Simple Algorithm to handle natural convection flows with zero isothermal compressibility
International Journal of Heat and Mass Transfer, 2017Co-Authors: Yutaka Asako, Mohammad FaghriAbstract:The conventional Simple Algorithm for the pressure–velocity coupling has been adopted by many commercial and non-commercial CFD codes. It encounters convergence problem when it is used to solve unsteady natural convection flows with zero-isothermal compressibility. In this paper, a modified version of this Algorithm is proposed to remedy this drawback. The modification includes updating of the density at each time step based on its value at the previous time step to satisfy the continuity equation. As an example of utilizing the modified Simple Algorithm, the unsteady natural convection in a rectangular cavity with isothermal vertical walls and adiabatic horizontal walls was computed. Physically consistent results were obtained.
Anne Pringle - One of the best experts on this subject based on the ideXlab platform.
-
selection of pairings reaching evenly across the data spread a Simple Algorithm to design maximally informative fully crossed mating experiments
Heredity, 2016Co-Authors: Kolea Zimmerman, Ethan Addicott, Daniel A. Levitis, Anne PringleAbstract:Selection of pairings reaching evenly across the data (SPREAD): A Simple Algorithm to design maximally informative fully crossed mating experiments
