Learning Social Tag Relevance by Neighbor Voting Social image analysis and retrieval is important for helping people organize and access the increasing amount of user-tagged multimedia. Since user tagging is known to be uncontrolled, ambiguous, and overly personalized, a fundamental problem is how to interpret the relevance of a user-contributed tag with respect to the visual content the tag is describing. Intuitively, if different persons label visually similar images using the same tags, these tags are likely to reflect objective aspects of the visual content. Starting from this intuition, we propose in this paper a neighbor voting algorithm which accurately and efficiently learns tag relevance by accumulating votes from visual neighbors. Under a set of well-defined and realistic assumptions, we prove that our algorithm is a good tag relevance measurement for both image ranking and tag ranking. Three experiments on 3.5 million Flickr photos demonstrate the general applicability of our algorithm in both social image retrieval and image tag suggestion. Our tag relevance learning algorithm substantially improves upon baselines for all the experiments. The results suggest that the proposed algorithm is promising for real-world applications.

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

multimedia indexing and retrieval
social tagging


Cache noise prediction Caches are underutilized because not all of the excess data brought into the cache, to exploit spatial locality, is used. We define cache utilization as the percentage of data brought into the cache that is actually used. In this paper, we focus on prediction mechanisms to predict the useless data in a cache block ( cache noise). The prediction mechanisms consider the word usage history of cache blocks for predicting the useful data so that only the useful data is fetched into the cache on a cache miss. We found that the cache noise can have a predictability of about 95 percent with a simple last word usage predictor. When applying cache noise prediction to the L1 data cache, we observed about 37 percent improvement in cache utilization and about 23 percent and 28 percent reduction in cache energy consumption and bandwidth requirement, respectively. Cache noise mispredictions increased the miss rate by 0.1 percent and had almost no impact on instructions per cycle (IPC) count. When compared to a subblocked cache, fetching the to-be-referenced data resulted in 97 percent and 10 percent improvement in miss rate and cache utilization, respectively. However, the subblocked cache had a bandwidth requirement of about 35 percent of the cache noise prediction-based approach and saved 10 percent more power. We also observed that cache noise prediction significantly improves the utilization and reduces the bandwidth requirement for prefetching.

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

block size
cache organization
memory context


PODC: Paradigm-oriented distributed computing We describe an environment for distributed computing that uses the concept of well-known paradigms. The main advantage of paradigm-oriented distributed computing (PODC) is that the user only needs to specify application-specific sequential code, while the underlying infrastructure takes care of the parallelization and distribution. The main features of the proposed approach, called PODC, are the following: (1) It is intended for loosely coupled network environments, not specialized multiprocessors; (2) it is based on an infrastructure of mobile agents; (3) it supports programming in C, rather than a functional or special-purpose language, and (4) it provides an interactive graphics interface through which programs are constructed, invoked, and monitored. We discuss five paradigms presently supported in PODC: the bag-of-tasks, branch-and-bound search, genetic programming, finite difference, and individual-based simulation. We demonstrate their use, implementation, and performance within the mobile agent-based PODC environment.

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

distributed computing
mobile agents
genetic programming
finite difference

paradigm-oriented computing
bag of tasks
branch and bound
individual-based simulation


Constrained Motif Discovery in Time Series The goal of motif discovery algorithms is to efficiently find unknown recurring patterns. In this paper, we focus on motif discovery in time series. Most available algorithms cannot utilize domain knowledge in any way which results in quadratic or at least super-linear time and space complexity. In this paper we define the Constrained Motif Discovery problem which enables utilization of domain knowledge into the motif discovery process. The paper then provides two algorithms called MCFull and MCInc for efficiently solving the constrained motif discovery problem. We also show that most unconstrained motif discovery problems be converted into constrained ones using a change-point detection algorithm. A novel change-point detection algorithm called the Robust Singular Spectrum Transform (RSST) is then introduced and compared to traditional Singular Spectrum Transform using synthetic and real-world data sets. The results show that RSST achieves higher specificity and is more adequate for finding constraints to convert unconstrained motif discovery problems to constrained ones that can be solved using MCFull and MCInc. We then compare the combination of RSST and MCFull or MCInc with two state-of-the-art motif discovery algorithms on a large set of synthetic time series. The results show that the proposed algorithms provided four to ten folds increase in speed compared the unconstrained motif discovery algorithms studied without any loss of accuracy. RSST+MCFull is then used in a real world human-robot interaction experiment to enable the robot to learn free hand gestures, actions, and their associations by watching humans and other robots interacting.

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

constrained motif discovery in time series

change-point detection
mining human physiological data
human-robot interaction


Rate control-based framework and algorithm for optimal provisioning Ideally, networks should be designed to accommodate a variety of different traffic types, while at the same time maximizing its efficiency and utility. Network utility maximization (NUM) serves as an effective approach for solving the problem of network resource allocation (NRA) in network analysis and design. In existing literature, the NUM model has been used to achieve optimal network resource allocation such that the network utility is maximized. This is important, since network resources are at premium with the exponential increase in Internet traffic. However, most research work considering network resource allocation does not take into consideration key issues, such as routing and delay. A good routing policy is the key to efficient network utility, and without considering the delay requirements of the different traffic, the network will fail to meet the user's quality of service (QoS) constraints. In this paper, we propose a new NUM framework that achieves improved network utility while taking into routing and delay requirements of the traffic. Then, we propose a decomposition technique-based algorithm, D-NUM, for solving this model efficiently. We compare our approach with existing approaches via simulations and show that our approach performs well.

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

network resource allocation
network utility maximization
optimal provisioning


A linear time algorithm for finding all hinge vertices of a permutation graph (vol 59, pg 103, 1996) This note points out and corrects an error in the algorithm proposed in [Ting-Yem Ho, Yue-Li Wang and Ming-Tsan Juan, A linear time algorithm for finding all hinge vertices of a permutation graph, Information Processing Letters 59 (2) (1996) 103-107]. (C) 2011 Elsevier B.V. All rights reserved.

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

analysis of algorithms
design of algorithms
permutation graphs


Inter-sector beamforming with MMSE receiver in the downlink of TDD cellular systems The use of beamforming is effective for users in limited power environments. However, when it is applied to the downlink of a cellular system with universal frequency reuse, users near the sector boundary may experience significant interference from more than one sector. The use of a minimum mean square error (MMSE)-type receiver may not sufficiently cancel out the interference unless a sufficient number of receive antennas are used. In this paper, we consider the use of inter-sector beamforming that cooperates with a neighboring sector in the same cell to mitigate this interference problem in time-division duplex (TDD) environments. The proposed scheme can avoid interference from an adjacent sec- tor in the same cell, while enhancing the transmit array gain by using the TDD reciprocity. The performance of the proposed scheme is analyzed in terms of the output signal-to-interference-plus noise power ratio (SINR) and the output capacity when applied to an MMSE-type receiver. The beamforming mode can be analytically switched between the inter-sector and the single-sector mode based on the long-term channel information. Finally, the effectiveness of the proposed scheme is verified by computer simulation.

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

array gain
beamforming
interference
sector boundary

cooperation
minimum mean square estimate (mmse)
time division duplex (tdd)


A New LDMOS Transistor Macro-Modeling for Accurately Predicting Bias Dependence of Gate-Overlap Capacitance We have developed a macro model, which allows us to describe precise LDMOS DC/AC characteristics. Characterization of anomalous gate input capacitance is the key issue in the LDMOS model development. We have newly employed a T-type distributed RC scheme for gate overlapped LDMOS drift region. The bias dependent resistance and capacitance are modeled independently in Verilog-A as R-model and PMOS-capacitance. The dividing factor of the distributed R is introduced to reflect the shield effect of the gate overlap capacitance. Comparison between the new model and measurement results has proven that the developed macro model reproduces accurately not only the gate input capacitance, but also DC characteristics.

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

gate-overlap capacitance
circuit simulation


hypertext structures for investigative teams Investigations such as police investigations, intelligence analysis, and investigative journalism involves a number of complex knowledge management tasks. Investigative teams collect, process, and analyze information related to a specific target to create products that can be disseminated to their customers. This paper presents a novel hypertext-based tool that supports a human-centered, target-centric model for investigative teams. The model divides investigative tasks into five overall processes: acquisition, synthesis, sense-making, dissemination, and cooperation. The developed tool provides more comprehensive support for synthesis and sense-making tasks than existing tools.

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

cooperation
investigative journalism
acquisition
dissemination
synthesis


Fast anomaly detection in hyperspectral images with RX method on heterogeneous clusters Remotely sensed hyperspectral sensors provide image data containing rich information in both the spatial and the spectral domain, and this information can be used to address detection tasks in many applications. One of the most widely used and successful algorithms for anomaly detection in hyperspectral images is the RX algorithm. Despite its wide acceptance and high computational complexity when applied to real hyperspectral scenes, few approaches have been developed for parallel implementation of this algorithm. In this paper, we evaluate the suitability of using a hybrid parallel implementation with a high-dimensional hyperspectral scene. A general strategy to automatically map parallel hybrid anomaly detection algorithms for hyperspectral image analysis has been developed. Parallel RX has been tested on an heterogeneous cluster using this routine. The considered approach is quantitatively evaluated using hyperspectral data collected by the NASA's Airborne Visible Infra-Red Imaging Spectrometer system over the World Trade Center in New York, 5 days after the terrorist attacks. The numerical effectiveness of the algorithms is evaluated by means of their capacity to automatically detect the thermal hot spot of fires (anomalies). The speedups achieved show that a cluster of multi-core nodes can highly accelerate the RX algorithm.

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

anomaly detection
heterogeneous clusters


Exploiting Service Usage Information for Optimizing Server Resource Management It is often difficult to tune the performance of modern component-based Internet services because: (1) component middleware are complex software systems that expose several independently tuned server resource management mechanisms; (2) session-oriented client behavior with complex data access patterns makes it hard to predict what impact tuning these mechanisms has on application behavior; and (3) component-based Internet services themselves exhibit complex structural organization with requests of different types having widely ranging execution complexity. In this article we show that exposing and using detailed information about how clients use Internet services enables mechanisms that achieve two interconnected goals: (1) providing improved QoS to the service clients, and (2) optimizing server resource utilization. To differentiate among levels of service usage (service access) information, we introduce the notion of the service access attribute and identify four related groups of service access attributes, encompassing different aspects of service usage information, ranging from the high-level structure of client web sessions to low-level fine-grained information about utilization of server resources by different requests. To show how the identified service usage information can be collected, we implement a request profiling infrastructure in the JBoss Java application server. In the context of four representative service management problems, we show how collected service usage information is used to improve service performance, optimize server resource utilization, or to achieve other problem-specific service management goals.

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

management
performance
component middleware
service usage information
client behavior

design
experimentation
internet application
quality-of-service
server resource management
optimization


analyzing client interactivity in streaming media This paper provides an extensive analysis of pre-stored streaming media workloads, focusing on the client interactive behavior. We analyze four workloads that fall into three different domains, namely, education, entertainment video and entertainment audio. Our main goals are: (a) to identify qualitative similarities and differences in the typical client behavior for the three workload classes and (b) to provide data for generating realistic synthetic workloads.

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

education
data
video
entertainment
streaming media
paper
workload
goals
audio
analysis
behavior

domain
interaction
workload characterization
class


notes on the creative process of artist collectives This paper explores the relationship between the creative process of artist collectives and emergence, the appearance of "higher order" from the actions of a group of relatively simple agents following local rules. The author asks if there are "rules" or "cultures" of collective art activity that are particularly productive. The paper suggests applications of ideas from biology, cognitive science, and psychology to creative interaction, using examples from the collective in which the author participates.

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

psychology
collectives
artist
biology
creative process
art
emergence
cognitive science


a unified semantic approach for the vectorization and parallelization of generalized reductions Generalized reductions include some of the most well known programming idioms, for instance loop invariant variables, induction variables and reduction operations. We propose a unified framework that allows the detection of these paradigms and thus the efficient parallel implementation of programs that use these otherwise parallel-inhibiting constructs. Moreover, using a semantic-based symbolic evaluator, this technique is able to detect parallelizable constructs inside standard benchmarks that no other vectorizer or parallelizer can currently handle. An interesting by-product of our approach is that correctness proofs can be based on the sound and powerful abstract interpretation theory. This method has been implemented in the Velour vectorizer under current development at the Bull Research Center.

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

framework use theory vectorization research sound method detection semantic interpretation implementation parallelization reduction

efficiency
invariance
benchmark
developer
standardization
general
induction variable
variability
program
product
symbolic evaluation
abstraction
correctness proof
operability
inductance


human action recognition using a dynamic bayesian action network with 2d part models This paper presents an approach to simultaneously track the pose and recognize human actions in a video. This is achieved by combining Dynamic Bayesian Action Network (DBAN) with 2D body part models. Existing DBAN implementation relies on fairly weak observation features which affects recognition accuracy. In this work, we propose to use an occlusion sensitive 2D body part model for accurate pose alignment, which in turn improves both pose estimate and action recognition accuracy. To compensate for the additional time required for alignment, we use an action entropy based scheme to determine the minimum number of states to be maintained in each frame while avoiding sample impoverishment. We demonstrate our approach on a hand gesture dataset with 500 action sequences, and show that compared to DBAN, our algorithm achieves 6\% improvement in accuracy.

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

pictorial structure
dynamic bayesian network


Pattern classification using genetic algorithms: Determination of H A methodology based on the concept of a variable string length GA (VGA) is developed for determining automatically the number of hyperplanes for modeling the class boundaries in a GA-classifier. The genetic operators and fitness function are defined to take care of the variability in chromosome length. It is proved that the method is able to arrive at the optimal number of misclassifications after a sufficiently large number of iterations, and will need a minimal number of hyperplanes for this purpose. Experimental results on different artificial and real life data sets demonstrate that the classifier, using the concept of a variable length chromosome, can automatically determine an appropriate value of the number of hyperplanes, and also provide performance better than that of the fixed length version. Its comparison with another approach using a VGA is provided.

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

genetic algorithms
variable string length

optimum hyperplane fitting
speech recognition


Self-disclosure at social networking sites: An exploration through relational capitals In this research the authors examine member self-disclosure phenomenon at social networking sites. Self-disclosure enables member interactions, service customizations, and digital content generation and hence self-disclosure is imperative to the success of social networking sites. Drawing upon Social Capital Theory, we develop a succinct research model that examines the role of relational capitals in member disclosure behavior. This model also investigates the intricate relationships among relational capitals such as trust, reciprocity, and identification. This research model has been validated through survey data collected from 222 social networking site users and the analysis results provide strong support to the hypothesized relationships. The current study generates new knowledge on the exact role of relational capitals in sustaining social networking sites and it also informs the service providers of social networks to identify strategies that promote member disclosure.

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

social networking
social capital
trust
reciprocity
identification


Numerical solution of telegraph equation using interpolating scaling functions A numerical technique is presented for the solution of second order one dimensional linear hyperbolic equation. This method uses interpolating scaling functions. The method consists of expanding the required approximate solution as the elements of interpolating scaling functions. Using the operational matrix of derivatives, we reduce the problem to a set of algebraic equations. Some numerical examples are included to demonstrate the validity and applicability of the technique. The method is easy to implement and produces accurate results.

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

interpolating scaling function
operational matrix of derivative


Shape reconstruction of 3D metallic objects via a physical optics distributional approach The problem of determining the shape of 3D perfect electric conducting (PEC) objects starting from the scattered far field under the incidence of plane waves with a fixed angle of incidence, varying frequency and two orthogonal polarizations is dealt with. Two strategies of reconstruction are presented and compared. In particular, in the first solution strategy the data acquired at the two polarizations are singularly exploited to achieve two different reconstructions and the object surface is then obtained as their union. In the second one, all the data (i.e., for both the adopted polarizations) are simultaneously exploited to obtain the reconstruction. In all the cases, by adopting a distributional formulation for the unknown of the problem and thanks to the exploitation of the Kirchhoff approximation, the problem is cast as a linear inverse one and the solution is made stable by adopting a regularization scheme based on the truncated singular value decomposition (TSVD). The reliability of the inversion approach is tested with synthetic data against model error and noise on data.

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

shape reconstruction
kirchhoff approximation


Categories for barriers to adoption of instructional technologies Although higher education has spent millions of dollars on instructional technologies, often higher education administration complains that instructors are not adopting them. Without a full understanding of possible barriers, higher education institutes are hard-pressed to develop either appropriate goals or sound strategies for the adoption of instructional technology. A review of the literature on barriers to instructor adoption found conflicting results, in which some issues present more of a barrier than others. These range from a lack of definition of successful adoption (how many adopting instructors are enough?) to inadequate or inappropriate professional development (meeting differing instructors needs) to resistance (based on self-efficacy, beliefs in pedagogy, etc.). Five categories are described based on literature researched: technology, process, administration, environment, and faculty. Within each of these categories is a description, based on the literature, of each barrier. A fish-bone diagram displaying the categories and barriers within them is presented. This review of the literature provides a framework for further research in methods for minimizing the impact of each barrier. The framework of categories of barriers presented here provides institutions with a starting point to approach adoption of instructional technology with a plan to mitigate and minimize as many barriers as possible, giving adoption a better chance of success.

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

instructional technology
higher education
barriers to adoption


BILU implicit multiblock Euler/Navier-Stokes simulation for rotor tip vortex and wake convection In this paper, a block incomplete lower-upper (BILU) decomposition method is incorporated with a multiblock three-dimensional Euler/Navier-Stokes solver for simulation of hovering rotor tip vortices and rotor wake convection. Results of both Euler and Navier-Stokes simulations are obtained and compared with experimental observations. The comparisons include surface pressure distributions and tip vortex trajectories. The comparisons suggest that resolution of the boundary layer is important for the accurate evaluation of the blade surface loading, but is less so for the correct prediction of the vortex trajectory. Numerical tests show that, using Courant-Friedrichs-Lewy (CFL) number of 10 or 30 with the developed BILU implicit scheme can be 6-7 times faster than an explicit scheme. The importance of solution acceleration schemes that increase the permitted time-step is illustrated by comparing the evolving wake structures at different stages of the calculation. In contrast to fixed wing simulations, the extent of the wake structures is shown to require resolution of large physical time. This observation explains the poor performance that is obtained when employing convergence acceleration strategies originally intended for solution of equilibrium problems, such as the multigrid methods. Copyright (C) 2007 John Wiley & Sons, Ltd.

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

tip vortex and wake
vortex trajectory
bilu
convergence acceleration

helicopter rotor
implicit method
osher's scheme


GridMol: a grid application for molecular modeling and visualization In this paper we present GridMol, an extensible tool for building a high performance computational chemistry platform in the grid environment. GridMol provides computational chemists one-stop service for molecular modeling, scientific computing and molecular information visualization. GridMol is not only a visualization and modeling tool but also simplifies control of remote Grid software that can access high performance computing resources. GridMol has been successfully integrated into China National Grid, the most powerful Chinese Grid Computing platform. In Section "Grid computing" of this paper, a computing example is given to show the availability and efficiency of GridMol. GridMol is coded using Java and Java3D for portability and cross-platform compatibility (Windows, Linux, MacOS X and UNIX). GridMol can run not only as a stand-alone application, but also as an applet through web browsers. In this paper, we will present the techniques for molecular visualization, molecular modeling and grid computing. GridMol is available free of charge under the GNU Public License (GPL) from our website: http://www.sccas.cn/similar to syh/GridMol/index.html.

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

grid computing
gridmol
molecular visualization
molecular modeling

java 3d (tm)
one-stop service
protein secondary structure


the effect of unrolling and inlining for python bytecode optimizations In this study, we consider bytecode optimizations for Python, a programming language which combines object-oriented concepts with features of scripting languages, such as dynamic dictionaries. Due to its design nature, Python is relatively slow compared to other languages. It operates through compiling the code into powerful bytecode instructions that are executed by an interpreter. Python's speed is limited due to its interpreter design, and thus there is a significant need to optimize the language. In this paper, we discuss one possible approach and limitations in optimizing Python based on bytecode transformations. In the first stage of the proposed optimizer, the bytecode is expanded using function inline and loop unrolling. The second stage of transformations simplifies the bytecode by applying a complete set of data-flow optimizations, including constant propagation, algebraic simplifications, dead code elimination, copy propagation, common sub expressions elimination, loop invariant code motion and strength reduction. While these optimizations are known and their implementation mechanism (data flow analysis) is well developed, they have not been successfully implemented in Python due to its dynamic features which prevent their use. In this work we attempt to understand the dynamic features of Python and how these features affect and limit the implementation of these optimizations. In particular, we consider the significant effects of first unrolling and then inlining on the ability to apply the remaining optimizations. The results of our experiments indicate that these optimizations can indeed be implemented and dramatically improve execution times.

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


Secure Group Communication in Wireless Sensor Networks: A survey Wireless Sensor Networks (WSN) consist of a large number of sensor nodes which are often deployed in an unattended harsh environment. As they are exposed to a wide range of attacks, sensor-based applications have then to be secured. In this paper, we present an up-to-date survey of different Secure Group Communication (SGC) schemes in WSN. We examine both components of the existing SGC schemes, namely the group key management and the group membership management, and discuss their performance and security level. In addition, we classify existing schemes into three different approaches: centralized, contributory, and hybrid. Additionally, we provide recommendations on which scheme to use for specific WSN constraints and specific application requirements. Finally, we point out the challenges that researchers have to address while giving them directions to potential solutions.

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

secure group communication (sgc)
wireless sensor networks (wsn)


Genetic algorithm-based adaptive fuzzy sliding mode controller for electronic throttle valve Electronic throttle valves are electromechanical systems which regulate the air flow inside gasoline engines. The objective of electronic throttle valve control is to ensure fast and accurate reference tracking of the valve plate angle. This control demands are hard to accomplish since the plant is burdened with strong nonlinear effects and parameters uncertainty. In this paper, a genetic algorithm-based adaptive fuzzy sliding mode controller (AFSMC) is proposed for an electronic throttle considering actuator nonlinearities. In the AFSMC approach, fuzzy logic system is applied to approximate the plant model and the actuator model, the sliding mode controller makes full use of the plant model to guarantee robust control even in the presence of parameters uncertainty, and genetic algorithm is developed to search the optimal control gains values of the AFSMC. The performance of the AFSMC is verified by computer simulation and experiment.

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

electronic throttle valve
fuzzy logic system
actuator nonlinearities

sliding mode control
genetic algorithm (ga)


Financial analysis of civil reserve air fleet participants using data envelopment analysis The United States Department of Defenses Civil Reserve Air Fleet (CRAF) consists of commercial air carriers which have agreed to augment the Air Forces air mobility and transport capabilities in times of national emergency. CRAF is expected to play a much more important national-defense role in the future since the Air Force has reduced its airlift capacity in response to the drawdown of forces initiated after the collapse of the Soviet Union and the corresponding budget reductions. In order for the Air Force to rely on the CRAF participants responding when needed, it is important that the participants be financially healthy. In the past the Air Force has lost CRAF participants Braniff Airlines, Eastern Airlines, and Pan Am Airlines due to bankruptcy and liquidation. This research assesses the financial stability of CRAF participants using data envelopment analysis complemented by ratio analysis.

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


cache write policies and performance This paper investigates issues involving writes and caches. First, tradeoffs on writes that miss in the cache are investigated. In particular, whether the missed cache block is fetched on a write miss, whether the missed cache block is allocated in the cache, and whether the cache line is written before hit or miss is known are considered. Depending on the combination of these polices chosen, the entire cache miss rate can vary by a factor of two on some applications. The combination of no-fetch-on-write and write-allocate can provide better performance than cache line allocation instructions. Second, tradeoffs between write-through and write-back caching when writes hit in a cache are considered. A mixture of these two alternatives, called write caching is proposed. Write caching places a small fully-associative cache behind a write-through cache. A write cache can eliminate almost as much write traffic as a write-back cache.

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

cache applications factor performance paper traffic caches allocation

place policy association instruction writing combinational blocking


Gaussian Bare-Bones Differential Evolution Differential evolution (DE) is a well-known algorithm for global optimization over continuous search spaces. However, choosing the optimal control parameters is a challenging task because they are problem oriented. In order to minimize the effects of the control parameters, a Gaussian bare-bones DE (GBDE) and its modified version (MGBDE) are proposed which are almost parameter free. To verify the performance of our approaches, 30 benchmark functions and two real-world problems are utilized. Conducted experiments indicate that the MGBDE performs significantly better than, or at least comparable to, several state-of-the-art DE variants and some existing bare-bones algorithms.

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

bare-bones particle swarm
differential evolution (de)
evolutionary optimization
numerical optimization


Retrieval for color artistry concepts This paper presents a work on the retrieval of art-works for color artistry concepts. First we affirm the view that the Query-by-Example paradigm fundamental to the current content-based retrieval systems is able to extend only limited usefulness. We then propose a concept-based retrieval engine based on the generative grammar of elemental concepts methodology. In the latter, the language by which color artistry concepts are communicated in artworks is used to operate semantic searches. The color artistry language is explicated into elemental concepts and the associated generative grammar. The elemental concepts are used to index the artworks, while the generative grammar is used to facilitate post-coordinate expression of color artistry concept queries by using the elemental concepts.

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

concept-based retrieval
generative grammar of elecepts


On estimation of entrance boundary parameters from downstream measurements using adjoint approach An estimation of entrance boundary conditions from the downstream measurements is considered in variational statement form for two-dimensional supersonic laminar flow. The adjoint problem is used for the calculation of the discrepancy gradient in space of control parameters. The numerical tests presented demonstrate the successful estimation of boundary parameters of spatial distribution by using gradient methods. Copyright (C) 2001 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 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

parabolized navier-stokes
parameter estimation


JSetL: a Java library for supporting declarative programming in Java In this paper we present a Java library-called JSetL-that offers a number of facilities to support declarative programming such as those usually found in logic or functional declarative languages: logical variables, list and set data structures (possibly partially specified), unification and constraint solving over sets, non-determinism. The paper describes the main features of JSetL and it shows, through a number of simple examples, how these features can be exploited to support a real declarative programming style in Java. Copyright (c) 2006 John Wiley & Sons, Ltd.

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

constraint programming
set constraints
non-determinism


Patient-specific biomechanical model as whole-body CT image registration tool Patient-specific non-linear biomechanical models were used for whole-body CT image registration. Finite element discretisation was used for biomechanical models. Fuzzy C-Means algorithm was used to assign material properties (no segmentation needed). Total Lagrangian Explicit Dynamics (TLED) finite element algorithm was used to solve the models. Registration accuracy was assessed using the Hausdorff distance metric on Canny edges. 85% of Canny edges are successfully registered.

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

whole-body image registration
patient-specific biomechanical model
non-linear finite element analysis
fuzzy-c means


dynamic data distribution with control flow analysis This paper describes the design of a data distribution tool which automatically derives the data mapping for the arrays and the parallelization strategy for the loops in a Fortran 77 program. The layout generated can be static or dynamic, and the distribution is one-dimensional BLOCK or CYCLIC. The tool takes into account the control flow statements in the code in order to better estimate the behavior of the program. All the information regarding data movement and parallelism is contained in a single data structure named Communication-Parallelism Graph (CPG). The CPG is used to model a minimal path problem in which time is the objective function to minimize. It is solved using a general purpose linear programming solver, which finds the optimal solution for the whole problem. The experimental results will illustrate the quality of the solutions generated and the feasibility of the approach in terms of compilation time.

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

order
quality
movement
linear programming
analysis
design
layout
tool
general
control flow
account
model
paper
minimal
dynamic
code
behavior
data
compilation
graph

communication
estimates
data distributed
data structures
object
map
timing
informal
strategies
experimentation
optimality
parallel
functional
distributed
blocking


Dynamic stiffness formulation and free vibration analysis of a spinning composite beam The dynamic stiffness matrix of a spinning composite beam is developed and then used to investigate its free vibration characteristics. Of particular interest in this study is the inclusion of the bendingtorsion coupling effect that arises from the ply orientation and stacking sequence in laminated fibrous composites. The theory is particularly intended for thin-walled composite beams and does not include the effects of shear deformation and rotatory inertia. Hamiltons principle is used to derive the governing differential equations, which are solved for harmonic oscillation. Exact expressions for the bending displacement, bending rotation, twist, bending moment, shear force and torque at any cross-section of the beam, are also obtained in explicit analytical form. The dynamic stiffness matrix, which relates the amplitudes of loads to those of responses at the end of the spinning beam in free vibration is then derived by imposing the boundary conditions. This enables natural frequency calculation of a spinning composite beam at various spinning speeds to be made by applying the WittrickWilliams algorithm to the resulting dynamic stiffness matrix. The spinning speed at which the fundamental natural frequency tends to zero is the critical speed, which is established for a composite shaft that has been taken from the literature as an example. The results are discussed and some are compared with published ones. The paper concludes with some remarks.

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

free vibration
spinning composite beam
wittrickwilliams algorithm

dynamic stiffness method
critical spinning speed


Biased Discriminant Euclidean Embedding for Content-Based Image Retrieval With many potential multimedia applications, content-based image retrieval (CBIR) has recently gained more attention for image management and web search. A wide variety of relevance feedback (RF) algorithms have been developed in recent years to improve the performance of CBIR systems. These RF algorithms capture user's preferences and bridge the semantic gap. However, there is still a big room to further the RF performance, because the popular RF algorithms ignore the manifold structure of image low-level visual features. In this paper, we propose the biased discriminative Euclidean embedding (BDEE) which parameterises samples in the original high-dimensional ambient space to discover the intrinsic coordinate of image low-level visual features. BDEE precisely models both the intraclass geometry and interclass discrimination and never meets the undersampled problem. To consider unlabelled samples, a manifold regularization-based item is introduced and combined with BDEE to form the semi-supervised BDEE, or semi-BDEE for short. To justify the effectiveness of the proposed BDEE and semi-BDEE, we compare them against the conventional RF algorithms and show a significant improvement in terms of accuracy and stability based on a subset of the Corel image gallery.

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

content-based image retrieval
dimensionality reduction
manifold learning


Microfabricated textured surfaces for super-hydrophobicity investigations The natural hydrophobicity of surfaces can be enhanced if they are micro-textured. This is due to air trapped in the structure, which provides the deposited drop with a composite surface made of solid and air on which it is resting. Here, we give evidence for this effect using a forest of micro-pillars which allows us to control the micro structure density under the drop, and thus the degree of super-hydrophobicity. For this purpose, silicon wafers were firstly patterned by conventional photolithography techniques. After deposition of an aluminium layer, the samples were subjected to a deep reactive ion etching (DRIE) with the Bosch process in order to achieve high aspect ratios (?10). However, this state is not always the most stable situation for a drop on a hydrophobic surface: the drop can also fill up the microstructure. We have been able to observe these two super-hydrophobic states on our surfaces and to characterize advancing and receding contact angles for both of them.

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

microstructures
wetting properties
super-hydrophobicity


security policies for the visualization of geo data We show in this paper that we can use the Or-BAC model [1] to express security policies for the visualization of spatial data. We first add to Or-BAC some visualization predicates and then show how to model various types of spatial data visualization contexts. We finally use these newly defined contexts to write security policies for the visualization of Geo Data.

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

data visualization
spatial
security policies
visualization
use
types
data
paper
model

access control
or-bac
context
geo-spatial data visualization
writing


Schwarz meets Schwann: Design and fabrication of biomorphic and durataxic tissue engineering scaffolds Tissue engineering is a discipline at the leading edge of the field of computer assisted intervention. This multidisciplinary engineering science attempts to meet the reparative and regenerative needs of tissues and organs based on the notion of design and fabrication of scaffolds- porous, three-dimensional trellis-like biomimetic structures that, on implantation, provide a viable environment to recuperate and regenerate damaged cells. Existing scaffold fabrication strategies produce sub-optimal porous labyrinths with contra-naturam straight edges. The biomorphic geometry that mimics the secundam-naturam substrate would be one that is continuous through all space, partitioned into two not-necessarily-equal sub-spaces by a non-intersecting, two-sided surface. Minimal surface geometry is not only ideal to describe such a space but is also the preferentially assumed geometry in natural and pathological or manipulated cells. We present results on the premier attempt in computer-controlled fabrication, modulation, and mechanical characterization of tissue engineering scaffolds based on triply periodic minimal surfaces (TPMS). We also present novel strategies to realize coterminous seeding-feeding networks thereby guaranteeing blood/nutrient supply to the proliferating cells at close proximity. This initiative of linking Schwanns 1838 cell theory with Schwarzs 1865 discovery of TPMS is a significant step to fabricate the previously elusive optimal biomorphic tissue analogs.

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

tissue engineering
scaffolds
biomorphic
durataxic
minimal surfaces

solid freeform fabrication
triply periodic minimal surfaces


Throughput-Driven Synthesis of Embedded Software for Pipelined Execution on Multicore Architectures We present a methodology for pipelined software synthesis of streaming applications. First, we develop a versatile task assignment algorithm capable of optimizing realistically-arbitrary cost functions for two cores. The algorithm is exact (i.e., theoretically optimal) contrary to existing heuristics. Second, our approximation technique provides an adjustable knob to trade solution quality with algorithm runtime and memory. Third, we develop a recursive heuristic for more cores. FPGA-based emulated experiments validate our theoretical results. The exact algorithm yields 1.7 x throughput improvement. The approximation method offers a range of tradeoff points (e. g., 3 x faster with 20 x less memory) while degrading the throughput only 1% to 5%.

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

embedded software
streaming applications
task assignment

algorithms
experimentation
graph partitioning
multi-core hardware


On the almighty wand We investigate decidability, complexity and expressive power issues for (first-order) separation logic with one record field (herein called SL) and its fragments. SL can specify properties about the memory heap of programs with singly-linked lists. Separation logic with two record fields is known to be undecidable by reduction of finite satisfiability for classical predicate logic with one binary relation. Surprisingly, we show that second-order logic is as expressive as SL and as a by-product we get undecidability of St.. This is refined by showing that SL without the separating conjunction is as expressive as SL, whence undecidable too. As a consequence, in SL the separating implication (also known as the magic wand) can simulate the separating conjunction. By contrast, we establish that SL without the magic wand is decidable, and we prove a non-elementary complexity by reduction from satisfiability for the first-order theory over finite words. This result is extended with a bounded use of the magic wand that appears in Hoare-style rules. As a generalization, it is shown that kSL, the separation logic over heaps with k >= 1 record fields, is equivalent to kSO, the second-order logic over heaps with k record fields. (C) 2012 Elsevier Inc. All rights reserved.

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

separation logic
expressive power
complexity


Dynamic ensemble pruning based on multi-label classification Dynamic (also known as instance-based) ensemble pruning selects a (potentially) different subset of models from an ensemble during prediction based on the given unknown instance with the goal of maximizing prediction accuracy. This paper models dynamic ensemble pruning as a multi-label classification task, by considering the members of the ensemble as labels. Multi-label training examples are constructed by evaluating whether ensemble members are accurate or not on the original training set via cross-validation. We show that classification accuracy is maximized when learning algorithms that optimize example-based precision are used in the multi-label classification task. Results comparing the proposed framework against state-of-the-art dynamic ensemble pruning approaches in a variety of datasets using a heterogeneous ensemble of 200 classifiers show that it leads to significantly improved accuracy.

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

ensemble selection
multi-label classification
dynamic classifier fusion


Scale invariance of immune system response rates and times: perspectives on immune system architecture and implications for artificial immune systems Most biological rates and times decrease systematically with increasing organism body size. We use an ordinary differential equation (ODE) model of West Nile Virus in birds to show that pathogen replication rates decline with host body size, but natural immune system (NIS) response rates do not change systematically with body size. The scale-invariant detection and response of the NIS is surprising since the NIS has to search for small quantities of pathogens through larger physical spaces in larger organisms, and also respond by producing larger absolute quantities of antibody in larger organisms. We hypothesize that the NIS has evolved an architecture to efficiently neutralize pathogens. We investigate three different hypothesized NIS architectures using an Agent Based Model (ABM). We find that a sub-modular NIS architecture, in which lymph node number and size both increase sublinearly with body size, efficiently balances the tradeoff between local pathogen detection and global response. This leads to nearly scale-invariant detection and response consistent with experimental data. Similar to the NIS, physical space and resources are also important constraints on distributed systems, for example low-powered robots connected by short-range wireless communication. We show that the sub-modular design principles of the NIS can be applied to problems such as distributed robot control to efficiently balance the tradeoff between local search for a solution and global response or proliferation of the solution. We demonstrate that the lymphatic network of the NIS efficiently balances local and global communication, and we suggest a new approach for Artificial Immune Systems (AIS) that uses a sub-modular architecture to facilitate distributed search.

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

lymph node
west nile virus
distributed search

artificial immune system
immune system scaling
multi-robot control


Analysis of state-independent importance-sampling measures for the two-node tandem queue We investigate the simulation of overflow of the total population of a Markovian two-node tandem queue model during a busy cycle, using importance sampling with a state-independent change of measure. We show that the only such change of measure that may possibly result in asymptotically efficient simulation for large overflow levels is exchanging the arrival rate with the smallest service rate. For this change of measure, we classify the model's parameter space into regions of asymptotic efficiency, exponential growth of the relative error, and infinite variance, using both analytical and numerical techniques.

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

rare-event simulation
importance-sampling
tandem queueing networks


learning domain knowledge for teaching procedural skills This paper describes a method for acquiring procedural knowledge for use by pedagogical agents in interactive simulation-based learning environments. Such agents need to be able to adapt their behavior to the changing conditions of the simulated world, and respond appropriately in mixed-initiative interactions with learners. This requires a good understanding of the goals and causal dependencies in the procedures being taught. Our method, inspired by human tutorial dialog, combines direct specification, demonstration, and experimentation. The human instructor demonstrates the skill being taught, while the agent observes the effects of the procedure on the simulated world. The agent then autonomously experiments with the procedure, making modifications to it, in order to understand the role of each step in the procedure. At various points the instructor can provide clarifications, and modify the developing procedural description as needed. This method is realized in a system called Diligent, which acquires procedural knowledge for the STEVE animated pedagogical agent.

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

interface agents
knowledge acquisition
machine learning
programming by demonstration


FTT-based implementation of sampling rate conversion with a small number of delays Block delay caused by using fast Fourier transform (FFT), and computational complexity in sampling rate conversion system are considered in this paper. The relationship between the number of block delays and the computational complexity is investigated. The proposed method can avoid the redundant operations of sampling rate conversion completely and moreover provide a good trade-off between the number of block delays and the computational complexity. As a result, it is shown that with the proposed method, the sampling rate conversion can be realized more efficiently under a small number of blocks delays.

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

multirate signal processing
overlap-add/save method


Propagation modeling of active P2P worms based on ternary matrix ? Propagation modeling of worms has become an attractive research field in recent years since it facilitates worm prediction, detection, analysis and prevention etc. In this work, we propose a novel ternary-matrix-based model to describe the propagation trend of active P2P worms. Compared to existing logic-matrix-based models, our model takes the time lags into consideration by introducing new states and special matrix operations. Our model is easy of derivation and deployment because it confines derivation process to pure matrix operations. Moreover, two other advantages of our model are fully explored. One is expressiveness: (1) practical P2P topology can be modeled in the topology matrix; (2) the state of any node can be identified at any time; (3) and the attack path of any node can be backtracked in linear time. Flexibility is the other merit: our model can adapt to different scenes by changing the related parameters, particularly our model is general for different kinds of time lags and P2P topologies.

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

active p2p worms
propagation modeling
ternary matrix
time lags
expressiveness
flexibility


Apoptosis Gene Network: Description in the GeneNet and TRRD Databases The large volume of experimental data on apoptosis requires computer processing to systematize and provide an integrated description of operation of the gene network that regulates apoptosis in various cell types under varying effects. The database GeneNet contains the description of the apoptosis gene network

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


Server-Based Computing Solution Based on Open Source Software Server-Based Computing (SBC), i.e., replacing workstations with thin clients, is an effective solution to many IT problems, while free open source software is a cost-efficient alternative to proprietary software. We studied synergies of these two approaches. The results indicated that the open source SBC solution offered at least the same quality of service as the proprietary implementation but lowered the total cost of ownership around 50% compared to previous desktop PC solutions.

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

server-based computing
it efficiency
system architectures


Toward intelligent data warehouse mining: An ontology-integrated approach for multi-dimensional association mining A data warehouse is an important decision support system with cleaned and integrated data for knowledge discovery and data mining systems. In reality, the data warehouse mining system has provided many applicable solutions in industries, yet there are still many problems causing users extra problems in discovering knowledge or even failing to obtain the real and useful knowledge they need. To improve the overall data warehouse mining process, we present an intelligent data warehouse mining approach incorporated with schema ontology, schema constraint ontology, domain ontology and user preference ontology. The structures of these ontologies are illustrated and how they benefit the mining process is also demonstrated by examples utilizing rule mining. Finally, we present a prototype multidimensional association mining system, which with intelligent assistance through the support of the ontologies, can help users build useful data mining models, prevent ineffective pattern generation, discover concept extended rules, and provide an active knowledge re-discovering mechanism.

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

data mining
intelligent assistance
ontology

data warehousing
multidimensional association rule


An Approach for Extracting Business Vocabularies from Business Process Models Being a part of business process management (BPM) life cycle, business process modeling has found its place in information systems development (ISD) practices as well. At the same time, concepts of business vocabularies and rules are also the hot topics among BPM and ISD practitioners and academics. Nevertheless, in ISD, the integration of business process models with business vocabularies and rules is still not standardized and remains quite empiric. In this paper, basic aspects of the approach for business vocabularies' extraction from business process models are presented. The approach is based on novel business level OMG standards "Business Process Model and Notation" (BPMN) and "Semantics for Business Vocabularies and Business Rules" (SBVR), thus contributing to OMG's vision about Model-Driven Architecture (MDA) and to model-driven development in general.

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

business vocabulary
business vocabulary extraction
business process diagram
vetis tool


Penalized scalar-on-functions regression with interaction term ? Generalized models for scalar responses with functional covariates are extended to include linear functional interaction terms. The coefficient functions are estimated using basis expansions and maximization of a log-likelihood, which is penalized to impose smoothness upon the coefficient functions. The respective smoothing parameters for the penalties are estimated from the data, e.g. via generalized cross-validation. Further functional or scalar terms as well as functional interactions of higher order can be added within the same framework. The performance of the introduced approach is tested in simulations. Additionally, it is applied to the two motivating data sets, to spectroscopic data of a fossil fuel and to cell chip sensor data, where three functional signals are measured over time. The main aim is to predict the respective response, namely the heat value of the fossil fuel and the concentration of paracetamol in the cell chip medium.

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

functional data analysis
covariate interaction
penalized likelihood
cell chip data
signal regression
generalized functional linear model


Enhancing identity trust in cryptographic key management systems for dynamic environments Cryptographic key management (CKM) schemes can be used to support identity management (IM) systems where linking users securely to data objects is important. CKM schemes enforce data security by encrypting data granting access only to authorized users and security compromises are prevented by updating any keys that are held by users from whom access rights have been revoked. Handling key updates efficiently and providing security against collusion attacks is challenging in dynamic environments like the Internet where manual Security management increases the likelihood of delayed responses. Delay increases the system's vulnerability to security attacks and the potential of the system's violating its service level agreements. Adaptive CKM has emerged as a possibility of addressing this problem but needs to be designed in a way that justifies the cost/benefit tradeoff. In this paper, we show that the key update and collusion avoidance problems are NP-complete and need heuristic algorithms to prevent performance degradations in comparison to standard CKM schemes. As an example of the benefits of a good heuristic, we present a collusion detection and resolution algorithm whose running time is polynomial in the number of keys. The algorithm operates by mapping the generated key set onto a key graph whose independent set is computed. In the key graph, the vertices represent the keys and the edges the probability that their endpoints can be combined to provoke a collusion attack. Collusion possibilities are resolved by applying a heuristic that resets the probability to zero. The performance of our algorithm is analyzed in comparison to the Akl and Taylor scheme that is secure against collusion attack, and the experimental results indicate that collusion prevention can be done dynamically without affecting performance. Copyright (C) 2010 John Wiley & Sons, Ltd.

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

key management
collusion attack
identity trust


Automated negotiation from declarative contract descriptions Our approach for automating the negotiation of business contracts proceeds in three broad steps. First, determine the structure of the negotiation process by applying general know ledge about auctions and domain-specific knowledge about the contract subject along with preferences from potential buyers and sellers, Second translate the determined negotiation structure into an operational specification for an auction platform. Third, after the negotiation has completed, map the negotiation results to a final contract. We have implemented a prototype which supports these steps by employing a declarative specification (in courteous logic programs) of (1) high-level knock ledge about alternative negotiation structures, (2) general-case rules about auction parameters. (3) rules to map the auction parameters to a specific auction platform, and (4) special-case rules for subject domains, We demonstrate the flexibility of this approach by automatically generating several alternative negotiation structures for the domain of travel shopping in a trading agent competition.

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

e-commerce
electronic contracting
rule-based programming
declarative knowledge representation
situated courteous logic programs


Single-machine scheduling with periodic and flexible periodic maintenance to minimize maximum tardiness This paper considers a single-machine scheduling problem with several maintenances periods. Specifically, two situations are investigated. In the first one, maintenance periods are periodically fixed: maintenance is required after a periodic time interval. In the second one, the maintenance is not fixed but the maximum continuous working time of the machine which is allowed is determined. The objective is to minimize the maximum tardiness. These problems are known to be strongly NP-hard. We propose some dominance properties and an efficient heuristic. Branch-and-bound algorithms, in which the heuristics, the lower bounds and the dominance properties are incorporated, are proposed and tested computationally. (D) 2008 Elsevier Ltd. All rights reserved.

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

scheduling
periodic maintenance
maximum tardiness


Towards a reference architecture for the design of mobile shared workspaces Software design is a complex and expensive socio-technical process, for which reuse is an increasingly important concern. This article presents an abstract structure capturing the essence of a mobile shared workspace (MSW), and how a particular MSW can be obtained by instantiating such a structure. It is intended to assist designers of mobile groupware tools to conceive new products reusing design knowledge proved successful in previous solutions. The article also illustrates how the abstract structure can be instantiated to obtain MSWs that support construction inspection activities, hospital work and urban emergency responses. This abstract structure can be evolved in order to make it a reference architecture for mobile shared workspaces.

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

design reuse
mobile collaboration
nomadic work


Global dynamics of bidirectional associative memory neural networks involving transmission delays and dead zones ? In this article, a model describing the activation dynamics of bidirectional associative memory (BAM) neural networks involving transmission delays was considered. The concept of BAM networks employed in this work is improved and it includes the earlier notions known in the literature and is applied to a wider class of networks. Further, we introduced a new notion, as a measure of restoring stability and termed it as a dead zone. In this article, the influence of the presence of dead zones on the global asymptotic stability of the equilibrium pattern was investigated. Existence and uniqueness of an equilibrium pattern under fairly general and easily verifiable conditions were also established.

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

global dynamics
bam
neural networks
transmission delays
dead zones


Identification and analysis of spatio-temporal dynamical systems using wavelets In this article, the identification and analysis of spatio-temporal dynamical systems is presented. An approximated B-spline wavelet representation of spatio-temporal dynamical systems is identified using an orthogonal least-squares algorithm from measured data. Control variables are incorporated to represent controlled external inputs and/or some system parameters for the purpose of analysis. The identified system models can be used to evaluate how the external inputs or system parameters affect the evolution of the spatio-temporal dynamics and pattern formation. Two examples are used to illustrate the proposed approach.

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

system identification
spatio-temporal systems


Binocular stereo from Grey-Scale images Grey-scale images consist of physical measurements of light. Scale-space theories have been developed to unconfound these measurements from the detector grid. In this framework, we look into the problem of binocular stereo. On a sufficiently large scale, a pixel carries information not only of the grey-value, but of the entire grey-value n-jet, i.e., derivatives up to order n. The subject of this paper is to show, in a general context, how the scale-space n-jet can be exploited for binocular matching. The analysis leads (under appropriate assumptions) to a direct determination of the local n-jet of the disparity field. The general result is an analysis which could be incorporated into many existing stereo algorithms to improve their use of the grey value data. In the computational scheme presented here, the estimations are strictly local, but based on image derivatives at a scale where the image structure is significant. This scale is automatically selected by minimising computational uncertainty. Results are shown as direct computations of surface normals on synthetic and real images.

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

local shape
scale-space
scale selection
optic flow
disparity-tuned filters


A HYBRID GENETIC ALGORITHM FOR PARTITIONING OF DATA MODEL IN DISTRIBUTION MANAGEMENT SYSTEMS In this paper, we propose a Hybrid Genetic Algorithm for data model partitioning of power distribution network. Analytical functions are the core of Distribution Management Systems (DMSs). Efficient calculation of the functions is of the utmost importance for the DMS users; the necessary preconditions for the efficient calculation are optimal load balancing of processors and data model partitioning among processors. The proposed algorithm is applied to different real models of power distribution systems. It obtains better results than classical evolutionary algorithms (Genetic Algorithm and Particle Swarm Optimization). The Hybrid Genetic Algorithm also achieves better results than multilevel algorithm (METIS) in cases of small graphs.

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

graph partitioning
distributed management system
common information model


Information Set Monte Carlo Tree Search Monte Carlo tree search (MCTS) is an AI technique that has been successfully applied to many deterministic games of perfect information. This paper investigates the application of MCTS methods to games with hidden information and uncertainty. In particular, three new information set MCTS (ISMCTS) algorithms are presented which handle different sources of hidden information and uncertainty in games. Instead of searching minimax trees of game states, the ISMCTS algorithms search trees of information sets, more directly analyzing the true structure of the game. These algorithms are tested in three domains with different characteristics, and it is demonstrated that our new algorithms outperform existing approaches to handling hidden information and uncertainty in games.

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

artificial intelligence (ai)
game tree search
monte carlo methods
monte carlo tree search (mcts)


Cognitive support through visualization and focus specification for understanding large class libraries Effective object-oriented (OO) programming requires understanding class libraries. This paper presents our approach to design and build a cognitive tool that supports a programmer to understand OO class libraries. The MUDRIK system provides (1) three-dimensional visualization mechanisms for representing class structures and relationships from a variety of views and (2) flexible focus specification mechanisms that allow users to adapt a space of components to be displayed according to the task at hand. Interactive views of MUDRIK enable programmers to examine components detail while maintaining a global representation of the rest of the library. The paper describes why understanding class library is critical in OO programming, presents a cognitive framework of our approach and design rationale behind the system design, and provides a detailed description of the system followed by a discussion on our approach.

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

class library understanding
software visualization
3d visualization
java programming
cognitive tools
reuse
humancomputer interaction


Robustified least squares support vector classification Support vector machine (SVM) algorithms are a popular class of techniques to perform classification. However, outliers in the data can result in bad global misclassification percentages. In this paper, we propose a method to identify such outliers in the SVM framework. A specific robust classification algorithm is proposed adjusting the least squares SVM (LS-SVM). This yields better classification performance for heavily tailed data and data containing outliers. Copyright (C) 2009 John Wiley & Sons, Ltd.

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

robustness
least squares support vector machines
reweighting


Examples, counterexamples, and measuring fuzzy associations This paper examines the measurement of the degree to which tuples in a database support a relation among attributes based on a comparison of the number of examples and counterexamples of the relation. In particular, we are concerned with associations that represent imprecise constraints placed upon the value of one attribute by those of other attributes. Associations of this form may be described by fuzzy rules and the analysis requires an assessment of the degree to which a tuple satisfies the imprecise constraint specified by the rule. Standard measures of rule validity are extended to fuzzy associations based on the degree that the tuples are examples, counterexamples, or irrelevant to imprecise relations. A scaling of the relevance of a tuple is proposed to minimize the impact of the accumulation of small membership values on the confidence-based validity measures. (C) 2004 Published by Elsevier B.V.

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


A matheuristic for the truck and trailer routing problem ? Simple and effective two-phase matheuristic for the truck and trailer routing problem. Set-partitioning formulation of the truck and trailer routing problem. Hybrid GRASPILS fills a pool of columns for the set-partitioning formulation. Set-partitioning phase finds improved solutions in short time. The matheuristic outperforms previous state-of-the-art methods.

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

truck and trailer routing problem (ttrp)

greedy randomized adaptive search procedure (grasp)


A highly accurate technique for the treatment of flow equations at the polar axis in cylindrical coordinates using series expansions Numerical methods for solving the flow equations in cylindrical or spherical coordinates should be able to capture the behavior of the exact solution near the regions where the particular form of the governing equations is singular. In this work we focus on the treatment of these numerical singularities for finite-difference methods by reinterpreting the regularity conditions developed in the context of pseudo-spectral methods. A generally applicable numerical method for treating the singularities present at the polar axis, when nonaxisymmetric flows are solved in cylindrical coordinates using highly accurate finite-difference schemes (e.g., Pade schemes) on nonstaggered grids, is presented. Governing equations for the flow at the polar axis are derived using series expansions near r = 0. The only information needed to calculate the coefficients in these equations are the values of the flow variables and their radial derivatives at the previous iteration (or time) level. These derivatives, which are multivalued at the polar axis, are calculated without dropping the accuracy of the numerical method using a mapping of the flow domain from (0, R) * (0, 2pi) to (-R, R) * (0, pi), where R is the radius of the computational domain. This allows the radial derivatives to be evaluated using high-order differencing schemes (e.g., compact schemes) at points located on the polar axis. The accuracy of the method is checked by comparison with the theoretical solution corresponding to a circular compressible forced jet in the regime of linear growth. The proposed technique is illustrated by results from simulations of laminar-forced jets and turbulent compressible jets using large eddy simulation (LES) methods. In terms of the general robustness of the numerical method and smoothness of the solution close to the polar axis, the present results compare very favorably to similar calculations in which the equations are solved in Cartesian coordinates at the polar axis, or in which the singularity is removed by employing a staggered mesh in the radial direction without a mesh point at r = 0, following the method proposed recently by Mohseni and Colonius [1]. Extension of the method described here for incompressible flows or for any other set of equations that is solved on a nonstaggered mesh in cylindrical or spherical coordinates with finite-difference schemes of various levels of accuracy is immediate. (C) 2002 Elsevier Science (USA).

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

coordinate system singularity
turbulence
large eddy simulation method
cylindrical system
collocated grids
finite differences method


Guiding Lyee user requirements capture The paper deals with the modelling of Lyee user requirements and guidelines to support their capture. The paper presents a 2-layer meta-model relating the set of concepts to capture user requirements to the set of concepts for the formulation of software requirements that are the input of the LyeeALL generation mechanism. It exemplifies the former with examples and introduces the guidance support for capturing these user centric requirements.

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

meta-modelling
requirements model
re pattern


the role of lazy evaluation in amortized data structures Traditional techniques for designing and analyzing amortized data structures in an imperative setting are of limited use in a functional setting because they apply only to single-threaded data structures, yet functional data structures can be non-single-threaded. In earlier work, we showed how lazy evaluation supports functional amortized data structures and described a technique (the banker's method) for analyzing such data structures. In this paper, we present a new analysis technique (the physicist's method) and show how one can sometimes derive a worst-case data structure from an amortized data structure by appropriately scheduling the premature execution of delayed components. We use these techniques to develop new implementations of FIFO queues and binomial queues.

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

role
scheduling
method
use
paper
evaluation
analysis
functional
data structures


Incremental modifications of segmented image defined by discrete maps The data structure used to encode an image partition is of critical importance for most of region-based segmentation algorithms. Usual data structures are often convenient to extract only few parameters from the partition while inducing complex processing to compute others. Moreover, the split and merge operations allowed by such data structure are often restricted. A new model (Braquelaire and Brun, 1998) based on discrete maps allows segmentation algorithms to perform unrestricted split and merge operations and extract a wide range of parameters from a partition. In this paper we describe the two basic primitives used by segmentation algorithms to modify a partition: the segment insertion and segment suppression.

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

image segmentation
combinatorial maps
discrete geometry


Bayesian estimation of random effects models for multivariate responses of mixed data A random effects model is presented to estimate multivariate data of mixed data types. Such data typically appear in studies where different response variables are measured repeatedly for one subject. It is possible to relate normal, binary, multinomial and count data by our joint model. Further flexibility with respect to model specification is obtained by including modern variable selection techniques. Auxiliary mixture sampling leads to a Gibbs sampling type scheme which is easy to implement since no additional tuning is needed. The method is illustrated by transaction data of a costumer cohort acquired by an apparel retailer. (C) 2009 Elsevier B.V. All rights reserved.

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

auxiliary mixture sampling
random effects model
variable selection


Real-time data report and task execution in wireless sensor and actuator networks using self-aware mobile actuators Wireless sensor and actuator networks (WSANs) are composed of a large number of heterogeneous sensors and actuators that enable to make reactions toward the physical information sensed. Reactive WSANs are widely used in a range of applications, and some of them are used in delay-sensitive surveillance systems. Compared to sensors, actuators have more capabilities, which can move with self-awareness and then help to fulfill reaction tasks according to application requirements. By taking advantage of mobile actuators, we present a novel framework of real-time data report and task execution (RTRE) for automated WSANs in this paper. The real-time sensor-actuator data collection is achieved through coordination among sensors and mobile actuators. The real-time task execution is achieved through multiactuator coordination with priority-based multi-event task assignment. The schemes provide energy efficiency with timely reactions. Simulation results are shown to demonstrate the advantage of RTRE when compared with the other related work in terms of timeliness and energy efficiency. (C) 2012 Elsevier B.V. All rights reserved.

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

wireless sensor and actuator networks
data report
task execution