overcoming partitioning in large ad hoc networks using genetic algorithms We deal in this paper with the important problem of partitioning in ad hoc networks. In our approach, we assume that some devices might have other communication interfaces rather than Wi-Fi and/or Bluetooth allowing to connect remote devices (e.g., technologies such as GPRS or HSDPA). This would allow us to build hybrid networks for overcoming the network partitioning. Hence, the problem considered in this work is to establish remote links between devices (called bypass links) in order to maximize the QoS of the network by optimizing its properties to make it small world. Additionally, the number of this kind of links in the network should be minimized as well, since we consider that not all the devices have these communication capabilities, or it could be a requirement to minimize the use of the long range network (for example, in the case its use supposes some cost). We face the problem with four different GAs (both parallel and sequential) and compare their behaviors on six different network instances. All the algorithms were tested with a new encoding of the problem, which is demonstrated to provide more accurate results than the previously existing one.

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

cellular gas
cooperative coevolutionary gas
topology control


Palmprint authentication using fusion of wavelet and contourlet features Low resolution palmprint images consist of discriminative multisized and multidirectional principal lines and wrinkles. Intuitively, discrete wavelet transform (DWT) is a good choice to extract such patterns due to its space-frequency localization, multiresolution analysis (MRA) capability, and computational efficiency. However, most of the DWT-based palmprint recognition systems fail to report low equal error rate (EER) due to inherent limitations of DWT and shift-rotational variations in the intraclass palmprint images. This paper proposes the techniques for shift and rotation invariant feature extraction using DWT extension. The effectiveness of these techniques is tested on deliberately shifted and rotated palmprints. Further, limited directionality due to DWT is overcome by augmenting with features of contourlet transform. Contourlet transform can extract curve singularities effectively with multidirectional decomposition capability; wavelets are good in extracting point singularities. The different views of contourlet transform and DWT on palmprints motivate us to extract contourlet and wavelet features, and examine them for their individual and combined verification performances. The combined mode is found to perform well over their individual performances. The average EER (0.41%), obtained on PolyU-Online-Palmprint-Database-II (PolyU), is better than the existing wavelets/transform-based palmprint recognition approaches and comparable to the other state of the art palmprint recognition approaches. The computational burden on feature extraction and matching is substantially low thereby making the approach suitable for resource constrained environments. Copyright (C) 2010 John Wiley & Sons, Ltd.

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

feature extraction
fusion
wavelets
palmprint


Functions that have read-once branching programs of quadratic size are not necessarily testable A property of binary strings is constructed that has a representation by a collection of read-once branching programs of quadratic size but which is not E-testable for some fixed epsilon > 0. This shows that Newman's result [Proc. 41st FOCS, 2000, pp. 251-258] cannot be generalized to functions representable by read-once branching programs of polynomial size. (C) 2003 Elsevier Science B.V. All rights reserved.

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

computational complexity
binary decision diagrams
property testing


Digital transformations and the archival nature of surrogates Large-scale digitization is generating extraordinary collections of visual and textual surrogates, potentially endowed with transcendent long-term cultural and research values. Understanding the nature of digital surrogacy is a substantial intellectual opportunity for archival science and the digital humanities, because of the increasing independence of surrogate collections from their archival sources. The paper presents an argument that one of the most significant requirements for the long-term access to collections of digital surrogates is to treat digital surrogates as archival records that embody traces of their fluid lifecycles and therefore are worthy of management and preservation as archives. It advances a theory of the archival nature of surrogacy founded on longstanding notions of archival quality, the traces of their source and the conditions of their creation, and the functional work of the archive. The paper presents evidence supporting a secondary provenance derived from re-digitization, re-ingestion of multiple versions, and de facto replacement of the original sources. The design of the underlying research that motivates the paper and summary findings are reported separately. The research has been supported generously by the US Institute of Museum and Library Services.

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

large-scale digitization
preservation repositories


Performance of sufficient conditions for distributed quality-of-service support in wireless networks Given a wireless network where some pairs of communication links interfere with each other, we study sufficient conditions for determining whether a given set of minimum bandwidth quality-of-service requirements can be satisfied. We are especially interested in algorithms which have low communication overhead and low processing complexity. The interference in the network is modeled using a conflict graph whose vertices correspond to the communication links in the network. Two links are adjacent in this graph if and only if they interfere with each other due to being in the same vicinity and hence cannot be simultaneously active. The problem of scheduling the transmission of the various links is then essentially a fractional, weighted vertex coloring problem, for which upper bounds on the fractional chromatic number are sought using only localized information. We recall some distributed algorithms for this problem, and then assess their worst-case performance. Our results on this fundamental problem imply that for some well known classes of networks and interference models, the performance of these distributed algorithms is within a bounded factor away from that of an optimal, centralized algorithm. The performance bounds are simple expressions in terms of graph invariants. It is seen that the induced star number of a network plays an important role in the design and performance of such networks.

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

distributed algorithms
interference
wireless networks
conflict graph

quality of service (qos)
admission control
link scheduling


Simulative belief logic The ability of ascribing beliefs to others is crucial for human beings to explain and understand each other. Belief ascription has been studied intensively in philosophy and cognitive science. In this paper, we propose a formal framework for belief ascription by simulation. An agent first acquires information about another agent's beliefs by communication. She then inputs the information into her own belief system to generate more beliefs, which she will ascribe to the other agent. In this way, the agent uses her own as a model of others. We present a modal belief logic, which contains private announcement operators for agents' communication, and simulative belief operators for beliefs ascribed to others. We give a complete axiomatic system for the logic. (C) 2013 Elsevier B.V. All rights reserved.

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


A neural network ensemble-based model for on-line monitoring and diagnosis of out-of-control signals in multivariate manufacturing processes In multivariate statistical process control, most multivariate quality control charts are shown to be effective in detecting out-of-control signals based upon an overall statistics. But these charts do not relieve the need for pinpointing source(s) of the out-of-control signals, which would be very useful for quality practitioners to locate the assignable causes that give rise to the out-of-control situation. In this study, a learning-based model has been investigated for monitoring and diagnosing out-of-control signals in a bivariate process. In this model, a selective neural network (NN) ensemble approach (DPSOEN, Discrete Particle Swarm Optimization) was developed for performing these tasks. The simulation results demonstrate that the proposed model outperforms the conventional multivariate control scheme in terms of average run length (ARL), and can accurately classify source(s) of out-of-control signals. Extensive experiment is also carried out to examine the effects of six statistical features on the performance of DPSOEN. Analysis from this study provides guidelines in developing NN ensemble-based Statistical process control recognition systems in multivariate processes.

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

statistical process control
multivariate manufacturing processes

neural network ensemble
multivariate control chart


Improving national accounts Purpose - To present empirical and theoretical evidence that our national accounts are improper for model applications. To propose a design for a micro foundation of the basic economic data that will give analytical national accounts. To present arguments for the need for an academic and scientific foundation of national accounting. Design/methodology/approach - Reviews published works in the field. In the theoretical discussion simple index algebra and Edgeworth-Bowley boxes are used. Findings - Shows that conventional accounting methods and deflation procedures imply inconsistent national accounts. Research limitations/implications - To fulfill the idea presented, that new designs for sampling of basic data-based on new data technology have to be considered and developed. Also a new accounting system has to be developed based on modem administration systems. Practical implications - If the idea is fulfilled a new kind of national accounts suited for meaningful and analytical model applications will be available. The need to revise national accounts will not be a case to consider. Originality/value - The paper presents theoretical evidence that our national accounts are not analytical, which is requirement for meaningful model applications. National account users should be interested in the proposal and result.

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

cybernetics
accounting systems
economic doctrines
national economy


A projector/backprojector with slice-to-slice blurring for efficient three-dimensional scatter modeling Scatter correction is an important factor in single photon emission computed tomography (SPECT), Many scatter correction techniques, such as multiple-window subtraction and intrinsic modeling with iterative algorithms, have been under study for many years. Previously, we developed an efficient slice-to-slice blurring technique to model attenuation and system geometric response in a projector/backprojector pair, which was used in an ML-EM algorithm to reconstruct SPECT data. This paper proposes a projector/backprojector that models the three-dimensional (3-D) first-order scatter in SPECT, also using an efficient slice-to-slice blurring technique. The scatter response is estimated from a known nonuniform attenuation distribution map. It is assumed that the probability of detection of a first-order scattered photon from a photon that is emitted in a given source voxel and scattered in a given scatter voxel is proportional to the attenuation coefficient value at that voxel, Monte Carlo simulations of point sources and an MCAT torso phantom were used to verify the accuracy of the proposed projector/backprojector model. An experimental Jaszczak torso/cardiac phantom SPECT study tvas also performed, For a 64 x 64 x 64 image volume, it took 8.7 s to perform each iteration per slice on a Sun ULTRA Enterprise 3000 (167 MHz, 1 Gbyte RAM) computer, when modeling 3-D scatter, attenuation, and system geometric response functions. The main advantage of the proposed method is its easy implementation and the possibility of performing reconstruction in clinically acceptable time.

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

gaussian blurring
iterative image reconstruction


Improved shape for multi-surface blends For many design applications, where multiple primary surface pieces meet, the distribution of curvature is more important than formally achieving exact curvature continuity. For parametric spline surfaces, when constructing a multi-sided surface cap, we demonstrate a strong link between the uniform variation of the re-parameterization between (boundary) data of the joining pieces and a desirable distribution of curvature. We illustrate this interdependence between parameterization quality and surface quality by developing a G1 bi-quintic surface cap consisting of n pieces that smoothly fills holes in a piecewise bi-cubic tensor-product spline complex. These bi-5 surface caps have arguably better shape than higher-degree, formally curvature continuous alternatives.

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

shape curvature multi-surface
multi-sided
bi-quintic


Confidence intervals based on estimators with unknown rates of convergence Confidence interval construction for an unknown parameter typically requires precise knowledge of the convergence rate of a point estimator targeting the parameter and explicit specification of the asymptotic distribution of the (standardized) point estimator. A subsampling method is presented here for obtaining confidence intervals which requires very little knowledge of the estimator's asymptotic distribution or of its convergence rate; the asymptotic distribution may be non-Normal, and the convergence rate may differ from the familiar n1/2. Serial dependence is allowed in the observed data sequence, and the dependence mechanism can be unknown. Under mild conditions, the intervals asymptotically obtain the nominal coverage level and interval width shrinks to zero as sample size increases. Finite-sample behavior of the proposed confidence interval is studied by example, simulation, and Edgeworth expansion.

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

heavy-tails
nonparametric
resampling
time series


Effect of Gravity on the Caloric Stimulation of the Inner Ear Robert Brny won the 1914 Nobel Prize in medicine for his convection hypothesis for caloric stimulation. Microgravity caloric tests aboard the 1983 SpaceLab 1 mission produced nystagmus results that contradicted the basic premise of Brny's convection theory. In this paper, we present a fluid structural analysis of the caloric stimulation of the lateral semicircular canal. Direct numerical simulations indicate that on earth, natural convection is the dominant mechanism for endolymphatic flow. However, in the microgravity environment of orbiting spacecraft, where buoyancy effects are mitigated, an expansive convection becomes the sole mechanism for producing endolymph motion and cupular displacement. Transient 1 g and microgravity case studies are presented to delineate the different dynamic behaviors of the 1 g and microgravity endolymphatic flows. The associated fluid-structural interactions are also analyzed based on the time evolution of cupular displacements.

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

fluid structural interaction
vestibular system
cfd
caloric test


Simulation and modelling of pn junction actuators The pn junction actuators are a new family of transducers with great potential for integration of micro- and nano-mechanical devices with electronics. In this paper, the finite element multiphysics simulation of our earlier work that employs a pn junction in order to bring a micro-cantilever under resonance is presented. The advantages and disadvantages of using this method over other possible actuation techniques are discussed. A theoretical model has been developed in order to describe the behaviour of a device comprised of a Schottky diode mounted on a cantilever. It was shown that the theoretical modelling is compatible with the experimental results. However, the theoretical modelling becomes exceedingly difficult or even impossible as more complicated configurations of junctions need to be studied. Consequently developing a reliable simulation method that can be applied to such cases is essential to fully harness the potential designs and applications of depletion region actuators. In this paper, a method to model the space charge regions of pn junction actuators is described and a method to couple the electrostatic and mechanical domains is described. An effective meshing method is presented which yields convergent results for narrow junction widths. The simulation data is shown to be congruent with experimental and theoretical results.

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

multiphysics simulations
finite element method
electrostatics


Iconic animation for activity-based construction simulation This paper discusses the development of an animation tool for the activity-based construction (ABC) modeling and simulation system. The tool uses an activity-based network diagram, i.e., ABC simulation model, as the animation background image, and uses precreated two-dimensional (213) iconic images for simulation entities (e.g., resources). The animation process displays the queuing status and dynamic movements of 2D iconic images on the background. It also distinguishes active and idle states of resources and activities. Dynamic reports are available for selected activities with graphs including the production rate and utilization of involved resources. From visualizing the change of status of a simulation process and dynamic interaction between simulation entities in the process, the user can better understand the dynamic nature of the construction process. Animation provides an avenue to demonstrate how dynamic operations are simulated. It also Provides an effective tool for the user to verify a simulation model and to validate the obtained simulation results. Compared to other systems, the ABC animation does not require any extra effort in addition to the ABC simulation model constructed for simulation purposes. Therefore, the presented technology greatly reduces the time and cost for achieving animation. A variety of useful information can be observed through animation, and is illustrated using two construction 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

construction management
simulation models
imaging techniques


Isotropic-BEM coupled with a local point interpolation method for the solution of 3D-anisotropic elasticity problems This paper presents a solution procedure for the three-dimensional linear elastic problem with anisotropic properties. The approach uses the partition of the displacement field into complementary and particular parts. The former is the solution of a differential equation similar to that of an isotropic elastostatic and is obtained by the isotropic boundary element method. The particular integral is obtained by solving the corresponding strong form differential equations, using the local radial point interpolation method. This promising approach is simple to implement and leads to highly accurate solutions in some simple tested situations.

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

anisotropic elasticity
isotropic-bem
meshfree strong form
radial basis function


On the validation and application of fluid-structure interaction analysis of reactor vessel internals at loss of coolants accidents This paper presents results from various numerical simulations using ADINA fluid-structure interaction capabilities in the Swedish nuclear industry. The purpose with the simulations is to determine reactor pressure vessel internals response due to rapid depressurization associated with a pipe break. The fluid has been either steam or water in the different analyses. This paper presents a short description of the validation against the HDR experiment and also some of the actual calculations that have been performed. Two models have been used to apply the method on real geometry with different fluid properties, steam and water. Hence, the applicability of the ADINA system to variations of physical behaviour of the fluid and model size is shown. (C) 2003 Elsevier Science 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 B O O O O O O B O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O 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


Identification of Indian languages using multi-level spectral and prosodic features In this paper spectral and prosodic features extracted from different levels are explored for analyzing the language specific information present in speech. In this work, spectral features extracted from frames of 20ms (block processing), individual pitch cycles (pitch synchronous analysis) and glottal closure regions are used for discriminating the languages. Prosodic features extracted from syllable, tri-syllable and multi-word (phrase) levels are proposed in addition to spectral features for capturing the language specific information. In this study, language specific prosody is represented by intonation, rhythm and stress features at syllable and tri-syllable (words) levels, whereas temporal variations in fundamental frequency (F 0 contour), durations of syllables and temporal variations in intensities (energy contour) are used to represent the prosody at multi-word (phrase) level. For analyzing the language specific information in the proposed features, Indian language speech database (IITKGP-MLILSC) is used. Gaussian mixture models are used to capture the language specific information from the proposed features. The evaluation results indicate that language identification performance is improved with combination of features. Performance of proposed features is also analyzed on standard Oregon Graduate Institute Multi-Language Telephone-based Speech (OGI-MLTS) database.

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

language identification
intonation
rhythm
stress
prosodic features
gaussian mixture models


Recurrent points and periodic points of graph maps Let G be a graph and f is an element of C(0)(G). It is proved that = G if = G and P(f) not equal empty set. This result generalizes several corresponding results given in [3] and [10].

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

recurrent point
periodic point
transitivity
graph map


Empirical comparisons between Kaplan-Meier and Nelson-Aalen survival function estimators The Kaplan-Meier is the most commonly used estimator of the survival function, while the Nelson-Aalen is an alternative estimator for the same function. There are many asymptotic results for these estimators in the literature. In particular, it is known that they are asymptotically equivalent. On the other hand empirical results comparing these estimators are difficult to obtain and they are necessary to guide applied statisticians. This paper addresses small-sample properties of these survival function estimators. Monte Carlo simulations are performed in order to compare both estimators. Percentile and survival fraction estimates of the survival function are used to attain this goal. The results show a slight superiority in favor of the Nelson-Aalen estimator in survival fraction estimation. However for percentile estimation the Kaplan-Meier estimator presents a better performance for decreasing failure rates while the Nelson-Aalen estimator provides better results for increasing failure rates.

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

mean square error
percentiles
product-limit estimator
step function
survival fractions
weibull model


Verification of humans using the electrocardiogram A feasibility study on the potential of the electrocardiogram (ECG) for biometrical applications is presented. A test set of 234 ECG recordings from 74 subjects was compiled emulating a realistic scenario for ECG biometrics by using short measurements of 10s length in combination with a practicable choice of ECG leads. The long-term stability of the individual ECG was investigated during time periods up to several years. Verification and identification was done by utilizing the heart vector and a simple distance measure. As a result, encouraging error rates were obtained; for verification, for instance, the achieved equal error rate was smaller than 3%.

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


on the efficiency of adaptive mcmc algorithms We study a class of adaptive Markov Chain Monte Carlo (MCMC) processes which aim at behaving as an "optimal" target process via a learning procedure. We show, under appropriate conditions, that the adaptive process and "optimal" (nonadaptive) MCMC algorithm share identical asymptotic properties. The special case of adaptive MCMC algorithms governed by stochastic approximation is considered in details and we apply our results to the adaptive Metropolis algorithm of [1]. We also propose a new class of adaptive MCMC algorithms, called quasi-perfect adaptive MCMC which possesses appealing theoretical and practical properties, as demonstrated through numerical simulations.

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

stochastic approximation
mcmc
markov chain monte carlo
metropolis algorithm

coupling
adaptive markov chains
rate of convergence


Improving the Prediction of Clinical Outcomes from Genomic Data Using Multiresolution Analysis The prediction of patient's future clinical outcome, such as Alzheimer's and cardiac disease, using only genomic information is an open problem. In cases when genome-wide association studies (GWASs) are able to find strong associations between genomic predictors (e. g., SNPs) and disease, pattern recognition methods may be able to predict the disease well. Furthermore, by using signal processing methods, we can capitalize on latent multivariate interactions of genomic predictors. Such an approach to genomic pattern recognition for prediction of clinical outcomes is investigated in this work. In particular, we show how multiresolution transforms can be applied to genomic data to extract cues of multivariate interactions and, in some cases, improve on the predictive performance of clinical outcomes of standard classification methods. Our results show, for example, that an improvement of about 6 percent increase of the area under the ROC curve can be achieved using multiresolution spaces to train logistic regression to predict late-onset Alzheimer's disease (LOAD) compared to logistic regression applied directly on SNP data.

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

multiresolution
pattern recognition
prediction
clinical outcomes
snps

human genome
single nucleotide polymorphisms
wavelets
genomics


New design for a 6 dof vibration simulator with improved reliability and performance Simulators are an indispensable tool to study present-day machinery dynamics in a repeatable way and under controlled laboratory conditions. In the past Stewart configurations are described thoroughly using inverse kinematics and forward kinematics. When optimising such a design for specific performance criteria, kinematics and hydraulic restrictions are to be taken into account. In this paper an already designed and constructed 6 degrees of freedom (dof) electro-hydraulic vibration test rig is virtually redesigned, constructed and validated using the Stewart configuration as a basis. The former structure has fundamental faults, which prohibit an optimised performance. An important weakness lies in the use of Hook's joints, which are too weak for the exerted forces and introduce an eigenfrequency that lies in the excitation band of the simulator. The aim is to find the optimal angle between ground and cylinder ? that provides minimum rotation, force and torque within the Hook's joints, satisfies a number of performance criteria, respects the symmetry of the construction, tries to minimise the asymmetry in the cylinder movement and provides a movement of the platform with high resolution. An inverse kinematics and a dynamic model are constructed. The result is a vibration simulator with great stability and performance.

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


Optimizing yard assignment in an automotive transshipment terminal This paper studies a yard management problem in an automotive transshipment terminal. Groups of cars arrive to and depart from the terminal in a given planning period. These groups must be assigned to parking rows under some constraints resulting from managerial rules. The main objective is the minimization of the total handling time. Model extensions to handle application specific issues such as a rolling horizon and a manpower leveling objective are also discussed. The main features of the problem are modeled as an integer linear program. However, solving this formulation by a state-of-the-art solver is impractical. In view of this, we develop a metaheuristic algorithm based on the adaptive large neighborhood search framework. Computational results on real-life data show the efficacy of the proposed metaheuristic algorithm.

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

yard management
automotive transshipment terminal
adaptive large neighborhood search


japan, moving towards becoming a multi-cultural society, and the way of disseminating multilingual disaster information to non-japanese speakers Japan is moving towards becoming a multi-cultural society with the increasing number of foreign residents, with a background of the ageing Japanese population and low-birth rate. We discuss the present situation of the level and type of information provided to non-Japanese speakers, and then introduce the Multilingual Disaster Information System to translate a range of information on natural disasters quickly and accurately into multiple languages, which the authors of this paper have developed as members of the Multilingual Disaster Information System Consortium. We present details on how our proposed language service could service the foreign population in Japan.

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


Averaging fuzzy biopolymers Let d be a metric on the set FP(X) of fuzzy subsets of a finite set X. A midpoint of two fuzzy subsets mu, v, epsilon F P(X) is any fuzzy subset zeta epsilon FP(X) such that d(xi,mu) = d(xi,nu ) = (/1)(2)(mu,nu). These midpoints can be used to represent "middle ways" or "compromises" between two situations described by the fuzzy subsets mu and nu Now, the imprecise knowledge of a nucleic acid or protein sequence of length N can be modeled by means of a fuzzy biopolyiner, a fuzzy subset of a kN-element set with k the number of bases, 4, in the case of nucleic acids, and of amino acids, 20, in the case of proteins. Thus, a midpoint of two fuzzy biopolymers of the same length can be understood as an average of the knowledge of the sequences represented by them. In this paper we explicitly describe the midpoints of two fuzzy biopolymers with respect to distances obtained by aggregating, through several suitable mappings, metrics on each position of the sequences represented by the fuzzy biopolymers. (c) 2004 Elsevier B.V. All rights reserved.

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

distance
fuzzy polynucleotide
profile
fuzzy polypeptide


Parameter estimation for SAR moving target in complex image domain Based on the proposed parametric model of SAR ground moving target in the complex image domain, this paper derives the Cramer-Rao bounds (CRB) for the unknown model parameters estimation and obtains the inherent limitations for the moving target motion estimation in the SAR complex image domain. Firstly, the relationships are analyzed among the estimation performance and the target's scattering intensity, Doppler parameters, motion parameters, as well as the power spectra of the target and the clutter. Furthermore, the parameter estimation performance is compared in the signal domain and the complex image domain (CID) to draw some useful conclusions. Besides, the reduction resolution processing is proposed to improve the parameter estimation, and its performance improvement is also presented with analytic expressions. For the homogeneous background, it is shown that the accurate parameter estimation and azimuth location may be realized for SAR ground moving target in the complex image domain. Finally, some numerical experiments are provided to demonstrate the effectiveness of the proposed methods.

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

moving target
complex image domain
parameter estimation

synthetic aperture radar (sar)
cramer-rao bound (crb)
reduce resolution processing (rrp)


Smooth, 3D Ge transistor channels by heteroepitaxial growth Crystalline germanium (Ge) is a prime candidate as a material for high-performance transistors due to its higher electron and hole mobility with respect to those of silicon. In this study, we present a novel method of fabricating epitaxial Ge structures of high crystalline and morphological quality directly onto Si substrates, in which 3D Ge structures are grown by selective epitaxy then annealed in a hydrogen ambient at 850C. Under such annealing, the surface of the Ge structures deform by surface diffusion to form smooth, rounded shapes for which the surface energy is at a local minima. The apparent smoothness of the surface, along with the decreased defect density expected to exist in these heteroepitaxial Ge structures, suggest they are adequate for use as transistor channels.

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

heteroepitaxial growth
selective epitaxy
germanium
surface diffusion

thermal annealing
channel deformation
three-dimensional channels
transistor channel engineering


A model for the gray-intensity distribution of historical handwritten documents and its application for binarization In this article, our goal is to describe mathematically and experimentally the gray-intensity distributions of the fore- and background of handwritten historical documents. We propose a local pixel model to explain the observed asymmetrical gray-intensity histograms of the fore- and background. Our pixel model states that, locally, the gray-intensity histogram is the mixture of gray-intensity distributions of three pixel classes. Following our model, we empirically describe the smoothness of the background for different types of images. We show that our model has potential application in binarization. Assuming that the parameters of the gray-intensity distributions are correctly estimated, we show that thresholding methods based on mixtures of lognormal distributions outperform thresholding methods based on mixtures of normal distributions. Our model is supported with experimental tests that are conducted with extracted images from DIBCO 2009 and H-DIBCO 2010 benchmarks. We also report results for all four DIBCO benchmarks.

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

binarization
thresholding
normal
historical documents
handwritten
dibco


A low-cost configurability test strategy for an embedded analog circuit This paper proposes a self-test strategy, analog configurability test (ACT), for an embedded analog configurable circuit (EACC) composed of operational amplifiers and interconnection resources that are present in the MSP430 microcontroller family from Texas Instruments. The ACT strategy minimizes the cost in hardware overhead by employing only the hardware and software resources of the microcontroller. Our test proposal consists in programming a reduced set of available configurations for the EACC and testing its functionality by measuring only a few key parameters. The processor executes an embedded test routine that sequentially programs the configurations, acquires data from an ADC channel and performs required calculations. The test strategy is experimentally evaluated using a commercial hardware provided by the vendor. Our experimental results show very good repeatability, with errors below the expected.

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

analog circuits
analog self-test
embedded analog circuit testing
microcontroller test


A Double-Layered Mixture Model for the Joint Analysis of DNA Copy Number and Gene Expression Data Copy number aberration is a common form of genomic instability in cancer. Gene expression is closely tied to cytogenetic events by the central dogma of molecular biology, and serves as a mediator of copy number changes in disease phenotypes. Accordingly, it is of interest to develop proper statistical methods for jointly analyzing copy number and gene expression data. This work describes a novel Bayesian inferential approach for a double-layered mixture model (DLMM) which directly models the stochastic nature of copy number data and identifies abnormally expressed genes due to aberrant copy number. Simulation studies were conducted to illustrate the robustness of DLMM under various settings of copy number aberration frequency, confounding effects, and signal-to-noise ratio in gene expression data. Analysis of a real breast cancer data shows that DLMM is able to identify expression changes specifically attributable to copy number aberration in tumors and that a sample-specific index built based on the selected genes is correlated with relevant clinical information.

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


Sliding mode-like fuzzy logic control with self-tuning the dead zone parameters In this paper, a fuzzy logic controller (FLC) is designed based on the similarity between the FLC and the sliding mode control (SMC), The proposed scheme provides the sliding mode-like PLC with fast self-tuning the dead-zone parameters (boundary layer thickness) under parameter variations of the controlled system. To show the validity and the effectiveness of the proposed control method, simulations are performed for the position control of a rotary inverted pendulum.

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

fuzzy logic controller
sliding mode control


Usage-based dynamic pricing of Web services for optimizing resource allocation Web services technology is becoming an important technological trend in Web application development and integration. Based on open standards, such as SOAP, WSDL, and UDDI, Web services allow Web-based applications to communicate with each other through standardized XML messaging and to form loosely coupled distributed systems. Although the open feature of Web services benefits service providers in servicing consumers, the unlimited computing resources access of Web services to network bandwidth, storage throughput, and CPU time may lead to overexploitation of the resources when applications based on the Web services technology are widely accepted. Therefore, it is critical to optimize the operation of Web services, subject to the QoS requirements of service requests, to assure the total benefits of the service providers and the service consumers. This paper proposes a usage-based dynamic pricing approach to optimizing resource allocation of Web services in the principle of economics, and reports on a pilot implementation demonstrating the technical feasibility of the proposed approach.

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

resource pricing
incentive compatibility


Statistical SRAM Read Access Yield Improvement Using Negative Capacitance Circuits SRAM has become the dominant block in modern ICs and constitutes more than 50% of the die area. The increase of process variations with continued CMOS technology scaling is considered one of the major challenges for SRAM designers. This process variations increase causes the SRAM cells to functionally fail and reduces the chip functional yield considering the static noise margin stability failures (i.e., cell flips when accessed), write failures (i.e., cell is not written within the write window), and read access failures (i.e., incorrect read operation). In this paper, novel negative capacitance circuits are developed, for the first time, to statistically improve the SRAM read access yield under process variations by reducing the bitlines parasitic capacitance. Post layout simulation results, referring to an industrial hardware-calibrated TSMC 65-nm CMOS technology, show that the adoption of the negative capacitance circuit to a 512 SRAM cells column is capable of improving the read access yield from 61.9% to 100%.

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

negative capacitance circuit
process variations
sram cells

deep sub-micrometer
read access failure
statistical yield improvement


On-line resource management with application to routing and scheduling We propose a framework to model on-line resource management problems based on an on-line version of positive linear programming. We consider both min cost problems and max benefit problems and propose logarithmic competitive algorithms that are optimal up to a constant factor. The proposed framework provides a general methodology that applies to a wide class of on-line problems: shop scheduling, packet routing, and in general a class of packing and assignment problems. Previously studied problems as on-line multiprocessor scheduling and on-line virtual circuit routing can also be modeled within this framework.

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


towards data warehouse design This paper focuses on data warehouse modelling. The conceptual model we defined, is based on object concepts extended with specific concepts like generic classes, temporal classes and archive classes. The temporal classes are used to store the detailed evolutions and the archive classes store the summarised data evolutions. We also provide a flexible concept allowing the administrator to define historised parts and non-historised parts into the warehouse schema. Moreover, we introduce constraints which configure the data warehouse behaviour and these various parts. To validate our propositions, we describe a prototype dedicated to the data warehouse design.

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

conceptual data warehouse model
object modelling
temporal data


Routing in wormhole-switched clustered networks with applications to fault tolerance This paper presents a novel technique for routing in wormhole-switched multiprocessor interconnection networks with clustered configuration. The network model used here consists of a set of clusters interfaced through a common central network. We assume that the central network and the clusters use independent algorithms to route messages between their internal nodes. A technique for deriving a global routing algorithm based on the local algorithms is presented, which allows the transfer of messages between any pair of nodes in the network. This proposed method is shown to be deadlock-free with two virtual channels. The clustered network model and the proposed routing technique can be used to enhance the fault tolerance capability of existing routing algorithms. In particular, we describe fault-tolerant routing methods for meshes, which can tolerate any arbitrary fault distribution without disabling connected healthy nodes.

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

routing algorithms
clustered networks
fault tolerance
meshes


Chaotic ant swarm approach for data clustering Clustering divides data into meaningful or useful groups (clusters) without any prior knowledge. It is a key technique in data mining and has become an important issue in many fields. This article presents a new clustering algorithm based on the mechanism analysis of chaotic ant swarm (CAS). It is an optimization methodology for clustering problem which aims to obtain global optimal assignment by minimizing the objective function. The proposed algorithm combines three advantages into one: finding global optimal solution to the objective function, not sensitive to clusters with different size and density and suitable to multi-dimensional data sets. The quality of this approach is evaluated on several well-known benchmark data sets. Compared with the popular clustering method named k-means algorithm and the PSO-based clustering technique, experimental results show that our algorithm is an effective clustering technique and can be used to handle data sets with complex cluster sizes, densities and multiple dimensions.

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

chaotic ant swarmoptimization
optimization based clustering


Not-Aligned Optical Cell Switching Paradigm Most existing all-optical switching paradigms assume that different wavelengths are switched independently, which limits the scalability of core switches. In the optical cell switching (OCS) paradigm, time is divided into time slots of fixed size by time-division multiplexing, and the wavelengths in a time slot are all bundled. Thus, each OCS core switch (OCX) requires a single switching plane and performs mere time-space switching. In OCS, each OCX requires optical slot synchronizers (OSYNs) at all inputs for the arrival slots to be aligned so that cells can be simultaneously forwarded. We propose a new OCS paradigm-not-aligned OCS-where the alignment process takes place inside the OCXs. In not-aligned OCS, no OSYNs are required, and the alignment resources are shared between all input fibers. Therefore, the proposal fulfills diverse objectives: the total number of fiber delay loops and the hardware cost are reduced, and the number of switching operations is also lower than in aligned OCS. Moreover, cell arrival time at the switch is not critical, and the network becomes simpler and more flexible. We also propose a new scheduling algorithm for not-aligned OCS networks. We provide simulation results that show that the not-aligned OCS schema takes the connection blocking probability to reasonable values.

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

all-optical network
optical packet switching


A sufficient condition for a planar graph to be class 1 We prove that every planar graph G with Delta = 6 is of Class 1 if it does not contain a 5-cycle with a chord. (c) 2007 Elsevier B.V. All rights reserved.

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


A Semantic Model for Graphical User Interfaces We give a denotational model for graphical user interface (GUI) programming using the Cartesian closed category of ultrametric spaces. The ultrametric structure enforces causality restrictions on reactive systems and allows well-founded recursive definitions by a generalization of guardedness. We capture the arbitrariness of user input (e. g., a user gets to decide the stream of clicks she sends to a program) by making use of the fact that the closed subsets of an ultrametric space themselves form an ultrametric space, allowing us to interpret nondeterminism with a "powerspace" monad. Algebras for the powerspace monad yield a model of intuitionistic linear logic, which we exploit in the definition of a mixed linear/non-linear domain-specific language for writing GUI programs. The non-linear part of the language is used for writing reactive stream-processing functions whilst the linear sublanguage naturally captures the generativity and usage constraints on the various linear objects in GUIs, such as the elements of a DOM or scene graph. We have implemented this DSL as an extension to OCaml, and give examples demonstrating that programs in this style can be short and readable.

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

languages
theory
design
denotational semantics
functional reactive programming
guarded recursion


automatic diagnosis and response to memory corruption vulnerabilities Cyber attacks against networked computers have become relentless in recent years. The most common attack method is to exploit memory corruption vulnerabilities such as buffer overflow and format string bugs. This paper presents a technique to automatically identify both known and unknown memory corruption vulnerabilities. Based on the observation that a randomized program usually crashes upon a memory corruption attack, this technique uses the crash as a trigger to initiate an automatic diagnosis algorithm. The output of the diagnosis includes the instruction that is tricked to corrupt data, the call stack at the time of corruption, and the propagation history of corrupted data. These results provide useful information in fixing the vulnerabilities. Moreover, the diagnosis process also generates a signature of the attack using data/address values embedded in the malicious input message, and is used to block future attacks. Such a signature is further associated with the program execution state to reduce false positives without decreasing the detection rate. The proposed techniques enable the development of a decentralized self-diagnosing and self-protecting defense mechanism for networked computers. We report the implementation experience and experimental evaluation of a prototype system on Linux.

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

diagnosis
input
buffer overflow
experience
response
paper
memory corruption attack
propagation
vulnerabilities
detection
method
values
experimental evaluation
exploit
prototype
message
implementation
instruction
process
data
signature
algorithm
future
attack
bugs

association
developer
computation
addressing
timing
message filtering
attack diagnosis
informal
strings
randomization
observability
histories
systems
memorialized
decentralization
embedding
blocking
false positive


manufacturing yield of qca circuits by synthesized dna self-assembled templates DNA self-assembly has been proposed as a promising "bottomup" manufacturing technique to supersede photolithography at nanometer scale. This paper discusses the application of DNA self-assembly for manufacturing templates of QCA circuits. Using a synthesis algorithm, a tile set of reduced cardinality is utilized for growing multiple patterns of the same QCA circuit on a two-dimensional template. Errors in the DNA self-assembly process are then considered; their implications on the operation of faulty QCA circuits following the deposition of QCA cells, are discussed. The errors are mostly clustered and along facets; a detailed treatment with respect to manufacturing yield, circuit functionality, error tolerance and growth speed is pursued. As a general conclusion, it is shown that errors are pattern dependent, hence the faults occurring in the assembled QCA circuits are physically and logically different.

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


MCELCCh-FDP: Financial distress prediction with classifier ensembles based on firm life cycle and Choquet integral Financial distress prediction (FDP) has always been an important issue in the business and financial management. This research proposed a novel multiple classifier ensemble model based on firm life cycle and Choquet integral for FDP, named MCELCCh-FDP, as a new approach to tackle with financial distress. Empirical study based on Chinese listed companies real data is conducted, and the results show that the proposed MCELCCh-FDP model has higher prediction accuracy than single classifiers. In order to verify the prediction capability of firm life cycle and Choquet integral in FDP model, comparative analysis is conducted. The experiment results indicate that the introduction of firm life cycle and Choquet integral in FDP can greatly enhance prediction accuracy.

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

financial distress
choquet integral
firm life cycle
ensemble


mixture of gaussian models and bayes error under differential privacy Gaussian mixture models are an important tool in Bayesian decision theory. In this study, we focus on building such models over statistical database protected under differential privacy. Our approach involves querying necessary statistics from a database and building a Bayesian classifier over the noise added responses generated according to differential privacy. We formally analyze the sensitivity of our query set. Since there are multiple methods to query a statistic, either directly or indirectly, we analyze the sensitivities for different querying methods. Furthermore we establish theoretical bounds for the Bayes error for the univariate (one dimensional) case. We study the Bayes error for the multivariate (high dimensional) case in experiments with both simulated data and real life data. We discover that adding Laplace noise to a statistic under certain constraint is problematic. For example variance-covariance matrix is no longer positive definite after noise addition. We propose a heuristic method to fix the noise added variance-covariance matrix.

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


an explanatory analysis on eclipse beta-release bugs through in-process metrics Failures after the release of software products are expensive and time-consuming to fix. Each of these failures has different reasons pointing into different portions of code. We conduct a retrospective analysis on bugs reported after beta release of Eclipse versions. Our objective is to investigate what went wrong during the development process. We identify six in-process metrics that have explanatory effects on beta-release bugs. We conduct statistical analyses to check relationships between files and metrics. Our results show that files with beta-release bugs have different characteristics in terms of in-process metrics. Those bugs are specifically concentrated on Eclipse files with little activity: few edits by few committers. We suggest that in-process metrics should be investigated individually to identify beta-release bugs. Companies may benefit from such a retrospective analysis to understand characteristics of failures. Corrective actions can be taken earlier in the process to avoid similar failures in future releases.

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


The story behind the story: Physician skepticism about relying on clinical information technologies to reduce medical errors In order to better understand physicians perspectives about the use of clinical information technology (CIT) to reduce medical errors, we asked physicians about opportunities and issues around clinical use of computerized physician order entry (CPOE) systems, order sets within CPOE, and handheld computers (HHCs). We conducted 10 focus groups including 71 physicians involved in technology implementation efforts across the US between April 2002 and February 2005. Two major themes emerged across focus groups around reliance on CIT to reduce errors: (1) can it work? and (2) at what cost to the medical profession? Within the first theme, physicians expressed concern about the appropriateness of physician-directed CIT as a solution for medical errors, concerns regarding the current technical capabilities and level of technical support for CIT solutions, and concern about the introduction of new errors. Within the second theme, physicians were particularly concerned about time efficiency and workload redistribution associated with the introduction of CIT. Across focus groups, physicians tended to generalize about the role of all IT in their lives, potentially biasing opinions about specific technologies. Health care organizations attempting to promote physician use of CIT are advised to deepen consideration of physicians perspectives about technology adoption and use in order to address their concerns, reduce skepticism, and increase the likelihood of implementation success.

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

computerized physician order entry
medical errors

medical informatics
attitude to computers
information systems
computers handheld


Guardband Optimization for Cellular Systems Applying Raised Cosine Windowed OFDM In this paper, we study the optimization of the guardbands between adjacent channels in OFDM-based cellular systems. It is well known that OFDM signals have strong sidelobes in spectrum, which lead to large necessary guardbands between adjacent channels to avoid severe adjacent channel interference. To reduce such guardbands and, thus, to increase the spectrum usage efficiency, we propose to apply raised cosine (RC) windowing of the time domain OFDM signals, which is a simple, efficient and effective method. In this context, an interesting tradeoff can be observed, i.e., a higher roll-off factor (ROF) of the RC-window is associated with higher signal overhead in time (in other words, longer OFDM symbol duration), but lower guardband overhead in frequency (due to better sidelobe suppression). We study this tradeoff and found out that the ROF and the guardband size can be jointly optimized, in the sense that the per-channel data rate can be maximized under adjacent channel interference constraints. Our mathematical analysis further shows that such joint optimization can be reduced to a single dimension optimization, i.e. the optimization of the ROF. Afterwards, this optimization procedure is illustrated and verified via numerical simulation, showing that large data rate increase can be achieved when using RC-windowing with an optimized ROF. Finally, practical analysis of the instantaneous per-OFDM symbol interference further verified the effectiveness of the proposed approach.

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

ofdm
sidelobe suppression
adjacent channel interference

raised cosine window
out-of-band
spectral shape


WTA 2011 The following papers constitute a selection of the best papers presented at the Third and the Fourth Workshop on Adaptive Technology held at the Escola Politecnica da Universidade de Sao Paulo, Brazil, on January 31 and February 1, 2011. This event gathered a significant number of Brazilian and foreign researchers interested in the field of adaptivity. The papers published herein are a good sample of the recent achievements in this area.

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

adaptive automaton
adaptive systems
self-modifying system


Texture synthesis using exact neighborhood matching In this paper we present an elegant pixel-based texture synthesis technique that is able to generate visually pleasing results from source textures of both stochastic and structured nature. Inspired by the observation that the most common artifacts that occur when synthesizing textures are high-frequency discontinuities, our technique tries to avoid these artifacts by forcing at least one of the direct neighboring pixels in each causal neighborhood to match within a predetermined threshold. This does not only avoid deterioration of the visual quality, but also results in faster synthesis timings. We demonstrate our technique on a variety of stochastic and structured textures.

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

pixel-based techniques
markov random field


Contributions of different parts of spinspin interactions to quantum correlations in a spin ring model in an external magnetic field We study quantum correlations in a bipartite heteronuclear \((N-1)\times 1\) system in an external magnetic field. The system consists of a spin ring with an arbitrary number \(N-1\) of spins on the ring and one spin in its center. The spins on the ring are connected by secular dipoledipole interactions and interact with the central spin through the Heisenberg \(zz\)-interaction. We show that the quantum discord, describing quantum correlations between the ring and the central spin, can be obtained analytically for this model in the high-temperature approximation. The model allows us to find contributions of different parts of the spinspin interactions to quantum correlations. We also investigate the evolution of quantum and classical correlations at different numbers of spins.

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

quantum correlations
classical correlations
quantum discord
spin ring

quantum information
conditional entropy
longitudinal spin interactions
transverse spin interactions


optimization techniques for high-performance digital circuits The relentless push for high performance in custom digital circuits has led to renewed emphasis on circuit optimization or tuning. The parameters of the optimization are typically transistor and interconnect sizes. The design metrics are not just delay, transition times, power and area, but also signal integrity and manufacturability. This tutorial paper discusses some of the recently proposed methods of circuit optimization, with an emphasis on practical application and methodology impact. Circuit optimization techniques fall into three broad categories. The first is dynamic tuning, based on time-domain simulation of the underlying circuit, typically combined with adjoint sensitivity computation. These methods are accurate but require the specification of input signals, and are best applied to small data-flow circuits and "cross-sections" of larger circuits. Efficient sensitivity computation renders feasible the tuning of circuits with a few thousand transistors. Second, static tuners employ static timing analysis to evaluate the performance of the circuit. All paths through the logic are simultaneously tuned, and no input vectors are required. Large control macros are best tuned by these methods. However, in the context of deep submicron custom design, the inaccuracy of the delay models employed by these methods often limits their utility. Aggressive dynamic or static tuning can push a circuit into a precipitous corner of the manufacturing process space, which is a problem addressed by the third class of circuit optimization tools, statistical tuners. Statistical techniques are used to enhance manufacturability or maximize yield. In addition to surveying the above techniques, topics such as the use of state-of-the-art nonlinear optimization methods and special considerations for interconnect sizing, clock tree optimization and noise-aware tuning will be briefly considered.

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

use
simulation
design
performance
context
tutorial
timing
paper
control
yield
dynamic
manufacturability
custom
process
interconnect
tuning
utility
class
tools
circuits
tree
input
computation
delay
practical
macros
methodology
space
clock
power
logic
nonlinear optimization

adjoints
sensitive
applications
signaling
survey
metrication
gradients
art
method
optimality
transit
size
integrability
statistics
efficiency
high-performance
model
evaluation
circuit tuning
digitize
vectorization
data
flow
noise
static timing analysis


discovering frequently changing structures from historical structural deltas of unordered xml Recently, a large amount of work has been done in XML data mining. However, we observed that most of the existing works focus on the snapshot XML data, while XML data is dynamic in real applications. To the best of our knowledge, none of the existing works has addressed the issue of mining the history of changes to XML documents. Such mining results can be useful in many applications such as XML change detection, XML indexing, association rule mining, and classification etc. In this paper, we propose a novel approach to discover the frequently changing structures from the sequence of historical structural deltas of unordered XML. To make the structure discovering process efficient, an expressive and compact data model, H istorical- D ocument O bject M odel ( H-DOM ), is proposed. Using this model, two basic algorithms, which can discover all the frequently changing structures with only two scans of the XML sequence, are presented. Experimental results show that our algorithms, together with the optimization techniques, are efficient and scalable.

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


ISOLA a Fortran code and a Matlab GUI to perform multiple-point source inversion of seismic data In this paper, a software package for multiple- or single-point source inversion is presented. The package consists of ISOLA-GUI, a user-friendly MATLAB-based interface, and the ISOLA Fortran code, which is the computational core of the application. The methodology used is similar to iterative deconvolution technique, often used in teleseismic studies, but here adjusted for regional and local distances. The advantage of the software is the graphical interface that provides the user with an easy to use environment, rich in graphics and data handling routines, while at the same time the speed of Fortran code is retained. Besides that, the software allows the results to be exported to popular software packages, like Generic Mapping Tools, while at the same time utilizing them for quality plots of the results. The modular design of ISOLA-GUI can be used by users for the addition of supplementary routines in all the stages of processing. An example of the method's ability to obtain a quick insight into the complexity of an earthquake is presented, using records from a moderate size event. (C) 2008 Elsevier Ltd. All rights reserved.

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

seismology
moment tensor determination
extended source
graphical user interface


Matrix Sparsification and Nested Dissection over Arbitrary Fields The generalized nested dissection method, developed by Lipton et al. [ 1979], is a seminal method for solving a linear system Ax = b where A is a symmetric positive definite matrix. The method runs extremely fast whenever A is a well-separable matrix (such as matrices whose underlying support is planar or avoids a fixed minor). In this work, we extend the nested dissection method to apply to any nonsingular well-separable matrix over any field. The running times we obtain essentially match those of the nested dissection method. An important tool is a novel method for matrix sparsification that preserves determinants and minors, and that guarantees that constant powers of the sparsified matrix remain sparse.

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

linear system
nested dissection
matrix sparsification


A queue management algorithm for fair bandwidth allocation In this paper, a stateless active queue management algorithm called "PUNSI" which aims to achieve fair bandwidth allocation in congested routers is proposed. This algorithm prevents unresponsive flows from dominating available bandwidth shared with responsive flows by penalizing packets from unresponsive flows with a higher probability than those from responsive flows. It is motivated by the observation that unresponsive flows tend to generate traffic of higher rates than responsive ones and that, when a packet is dropped due to buffer overflow, fellow packets from the same flow seem to be found in the buffer among those having joined recently. Simulation experiments show that the algorithm discards packets from unresponsive flows effectively and achieves pretty good fair share among flows with low implementation complexity. (C) 2007 Elsevier 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 B I O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O 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 B I O O O O O O O O O O O O O O O O O O O O


Architecture and protocol design for a pervasive robot swarm communication networks There has been increasing interest in deploying a team of robots, or robot swarms, to fulfill certain complicate tasks such as surveillance. Since robot swarms may move to areas of far distance, it is important to have a pervasive networking environment for communications among robots, administrators, and mobile users. In this paper, we first propose a pervasive architecture to integrate wireless mesh networks and robot swarm networks to build a robot swarm communication network within the areas of special interest. Under the proposed architecture, one or more robots can get connected with a nearby mesh router and access the remote server, while a self-organizing mobile ad hoc network is formed within each swarm for communications among the robots. We then address and analyze many important issues and challenges. Finally, we describe our work to enable this architecture through a scalable algorithm for autonomous swarm deployment and ROBOTRAK, a socket-based-swarm monitoring and control toolkit. Extensive simulation results and demonstrations are presented to show the desirable features of the proposed algorithm and toolkit. Copyright (C) 2009 John Wiley & Sons, Ltd.

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


On user authentication by means of video events recognition Graphical password schemes have been widely analyzed in the last couple of decades. Typically such schemes are not resilient to adversaries who are able to collect a considerable amount of session transcripts, and can process them automatically in order to extract the secret. In this paper we discuss a possible enhancement to graphical passwords aiming at making infeasible to the attacker to automatically process the collected transcripts. In particular, we investigate the possibility of replacing static graphical challenges with on-the-fly edited videos. In our approach, the system challenges the user by showing her a short film containing a number of pre-defined pass-events and the user replies with the proof that she recognized such events. We present a proof-of-concept prototype, FilmPW, and discuss some issues related to event life-cycle management. Our preliminary experiments show that such an authentication mechanism is well accepted by users and achieves low error rates.

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


biometric user verification using haptics and fuzzy logic Security is always of a great concern for both organizations and individuals. The concept of biometric measures has been used to identify individuals as long as we have existed and has evolved with time. Behavioral biometrics can be further enhanced with the use of haptic devices. This paper presents a system that uses a haptic device to capture behavioral biometric features. The system then uses a fuzzy logic controller to verify user identification. This study shows that even with a simple interface, effective security could be achieved. Possible applications include online (signature) recognition or access control to highly restricted areas and/or data within an organization.

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


Image-Based Attitude Control of a Remote Sensing Satellite This paper deals with the image-based control of a satellite for remote sensing. Approach is demonstrated by simulation where the position of the satellite is obtained with the Simplified General Perturbations Version 3 model and its orientation by simulating its dynamic and kinematic models. For a known position and orientation of the satellite the images are obtained using the satellite's onboard camera, simulated by the Google Earth application. The orientation of the satellite is governed by reaction wheels, which produce the required moments to the satellite. The image-based control law using SIFT image features is applied to achieve an automatic reference-point observation on the Earth's surface. Main contributions of the paper are the following: use of the same sensor for Earth observation and attitude control, simplicity of the approach, no need for explicit calibration of camera parameters and good tracking accuracy. Demonstrated simulation results and performance analysis confirm the approach applicability.

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

satellite kinematic model
satellite dynamic model
computer vision
sift features


A game-theoretic and dynamical-systems analysis of selection methods in coevolution We use evolutionary game theory (EGT) to investigate the dynamics and equilibria of selection methods in coevolutionary algorithms. The canonical selection method used in EGT is equivalent to the standard I 'fitness- proportional" selection method used in evolutionary algorithms. All attractors of the EGT dynamic are Nash equilibria; we focus on simple symmetric variable-sum games that have polymorphic Nash-equilibrium attractors. Against the dynamics of proportional selection, we contrast the behaviors of truncation selection, (mu, lambda), (mu, + lambda), linear ranking, Boltzmann, and tournament selection. Except for Boltzmann selection, each of the methods we test unconditionally fail to achieve polymorphic Nash equilibrium. Instead, we find point attractors that lack game-theoretic justification, cyclic dynamics, or chaos. Boltzmann selection converges onto polymorphic Nash equilibrium only when selection pressure is sufficiently low; otherwise, we obtain attracting limit-cycles or chaos. Coevolutionary algorithms are often used to search for solutions (e.g., Nash equilibria) of games of strategy; our results show that many selection methods are inappropriate for finding polymorphic Nash solutions to variable-sum games. Another application of coevolution is to model other systems; our results emphasize the degree to which the model's behavior is sensitive to implementation details regarding selection-details that we might not otherwise believe to be critical.

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

coevolutionary algorithms
game theory
selection methods


A co-volume scheme for the rotating shallow water equations on conforming non-orthogonal grids A co-volume scheme is introduced for the rotating shallow water equations, in which both velocity components are specified on cell edges, and the thickness variables evolve on both the primary and the dual cell centers. The scheme applies to generic, conforming and non-orthogonal staggered grids, including the widely used latlon quadrilateral grids and the DelaunayVoronoi tessellations. It can be viewed either as coupled C-grid schemes on the primary and dual meshes, or as an generalization of the traditional E-grid scheme on a new non-overlapping grid. Linear dispersive wave analysis shows that, the dispersive relations resolved by either the primary or the dual mesh of a uniform quadrilateral staggered grid is the same as those of the Z-grid scheme. The total wavenumber space resolved by the staggered grid is twice as large, on which the co-volume behaves exactly like the E-grid scheme. On a uniform hexagon-triangular staggered grid, the co-volume has two steady modes and two inertial-gravity modes on the hexagonal mesh, and one steady mode, two inertial gravity modes, and two spurious modes on the triangular mesh. On the wavenumber space resolved by either the hexagonal or the triangular mesh, the inertial-gravity wave modes remain positive and largely monotone. For the nonlinear shallow water equations, the co-volume scheme is shown to preserve the potential vorticity dynamics and the total energy exactly. Numerical results are presented to corroborate and supplement the analyses.

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

co-volume
finite volume method
computational modes
unstructured grid
non-orthogonal grid


Using IBM SPSS modeler to improve undergraduate mathematical modelling competence This paper is concerned with the problem of improving undergraduate mathematical modelling competence in the current big data world. Firstly, we review the renowned teacher's seven-step, student's four-step and a six-step modelling cycles to explain mathematical modelling competence. The six-step modelling cycle is also used in Common Core State Standards for Mathematics (CCSSM) in the United States. Based on these previous modelling cycles, we propose a new five-phase modelling cycle by use of the tool named IBM SPSS Modeler in accordance with Cross Industry Standard Process for Data Mining (CRISP-DM). A teaching case will be presented to apply these methodologies to undergraduates mathematical modelling lessons. It is shown that teachers can use IBM SPSS Modeler to improve student's mathematical modelling competence by understanding and practicing the process of five-phase modelling. 2015 Wiley Periodicals, Inc. Comput Appl Eng Educ 23:603609, 2015; View this article online at wileyonlinelibrary.com/journal/cae; DOI 10.1002/cae.21632

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

mathematical modelling competence
ibm spss modeler


A multistage approach to blind separation of convolutive speech mixtures We propose a novel algorithm for the separation of convolutive speech mixtures using two-microphone recordings, based on the combination of independent component analysis (ICA) and ideal binary mask (IBM), together with a post-filtering process in the cepstral domain. The proposed algorithm consists of three steps. First, a constrained convolutive ICA algorithm is applied to separate the source signals from two-microphone recordings. In the second step, we estimate the IBM by comparing the energy of corresponding timefrequency (TF) units from the separated sources obtained with the convolutive ICA algorithm. The last step is to reduce musical noise caused by TF masking using cepstral smoothing. The performance of the proposed approach is evaluated using both reverberant mixtures generated using a simulated room model and real recordings in terms of signal to noise ratio measurement. The proposed algorithm offers considerably higher efficiency and improved speech quality while producing similar separation performance compared with a recent approach.

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

independent component analysis (ica)
convolutive mixtures
ideal binary mask (ibm)
estimated binary mask


A methodology to optimize the design of telecommunication systems This paper presents a methodology for network synthesis and optimum design in telecommunication systems. The method uses two concepts: the dynamic buffer size queue and the equivalent product form network. While the first concept helps to reduce the complexity of the network by hiding local parts in the network, the latter provides a mathematical treatment that can aid in the design of the network. (C) 2000 Elsevier Science B.V. All rights reserved.

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

optimum design
telecommunication systems

local analysis model
product-form networks


An FPGA-Based Information Detection Hardware System Employing Multi-Match Content Addressable Memory A new information detection method has been proposed for a very fast and efficient search engine. This method is implemented on hardware system using FPGA. We take advantages of Content Addressable Memory (CAM) which has an ability of matching mode for designing the system. The CAM blocks have been designed using available memory blocks of the FPGA device to save access times of the whole system. The entire memory can return multi-match results concurrently. The system operates based on the CAMs for pattern matching, in a parallel manner, to output multiple addresses of multi-match results. Based on the parallel multi-match operations, the system can be applied for pattern matching with various required constraint conditions without using any search principles. The very fast multi-match results are achieved at 60 ns with the operation frequency 50 MHz. This increases the search performance of the information detection system which uses this method as the core system.

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

fpga
information detection
content addressable memory

random access memory
parallel operation
multi-match


A practical approach of ID-based cryptosystem in ad hoc networks As research in ad hoc networking has advanced, the importance of security increases more and more. But it suffers from the restriction that ad hoc networks do not have the established infrastructure. In this paper we propose a security-enhanced model with ID-based cryptosystem which removes the necessity for any infrastructure and provides sound authentication. Also we provide a more secure and concrete routing protocol with aggregate signature. For confidentiality, we also provide a key exchange protocol. And our model not only distributes the role of key generation center in ID-based cryptosystem to the nodes with threshold cryptography, but also increases availability by providing a secret re-sharing protocol. Therefore, our model is very appropriate for ad hoc networks. Copyright (c) 2007 John Wiley & Sons, Ltd.

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

ad hoc network
id-based cryptosystem
secure routing