Sux array is a compact data structure for searching matched strings from text databases. It is an array of pointers and stores all suxes of a text in lexicographic order. Because its memory requirement is less than tree structures, it is eective for large databases. Moreover, constructing the sux array is used in the Block Sorting compression scheme. We compare algorithms for constructing sux a...

By means of He's homotopy perturbation method (HPM) an approximate solution of velocity eld is derived for the ow in straight pipes of non-Newtonian uid obeying the Sisko model. The nonlinear equations governing the ow in pipe are for- mulated and analyzed, using homotopy perturbation method due to He. Furthermore, the obtained solutions for velocity eld is graphically sketched...

y Supported in part by the Deutsche Forschungsgemeinschaft (DFG) under contract number Re{856/2-2. z Supported by a Habilitanden{scholarship of the Deutsche Forschungsgemeinschaft (DFG). Abstract The description of baryons as chiral solitons of the Nambu{Jona{Lasinio (NJL) model is reviewed. A motivation for the soliton description of baryons is provided from large N C QCD. Rigorous results on ...

As with most computer science problems, representation of the data is the key to ecient and eective solutions. Piecewise linear representation has been used for the representation of the data. This representation has been used by various researchers to support clustering, classication, indexing and association rule mining of time series data. A variety of algorithms have been proposed to obtain...

These lectures introduce some of the basic ideas of e ective eld theories. The topics discussed include: relevant and irrelevant operators and scaling, renormalization in e ective eld theories, decoupling of heavy particles, power counting, and naive dimensional analysis. E ective Lagrangians are used to study the S = 2 weak interactions and chiral perturbation theory.

Many existing rule learning systems are computationally expensive on large noisy datasets In this paper we evaluate the recently proposed rule learning algorithm IREP on a large and diverse collection of benchmark problems We show that while IREP is extremely e cient it frequently gives error rates higher than those of C and C rules We then propose a num ber of modi cations resulting in an algo...

This paper presents some of the more signicant technical lessons that the Arcadia project has learned about developing eective s o f t ware development e n vi-ronments. The principal components of the Arcadia-1 architecture are capabilities for process denition and execution, object management, user interface development and management, measurement and evaluation, language processing, and analy...

Debugging inconsistent OWL ontologies is a tedious and time-consuming task where a combination of ontology engineers and domain experts is often required to understand whether the changes to be performed are actually dealing with formalisation errors or changing the intended meaning of the original knowledge model. Debugging services from existing ontology engineering tools and debugging strate...

Rigorous upper and lower bounds for the e€ective moduli are obtained for heterogeneous piezoelectric materials, by generalizing the Hashin±Shtrikman variational principle to the coupled problems of piezoelectricity. The key in obtaining these bounds is the choice of the ®eld variables used in the variational principles, i.e., the strain tensor and the electric displacement vector or the stress ...