On an online random k-SAT model Given n Boolean variables x(1),...,xn, a k-clause is a disjunction of k literals, where a literal is a variable or its negation. Suppose random k-clauses are generated one at a time and an online algorithm accepts or rejects each clause as it is generated. Our goal is to accept as many randomly generated k-clauses as possible with the condition that it must be possible to satisfy every clause that is accepted. When cn random k-clauses on n variables are given, a natural online algorithm known as Online-Lazy accepts an expected (1-1/2(k))cn + a(k)n clauses for some constant a(k). If these clauses are given offline, it is possible to do much better, (1-1/2(k))cn + Omega (root c)n can be accepted whp. The question of closing the gap between ak and Omega (root c) for the online version remained open. This article shows that for any k >= 1, any online algorithm will accept less than (1-1/2(k))cn + (In 2)n k-clauses whp, closing the gap between the constant and Omega (root c). Furthermore we show that this bound is asymptotically tight as k -> infinity. (c) 2007 Wiley Periodicals, Inc.

O O B O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O B B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Semiempirical

and

ab

initio

conformational

analysis

of

2-methylene-8,8-dimethyl-1,4,6,10-tetraoxaspiro[4.5]

decane

with

application

of

GIAO-SCF

methods

to

NMR

spectrum

interpretation

The

GIAO-SCF

method

for

calculating

isotropic

nuclear

magnetic

shielding

values

has

been

utilized

to

explain

certain

features

in

the

spectrum

of

decane.

Population

distributions

of

the

low-energy

conformers

based

on

their

ab

initio

energies

were

used

to

produce

weighting

factors

for

the

individual

calculated

shielding

values

to

calculate

the

weighted

average

of

the

shielding

values

for

a

complete

set

of

conformers.

The

differences

in

chemical

shifts

between

the

hydrogens

of

the

two

methyl

groups

and

between

the

axial

and

equatorial

hydrogens

in

decane

were

shown

to

be

due

to

energy

differences

between

the

chair

and

boat

orientations

of

the

six-membered

ring

and

contribution

from

a

twist-boat

conformation.

Results

suggest

a

hypothesis

that

intramolecular

differences

in

chemical

shift

might

be

calculated

to

a

greater

degree

of

accuracy

than

chemical

shifts

calculated

relative

to

a

standard.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O

giao-scf
spiroorthocarbonate
isotropic shielding
nuclear magnetic resonance
conformational population distribution


A finite element method for the two-dimensional extended Boussinesq equations A new numerical method for Nwogu's (ASCE Journal of Waterway, Port, Coastal and Ocean Engineering 1993; 119:618) two-dimensional extended Boussinesq equations is presented using a linear triangular finite element spatial discretization coupled with a sophisticated adaptive time integration package. The authors have previously presented a finite element method for the one-dimensional form of these equations (M. Walkley and M. Berzins (International Journal for Numerical Methods in Fluids 1999; 29(2):143)) and this paper describes the extension of these ideas to the two-dimensional equations and the application of the method to complex geometries using unstructured triangular grids. Computational results are presented for two standard test problems and a realistic harbour model. Copyright (C) 2002 John Wiley Sons, Ltd.

O B I I O O O B I I O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O B I I O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

extended boussinesq equations
finite element method
adaptive time integration


Fusion of multispectral and panchromatic images based on support value transform and adaptive principal component analysis In this paper we combined the projection-substitution with ARSIS (French acronym for "Amelioration de la Resolution Spatiale par Injection de Structures", i.e., Improving Spatial Resolution by Structure Injection) concept assumption for fusion of panchromatic (PAN) and multispectral (MS) images. Firstly support value filter (SVF) is used to establish a new multiscale model (MSM), support vector transform (SVT), and adaptive principal component analysis (APCA) is then employed to select the principal components of MS images by means of a statistical measure of the correlation between MS and PAN images; secondly, a local approach is used to check whether a structure should appear in the new principal component and PAN high frequency structures are transformed by high resolution interband structure model (HRIBSM) before inserting in the MS modalities. Because SVT is an undecimated, dyadic and aliasing transform with shift-invariant property, the fused image can avoid ringing effects suffered from sampling. Additionally, the ARSIS concept can make full use of the remote sensing physics to reduce the spatial and spectrum distortion in the structure injection. Texture extraction is also employed to avoid the spectral distortion caused by the mistaken injection of low-pass components into the MS images. Experimental results including visual and numerical evaluation also proves the superiority of the proposed method to its counterparts. (C) 2010 Elsevier B.V. All rights reserved.

B O O O O O O O B I I O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

fusion
support value transform
arsis
texture extraction


a relevance model based filter for improving ad quality Recently there has been a surge in research that predicts retrieval relevance using historical click-through data. While a larger number of clicks between a query and a document provides a stronger ``confidence" of relevance, most models in the literature that learn from clicks are error-prone as they do not take into account any confidence estimates. Sponsored Search models are especially prone to this error as they are typically trained on search engine logs in order to predict click-through-rate (CTR). The estimated CTR ultimately determines the rank at which an ad is shown and also impacts the price (cost-per-click) for the advertiser. In this paper, we improve a model that applies collaborative filtering on click data by training a filter that has been trained to predict pure relevance. Applying the filter to ads that have seen few clicks on live traffic results in improved CTR and click-yield (CY). Additionally, in offline experiments we find that using features based on the \emph{organic} results improves the relevance based filter's performance.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


A comparison between feature-based and EM-based contour tracking Most active-contour methods are based either on maximizing the image contrast under the contour or on minimizing the sum of squared distances between contour and image features. The Marginalized Likelihood Ratio (MLR) contour model uses a contrast-based measure of goodness-of-fit for the contour and thus falls into the first class. The point of departure from previous models consists in marginalizing this contrast measure over unmodelled shape variations. The MLR model naturally leads to the EM Contour algorithm, in which pose optimization is carried out by iterated least-squares, as in feature-based contour methods. The difference with respect to other feature-based algorithms is that the EM Contour algorithm minimizes squared distances from Bayes least-squares (marginalized) estimates of contour locations, rather than from strongest features in the neighborhood of the contour. Within the framework of the MLR model, alternatives to the EM algorithm can also be derived: one of these alternatives is the empirical-information method. Tracking experiments demonstrate the robustness of pose estimates given by the MLR model, and support the theoretical expectation that the EM Contour algorithm is more robust than either feature-based methods or the empirical-information method.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

generative model
active contour
kalman filter
empirical information matrix


Energy, water and process technologies integration for the simultaneous production of ethanol and food from the entire corn plant This paper presents simultaneous integration of different technologies such as the traditional dry-grind process to obtain ethanol from grain with the gasification of the corn stover followed by either syngas fermentation or catalytic mixed alcohols synthesis. The optimal integrated process when using the entire corn plant (18 kg/s of grain and 10.8 kg/s of stover) is the one in which the dry-grind technology to process corn grain is integrated with the catalytic path for the corn stover due to the improved integration of energy, requiring only 17 MW of energy, 50 MW of cooling and 1.56 gal/gal of freshwater, for an ethanol production cost of 1.22 $/gal. However, the production cost decreases as we only use stover to produce ethanol, while the grain is used for food due to the lower cost of the stover and the more favorable energy balance of the ethanol production process from gasification. (C) 2011 Elsevier Ltd. All rights reserved.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

bioethanol
energy and food production
integrated process synthesis
heat, water and technology integration
process synthesizer mipsyn


Dynamic multiple-frame bandwidth provisioning with fairness and revenue considerations for Broadband Wireless Access Systems ? The increasing demand for wireless heterogeneous multimedia services presents a real challenge to mobile network operators. Even with the substantial increase in the supported bandwidth in emerging Broadband Wireless Access Systems (BWASs) such as 3.5G High Speed Downlink Packet Access (HSDPA) and the Worldwide Interoperability for Microwave Access (WiMAX), satisfying the bandwidth requirements of mobile users while increasing the revenues of network operators is still one of the major issues in these systems. Therefore, bandwidth provisioning will certainly play a decisive role in the success of such BWASs. In this paper, we propose a novel dynamic multiple-frame bandwidth provisioning scheme for BWASs. The proposed scheme spans multiple time frames and optimally allocates them to the different classes of traffic depending on their weights, the real-time bandwidth requirements of their users connections, their channel quality conditions and the expected obtained revenues. To maximize fairness and still maintain service differentiation between classes, we provide a unique formulation for dynamically computing the class weights. Simulation results are provided to show the potential and effectiveness of our scheme.

O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

multiple-frame bandwidth provisioning
opportunity cost
dynamic weights


Reliability-based robust design of smart sensing systems for failure diagnostics using piezoelectric materials Developed a new method for piezoelectric materials based sensing systems design. Developed a quantitative detectability measure to evaluate the sensing performance. Developed a novel detectability analysis approach based on Mahalanobis distance. Considered uncertainties in structure material properties and operating conditions. Employed two engineering case studies to demonstrate the methodology.

O O B O O O O O O O O O O O O O O O O O O O O B O O O B O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O

fault diagnosis
structure sensing
piezoelectric material
robustness


Searching in metric spaces with user-defined and approximate distances Novel database applications, such as multimedia, data mining, e-commerce, and many others, make intensive use of similarity queries in order to retrieve the objects that better fit a user request. Since the effectiveness of such queries improves when the user is allowed to personalize the similarity criterion according to which database objects are evaluated and ranked, the development of access methods able to efficiently support user-defined similarity queries becomes a basic requirement. In this article we introduce the first index structure, called the QIC-M-tree, that can process user-defined queries in generic metric spaces, that is, where the only information about indexed objects is their relative distances. The QIC-M-tree is a metric access method that can deal with several distinct distances at a time: (1) a query (user-defined) distance, (2) an index distance (used to build the tree), and (3) a comparison (approximate) distance (used to quickly discard from the search uninteresting parts of the tree). We develop an analytical cost model that accurately characterizes the performance of the QIC-M-tree and validate such model through extensive experimentation on real metric data sets. In particular, our analysis is able to predict the best evaluation strategy (i.e., which distances to use) under a variety of configurations, by properly taking into account relevant factors such as the distribution of distances, the cost of computing distances, and the actual index structure. We also prove that the overall saving in CPU search costs when using an approximate distance can be estimated by using information on the data set only (thus such measure is independent of the underlying access method) and show that performance results are closely related to a novel "indexing" error measure.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O

algorithms
design
distance metrics
user-defined queries


Automatic detection of abnormalities in chest radiographs using local texture analysis A fully automatic method is presented to detect abnormalities in frontal chest radiographs which are aggregated into an overall abnormality score. The method is aimed at finding abnormal signs of a diffuse textural nature, such as they are encountered in mass chest screening against tuberculosis (TB). The scheme starts with automatic segmentation of the lung fields, using active shape models. The segmentation is used to subdivide the lung fields into overlapping regions of various sizes. Texture features are extracted from each region, using the moments of responses to a multiscale filter bank. Additional "difference features" are obtained by subtracting feature vectors from corresponding regions in the left and right lung fields. A separate training set is constructed for each region. All regions are classified by voting among the k nearest neighbors, with leave-one-out. Next, the classification results of each region are combined, using a weighted multiplier in which regions with higher classification reliability weigh more heavily. This produces an abnormality score for each image. The method is evaluated on two databases. The first database was collected from a TB mass chest screening program, from which 147 images with textural abnormalities and 241 normal images were selected. Although this database contains many subtle abnormalities, the classification has a sensitivity of 0.86 at a specificity of 0.50 and an area under the receiver operating characteristic (ROC) curve of 0.820. The second database consist of 100 normal images and 100 abnormal images with interstitial disease. For this database, the results were a sensitivity of 0.97 at a specificity of 0.90 and an area under the ROC curve of 0.986.

O O O O O B I O O B I O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Self-generated-certificate public key encryption without pairing and its application ? Recently, Liu et al. [26] discovered that Certificateless Public Key Encryption (CL-PKE) suffers the Denial-of-Decryption (DoD) attack. Based on CL-PKC, the authors introduced a new paradigm called Self-Generated-Certificate Public Key Cryptography (SGC-PKC) that captured the DoD attack and proposed the first scheme derived from a novel application of Waters Identity-Based Encryption scheme [43]. In this paper, we propose a new SGC-PKE scheme that does not depend on the bilinear pairings and hence, is more efficient and requires shorter public keys than Liu et al.s scheme. More importantly, our scheme reaches Giraults trust level 3 [16] (cf. Giraults trust level 2 of Liu and Aus scheme), the same trust level achieved by a traditional PKI. In addition, we also discuss how our scheme can lead to a secure and self-organized key management and authentication system for ad hoc wireless networks with a function of user-controlled key renewal.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I I O O O O O O O

self-generated-certificate public key cryptography


OPEN SOURCE SOFTWARE: THE ROLE OF MARKETING IN THE DIFFUSION OF INNOVATION Much of the literature on open source software (OSS) has focused on the role of the community of users and developers as the primary driver of OSS growth. This focus on growth generated by the community is referred to as "single factor" growth and is an assumption shared by literature on the diffusion of innovation. The purpose of this research is to attempt to fit a logistic model to a well-known OSS project as a confirmatory exercise supporting the use of a single factor growth model as suggested by the literature. The results show that a logistic model, or any kind of single factor model, is inadequate to describe the diffusion of the OSS project. The paper then explains conceptually and illustrates mathematically why single factor models cannot fully represent the diffusion of any OSS project. A well-known two-factor model drawn from the marketing literature is presented, shown to solve the problem of single factor models, and used to illustrate the importance of marketing in OSS projects. This research suggests that the OSS literature may be overemphasizing the importance of the size of the user and developer community during the initial stages of growth and that during these stages the diffusion of the OSS project is primarily driven by external forces such as advertising or marketing efforts.

B I I O O O B O O B O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O B O

open source software
diffusion
marketing


a multi-fpga 10x-real-time high-speed search engine for a 5000-word vocabulary speech recognizer Today's best quality speech recognition systems are implemented in software. These systems fully occupy the resources of a high-end server to deliver results at real-time speed: each hour of audio requires a significant fraction of an hour of computation for recognition. This is profoundly limiting for applications that require extreme recognition speed, for example, high-volume tasks such as video indexing (e.g., YouTube), or high-speed tasks such as triage of homeland security intelligence. We describe the architecture and implementation of one critical component -- the backend search stage -- of a high-speed, large-vocabulary recognizer. Implemented on a multi-FPGA Berkeley Emulation Engine 2 (BEE2) platform, we handle a standard 5000-word Wall Street Journal speech benchmark. Our backend search engine can decode on average 10 times faster than real-time running at 100 MHz, i.e, 10x faster than real-time, with negligible degradation in accuracy, running at a clock rate ~ 30x slower than a conventional server. To the best of our knowledge, this is both the most complex, and the fastest recognizer ever to be realized in a hardware form.

O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Strongly Noetherian rings and constructive ideal theory We give a new constructive definition for Noetherian rings. It has a very concrete statement and is nevertheless strong enough to prove constructively the termination of algorithms involving trees of ideals. The efficiency of such algorithms (at least for providing clear and intuitive constructive proofs) is illustrated in a section about LaskerNoether rings: we give constructive proofs for the existence of the minimal primes over an ideal, of its radical, of its primary decomposition, in a wide class of polynomial rings.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Some new tests of relevance theory in information science A central idea in Dan Sperber and Deirdre Wilsons relevance theory is that an individuals sense of the relevance of an input varies directly with the cognitive effects, and inversely with the processing effort, of the input in a context. I argue that this idea has an objective analog in information sciencethe tf*idf (term frequency, inverse document frequency) formula used to weight indexing terms in document retrieval. Here, tf*idf is used to weight terms from five bibliometric distributions in the context of the seed terms that generated them. The distributions include the descriptors co-assigned with a descriptor, the descriptors and identifiers assigned to an author, two examples of cited authors and their co-citees, and the books and journals cited with a famous book, The Structure of Scientific Revolutions. In each case, the highest-ranked terms are contrasted with lowest-ranked terms. In two cases, pennant diagrams, a new way of displaying bibliometric data, augment the tabular results. Clear qualitative differences between the sets of terms are intuitively well-explained by relevance theory.

O O O O B I O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O B I


More things than are dreamt of in your biology: Information-processing in biologically inspired robots ? Animals and robots perceiving and acting in a world require an ontology that accommodates entities, processes, states of affairs, etc., in their environment. If the perceived environment includes information-processing systems, the ontology should reflect that. Scientists studying such systems need an ontology that includes the first-order ontology characterising physical phenomena, the second-order ontology characterising perceivers of physical phenomena, and a (recursive) third order ontology characterising perceivers of perceivers, including introspectors. We argue that second- and third-order ontologies refer to contents of virtual machines and examine requirements for scientific investigation of combined virtual and physical machines, such as animals and robots. We show how the CogAff architecture schema, combining reactive, deliberative, and meta-management categories, provides a first draft schematic third-order ontology for describing a wide range of natural and artificial agents. Many previously proposed architectures use only a subset of CogAff, including subsumption architectures, contention-scheduling systems, architectures with executive functions and a variety of types of Omega architectures. Adding a multiply-connected, fast-acting alarm mechanism within the CogAff framework accounts for several varieties of emotions. H-CogAff, a special case of CogAff, is postulated as a minimal architecture specification for a human-like system. We illustrate use of the CogAff schema in comparing H-CogAff with Clarion, a well known architecture. One implication is that reliance on concepts tied to observation and experiment can harmfully restrict explanatory theorising, since what an information processor is doing cannot, in general, be determined by using the standard observational techniques of the physical sciences or laboratory experiments. Like theoretical physics, cognitive science needs to be highly speculative to make progress.

O O O O O O O O B O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O B O O O O O O O O O B O O O O B O O O O O B O O O O O O O O O O B O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

architecture
biology
ontology
virtual machines

emotion
evolution
information-processing
ontological blindness
robotics


Window query processing in linear quadtrees The linear quadtree is a spatial access method that is built by decomposing the spatial objects in a database into quadtree blocks and storing these quadtree blocks in a B-tree. The linear quadtree is very useful for geographic information systems because it provides good query performance while using existing B-tree implementations. An algorithm and a cost model are presented for processing window queries in linear quadtrees. The algorithm can handle query windows of any shape in the general case of spatial databases with overlapping objects. The algorithm recursively decomposes the space into quadtree blocks, and uses the quadtree blocks overlapping the query window to search the B-tree. The cost model estimates the I/O cost of processing window queries using the algorithm. The cost model is also based on a recursive decomposition of the space, and it uses very simple parameters that can easily be maintained in the database catalog. Experiments with real and synthetic data sets verify the accuracy of the cost model.

O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O B O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

spatial databases
quadtrees
window queries


Effect of Amblyomma cajennense Ticks on the Immune Response of BALB/c Mice and Horses This work evaluated the effect of the Amblyomma cajennense tick on the immune response of BALB/c mice and on horse lymph node cell proliferation. We observed that mice do not develop resistance to nymphs of this tick species and that lymphocyte proliferation of this host is inhibited by tick saliva, nymphal extract, or infestations. Horse lymph node cell proliferation is inhibited by tick saliva as well. Mice lymphocytes under the effect of tick saliva, nymphal extract, or infestations display a predominantly Th-2 cytokine production pattern. Observed results partially explain this tick's disease vectoring capacity and broad host range.

O O B I O O O B I O O O O O O O O O O O O B I O O O B I O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

amblyomma cajennense
immune response
horse


An iterative Riemann solver for systems of hyperbolic conservation laws, with application to hyperelastic solid mechanics ? In this paper, we present a general iterative method for the solution of the Riemann problem for hyperbolic systems of PDEs. The method is based on the multiple shooting method for free boundary value problems. We demonstrate the method by solving one-dimensional Riemann problems for hyperelastic solid mechanics. Even for conditions representative of routine laboratory conditions and military ballistics, dramatic differences are seen between the exact and approximate Riemann solution. The greatest discrepancy arises from misallocation of energy between compressional and thermal modes by the approximate solver, resulting in nonphysical entropy and temperature estimates. Several pathological conditions arise in common practice and modifications to the method to handle these are discussed. These include points where genuine nonlinearity is lost, degeneracies, and eigenvector deficiencies that occur upon melting.

O O B I O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

shock waves
godunov method
elasticity
hyperelasticity


An algorithm for insertion of idle time in the single-machine scheduling problem with convex cost functions This paper addresses the problem of optimally inserting idle time into a single-machine schedule when the sequence is fixed and the cost of each job is a convex function of its completion time. We propose a pseudo-polynomial time algorithm to find a solution within some tolerance of optimality in the solution space, i.e., each completion time will belong to a small time interval z within which the optimal solution lies. Letting H be the planning horizon and |J| the number of jobs, the proposed algorithm is superior to the current best algorithm in terms of time-complexity when |J|<H/z.

O O O O O B I O O O B O O B I O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

single-machine scheduling
fixed sequence
semiactive schedule


Applying multi agent techniques to reconfigurable systems This paper extends the concepts of multi agent technology to reconfigurable systemssystems in which the functionality of both the associated hardware and software can be altered some time after the system has been constructed. The utilization of this new paradigm has the potential to greatly increase the flexibility, efficiency, expandability, and maintainability of reconfigurable systems and to provide an attractive alternative to the current set of disjoint approaches that are currently applied to this problem domain. The focus of this paper is on the suitability of reconfigurable hardware to support hardware agents. We believe that such hardware agents can be used in conjunction with traditional software agents in hybrid architectures to support many of today's more complex applications. The paper introduces a general agent model that can be applied to hardware. We also show how hardware agents can be created using a conventional hardware description language that when synthesized produces synchronous and asynchronous hardware constructs.

O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O


Hydrologic connectivity between geographically isolated wetlands and surface water systems: A review of select modeling methods Hydrologic connectivity of isolated wetlands is an emerging focus for research. We review models for simulating hydrologic connectivity of isolated wetlands. Model selection for connectivity research depends upon location and model structure. Coupled surface watergroundwater models are complex yet often appropriate. Watershed and groundwater models are appropriate for specific flow regimes.

B I O B I I O O O O O O O O O O B I O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

geographically isolated wetlands
hydrologic connectivity

watershed approach
surface waters
mechanistic models


Hybrid reliable load balancing with MOSIX as middleware and its formal verification using process algebra For many years, load balancing in distributed computing environment has been researched to enhance and optimize the scalability of the entire system. Although numerous works have been proposed on the issues of process migration and load balancing, a comprehensive approach still misses out on various fronts. An effort has been made in the present work to cite a reliable and comprehensive load balancing approach for a trusted small scale distributed computing environment based on the priority of the processes. The proposed approach introduces a Process Migration Server (PMS) that also acts as future cluster management server ensuring that the latency time in migrated process execution is reduced along with no starvation policy for any process. We also propose an effective resource sharing mechanism where our system is able to distribute the load evenly among various nodes without much overhead. This in turn increases the reliability of the overall system. To verify our approach, we have implemented hybrid reliable load balancing algorithm where MOSIX is deployed as middleware and significant performance improvement has been observed. We have compared the performance of the proposed algorithm to the default MOSIX. Our results indicate that, hybrid reliable load balancing has lowered the network traffic by 80%90%, increased CPU utilization by 40%50%, with 4%9% lesser memory and computational requirement. A relationship between the formal aspect of hybrid reliable load balancing algorithm and its architectural model JMM is established through process algebra approach.

O O B I O O O O O O O O O B I O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O B I O

load balancing
process migration
process algebra

cluster computing
multilevel feedback queue scheduling
auto-configuration


Total Domination in Graphs with Diameter 2 The total domination number of a graph G is the minimum cardinality of a set S of vertices, so that every vertex of G is adjacent to a vertex in S. In this article, we determine an optimal upper bound on the total domination number of a graph with diameter 2. We show that for every graph G on n vertices with diameter 2, . This bound is optimal in the sense that given any , there exist graphs G with diameter 2 of all sufficiently large even orders n such that .

B I O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


design considerations for microprogramming languages Historically, microprograms have been developed using tools which are appropriate to logic designers (block diagrams, register transfer languages), or systems programmers (microcode assemblers). With the growth of user microprogramming, and the increased demands placed upon computer manufacturers for firmware support, improved tools and techniques have been suggested. In particular, microprogram compilers, i.e., compilers which translate high level source statements into sequences of microprogram control words, have been proposed and implemented. The larger issue to be faced is the nebulous task of supporting the needs of a community which includes: Manufacturers developing one particular computer (target machine) using microprogramming as a design and implementation technique. Manufacturers developing a computer system , integrating hardware, operating systems, and programming language support, utilizing microprogramming to tie system functions together. Users developing their own target machines tailored to applications such as computer graphics, signal processing, or interpretation of higher level languages. Users or manufacturers who utilize hardware which is microprogrammable to directly solve one or more specific problems, without formally defining a target machine (i.e., simply programming the hardware, or host machine).

O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O

user microprogramming
target machine
microprogramming languages

horizontal machines
pumpkin language
tailcred language
systems programming languages


A networks-on-chip architecture design space exploration - The LIB Many on-chip network circuit and architecture techniques are incompatible with modern design flows, making them unsuitable for use in systems-on-chip. This paper presents a networks-on-chip (NoC) architecture design space exploration method for multi-processor systems-on-chip architecture. The NoC architecture design space is designed with a Layer-Interactive-Building block (LIB) methodology that is divided into three layers: application layer, link/network layer, and physical layer. The suggested LIB design paradigmatic philosophy provides modular building block structure in both hardware and software and the protocols for their interconnection in the three architecture layers. Using LIB the designer can easily select these building blocks to build application-specific NoCs to meet different application requirements such as media, graphic, software radio and communication network applications. The LIB provides the NoC building blocks, architecture interacting systems-on-chip components, the programming models and application mapping strategies. The LIB can be used as a complementary library and tools for future on-chip interconnection network design. (C) 2008 Elsevier Ltd. All rights reserved.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

ip cores
multi-processor systems-on-chip
networks-on-chip


Finding top-\(k\, r\)-cliques for keyword search from graphs in polynomial delay Keyword search over structured data offers an alternative method to explore and query databases for users that are not familiar with the structure of the data and/or a query language. Structured data are usually modeled as graphs. In this context, an answer is a substructure of the graph that contains all or some of the query keywords. In most of the previous works, a minimal tree that covers all the query keywords are found as the answer. Some recent works offer to find subgraphs rather than minimal trees and show that subgraphs might be more informative for the users. However, current methods suffer from the following problems. Although some of the content nodes (i.e., nodes that contain input keywords) are close to each other in an answer, others might be far from each other. While searching for the best answer, current methods explore the whole graph rather than only the content nodes. This might increase the run time and leads to poor performance. To address these problems, we propose to find top-\(k\, r\)-cliques as the answers to the graph keyword search problem. An \(r\)-clique is a set of content nodes that cover all the input keywords, and the distance between each pair of nodes is less than or equal to \(r\). We propose a new weight function that is the sum of distances between each pair of content nodes. We prove that minimizing the new weight function is NP-hard and propose an approximation algorithm that produces \(r\)-cliques with 2-approximation ratio in polynomial delay. We further improve the run time of the approximation algorithm with the cost of increasing the approximation ratio. Extensive performance studies using three large real datasets confirm the efficiency and accuracy of finding \(r\)-cliques in graphs.

O O O O B I O O O B I B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O B I O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O

keyword search
polynomial delay
approximation algorithm


Market reactions to information security breach announcements: An empirical analysis Losses due to information security breaches are notoriously difficult to measure. An event study of the effect of such breaches on financial performance found that they do not earn significantly negative abnormal returns. To verify whether this finding resulted from the aggregation of data across different characteristics (e.g., the nature of the breaches, the types of firms, the time periods of the study) the impact of each characteristic was analyzed. Again the results were not significantly negative. The study found that a negative bias followed the events of September 11, 2001. It also found that there was a difference in investor reactions to events during the dot-com era, when firms earned higher negative abnormal returns, and after the dot-com era. The implications are discussed.

O O O B I O O O O O O O O B I O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


distributed system v ipc in locus: a design and implementation retrospective This paper describes new interprocess communications facilities that have been added to the Locus system [POPEK 81][WALKER 83]. The facilities improve Locus's interprocess communication repertoire by providing distributed support for three separate subsystems from System V UNIX: messages, semaphores , and shared memory . Here we describe these subsystems and their integration into in the Locus architecture.

B O O O O O O B O B O O B O O O O O O O O O O O O O O O O O O O O O B O O O B B O O O O O O O O O O O O O O O O O O O O O O O O O O O B

communication implementation support distributed paper architecture design

systems
distributed systems
integrability


Efficient steady-state analysis of second-order fluid stochastic Petri nets This paper presents an efficient solution technique for the steady-state analysis of the second-order stochastic fluid model underlying a second-order fluid stochastic Petri net (FSPN) with constant flow and transition rates, and a single bounded fluid place. The new solution technique is an extension of existing solution techniques developed for (first-order) Fluid Models; the solution algorithm uses upwind semi-discretization and Matrix Geometric techniques to efficiently compute the steady-state probabilities of the mixed discrete and continuous state space of the model. The effectiveness of our technique is proven first on a simple producerconsumer second-order FSPN model and then on a complex example taken from the literature where the analysis of the completion time distribution and the packet loss probability of short-lived TCP connections is investigated through the decomposition of a model for the whole system into several (simpler) sub-models; the interaction between the different sub-models is handled by iterating their solution until the complete model solution converges according to a fixed point algorithm. The introduction of a second-order FSPN in a fixed point iteration scheme has been made possible thanks to the efficiency of the proposed solution technique.

O O O O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

fluid stochastic petri nets
matrix geometric
tcp


Modalities of Gene Action Predicted by the Classical Evolutionary Biological Theory of Aging What might now be referred to as the classical evolutionary biological theory of why we age has had a number of serious challenges in recent years. While the theory might therefore have to be modified under certain circumstances, in the author's opinion, it still provides the soundest theoretical basis for thinking about how we age. Nine modalities of gene action that have the potential to modulate processes of aging are reviewed, including the two most widely reviewed and accepted concepts (antagonistic pleiotropy and mutation accumulation). While several of these nine mechanisms can be regarded as derivatives of the antagonistic pleiotropic concept, they frame more specific questions for future research. Such research should pursue what appears to be the dominant factor in the determination of intraspecific variations in longevitystochastic mechanisms, most likely based upon epigenetics. This contrasts with the dominant factor in the determination of interspecific variations in longevitythe constitutional genome, most likely based upon variations in regulatory loci

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O

evolutionary biology of aging
longevity assurance
adaptive silencing
adaptive expression
nonadaptive loss of silencing
nonadaptive loss of expression
somatic mutation
paradoxical antagonistic pleiotropy
late-acting constitutional mutations
stochastics


Design and analysis of slot antenna with band notch function In this article, the design, simulation, and construction of a novel wide rectangular slot antenna fed by a 50 ? coplanar waveguide (CPW) are presented and investigated for multifunctional communication systems. The physical dimension of the antenna is 29 mm (length) 32 mm (width) 1.6 mm (thickness). Detailed simulations and experimental investigations are performed to understand its behavior and to optimize for 2.4 GHz wireless local area network (WLAN) and ultra wideband (UWB) operations. The proposed slot antenna is etched on an FR4 substrate with a thickness of 1.6 mm and relative permittivity of 4.4. To improve the impedance matching, a stepped stub structure with CPW feed technique is used. According to the measured results, the proposed antenna has a large bandwidth from 2.1 to 11.6 GHz for voltage standing wave ratio (VSWR) less than 2, totally satisfying the requirement of 2.4 GHz WLAN and UWB systems, while providing the required band notch function from 5.1 to 5.9 GHz. The study of time domain characteristics and surface current distributions also indicate the band-notched function of the antenna. The radiation patterns display nearly omnidirectional performance and the antenna gain is stable except for the rejected frequency band (5.15.9 GHz). Moreover, group delays are within 1.5 ns except for the notch-band. It is observed that the simulated and experimental results have good agreement with each other. 2012 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2012.

O O O O B I O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

multifunctional communication systems
slot antenna

stepped stub structure and notch-band function


dynamic memory balancing for virtual machines Virtualization essentially enables multiple operating systems and applications to run on one physical computer by multiplexing hardware resources. A key motivation for applying virtualization is to improve hardware resource utilization while maintaining reasonable quality of service. However, such a goal cannot be achieved without efficient resource management. Though most physical resources, such as processor cores and I/O devices, are shared among virtual machines using time slicing and can be scheduled flexibly based on priority, allocating an appropriate amount of main memory to virtual machines is more challenging. Different applications have different memory requirements. Even a single application shows varied working set sizes during its execution. An optimal memory management strategy under a virtualized environment thus needs to dynamically adjust memory allocation for each virtual machine, which further requires a prediction model that forecasts its host physical memory needs on the fly. This paper introduces MEmory Balancer (MEB) which dynamically monitors the memory usage of each virtual machine, accurately predicts its memory needs, and periodically reallocates host memory. MEB uses two effective memory predictors which, respectively, estimate the amount of memory available for reclaiming without a notable performance drop, and additional memory required for reducing the virtual machine paging penalty. Our experimental results show that our prediction schemes yield high accuracy and low overhead. Furthermore, the overall system throughput can be significantly improved with MEB.

O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O


Efficiency

enhancement

in

blue

organic

light

emitting

diodes

with

a

composite

hole

transport

layer

based

on

poly(ethylenedioxythiophene):poly(styrenesulfonate)

doped

with

nanoparticles

Polyfluorene

based

blue

OLEDs

with

polymer

nano-composite

HTL

have

been

fabricated.

Significant

enhancement

in

blue

peak

at

of

polyfluorene

has

been

observed.

The

turn

on

voltage

of

the

device

has

also

been

found

to

improve

significantly.

The

concentration

of

nanoparticles

in

the

HTL

has

been

optimized.

O O O O O O O O O O O O O O O O O O O O O B O O O O B I O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O

blue oled
titanium oxide nanoparticles
pedot:pss


Quantum decoys Alice communicates with words drawn uniformly amongst {vertical bar j)}(j=l)... n, the canonical orthonormal basis. Sometimes however, Alice interleaves quantum decoys {GRAPHICS} between her messages. Such pairwise superpositions of possible words cannot be distinguished from the message words. Thus as malevolent Eve observes the quantum channel, she runs the risk of damaging the superpositions (by causing a collapse). At the receiving end honest Bob, whom we assume is warned of the quantum decoys' distribution, checks upon their integrity with a measurement. The present work establishes, in the case of individual attacks, the tradeoff between Eve's information gain (her chances, if a message word was sent, of guessing which) and the disturbance she induces (Bob's chances, if a quantum decoy was sent, to detect tampering). Whilst not directly applicable to secure channel protocols, quantum decoys seem a powerful primitive for constructing other n-dimensional quantum cryptographic applications. Moreover, the methods employed in this article should be of strong interest to anyone concerned with the old but fundamental problem of how much information may be gained about a system, versus how much this will disturb the system, in quantum mechanics.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Combining intensification and diversification strategies in VNS. An application to the Vertex Separation problem The Vertex Separation problem (VSP) is an NP-hard problem with practical applications in VLSI design, graph drawing and computer language compiler design. VSP belongs to a family of optimization problems in which the objective is to find the best separator of vertices or edges in a generic graph. In this paper, we propose different heuristic methods and embed them into a Variable Neighborhood Search scheme to solve this problem. More precisely, we propose (i) a constructive algorithm, (ii) four shake procedures, (iii) two neighborhood structures, (iv) efficient algorithmic strategies to explore them, (v) an extended version of the objective function to facilitate the search process and finally, (vi) we embed these strategies in a Reduced Variable Neighborhood Search (RVNS), a Variable Neighborhood Descent (VND) and a General Variable Neighborhood Search (GVNS). Additionally, we provide an extensive experimental comparison among them and with the best previous method of the literature. We consider three different benchmarks, totalizing 162 representative instances. The experimentation reveals that our best procedure (GVNS) improves the state of the art in both quality and computing time. This fact is confirmed by non-parametric statistical tests. In addition, when considering only the largest instances, the other two proposed variants (RVNS and VND) also obtain statistically significant differences with respect to the best previous method identified in the state of the art.

O B O B O O O O O O O B I I O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

intensification
diversification
variable neighborhood search
vertex separation problem

combinatorial optimization
layout problems


Automatic polynomial wavelet regression In Oh, Naveau and Lee (2001) a simple method is proposed for reducing the bias at the boundaries for wavelet thresholding regression. The idea is to model the regression function as a sum of wavelet basis functions and a low-order polynomial. The latter is expected to account for the boundary problem. Practical implementation of this method requires the choice of the order of the low-order polynomial, as well as the wavelet thresholding value. This paper proposes two automatic methods for making such choices. Finite sample performances of these two methods are evaluated via numerical experiments.

O B I I O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O

polynomial wavelet regression
wavelet thresholding

boundary adjustment
bayesian information criterion
empirical bayes
stein's unbiased risk estimation


On the Numbers of Products in Prefix SOPs for Interval Functions First, this paper derives the prefix sum-of-products expression (PreSOP) and the number of products in a PreSOP for an interval function. Second, it derives Psi(n, tau(p)), the number of n-variable interval functions that can be represented with tau(p) products. Finally, it shows that more than 99.9% of the n-variable interval functions can be represented with [3/2n - 1] products, when n is sufficiently large. These results are useful for a fast PreSOP generator and for estimating the size of ternary content addressable memories (TCAMs) for packet classification.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

prefix sum-of-products
number of products by presop
distribution of interval functions
estimating the size of tcam


Stability of mixed additivequadratic Jensen type functional equation in various spaces ? In this paper, we prove the generalized HyersUlam stability of the following mixed additivequadratic functional equation:

O O O O O O O O O O O O O O O O O O B I I O O O O O O O

random normed space
non-archimedean normed spaces
fixed point method


Deflating the big bang: Fast and scalable deep packet inspection with extended finite automata Deep packet inspection is playing an increasingly important role in the design of novel network services. Regular expressions are the language of choice for writing signatures, but standard DFA or NFA representations are unsuitable for high-speed environments, requiring too much memory, too much time, or too much per-flow state. DFAs are fast and can be readily combined, but doing so often leads to state-space explosion. NFAs, while small, require large per-flow state and are slow. We propose a solution that simultaneously addresses all these problems. We start with a first-principles characterization of state-space explosion and give conditions that eliminate it when satisfied. We show how auxiliary variables can be used to transform automata so that they satisfy these conditions, which we codify in a formal model that augments DFAs with auxiliary variables and simple instructions for manipulating them. Building on this model, we present techniques, inspired by principles used in compiler optimization, that systematically reduce runtime and per-flow state. In our experiments, signature sets from Snort and Cisco Systems achieve state-space reductions of over four orders of magnitude, per-flow state reductions of up to a factor of six, and runtimes that approach DFAs.

O O O O O O O B I I O O O O B I I O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

regular expressions
deep packet inspection

algorithms
performance
security
signature matching
xfa


Blind Symbol Timing Estimation for Orthogonal Frequency Division Multiplexing Based on Non-Gaussianity Maximization This paper proposes a blind symbol timing estimator for orthogonal frequency-division multiplexing (OFDM) systems. The basic idea lies in that compared to the scenarios with timing offsets, the distribution of the received signal within one OFDM symbol in the frequency domain is less Gaussian when the start of the discrete Fourier transform window is locked into the safe region. Thus via minimizing the kurtosis employed to measure the non-Gaussianity, the symbol timing estimation is achieved. A two-step implementation is introduced to balance between the estimation accuracy and computational complexity. It is proved that this estimator is also applicable in multiple-input multiple-output systems, including multiplexing- and diversity-based configurations. Numerical simulation is carried out to confirm the effectiveness of the proposed method and give the performance comparison with existing blind schemes in terms of the probability of lock-in and bit-error rate.

O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

symbol timing offset
non-gaussianity
blind estimation


Adaptive model-based speech enhancement ? We investigate the enhancement of speech corrupted by unknown independent additive noise when only a single microphone is available. We present adaptive enhancement systems based on an existing non-adaptive technique [Ephraim, Y., 19992a. IEEE Transactions on Signal Processing 40 (4), 725735]. This approach models the speech and noise statistics using autoregressive hidden Markov models (AR-HMMs). We develop two main extensions. The first estimates the noise statistics from detected pauses. The second forms maximum likelihood (ML) estimates of the unknown noise parameters using the whole utterance. Both techniques operate within the AR-HMM framework. We have previously shown that the ability of AR-HMMs to model speech can be improved by the incorporation of perceptual frequency using the bilinear transform. We incorporate this improvement into our enhancement systems. We evaluate our techniques on the NOISEX-92 and Resource Management (RM) databases, giving indications of performance on simple and more complex tasks, respectively. Both enhancement schemes proposed are able to improve substantially on baseline results. The technique of forming ML estimates of the noise parameters is found to be the most effective. Its performance is evaluated over a wide range of noise conditions ranging from ?6 to 18 dB and on various types of stationary real-world noises.

O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

speech enhancement
autoregressive hidden markov models


A behavioral multi-agent model for road traffic simulation Multi-agent systems allow the simulation of complex phenomena that cannot easily be described analytically. Multi-agent approaches are often based on coordinating agents whose actions and interactions are related to the emergence of the phenomenon to be simulated. In this article, we focus on road traffic simulation, specifically the design of a road traffic simulation tool able to deal realistically with road junctions. We propose a multi-agent behavioral model based on (i) the opportunistic individual behaviors that describe the norm violation and (ii) the anticipatory individual abilities of simulated drivers that allow critical situations to be detected. Our proposition has been validated for different traffic scenarios. Specifically, we simulated the traffic in a real intersection and then compared the simulated traffic flow with the real flow to highlight the relevance of our approach.

O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

multi-agent system
coordination
anticipatory model


Ontologies of geographic information This article explores the notion of a system of ontologies specifically designed for the needs of an information science. A framework for geographic information ontologies is outlined that focuses on geographic information constructs rather than on the direct representation of real-world entities or on linguistic terms. The framework takes the form of a generative hierarchy anchored by the notion of intentionality at one end and of a spatiotemporal field of potentially relevant information at the other. Two theoretical notions are used in the generation of the hierarchy. The first is the principle of semantic contraction, whereby, starting from a level of geographic information constructs specified so as to reflect user intentionality, semantically coherent domains of properties are removed over several steps until only the rudiments of a spatiotemporal information system are left. The second notion is that of object of discourse, which allows entities to be represented as the composites of geographic information constructs at the higher levels of the hierarchy, explicitly reflecting the connections between the purpose, function, appropriate internal constitution, and ensuing categorization of the entities represented. The framework's main contribution is thus twofold: first, it allows the notions of user purpose and object function to be directly built into geographic representations; second, it proposes a hierarchy of ontological levels that are linked by systematic semantic relations. Further, the framework presents an integrated view of object and field representations. It may also provide a novel perspective on a number of issues of ongoing interest in geographic information science.

O O O B O O O O O O O O O O O O O O O O O B O O O O O B O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O B I I O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O

information
object of discourse
user purpose


An alternate approach for modelling of transient vaporous cavitation Simulation of cavitating flow has been a thrust area of research for long period due to its practical and economic importance. The major hurdle in developing a numerical model for such flows is the difficulty in representing the quick phase changes, in general, and the alternate change of flow from single phase to two phase and back, in particular. In this case, instability due to sharp variation of flow characteristics also restricts the development of numerical models. The present study demonstrates the use of a relatively simple formulation for the analysis of flow characteristics in a quasi-rigid pipeline under abrupt phase changes due to cavitation. A popular scheme MacCormack scheme was used for developing a numerical solution for this problem. It uses the conservative form of the governing equations, viz, conservation of mass and momentum, the transport equation and the constitutive relationship. The model can handle variable properties of the water vapour mixture, which is highly compressible. A newly introduced pressure under-relaxation method overcomes the numerical instability due to sharp variation of flow characteristics during phase change. The model could predict the instant of occurrence of vapour pressure, duration of persistence of vapour pressure and the rise of pressure due to vapour collapse to satisfactory levels with published data and experimental results. Copyright (C) 2009 John Wiley & Sons, Ltd.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O

transient cavitation
compressibility
variable wave speed
pressure under relaxation


Biodiesel production control using PNN and Coriolis flowmeter In order to complete the transesterification process, online result verification is applied to the traditional offline verification process based on chromatographic methods. There is a quick analytical method for assessing the biodiesel content of transesterification reaction by applying a correlation with viscosity. The results can substitute chromatographic verifications when recognizing and selecting the specified biodiesel quality. This type of verification could save hours of biodiesel process production per day. The proposed work designs a control solution for online biodiesel production verification using an online application based on the PNN technology and Coriolis viscosity sensors.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

intelligent control
neural networks
digital computer applications
fuel control
industrial production systems


Machine performance degradation assessment and remaining useful life prediction using proportional hazard model and support vector machine Machine performance degradation assessment and remaining useful life (RUL) prediction are of crucial importance in condition-based maintenance to reduce the maintenance cost and improve the reliability. They provide a potent tool for operators in decision-making by specifying the present machine state and estimating the remaining time. For this ultimate purpose, a three-stage method for assessing the machine health degradation and forecasting the RUL is proposed. In the first stage, only the normal operating condition of machine is used to create identification model for recognizing the dynamic system behavior. Degradation index which is used for indicating the machine degradation is subsequently created based on the root mean square of residual errors. These errors are the difference between identification model and behavior of system. In the second stage, the Coxs proportional hazard model is generated to estimate the survival function of the system. In the last stage, support vector machine, which is one of the remarkable machine learning techniques, in association with time-series techniques is utilized to forecast the RUL. The data of low methane compressor acquired from condition monitoring routine is used for validating the proposed method. The result shows that the proposed method could be used as a reliable tool to machine prognostics.

O B I O O B I I O O B I I O O O O O B I O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B

prognostics
performance degradation
remaining useful life
proportional hazard model


Fast algorithms for uniform semi-unification Uniform semi-unification is a simple combination of matching and unification defined as follows: given two terms s and t, do there exist substitutions ? and ? such that s??=t?? We present two algorithms for this problem based on Huets unification closure method, one producing (possibly) non-principal solutions, and one producing principal solutions. For both we provide a precise analysis of correctness and asymptotic complexity. Under the uniform cost RAM model (counting assignment, comparison, and arithmetic operations as primitive) our first algorithm is asymptotically as fast as Huets method, O(n?(n)), where ? is the functional inverse of Ackermanns function. Under a model which counts assignments and comparisons of pointers, and arithmetic operations on bits, the cost is O(n2?(n)2). Producing principal solutions is more complex, however, and our second algorithm runs in O(n2?(n)2) and under these two models.

O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Evaluating motion graphs for character animation Realistic and directable humanlike characters are an ongoing goal in animation. Motion graph data structures hold much promise for achieving this goal; however, the quality of the results obtainable from a motion graph may not be easy to predict from its input motion clips. This article describes a method for using task-based metrics to evaluate the capability of a motion graph to create the set of animations required by a particular application. We examine this capability for typical motion graphs across a range of tasks and environments. We find that motion graph capability degrades rapidly with increases in the complexity of the target environment or required tasks, and that addressing deficiencies in a brute-force manner tends to lead to large, unwieldy motion graphs. The results of this method can be used to evaluate the extent to which a motion graph will fulfill the requirements of a particular application, lessening the risk of the data structure performing poorly at an inopportune moment. The method can also be used to characterize the deficiencies of motion graphs whose performance will not be sufficient, and to evaluate the relative effectiveness of different options for improving those motion graphs.

O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O B I

experimentation
measurement
reliability
motion capability
capability metrics
motion capture
human motion
motion graph embedding
editing model


improving identifier informativeness using part of speech information Recent software development tools have exploited the mining of natural language information found within software and its supporting documentation. To make the most of this information, researchers have drawn upon the work of the natural language processing community for tools and techniques. One such tool provides part-of-speech information, which finds application in improving the searching of software repositories and extracting domain information found in identifiers. Unfortunately, the natural language found is software differs from that found in standard prose. This difference potentially limits the effectiveness of off-the-shelf tools. An empirical investigation finds that with minimal guidance an existing tagger was correct 88\% of the time when tagging the words found in source code identifiers. The investigation then uses the improved part-of-speech information to tag a large corpus of over 145,000 structure-field names. From patterns in the tags several rules emerge that seek to understand past usage and to improve future naming.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

identifier analysis
program comprehension


Modelling ECT effects by connectivity changes in cortical neural networks Biomathematical methods were applied to investigate how cortical neurodynamics depends on network connectivity. In particular, we study changes in the EEG pattern of depressed patients, following electroconvulsive therapy (ECT). The aim is to gain a better understanding of the neural mechanisms responsible for these changes, which include clear phase shifts in the EEG dynamics. This understanding is intended to provide clinical guidance in predicting ECT dose and response in depressed patients.

O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O

clinical data
neo-cortical network
fitzhughnagumo neurons


Color Interpolation Algorithms in Visualizing Results of Numerical Simulations The paper addresses the application of graphical replenishment (GR) color interpolation algorithms for visualizing numerical simulation of physical processes in order to enhance the information density of the graphic interpretation of these processes. The GR algorithms presented here may be successfully applied to two- and three-dimensional grids, and grids of various structures.

B I O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

graphic replenishment
finite differences


ADAPTIVE FILTERING AND RANDOM VARIABLES COEFFICIENT FOR ANALYZING FUNCTIONAL MAGNETIC RESONANCE IMAGING DATA Functional magnetic resonance imaging (fMRI) is used to study brain functional connectivity (FC) after filtering the physiological noise (PN). Herein, we employ: adaptive filtering for removing nonstationary PN; random variables (RV) coefficient for FC analysis. Comparisons with standard techniques were performed by quantifying PN filtering and FC in neural vs. non-neural regions. As a result, adaptive filtering plus RV coefficient showed a greater suppression of PN and higher connectivity in neural regions, representing a novel effective approach to analyze fMRI data.

B I O O O O O O O O O O O O O O O B O O O O O B I O O O O B I O O O O B I O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O B I O B I O O O O O O O O O O O O O O O O O O O B O

adaptive filtering
fmri
functional connectivity
physiological noise
rv coefficient

nonstationarity test
principal component analysis
resting state


A scalable peer-to-peer architecture for distributed information monitoring applications We present PeerCQ, a decentralized architecture for Internet scale information monitoring using a network of heterogeneous peer nodes. PeerCQ uses Continual Queries ( CQs) as its primitives to express information-monitoring requests. The PeerCQ development has three unique characteristics. First, we develop a systematic and serverless approach to large scale information monitoring, aiming at providing a fully distributed, highly scalable, and self-configurable architecture for scalable and reliable processing of a large number of CQs over a network of loosely coupled, heterogeneous, and possibly unreliable nodes ( peers). Second, we introduce an effective service partitioning scheme at the P2P protocol layer to distribute the processing of CQs over a peer-to-peer information monitoring overlay network while maintaining a good balance between system utilization and load balance in the presence of peer joins, departures, and failures. A unique feature of our service partitioning scheme is its ability to incorporate strategies for handling hot spot monitoring requests and peer heterogeneity into the load balancing scheme in PeerCQ. Third, but not least, we develop a dynamic passive replication scheme to enable reliable processing of long-running information monitoring requests in an environment of inherently unreliable peers, including an analytical model to discuss its fault tolerance properties. We report a set of experiments demonstrating the feasibility and the effectiveness of the PeerCQ approach to large-scale peer-to-peer information monitoring.

O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

peer-to-peer networks
continual query systems


Two-level mortar domain decomposition preconditioners for heterogeneous elliptic problems We use nonoverlapping domain decomposition for mixed method approximations. We propose a two-level preconditioner based on the interfaces between subdomains. The coarse preconditioner uses the multiscale mortar domain decomposition method. Prolongation is defined uniquely to preserve projection onto normal velocities. Numerical tests of highly heterogeneous porous media show efficiency and robustness.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


self-configuring crossover Crossover is a core genetic operator in many evolutionary algorithms (EAs). The performance of such EAs on a given problem is dependent on properly configuring crossover. A small set of common crossover operators is used in the vast majority of EAs, typically fixed for the entire evolutionary run. Selecting which crossover operator to use and tuning its associated parameters to obtain acceptable performance on a specific problem often is a time consuming manual process. Even then a custom crossover operator may be required to achieve optimal performance. Finally, the best crossover configuration may be dependent on the state of the evolutionary run. This paper introduces the Self-Configuring Crossover operator encoded with linear genetic programming which addresses these shortcomings while relieving the user from the burden of crossover configuration. To demonstrate its general applicability, the novel crossover operator was applied without any problem specific tuning. Results are presented showing it to outperform the traditional crossover operators arithmetic crossover , uniform crossover , and n-point crossover on the Rosenbrock, Rastrigin, Offset Rastrigin, DTrap, and NK Landscapes benchmark problems.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

self-configuration
dynamic crossover
parameter control


Some ideas for bias and variance reduction in the splitting algorithm for diffusion processes Proposition of bias and variance reduction approaches in the splitting algorithm for Markov processes. Bias reduction in splitting using a deformation of the intermediate splitting regions. Optimal splitting region estimation based on a partial differential equation approach or discretization of the state space of the process.

O O O B O B O O O B I O O O O O B O B O O O O B I O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

markov process
rare event estimation
stochastic differential equation


A RELATED-KEY ATTACK ON ITERATED CHAOTIC CIPHERS In this paper, we present a new type of attack on iterated chaotic ciphers using related keys. Based on the fact that a chaotic sequence is not sensitive to the less significant bits of initial conditions and parameters, a divide-and-conquer attack on iterated chaotic ciphers was presented by us before, which significantly reduces the computing complexity of attacks. However, if the information leaked is significant according to the distribution of the coincidence degrees, a measure for the information leakage of chaotic ciphers, or the size of the key is large, then it is difficult for the divide-and-conquer attack to reduce its computing complexity into a realizable level. The related-key attack we present in this paper simultaneously uses the information leaked from different chaotic sequences generated by related keys and combines the ideas of linear cryptanalysis and divide-andconquer attack together, hence greatly enhances the efficiency of divide-and-conquer attack. As an example, we test the related-key attack on the ZLL chaotic cipher with a 64-bit key on a Pentium IV 2.5 GHz PC, which takes only 8 minutes and 45 seconds to recover all bits of the key successfully.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O

related-key attack
zll chaotic cipher
divide-and-conquer attack
known plaintexts attack


Estimation of the quasi-linear viscoelastic parameters using a genetic algorithm The quasi-linear viscoelastic (QLV) theory of Fung has been widely used for the modeling of viscoelastic properties of soft tissues. The essence of Fung's approach is that the stress relaxation can be expressed in terms of the instantaneous elastic response and the reduced relaxation function. Using the Boltzmann superposition principle, the constitutive equation can be written as a convolution integral of the strain history and reduced relaxation function. In the appropriate models, QLV theory usually consists of five material parameters (two for the elastic response and three for the reduced relaxation function), which must be determined experimentally. However, to be consistent with the assumptions of QLV theory, the material functions should be obtained based on a step change in strain which is not possible to be performed experimentally. It is known that this may result in regression algorithms that converge poorly and yield non-unique solutions with highly variable constants, especially for long ramp times. In this paper, we use the genetic algorithm approach, which is an adaptive heuristic search algorithm premised on the evolutionary ideas of natural selection and genetics, and simultaneously fit the ramping and relaxation experimental data (on ligaments) to the QLV constitutive equation to obtain the material parameters. (c) 2007 Elsevier Ltd. All rights reserved.

O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O

biomechanics
viscoelasticity
mathematical modeling


Numerical simulation on snow melting phenomena by CIP method A numerical scheme based on the C-CUP method to simulate melting phenomena in snow is proposed. To calculate these complex phenomena we introduce the phase change, elastic-plastic model, porous model, and verify each model by using some simple examples. This scheme is applied to a practical model, such as the snow piled on the insulator of electrical transmission line, in which snow is modeled as a compound material composed of air, water, and ice, and is calculated by elastic-plastic model. The electric field between two electrodes is solved by the Poisson equation giving the Joule heating in the energy conservation that eventually leads to snow melting. Comparison is made by changing the fi action of water in the snow to see its effect on melting process for the cases of applied voltage of 50 and 500 kV on the two electrodes. (C) 2001 Elsevier Science B.V. All rights reserved.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

cip (cubic-interpolated propagation) method snow melting


A two-scale micromechanical model for aluminium foam based on results from nanoindentation Using a bottom-up approach for prediction of effective properties via a multi-scale model. Employing several advanced methods (e.g. nanoindentation, FFT-based homogenization) for the analysis. Application of the methodology to the microscopically inhomogeneous and highly porous material. Reduction of the foam geometrical complexity in the model. Verification of the proposed model by experiments.

O O O O O B I O O O O B O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

multi-scale model
statistical deconvolution
elastic properties
image analysis


a key-management scheme for distributed sensor networks Distributed Sensor Networks (DSNs) are ad-hoc mobile networks that include sensor nodes with limited computation and communication capabilities. DSNs are dynamic in the sense that they allow addition and deletion of sensor nodes after deployment to grow the network or replace failing and unreliable nodes. DSNs may be deployed in hostile areas where communication is monitored and nodes are subject to capture and surreptitious use by an adversary. Hence DSNs require cryptographic protection of communications, sensor-capture detection, key revocation and sensor disabling. In this paper, we present a key-management scheme designed to satisfy both operational and security requirements of DSNs. The scheme includes selective distribution and revocation of keys to sensor nodes as well as node re-keying without substantial computation and communication capabilities. It relies on probabilistic key sharing among the nodes of a random graph and uses simple protocols for shared-key discovery and path-key establishment, and for key revocation, re-keying, and incremental addition of nodes. The security and network connectivity characteristics supported by the key-management scheme are discussed and simulation experiments presented.

O O B O B B O B B O O O O O O O O B O O O B O B B O O B O O O O O O O O O O B O O B O O O B O O O O O O O O O O O O O O B O O O O O O O O O O B O O O O O O O B O O O B O B O B O O O B O O O O B O O O O O O O B O O O B O O O O B O O O B O O O O O O O O B O B B O O O B I I O O O O O O O O O O O O O O O O O O O O B O O B O O O O O O B O O O O O O B O O O B O O

communication
network
requirements
sensor
use
simulation
protection
probabilistic key sharing
computation
revocation
paper
incremental
detection
capabilities
dynamic
deployment
distributed
scheme

sensor networks
experience
key management
mobile network
select
sharing
discoveries
secure
connection
random graphs
ad-hoc


time constraints in mixed multi-unit combinatorial auctions We extend the framework of mixed multi-unit combinatorial auctions, which deals with transformations of goods rather than only with atomic goods, by allowing time constraints in the bids offering these transformations. This way, bidders can express their scheduling preferences, while previously the auctioneer alone could decide the order of transformations.

O O O O O B I O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


An algorithm for solving the obstacle problems In this paper, we propose an algorithm for solving the obstacle problem. We try to find the approximated region of the contact in the obstacle problem by iteration. Numerical examples are given for the obstacle problem for a membrane and the elastic-plastic torsion problem. (C) 2004 Elsevier Ltd. All rights reserved.

O B O O O O O O O O O O O B O O B I I O O O O O O O O O O O B I I O O O O O O O B I I O O O O O O O O O O O O O O O


Two statistical particle split and merge methods for Particle-in-Cell codes Two new particle split and merge methods are presented for electromagnetic Particle-in-Cell codes. They are based on a statistical approach and are designed to conserve mass, momentum and energy. In addition, the correct spatial resolution of these values and the velocity distribution functions are reproduced. It is shown that charge and current densities before and after splitting and merging are in a good agreement. Furthermore, the reconstruction of the velocity distribution function is demonstrated. The new methods may lead to significantly reduced computational effort and memory consumptions which are exemplarily demonstrated by the 3D simulation of a streamer discharge formation.

O O B I I I O O O O O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

particle coalescing
particle in cell
variable particle weights


DSD: Maintain data cubes more efficiently A well-known challenge in data warehousing is the efficient incremental maintenance of data cube in the presence of source data updates. In this paper, we present a new incremental maintenance algorithm, DSD, developed from Mumick's algorithm. Instead of using one auxiliary delta table, we use two tables to improve efficiency of data update. Moreover, when a materialized view has to be recomputed, we use its smallest ancestral view's data, while Mumick uses the fact table which is usually much lager than its smallest ancestor. We have implemented DSD algorithm and found that its performance shows a significant improvement.

O O O O O O O O O O B I O O O B I O B I O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

data warehousing
data cube
incremental maintenance


The X-mu representation of fuzzy sets Fuzzy sets are a good model of the flexible definitions used in human language, but do not always give results in accordance with human reasoning. One reason is that operations on fuzzy sets do not obey all identities from crisp set algebra, such as the law of the excluded middle. Additionally, when used to represent fuzzy numbers they lead to a generalised interval arithmetic rather than a fuzzy version of standard arithmetic. In this paper, we outline the \(X\hbox {-}\mu \) approach, a new method of representing, visualizing and calculating functions of fuzzy values. This fuzzy representation retains standard Boolean operations and leads to standard arithmetic when applied to numerical quantities. It includes the idea of strict fuzzy values, which do not incorporate set or interval-based uncertainty. Using simple examples, we illustrate the \(X\hbox {-}\mu \) approach and outline the notion of a strict fuzzy value.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O

\(x\hbox {-}mu\) representation
fuzzy excluded middle
gradual elements