Multivariate adaptive regression splines - studies of HIV reverse transcriptase inhibitors In this article, the application of Multivariate Adaptive Regression Splines (MARS) for modelling the biological activity of Non-Nucleoside Reverse Transcriptase Inhibitors (NNRTIs) is described. The studied data consist of the biological activities of 208 NNRTIs evaluated against wild-type HIV virus (HIV-1) and four mutant strains (181C, 103N, 100I, 188L), and the computed interaction energies with the amino acids forming the NNRTI binding pocket. The NNRTIs belong to five different chemical classes of compounds, known as HEPT-like, TIBO, DATA, DAPY and ITU compounds. The MARS model obtained for the biological activity of NNRTIs yields acceptable prediction errors for this data set. (C) 2004 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 B 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 B O O O O B I O O O O O O O O O O O O O O O O O


Optimum RC column reinforcement considering multiple load combinations A general method is proposed to determine optimal reinforcement distributions for rectangular reinforced concrete column sections subjected to multiple combinations of axial load and moment. The design problem is formulated as a general constrained nonlinear optimization problem and is solved both mathematically and graphically. Ultimate strength and strength reduction factors are evaluated using ACI code provisions. The method provides a simple approach to determine optimal reinforcement under multiple loading combinations. The use of optimal reinforcement rather than conventional (symmetric) distributions of reinforcement can lower construction costs and environmental impacts.

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

concrete column
optimization
multiple load combinations


Accelerating Value-at-Risk estimation on highly parallel architectures Values of portfolios in modern financial markets may change precipitously with changing market conditions. The utility of financial risk management tools is dependent on whether they can estimate Value-at-Risk (VaR) of portfolios on-demand when key decisions need to be made. However, VaR estimation of portfolios uses the Monte Carlo method, which is a computationally intensive method often run as an overnight batch job. With the proliferation of highly parallel computing platforms such as multicore CPUs and manycore graphics processing units (GPUs), teraFLOPS of computation capability is now available on a desktop computer, enabling the VaR of large portfolios with thousands of risk factors to be computed within only a fraction of a second. Achieving such performance in practice requires the assimilation of expertise in the following three areas: (i) application domain; (ii) statistical analytics; and (iii) parallel computing. This paper demonstrates that these areas of expertise inform optimization perspectives that, when combined, lead to 127 x speedup on our CPU-based implementation and 538 x speedup on our GPU-based implementation. Copyright (C) 2011 John Wiley & Sons, Ltd.

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

3 concurrent programming [parallel programming]

3 probability and statistics [probabilistic algorithms (including monte carlo)]

4 social and behavioral sciences [economics]


The potential role of GIS in autonomous field operations Two issues of increasing importance in agriculture are the targeted approach to managing field operations, or precision farming, and the development of automated guidance systems. The viability of both of these approaches has been increased by recent technological developments in positioning, sensing and control systems. These separate technologies appear to provide the necessary tools for the adoption of spatially varying crop management strategies, undertaken by autonomous guidance. However, the latter in particular requires a high level of integration of the data and information flows that provide the foundations for the field operations management process. These data and information flows are becoming increasingly complex due to the increasing use of sensing systems to provide information on the spatial and temporal attributes of fields, both stable and transient, at precisely determined locations. In addition, the application of improved agronomic understanding increasingly requires the combined interpretation of separate field attributes. The data and information that are the basis of the field operations management process are electronically recorded and are position and time related. Consequently it is the technology of Geographic Information Systems (GIS) that provides a basis for combined management and guidance applied to autonomous field operations. This paper provides an overview of the potential role of GIS in this context.

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

gis
autonomous guidance
precision farming


A new detection approach of transient disturbances combining wavelet packet and Tsallis entropy The definition of wavelet packet Tsallis entropy (WPTSE) and calculation method are given. The influences of transient disturbance parameters with WPTSE and noise are discussed. The detection plan of transient disturbances with WPTSE is presented.

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

transient disturbance
detection
tsallis entropy

wavelet packet transform
singular value decomposition


Data allocation on wireless broadcast channels for efficient query processing Data broadcast is an excellent method for efficient data dissemination in the mobile computing environment. The application domain of data broadcast will be widely expanded in the near future, where the client is expected to perform complex queries or transactions on the broadcast data. To reduce the access latency for processing the complex query, it is beneficial to place the data accessed in a query close to each other on the broadcast channel. In this paper, we propose an efficient algorithm to determine the allocation of the data on the broadcast channel such that frequently co-accessed data are not only allocated close to each other, but also in a particular order which optimizes the performance of query processing. Our mechanism is based on the well-known problem named optimal linear ordering. Experiments are performed to justify the benefit of our approach.

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

database broadcasting
access time
tuning time
broadcast program


Reverse computation for rollback-based fault tolerance in large parallel systems Reverse computation is presented here as an important future direction in addressing the challenge of fault tolerant execution on very large cluster platforms for parallel computing. As the scale of parallel jobs increases, traditional checkpointing approaches suffer scalability problems ranging from computational slowdowns to high congestion at the persistent stores for checkpoints. Reverse computation can overcome such problems and is also better suited for parallel computing on newer architectures with smaller, cheaper or energy-efficient memories and file systems. Initial evidence for the feasibility of reverse computation in large systems is presented with detailed performance data from a particle (ideal gas) simulation scaling to 65,536 processor cores and 950 accelerators (GPUs). Reverse computation is observed to deliver very large gains relative to checkpointing schemes when nodes rely on their host processors/memory to tolerate faults at their accelerators. A comparison between reverse computation and checkpointing with measurements such as cache miss ratios, TLB misses and memory usage indicates that reverse computation is hard to ignore as a future alternative to be pursued in emerging architectures.

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

checkpointing
reverse computation
parallel
systems
fault tolerance


Generalized hexagons and Singer geometries In this paper, we consider a set L of lines of PG(5, q) with the properties that (1) every plane contains 0, 1 or q + 1 elements of L, (2) every solid contains no more than q(2) + q + 1 and no less than q + 1 elements of L, and (3) every point of PG(5, q) is on q + 1 members of L, and we show that, whenever (4) q not equal 2 (respectively, q = 2) and the lines of L through some point are contained in a solid (respectively, a plane), then L is necessarily the set of lines of a regularly embedded split Cayley generalized hexagon H(q) in PG(5, q), with q even. We present examples of such sets L not satisfying (4) based on a Singer cycle in PG(5, q), for all q.

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

split cayley hexagon
embedding
bislim geometry
singer group


First order linear fuzzy differential equations under generalized differentiability First order linear fuzzy differential equations are investigated. We interpret a fuzzy differential equation by using the strongly generalized differentiability concept, because under this interpretation, we may obtain solutions which have a decreasing length of their support (which means a decreasing uncertainty). In several applications the behaviour of these solutions better reflects the behaviour of some real-world systems. Derivatives of the H-difference and the product of two functions are obtained and we provide solutions of first order linear fuzzy differential equations, using different versions of the variation of constants formula. Some examples show the rich behaviour of the solutions obtained.

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

generalized differentiability
fuzzy differential equations
variation of constants formula


The Astrophysics Simulation Collaboratory Portal: a framework for effective distributed research We describe the Astrophysics Simulation Collaboratory (ASC) Portal, a collaborative environment in which distributed projects can perform research. The ASC project seeks to provide a web-based problem solving framework for the astrophysics community to harness Computational Grids. To facilitate collaboration amongst distributed researchers within a virtual organization, the ASC Portal supplies specialized tools for the management of large-scale numerical simulations and the resources on which they are performed. The ASC virtual organization uses the Cactus framework for studying numerical relativity and astrophysics phenomena. We describe the architecture of the ASC Portal and present its components with emphasis on elements related to the Cactus framework.

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

astrophysics simulation collaboratory portal


An immune-inspired, information-theoretic framework for blind inversion of Wiener systems This work proposes an immune-inspired algorithm to perform blind inversion of Wiener systems. The method employs mutual information-based criteria and IIR filters to adapt the inverse structure. The experimental results indicate a superior or equivalent performance of the new technique, in comparison with gradient-based search or kurtosis-based criterion.

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


submersive rational difference systems and their accessibility The paper describes an algebraic construction of the inversive difference field associated with a discrete-time rational nonlinear control system under the assumption that the system is submersive. We prove that a system is submersive iff its associated difference ideal is proper, prime and reflexive. Next, we show that Khler differentials of the above inversive field define a module over the corresponding ring of Ore operators, and relate its torsion submodule to the vector space of autonomous one-forms, introduced elsewhere. The above results allow us to check accessibility property and simplify transfer functions with computer algebra techniques.

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

submersivity
reflexive ideals
transfer function
rational difference system
inversive closure


On probabilistic flooding search over unstructured peer-to-peer networks Probabilistic flooding has been proposed as a means of reducing the excessive message overheads induced by plain flooding in unstructured peer-to-peer network search. We propose here Advanced Probabilistic Flooding (APF), a novel strategy which operates differently from other known strategies. In particular, the decision of a node to propagate a message (or not) is based on both the popularity of resources and the hop distance from the node that initiated the query. The latter is used to estimate the number of nodes reached by the query message. Based on these parameters we adjust the forwarding probability at the time a node receives the query message so as to reduce the duplicate message overhead while maintaining a high probability of query success. The primary goal of our approach is to minimize the cost of search associated with excessive message transmissions. Our claims are supported by detailed experiments in various network topologies

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

distributed systems
duplicate messages
unstructured p2p networks
search on power-law networks


Evolution of prices in electronic markets under diffusion of price-comparison shopping Price-comparison engines allow customers to compare product offerings of online sellers and reveal almost complete information on the alternatives, and hence create erosion in store loyalty. Consequently, the competitive dynamics of online sales are affected in markets where price-comparison shopping is diffusing rapidly. We develop a dynamic competitive pricing model that-deals with an asymmetric, duopolistic market where the segment sizes are determined through a diffusion process. Our diffusion-of-innovations approach allows us to dynamically capture, the proportion of informed and uninformed customers in-a homogenous' goods market. We use this model to analyze how strategic profit maximization behavior evolves,over time. this analysis shows that the increasing numbers of price-comparison shoppers pull prices down, and the rate at which prices decrease is shaped by the diffusion. curve and brand preference. Our analysis shows that stores with loyal customers, or with a preference for their brands, can attain higher profits I further into the-diffusion process. The direct implication is that firms should use their information technology;. operations, and marketing capabilities to create, enhance, and cultivate stronger preferences ford and loyalty to, their brand names to survive the inevitable information-rich markets of tomorrow.

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

diffusion,of innovations
internet economics
price-comparison engines
price-comparison shopping
price competition


A Kolmogorov-Smirnov statistic based segmentation approach to learning from imbalanced datasets: With application in property refinance prediction Classification is an important task in data mining. Class imbalance has been reported to hinder the performance of standard classification models. However, our study shows that class imbalance may not be the only cause to blame for poor performance. Rather, the underlying complexity of the problem may play a more fundamental role. In this paper, a decision tree method based on Kolmogorov-Smirnov statistic (K-S tree), is proposed to segment the training data so that a complex problem can be divided into several easier sub-problems where class imbalance becomes less challenging. K-S tree is also used to perform feature selection, which not only selects relevant variables but also removes redundant ones. After segmentation, a two-way re-sampling method is used at the segment level to empirically determine the optimal sampling percentage and the rebalanced data is used to fit logistic regression models, also at the segment level. The effectiveness of the proposed method is demonstrated through its application on property refinance prediction. (C) 2011 Elsevier Ltd. All rights reserved.

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

decision tree
segmentation
property refinance prediction

imbalanced data
kolmogorov-smirnov statistic


High speed and silicon-saving adaptive tuning system for high frequency Gm-C filters In this paper, a novel adaptive tuning system used in Gm-C continuous time (CT) filters has been presented. The novelty of this method is the generation of quasi-gradient functions for the adaptive algorithm. By this method we have implemented the fully adaptive tuning algorithm on chip, and received more than 95% precision for the all characteristics of Gm-C filter. All the circuit level simulations and prototype fabrication have been done using 0.6 mu CMOS technology of AMS.

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


A decremental algorithm of frequent itemset maintenance for mining updated databases Data-mining and machine learning must confront the problem of pattern maintenance because data update is a fundamental operation in data management. Most existing data-mining algorithms assume that the database is static, and a database update requires rediscovering all the patterns by scanning the entire old and new data. While there are many efficient mining techniques for data additions to databases, in this paper, we propose a decremental algorithm for pattern discovery when data is deleted from databases. We conduct extensive experiments for evaluating this approach, and illustrate that the proposed algorithm can well model and capture useful interactions within data when the data is decreasing.

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

incremental mining
decremental mining
dynamic database mining


The art of modeling and simulation of induction generator in wind generation applications using high-order model Both fixed-speed squirrel-cage induction generators and variable-speed doubly fed induction generators are used in wind turbine generation technology. Modeling and simulation of induction machines using vector computing technique in Matlab/Simulink provides an efficient approach for further research on wind generation system integration and control. In this paper, the vector computing technique is applied in modeling and simulation of induction machines. Free acceleration of squirrel-cage induction generator, active power and reactive power control of DFIGs in a power system as well as inter-area oscillation damping control are demonstrated using the proposed model. The modeling approach in Matlab/Simulink makes controller design and simulation verification effective.

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

dfig
oscillation control
time domain simulation


a new rotation algorithm for monochromatic images The classical rotation algorithm applied to monochromatic images introduces white holes in black areas, making edges uneven and disconnecting neighboring elements. Several algorithms in the literature address only the white hole problem. This paper proposes a new algorithm that solves those three problems, producing better quality images.

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

skew correction
monochromatic image rotation


Three-dimensional segmentation of luminal and adventitial borders in serial intravascular ultrasound images Intravascular ultrasound (IVUS) provides exact anatomy of arteries, allowing accurate quantitative analysis. Automated segmentation of IVUS images is a prerequisite for routine quantitative analyses. We present a new three-dimensional (3D) segmentation technique, called active surface segmentation, which detects luminal and adventitial borders in IVUS pullback examinations of coronary arteries. The technique was validated against expert tracings by computing correlation coefficients (range 0.830.97) and William's index values (range 0.370.66). The technique was statistically accurate, robust to image artifacts, and capable of segmenting a large number of images rapidly. Active surface segmentation enabled geometrically accurate 3D reconstruction and visualization of coronary arteries and volumetric measurements.

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

ultrasound segmentation
three-dimensional segmentation
edge detection
active contours
snakes-based algorithms


a general software development process suitable for explicit manipulation of business rules This paper points out the necessity and also the real possibilities to introduce facilities for business rules manipulation into the software systems development process. At the methodological level, through the proposed general process, it is offered an alternative to business rules approaches, aiming mainly at software systems for small and medium organizations or systems that do not explicitly require the use of a rules engine.

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

business rules approaches
software development
explicit manipulation
general process


voltage-frequency island partitioning for gals-based networks-on-chip Due to high levels of integration and complexity, the design of multi-core SoCs has become increasingly challenging. In particular, energy consumption and distributing a single global clock signal throughout a chip have become major design bottlenecks. To deal with these issues, a globally asynchronous, locally synchronous (GALS) design is considered for achieving low power consumption and modular design. Such a design style fits nicely with the concept of voltage-frequency islands (VFIs) which has been recently introduced for achieving fine-grain system-level power management. This paper proposes a design methodology for partitioning an NoC architecture into multiple VFIs and assigning supply and threshold voltage levels to each VFI. Simulation results show about 40\% savings for a real video application and demonstrate the effectiveness of our approach in reducing the overall system energy consumption. The results and functional correctness are validated using an FPGA prototype for an NoC with multiple VFIs.

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

video
simulation
design
concept
modular
paper
threshold
energy consumption
prototype
architecture
correctness
functional
clock
gals
low power
demonstrate
complexity
global

applications
synchronization
signaling
voltage-frequency island
multi core
partition
networks-on-chip
systems
asynchronicity
design methodologies
power-management
effect
multi-processor systems
integrability


On bandlimitedness of signals in the 2D-nonseparable linear canonical transform domains In this paper, the issues related to the compact support and bandlimitedness of signals in the 2D-nonseparable linear canonical transform (NSLCT) domains are addressed. It is seen that for some specific values of the parameters of the 2D-NSLCT, the area of the support of the 2D-NSLCT of a signal or its modified version can be less than the area of the support of the 2D-conventional Fourier transform (2D-CFT) of the signal. Similarly, swapping of support of the 2D-conventional Fourier transform of a signal can be achieved using the 2D-NSLCT. These results related to the compact support are intimately connected with the sampling theory of 2D-signals. A sampling theorem for signals bandlimited in the 2D-nonseparable linear canonical transform domains is also presented. It is seen that perfect reconstruction of signals can be achieved at sampling rates less than the Nyquist rate (based on the bandwidth in the conventional Fourier transform domain) under some specific values of the parameters of the 2D-NSLCT.

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

2d-nonseparable linear canonical transforms


Analysis of the IJCNN 2011 UTL challenge We organized a challenge in Unsupervised and Transfer Learning: the UTL challenge (http://clopinet.com/ul). We made available large datasets from various application domains: handwriting recognition, image recognition, video processing, text processing, and ecology. The goal was to learn data representations that capture regularities of an input space for re-use across tasks. The representations were evaluated on supervised learning target tasks unknown to the participants. The first phase of the challenge was dedicated to unsupervised transfer learning (the competitors were given only unlabeled data). The second phase was dedicated to cross-task transfer learning (the competitors were provided with a limited amount of labeled data from source tasks, distinct from the target tasks). The analysis indicates that learned data representations yield significantly better results than those obtained with original data or data preprocessed with standard normalizations and functional transforms.

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

transfer learning
unlabeled data
challenge

machine learning
unsupervised learning
metric learning
kernel learning
competition


Multiscale simulations for suspensions of rod-like molecules We study the Doi model for suspensions of rod-like molecules. The Doi model couples a microscopic FokkerPlanck type equation (Smoluchowski equation) to the macroscopic Stokes equation. The Smoluchowski equation describes the evolution of the distribution of the rod orientations; it comes as a driftdiffusion equation on the sphere at every point in physical space. For sufficiently high macroscopic shear rates (high Deborah numbers), the solution of the coupled system develops internal layers in the macroscopic strain rate (the spurt phenomenon). In the high Deborah numbers regime, the drift term in the Smoluchowski equation is dominant. We thus introduce a finite-volume type discretization of the microscopic Smoluchowski equation which is motivated by transport-dominated PDEs. We carry out direct numerical simulations of the spurt phenomenon both in the dilute and concentrated regimes. Below the isotropicnematic transition, the solution structure is identical to the one described by purely macroscopic models (JSO model). For higher concentrations, we observe the formation of microstructure coming from a position-dependent tumbling rate. We also investigate the 2-d stability of the spurted solution.

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

rod-like molecules
viscoelastic material


Medication Calculation The Potential Role of Digital Game-Based Learning in Nurse Education Medication dose calculation is one of several medication-related activities that are conducted by nurses daily. However, medication calculation skills appear to be an area of global concern, possibly because of low numeracy skills, test anxiety, low self-confidence, and low self-efficacy among student nurses. Various didactic strategies have been developed for student nurses who still lack basic mathematical competence. However, we suggest that the critical nature of these skills demands the investigation of alternative and/or supplementary didactic approaches to improve medication calculation skills and to reduce failure rates. Digital game-based learning is a possible solution because of the following reasons. First, mathematical drills may improve medication calculation skills. Second, games are known to be useful during nursing education. Finally, mathematical drill games appear to improve the attitudes of students toward mathematics. The aim of this article was to discuss common challenges of medication calculation skills in nurse education, and we highlight the potential role of digital game-based learning in this area.

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

digital game-based learning
learning strategies
medical errors


Optimal consumption and portfolio choice with ambiguity and anticipation ? This paper, adopting the recursive multiple-priors utility, studies the optimal consumption and portfolio choice in a Merton-style model with anticipation when there is a difference between ambiguity and risk. The fundamental issue is what the effects of ambiguity and anticipation on the investors behavior are. In the case of a logarithmic felicity function, the paper also shows that no hedging demand arises that is affected by both ambiguity and anticipation. Finally, the optimal portfolio is derived in terms of Malliavin derivatives and stochastic integrals.

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

ambiguity
anticipation
optimal consumption and portfolio
malliavin derivatives

recursive multiple-priors utility
enlargement of filtrations


High discharge variability in neurons driven by current noise Cortical neurons in vivo show a highly irregular spontaneous discharge activity, characterized by a gamma statistics and coefficient of variation around unity. Modelling studies showed that this irregularity is a consequence of the high-conductance state caused by the ongoing activity in the cortical network. Here, we investigate to which extent this high discharge variability can be reproduced in vitro using current noise injection. In agreement with numerical studies, we found that equalizing the time constant of the noisy input with the membrane time constant may lead to an irregular discharge activity which, however, departs from a gamma statistics.

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

cerebral cortex
dynamic-clamp
gamma process


Integrating a formal method into a software engineering process with UML and Java We describe how CSP-OZ, a formal method combining the process algebra CSP with the specification language Object-Z, can be integrated into an object-oriented software engineering process employing the UML as a modelling and Java as an implementation language. The benefit of this integration lies in the rigour of the formal method, which improves the precision of the constructed models and opens up the possibility of (1) verifying properties of models in the early design phases, and (2) checking adherence of implementations to models. The envisaged application area of our approach is the design of distributed reactive systems. To this end, we propose a specific UML profile for reactive systems. The profile contains facilities for modelling components, their interfaces and interconnections via synchronous/broadcast communication, and the overall architecture of a system. The integration with the formal method proceeds by generating a significant part of the CSP-OZ specification from the initially developed UML model. The formal specification is on the one hand the starting point for verifying properties of the model, for instance by using the FDR model checker. On the other hand, it is the basis for generating contracts for the final implementation. Contracts are written in the Java Modeling Language (JML) complemented by CSPjassda, an assertion language for specifying orderings between method invocations. A set of tools for runtime checking can be used to supervise the adherence of the final Java implementation to the generated contracts.

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

modelling
formal specification
csp
uml
java
contracts
runtime checking


Evaluating sentiment in financial news articles Can the choice of words and tone used by the authors of financial news articles correlate to measurable stock price movements? If so, can the magnitude of price movement be predicted using these same variables? We investigate these questions using the Arizona Financial Text (AZFinText) system, a financial news article prediction system, and pair it with a sentiment analysis tool. Through our analysis, we found that subjective news articles were easier to predict in price direction (59.0% versus 50.0% of chance alone) and using a simple trading engine, subjective articles garnered a 3.30% return. Looking further into the role of author tone in financial news articles, we found that articles with a negative sentiment were easiest to predict in price direction (50.9% versus 50.0% of chance alone) and a 3.04% trading return. Investigating negative sentiment further, we found that our system was able to predict price decreases in articles of a positive sentiment 53.5% of the time, and price increases in articles of a negative sentiment 52.4% of the time. We believe that perhaps this result can be attributable to market traders behaving in a contrarian manner, e.g., see good news, sell; see bad news, buy.

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

business intelligence
text mining
financial prediction


Observation and analysis of interactive phenomena between microbubbles and underwater shock wave This paper reports the observation and analysis of the microbubble motion induced by an underwater shock wave. In the analysis, Herrings bubble motion equation was numerically solved using an experimental shock wave pressure profile. The pressure attenuation of the rebound shock wave of a microbubble was also estimated by numerical simulation. The motion behaviors of the microbubbles during their interaction with an electric discharge shock wave, such as their rebound, shock wave generation, and microjet formation, were observed by magnified visualization. To improve the observation accuracy, spatial positioning control of the microbubbles was employed. The experimentally determined time variation of the diameter of the microbubbles when they collapsed spherically was in agreement with the results of the numerical analyses, and the latter also revealed a very high pressure of the rebound shock wave. There were, however, discrepancies between the experimental and analytical results for non-spherical collapse. It is thought that spherical collapse produces stronger rebound shock waves and that the probability of such collapse increases with decreasing diameter of the bubble. In addition, it was demonstrated that single and multiple microbubbles moved vigorously after interaction with a shock wave and the latter coalesced into a single bubble within several hundred microseconds.

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

shock wave interaction
enlarged observation
microscopic observation
numerical analysis


Testing equality of inverse Gaussian means under heterogeneity, based on generalized test variable The inverse Gaussian (IG) distribution is an ideal candidate for modelling positive, right-skewed data due to the fact that its inference theory and methodology bear a striking resemblance to the normal theory and methods. For testing equality of several IG means under the assumption of equal scale parameters, there exists the ANORE (analysis of reciprocal) F F test, which is analogous to the ANOVA F F test for the normal distribution. In this article, the concept of generalized P P -value, introduced by Tsui and Weerahandi [1989. Generalized P P -values in significance testing of hypotheses in the presence of nuisance parameters. J. Amer. Statist. Assoc. 84, 602607], is applied for testing equality of several IG means for the general cases without the assumption of homogeneity. Simulation results indicate that the proposed test has excellent type I error control under both heterogeneity and homogeneity, whereas the type I error probabilities of the ANORE test can be much larger than the nominal level under heterogeneity. The proposed procedure is illustrated using two 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


Texture analysis and classification using deterministic tourist walk In this paper, we present a study on a deterministic partially self-avoiding walk (tourist walk), which provides a novel method for texture feature extraction. The method is able to explore an image on all scales simultaneously. Experiments were conducted using different dynamics concerning the tourist walk. A new strategy, based on histograms, to extract information from its joint probability distribution is presented. The promising results are discussed and compared to the best-known methods for texture description reported in the literature.

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

texture recognition
deterministic walk
complex systems


Parameterization of a crop growth and development simulation model at sub-model components level. An example for winter wheat (Triticum aestivum L.) Dynamic simulation models are frequently used for assessing agronomic and environmental effects of different management practices, under various pedo-climatic conditions. CropSyst is a suitable cropping systems simulation model for such applications. However, available CropSyst crop parameters for winter wheat, one of the most important cereals in the world, are limited. In this work we show that it is possible to parameterize separate sub-model components by using existing experimental data and literature. The experiments, carried out in northern Italy between 1986 and 2001, quantified the dynamics of aboveground biomass (AGB), plant nitrogen (N) concentration (PNC) and N uptake (UPTK) by means of periodical measurements. The relative root mean square error (calculated by dividing the root mean square error by the average of observations) obtained after model calibration and validation on an independent data set was, respectively, in the range 930% and 1732% for AGB, 10% and 640% for PNC, 828% and 924% for UPTK. AGB was frequently underestimated. Despite the limited accuracy of simulations, we argue that calibrated crop parameters are adequate for scenario analysis as most differences between years and fertilization levels were reproduced by the model and final AGB and cumulative UPTK were also correctly simulated.

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

plant nitrogen concentration
nitrogen uptake
crop growth rate
temperature response function


Dynamic constrained coalition formation among electric vehicles The use of electric vehicles (EVs) and vehicle-to-grid (V2G) technologies have been advocated as an efficient way to reduce the intermittency of renewable energy sources in smart grids. However, operating on V2G sessions in a cost-effective way is not a trivial task for EVs. The formation of coalitions among EVs has been proposed to tackle this problem.

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

artificial intelligence
game theory
multiagent systems


Nontrivial BCK/BCI-algebras do not satisfy the fuzzy ascending chain condition In [J. Meng, X. Guo, On fuzzy ideals in BCK/BCI-algebras, Fuzzy Sets and Systems 149 (2005) 509-525], Meng and Guo gave some characterizations of Noetherian BCK/BCI-algebras by fuzzy ideals. They introduced (see Definition 6.2) the notion of the fuzzy ascending chain condition (briefly, FACC) and stated that a BCK/BCI-algebra X is Noetherian if and only if X satisfies the FACC (Theorem 6.5), but it is not true. (c) 2006 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Designing and Enabling Spaces for collaborative knowledge creation and innovation: From managing to enabling innovation as socio-epistemological technology Innovation is a highly challenging social and epistemological process. Enabling Spaces are designed to be the locus of innovation processes. Designing Enabling Spaces is participatory. Enabling Spaces integrate many different dimension.

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


Cognitive Absorption and Trust for Workplace Collaboration in Virtual Worlds: An Information Processing Decision Making Perspective Virtual worlds (VWs) are media-rich cognitively engaging technologies that geographically dispersed organizations can use as a cost effective workplace collaboration tool. Using an information processing decision making perspective and building on unique characteristics of VWs, this paper proposes a nomological net for adaptive use intention (AUI) of VWs for workplace collaborations. AUI implies intention to use a technology in a setting different from the one for which it was initially designed. We study the AUI of VWs as a workplace collaboration tool which were originally conceived as recreational gaming platforms. Decision-making literature directs us to reduction of perceived cognitive burden and minimization of risk as the two key motivations for VWs' AUI. Building on these motivations, the paper identifies cognitive absorption and user trust in VWs as the mechanisms leading to individual-level AUI decision. Drawing on social cognitive theory and literature on trust, the proposed model not only re-specifies the concept of cognitive absorption in the context of VWs but also relates it to the level of trust and usage intention for VWs. We empirically tested the proposed model via data collected from 197 VW users in Singapore. Results demonstrate the significant roles that cognitive absorption' and user trust play in VW's usage as a collaboration tool. Further, through a series of post-hoc analyses, we demonstrate the imperative need for considering both cognitive absorption and user trust together in the proposed research model for theoretical parsimony. We also discuss implications for research and practice emerging out of this study.

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

cognitive absorption
trust
adaptive use intention
singapore


Efficiency and welfare implications of managed public sector hospital waiting lists A queuing model for public health service waiting lists is developed, and the implications for patient welfare of different systems for managing the waiting list are analysed. If patients are admitted to hospital on a first-come-first-served basis, a welfare gain is achieved by moving from a system of implicit to one of explicit rationing of access to the waiting list. If individual waiting times and hospital admissions are dependent on clinical priority, a further welfare gain is achievable without the use of explicit rationing, by reallocating the total waiting time from the more towards the less seriously ill. On efficiency and welfare criteria, a maximum waiting time guarantee does not appear to be a desirable development.

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


Abstract representations for interactive visualization of virtual 3D city models Virtual 3D city models increasingly cover whole city areas; hence, the perception of complex urban structures becomes increasingly difficult. Using abstract visualization, complexity of these models can be hidden where its visibility is unnecessary, while important features are maintained and highlighted for better comprehension and communication. We present a technique to automatically generalize a given virtual 3D city model consisting of building models, an infrastructure network and optional land coverage data; this technique creates several representations of increasing levels of abstraction. Using the infrastructure network, our technique groups building models and replaces them with cell blocks, while preserving local landmarks. By computing a landmark hierarchy, we reduce the set of initial landmarks in a spatially balanced manner for use in higher levels of abstraction. In four application examples, we demonstrate smooth visualization of transitions between precomputed representations; dynamic landmark highlighting according to virtual camera distance; an implementation of a cognitively enhanced route representation, and generalization lenses to combine precomputed representations in focus+context visualization.

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

generalization
3d city models
landmarks
interactive visualization


min/max on-chip inductance models and delay metrics This paper proposes an analytical inductance extraction model for characterizing min/max values of typical on-chip global intercon-nect structures, and a corresponding delay metric that can be used to provide RLC delay prediction from physical geometries. The model extraction and analysis is efficient enough to be used within optimization and physical design exploration loops. The analytical min/max inductance approximations also provide insight into the effects caused by inductances.

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


Combining boolean logic and linguistic structure Descriptor languages with Boolean operators have often been applied for Information Retrieval (IR) and Filtering (IF). In addition, linguistically motivated descriptors, such as noun phrases and index expressions, have also proven of value for IR. However, the synthesis of logic and linguistics in one descriptor language is an open issue still. In this paper, Boolean index expressions (BIEs), combining Boolean logic and linguistic structure, are proposed as a good balance between expressiveness and practical issues. BIEs provide several favourable properties as descriptor language for IR and IF: BIEs are comprehensible, expressive, compact, and tractable.

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

information retrieval
descriptor language
linguistic structure


Euler arc splines for curve completion This paper introduces a special arc spline called an Euler arc spline as the basic form for visually pleasing completion curves. It is considered as an extension of an Euler curve in the sense that the points in the Euler curve are replaced by arcs. A simple way for specifying it, which is suitable for shape completion, is presented. It is shown that Euler arc splines have several properties desired by aesthetics of curves, in addition to computational simplicity and NURBS representation. An algorithm is proposed for curve completion using Euler arc splines. The development of the algorithm involves two optimization processes, which are converted into a single minimization problem in two variables solved by the LevenbergMarquardt algorithm. Compared to previous methods, the proposed algorithm always guarantees the interpolation of two boundary conditions.

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


Semi-supervised learning by search of optimal target vector We introduce a semi-supervised learning estimator which tends to the first kernel principal component as the number of labeled points vanishes. We show application of the proposed method for dimensionality reduction and develop a semi-supervised regression and classification algorithm for transductive inference.

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

semi-supervised learning
kernel principal components


PROFALIGN algorithm identifies the regions containing folding determinants by scoring pairs of hydrophobic profiles of remotely related proteins Profile comparison methods have been shown to be very powerful in creating accurate alignments of protein sequences, especially in the case of remotely related proteins (RRP). These methods take advantage of the observation that hydrophobic profiles are more conserved than the corresponding amino acid sequences. Here, we present the PROFALIGN algorithm, which allows one to perform a detailed comparative analysis, at both local and global levels of two protein sequence profiles. The user can either choose among four different hydrophobic scales ( Miyazawa-Jernigan, Eisenberg, Engelman-Steiz, and Kyte-Doolittle) or can add a personal scale. The interface is designed for a wide range of users, including those who are not involved in protein research. It allows one to vary the alignment parameters ( such as gap penalties, embedding, and profile smoothness). Secondary structure propensity is added as an optional alignment filter. Similar segments of two proteins are singled out on the basis of score. We have tested the algorithm with different Src homology 3 ( SH3) domain fragments sharing low sequence homology but very similar three-dimensional ( 3D) structures. By using the Miyazawa-Jernigan hydrophobic scale, PROFALIGN was able to detect the strong correlation between the regions that are known to be crucial for SH3 transition state topology. PROFALIGN seems able to identify most of the mutual alignment of structures on the basis of their hydrophobic profiles, delimiting the regions containing the key determinants of folding. Therefore, the present methodology may be useful for the detection of the most structurally relevant positions inside remote related proteins.

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


A further note on stability criterion of linear neutral delay-differential systems This paper is a further note which corrects an error of the paper by Park and Won. A new stability criteria which is less conservative than those in the literature is presented.

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


Hybrid index maintenance for contiguous inverted lists Index maintenance strategies employed by dynamic text retrieval systems based on inverted files can be divided into two categories: merge-based and in-place update strategies. Within each category, individual update policies can be distinguished based on whether they store their on-disk posting lists in a contiguous or in a discontiguous fashion. Contiguous inverted lists, in general, lead to higher query performance, by minimizing the disk seek overhead at query time, while discontiguous inverted lists lead to higher update performance, requiring less effort during index maintenance operations. In this paper, we focus on retrieval systems with high query load, where the on-disk posting lists have to be stored in a contiguous fashion at all times. We discuss a combination of re-merge and in-place index update, called Hybrid Immediate Merge. The method performs strictly better than the re-merge baseline policy used in our experiments, as it leads to the same query performance, but substantially better update performance. The actual time savings achievable depend on the size of the text collection being indexed; a larger collection results in greater savings. In our experiments, variations of Hybrid Immediate Merge were able to reduce the total index update overhead by up to 73% compared to the re-merge baseline.

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


Modeling Detection Latency with Collaborative Mobile Sensing Architecture Detection latency, which is defined as the time from the target arrival to the time of the first detection, is an important metric for the performance of sensor networks carrying out target detection, especially when the target is malicious or hostile. It characterizes the efficiency of detecting the presence of a target in a region of interest. Traditionally, stationary sensor networks are used to perform such sensing tasks. Consequently, nearly all research literature for the target detection problem has focused on stationary sensor networks. This paper addresses the problem of detecting the presence/absence of a target using a mobile sensor network. An analytic method is proposed to model the detection latency based on a collaborative sensing architecture. Detection latency for different node mobility models is presented. The accuracy of the analytic model is verified by simulations. This paper also compares the performance of mobile and stationary sensor networks. The comparison shows that if the target is present at the worst possible location in a given deployment, then detection latency of mobile sensor networks is considerably shorter as compared to that of stationary networks with the same number of nodes.

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

mobile sensor networks
target detection
collaborative sensing
detection latency
analytic model


A fuzzy c-means clustering-based fragile watermarking scheme for image authentication In recent years, various fragile watermarking schemes have been proposed for image authentication and integrity verification. In this paper, a novel block-based fragile watermarking scheme for image authentication and tamper proofing is proposed. Realizing that block-wise dependency is a basic requirement for fragile watermarking schemes to withstand counterfeiting attacks, the proposed scheme uses the fuzzy c-means (FCM) clustering technique to create the relationship between image blocks. The effectiveness of the proposed scheme is demonstrated through a series of attack simulations. Experimental results show that the proposed scheme not only provides satisfactory imperceptibility, but also achieves superior tamper detection and localization accuracy under different attacks, such as the cut-and-paste attack and the vector quantization (VQ) attack.

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

fragile watermarking
image authentication
tamper detection


Optimal Pivot Selection Method Based on the Partition and the Pruning Effect for Metric Space Indexes This paper proposes a new method to reduce the cost of nearest neighbor searches in metric spaces. Many similarity search indexes recursively divide a region into subregions by using pivots, and construct a tree-structured index. Most of recently developed indexes focus on pruning objects and do not pay much attention to the tree balancing. As a result, indexes having imbalanced tree-structure may be constructed and the search cost is degraded. We propose a similarity search index called the Partitioning Capacity (PC) Tree. It selects the optimal pivot in terms of the PC that quantifies the balance of the regions partitioned by a pivot as well as the estimated effectiveness of the search pruning by the pivot. As a result, PCTree reduces the search cost for various data distributions. We experimentally compared PCTree with four indexes using synthetic data and five real datasets. The experimental results shows that the PCTree successfully reduces the search cost.

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

pivot selection
similarity search
metric space


Culture, gender and information technology use: A comparison of Chinese and US children This research addressed four basic questions about culture, gender and information technology (IT) use. First, are there differences between Chinese and US children in their computer and Internet use? Second, are there differences between Chinese and US children in their use of other technologies, namely, videogames and cell phones? Third, does gender moderate the influence of culture on the use of computers, the Internet and other technologies? Fourth, are there differences among subcultural groups within cultures in their IT use? Using samples of 600 Chinese and 600 US children whose average age was 12 years old, findings indicated cultural and gender differences in technology use as well as interactions between the two. US children used computers and the Internet more than did Chinese children, with Chinese females being the least intense users. Males played videogames more than did females, with US males playing more than did Chinese males. US females lead all other groups in cell phone use, whereas Chinese females were least likely to use them. Racial and ethnic group differences indicate that diversity within cultural groups among subcultures must be considered in understanding childrens IT use. Implications of cultural, gender and subcultural group differences in technology use for equity in access to technology and educational interventions for children in the use of technology are discussed.

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


Nonlinear phase correction with an extended statistical algorithm This paper presents a new magnetic resonance imaging (MRI) phase correction method. The linear phase correction method using autocorrelation proposed by Ahn and Cho (AC method) is extended to handle nonlinear terms, which are often important for polynomial expansion of phase variation in MRI. The polynomial coefficients are statistically determined from a cascade series of n-pixel-shift rotational differential fields (RDFs). The n-pixel-shift RDF represents local vector rotations of a complex field relative to itself after being shifted by n pixels. We have found that increasing the shift enhances the signal significantly and extends the AC method to handle higher order nonlinear phase error terms. The n-pixel-shift RDF can also be applied to improve other methods such as the weighted least squares phase unwrapping method proposed by Liang. The feasibility of the method has been demonstrated with two-dimensional (2-D) in vivo inversion-recovery MRI data.

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

n-pixel-shift rotational differential field (rdf)


Remote sensing for urban planning and management: The use of window-independent context segmentation to extract urban features in Stockholm Tests a novel methods ability to extract information relevant for urban analysis. The method is shown to extract areas that differ in function and underlying planning theories and practices. The method is put into a theoretical framework.

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

segmentation
urban planning and management

urban remote sensing
spatial analysis
feature extraction


Optimal design of measurements on queueing systems We examine the optimal design of measurements on queues with particular reference to the M/M/1 queue. Using the statistical theory of design of experiments, we calculate numerically the Fisher information matrix for an estimator of the arrival rate and the service rate to find optimal times to measure the queue when the number of measurements is limited for both interfering and non-interfering measurements. We prove that in the non-interfering case, the optimal design is equally spaced. For the interfering case, optimal designs are not necessarily equally spaced. We compute optimal designs for a variety of queuing situations and give results obtained under the \(D\)- and \(D_s\)-optimality criteria.

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


Neck and shoulder muscle activity during standardized work-related postural tasks A broad range of work-related postural tasks was standardized using a computer guided task paradigm. The sternocleidomastoid and upper trapezius muscles were mildly active during the majority of postures investigated. Certain head and neck tasks activated the sternocleidomastoid, whilst shoulder and arm tasks activated the upper trapezius. The muscle activity did not differ significantly between male and female participants. This study provides reference values for further investigation of these muscles in the natural work environment.

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


Applying a hybrid job shop procedure to a Belgian manufacturing company producing industrial wheels and castors in rubber In this paper, several methods for job shop scheduling are combined, adjusted and successfully applied to a real-world scheduling problem at a Belgian manufacturer producing industrial wheels and castors in rubber. The procedure is an extension of a hybrid shifting bottleneck procedure with a tabu search algorithm while incorporating various company specific constraints. The various extensions to cope with the company specific constraints have a strong similarity with the complex job shop problem formulation of Mason, Fowler, and Carlyle (2002). The new procedure is used as a simulation engine to test the relevance of various scenarios in order to improve the current planning approach of the company. A detailed computational experiment highlights the main contribution of the novel procedure for the company. (C) 2011 Elsevier Ltd. All rights reserved.

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


Cybernetics of solvability applied to problem-solving The study aims at defining solvability at the cross-roads of cybernetics and problem-solving. The cases of solvability being focussed on are generated by intervention, and as a result, their approach encounters circular and undisciplinary solving problems. This is why definitions of the third-order circularity and the undisciplinary framework are analytical and restrictive. The second part of the study is particularly concerned with the construction of an arguably cybernetic model of the solving process, and the formal requirements endorsing the research programme. Finally, far-aiming conclusions are drawn referring to the epistemic consistency of the third-order cybernetics and problem-solving, in an attempt to unify these two, already converging, scientific endeavours.

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


Convergence of a generalized MHSS iterative method for augmented systems Bai et al. [Modified HSS iteration methods for a class of complex symmetric linear systems, Computing 87 (2010) 93-111.], have presented the modified HSS (MHSS) algorithm to solve a class of complex symmetric linear systems. In this paper, we establish the generalized MHSS(GMHSS) method for solving augmented systems. We prove the convergence of the proposed method under suitable restrictions on the iteration parameters. Lastly, numerical experiments are carried out and experimental results show that the new iterative methods are feasible and effective.

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

complex symmetric matrix
hermitian and skew-hermitian splitting
positive definite matrix


Stress, Visceral Obesity, and Metabolic Complications Stress is a state of threatened homeostasis or disharmony caused by intrinsic or extrinsic adverse forces and is counteracted by an intricate repertoire of physiologic and behavioral responses that aim to reestablish the challenged body equilibrium. The adaptive stress response depends upon an elaborate neuroendocrine, cellular, and molecular infrastructure, the stress system. Crucial functions of the stress system response are mediated by the hypothalamic-pituitary-adrenal (HPA) axis and the central and peripheral components of the autonomic nervous system (ANS). The integrity of the HPA axis and the ANS and their precise interactions with other CNS components are essential for a successful response to the various stressors. Chronic stress represents a prolonged threat to homeostasis by persistent or frequently repeated stressors and may lead to manifestations that characterize a wide range of diseases and syndromes. Such states progressively lead to a deleterious overload with complications caused by both the persistent stressor and the detrimental prolongation of the adaptive response. The metabolic syndrome can be described as a state of deranged metabolic homeostasis characterized by the combination of central obesity, insulin resistance, dyslipidemia, and hypertension. The incidence of both obesity and the metabolic syndrome in modern Western societies has taken epidemic proportions over the past decades and often correlates with indices of stress in the affected populations. Stress, primarily through hyperactivation of the HPA axis, appears to contribute to the accumulation of fat tissue, and vice versa, obesity itself seems to constitute a chronic stressful state and may cause HPA axis dysfunction. In addition, the description of obesity as a systemic low grade inflammatory condition that contributes to the derangement of the metabolic equilibrium implies that the proinflammatory cytokines which are secreted by the adipocytes hold a potentially important pathogenetic role. In this article we describe the physiology of the stress system response, with emphasis on metabolism, and review the recent data that implicate several neuroendocrine and inflammatory mechanisms mobilized during chronic stress in the development of the metabolic complications that characterize central obesity and the metabolic syndrome

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

stress
hpa axis
cytokines
obesity
metabolic syndrome


Building the information assurance community of purpose This paper describes the need to bring together representatives of the IT department and business organization in a single "community of purpose" in order to achieve effective management of IT risk. It proposes that this is best done through the adoption of a six-layer model of integrated IT risk management that hinges on effective risk analysis and ranges between threat detection and prevention and overall strategic direction. The importance of risk analysis is discussed in relation to an information assurance risk management model. The paper also proposes a four-level reporting structure for each of the six control layers in order to deliver IT risk management reports that are timely, relevant and appropriate for key stakeholders from operational staff to the Chief Executive.

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

analysis management organization reporting


An approach to formal automated analysis of problem-frame concerns We present an approach to performing automated formal analysis of the concerns found in descriptions that follow the problem-frames technique. The descriptions of the problem domains, machine and requirements are written in a formal language. The approach is explained through a case study using the Alloy language. We show that an evaluation of results and counter-examples provided by a model checker can reveal useful information that can help remove inconsistencies as well as composition errors.

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

formal analysis
concerns
composition
alloy


Ad hoc networking in future wireless communications This paper contains an overview of the discussions on future research directions within the subject of ad hoc networking, held at the Wireless World Research Forum meetings during 2001. Ad hoc networking is an emerging research field where ad hoc networks are no longer viewed as stand-alone groups of wireless terminals. On the contrary, ad hoc networks are expected to become fundamental in the future development of infrastructure networks and they will be the basis for enabling ubiquitous communications. Ad hoc networking involves new research issues at all layers. (C) 2002 Elsevier Science B.V. All rights reserved.

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


Integrated business agents for processing free text information The Internet functions as an increasingly important channel for retailing commerce and business transactions. Although nearly five billion web sites exist on the World Wide Web, an integrated mediator, called a business agent, is sought to negotiate between suppliers and buyers. Such an intelligent business broker is thus necessary to support efficient and effective sharing of information. This work proposes an entirely new business agent architecture comprised of five elements, namely Business Spy Agent, Supply and Demand Analysis, Supply and Demand Classification, Matching and Negotiation, and Hidden Business Mining. The proposed architecture encompasses four trading processes, including Supply and demand identification, product brokering, merchant brokering and negotiation. The architecture introduces the notion of ontology to increase the precision of classification and more the effectiveness of negotiation. Experiments involving the proposed business agent show a significant successful pairing rate of 82% among suppliers and buyers. Simulation results indicate that the options, including Negotiable, Designated Brand and Split Demand, affect the match ratio differently from various perspectives.

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

business agents
ontology
negotiation
classification
supply and demand


Toward a Tool-Based Development Methodology for Pervasive Computing Applications Despite much progress, developing a pervasive computing application remains a challenge because of a lack of conceptual frameworks and supporting tools. This challenge involves coping with heterogeneous devices, overcoming the intricacies of distributed systems technologies, working out an architecture for the application, encoding it in a program, writing specific code to test the application, and finally deploying it. This paper presents a design language and a tool suite covering the development life-cycle of a pervasive computing application. The design language allows us to define a taxonomy of area-specific building-blocks, abstracting over their heterogeneity. This language also includes a layer to define the architecture of an application, following an architectural pattern commonly used in the pervasive computing domain. Our underlying methodology assigns roles to the stakeholders, providing separation of concerns. Our tool suite includes a compiler that takes design artifacts written in our language as input and generates a programming framework that supports the subsequent development stages, namely, implementation, testing, and deployment. Our methodology has been applied on a wide spectrum of areas. Based on these experiments, we assess our approach through three criteria: expressiveness, usability, and productivity.

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

domain-specific language
generative programming
toolkit
programming support
simulation


Reduced multiple empirical kernel learning machine Multiple kernel learning (MKL) is demonstrated to be flexible and effective in depicting heterogeneous data sources since MKL can introduce multiple kernels rather than a single fixed kernel into applications. However, MKL would get a high time and space complexity in contrast to single kernel learning, which is not expected in real-world applications. Meanwhile, it is known that the kernel mapping ways of MKL generally have two forms including implicit kernel mapping and empirical kernel mapping (EKM), where the latter is less attracted. In this paper, we focus on the MKL with the EKM, and propose a reduced multiple empirical kernel learning machine named RMEKLM for short. To the best of our knowledge, it is the first to reduce both time and space complexity of the MKL with EKM. Different from the existing MKL, the proposed RMEKLM adopts the Gauss Elimination technique to extract a set of feature vectors, which is validated that doing so does not lose much information of the original feature space. Then RMEKLM adopts the extracted feature vectors to span a reduced orthonormal subspace of the feature space, which is visualized in terms of the geometry structure. It can be demonstrated that the spanned subspace is isomorphic to the original feature space, which means that the dot product of two vectors in the original feature space is equal to that of the two corresponding vectors in the generated orthonormal subspace. More importantly, the proposed RMEKLM brings a simpler computation and meanwhile needs a less storage space, especially in the processing of testing. Finally, the experimental results show that RMEKLM owns a much efficient and effective performance in terms of both complexity and classification. The contributions of this paper can be given as follows: (1) by mapping the input space into an orthonormal subspace, the geometry of the generated subspace is visualized; (2) this paper first reduces both the time and space complexity of the EKM-based MKL; (3) this paper adopts the Gauss Elimination, one of the on-the-shelf techniques, to generate a basis of the original feature space, which is stable and efficient.

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

multiple kernel learning
empirical kernel mapping

reduced kernel learning
orthonormal basis
pattern recognition


i/o streaming evaluation of batch queries for data-intensive computational turbulence We describe a method for evaluating computational turbulence queries, including Lagrange Polynomial interpolation, based on partial sums that allows the underlying data to be accessed in any order and in parts. We exploit these properties to stream data from disk in a single pass and concurrently evaluate batch queries. The combination of sequential I/O and data sharing improves performance by an order of magnitude when compared with direct evaluation of each query. The technique also supports distributed evaluation of queries in a database cluster, assembling the partial sums from each node at the query mediator. Interpolation is fundamental to computational turbulence, over 95\% of queries use these routines, and the partial sums method allows the JHU Turbulence Database Cluster to realize scale and throughput for our scientists' data-intensive workloads.

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

database clusters
software for high-throughput computing
data-intensive computing
i/o streaming
query evaluation
query optimization


profile-guided code compression As computers are increasingly used in contexts where the amount of available memory is limited, it becomes important to devise techniques that reduce the memory footprint of application programs while leaving them in an executable form. This paper describes an approach to applying data compression techniques to reduce the size of infrequently executed portions of a program. The compressed code is decompressed dynamically (via software) if needed, prior to execution. The use of data compression techniques increases the amount of code size reduction that can be achieved; their application to infrequently executed code limits the runtime overhead due to dynamic decompression; and the use of software decompression renders the approach generally applicable, without requiring specialized hardware. The code size reductions obtained depend on the threshold used to determine what code is "infrequently executed" and hence should be compressed: for low thresholds, we see size reductions of 13.7\% to 18.8\%, on average, for a set of embedded applications, without excessive runtime overhead.

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

program
software
threshold
applications
use
dynamic
code
size
data compression
reduction
hardware
paper
runtime

code compaction
computation
context
memorialized
code size reduction
code compression
dynamic decompression
profiles
embedding


Efficient trigger-broadcasting in heterogeneous clusters ? Broadcasts in parallel computing environments are often used to trigger personal computations at the processors (or, nodes) that comprise the system. (The qualifier personal means that the triggered computations may differ in type and complexity at each node.) We present an algorithm for trigger-broadcasting in a node-heterogeneous cluster of workstations, which comes predictably close to minimizing the time for completing both the broadcast and the computations it triggers. The algorithm orchestrates its broadcast taking account of: the speeds of the cluster's constituent workstations, the speed of the cluster's network, and the complexities of the computations that the broadcast triggers. The algorithm is within a constant factor of optimal when the speeds of the cluster's workstations and of its network are independent of the number of workstations. The algorithm is exactly optimal when the cluster is homogeneousno matter how diverse the personal computations are.

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

cluster computing
nows
collective communication
broadcasting


Process systems engineering: A retrospective view with questions for the future The paper reviews the development of process systems engineering from a personal view-point, selecting concepts from the past which have given rise to new paradigms, and hence led to improved understanding or advances in solution techniques, but which either still pose unresolved problems or hold the promise of further developments. © 2005 Elsevier Ltd. All rights reserved.

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

algorithms flowsheets modelling design control optimization


Designing Secure Data Warehouses by Using MDA and QVT The Data Warehouse (DW) design is based on multidimensional ( MD) modeling which structures information into facts and dimensions. Due to the confidentiality of the data that it stores, it is crucial to specify security and audit measures from the early stages of design and to enforce them throughout the lifecycle. Moreover, the standard framework for software development, Model Driven Architecture (MDA), allows us to de. ne transformations between models by proposing Query/View/Transformations (QVT). This proposal permits the definition of formal, elegant and unequivocal transformations between Platform Independent Models (PIM) and Platform Specific Models (PSM). This paper introduces a new framework for the design of secure DWs based on MDA and QVT, which covers all the design phases (conceptual, logical and physical) and specifies security measures in all of them. We first define two metamodels with which to represent security and audit measures at the conceptual and logical levels. We then go on to de. ne a transformation between these models through which to obtain the traceability of the security rules from the early stages of development to the final implementation. Finally, in order to show the benefits of our proposal, it is applied to a case study.

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


The use of learning algorithms in ATM networks call admission control problem: a methodology Call Admission Control (CAC) is one of the most fundamental preventive congestion control mechanisms in Asynchronous Transfer Mode (ATM) networks. Several mathematical approaches that have been proposed in the literature, which usually estimate the equivalent bandwidth that is required, achieve conservative approximations that result in reduced statistical gain and thus, in under-utilisation of the network resources. In this study, a new methodology is proposed which uses a Learning Automaton (LA) in combination with equivalent bandwidth approximations to reduce the percentage of overestimation. The learning algorithm that is used attempts to predict in real-time if a call-request should be accepted or not receiving as feedback a function of an estimate of the equivalent bandwidth. As will be shown, the proposed mechanism, whose hardware implementation is feasible, exhibits remarkable statistical gain compared with some classical CAC schemes of the literature and distinct improvement of the equivalent bandwidth approximations. Finally, some issues for extending this work are also discussed.

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

atm
call admission control
equivalent bandwidth
learning automaton


Quantum speed-up for unsupervised learning We show how the quantum paradigm can be used to speed up unsupervised learning algorithms. More precisely, we explain how it is possible to accelerate learning algorithms by quantizing some of their subroutines. Quantization refers to the process that partially or totally converts a classical algorithm to its quantum counterpart in order to improve performance. Inparticular, we give quantized versions of clustering via minimum spanning tree, divisive clustering and k-medians that are faster than their classical analogues. Wealso describe a distributed version of k-medians that allows the participants to save on the global communication cost of the protocol compared to the classical version. Finally, we design quantum algorithms for the construction of a neighbourhood graph, outlier detection as well as smart initialization of the cluster centres.

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

quantum learning
quantum information processing
grovers algorithm


Outlier correction from uncalibrated image sequence using the Triangulation method We propose a robust algorithm for estimating the projective reconstruction from image features using the RANSAC-based Triangulation method. In this method, we select input points randomly, separate the input points into inliers and outliers by computing their reprojection error, and correct the outliers so that they can become inliers. The reprojection error and correcting outliers are computed using the Triangulation method. After correcting the outliers, we can reliably recover projective motion and structure using the projective factorization method. Experimental results showed that errors can be reduced significantly compared to the previous research as a result of robustly estimated projective reconstruction.

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

projective reconstruction
factorization
outlier


Fuzzy Logic Based Approach to Design of Flight Control and Navigation Tasks for Autonomous Unmanned Aerial Vehicles This paper proposes a fuzzy logic based autonomous navigation controller for UAVs (unmanned aerial vehicles). Three fuzzy logic modules are developed under the main navigation system for the control of the altitude, the speed, and the heading, through which the global position (latitude-longitude) of the air vehicle is controlled. A SID (Standard Instrument Departure) and TACAN (Tactical Air Navigation) approach is used and the performance of the fuzzy based controllers is evaluated with time based diagrams under MATLAB's standard configuration and the Aerosim Aeronautical Simulation Block Set which provides a complete set of tools for rapid development of detailed six-degree-of-freedom nonlinear generic manned/unmanned aerial vehicle models. The Aerosonde UAV model is used in the simulations in order to demonstrate the performance and the potential of the controllers. Additionally, FlightGear Flight Simulator and GMS aircraft instruments are deployed in order to get visual outputs that aid the designer in the evaluation of the controllers. Despite the simple design procedure, the simulated test flights indicate the capability of the approach in achieving the desired performance.

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

fuzzy logic based autonomous flight computer design


Organizational structure and the periphery of the gene regulatory network in B-cell lymphoma The physical periphery of a biological cell is mainly described by signaling pathways which are triggered by transmembrane proteins and receptors that are sentinels to control the whole gene regulatory network of a cell. However, our current knowledge about the gene regulatory mechanisms that are governed by extracellular signals is severely limited.

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

b-cell lymphoma
gene expression data
statistical network inference