algorithm for finding prime numbers between a given range

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

Ngày tải lên: 31/03/2014, 06:20

... S. Jayram, Rajasekar Krishna-murthy, Sriram Raghavan, Shivakumar Vaithyanathan, and Huaiyu Zhu. Avatar information extraction system. IEEE Data Eng. Bull. [23] Sándor Dominich. The Modern Algebra ... learning framework, which overcomes the challenges about scalability and adaptability of the previous approaches. We have then adapted the probabilistic framework to a Vietnamese domain - real ... data such as product (camera, laptop) and real estate. However, they only apply on English language still not Vietnamese. Figure 16. Apartment search of Cazoodle After examining carefully about...

Ngày tải lên: 23/11/2012, 15:04

... optimization of a wind farm of HAWT using GA gives a uniform grid arrangement similar that obtained by Grady et al. [2]; this is different than that obtained by Mosetti [1] who obtained a somewhat ... this paper. It is found that a uniform grid arrangement is also best in the case of a VAWT for optimal power generation. 2. Wake, power and cost modeling of a HAWT 2.1 Jensen's wake modeling ... Engineering in department of Mechanical Engineering and Materials Science at Washington University in St. Louis, MO, USA. He is a Fellow of ASME, AIAA, IEEE, and SAE. E-mail address: rka@wustl.edu...

Ngày tải lên: 05/09/2013, 17:03

... connection matrix as its input parameter includes following steps: 1. An arbitrary node (for example node a) is selected as start node. 2. A not search node adjacent to node a (for example node ... reliability block diagram, series-parallel simplification cannot be used and other algorithms should be searched in such cases. Some of these algorithms, which are based on finding minimum paths, ... 1468617151, Iran (email: nmoslemi@nri.ac.ir , jabbasi@nri.ac.ir) A. Rabiee is with the Department of Electrical Engineering, IUST University, Tehran, Iran (email: Abdorezarabiee@yahooo.com) programming...

Ngày tải lên: 03/01/2014, 19:35

... calculate the gap matrices. For a given gap matrix, we have to con- sider all the different ways that its diagram can be assembled using one or two matrices at a time. (Again, Feynman diagrams ... are energyminimizationalgorithms(Schusteretal., 1997).Whilenotasaccurateascomparative sequence analysis, these algorithms have still pro- ven to be useful research tools. Thermodynamic parameters are available ... characterized bytheTurnergroup(Freieretal.,1986).Dangling bases can also appear inside multiloop diagrams. Notice also that the coaxial diagram in equation (11) really corresponds with four new diagrams because once we allow pairing, dangling bases also...

Ngày tải lên: 12/01/2014, 22:07

... Division AAC Acquisition Advice Code ABF Availability Balance File AMC Army Materiel Command ASB Aviation Support Battalion ASL Authorized Stockage List AVIM Aviation Intermediate Maintenance AVN Aviation AWCF ... times, and reduced equip- ment availability. In many cases, maintainers who were unable to wait any longer for parts to maintain readiness had to make extra efforts to work around part availability ... stocking as many items as possible. Instead, they must balance performance goals against the realities of budget and storage capacity constraints. To manage this tradeoff, the Army uses an algorithm...

Ngày tải lên: 17/02/2014, 17:20

... say, ten candidate translations to help the transla- tor. We obtained the evaluations of three human judges (El-E3). Evaluator E1 is a native Cantonese speaker, E2 a Mandarin speaker, and ... sentence alignment. Existing lexicon compilation methods (Kupiec 1993; Smadja & McKeown 1994; Kumano & Hirakawa 1994; Dagan et al. 1993; Wu & Xia 1994) all attempt to extract pairs ... bilingual word pairs obtained from above stages in the algorithm and stored the more reliable pairs as our primary bilingual lexicon. 3.4 Statistical filters If we have to exhaustively match all...

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

... AN ALGORITHM FOR IDENTIFYING COGNATES BETWEEN RELATED LANGUAGES Jacques B.M. Guy Linguistics Department (RSPacS) Australian National University GPO Box 4, Canberra 2601 AUSTRALIA ABSTRACT ... present. Thus for instance Sakao and Tolomako (Espirltu Santo, Vanuatu) were given as sharing 38.91~ cognates (cut-off cognation index: 1.28), as against a human estimate of 41% backed by a full ... is calculated and translated into a z score using a polynomial approximation (Abramowitz and Stegun 1970). B. Vowel/Consonant Correspondences Disallowing correspondences between vowels and...

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

... IMPLEMENTATION Toshikazu Fukushima, Yutaka Ohyama and Hitoshi Miyai C&C Systems Research Laboratories, NEC Corporation 1-1, Miyazaki 4-chome, Miyamae-ku, Kawasaki City, Kanagawa 213, Japan (fuku@tsl.cl.nec.co.jp, ... developing natural lan- guage parsing accelerators, a hardware approach to the parsing speed-up (Fukushima, 1989b) -(Fukushima, 199 0a) . This paper describes a new hardware algorithm for high speed ... ha~d, Fukushima's ~Igorithm is very suitable for text with a large character set, such as Japanese (more than 5,000 different chaxacters are com- puter re~able in Japanese). This algorithm...

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

... reduce this search space, but we also avoid strong commitments. 3 The Algorithm at a Glance Basically, the best-first search algorithm is a generalization of the incremental version: instead of successively ... generated so far, augmented by the minimal value of the description required for excluding the remaining potantial distractors, surpasses the evaluation of the best solution. 4 Formalization ... secretary". In the second example, x5, x6, x9, and xio are the intended referents. After picking white as a descriptor, the incremental algorithm can choose from many alternatives for...

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

... grammar formalism ; a discussion on the linguistic approach can be found in [Vauquois 78] and [Zaharin 87]. For this grammar formalism, a structural representation is given in the form of a ... The example is taken from [Pullum 84] where he called for a 'simple' grammar which can analyse/ generate the non-context free sublanguage of the African language Bambara given by ... purposes. Generative-Transformational Gram- mars, General Phrase Structure Grammars, Lexical Functional Gr-mmar, etc. were designed to be expla- natory models for human language performance, while...

Ngày tải lên: 22/02/2014, 10:20

... A and B. Example 3. Find an optimal tour for Problem A and B with the following input data (the source a 4 and the sink a 11 for Problem A) : vertices a 1 a 2 a 3 a 4 a 5 a 6 a 7 a 8 ... that a 4 ↔ 6, a 11 ↔ 12, so we have b = 6 and e = 12. vertices a 9 a 2 a 5 a 12 a 15 a 4 a 3 a 6 a 7 a 1 a 8 a 11 a 14 a 17 a 13 a 10 a 16 altitude 1 3 3 4 4 5 8 8 8 9 9 11 ... Consider a complete graph G = (A, E) with vertex set A = {a 1 , a 2 , … , a n } and edge set E = A A. Each vertex a i ∈ A has a real number t i (i = 1, … , n), called the altitude of vertex a i ....

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

... iterative Viterbi algorithm. The backward pass is similar to the forward one and it is thus omitted. The alternative calls of forward and backward passes (in Algorithm 1) ensure the alternative ... CRFs for large-scale natural language data. Proceedings of ACL-IJCNLP Short Papers. N. Kaji, Y. Fujiwara, N. Yoshinaga, and M. Kitsuregawa. 2010. Efficient Staggered Decoding for Sequence La- beling. ... to the state-of-the-art. We do not have a baseline to compare with for the last dataset as it is not pub- licly available 7 . Higher accuracy may be achieved if more task specific features are introduced...

Ngày tải lên: 16/03/2014, 19:20

... Dependency Parsing Manabu Sassano Yahoo Japan Corporation Midtown Tower, 9-7-1 Akasaka, Minato-ku, Tokyo 107-6211, Japan msassano@yahoo-corp.jp Sadao Kurohashi Graduate School of Informatics, Kyoto ... University Yoshida-honmachi, Sakyo-ku, Kyoto 606-8501, Japan kuro@i.kyoto-u.ac.jp Abstract We describe an algorithm for Japanese analysis that does both base phrase chunk- ing and dependency parsing simultane- ously ... Linear-time dependency analysis for Japanese. In Proc. of COLING 2004, pages 8–14. S. Sekine, K. Uchimoto, and H. Isahara. 2000. Back- ward beam search algorithm for dependency analysis of Japanese....

Ngày tải lên: 17/03/2014, 02:20

... com- parable data (Munteanu and Marcu, 2005). For a given source sentence S, a max- imum entropy (ME) classifier is applied to a large set of candidate target transla- tions . A beam-search algorithm ... et al., 2008; Utiyama and Isahara, 2003; Munteanu and Marcu, 2005; Fung and Cheung, 2004). The novel algorithm is successfully eval- uated on news data for two language pairs. A related approach ... 2004. Pharaoh: a Beam Search De- coder for Phrase-Based Statistical Machine Transla- tion Models. In Proceedings of AMTA’04, Washing- ton DC, September-October. Dragos S. Munteanu and Daniel Marcu....

Ngày tải lên: 17/03/2014, 02:20

... (CoNLL-2002), 49-55, Taibei, Taiwan. Mari Ostendorf, Izhak Shafran, Stefanie Shattuck- Hufnagel, Leslie Charmichael, and William Byrne. 2001. A Prosodically Labeled Database of Sponta- neous Speech. ... Preposi- tional Phrase Attachment. In Proceedings of the ARPA Workshop on Human Language Technology, 250-255, Plainsboro, NJ, USA. Jeffrey C. Reynar and Adwait Ratnaparkhi. 1997. A Maximum Entropy Approach ... area (Ratnaparkhi et al., 1994; Ber- ger et al., 1996; Pietra et al, 1997; Zhou et al., 2003; Riezler and Vasserman, 2004) In the most basic approach, such as Ratna- parkhi et al. (1994) and...

Ngày tải lên: 17/03/2014, 04:20

Ngày tải lên: 17/03/2014, 07:20

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

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