Robust flow shop scheduling with random processing times for reduction of peak power consumption Recently, power shortages have become a major problem all over Japan, due to the Great East Japan Earthquake, which resulted in the shutdown of a nuclear power plant. As a consequence, production scheduling has become a problem for factories, due to considerations of the availability of electric power. For factories, the contract with the electric power company sets the maximum power demand for a unit period, and in order to minimize this, it is necessary to consider the peak power when scheduling production. There are conventional studies on flowshop scheduling with consideration of peak power. However, these studies did not consider fluctuations in the processing time. Because the actual processing time is not constant, there is an increase in the probability of simultaneous operations with multiple machines. If the probability of simultaneous operations is high, the probability of increasing the peak power is high. Thus, we consider inserting idle time (delay in inputting parts) into the schedule in order to reduce the likelihood of simultaneous operations. We consider a robust schedule that limits the peak power, in spite of an unexpected fluctuation in the processing time. However, when we insert idle time, the makespan gets longer, and the production efficiency decreases. Therefore, we performed simulations to investigate the optimal amount of idle time and the best point for inserting it. We propose a more robust production scheduling model that considers random processing times and the peak power consumption. The results of experiments show that the effectiveness of the schedule produced by the proposed method is superior to the initial schedule and to a schedule produced by another method. Thus, the use of random processing times can limit the peak power.

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


Reliable H filtering for LPV systems with sensor faults in finite frequency domain This article deals with the reliable H filtering problem for linear parameter varying continuous-time systems with bounded disturbances and sensor faults. Different from existing approaches, a parameter-dependent filter is designed in finite frequency range, which is important in practice since full frequency approaches are conservative to some extent for the case when frequency ranges of disturbances are known beforehand. With the aid of Generalised Kalman-Yakubovich-Popov lemma, the filter design problem is formulated into solving a set of linear matrix inequalities problem. A numerical example is given to illustrate the effectiveness of the proposed methods.

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


A memetic NSGA-II for the bi-objective mixed capacitated general routing problem The mixed capacitated general routing problem (MCGRP) is concerned with the determination of the optimal vehicle routes to service a set of customers located at nodes and along edges or arcs on a mixed weighted graph representing a complete transportation network. Although MCGRP generalizes many other routing problems and yields better models for several practical problems such as newspaper delivery and urban waste collection, this is still an underinvestigated problem. Furthermore, most of the studies have focused on the optimization of just one objective, that is, cost minimization. Keeping in mind the requirement of industries nowadays, MCGRP has been addressed in this paper to concurrently optimize two crucial objectives, namely, minimization of routing cost and route imbalance. To solve this bi-objective form of MCGRP, a multi-objective evolutionary algorithm (MOEA), coined as Memetic NSGA-II, has been designed. It is a hybrid of non-dominated sorting genetic algorithm-II (NSGA-II), a dominance based local search procedure (DBLSP), and a clone management principle (CMP). The DBLSP and CMP have been incorporated into the framework of NSGA-II with a view to empowering its capability to converge at/or near the true Pareto front and boosting diversity among the trade-off solutions, respectively. In addition, the algorithm also contains a set of three well-known crossover operators (X-set) that are employed to explore different parts of the search space. The algorithm was tested on a standard benchmark of twenty three standard MCGRP instances of varying complexity. The computational experiments verify the effectiveness of Memetic NSGA-II and also show the energetic effects of using DBLSP, CMP and X-set together while finding the set of potentially Pareto optimal solutions.

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

mcgrp
dominance based local search
clone management principle

bi-objective
memetic algorithm
nsga-ii
x-set


Algebraic multigrid by smoothed aggregation for second and fourth order elliptic problems An algebraic multigrid algorithm for symmetric, positive definite linear systems is developed based on the concept of prolongation by smoothed aggregation. Coarse levels are generated automatically. We present a set of requirements motivated heuristically by a convergence theory. The algorithm then attempts to satisfy the requirements. Input to the method are the coefficient matrix and zero energy modes, which art: determined from nodal coordinates and knowledge of the differential equation. Efficiency of the resulting algorithm is demonstrated by computational results on real world problems from solid elasticity, plate bending, and shells.

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

unstructured meshes
automatic coarsening
biharmonic equation
plates and shells


Detecting change-points in multidimensional stochastic processes A general test statistic for detecting change-points in multidimensional stochastic processes with unknown parameters is proposed. The test statistic is specialized to the case of detecting changes in sequences of covariance matrices. Large-sample distributional results are presented for the test statistic under the null hypothesis of no-change. The finite-sample properties of the test statistic are compared with two other test statistics proposed in the literature. Using a binary segmentation procedure, the potential of the various test statistics is investigated in a multidimensional setting both via simulations and the analysis of a real life example. In general, all test statistics become more effective as the dimension increases, avoiding the determination of too many incorrect change-point locations in a one-dimensional setting.

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

cramrvon mises
cumulative sum
likelihood ratio


Camera handoff with adaptive resource management for multi-camera multi-object tracking Camera handoff is a crucial step to obtain a continuously tracked and consistently labeled trajectory of the object of interest in multi-camera surveillance systems. Most existing camera handoff algorithms concentrate on data association, namely consistent labeling, where images of the same object are identified across different cameras. However, there exist many unsolved questions in developing an efficient camera handoff algorithm. In this paper, we first design a trackability measure to quantitatively evaluate the effectiveness of object tracking so that camera handoff can be triggered timely and the camera to which the object of interest is transferred can be selected optimally. Three components are considered: resolution, distance to the edge of the cameras field of view (FOV), and occlusion. In addition, most existing real-time object tracking systems see a decrease in the frame rate as the number of tracked objects increases. To address this issue, our handoff algorithm employs an adaptive resource management mechanism to dynamically allocate cameras resources to multiple objects with different priorities so that the required minimum frame rate is maintained. Experimental results illustrate that the proposed camera handoff algorithm can achieve a substantially improved overall tracking rate by 20% in comparison with the algorithm presented by Khan and Shah.

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

multi-camera multi-object tracking
surveillance system


Design, Analysis and Evaluation of A New Energy Conserving MAC Protocol for Wireless Sensor Networks Low power listening (LPL) MAC protocols based on duty-cycling mechanism have been studied extensively to achieve ultra low energy consumption in wireless sensor networks (WSNs). Especially, recent ACK-based LPL schemes such as X-MAC employ strobe preambles and an early ACK, and show fair performances in communications and energy efficiencies. However, the state-of-the-art ACK-based LPL scheme still suffers from collision problems due to the protocol incompleteness. These collision effects are not trivial and make WSNs unstable, aggravate energy consumptions. In this paper, we propose two novel schemes; (i) tau-duration CCA to mitigate the collision problem in ACK-based LPL MAC protocols. (ii) Short Preamble Counter (SPC) to conserve more energy by reducing unnecessary overhearing. We demonstrate the performance improvement of our scheme via a mathematical analysis and real-time experiments. Both analysis and experimental results confirm that our proposed scheme saves energy by up to 36% compared to the naive ACK-based LPL MAC protocol thanks to. -duration CCA and SPC.

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


Qualitative part-based models in content-based image retrieval A qualitative, volumetric part-based model is proposed to improve the categorical invariance and viewpoint invariance in content-based image retrieval, and a novel two-step part-categorization method is presented to build it. The method consists first in transforming parts extracted from a segmented contour primitive map and then categorizing the transformed parts using interpretation rules. The first step allows noisy extracted parts to be transformed to the domain of a simple classifier. The second step computes features of the transformed parts for categorization. Content-based image retrieval experiments using real images of complex multi-part objects confirm that a model built from the categorized parts improves both the categorical invariance and the viewpoint invariance. It does so by directly addressing the fundamental limits of low-level models.

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

part-based model
qualitative volumetric primitives
shape categorization


Response Rates and Data Quality in Web and Mail Surveys Administered to PhD Holders Despite the extensive use of web surveys today, there are certain methodological factors related to participant cooperation and data quality, which remain unclear and require further study. Here, the authors compare responses to a survey administered in two formats-electronic or by post-in terms of overall response rate and the quality of the data collected. Web and mail questionnaires were sent to a sample of 572 PhD holders, asking them about aspects related to their academic career and personal and family data to investigate the factors that determine scientific productivity. The web questionnaire elicited a significantly higher response rate than the mail questionnaire. Response rates did not differ between males and females; however, topic salience had an effect on the response rate. Finally, data quality was higher in web surveys than in the mail surveys, with fewer overall errors, fewer missing items, and longer responses in open-ended questions.

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


Optimal exponential synchronization of general chaotic delayed neural networks: An LMI approach ? This paper investigates the optimal exponential synchronization problem of general chaotic neural networks with or without time delays by virtue of LyapunovKrasovskii stability theory and the linear matrix inequality (LMI) technique. This general model, which is the interconnection of a linear delayed dynamic system and a bounded static nonlinear operator, covers several well-known neural networks, such as Hopfield neural networks, cellular neural networks (CNNs), bidirectional associative memory (BAM) networks, and recurrent multilayer perceptrons (RMLPs) with or without delays. Using the driveresponse concept, time-delay feedback controllers are designed to synchronize two identical chaotic neural networks as quickly as possible. The control design equations are shown to be a generalized eigenvalue problem (GEVP) which can be easily solved by various convex optimization algorithms to determine the optimal control law and the optimal exponential synchronization rate. Detailed comparisons with existing results are made and numerical simulations are carried out to demonstrate the effectiveness of the established synchronization laws.

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

exponential synchronization
optimal control
linear matrix inequality

driveresponse conception
lyapunovkrasovskii functional
generalized eigenvalue problem (gevp)
chaotic neural network
time-delay feedback control


A fuzzy closeness approach to fuzzy multi-attribute decision making The aim of this paper is to develop a newfuzzy closeness (FC) methodology for multi-attribute decision making (MADM) in fuzzy environments, which is an important research field in decision science and operations research. The TOPSIS method based on an aggregating function representing "closeness to the ideal solution" is one of the well-known MADM methods. However, while the highest ranked alternative by the TOPSIS method is the best in terms of its ranking index, this does not mean that it is always the closest to the ideal solution. Furthermore, the TOPSIS method presumes crisp data while fuzziness is inherent in decision data and decision making processes, so that fuzzy ratings using linguistic variables are better suited for assessing decision alternatives. In this paper, a new FC method for MADM under fuzzy environments is developed by introducing a multi-attribute ranking index based on the particular measure of closeness to the ideal solution, which is developed from the fuzzy weighted Minkowski distance used as an aggregating function in a compromise programming method. The FC method of compromise ranking determines a compromise solution, providing a maximum "group utility" for the "majority" and a minimum individual regret for the "opponent". A real example of a personnel selection problem is examined to demonstrate the implementation process of the method proposed in this paper.

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

decision analysis
fuzzy closeness method
linguistic variable
fuzzy set


A new class of central compact schemes with spectral-like resolution II: Hybrid weighted nonlinear schemes In this paper, we develop a class of nonlinear compact schemes based on our previous linear central compact schemes with spectral-like resolution (X. Liu et al., 2013 [20]). In our approach, we compute the flux derivatives on the cell-nodes by the physical fluxes on the cell nodes and numerical fluxes on the cell centers. To acquire the numerical fluxes on the cell centers, we perform a weighted hybrid interpolation of an upwind interpolation and a central interpolation. Through systematic analysis and numerical tests, we show that our nonlinear compact scheme has high order, high resolution and low dissipation, and has the same ability to capture strong discontinuities as regular weighted essentially non-oscillatory (WENO) schemes. It is a good choice for the simulation of multiscale problems with shock waves.

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

compact scheme
high resolution
low dissipation


A novel elevator group control algorithm based on binocular-cameras corridor passenger detection and tracking The conventional elevator arrives at the floor in response to the user request and where is to dispatch an elevator car. There is one big problem that when system dispatches the elevator to the button responding floor, but corridor passenger is no there. In this paper, we present a novel elevator group control algorithm based on binocular-cameras corridor passenger detection and tracking, aiming to overcome the difficulty in the conventional elevator group control system. In the above proposed system, the corridor passengers are detected using Haar-like features based on binocular-cameras, and Unscented Kalman Filter (UKF) is introduced to improve robustness and accuracy of corridor passenger motion tracking. A new elevator group control strategy based on corridor passenger detection and tracking is proposed to improve the performance and transport efficiency of the elevator service. Compared with the traditional elevator group control system, the proposed system has potential advantages in minimizing passengers waiting time and saving electronic energy. The final experimental results show the validity of our method under simulation and realistic condition.

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

binocular-cameras
haar-like features
unscented kalman filter (ukf)


System integration of high voltage electrostatic MEMS actuators A system integration for High Voltage (HV) electrostatic MicroElectroMechanical Systems (MEMS) actuators is introduced on a micro-Printed Circuit Board. The system includes a programmable microcontroller, a programmable DC/DC converter, a multi output HV interface and electrostatic MEMS actuators. The system produces high output voltages (10-300 V) and can control a large variety of MEMS capacitive loads (1 to 50 pF) by combining diverse semiconductor technologies. This system proves that technologies, such as low voltage CMOS of different processes, high voltage DMOS and MEMS, can interact, communicate and even be integrated as a System In Package (SIP), providing significant size and cost reductions. The system was programmed to control electrostatic MEMS actuator. The DC/DC converter was made from components of different technologies and two addressable high voltage CMOS interfaces were fabricated with DALSA's 0.8 mu m High Voltage process. A prototype of the global system has been built and tested.

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

system integration
high voltage cmos
mems


A formal framework to integrate express data models in an extended enterprise context The paper describes a formal framework to integrate EXPRESS models and facilitate sharing and exchanging of data in an Extended Enterprise context. We perceive in the creation of an Extended Enterprise an opportunity to use standardized data models. Hence our research is based on three important ISO standards whose primary objective is to enhance data exchange. These standards are ISO 10303, ISO 15531 and ISO 13584, known as STEP, MANDATE and PLIB, respectively. Although they are intended to overcome incompatibility problems for the computer-based applications that are used during the product life-cycle, they turned out to be semantically incompatible among themselves. This seems to be a major drawback when individual organizations want to share core competences, such as resources, manufacturing processes, or product design, to create an Extended Enterprise. The constructs we propose harmonize incompatible model components so that core competences can be transparent to the net of enterprises. The proposal is exemplified by creating a mediator application and a repository. The mediator application is used by individual firms to gain access to the core abilities that are shared, whereas the repository is a neutral means to store such competences. It complies with part 21 of the ISO 10303 standard. The proposed formal framework provides a sound model of the information system and facilitates data sharing in the Extended Enterprise.

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

step
express models
extended enterprise
formal framework

mandate and plib standards
data sharing and exchanging


Toward an engineering discipline for grammarware Grammarware comprises grammars and all grammar-dependent software. The term grammar is meant here in the sense of all established grammar formalisms and grammar notations including context-free grammars, class dictionaries, and XML schemas as well as some forms of tree and graph gram mars. The term grammar-dependent software refers to all software that involves grammar knowledge in an essential manner. Archetypal examples of grammar-dependent software are parsers, program converters, and XML document processors. Despite the pervasive role of grammars in software systems, the engineering aspects of grammarware are insufficiently understood. We lay out an agenda that is meant to promote research on increasing the productivity of grammarware development and on improving the quality of grammarware. To this end, we identify the problems with the current,grammarware practices, the barriers that currently hamper research, and the promises of an engineering discipline for grammarware, its principles, and the research challenges that have to be addressed.

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

languages
grammar-dependent software
automated software engineering
best practices
software transformation
language processing
generic language technology
model-driven development
metamodeling
software evolution


Positron emission tomography for measurement of copper fluxes in live organisms Copper is an essential nutrient for the physiology of live organisms, but excessive copper can be harmful. Copper radioisotopes are used for measurement of copper fluxes in live organisms using a radioactivity assay of body fluids or whole-body positron emission tomography (PET). Hybrid positron emission tomographycomputed tomography (PET/CT) is a versatile tool for real-time measurement of copper fluxes combining the high sensitivity and quantification capability of PET and the superior spatial resolution of CT for anatomic localization of radioactive tracer activity. Kinetic analysis of copper metabolism in the liver and extrahepatic tissues of Atp7b?/? knockout mice, a mouse model of Wilson's disease, demonstrated the feasibility of measuring copper fluxes in live organisms with PET/CT using copper-64 chloride (64CuCl2) as a radioactive tracer (64CuCl2-PET/CT). 64CuCl2-PET/CT holds potential as a useful tool for the diagnosis of inherited and acquired human copper metabolism disorders and for monitoring the effects of copper-modulating therapy.

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

copper metabolism
positron emission tomography

wilson's disease
menkes disease
pet/ct
copper-64 chloride


Computing derivatives in interval type-2 fuzzy logic systems This paper makes type-2 fuzzy logic systems much more accessible to fuzzy logic system designers, because it provides mathematical formulas and computational flowcharts for computing the derivatives that are needed to implement steepest-descent parameter tuning algorithms for such systems. It, explains why computing such derivatives is much more challenging than it is for a type-1 fuzzy logic system. It provides derivative calculations that are applicable to any kind of type-2 membership functions, since the calculations are performed without prespecifying the nature of those membership functions. Some calculations are then illustrated for specific type-2 membership functions.

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


An optimization-based heuristic for the Multi-objective Undirected Capacitated Arc Routing Problem ? The Multi-objective Undirected Capacitated Arc Routing Problem (MUCARP) is the optimization problem aimed at finding the best strategy for servicing a subset of clients localized along the links of a logistic network, by using a fleet of vehicles and optimizing more than one objective. In general, the first goal consists in minimizing the total transportation cost, and in this case the problem brings back to the well-known Undirected Capacitated Arc Routing Problem (UCARP). The motivation behind the study of the MUCARP lies in the study of real situations where companies working in the logistic distribution field deal with complex operational strategies, in which different actors (trucks, drivers, customers) have to be allocated within an unified framework by taking into account opposite needs and different employment contracts. All the previous considerations lead to the MUCARP as a benchmark optimization problem for modeling practical situations. In this paper, the MUCARP is heuristically tackled. In particular, three competitive objectives are minimized at the same time: the total transportation cost, the longest route cost (makespan) and the number of vehicles (i.e., the total number of routes). An approximation of the optimal Pareto front is determined through an optimization-based heuristic procedure, whose performances are tested and analyzed on classical benchmark instances.

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


BPMN MUSIM: Approach to improve the domain expert's efficiency in business processes modeling for the generation of specific software applications Despite the evolution computer science has undergone during the last years, the time consumed by the application development process has not experienced mayor changes. One of the areas where improvements could be made is the requirement engineering process, where the features offered by business process modeling (BPM) could favor the implication of the domain experts. BPMN, the standard notation, is one of the most widely used modeling languages, used by a great number of organizations around the world. Its versatility enables it to be used for any kind of business process, regardless of the domain the problem addresses. However, non-technical domain experts find difficulties when dealing with business process modeling notations, so their participation in this task remains minor. BPMN MUSIM is a simplified business process modeling notation that intends to: lower the difficulty domain experts have for learning and understanding other notations, enable quick modeling of the business processes and use the models to generate specific software applications. (C) 2013 Elsevier Ltd. All rights reserved.

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

domain experts systems
modeling tools
software generation


Quantum Information Transfer Protocols: A Model and Its Numerical Simulations A general concept of quantum communication networks and sonic fundamental properties of them are discussed. In particular case of unitary dynamics based protocols some general results were formulated. A particular case of transferring pure states in spin chains, due to XY-like unitary dynamics, has been numerically explored within the ZG QCS simulator environment and some basic features of this transferring quantum data protocols has been confirmed through an explicite computations.

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

quantum information transfer
numerical simulations


software engineering across computing curricula In this paper, we address issues that are pertinent to the improvement of software engineering curricula. We submit that a key impediment to the development of new courses and curricula and the advancement of software engineering education is the lack of guidance and support for such development. In this paper we propose the creation of a set of "Guidelines for Software Education". We outline the content of such Guidelines and discuss some initial steps in defining the body of knowledge that is a foundation for the Guidelines.

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

computing curricula
software engineering


Models and solution procedures for the resource-constrained project scheduling problem with general temporal constraints and calendars We consider the RCPSP with general temporal constraints and break-calendars. A new and powerful time planning method is proposed. Three binary linear model formulations are presented. A priority-rule method and three different versions of a scatter search procedure are developed. We provide a test set and perform an extensive computational study.

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

calendars
binary linear model formulations
scatter search

resource-constrained project scheduling problem (rcpsp)


A Distributed Address Configuration Scheme for a MANET This paper proposes a distributed address configuration scheme for a Mobile Ad hoc Network (MANET). The architecture for a MANET, the algorithm of constructing a MANET, and the algorithm for calculating a unique address space for the assignment are proposed. In the architecture, a common node has a unique address space for the assignment, and an isolated node can acquire a unique address from a neighboring common node without performing duplicate address detection. In this way, the address configuration task is distributed around common nodes. In this scheme, the control packets used for address configuration are exchanged within a one-hop scope, so the scalability is enhanced. This paper also presents an address recovery algorithm that can effectively retrieve the address resources released by failed nodes and the MANET merging/partitioning algorithm that can ensure a nodes address uniqueness. This paper compares the performance parameters of the proposed scheme and the existing schemes, including strong duplicate address detection and prime dynamic host configuration protocol, and the comparative results show that the address configuration cost of the proposed scheme is lower and the delay is shorter.

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

address tree
network merging
network partitioning


a simplifier based on efficient decision algorithms We describe a simplifier for use in program manipulation and verification. The simplifier finds a normal form for any expression over the language consisting of individual variables, the usual boolean connectives, the conditional function cond (denoting if-then-else), the integers (numerals), the arithmetic functions and predicates +, - and ?, the LISP constants, functions and predicates nil, car, cdr, cons and atom, the functions store and select for storing into and selecting from arrays, and uninterpreted function symbols. Individual variables range over the union of the rationals, the set of arrays, the LISP s-expressions and the booleans true and false. The constant, function and predicate symbols take their natural interpretations.The simplifier is complete; that is, it simplifies every valid formula to true. Thus it is also a decision procedure for the quantifier-free theory of rationals, arrays and s-expressions under the above functions and predicates.The organization of the simplifier is based on a method for combining decision algorithms for several theories into a single decision algorithm for a larger theory containing the original theories. More precisely, given a set S of functions and predicates over a fixed domain, a satisfiability program for S is a program which determines the satisfiability of conjunctions of literals (signed atomic formulas) whose predicates and function signs are in S. We give a general procedure for combining satisfiability programs for sets S and T into a single satisfiability program for S ? T, given certain conditions on S and T. We show how a satisfiability program for a set S can be used to write a complete simplifier for expressions containing functions and predicates of S as well as uninterpreted function symbols.The simplifier described in this paper is currently used in the Stanford Pascal Verifier.

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

use lisp theory general paper select program organization method atom satisfiability language verification manipulation algorithm

efficiency
express
normalization
writing
combinational
variability
decision procedures
interpretation
functional
completeness


situation-aware risk management in autonomous agents We present a novel approach to enable decision-making in a highly distributed multiagent environment where individual agents need to act in an autonomous fashion. Our architecture framework integrates risk management, knowledge management, and agent deliberation to enable sophisticated, autonomous decision-making. Instead of a centralized knowledge repository, our approach supports a highly distributed knowledge base in which each agent manages a fraction of the knowledge needed by the entire system.

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

logistics
decision support
intelligent agents


learning styles of information technology students This poster presents research into the learning styles of information technology students. The study reveals that, similar to the general student population, IT students exhibit a high level of preference for kinesthetic learning.

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


Application of the differential transformation method to bifurcation and chaotic analysis of an AFM probe tip The AFM (atomic force microscope) has become a popular and useful instrument for measuring intermolecular forces with atomic resolution, that can be applied in electronics, biological analysis, and studying materials, semiconductors etc. This paper conducts a systematic investigation into the bifurcation and chaotic behavior of the probe tip of an AFM using the differential transformation (DT) method. The validity of the analytical method is confirmed by comparing the DT solutions for the displacement and velocity of the probe tip at various values of the vibrational amplitude with those obtained using the RungeKutta (RK) method. The behavior of the probe tip is then characterized utilizing bifurcation diagrams, phase portraits, power spectra, Poincar maps, and maximum Lyapunov exponent plots. The results indicate that the probe tip behavior is significantly dependent on the magnitude of the vibrational amplitude. Specifically, the tip motion changes first from subharmonic to chaotic motion, then from chaotic to multi-periodic motion, and finally from multi-periodic motion to subharmonic motion with windows of chaotic behavior as the non-dimensional vibrational amplitude is increased from 1.0 to 5.0.

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

bifurcation
atomic force microscope
differential transformation


Positive invariant and global exponential attractive sets of neural networks with time-varying delays In this paper, global exponential stability in Lagrange sense is further studied for various continuous-time delayed recurrent neural network with two different types of activation functions. Based on the parameters of the systems, detailed estimation of global exponential attractive sets and positive invariant sets are presented without any hypothesis on the existence. It is also verified that outside the global exponential attracting set; i.e., within the global attraction domain, there is no equilibrium state, periodic state, almost periodic state, and chaos attractor of the neural network. These theoretical analysis narrows the search field of optimization computation, associative memories, chaos control and synchronization and provide convenience for applications.

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

positive invariant set
globally exponentially attractive set
lagrange stability


An extended finite element method for dislocations in complex geometries: Thin films and nanotubes ? Dislocation models based on the extended finite element method (XFEM) are developed for thin shells such as carbon nanotubes (CNTs) and thin films. In shells, methods for edge dislocations, which move by glide, and prismatic dislocations, which move by climb, are described. In thin films, methods for dislocations with edge, screw and/or prismatic character are developed in three dimensions. Singular enrichments are proposed which allow the PeachKoehler force to be computed directly from the stress field along the dislocation line and give improved accuracy.

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

dislocations
extended finite element method
thin films
thin shells
carbon nanotubes


Alignment-Free Sequence Comparison Based on Next-Generation Sequencing Reads Next-generation sequencing (NGS) technologies have generated enormous amounts of shotgun read data, and assembly of the reads can be challenging, especially for organisms without template sequences. We study the power of genome comparison based on shotgun read data without assembly using three alignment-free sequence comparison statistics, D-2, D-2*, and D-2(S), both theoretically and by simulations. Theoretical formulas for the power of detecting the relationship between two sequences related through a common motif model are derived. It is shown that both D-2* and D-2(S) outperform D2 for detecting the relationship between two sequences based on NGS data. We then study the effects of length of the tuple, read length, coverage, and sequencing error on the power of D-2* and D-2(S). Finally, variations of these statistics, d(2), d(2)* and d(2)(S), respectively, are used to first cluster five mammalian species with known phylogenetic relationships, and then cluster 13 tree species whose complete genome sequences are not available using NGS shotgun reads. The clustering results using d(2)(S) are consistent with biological knowledge for the 5 mammalian and 13 tree species, respectively. Thus, the statistic d(2)(S) provides a powerful alignment-free comparison tool to study the relationships among different organisms based on NGS read data without assembly.

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

hmm
normal approximation
statistical power
word count statistics


Deadline missing predictor based on aperiodic server queue length for distributed systems In this paper, a deadline missing prediction mechanism based on the aperiodic server queue length (ASQ) is presented. This mechanism uses the server queue length and the past response times of a distributed thread to define the probability of it meeting its deadline. This mechanism uses linear regression and it considers the probabilistic knowledge of the conditional paths that a distributed thread can follow when executing remote calls. Historical data hosted in the source node of a distributed thread Supply the information used by the prediction mechanism to define the probability of a distributed thread to meet its deadline. (C) 2008 Elsevier B.V. All rights reserved.

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

deadline missing prediction
distributed thread
aperiodic server


Selecting scenarios for environmental disaster planning Where an agency is aware of potential disasters, it often seeks to identify just a few potential accidents to consider in depth such that they will give maximum information about all possible accidents, without demanding an excessive budget. In this paper the disasters considered are sudden release of a catastrophic quantity of pollutant into the environment. By considering a limited number of different pollutants, dividing the environment into a finite number of zones and the year into a few time periods, a finite number of potential disasters is defined. Then from this finite set of accidents the goal is to identify just a few whose elaboration into disaster scenarios will yield information relevant to all of the potential disasters. This is achieved by solving an integer program with the objective of maximizing similarity between the few selected accidents and the total set of potential accidents. The approach is illustrated with an actual study to define a most informative scenario of a major liquid spill in an inland waterway.

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


A message-optimal distributed graph algorithm: Partial precedence constrained scheduling This paper presents a distributed algorithm for the partial precedence constrained scheduling problem. In the classical precedence constrained scheduling problem all the dependent tasks must be scheduled before the task itself can be scheduled. The partial precedence constrained scheduling problem is a generalized version of the original precedence constrained problem in the sense that the number of dependent tasks to be scheduled before the task itself can be scheduled is considered a variable. Using a directed graph to model the partial precedence constrained scheduling problem in which n nodes represent the tasks and e edges represent the precedence constraints, it is shown that the distributed algorithm requires O(e) messages and O( n) units of time and is optimal in communication complexity to within a constant factor.

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

distributed algorithm
directed graph
scheduling
task
precedence constraints


Automatic guidance for agricultural vehicles in Europe Research activities concerning automatic guidance of agricultural vehicles or implements have led to various solutions. Sensors, including mechanical ones, global navigation satellite systems (GNSS), machine vision, laser triangulation, ultrasonic and geomagnetic, generate position, attitude and direction-of-movement information to supply control algorithms. Actuators, like hydraulic valves, are used to transform guidance information into changes of position and direction. In the European Union, depending on who is funding the project, the systems range from a PC, with a frame grabber or a GNSS receiver used to guide an implement along a predefined path with speeds up to 3 m/s, to a multiprocessor bifocal road recognition system for autonomous cars driving on motorways with a speed of 130 km/h. Research projects are performed in universities, governmental institutions and manufacturers laboratories, as well as in national and international consortia. This chapter provides an overview of guidance systems for agricultural vehicles or implements in Europe, without claims to completeness.

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

automatic guidance
gnss
control
agricultural vehicles


Characterizing the evolving research on enterprise content management Innovations in network technologies in the 1990's have provided new ways to store and organize information to be shared by people and various information systems. The term Enterprise Content Management ( ECM) has been widely adopted by software product vendors and practitioners to refer to technologies used to manage the content of assets like documents, web sites, intranets, and extranets In organizational or inter-organizational contexts. Despite this practical interest ECM has received only little attention in the information systems research community. This editorial argues that ECM provides an important and complex subfield of Information Systems. It provides a framework to stimulate and guide future research, and outlines research issues specific to the field of ECM.

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

information-system
research framework
review
irm
document management


Adaptive Interleaved Sampling for Interactive High-Fidelity Rendering Recent advances have made interactive ray tracing (IRT) possible on consumer desktop machines. These advances have brought about the potential for interactive global illumination (IGI) with enhanced realism through physically based lighting. IGI, unlike IRT, has a much higher computational complexity. Furthermore, since non-primary rays constitute the majority of the computation, the rays are predominantly incoherent, making impractical many of the methods that have made IRT possible. Two methods that have already shown promise in decreasing the computational time of the GI solution are interleaved sampling and adaptive rendering. Interleaved sampling is a generalized sampling scheme that smoothly blends between regular and irregular sampling while maintaining coherence. Adaptive rendering algorithms adjust rendering quality, non-uniformally, using a guidance scheme. While adaptive rendering has shown to provide speed-up when used for off-line rendering it has not been utilized in IRT due to its naturally incoherent nature. In this paper, we combine adaptive rendering and interleaved sampling within a component-based solution into a new approach we term adaptive interleaved sampling. This allows us to tailor new adaptive heuristics for interleaved sampling of the individual components of the GI solution significantly improving overall performance. We present a novel component-based IGI framework for which we achieve interactive frame rates for a range of effects such as indirect diffuse lighting, soft shadows and single scatter homogeneous participating media.

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


Stochastic DAG scheduling using a Monte Carlo approach A systematic approach to solve the stochastic DAG scheduling problem using a Monte Carlo method. Extensive simulation results assessing the Monte Carlo approach using four real-world DAGs. Significant performance improvement can be achieved at a reasonable execution time cost.

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

directed acyclic graphs
heterogeneous computing
monte carlo methods


A note on transformations of interactive proofs that preserve the prover's complexity Goldwasser and Sipser proved that every interactive proof system can be transformed into a public-coin one (a.k.a. an Arthur-Merlin game) [25]. Unfortunately, the applicability of their transformation to cryptography is limited because it does not preserve the computational complexity of the prover's strategy. Vadhan showed that this deficiency is inherent by constructing a promise problem Pi with a private-coin interactive proof that cannot be transformed into an Arthur-Merlin game such that the new prover can be implemented in polynomial-time with oracle access to the original prover [34]. However, the transformation formulated by Vadhan has a restriction, i.e., it does not allow the new prover and verifier to look at common input. This restriction is essential for the proof of Vadhan's negative result. This paper considers an unrestricted transformation where both the new prover and verifier are allowed to access and analyze common input. We show that an analogous negative result holds even in this unrestricted case under a non-standard computational assumption.

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

interactive proof systems
arthur-merlin games
zero-knowledge
decisional diffie-hellman problem


Comprehensive control charting applied to chromatography Multivariate statistical process control (MSPC) based for example on principal component analysis (PCA) can make use of the information contained in multiple measured signals simultaneously. This can be much more powerful in detecting variations due to special causes than conventional single variable statistical process control (SPC). Furthermore, the PCA based SPC simplifies monitoring as it limits the number of control charts to typically two charts rather than one for each signal. However, the derived MSPC statistics may suffer from lack of sensitivity if only one or a few variables deviate in a given situation. In this paper we develop a new comprehensive control (COCO) chart procedure that considers both univariate statistics and multivariate statistics derived from PCA in a single plot that allows easy visualization of the combined data from a univariate and multivariate point of view. The method is exemplified using twenty analytical chromatographic peak areas obtained for purity analysis of a biopharmaceutical drug substance. The new control chart procedure detected two different types of faulty events in this study. (C) 2011 Elsevier B.V. All rights reserved.

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

multivariate statistical process control (mspc)


Sketches and computations over fields The goal of this short paper is to describe one possible use of sketches in computer algebra. We show that sketches are a powerful tool for the description of mathematical structures and for the description of computations.

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

types and algebraic structures
dynamic evaluation


Optimal workload for a multi-tasking k-out-of-n : G load sharing system In this paper the problem of determining optimal workload for a load sharing system is considered. The system is composed of total n components and it functions until (n - k + 1) components are failed. The works that should be performed by the system arrive at the system according to a homogeneous Poisson process and it is assumed that the system can perform sufficiently large number of works simultaneously. The system is subject to a workload which can be expressed in terms of the arrival rate of the work and the workload is equally shared by surviving components in the system. We assume that an increased workload induces a higher failure rate of each remaining component. The time consumed for the completion of each work is assumed to be a constant or a random quantity following an Exponential distribution. Under this model, as a measure for system performance, we derive the long-run average number of works performed per unit time and consider optimal workload which maximizes the system performance.

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

load sharing system
optimal workload
homogeneous poisson process


ADMiRA: Atomic Decomposition for Minimum Rank Approximation In this paper, we address compressed sensing of a low-rank matrix posing the inverse problem as an approximation problem with a specified target rank of the solution. A simple search over the target rank then provides the minimum rank solution satisfying a prescribed data approximation bound. We propose an atomic decomposition providing an analogy between parsimonious representations of a sparse vector and a low-rank matrix and extending efficient greedy algorithms from the vector to the matrix case. In particular, we propose an efficient and guaranteed algorithm named atomic decomposition for minimum rank approximation (ADMiRA) that extends Needell and Tropp's compressive sampling matching pursuit (CoSaMP) algorithm from the sparse vector to the low-rank matrix case. The performance guarantee is given in terms of the rank-restricted isometry property (R-RIP) and bounds both the number of iterations and the error in the approximate solution for the general case of noisy measurements and approximately low-rank solution. With a sparse measurement operator as in the matrix completion problem, the computation in ADMiRA is linear in the number of measurements. Numerical experiments for the matrix completion problem show that, although the R-RIP is not satisfied in this case, ADMiRA is a competitive algorithm for matrix completion.

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

compressed sensing
matrix completion
performance guarantee

rank minimization
singular value decomposition (svd)


Commentary: Real education Surprise! In the "real world," equipments fail. Rather than let this happen in the field, let's find weaknesses in the lab, ideally as part of development.

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


An adaptive visual attentive tracker with HMM-Based TD learning capability for human intended behavior In the study, we build a system called Adaptive Visual Attentive Tracker (AVAT) for the purpose of developing a non-verbal communication channel between the system and an operator who presents intended movements. In the system, we constructed an HMM (Hidden Markov Models)-based TD (Temporal Difference) learning algorithm to track and zoom in on an operator's behavioral sequence which represents his/her intention. AVAT extracts human intended movements from ordinary walking behavior based on the following two algorithms: the first is to model the movements of human body parts using HMMs algorithm, and the second is to learn the model of the tracker's action rising a model-based TD learning algorithm. In the paper, we describe the integrated algorithm of the above two methods: whose linkage is established by assigning the state transition probability in HMM as a reward in TD learning. Experimental results of extracting an operator's hand sign action sequence during her natural walking motion are shown which demonstrates the function of AVAT as it is developed within the framework of perceptual organization. Identification of the sign gesture context through wavelet analysis autonomously provides a reward value for optimizing AVAT's action patterns.

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

visual attention
human intention
hidden markov models


What's up with software metrics? - A preliminary mapping study Background: Many papers are published on the topic of software metrics but it is difficult to assess the current status of metrics research. Aim: This paper aims to identify trends in influential software metrics papers and assess the possibility of using secondary studies to integrate research results. Method: Search facilities in the SCOPUS tool were used to identify the most cited papers in the years 2000-2005 inclusive. Less cited papers were also selected from 2005. The selected papers were classified according factors such as to main topic, goal and type (empirical or theoretical or mixed). Papers classified as "Evaluation studies" were assessed to investigate the extent to which results could be synthesized. Results: Compared with less cited papers, the most cited papers were more frequently journal papers, and empirical validation or data analysis studies. However, there were problems with some empirical validation studies. For example, they sometimes attempted to evaluate theoretically invalid metrics and fail to appreciate the importance of the context in which data are collected. Conclusions: This paper, together with other similar papers, confirms that there is a large body of research related to software metrics. However, software metrics researchers may need to refine their empirical methodology before they can answer useful empirical questions. (C) 2009 Elsevier Inc. All rights reserved.

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

secondary study
literature survey
influential papers
empirical evaluation problems


Placement-proximity-based voltage island grouping under performance requirement High power consumption not only leads to short battery life for hand-held devices but also causes on-chip thermal and reliability problems in general. As power consumption is proportional to the square of supply voltage, reducing supply voltage can significantly reduce power consumption. Multi-supply voltage (MSV) has previously been introduced to provide finer grain power and performance tradeoff. In this paper, we propose a methodology on top of a set of algorithms to exploit nontrivial voltage island boundaries for optimal power versus design-cost tradeoff under performance requirement. Our algorithms are efficient, robust, and error-bounded and can be flexibly tuned to optimize for various design objectives (e.g., minimal power within a given number of voltage islands, or minimal fragmentation in voltage islands within a given power bound) depending on the design requirement. Our experiment on real industry designs shows a tenfold improvement of our method over current logical-boundary-based industry approach.

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


the design of human-powered access technology People with disabilities have always overcome accessibility problems by enlisting people in their community to help. The Internet has broadened the available community and made it easier to get on-demand assistance remotely. In particular, the past few years have seen the development of technology in both research and industry that uses human power to overcome technical problems too difficult to solve automatically. In this paper, we frame recent developments in human computation in the historical context of accessibility, and outline a framework for discussing new advances in human-powered access technology. Specifically, we present a set of 13 design principles for human-powered access technology motivated both by historical context and current technological developments. We then demonstrate the utility of these principles by using them to compare several existing human-powered access technologies. The power of identifying the 13 principles is that they will inspire new ways of thinking about human-powered access technologies.

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


Lossy transmission line simulation based on closed-form triangle impulse responses Analytical frequency-domain expressions for single and coupled transmission lines with triangular input waveforms are first developed. The inverse Fourier transform is then used to obtain an expression for the time-domain triangle impulse responses for frequency-independent transmission line parameters. The integral associated with the inverse Fourier transform is solved analytically using a differential-equation-based technique. Closed-form expressions for the triangle impulse responses are given in the form of incomplete Lipschitz-Hankel integrals (ILHI) of the first kind. The ILHI can be efficiently calculated using existing algorithms. Combining these closed-form expressions for the triangle impulse responses with a time-domain convolution method using a triangle impulse as a basis function, provides an accurate and efficient simulation method for very lossy transmission lines embedded within linear and nonlinear circuits.

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

closed-form triangle impulse response
frequency domain modal analysis
inverse fourier transformation
time-domain convolution
transfer functions
transmission line modeling


Formal Theory of Creativity, Fun, and Intrinsic Motivation (1990-2010) The simple, but general formal theory of fun and intrinsic motivation and creativity (1990-2010) is based on the concept of maximizing intrinsic reward for the active creation or discovery of novel, surprising patterns allowing for improved prediction or data compression. It generalizes the traditional field of active learning, and is related to old, but less formal ideas in aesthetics theory and developmental psychology. It has been argued that the theory explains many essential aspects of intelligence including autonomous development, science, art, music, and humor. This overview first describes theoretically optimal (but not necessarily practical) ways of implementing the basic computational principles on exploratory, intrinsically motivated agents or robots, encouraging them to provoke event sequences exhibiting previously unknown, but learnable algorithmic regularities. Emphasis is put on the importance of limited computational resources for online prediction and compression. Discrete and continuous time formulations are given. Previous practical, but nonoptimal implementations (1991, 1995, and 1997-2002) are reviewed, as well as several recent variants by others (2005-2010). A simplified typology addresses current confusion concerning the precise nature of intrinsic motivation.

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

active learning
aesthetics theory
art
developmental psychology
formal theory of creativity
fun
humor
limited computational resources
music
science

attention
novel patterns
novelty
surprise
typology of intrinsic motivation


Efficient hybrid security mechanisms for heterogeneous sensor networks Many applications that make use of sensor networks require secure communication. Because asymmetric-key solutions are difficult to implement in such a resource-constrained environment, symmetric-key methods coupled with a priori key distribution schemes have been proposed to achieve the goals of data secrecy and integrity. These approaches typically assume that all nodes are similar in terms of capabilities and, hence, deploy the same number of keys in all sensors in a network to provide the aforementioned protections. In this paper, we demonstrate that a probabilistic unbalanced distribution of keys throughout the network that leverages the existence of a small percentage of more capable sensor nodes can not only provide an equal level of security, but also reduce the consequences of node compromise. To fully characterize the effects of the unbalanced key management system, we design, implement, and measure the performance of a complementary suite of key establishment protocols known as LIGER. Using their predeployed keys, nodes operating in isolation from external networks can securely and efficiently establish keys with each other. Should resources such as a backhaul link to a key distribution center (KDC) become available, networks implementing LIGER automatically incorporate and benefit from such facilities. Detailed experiments demonstrate that the unbalanced distribution in combination with the multimodal LIGER suite offers a robust and practical solution to the security needs in sensor networks.

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

probabilistic key management
probabilistic authentication
hybrid network security


Implementation of a genetic algorithm on MD-optimal designs for multivariate response surface models This study presents a genetic algorithm (GA) for identifying the exact D-optimal design for multivariate response surface models (called MD-optimal design). The MD-optimal design minimizes the volume of joint confidence regions of model parameters. The covariance between any two responses is assumed to be identical in the two examples of four responses and biresponse problems considered in this study. We have also provided an example of covariance estimation. In order to obtain the initial candidate set, we first obtain a D-optimal design for each response model by using a conventional approach: then, the set of solutions obtained from the individual model is treated as the initial set in the GA. This shows that the MD-optimal designs converge toward the same D-optimal design in a single response linear model; however, the different variance-covariance matrices attain dissimilar objective values. The GA exhibits stable representation in multiple response design problems and performs better than the US algorithm, which is generated only near the MD-optimal design. It is possible for an experimenter to set a high crossover rate except full crossover, and estimate the variance-covariance matrix in the preprocess or set it as an identity matrix in the process of the GA. Crown Copyright (C) 2011 Published by Elsevier Ltd. All rights reserved.

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

md-optimal design
multivariate response surface model


Fitness landscape of the cellular automata majority problem: View from the "Olympus" In this paper we study cellular automata (CAs) that perform the computational Majority task. This task is a good example of what the phenomenon of emergence in complex systems is. We take an interest in the reasons that make this particular fitness landscape a difficult one. The first goal is to study the landscape as such, and thus it is ideally independent from the actual heuristics used to search the space. However, a second goal is to understand the features a good search technique for this particular problem space should possess. We statistically quantify in various ways the degree of difficulty of searching this landscape. Due to neutrality, investigations based on sampling techniques on the whole landscape are difficult to conduct. So, we go exploring the landscape from the top. Although it has been proved that no CA can perform the task perfectly, several efficient CAs for this task have been found. Exploiting similarities between these CAs and symmetries in the landscape, we define the Olympus landscape which is regarded as the "heavenly home" of the best local optima known (blok). Then we measure several properties of this subspace. Although it is easier to find relevant CAs in this subspace than in the overall landscape, there are structural reasons that prevent a searcher from finding overfitted CAs in the Olympus. Finally, we study dynamics and performance of genetic algorithms on the Olympus in order to confirm our analysis and to find efficient CAs for the Majority problem with low computational cost. (c) 2007 Elsevier B.V. All rights reserved.

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

fitness landscapes
correlation analysis
ar models


Spacetime Texture Representation and Recognition Based on a Spatiotemporal Orientation Analysis This paper is concerned with the representation and recognition of the observed dynamics (i.e., excluding purely spatial appearance cues) of spacetime texture based on a spatiotemporal orientation analysis. The term "spacetime texture" is taken to refer to patterns in visual spacetime, (x, y, t), that primarily are characterized by the aggregate dynamic properties of elements or local measurements accumulated over a region of spatiotemporal support, rather than in terms of the dynamics of individual constituents. Examples include image sequences of natural processes that exhibit stochastic dynamics (e.g., fire, water, and windblown vegetation) as well as images of simpler dynamics when analyzed in terms of aggregate region properties (e.g., uniform motion of elements in imagery, such as pedestrians and vehicular traffic). Spacetime texture representation and recognition is important as it provides an early means of capturing the structure of an ensuing image stream in a meaningful fashion. Toward such ends, a novel approach to spacetime texture representation and an associated recognition method are described based on distributions (histograms) of spacetime orientation structure. Empirical evaluation on both standard and original image data sets shows the promise of the approach, including significant improvement over alternative state-of-the-art approaches in recognizing the same pattern from different viewpoints.

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

spacetime texture
stochastic dynamics
spatiotemporal orientation

image motion
dynamic texture
temporal texture
time-varying texture
textured motion
turbulent flow
distributed representation


Hybrid scheduling methods for paratransit operations We study an extension to the general routing problem, which deals with integrating fixed route service wit-h the general pickup and delivery problem to create a hybrid routing problem. The primary application for such a service is a dial-a-ride system used by transit, agencies to transport disabled or elderly individuals. The main aim of the integration is to reduce the vehicle miles of the on-demand vehicles while not significantly reducing the customer service level. Due to the combinatorial nature of the problem, we propose a heuristic algorithm that provides an approximate solution, which is computationally efficient for solving large sized problems. The proposed heuristic is tested using real data from a transit agency. (C) 2003 Elsevier Science Ltd. All rights reserved.

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


An optimal hierarchical clustering algorithm for gene expression data Microarrays are used for measuring expression levels of thousands of genes simultaneously. Clustering algorithms are used on gene expression data to find co-regulated genes. An often used clustering strategy is the Pearson correlation coefficient based hierarchical clustering algorithm presented in [Proc. Nat. Acad. Sci. 95 (25) (1998) 14863-14868], which takes O(N-3) time. We note that this run time can be reduced to O(N-2) by applying known hierarchical clustering algorithms [Proc. 9th Annual ACM-SIAM Symposium on Discrete Algorithms, 1998, pp. 619-628] to this problem. In this paper. we present an algorithm which runs in O(N log N) time using a geometrical reduction and show that it is optimal. (C) 2004 Elsevier B.V. All rights reserved.

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

algorithms
gene expression
hierarchical clustering
microarrays


Stopping criteria for statistical testing The decision to stop testing can be based on a number of criteria, such as (1) the confidence in a reliability estimate; (2) the degree to which testing experience has converged to the expected use of the software; and (3) model coverage criteria based on a degree of state, arc, or path coverage during crafted and random testing. In practice it is best to use multiple stopping criteria. For example, further evaluation of the testing performed is needed if the measure of correspondence between testing experience and expected use of the software indicates that the testing experience closely matches the expected use of the software, yet the variance of the reliability estimate is unacceptably large. One test of equality of testing experience and expected use is the Kullback discriminant from the usage chain to the testing chain. A new measure of approximate equality is introduced here for use in conjunction with the Kullback discriminant.

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

stopping criteria
statistical testing
kullback discriminant


Graph-theoretical properties of parallelism in the digital plane We propose different graph-theoretical algorithms to partition a set of digitized lines into parallel groups, i.e., subsets in which each line is parallel to the other lines in the subset. The slope of a digitized line is not a fixed real number, but is represented by an interval. Likewise, the parallel relations of a collection of lines are represented by an interval graph. The extraction of parallel groups is then equivalent to the detection of cliques in the interval graph. We also consider other partitioning methods, for example, methods based on minimum dominating sets, and on simplicial elimination orderings. In addition, we compute the number of ways in which we can divide a set into parallel groups.

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

digital parallelism
perceptual grouping
interval graphs
digital geometry


A cell-based smoothed radial point interpolation method (CS-RPIM) for heat transfer analysis A cell-based smoothed radial point interpolation method (CS-RPIM) is further extended to solve 2D and 3D heat transfer problems. For this method, the problem domain is first discretized using triangular elements or tetrahedral elements, and each element is further divided into several smoothing cells. Then, the field functions are approximated using RPIM shape functions. Finally, the CS-RPIM utilizes the smoothed Galerkin weak form to obtain the discretized system equations in these smoothing cells. Several numerical examples with different kinds of boundary conditions are investigated to verify the validity of the present method. It has been found that the CS-RPIM can achieve better accuracy and higher convergence rate, when dealing with the 2D and 3D heat transfer analysis.

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


Tomographic reconstruction using a generalized regressive discrete Fourier series When measuring three-dimensional phenomena such as flow fields or acoustic fields using an interferometric technique, one is proneto measure different angles of view to obtain a full three-dimensional representation of the phenomenon under investigation.This is due to the fact that an interferometric technique measures a line integral across the optical path. To obtain the full three-dimensional view the different angles of view are passed through a tomographic algorithm. The most widely used tomographic method is the so-called filtered back projection. However, this process suffers from a series of drawbacks, the most important one being the fact that substantial truncation errors occur in the back projection step. In this article a method is devised to eliminate these errors, based on a parametric frequency-domain approach called generalized regressive discrete Fourier series (GRDFS). The method will be applied both to simulated acoustic fields as to real acoustic fields measured using laser doppler vibrometry. The acoustic source will be rotated to obtain continuous angle views of the acoustic field, hence eliminating the tedious process of rotating the measurement setup.

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

generalized regressive discrete fourier series

scanning laser doppler vibrometer
rotating acoustic source identification


Fast mining of frequent tree structures by hashing and indexing Hierarchical semistructured data arise frequently in the Web, or in biological information processing applications. Semistructured objects describing the same type of information have similar but not identical structure. Usually they share some common schema. Finding the common schema of a collection of semistructured objects is a very important task and due to the huge amount of such data encountered, data mining techniques have been employed. In this paper, we study the problem of discovering frequently occurring structures in semistructured objects using the notion of association rules. We identify that discovering the frequent structures in the early phases of the mining procedure is the dominant cost and we provide a fast algorithm addressing this issue. We present experimental results, which demonstrate the superiority of the proposed algorithm and also its efficiency in reducing dramatically the processing cost.

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

hashing
semistructured data
association rules


borel sets and circuit complexity It is shown that for every k, polynomial-size, depth-k Boolean circuits are more powerful than polynomial-size, depth-(k?1) Boolean circuits. Connections with a problem about Borel sets and other questions are discussed.

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


combining low-leakage techniques for fpga routing design Reconfigurable architectures are well suited for wireless applications since they provide high performance computation together with the capability to adapt to changing communication protocols. Moving to 90nm technology and below, FPGAs could suffer from leakage energy consumption due to the large number of inactive transistors. We propose to combine super cut-off, body biasing and multi-threshold techniques to reduce the leakage current of programmable interconnections, which give by far the main contribution to static power dissipation. Super cut-off (gate biasing) technique is well suited for high-speed pass-transistors, while body biasing can be adopted for large buffers. On the other hand high threshold transistors can be used where delays are not critical. We show the design of SRAM cells generating the required high swing signals for gate-biased and body-biased transistors without affecting transistor reliability. Compared to a standard design the adoption of a mixed technique reduces routing leakage by more than one order of magnitude with only a 5\% increase in switch delay and a 9\% in tile area, while with respect to a full dual-threshold approach, delay is reduced by 23\%.

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


Investment under duality risk measure ? We generalize the duality index and study its properties. A portfolio selection problem under the duality index is considered. Given a reasonable benchmark, the problem is similar to a Mertons problem. It is harder to get the same surplus profit in a stable than a less-stable market.

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

duality risk measure
duality index
portfolio selection


Efficient hybrid search for visual reconstruction problems Visual reconstruction refers to extracting stable descriptions from visual data ([1]; A. Blake and A. Zisserman, Visual Reconstruction, MIT Press, Cambridge, MA, 1987). Visual reconstruction problems are commonly formulated in an optimization framework and normally require the optimization of nonconvex functions especially when discontinuity preserving image/shape recovery is the goal. Example problems include, image restoration, surface reconstruction, shape from shading etc. Most existing deterministic methods fail to reach the global optimum and lack the generality to incorporate reasonably complex interactions between boolean valued line process variables used for representing the presence (absence) of discontinuities. Stochastic methods for solving such problems e.g. the simulated annealing algorithm or variants thereof do achieve a global optimum but are plagued by slow convergence rates. In this paper, we present a new hybrid search algorithm as an efficient solution for achieving the global optimum of the nonconvex function derived from a Markov random field formulation which allows for incorporation of complex interactions between the line process variables to better constraint the line processes. In the hybrid search, for the stochastic part, we develop an informed genetic algorithm (GA) while employing an incomplete Cholesky preconditioned conjugate gradient algorithm ([23]; S.H. Lai and B.C. Vemuri, Robust and efficient algorithms for optical flow computation, in: Proceedings of the International Symposium on Computer Vision, Coral Gables, FL, 1995, pp. 455460) for the deterministic part. Our informed GA consists of a reproduction operator and an informed mutation operator. The informed mutation operator exploits specific domain knowledge in the search and is accomplished by the Gibbs sampler. Our hybrid search algorithm is highly parallelizable and leads to a globally optimal solution. The performance of our algorithm is demonstrated via experimental results on the sparse data surface reconstruction and the image restoration problem.

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

visual reconstruction
hybrid search algorithm

non-convex optimization
informed genetic alogrithm


Partial discharge pattern recognition of power cable joints using extension method with fractal feature enhancement This paper proposes a new partial discharge (PD) pattern recognition using the extension method with fractal feature enhancement. First, four common defect types of XLPE power cable joints are established, and a commercial PD detector is used to measure the PD signal by inductive sensor (L-sensor). Next, the feature parameters of fractal theory (fractal dimension and lacunarity) are extracted from the 3D PD patterns. Finally, the matter-element models of the PD defect types are built. The PD defect types can be directly identified by the degree of correlation between the tested pattern and the matter-element based on the extension method. The extension method needs representative features to define the interval of the matter-element. In order to enhance the extension performance, we add fractal features that are extracted from the PD 3D patterns. To demonstrate the effectiveness of the extension method with fractal feature enhancement, the identification ability is investigated on 120 sets of field-tested PD patterns of XLPE power cable joints. Compared with the back-propagation neural network (BPNN) method, the results show that the extension method with fractal feature enhancement not only has high recognition accuracy and good tolerance when random noise is added, but that it also provides fast recognition speed.

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

partial discharge
pattern recognition
extension method
fractal theory
neural network