earley an efficient contextfree parsing algorithm

... AN EFFICIENT AND ROBUST ALGORITHM FOR INCOMPRESSIBLE FLOW AND ITS APPLICATION IN HEAT TRANSFER ENHANCEMENT CHENG YONGPAN NATIONAL UNIVERSITY OF SINGAPORE 2008 AN EFFICIENT AND ROBUST ALGORITHM ... Conversion and Management, vol.46, pp.2216-2231, 2005 Xia Y P and Jacobi A M., Air-side data interpretation and performance analysis for heat transfers with simultaneous heat and mass transfer: Wet and ... Jang J.Y and Chiou N.F., A heat transfer and friction correlation for wavy fin-and-tube heat exchangers, Int J Heat Mass Transfer, vol.42, pp.1919-1924, 1999c Wang C.C and Chi K.Y., Heat transfer

Ngày tải lên: 11/09/2015, 16:02

... 391 (worst) 271 EFFICIENT GENETIC ALGORITHM 31 Table Summary of the first 10 iterations of GA Iter Merge Draft Candidate Fitness Replace 10 and 4 and and and 2 and and and and and and 1-2-3-10-11-12 ... p-median problem as well A Tabu search algorithm was designed by Rolland, Schilling and Current (1997) Simulated annealing algorithms were designed by Murray and Church (1996) and Chiyoshi and ... Annals of Operations Research 122, 21–42, 2003  2003 Kluwer Academic Publishers Manufactured in The Netherlands An Efficient Genetic Algorithm for the p-Median Problem OSMAN ALP and ERHAN

Ngày tải lên: 08/08/2013, 08:38

... (14) cannot be written as a product of a single anterior and posterior. However, any of the anterior the posterior cutsets used in 14 can be computed efficiently. Thus, this new peeling based algorithm ... pedigrees are large with many loops and multiple loci, these sampling methods can become very inefficient, and the J-PCS algorithm was proposed to address this problem [8]. This algorithm involves a) ... members. Following this, ante- rior and posterior cutsets are introduced. Anterior cutsets are used to compute the likelihood by the Elston-Stewart algorithm (peeling), and anterior and posterior cutsets

Ngày tải lên: 14/08/2014, 13:21

... Modelling and Management, Vol 8, No 2, 2016 An efficient implementation of EMD algorithm for motif discovery in time series data Duong Tuan Anh* and Nguyen Van Nhat Faculty of Computer Science and ... 2003; Mueen et al., 2009; Tanaka and Uehara, 2003; Tanaka et al., 2005; Tang and Liao, 2008; Yankov et al., 2007) The first algorithm that can find motifs in linear time is Random Projection (RP), ... accuracy of the EMD algorithm is better than that of RP • The EMD algorithm can identify motif instances of DLs while RP can identify only motif instances of the same length 192 D.T Anh and N.V Nhat

Ngày tải lên: 16/12/2017, 14:56

... I(α) and S(α) are two sets of candidate items for i− and s − extensions of α 10 TRUONG CHI TIN, TRAN NGOC ANH, DUONG VAN HAI, LE HOAI BAC Note that the P probability is also anti-monotonic and ... STRATEGIES AND PROPOSED ALGORITHM Prunning strategies Since umin is not anti-monotonic (AM ), devising upper-bounds satisfying anti-monotonelike properties that can be weaker than AM is necessary and ... to prune low utility candidates at an early stage These include SPU and SRU [19], CRoM [4], PEU and RSU [18], and MEU [12] for the maximum utility umax function, and RBU and LRU for the minimum

Ngày tải lên: 11/01/2020, 17:52

... utility of an itemset in a transaction) The utility of an itemset X in a transaction Tc , denoted as u(X, Tc ), and is defined as u(X, Tc ) = u(i, Tc ), X ⊆ Tc For i∈X 107 AN EFFICIENT ALGORITHM ... experiments on standard databases to firm that LHAR is more efficient than LARM in terms of runtime and memory usage LHAR algorithm is useful for decision systems and management boards in many fields, ... algorithm is more efficient compared to HGB-HAR in terms of memory usage and runtime However, this algorithm has two depth scan processes through ResetLattice and InsertLattice Besides, the algorithm

Ngày tải lên: 10/07/2020, 23:53

... (see FinPricing (2011)) Without an efficient algorithm, one cannot properly capture and manage the risk exposed by the portfolio The rest of this paper is organized as follows: The LMM is discussed ... often assume that a forward rate has a piecewise constant instantaneous volatility Here we choose the forward rate Fk (t ) has constant instantaneous volatility regardless of t (see Brigo-Mercurio ... conclusions can be drawn for AADT and GADT Both CEFR and CEDT are the best In terms of CPU times, FD, AAFR, AADT, GAFR and GADT are the same But CEFR and CEDT are slower, especially in the callable range

Ngày tải lên: 28/07/2020, 20:47

... RESEARCH ARTICLE Open Access ProMotE: an efficient algorithm for counting independent motifs in uncertain network topologies Yuanfang Ren* , Aisharjya Sarkar and Tamer Kahveci Abstract Background: ... regulation of transcription and transmission of signals [1] Biological networks are often modeled as graphs, with nodes and edges representing interacting molecules (e.g., protein or gene) and the interactions ... distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were

Ngày tải lên: 25/11/2020, 14:03

... genomic and epigenomic data Senthil B Girimurugan1†, Yuhang Liu2†, Pei-Yau Lung2†, Daniel L Vera3, Jonathan H Dennis4, Hank W Bass4 and Jinfeng Zhang2* Abstract Background: Identification of functional ... candidate segments and test for significance It then uses a novel data structure based on two coupled balanced binary trees to detect overlapping significant segments and update them simultaneously ... segments can be merged With refinement and merging, iSeg can detect segments of arbitrary length— long and short We added an option to merge only segments whose distances are no more than certain

Ngày tải lên: 25/11/2020, 15:37

... triplets, as an interaction unit to study interactions between TF and DNA [15] The potential is distance dependent and the distance is calculated between an amino acid’s β-carbon and the geometric ... amino acid and an atom b of a DNA base, ke is Coulomb’s constant NA is Avogadro’s number, qa and qb are the charges of the two atoms ε is the dielectric constant and d is the distance between ... experiment AF carried out the experiment and performed data analysis AF and JTG wrote the manuscript All authors read and approved the final manuscript Ethics approval and consent to participate Not applicable

Ngày tải lên: 25/11/2020, 17:10

... the bandwidth can be reduced by arranging the order of the cÃÃ according to each distance between si and sj As the simplest approach, the order may be arranged by the distance between s1 and ... larger threshold can be adopted and a computational cost can be reduced if any estimation errors are allowed, generally, it can be recommended that a threshold is smaller than 10À3 in 398 S Sakata ... affected by efficiency of a bandwidth reduction algorithm We have no approximation algorithm for bandwidth minimization, thus the Cuthill–Mckee [26] and Gibbs–Poole–Stockmeyer [27] algorithms are used

Ngày tải lên: 01/11/2022, 23:30

... Pham and S Perreau, “Performance analysis of reactive shortest path and multi-path routing mechanism with load balance,” in Proceedings of the 22nd Annual Joint Conference on the IEEE Computer and ... Lagrangianizing those constraints, optimizing the resulting Lagrangian function, and then closing the duality gaps by enumerating the near-shortest paths, measured with respect to the Lagrangianized ... 0.50, and 0.95, respectively; “L-instances” are tightly constrained, “H-instances” are loosely constrained, and “M-instances” are in between 5.2 Results and Discussion We generate ten random

Ngày tải lên: 02/11/2022, 08:51

... distribution, and reproduction in any medium, provided the original work is properly cited Hierarchical convergence of an implicit double-net algorithm for nonexpansive semigroups and variational ... upon acceptance It can be downloaded, printed and distributed freely for any purposes (see copyright notice below) For information about publishing your research in Fixed Point Theory and Applications ... available soon Hierarchical convergence of an implicit double-net algorithm for nonexpansive semigroups and variational inequality problems Fixed Point Theory and Applications 2011, 2011:101 doi:10.1186/1687-1812-2011-101

Ngày tải lên: 18/06/2014, 22:20

... (OFDMA) can be exploited to increase data rates, by dividing a frequency-selective broadband channel into a multitude of orthogonal narrowband flat-fading subchannels. An intelligent and scalable ... need for wideband, high-capacity wireless communication technologies that use the available bandwidth efficiently and provide data rates close to channel capacity [1]. Multicarrier channel access ... if n / ∈ S k , p kn = 0; and (ii) if n ∈ S k , we can also have p kn = 0, which means that the kth terminal does not transmit on the nth subcarrier, and it thus bears an actual number of active

Ngày tải lên: 21/06/2014, 01:20

... Variational and Level Set Methods in Computer Vision, pp. 194–201, Vancouver, Canada, July 2001. [30]H.K.Zhao,S.Osher,B.Merriman,andM.Kang,“Implicit and nonparametric shape reconstruction from unorganized ... construction algorithm, ” Computer Graphics, vol. 21, no. 4, pp. 163–169, 1987. [28] D. Comaniciu and P. Meer, “Mean shift: a robust approach toward feature space analysis,” IEEE Transactions on Pattern Analysis ... and Video Processing on Computer Vision and Pattern Recognition (CVPR ’08), Anchorage, Alaska, USA, July 2008. [24] L. Quan, J. Wang, P. Tan, and L. Yuan, “Image-based modeling by joint segmentation,”

Ngày tải lên: 21/06/2014, 18:20

... supported by NSF Grants NCR-9206315 and NCR-9415491, and NATO Collaborative Grant CRG.950060. The second author also thanks INRIA, Sophia Antipolis, project MISTRAL for hospitality and support during ... formulae in Theorems 1 and 2 using the same methods. 3 Analysis and Proofs In this section, we prove Theorems 1 and 2 using an analytical approach. In the next subsection, we transform the problem ... Performance’87, 209-223, North Holland, Amsterdam 1987 [13] Jacquet, P and Szpankowski, W Ultimate Characterizations of the Burst Response of an Interval Searching... Jacquet, P and Szpankowski,

Ngày tải lên: 07/08/2014, 06:20

... tiation [29] that accompanies preparation of transgenic plants and plant cell lines. Cloning of plant cells – history and future The first reports of cloning non-transgenic plant cells were published ... purposes) BMC Plant Biology Open Access Research article Cloning of transgenic tobacco BY-2 cells; an efficient method to analyse and reduce high natural heterogeneity of transgene expression ... μg/ml kanamycin and 100 μg/ml cefotaxim. Kanamycin-resist- ant colonies appeared after 3 to 4 weeks in darkness at 26°C. Transformed calli and suspensions were kept on media supplemented with kanamycin

Ngày tải lên: 12/08/2014, 03:20

... of CCR5 and CXCR4 for HIV-1 infection can be inhibited by their ligands, RANTES and SDF-1β, respectively [37,38]. Some ligands have been used as starting materials to find and develop anti-HIV ... phagocytes, and in many organs [31,46], even though their roles in human cells other than neutrophils remain to be elucidated. Roles of coreceptors other than CCR5 and CXCR4 in HIV-1 infection and the ... (B) or RANTES for two hours at 37°C (C), and then inoculated with two HIV-1 strains, GUN-7WT (m and l) and HCM342 (h and n), HIV-2 CBL23 strain (n and s), and SIV mndGB-1 strain ( and r). Six

Ngày tải lên: 13/08/2014, 05:21

... Halterman M, Rimel BJ, Federoff H, Pandya S, Rosenblatt JD, Planelles V: Lentivirus vectors using human and simian immunodeficiency virus elements J Virol 1999, 73:2832-2840 Rizvi TA, Panganiban ... AML and JWF jointly conceived of these studies PS produced and titered the lentiviral vectors, performed FACS analysis and RT-PCR analysis and transduced cell lines, primary glial cells and neural ... vectors FACS analysis using HIV-1 Gag-Poltransfer to HIV-2 transfer a Quantitative assessment of GFP to package gene and by a Quantitative assessment of GFP transfer to SVC2 cells by FACS analysis

Ngày tải lên: 13/08/2014, 09:21

... therefore, we termed it 'Ramachandran sequence' or 'Ramachandran string' Generation and analyses of random circular permutants A hundred polypeptide... assess the performance: the percentage ... non-redundant Protein Data Bank (PDB) and SCOP. Results Performance on random circular permutants Although CPSARST basically uses structurally meaningful RM strings to search protein databases, its algorithm ... strings by using a Ramachandran sequential transformation (RST) algorithm [40], which transforms protein structures through a Ramachandran (RM) map organized by nearest-neighbor clustering. This

Ngày tải lên: 14/08/2014, 08:20