FPGAs can perform better than ASICs if the logic mapped onto them is optimized for each problem instance. Unfortunately, this advantage is often canceled by the long time needed by CAD tools to generate problem instance dependent logic and the time required to configure the FPGAs. In this paper, a novel approach for runtime mapping is proposed that utilizes self-reconfigurability of multicontex...

This project centers on the evaluation for the time complexity of Knuth-Morris-Pratt(KMP) string matching algorithm. String matching problem is to locate a pattern string within a larger string. The best performance in terms of asymptotic time complexity is currently linear, given by the KMP algorithm. In this algorithm, firstly a prefix for the pattern string is computed and then based on this...

Kaempferol (KMP) is an important flavonoid in many fruits and vegetables. Preclinical studies on KMP have reported its pharmacological effects, including antimicrobial, antioxidant, anti-inflammatory, antitumor, antidiabetic, myocardial protective, neuroprotective effects. Additionally, some epidemiological revealed a negative association between the consumption of KMP-containing foods risk dev...

The purpose of this paper is to develop an understanding of the factors that support of Knowledge Management Practice (KmP) at Malaysian university libraries. Many preceding studies outline the theoretical case for Knowledge Management. The current study seeks to explore whether knowledge creation, knowledge acquisition, knowledge capture and knowledge sharing may possibly have a significant as...

The Hypervolume Indicator is one of the most widely used quality indicators in Evolutionary Multiobjective Optimization. Its computation is a special case of Klee’s Measure Problem (KMP) where the upper end of all rectangular ranges coincides with a given reference point (assuming minimization, without loss of generality). Although the time complexity of the hypervolume indicator in two and thr...

Many keyword pattern matching algorithms use precomputation subroutines to produce lookup tables, which in turn are used to improve performance during the search phase. If the keywords to be matched are known at compile time, the precomputation subroutines can be implemented to be evaluated at compile time versus at run time. This will provide a performance boost to run time operations. We have...

The success of a virtual organization (VO) largely depends on the effective collaboration of its members in orchestrating their knowledge, skills, core competences and resources. It enables the VOs to enhance competitive capabilities and respond better to business opportunities. Most previous studies have focused on the influence of some contingent factors on Knowledge Management (KM) process/ ...

A tanulmány a Judith S. Kestenberg és mozgáskutató csoportja által kidolgozott mozgáselemző módszer elméletét embodiment-felfogását mutatja be. Tánc- mozgásterapeutaként Kestenberg-mozgáselemzőként igyekszem bemutatni azt az embodiment-felfogást, amelyet pszichoanalízis eszmerendszerén belül képviselt. Mozgás Profil (KMP) mozgás pszichodinamikus elméletének tekinthető, mely személyiségfejlődést...

This paper is about the modification of KMP (Knuth, Morris and Pratt) algorithm for string searching of Chinese text. The difficulty is searching through a text string of singleand multi-byte characters. We showed that proper decoding of the input as sequences of characters instead of bytes is necessary. The standard KMP algorithm can easily be modified for Chinese string searching but at the w...

The exercise is to calculate a pattern-matching algorithm, and specifically the algorithm originally due to Knuth, Morris, and Pratt [0]. We begin, however, with a smaller problem, one that turns out to be both similar to, and a subproblem of, the larger problem. We prefer to start with this because it will give the reader a chance to become familiar in a simple setting with the style and notat...