heuristic approach for generic audio data segmentation and annotation A real-time audio segmentation and indexing scheme is presented in this paper. Audio recordings are segmented and classified into basic audio types such as silence, speech, music, song, environmental sound, speech with the music background, environmental sound with the music background, etc. Simple audio features such as the energy function, the average zero-crossing rate, the fundamental frequency, and the spectral peak track are adopted in this system to ensure on-line processing. Morphological and statistical analysis for temporal curves of these features are performed to show differences among different types of audio. A heuristic rule-based procedure is then developed to segment and classify audio signals by using these features. The proposed approach is generic and model free. It can be applied to almost any content-based audio management system. It is shown that the proposed scheme achieves an accuracy rate of more than 90\% for audio classification. Examples for segmentation and indexing of accompanying audio signals in movies and video programs are also provided.

O O O B B B B O B O O B I I I B O O O O B B O O O O O O O B B O O O B B O O B B O O B O O B O O B O O O B 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 B I O B O O O O O O O O O O O B O B O O O O O O O O O O O B O O O O O O O O O B O B O O O O O O O O O B B O O O O O O O B O O B O O O O O O B B B O B O B O O B O O O O B O O O O

speech
video
examples
music
audio segmentation and indexing
temporal
model
paper
statistical analysis
audio
management
classification
indexing
sound
accuracy
types
energy
annotation
segmentation
data
scheme
generic

signaling
audio database management
audio content anlaysis
real-time
heuristic rules
records
program
contention
systems
functional
process
tracking
heuristics
classifiation
feature


Fast exponentials Representations of 2(x) by means of first and third degree polynomials yield e(x) values to 6-12 and 13-15 significant figures, respectively. The full range of arguments is reached through a set of precalculated values of 2(a). A Fortran implementation is shown to be much faster than the intrinsic exp function of several Fortran mathematical libraries. (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

benchmark exponential
fortran intrinsic function
mathematical library


Particle swarm optimization with query-based learning for multi-objective power contract problem Particle swarm optimization (PSO) is one of the most important research topics on swarm intelligence. Existing PSO techniques, however, still contain some significant disadvantages. In this paper, we present a new QBL-PSO algorithm that uses QBL (query-based learning) to improve both the exploratory and exploitable capabilities of PSO. Here, we apply a QBL method proposed in our previous research to PSO, and then test this new algorithm on a real case study on problems of power conservation. Our algorithm not only broadens the search diversity of PSO, but also improves its precision. Conventional PSO often snag on local solutions when performing queries, instead of finding better global solutions. To resolve this limitation, when particles converge in nature, we direct some of them into an ambiguous solution space defined by our algorithm. This paper introduces two ways to invoke this QBL algorithm. Our experimental results confirm that the proposed method attains better convergence to the global best solution. Finally, we present a new PSO model for solving multi-objective power conservation problems. Overall, this model successfully reduces power consumption, and to our knowledge, this paper represents the first attempt within the literature to apply the QBL concept to PSO.

B I I O O O O O B 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 swarm optimization
power contract

query-based learning
multi-objective optimization


improving round-trip time estimates in reliable transport protocols As a reliable, end-to-end transport protocol, the ARPA Transmission Control Protocol (TCP) uses positive acknowledgements and retransmission to guarantee delivery. TCP implementations are expected to measure and adapt to changing network propagation delays so that its retransmission behavior balances user throughput and network efficiency. However, TCP suffers from a problem we call retransmission ambiguity : when an acknowledgement arrives for a segment that has been retransmitted, there is no indication which transmission is being acknowledged. Many existing TCP implementations do not handle this problem correctly. This paper reviews the various approaches to retransmission and presents a novel and effective approach to the retransmission ambiguity problem.

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


Simulation of a storm sewer network in industrial area: Comparison between models calibrated through experimental data The purpose of this article is to test the performance of two commercial models for the simulation of sewer systems (InfoWorks, developed by Wallingford Ltd and Mouse, developed by DHI), basing on the experimental data sampled in a 1.15ha watershed located near Bologna, Italy. The experimental catchment is part of a truck transit and parking area, completely asphalt paved and drained into a first flush tank. Hydrologic and water quality data collected for almost 8 months inside the tank have been used to calibrate the models through a trial and error procedure for both quantity and quality aspects. A sensitivity analysis for the most relevant qualityquantity parameters has also been performed, testing therefore the behaviour of these models in a small impervious watershed and their reliability as a support tool in the design phase.

O O O O O O O O O O O O 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 B 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 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

experimental catchment
first flush
mouse
infoworks
sensitivity analysis


Decentralized Coverage Control for Multi-Agent Systems with Nonlinear Dynamics In this paper, we study the decentralized coverage control problem for an environment using a group of autonomous mobile robots with nonholonomic kinematic and dynamic constraints. In comparison with standard coverage control procedures, we develop a combined controller for Voronoi-based coverage approach in which kinematic and dynamic constraints of the actual mobile sensing robots are incorporated into the controller design. Furthermore, a collision avoidance component is added in the kinematic controller in order to guarantee a collision free coverage of the area. The convergence of the network to the optimal sensing configuration is proven with a Lyapunov-type analysis. Numerical simulations are provided approving the effectiveness of the proposed method through several experimental scenarios.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

networked control systems
sensor networks
coverage problem
nonholonomic mobile robots


A novel two-level nearest neighbor classification algorithm using an adaptive distance metric When there exist an infinite number of samples in the training set, the outcome from nearest neighbor classification (kNN) is independent on its adopted distance metric. However, it is impossible that the number of training samples is infinite. Therefore, selecting distance metric becomes crucial in determining the performance of kNN. We propose a novel two-level nearest neighbor algorithm (TLNN) in order to minimize the mean-absolute error of the misclassification rate of kNN with finite and infinite number of training samples. At the low-level, we use Euclidean distance to determine a local subspace centered at an unlabeled test sample. At the high-level, AdaBoost is used as guidance for local information extraction. Data invariance is maintained by TLNN and the highly stretched or elongated neighborhoods along different directions are produced. The TLNN algorithm can reduce the excessive dependence on the statistical method which learns prior knowledge from the training data. Even the linear combination of a few base classifiers produced by the weak learner in AdaBoost can yield much better kNN classifiers. The experiments on both synthetic and real world data sets provide justifications for our proposed method.

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 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 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 O O O O O O O O O O O O O O O O O O O O O O

nearest neighbors
metric learning
mean-absolute error


Four-dimensional geometric element definitions and interferences via five-dimensional homogeneous processing We have systematized various studies on 4-D visualization and interaction thus far, and we proposed 4-D geometric algorithms via 5-D homogeneous processing. Our framework uses 55 matrices and 55 determinants to express various types of transformations, and it simplifies geometric operations without the use of division operations. Using the proposed scheme, we developed an interactive 4-D space display system. The simplicity, generality, and duality of 5-D homogeneous processing are effective not only for 4-D geometric operations but also for interference problems among various 4-D objects. However, the processing regarding geometric characteristics of 4-D objects was not considered in our previous works. In this paper, we describe 4-D geometric elements, in general, and we discuss 4-D computational geometry via 5-D homogeneous processing. Unified geometric operations without the use of division operations constitute the most important part of 5-D homogeneous processing. We systematize the methods for 4-D geometric element definitions and interferences via 5-D homogeneous processing. In the field of 4-D visualization, the proposed algorithms can be potentially used in a user interface for feature detection of a 4-D object and collision detection of several 4-D objects. We comprehensively develop and advance the theoretical framework in the field of 4-D graphics. It is expected that this method of processing will be useful for the performance improvement of 4-D graphics systems.

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

4-d geometric element definitions
4-d geometric element interferences
4-d euclidean space
5-d homogeneous processing


power-aware provisioning of cloud resources for real-time services Reducing energy consumption has been an essential technique for Cloud resources or datacenters, not only for operational cost, but also for system reliability. As Cloud computing becomes emergent for Anything as a Service (XaaS) paradigm, modern real-time Cloud services are also available throughout Cloud computing. In this work, we investigate power-aware provisioning of virtual machines for real-time services. Our approach is (i) to model a real-time service as a real-time virtual machine request; and (ii) to provision virtual machines of datacenters using DVFS (Dynamic Voltage Frequency Scaling) schemes. We propose several schemes to reduce power consumption and show their performance throughout simulation results.

O O O O O O O O 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 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

power-awareness
power-aware cloud computing
real-time


A microrobot-based automated micromanipulation station for assembly of microsystems The development of new types of miniaturized and microrobots with human-like capabilities play an important role in different application tasks. One of the main problem of present-day research is, for example, to assemble a whole microsystem from different microcomponents. This paper presents an automated micromanipulation desktop station including a piezoelectrically driven microrobot placed on the highly-precise x-y stage of a light microscope, a CCD-camera as a local sensor subsystem, a laser sensor unit as a global sensor subsystem, and a Pentium PC equipped additionally with an optical grabber. The microrobot has three piezoelectrically driven legs and two autonomous manipulators as endeffectors; it can perform highly-precise manipulations (with an accuracy of up to 10 nm) and a nondestructive transport (at a speed of several mm/s) of very small objects under a microscope. To perform manipulations automatically, a control system, including a task planning level and a real-time execution level, is being developed. (C) 1998 Elsevier Science B.V. All lights reserved.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

microassembly
automated desktop station
assembly planning
piezoactuators


Determining optimum flash patterns for emergency service vehicles: An experimental investigation using high definition film The 4Hz flash rate was perceived to convey greater urgency than 1Hz rate. The 1Hz single pulse pattern was ranked least urgent of all the combinations. Estimates of minimum space acceptable for pulling out reflected urgency measures. Less risky gap acceptance judgements were evident for the 4Hz single pulse combination. HD film was found to be a low-risk, valid method for assessing EVL efficacy.

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

emergency service vehicle lighting
flash pattern
urgency perception


A Statistical Model for Directional Relations Between Spatial Objects Directional relation, as a kind of spatial constraints, has been recognized as being an important means for spatial query, analysis and reasoning. Directional relation is conventionally concerned with two point objects. However, in spatial query and analysis, there is also a need of directional relations between point and line, point and area, line and line, line and area, and area and area. Therefore, conventional definition of direction needs to be extended to include line and area objects (i.e. the so-called extended objects). Existing models for directional relation of extended objects make use of approximate representations (e.g. minimum bounding rectangles) of the extended objects so as to produce some results with unrealistic impression. In this paper, a statistical model is presented. In this new model, (1) an extended spatial object is decomposed into small components; (2) the directional relation between extended spatial objects is then determined by the directions between these small components which form a distribution; and (3) two measures (i.e. range and median direction) are utilized to describe the statistical property of the distribution. This statistical model is based upon the (extended) spatial objects themselves, instead of their approximate representations. An experimental test has been carried out and the result indicates that the directional relations computed from this model is very close to those perceived by human beings.

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 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 O O O O O O O O O O O O O O O O O O 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 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


Analyzing design choices for distributed multidimensional indexing Scientific datasets are often stored on distributed archival storage systems, because geographically distributed sensor devices store the datasets in their local machines and also because the size of scientific datasets demands large amount of disk space. Multidimensional indexing techniques have been shown to greatly improve range query performance into large scientific datasets. In this paper, we discuss several ways of distributing a multidimensional index in order to speed up access to large distributed scientific datasets. This paper compares the designs, challenges, and problems for distributed multidimensional indexing schemes, and provides a comprehensive performance study of distributed indexing to provide guidelines to choose a distributed multidimensional index for a specific data analysis application.

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 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 B I O O O O O O O O O O O O O O O

multidimensional indexing
distributed indexing

decentralized indexing
data intensive computing


An efficient and effective ensemble of support vector machines for anti-diabetic drug failure prediction We propose a method called E3-SVM, efficient and effective ensemble of SVMs. E3-SVM excludes superfluous data points when constructing an SVM ensemble. E3-SVM was applied to the drug failure prediction problem for type 2 diabetes. We confirmed the suitability of SVM with an accuracy of about 80%.

O O O O B O B I I O O B I I 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 B I I O O B I I O O O O O O O O O O O O

support vector machines
ensemble
type 2 diabetes
drug failure prediction


visualizing simulation and testbed of wireless sensor networks with nettopo In this paper, we present an integrated framework called NetTopo for providing both simulation and visualization functions to assist the investigation of algorithms in WSNs. NetTopo provides a common virtual WSN for the purpose of interaction between sensor devices and simulated virtual nodes. Two case studies are described to prove the effectiveness of NetTopo.

O O O O O B I I O B O O O O O O O O O B 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 B

nettopo
wireless sensor networks
visualization


Hand tracking for behaviour understanding A real-time computer vision system is described for tracking hands thus enabling behavioural events to be interpreted. Forearms are tracked to provide structural context, enabling mutual occlusion, which occurs when hands cross one another, to be handled robustly. No prior skin colour models are used. Instead adaptive appearance models are learned on-line. A contour distance transform is used to control model adaptation and to fit 2D geometric models robustly. Hands can be tracked whether clothed or unclothed. Results are given for a smart desk and an in-vehicle application. The ability to interpret behavioural events of interest when tracking a vehicle driver's hands is described.

B I 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 B I O O O O O O O O O O

gesture recognition
intelligent vehicles
smart desks


High Performance Process Variations Aware Technique for Sub-threshold 8T-SRAM Cell The demand of low power high density integrated circuits is increasing in modern battery operated portable systems. Sub-threshold region of MOS transistors is the most desirable region for energy efficient circuit design. The operating ultra-low power supply voltage is the key design constraint with accurate output performance in sub-threshold region. Degrading of the performance metrics in Static random access memory (SRAM) cell with process variation effects are of major concern in sub-threshold region. In this paper, a bootstrapped driver circuit and a bootstrapped driver dynamic body biasing technique is proposed to assist write operation which improves the write-ability of sub-threshold 8T-SRAM cell under process variations. The bootstrapped driver circuit minimizes the write delay of SRAM cell. The bootstrapped driver dynamic body bias increases the output voltage levels by boosting factor therefore increasing in switching threshold voltage of MOS devices during hold and read operation of SRAM latch. The increment in threshold voltage improves the static noise margin and minimizing the process variation effects. Monte-Carlo simulation results with 3\(\sigma \) Gaussian distributions show the improvements in write delay by 11.25%, read SNM by 12.20% and write SNM by 12.57% in 8T-SRAM cell under process variations at 32nm bulk CMOS process technology node.

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 B I O O O B I B I I 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 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 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 O O O

process variations
static noise margin
bootstrapped driver
dynamic body biasing


Restructuring Object-Oriented Frameworks into Model-View-Adapter Architecture This paper presents a process for restructuring the architecture of an object-oriented framework to make it conform to the MVA pattern. The objective of this work is to separate the code business logic (the Model), which is the most reusable part of a framework, from the code that implements the view and from the code that controls the processing of specific applications. The restructuring process is carried out by applying a set of 11 methods, resulting in a new object-oriented MVA architecture functionally equivalent to the original object-oriented framework.

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 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


Facilitating service discovery with semantic overlay Service Oriented Architecture (SOA) and Peer-to-Peer (P2P) computing share many common characteristics. It is believed that the combination of the two emerging techniques is a very promising method in promoting the web services (WS). Because the service discovery plays a key role in the integration, here a P2P-based framework to manage the knowledge of service and locating services is proposed. In this paper, the details of the principle, constructing and maintaining of service semantic overlay architecture have been described, and the way how the semantic overlay facilitates discovery of service resources is illustrated. To enable the semantic web service superiority, Service Ontology, which is considered as the service semantic model, is employed to depict service. The service discovery includes two phases: searching on the service semantic overlay; and local discovery in peer's service repository. Various solutions have been proposed to realize those two phases. Furthermore, tests are carried out to evaluate service discovery on the architecture.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

information search and retrieval
intelligent web services
knowledge management


Quantum field theory and computational paradigms We introduce the basic theory of quantization of radiation field in quantum physics and explain how it relates to the theory of recursive functions in computer science. We outline the basic differences between quantum mechanics (QM) and quantum field theory (QFT) and explain why QFT is better suited for a computational paradigm-based on algorithmic requirement, countably infinite degrees of freedom and the creation of macroscopic output objects. The quanta of the radiation field correspond to the non-negative integers and the harmonic oscillator spectra correspond to the recursive computation with the creation and annihilation operators, respectively, playing the same role as the successor and predecessor in computability theory. Accordingly, this approach relates the classical computational model and the quantum physical model more directly than the Turing machine approach used earlier. Also, the application of Lambda calculus formalism and the associated denotational semantics (that is widely used in the classical computational paradigm involving recursive functions) for applications to computational paradigm based on quantum field theory is described. Finally, we explain where QFT and conventional paradigm depart from each other, and examine the concept of fixed points, phase transitions, programmability, emergent computation and related open 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 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 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 B I O B I O O O O

denotational semantics
emergent computation
fixed points
harmonic oscillator
lambda calculus
phase transitions

annihilation-creation
bosonic counter
conrad's principle
fermionic switch
multiset rule-based paradigm
nonprogrammability
occupation numbers
predecessor-successor
recursive function


Efficient screening of enhanced oil recovery methods and predictive economic analysis Oil demand for economic development around the world is rapidly increasing. Moreover, oil production rates are getting a peak in mature reservoirs and tending to decline in the near future, which has led to considerable researches on enhanced oil recovery (EOR) methods. Therefore, an efficient technical and economical screening to appropriate selection of EOR methods can make savings in time and cost. The purpose of this communication is to present a method to select an efficient EOR process and investigate its economic parameters. A database of reservoir parameters of rock and fluid properties along with successful EOR techniques has been collected and analyzed. First, an artificial neural network (ANN) was developed to classify the EOR methods technically. Then, an economical EOR screening model was designed, and then, future cash flows on the use of EOR methods were predicted. The results show that the ANN system can select proper EOR methods and classify them. Moreover, the obtained results indicate that the economic analysis performed in this study is efficient and useful to predict future cash flows.

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 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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

artificial neural network
screening
rock

eor data
economical study
fluid characteristics


Numerical simulation of some biomechanical problems The paper is concerned with the numerical solution of non-linear conservation laws, and the contribution biomechanical models of spine and of loaded wrist are formulated and analysed. The models are based on a contact problem in non-linear elastic theology. The stress-strain relation is derived from a positive definite strain energy density function. For a weak solution of the problem, a variational inequality approach is used. Then the secant modules method and the finite element method are applied. First, the model of the weight bearing wrist, and secondly, the model of the Chance's fracture of lumbar spine are discussed. (C) 2002 Published by Elsevier Science B.V. on behalf of IMACS.

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 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 B I O O O O O O O O O O B I I O O O O O O O O O B O O O O O O O B O O B O O O O O O O O O O O O O

variational inequality
finite element method
wrist
spine
fracture

non-linear elasticity
contact problems
biomechanics


What Information Can or Cannot Be Exchanged? What information can or cannot be exchanged between different systems? Since the dawn of the computer-aided design and engineering era, interoperability has been an issue. The exchangeable set of information between different systems has been loosely defined as the intersection of information. Yet, as information flow has directionality, a general definition of "intersection" is inadequate to define an exchangeable set of information. This paper proposes a new directive set operation, semantic intersection, and discusses which information can or cannot be exchanged between different systems using the concept of semantic intersection. This opens up the possibility of predetermining or calculating the exchangeable set of information between two or more systems or the possibility of automated generation of a standard product model between different systems. This paper focuses on data exchange between systems, but the proposed theory is also applicable to data exchange between human beings.

O O O 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 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 O O O O O O O O O O O O O

information exchange
information standard
semantic subset


semantic distance of concepts within a unified framework in the biomedical domain This paper presents a cross-ontology approach, as an extension of the Cluster-Based approach, to measure semantic distance between concepts within single ontology or between concepts dispersed in multiple ontologies in a unified framework in the biomedical domain. The experimental results (with ~0.81 correlation with human scores) confirmed that the proposed approach is effective and has great potential in measuring semantic distance using multiple ontologies in a unified framework.

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 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 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


A state space augmented generalised RKPM for three-dimensional analysis of thick and laminated composite plates Introduction of the state space generalised RKPM (SS-GRKPM). A versatile numerical technique is developed for the enforcement of mix boundary conditions. Accurate numerical solutions are obtained for analysis of laminated plates. The convergence and capabilities of the proposed method demonstrated using a series of numerical examples.

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

generalised reproducing kernel particle method


Many-to-Many Communication in Radio Networks Radio networks model wireless data communication when the bandwidth is limited to one wave frequency. The key restriction of such networks is mutual interference of packets arriving simultaneously at a node. The many-to-many (m2m) communication primitive involves p participant nodes from among n nodes in the network, where the distance between any pair of participants is at most d. The task is to have all the participants get to know all the input messages. We consider three cases of the m2m communication problem. In the ad-hoc case, each participant knows only its name and the values of n, p and d. In the partially centralized case, each participant knows the topology of the network and the values of p and d, but does not know the names of the other participants. In the centralized case, each participant knows the topology of the network and the names of all the participants. For the centralized m2m problem, we give deterministic protocols, for both undirected and directed networks, working in O(d + p) time, which is provably optimal. For the partially centralized m2m problem, we give a randomized protocol for undirected networks working in O(( d + p + log(2) n) log p) time with high probability (whp), and we show that any deterministic protocol requires Omega(d + p logn/logp) time. For the ad-hoc m2m problem, we develop a randomized protocol for undirected networks that works in O((d + log p) log(2) n + p log p) time whp. We show two lower bounds for the ad-hoc m2m problem. One lower bound states that any randomized protocol for the m2m ad hoc problem requires Omega( p + d log n/d) expected time. Another lower bound states that for any deterministic protocol for the m2m ad hoc problem, there is a network on which the protocol requires Omega(n log n/log(n/d)) time when n - p( n) = Omega(n) and d > 1, and that it requires Omega(n) time when n - p( n) = o(n).

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

radio network
many-to-many communication
broadcast
gossiping
centralized protocol
distributed protocol
randomization


The development and verification of relocating mesh method for the computation of temperature field of RCC dam Based on the construction property of rolled compacted concrete dam cast layer by layer, three-dimensional finite element relocating mesh method was developed in the paper to simulate construction process and compute temperature field. The computation model of relocating mesh method is expatiated in detail. The feasibility and error of the relocating mesh method were analyzed and demonstrated. The computation results were verified with the temperature observation data of an RCC arch dam. The results show that the method has high calculation precision, less computer run time and less memory. The values computed with the method are in the same trend with the observation data. The method has proved to be effective in simulating construction process and computing temperature field of RCC dam.

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 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 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 B I O O O O O O O O O B I O O B I O O O

construction process
temperature field
rcc arch dam
observation data


Myocardial regeneration: expanding the repertoire of thymosin ?4 in the ischemic heart Efficient cardiac regeneration postinfarction (MI) requires the replacement of lost cardiomyocytes, formation of new coronary vessels and appropriate modulation of the inflammatory response. However, insight into how to stimulate repair of the human heart is currently limited. Using the embryonic paradigm of regeneration, we demonstrated that the actin-binding peptide thymosin ?4 (T?4), required for epicardium-derived coronary vasculogenesis, can recapitulate its embryonic role and activate quiescent adult epicardial cells (EPDCs). Once stimulated, EPDCs facilitate neovascularization of the ischemic adult heart and, moreover, contribute bona fide cardiomyocytes. EPDC-derived cardiomyocytes structurally and functionally integrate with resident muscle to regenerate functional myocardium, limiting pathological remodeling, and effecting an improvement in cardiac function. Alongside pro-survival and anti-inflammatory properties, these regenerative roles, via EPDCs, markedly expand the range of therapeutic benefits of T?4 to sustain and repair the myocardium after ischemic damage.

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 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 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

thymosin ?4
epicardium
wt1
de novo cardiomyocytes


System to measure the use of the backrest in sitting-posture office tasks This paper presents an inexpensive and simple system to measure the way of use of the backrest. The system can be also used in field studies. It is based on a set of electrodes which, attached to the subject's back and the backrest, allows the contact area to be measured. A laboratory test was performed to validate the system. In the test the spontaneous use of the backrest in standard office chairs and tasks was studied. Four different types of backrest use have been detected, and it has been shown that they determine the lumbar curvature and pelvic inclination angles, as well as postural mobility. The comfort levels observed in the four types of backrest use were also different. Consequently, the system can be used as an indicator of back posture and comfort.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 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 B I O O O O O O O O O O O O O O O O O


Incorporating text models in electronic document readership This report investigates the migration of conventional document models and readers' access strategies to hypertext. The need to support existing document models and facilitate existing access strategies is described. By borrowing text decomposition methods found in artificial intelligence, a possible framework that would allow such a migration is suggested and experimentally tested.

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


Variable amplitude Fourier series with its application in gearbox diagnosisPart I: Principle and simulation Vibration signal analysis has been an important method in the detection and diagnosis of gearbox faults. The vibration signals measured from a gearbox are complex multi-component signals, which include tooth meshing vibration, gear shaft rotating vibration and gearbox resonance vibrations. They are often non-stationary and time-varying. When conducting gearbox failure detection, it is not simple to interpret the results coming from traditional Fourier analysis; other signal processing methods such as short-time Fourier series (FS) and wavelet analysis are not always sufficient to exactly extract the desired frequency component for a certain gear. In this paper, a novel signal analysis method, which we named the variable amplitude FS (VAFS), is proposed. This method is based on an improvement of the traditional FS analysis and comes from the analysis of the gear meshing vibration signal model. In part I, the principle of the VAFS is introduced, and then an algorithm for calculating VAFS coefficients is presented. The performance of the VAFS is compared with that of a wavelet transform in the analysis of a numerically generated noisy chirp signal. In part II, the VAFS method is applied in the analysis of the vibration signal of a truck gearbox containing a gear in good, cracked and broken condition, and the results are compared with that of the wavelet analysis.

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 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

variable amplitude fourier series
signal processing


A Supervised Manifold Learning Method The Locally Linear Embedding (LLE) algorithm is an unsupervised nonlinear dimensionality-reduction method, which reports a low recognition rate in classification because it gives no consideration to the label information of sample distribution. In this paper, a classification method of supervised LLE (SLLE) based on Linear Discriminant Analysis (LDA) is proposed. First, samples are classified according to their label values, and low dimensional features of intra-class data are expressed through LLE manifold learning. Then, the base vectors in Fisher subspace of the low dimensional features are generated through LDA learning. This method increases inter-class variation, and decreases the intra-class variation when samples are projected to the Fisher subspace. Hence, the samples of different labels can be recognized, and the recognition rate and robustness of the LLE learning are improved. Experiments on handwritten digit recognition show that the proposed method is featuring high recognition rate.

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 B I 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 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

manifold learning
locally linear embedding
fisher subspace


A multi-objective optimization method for probability density function of lift-off speed of wind-blown sand movement It has been found that the probability density function (PDF) of lift-off or initial speeds of wind-blown sand ejecting from a sand bed plays a central role in the research of mechanism of wind-blown sands. This article presents an approach for developing the PDF of lift-off speeds on the basis of the conventional experimental measurements of sand-flux and wind profile. After the measurements of sand-flux and wind profile in the saltation layer are conducted in a field wind tunnel, an optimization algorithm based on the experimental data is proposed by means of the multi-objective optimization and the simulation model of the quantities of saltation motion to numerically search for the PDF. Then the obtained numerical results are fitted by means of the least square method, and finally an empirical formula of the PDF is gained for the sample sand in the experiments.

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


Bisimulation on speed: Lower time bounds More than a decade ago, Moller and Tofts published their seminal work on relating processes, which are annotated with lower time bounds, with respect to speed. Their paper has left open many questions regarding the semantic theory for the suggested bisimulation-based faster-than preorder, the MT-preorder, which have not been addressed since. The encountered difficulties concern a general compositionality result, a complete axiom system for finite processes, a convincing intuitive justification of the MT-preorder, and the abstraction from internal computation. This article solves these difficulties by developing and employing a novel commutation lemma relating the sequencing of action and clock transitions in discrete-time process algebra. Most importantly, it is proved that the MT-preorder is fully-abstract with respect to a natural amortized preorder that uses a simple bookkeeping mechanism for deciding whether one process is faster than another. Together these results reveal the intuitive roots of the MT-preorder as a faster-than relation, while testifying to its semantic elegance. This lifts some of the barriers that have so far hampered progress in semantic theories for comparing the speed of processes.

B O 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 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

asynchronous systems
timed process algebra
faster-than relation
moller-tofts preorder


Improved image interpreting and modeling technique for automated structural optimization system The automated structural optimization system (ASOS) proposed in the previous work incorporates the image-preprocessing techniques, the image-interpreting technique, and the automated shape-optimization modeling techniques to successfully obtain an autonomously integrated topology and shape optimization. However, the characteristic value-based image-interpreting technique used in ASOS is unable to accurately interpret complicated hole shapes, necessitating the use of the hole shape-adjusting strategy in addition to the hole-expanding strategy and the interference analysis in the automated shape-optimization modeling techniques to obtain a viable initial design and side constraints of design variables. In order to solve the above-mentioned problem in ASOS, this paper proposes the improved automated structural optimization system (IASOS) and uses the polygonal image-interpreting technique to replace the characteristic value-based image-interpreting technique used in ASOS. This alteration significantly increases the accuracy of image interpretation. Moreover, it can simplify the process of automated shape-optimization modeling techniques, reduce the design duration, and produce better results.

O O O O O O O B I 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 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 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

automated structural optimization
shape optimization

integrated structural configuration design


Continuous-time

quantum

Monte

Carlo

impurity

solvers

Continuous-time

quantum

Monte

Carlo

impurity

solvers

are

algorithms

that

sample

the

partition

function

of

an

impurity

model

using

diagrammatic

Monte

Carlo

techniques.

The

present

paper

describes

codes

that

implement

the

interaction

expansion

algorithm

originally

developed

by

Rubtsov,

Savkin,

and

Lichtenstein,

as

well

as

the

hybridization

expansion

method

developed

by

Werner,

Millis,

Troyer,

et

al.

These

impurity

solvers

are

part

of

the

ALPS-DMFT

application

package

and

are

accompanied

by

an

implementation

of

dynamical

mean-field

self-consistency

equations

for

(single

orbital

single

site)

dynamical

mean-field

problems

with

arbitrary

densities

of

states.

Program

summary

Program

title:

dmft

Catalogue

identifier:

Program

summary

URL:

Program

obtainable

from:

CPC

Program

Library,

Queen's

University,

Belfast,

N.

Ireland

Licensing

provisions:

ALPS

LIBRARY

LICENSE

version

No.

of

lines

in

distributed

program,

including

test

data,

etc.:

No.

of

bytes

in

distributed

program,

including

test

data,

etc.:

Distribution

format:

tar.gz

Programming

language:

C++

Operating

system:

The

ALPS

libraries

have

been

tested

on

the

following

platforms

and

compilers:

Linux

with

GNU

Compiler

Collection

(g++

version

and

higher),

and

Intel

C++

Compiler

(icc

version

and

higher)

MacOS

X

with

GNU

Compiler

(g++

Apple-version

and

IBM

AIX

with

Visual

Age

C++

(xIC

version

and

GNU

(g++

version

and

higher)

compilers

Compaq

UNIX

with

Compq

C++

Compiler

(cxx)

SGI

IRIX

with

MIPSpro

C++

Compiler

(CC)

HP-UX

with

HP

C++

Compiler

(aCC)

Windows

with

Cygwin

or

coLinux

platforms

and

GNU

Compiler

Collection

(g++

version

and

higher)

RAM:

GB

Classification:

External

routines:

ALPS

BLAS/LAPACK,

Nature

of

problem:

(See

Quantum

impurity

models

describe

an

atom

or

molecule

embedded

in

a

host

material

with

which

it

can

exchange

electrons.

They

are

basic

to

nanoscience

as

representations

of

quantum

dots

and

molecular

conductors

and

play

an

increasingly

important

role

in

the

theory

of

"correlated

electron"

materials

as

auxiliary

problems

whose

solution

gives

the

"dynamical

mean

field"

approximation

to

the

self-energy

and

local

correlation

functions.

Solution

method:

Quantum

impurity

models

require

a

method

of

solution

which

provides

access

to

both

high

and

low

energy

scales

and

is

effective

for

wide

classes

of

physically

realistic

models.

The

continuous-time

quantum

Monte

Carlo

algorithms

for

which

we

present

implementations

here

meet

this

challenge.

Continuous-time

quantum

impurity

methods

are

based

on

partition

function

expansions

of

quantum

impurity

models

that

are

stochastically

sampled

to

all

orders

using

diagrammatic

quantum

Monte

Carlo

techniques.

For

a

review

of

quantum

impurity

models

and

their

applications

and

of

continuous-time

quantum

Monte

Carlo

methods

for

impurity

models

we

refer

the

reader

to

Additional

comments:

Use

of

dmft

requires

citation

of

this

paper.

Use

of

any

ALPS

program

requires

citation

of

the

ALPS

paper.

Running

time:

h

per

iteration.

(C)

Elsevier

B.V.

All

rights

reserved.

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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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


Refunctionalization at work We present the left inverse of Reynolds' defunctionalization and we show its relevance to programming and to programming languages. We propose two methods to transform a program that is almost in defunctionalized form into one that is actually in defunctionalized form, and we illustrate them with a recognizer for Dyck words and with Dijkstra's shunting-yard algorithm. (C) 2009 Elsevier B.V. All rights reserved.

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

abstract machines
continuations
continuation-passing style (cps)
shunting-yard algorithm


Stochastic modeling western paintings for effective classification As one of the most important cultural heritages, classical western paintings have always played a special role in human live and been applied for many different purposes. While image classification is the subject of a plethora of related publications, relatively little attention has been paid to automatic categorization of western classical paintings which could be a key technique of modern digital library, museums and art galleries. This paper studies automatic classification on large western painting image collection. We propose a novel framework to support automatic classification on large western painting image collections. With this framework, multiple visual features can be integrated effectively to improve the accuracy of identification process significantly. We also evaluate our method and its competitors based on a large image collection. A careful study on the empirical results indicates the approach enjoys great superiority over the state-of-the-art approaches in different aspects.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

classic western paintings
image retrieval
cultural heritage


On reporting the L1 L 1 metric closest pair in a query rectangle In this work, we consider the problem of finding the closest pair (in L1 L 1 metric) of points in an orthogonal query rectangle. Given a set of n static points on a UU U U grid, we preprocess these points into a data structure of size O ( m f ( m ) log 2 m ) that can be queried in time O ( ( g ( m ) + log log m ) log 3 m ) , for m = O ( n log U ) and (i) f(m)=O(1) f ( m ) = O ( 1 ) and g ( m ) = O ( log ? m ) ; (ii) f ( m ) = O ( log log m ) and g ( m ) = O ( log log m ) ; (iii) f ( m ) = O ( log ? m ) and g(m)=O(1) g ( m ) = O ( 1 ) . Here ? : 0<?<1 0 < ? < 1 is a small but arbitrary constant.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

computational geometry
range queries
manhattan metric


Study of thick film Ni(1?x)CoxMn2O4,(0?x?1) using overlay technique on thick film microstrip ring resonator The effect of thick film Ni(1?x)CoxMn2O4 in-touch overlay on the X band resonance characteristics of thick film microstrip ring resonator is studied. The thick film overlay decreases the resonance frequency and increases the peak output. From the frequency shift the dielectric constant of the thick film Ni(1?x)CoxMn2O4 has been calculated. For the first time Ag thick film microstrip ring resonator has been used to study thick film Ni(1?x)CoxMn2O4 in the X band.

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

thick film
dielectric constant
microstrip ring resonator
overlay


A graph-based shape matching scheme for 3D articulated objects In this paper, a novel graph-based shape matching scheme for three-dimensional articulated objects is introduced. The underlying graph structure of a given 3D model is composed of its topological skeleton and local geometric features. Matching two graph structures is generally an NP-hard combinatorial optimization problem. To reduce computation cost, two graphs are embedded on a high-dimensional space, and then matched based on an extension of Earth Mover's Distance (EMD). Furthermore, the symmetric components of an articulated object are determined by a voting algorithm with a self-matching strategy to refine the matching correspondences. Experimental results show that the proposed approach is robust, even when the models are under the surface disturbances of noise addition, smoothing, simplification, similarity transformation, and pose deformation. In addition, the proposed approach is capable of handling both global and partial shape matching. Copyright (C) 2011 John Wiley & Sons, Ltd.

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 B 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 B I O O O O O O O O

shape matching
skeleton
geometric features


An efficient integrated approach for global sensitivity analysis of hydrological model parameters Efficient sensitivity analysis, particularly for the global sensitivity analysis (GSA) to identify the most important or sensitive parameters, is crucial for understanding complex hydrological models, e.g., distributed hydrological models. In this paper, we propose an efficient integrated approach that integrates a qualitative screening method (the Morris method) with a quantitative analysis method based on the statistical emulator (variance-based method with the response surface method, named the RSMSobol' method) to reduce the computational burden of GSA for time-consuming models. Using the Huaihe River Basin of China as a case study, the proposed approach is used to analyze the parameter sensitivity of distributed time-variant gain model (DTVGM). First, the Morris screening method is used to qualitatively identify the parameter sensitivity. Subsequently, the statistical emulator using the multivariate adaptive regression spline (MARS) method is chosen as an appropriate surrogate model to quantify the sensitivity indices of the DTVGM. The results reveal that the soil moisture parameter WM is the most sensitive of all the responses of interest. The parameters Kaw and g1 are relatively important for the water balance coefficient (WB) and NashSutcliffe coefficient (NS), while the routing parameter RoughRss is very sensitive for the NashSutcliffe coefficient (NS) and correlation coefficient (RC) response of interest. The results also demonstrate that the proposed approach is much faster than the brute-force approach and is an effective and efficient method due to its low CPU cost and adequate degree of accuracy.

O O O O O B I I 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 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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

global sensitivity analysis
statistical emulator
dtvgm


Object-oriented model and code for the visual examination of subsurface structures under historical buildings Sufficient knowledge about subsurface structures of historical buildings is very important for their structural analysis, maintenance and repair. Due to strict preservation regulations for historical sites, only indirect disturbance-free observation techniques like gravity or magnetic measurements are suitable for data acquisition. For the data analysis as a solution to an inverse problem, the object modelling technique proposed by Rumbaugh et al. [Object-oriented modelling and design. Englewood Cliffs, NJ: Prentice Hall, 1991] was used to create a WindowsTM program that allows a visual examination of subsurface structures by the built-in multi-tasking and point-and-click capabilities. This approach has many advantages compared to the past without the ease of object-oriented window facilities for both developers and users. The described method was successfully applied to investigate the subsurface structures of Hagia Sophia, one of the oldest sacred monuments in the world, built between 532537 AD under the reign of Justinian in todays Istanbul.

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 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 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 O O O O O O

structural analysis
subsurface structures


Testing the Supermodular-Cut Condition For a function \(f:2^{V} \to \mathbb {Z}_{+}\) on a finite set V with f(?)=f(V)=0, adigraph D=(V,A) is called f-connected if it satisfies the f-cut condition, that is, ? D (X)?f(X) for any X?V, where ? D (X) is the number of arcs from X to V?X. We show that, for any crossing supermodular function f, the f-connectivity can be tested with a constant number of queries in the general digraph model with average degree bound. As immediate corollaries, we obtain constant-time testers for k-edge-connectivity, rooted-(k,l)-edge-connectivity, and the property of having k arc-disjoint arborescences. We also give a corresponding result for the undirected case.

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

property testing
bounded-degree model
supermodularity


Stucture of the complex between Mucor pusillus pepsin and the key domain of kappa-casein for site-directed mutagenesis: a combined molecular modeling and docking approach In the structural-based mutagenesis of Mucor pusillus pepsin (MPP), understanding how kappa-casein interacts with MPP is a great challenge for us to explore. Chymosin-sensitive peptide is the key domain of kappa-casein that regulates milk clotting through the specific proteolytic cleavage of its peptide bond (Phe(105)-Met(106)) by MPP to produce insoluble para-kappa-casein. Here, we built the model of this large peptide using molecular modeling technique. Docking study showed that MPP can accommodate the designed model with a favorable binding energy and the docked complex has proven to locally resemble the inhibitor-chymosin complex. The catalytic mechanism for the peptide model binding with MPP was explored in terms of substrate-enzyme interaction and property of contacting surface. Some critical amino acid residues in the substrate binding cleft have been identified as an important guide for further site-directed mutagenesis. Glu13 and Leu11 in the S3 region of MPP, predicted as the special mutation sites, were confirmed to retain clotting activity and decrease the proteolytic activity. These novel mutants may provide a promising application for improving cheese flavor.

O O O O O B I O O O O O O O O O B O O O O O O O O O O B 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

kappa-casein
molecular docking
secondary proteolysis


Single-objective and multiobjective evolutionary optimization assisted by Gaussian random field metamodels This paper presents and analyzes in detail an efficient search method based on evolutionary algorithms (EA) assisted by local Gaussian random field metamodels; (GRFM). It is created for the use in optimization problems with one (or many) computationally expensive evaluation function(s). The role of GRFM is to predict objective function values for new candidate solutions by exploiting information recorded during previous evaluations. Moreover, GRIM are able to provide estimates of the confidence of their predictions. Predictions and their confidence intervals predicted by GRFM are used by the metamodel assisted EA. It selects the promising members in each generation and carries out exact, costly evaluations only for them. The extensive use of the uncertainty information of predictions for screening the candidate solutions makes it possible to significantly reduce the computational cost of singleand multiobjective EA. This is adequately demonstrated in this paper by means of mathematical test cases and a multipoint air-foil design in aerodynamics.

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

gaussian random field models
kriging
metamodeling
multiobjective design optimization
uncertainty prediction


Simulating leaf growth dynamics through Metropolis-Monte Carlo based energy minimization We use the VirtualLeaf framework to simulate Arabidopsis thaliana leaf growth. Our two-dimensional model is based on wall mechanics and phytohormone dynamics. Important spatio-temporal characteristics of leaf development were reproduced. We demonstrate the need for an integrated approach to studying plant development.

O O O O O O O O O O O O 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

computational biology
growth simulation
metropolis
hamiltonian


An open-source compiler and PCB synthesis tool for digital microfluidic biochips This paper describes a publicly available, open source software framework designed to support research efforts on algorithms and control for digital microfluidic biochips (DMFBs), an emerging laboratory-on-a-chip (LoC) technology. The framework consists of two parts: a compiler, which converts an assay, specified using the BioCoder language, into a sequence of electrode activations that execute out the assay on the DMFB; and a printed circuit board (PCB) layout tool, which includes algorithms to reduce the number of control pins and PCB layers required to drive the chip from an external source. The framework also includes a suite of visualization tools for debugging, and a collection of front-end algorithms that generate mixing/dilution trees for sample preparation.

O O B 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

digital microfluidic biochip
compression


STUDY OF IRREDUCIBLE BALANCED PAIRS FOR SUBSTITUTIVE LANGUAGES Let L be a language. A balanced pair (u, v) consists of two words u and v in L which have the same number of occurrences of each letter. It is irreducible if the pairs of strict prefixes of u and v of the same length do not form balanced pairs. In this article, we are interested in computing the set of irreducible balanced pairs on several cases of languages. We make connections with the balanced pairs algorithm and discrete geometrical constructions related to substitutive languages. We characterize substitutive languages which have infinitely many irreducible balanced pairs of a given form.

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 O 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 B I O O O O O O O O O O B I O O O O O O O B I O O B I O O O O O B I O O O O


Simultaneous suppression of overlap errors and side-lobes in attenuated PSM lithography by rule-based OPC Problems of overlap errors and side-lobe printing by the design rule reduction in the lithography process using attenuated phase-shifting masks (attPSM) have been serious. Overlap errors and side-lobes can be simultaneously solved by the rule-based correction using scattering bars with the rules extracted from test patterns. Process parameters affecting the attPSM lithography simulation have been determined by the fitting method to the process data. Overlap errors have been solved applying the correction rules to the metal patterns overlapped with contact/via. Moreover, the optimal insertion rule of the scattering bars has made it possible to suppress the side-lobes and to get additional pattern fidelity at the same time.

O O O O O O O O O B B 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 O O 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


aadl modeling and analysis of hierarchical schedulers A system based on a hierarchical scheduler is a system in which the processor is shared between several collaborative schedulers. Such schedulers exist since 1960 and they are becoming more and more investigated and proposed in real-life applications. For example, the ARINC 653 international standard which defines an Ada interface for avionic real time operating systems provides such a kind of collaborative schedulers. This article focuses on the modeling and the performance analysis of hierarchical schedulers. We investigate the modeling of hierarchical schedulers with AADL. Hierarchical scheduler timing and synchronization relationships are expressed with a domain specific language based on timed automata: the Cheddar language. With the meta CASE tool Platypus, we generate Ada packages implementing the Cheddar language. These Ada packages are part of Cheddar, a real time scheduling simulator. With these Ada packages, Cheddar is able to perform analysis by scheduling simulation of AADL systems composed of hierarchical schedulers. An AADL model of the ARINC 653 hierarchical scheduling is described as an illustration.

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 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 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 B O O O O O O B O O O O O O O B O B I O O O O O O B O O O O O O O O O B O O O O O O B O O O O O O O O O O O O

timed automaton
scheduling analysis
ada framework


Image recognition via Bayesian likelihood analysis of wavelet coefficients This study experiments with a Bayesian approach in recognition of images utilizing a joint-form likelihood of wavelet coefficients built from decomposition. Images of handwritten numerals are attacked via the Mallet decomposition algorithm with Daubechies wavelets to extract the feature vectors of coefficients. The model assumes the coefficient vectors by multivariate normal distributions and employs a Bayesian approach for classification based on the joint form of distributions. The results demonstrate marked improvement in recognition performance at the second level of decomposition.

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

wavelet decomposition
daubechies family
statistical pattern recognition
multi-resolution representations


Formation of HCl center dot 6H(2)O from ice and HCl under ultrahigh vacuum The interactions of hydrogen chloride (HCl) with ultrathin (10-100 monolayers thick) films of ice between 120 and 180 K were studied using temperature programmed desorption (TPD) and Fourier transform infrared reflection absorption spectroscopy (FTIRAS). HCl is initially absorbed by ice at 120 K to form the stoichiometrically fixed hexahydrate phase, HCl . 6H(2)O. Infrared spectroscopic measurements suggest that the hexahydrate is present as an amorphous solid. Upon the conversion of ice to HCl . 6H(2)O, HCl is adsorbed to the thin film surface, possibly with the H-Cl bond intact. The amorphous hexahydrate can be crystallized by annealing at 165 K for several minutes. Infrared spectra of the resulting films closely resemble those reported elsewhere of authentic, macroscopic samples of crystalline HCl . 6H(2)O. If the H2O to HCl ratio is less than 1:6, two phases are present: pure or nearly pure ice, and pure or nearly pure HCl . 6H(2)O. The infrared spectra of such films were simulated by an appropriate linear combination of the spectra of ice and HCl . 6H(2)O. The sublimation kinetics of ice and HCl . 6H(2)O are analyzed, and the re suits used to infer that the enthalpy of HCl absorption by ice is -126 +/- 14 kJ mol(-1).

O O O O O O O B O O O B 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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 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

hydrochloric acid
hcl center dot 6h(2)o
fourier transform infrared spectroscopy


I/O performance of an RAID-10 style parallel file system Without any additional cost, all the disks on the nodes of a cluster can be connected together through CEFT-PVFS, an RAID-10 style parallel file system, to provide a multi-GB/s parallel I/O performance. I/O response time is one of the most important measures of quality of service for a client. When multiple clients submit data-intensive jobs at the same time, the response time experienced by the user is an indicator of the power of the cluster. In this paper, a queuing model is used to analyze in detail the average response time when multiple clients access CEFT-PVFS. The results reveal that response time is with a function of several operational parameters. The results show that I/O response time decreases with the increases in I/O buffer hit rate for read requests, write buffer size for write requests and the number of server nodes in the parallel file system, while the higher the I/O requests arrival rate, the longer the I/O response time. On the other hand, the collective power of a large cluster supported by CEFT-PVFS is shown to be able to sustain a steady and stable I/O response time for a relatively large range of the request arrival 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Designing for human emotion: ways of knowing Recently researchers from a range of disciplines have begun inquiring into the place of emotion in the design and use of technology to ask how, and in what ways, products and systems evoke emotions in people and how these emotions can be understood, measured, or more generally assessed? This diversity of perspectives has brought theoretical and methodological richness to the field, yet has made it increasing challenging to make sense of the literature. This paper argues that by organizing these diverse accounts of design according to the underlying epistemology and theoretical perspective, it is possible to accommodate a variety of approaches and provide a way to give meaning to the diverse outcomes. Published papers representing a range of the approaches to research on human emotion were identified in the literature, and assessed in terms of researcher motivation, the way "emotion'' is conceptualized and operationalized, the nature of the knowledge claims, and the background assumptions of the authors, both implicit and explicit. By mapping research production to more fundamental assumptions and values, a space is opened for more constructive and nuanced dialog on the validity, meaning, and significance of diversity for advancing the field overall.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Pancake problems with restricted prefix reversals and some corresponding Cayley networks Cayley networks have desirable properties for interconnection networks, but the degree of many well-known Cayley networks grows with the number of nodes. Therefore, fixed-degree Cayley networks have also been introduced. We consider fixed-degree Cayley networks which are also subnetworks of the pancake network Pn. The pancake problem concerns the number of prefix reversals or flips, required to sort a permutation of length n. This is also the diameter of Pn. Restricting the problem to three of the n?1 possible flips, generates a subnetwork of Pn. We identify proper subnetworks and spanning subnetworks of Pn generated by three flips. We introduce a degree 3 spanning subnetwork of Pn, the Triad network, or Triadn. When n is odd and has n! nodes and diameter . Triadn emulates the shuffle-exchange and shuffle-exchange permutation networks with constant slowdown.

O O O O O O O O O B I B I O O O O O 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 B I O O O O O O B I O O B I 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 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 B O O O O O O O O O O O O

cayley networks
pancake network
pancake problem
spanning subnetworks
diameter

fixed degree
symmetric group
routing
embeddings


theoretical benchmarks of xml retrieval This poster investigates the use of theoretical benchmarks to describe the matching functions of XML retrieval systems and the properties of specificity and exhaustivity in XML retrieval. Theoretical benchmarks concern the formal representation of qualitative properties of IR models. To this end, Situation Theory framework for the meta-evaluation of XML retrieval is presented.

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 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 I O O


First-order specifications of programmable data types We consider first-order specifications together with the restriction to accept only programmable algebras as models. We provide a criterion which links this approach with the "generation principle": all programmable models of any specification SP that meets this criterion are reachable. We also show an example of a specification which does not satisfy the criterion and admits a programmable yet nonreachable model. Moreover, a general method of showing the existence of programmable but nonreachable models for a class of first-order specifications is given.

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

algebraic specification
reachable algebra


A personalized collaborative Digital Library environment: a model and an application The Web, and consequently the information contained in it, is growing rapidly. Every day a huge amount of newly created information is electronically published in Digital Libraries, whose aim is to satisfy users' information needs. In this paper, we envisage a Digital Library not only as an information resource where users may submit queries to satisfy their daily information need, but also as a collaborative working and meeting space of people sharing common interests. Indeed, we will present a personalized collaborative Digital Library environment, where users may organize the information space according to their own subjective view, may build communities, may become aware of each other, may exchange information and knowledge with other users, and may get recommendations based on preference patterns of users. (C) 2004 Elsevier Ltd. All rights reserved.

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 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


A sharp threshold for the renameable-Horn and the q-Horn properties The sharp Satisfiability threshold is well known for random k k -SAT formulas and is due to certain minimality and monotonic properties mentioned in this manuscript and reported in Chandru and Hooker [J. Assoc. Comput. Mach. 38 (1991) 205221]. Whereas the Satisfiability threshold is on the probability that a satisfying assignment exists, we find that sharp thresholds also may be determined for certain formula structures, for example, the probability that a particular kind of cycle exists in a random formula. Such structures often have a direct relationship on the hardness of a formula because it is often the case that the presence of such a structure disallows a formula from a known, easily solved class of Satisfiability problems. We develop tools that should assist in determining threshold sharpness for a variety of applications. We use the tools to show a sharp threshold for the q-Horn and renameable-Horn properties.

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 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

sharp satisfiability threshold
random formula


MicroISPs: providing convenient and low-cost high-bandwidth Internet access We present MicroISP, a novel architecture for Internet Service Providers suitable for installation in airports, hotels, conference centers, cafs, and office or apartment buildings. Users access a MicroISP via a low-cost, high-bandwidth LAN, e.g. Ethernet or WaveLAN. A router connects the MicroISP's LAN to a shared high-bandwidth access link (e.g., DSL or cable) to a conventional ISP. For this service, a MicroISP charges its clients. The architecture supports a variety of payment methods, both offline (e.g., cash, credit card, or billing to a hotel room account) and online (e.g., eCash, SET, IBM Micro Payments, or Millicent). MicroISPs use IPSec's IKE protocol for securely exchanging authentication keys with paying users. Paying users use IPSec's AH protocol in tunnel mode to authenticate each packet they send. Therefore, MicroISPs can easily detect and drop packets of nonpaying users. A MicroISP must present to users a certificate signed by a recognized authority, but a user may simply present a self-signed certificate, as long as the user pays for service. Regardless of how online payment is implemented, it runs on the user's authenticated tunnel, and therefore can be securely bound to it. The MicroISP protocol allows users to monitor and control usage and supports recovery in case of a MicroISP or user computer crash.

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

internet service provider
mobile access
electronic commerce
security and privacy


Modeling the driver's behavior on second-order macroscopic models of vehicular traffic flow This paper deals with the modeling and qualitative analysis, with special attention to hyperbolicity analysis, of a large class of second-order hydrodynamic traffic flow models. These models are obtained from conservation equations for mass and momentum properly closed by constitutive relations related to the modeling of the behaviour of drivers in the flow. The first part of the paper deals with defining the general mathematical setting for modeling second-order hydrodynamic equations of traffic flow related to conservation of mass and momentum, and the second part with analyzing the qualitative properties of some specific models. In particular, it is shown how some models known in the literature can be obtained as particular cases of the above framework. Finally, the third part develops a hyperbolicity analysis which is also referred to some specific models. (C) 2004 Elsevier Ltd. All rights reserved.

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 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 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


Subspace Pursuit for Compressive Sensing Signal Reconstruction We propose a new method for reconstruction of sparse signals with and without noisy perturbations, termed the subspace pursuit algorithm. The algorithm has two important characteristics: low computational complexity, comparable to that of orthogonal matching pursuit techniques when applied to very sparse signals, and reconstruction accuracy of the same order as that of linear programming (LP) optimization methods. The presented analysis shows that in the noiseless setting, the proposed algorithm can exactly reconstruct arbitrary sparse signals provided that the sensing matrix satisfies the restricted isometry property with a constant parameter. In the noisy setting and in the case that the signal is not exactly sparse, it can be shown that the mean-squared error of the reconstruction is upper-bounded by constant multiples of the measurement and signal perturbation energies.

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 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 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

compressive sensing
orthogonal matching pursuit
restricted isometry property

reconstruction algorithms
sparse signal reconstruction


OPERA: An open-source extensible router architecture for adding new network services and protocols In this paper, we present the design and implementation of a programmable and extensible router architecture. The proposed architecture not only provides the conventional packet forward/routing functions, but also the flexibility to integrate additional services (or extension) into a router. These extensions are dynamically loadable modules so one can easily deploy new services, such as reliability and security enhancement, onto the router in a dynamic and incremental fashion. To avoid new extensions that may monopolize system resource and degrade the performance of normal packet forwarding/routing function, we propose a novel CPU resource reservation scheme which facilitates the efficient use of resources and increases the stability of extension execution. To illustrate the "extensibility" and "effectiveness" of the proposed architecture, we present the results of a new service, namely, how to perform "Distributed Denial-of-Service (DDoS) attack traceback". In particular, we illustrate the deployment of the probabilistic marking in performing IP traceback. Note that this approach requires the collaboration of routers so that effective traceback can be performed. Currently, the programmable router platform is released as an open source(1) and we believe the system provides an ideal platform for researchers to experiment and to validate new services and protocols. (c) 2005 Elsevier Inc. 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 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


Accounting for the temporal dimension in case-based retrieval: A framework for medical applications Time-varying information embedded in cases has often been neglected and its role oversimplified in case-based reasoning systems. In several real-world problems, and in particular in medical applications, a case should capture the evolution of the observed phenomenon over time. To this end, we propose to represent temporal information at two levels: (1) at the case level, when some features are collected in the form of time series, because they describe parameters varying within a period of time (which corresponds to the case duration), and we aim at analyzing the system behavior within the case duration interval itself; (2) at the history level, when we are interested in reconstructing the evolution of the system by retrieving temporally related cases. In this paper, we describe a framework for case representation and retrieval that is able to take into account the temporal dimension, and is meant to be used in any time dependent domain, which is particularly well suited for medical applications. To support case retrieval, we provide an analysis of similarity-based time series retrieval techniques; to support history retrieval, we introduce possible ways to summarize the case content, together with the corresponding strategies for identifying similar instances in the knowledge base. A concrete application of our framework is represented by RHENE, a system for intelligent retrieval in the hemodialysis domain.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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

temporal cbr architecture
medical applications of cbr


Isolation of Anaplasma phagocytophilum Strain Ap-Variant 1 in a Tick-Derived Cell Line Ten isolates of the Ap-Variant 1 strain of Anaplasma phagocytophilum were made in the Ixodes scapularis (I. scapularis)derived cell line, ISE6. Two isolates were obtained from laboratory-infected goats and eight isolates were obtained from field-collected I. scapularis ticks. Each isolate showed 16S rRNA sequences identical to those as previously described for the Ap-Variant 1 strain. These are the first tissue culture isolates of the Ap-Variant 1 strain and will allow for further characterization of the biological and antigenic properties of this strain

O O B I 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

anaplasma phagocytophilum
ixodes scapularis

ap-variant 1
human granulocytic anaplasmosis


A new software for the measurement of magnetic moments using SQUID and spinner magnetometers ? A new software package, called CryoMag, facilitates the measurement of magnetic moments using both 3-component (i.e. Superconducting QUantum Interference Device) and 2-component (i.e. spinner) magnetometers. The measurement process is optimized for, but not limited to, stepwise demagnetization experiments commonly used in paleomagnetism. A graphical representation of the data is always visible to the user in the form of orthogonal, stereonet and decay diagrams, which can be represented in in situ, geographic or tilt corrected coordinates and can be saved as graphics files. Instrument specific settings, as well as arbitrary measurement positions, can be easily customized in a single configuration file. A comprehensive record of detailed measurement and statistical data is stored in XML (eXtensible Markup Language) based data files (?.cmag.xml). The final results of the measurements can be exported to several common file formats for further processing. The software is written in Python, an open source, cross-platform programming language and can therefore be used on popular operating systems like Windows, Linux and MacOS X. The complete source code is available on request from the author. The CryoMag open-source allows anyone to adapt the software to their specific equipment, file format and experimental requirements.

O O B O O O O O O O B O B O O O O B 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 B O O O O O O B O O O O O O O O O

magnetic moment
magnetization
magnetometer
arm
viscous


A self-tuning fuzzy logic design for perturbed time-delay systems with nonlinear input In this study, a method of self-tuning single-input fuzzy logic controller (ST-SIFLC) is proposed to efficiently eliminate the chattering problem of perturbed time-delay systems with nonlinear input. This work has the tuning scheme derived from only two rules of fuzzy inference that result in an ultimate equation from defuzzification. This tuning algorithm is convenient and easy to utilize. The control method provides a simple way to achieve asymptotic stability of the perturbed time-delay system. Other attractive features of the method include the fuzzy rules been greatly reduced in spite of the number of state variables, as well as the insensitivity to the perturbation, and the behavior of control input is dramatically improved better than previous report. Simulation results are presented to demonstrate the power of the method. (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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

fuzzy control
perturbed time-delay systems


Binary grayscale halftone pattern generation using binary artificial bee colony (bABC) In grayscale context, digital halftoning can be considered as binary pattern generation task where 0- and 1-valued pixels represent black and white, respectively. This paper presents application of artificial bee colony (ABC) in its modified binary form called binary ABC (bABC) toward generation of optimized binary halftone patterns. The human visual system incorporated cost function formulation addresses the tonal and structural parity between the original and halftone images along with pleasant halftone appearance. A pattern look-up table (p-LUT) approach is investigated including edge enhancement in halftone images. The results are presented pictorially and evaluated objectively. Comparison between the presented method and established halftoning techniques is also drawn to judge the potential of the presented bABC generated p-LUT approach. The pictorial presentations as well as objective evaluation show that the presented method may be potentially useful in the field of digital halftoning.

O O O O O O O B I 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 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 B I

digital halftoning
artificial bee colony

binary artificial bee colony
green-noise halftoning
pattern lut


From a domain analysis to the specification and detection of code and design smells Code and design smells are recurring design problems in software systems that must be identified to avoid their possible negative consequences on development and maintenance. Consequently, several smell detection approaches and tools have been proposed in the literature. However, so far, they allow the detection of predefined smells but the detection of new smells or smells adapted to the context of the analysed systems is possible only by implementing new detection algorithms manually. Moreover, previous approaches do not explain the transition from specifications of smells to their detection. Finally, the validation of the existing approaches and tools has been limited on few proprietary systems and on a reduced number of smells. In this paper, we introduce an approach to automate the generation of detection algorithms from specifications written using a domain-specific language. This language is defined from a thorough domain analysis. It allows the specification of smells using high-level domain-related abstractions. It allows the adaptation of the specifications of smells to the context of the analysed systems. We specify 10 smells, generate automatically their detection algorithms using templates, and validate the algorithms in terms of precision and recall on Xerces v2.7.0 and GanttProject v1.10.2, two open-source object-oriented systems. We also compare the detection results with those of a previous approach, iPlasma.

O O O O O O O O B O O O B I 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 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 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 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 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 O O O O O O O O

antipatterns
code smells
domain-specific language
algorithm generation
java