Can't Stop Time

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Signi cant Lexical Relationships

We describe a test that can be used to accurately assess the significance of a population model from a data sample using freely available software. We apply this test to the study of lexical relationships and demonstrate that the results obtained using this test are both theoretically more reliable and diierent from the results obtained using previous approaches.

متن کامل

cant Lexical Relationships

Statistical NLP inevitably deals with a large number of rare events As a consequence NLP data often vio lates the assumptions implicit in traditional statistical procedures such as signi cance testing We describe a signi cance test an exact conditional test that is appropriate for NLP data and can be performed us ing freely available software We apply this test to the study of lexical relations...

متن کامل

cAnt-MinerPB Classification Algorithm

Ant colony optimization (ACO) algorithms for classification in general employ a sequential covering strategy to create a list of classification rules. A key component in this strategy is the selection of the rule quality function, since the algorithm aims at creating one rule at a time using an ACObased procedure to search the best rule. Recently, an improved strategy has been proposed in the c...

متن کامل

Combinatorics , Automata and Number Theory CANT

129 adic, 130 canonical (CNS), 93 Dumont-Thomas, 333, 516 linear, 81 positional, 125 scale, 80, 125 numerical value, 41 S-numerical value, 129 occurrence, 355 odometer, 177, 350, 415, 500, 515 base, 350 ω-equivalent D0L systems, 520 HDOL systems, 164 one-sided shift, 43 orbit, 388 equivalent, 368 strongly, 368 of a word, 43 order genealogical, 24 lexicographic, 24, 342 radix, 24 unit, 365, 366 ...

متن کامل

Improving the cAnt-MinerPB Classification Algorithm

Ant Colony Optimisation (ACO) has been successfully applied to the classification task of data mining in the form of Ant-Miner. A new extension of Ant-Miner, called cAnt-MinerPB, uses the ACO procedure in a different fashion. The main difference is that the search in cAnt-MinerPB is optimised to find the best list of rules, whereas in AntMiner the search is optimised to find the best individual...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Therapy

سال: 2003

ISSN: 0031-9023,1538-6724

DOI: 10.1093/ptj/83.1.6