Scenario-based query processing for video-surveillance archives ? Automated video surveillance has emerged as a trendy application domain in recent years, and accessing the semantic content of surveillance video has become a challenging research area. The results of a considerable amount of research dealing with automated access to video surveillance have appeared in the literature; however, significant semantic gaps in event models and content-based access to surveillance video remain. In this paper, we propose a scenario-based query-processing system for video surveillance archives. In our system, a scenario is specified as a sequence of event predicates that can be enriched with object-based low-level features and directional predicates. We introduce an inverted tracking scheme, which effectively tracks the moving objects and enables view-based addressing of the scene. Our query-processing system also supports inverse querying and view-based querying, for after-the-fact activity analysis. We propose a specific surveillance query language to express the supported query types in a scenario-based manner. We also present a visual query-specification interface devised to facilitate the query-specification process. We have conducted performance experiments to show that our query-processing technique has a high expressive power and satisfactory retrieval accuracy in video surveillance.

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

scenario-based querying and retrieval
visual query specification
event-based querying
after-the-fact analysis


An Experimental Power-Lines Model for Digital ASICs Based on Transmission Lines In this paper, we present a transmission-line-based model developed to accurately describe the power and ground-line interconnections of modern digital ASICs. The proposed model employs transmission lines as the core component to properly describe both the capacitive and inductive behavior of the metal lines. In addition, the nonlinear frequency dependence of the line resistance, due to the skin-effect, is modeled with an additional lumped model. The model is completely derived from measurement data and allows describing both in-house and third-party ASICs. High-frequency S-parameter measured data are used to benchmark the model. Finally, on-board voltage measurements of a Numonyx 64 Mbit flash memory are performed and compared with transistor-level simulations.

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


Electromechanical equipment state forecasting based on genetic algorithm - support vector regression Prediction of electromechanical equipments state nonlinear and non-stationary condition effectively is significant to forecast the lifetime of electromechanical equipments. In order to forecast electromechanical equipments state exactly, support vector regression optimized by genetic algorithm is proposed to forecast electromechanical equipments state. In the model, genetic algorithm is employed to choose the training parameters of support vector machine, and the SVR forecasting model of electromechanical equipments state with good forecasting ability is obtained. The proposed forecasting model is applied to the state forecasting for industrial smokes and gas turbine. The experimental results demonstrate that the proposed GA-SVR model provides better prediction capability. Therefore, the method is considered as a promising alternative method for forecasting electromechanical equipments state. (C) 2011 Elsevier Ltd. All rights reserved.

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

support vector machine
genetic algorithm
electromechanical equipments
prediction
industrial smokes and gas turbine


Curve evaluation and interrogation on surfaces This paper presents a coherent computational framework to efficiently, and more so robustly, evaluate, interrogate, and compute a whole variety of characteristic curves on freeform parametric rational surfaces represented as (piecewise) polynomial or rational functions. These characteristic curves are expressed as zero sets of bivariate rational functions and include silhouette curves and isoclines. from a prescribed viewing direction and/or point, reflection lines and reflection ovals, and highlight lines. This zero set formulation allows for a better treatment of singular cases while these characteristic curves are crucial for various applications, from visualization through interrogation to design and manufacturing. (C) 2001 Academic Press.

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

isoclines
highlight lines
reflection lines


BioMen: an information system to herbarium This paper presents the development of BioMen (Biological Management Executed over Network), an Internet-managed system. By using service ontologies, the user is able to perform services remotely from a web browser. The services are managed by means of a Multi-Agent System, i.e. an Input/Output system, which interacts with the web server. In addition, artificial intelligence techniques have been incorporated so that the necessary information may be obtained for the study of biodiversity. We have built a tool which will be of particular use to botanists and which can by accessed from anywhere in the world thanks to Internet technology. In this paper, we shall present the problems we encountered when building this tool and how we managed to overcome them.

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

botanist
multi-agent system
semantic web
service ontology


TCSOM: Clustering transactions using self-organizing map Self-Organizing Map (SOM) networks have been successfully applied as a clustering method to numeric datasets. However, it is not feasible to directly apply SOM for clustering transactional data. This paper proposes the Transactions Clustering using SOM (TCSOM) algorithm for clustering binary transactional data. In the TCSOM algorithm, a normalized Dot Product norm based dissimilarity measure is utilized for measuring the distance between input vector and output neuron. And a modified weight adaptation function is employed for adjusting weights of the winner and its neighbors. More importantly, TCSOM is a one-pass algorithm, which is extremely suitable for data mining applications. Experimental results on real datasets show that TCSOM algorithm is superior to those state-of-the-art transactional data clustering algorithms with respect to clustering accuracy.

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


path delay analysis for hierarchical building block layout system This paper describes a path delay analysis system which employs an accurate signal delay calculation method for MOS LSIs, taking poly resistance into account. The system takes mask patterns generated by a hierarchical building block layout system as inputs, and verifies timing margins of a large scale random logic LSI in a module-wise bottom up fashion. Path delay analysis using a critical path trace algorithm and an enumerative path trace algorithm in combination is effective in locating critical timing regions in a chip and in analyzing critical paths in the regions in detail.

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

method
analysis
delay
layout
building block
logic
account
timing
algorithm
paper

hierarchic traces systems locatability signaling region large-scale module critic randomization effect combinational pattern


Miniaturized resonant inclusions as non-bianisotropic double negative metamaterials for normal incidence Two novel resonators were devised which are amendments on commonly used S-shaped resonator and enable a great miniaturization rate. The symmetrical structure of these inclusions can avoid magnetoelectric coupling in the artificial constituents that preclude the bianisotropy. One of these metamaterials is an integration of continuous wire and an S-shaped-spiral. The other is a structure of SRRs and S-shape resonator with improved electromagnetic coupling and reduced electrical size. Both of them have wide negative refraction passband with low losses. The superior performances of these structures were investigated numerically and experimentally for only normal incidence case and tested through a proper comparison with the S-shaped resonator.

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

double negative metamaterial
miniaturized metamaterial
resonant inclusion


Evaluation of monoscopic and stereoscopic displays for visualspatial tasks in medical contexts Controlled visual experiments were used to examine performance on 3D spatial tasks. We examine the effects of stereopsis in medical spatial tasks. Stereopsis significantly effects spatial task performance in specific ranges. Color did not affect the performance of participants. Orientation of the 3D representation influenced the effect of steropsis.

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

human factors
stereoscopic applications
human computer interaction
perception


Mass classification method in mammograms using correlated association rule mining In this paper, we present an efficient computer-aided mass classification method in digitized mammograms using Association rule mining, which performs benignmalignant classification on region of interest that contains mass. One of the major mammographic characteristics for mass classification is texture. Association rule mining (ARM) exploits this important factor to classify the mass into benign or malignant. The statistical textural features used in characterizing the masses are mean, standard deviation, entropy, skewness, kurtosis and uniformity. The main aim of the method is to increase the effectiveness and efficiency of the classification process in an objective manner to reduce the numbers of false-positive of malignancies. Correlated association rule mining was proposed for classifying the marked regions into benign and malignant and 98.6% sensitivity and 97.4% specificity is achieved that is very much promising compare to the radiologists sensitivity 75%.

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

association rule mining
digitized mammograms

texture features
gray level cooccurrence matrix
the corclass algorithm


The baroclinic effect in combustion The baroclinic effect is due to the nonalignment of pressure and density gradients, and its result is to induce vorticity production. Because of the steep density gradients and the almost universal presence of ambient pressure signals in combustion systems, the baroclinic effect is a crucial mechanism for the production of turbulence. In this paper, we provide a review of the results of numerical simulations of baroclinic interactions between planar pressure signals and cylindrical laminar flame fronts. In the first section, the evolution of a flame front affected by a single baroclinic impulse is considered. In the second section, we consider the effect of a double baroclinic impulse on a growing flame ball within a shock tube and examine the effect of viscosity on the evolution of the overall burning rate.

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

reaction progress variable
favre averaging


TEDDYThe Environmental Determinants of Diabetes in the Young The aim of the TEDDY study is to identify infectious agents, dietary factors, or other environmental agents, including psychosocial factors, which may either trigger islet autoimmunity, type 1 diabetes mellitus (T1DM), or both. The study has two end point

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


Strain flexibility identification of bridges from long-gauge strain measurements It is the first time to study strain flexibility identification by processing impact test data. A novel long-gauge fiber optic sensor is proposed for macro strain measurement, which provides an excellent opportunity for strain modal identification. Numerical and experimental examples verified the effectiveness of the proposed method, and the identified strain flexibility is useful for structural safety evaluation and strain prediction in engineering practices.

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

long-gauge fiber optic sensor
distributed sensing
impact testing
structural identification


Acoustic on-line grain moisture meter A prototype of an acoustic on-line grain moisture meter was designed and developed. It consists of a funnel to produce a continuous grain stream with about 72cm3s?1 flow rate falling onto a 30 inclined sensor surface with 150mm diameter. A microphone, which is placed underneath the surface, receives sound waves generated by kernel impact and converts them to an electronic signal. The sensor was insulated to eliminate the ambient noise effects. Through the experiments the sound pressure level (SPL) variations of the impact sound were measured as output voltage and their relationship with grain moisture content was determined. In the first experiment, effects of grain drop height and types of impact surfaces (glass, wood and metal) on SPL were evaluated. Results showed that a drop height of 10cm with the glass sensor surface had the best calibration equation (R2=0.94) with the highest accuracy and sensitivity for wheat moisture measurement. In the second experiment, effects of wheat varieties (Mahooty, Karaj-3 and C-73-18) with the selected impact surface (glass) and grain drop height (10cm) on the output voltage related to SPL, were studied. Relationships between the output voltage and kernel moisture content for three wheat varieties were developed as calibration equations. The maximum instrumental error in 820% moisture content range was 1.25%.

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

acoustic sensor
sound pressure level (spl)


Algorithms for Boolean function query properties We investigate efficient algorithms for computing Boolean function properties relevant to query complexity. Such properties include, for example, deterministic, randomized, and quantum query complexities; block sensitivity; certificate complexity; and degree as a real polynomial. The algorithms compute the properties, given an n-variable function's truth table (of size N = 2(n)) as input. Our main results are the following: - O(N log(2) (3) log N) algorithms for many common properties, - an O(Nlog(2) (5) log N) algorithm for block sensitivity, - an O( N) algorithm for testing "quasi symmetry," - a notion of a " tree decomposition" of a Boolean function, proof that the decomposition is unique, and an O(N log(2) (3) log N) algorithm for finding it, - a subexponential-time approximation algorithm for space-bounded quantum query complexity. To develop this algorithm, we give a new way to search systematically through unitary matrices using finite-precision arithmetic. The algorithms discussed have been implemented in a linkable library.

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

algorithm
boolean function
truth table
query complexity


Finite element impact analysis for the design of structurally dissipating rock-shed This paper presents finite element impact analysis for the design of Structurally Dissipating Rock-shed (SDR), an innovative design of reinforced concrete rock-shed. By using an appropriate finite element impact algorithm, the SDR structure is modelled in a simplified but efficient way. The numerical results are firstly verified through comparisons with the results of the experiments recently realized by ESIGEC and TONELLO I.C. It is shown that, using this impact algorithm, it is possible to correctly predict the SDR structural behaviour under different rock-fall impact conditions. Moreover, the numerical results show that the slab centre is the critical impact location for reinforced concrete slab design. The impact analyses have thus been focused on the impacts at the slab centre for the SDR structural optimization. Several series of parametric studies have been carried out with respect to load cases and engineering parameters choices. These numerical results support the robustness of the new SDR concept, and serve to optimize SDR structure and improve its conventional engineering design, especially for ensuring the slab punching shear resistance.

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

finite element impact analysis
punching shear

structurally dissipating rock-shed
rock-fall impact
structural design
structure sensitivity study


SPH for 3D floating bodies using variable mass particle distribution A floating body with substantial heave motion is a challenging fluidstructure interaction problem for numerical simulation. In this paper we develop SPH in three dimensions to include variable particle mass distribution using an arbitrary LagrangeEulerian formulation with an embedded Riemann solver. A wedge or cone in initially still water is forced to move with a displacement equal to the surface elevation of a focused wave group. A two-dimensional wedge case is used to evaluate two forms of repulsive-force boundary condition on the body; the force depending on the normal distance from the object surface produced closer agreement with the experiment. For a three-dimensional heaving cone the comparison between SPH and experiment shows excellent agreement for the force and free surface for motion with low peak spectral frequencies while for a higher peak frequency the agreement is reasonable in terms of phase and magnitude, but a small discrepancy appears at the troughs in the motion. Capturing the entire three-dimensional flow field using an initially uniform particle distribution with sufficiently fine resolution requires an extremely large number of particles and consequently large computing resource. To mitigate this issue, we employ a variable mass distribution with fine resolution around the body. Using a refined mass distribution in a preselected area avoids the need for a dynamic particle refinement scheme and leads to a computational speedup of more than 600% or much improved results for a given number of particles. SPH with variable mass distribution is then applied to a single heaving-float wave energy converter, the Manchester Bobber', in extreme waves and compared with experiments in a wave tank. The SPH simulations are presented for two cases: a single degree-of-freedom system with motion restricted to the vertical direction and with general motion allowing six degrees-of-freedom. The motion predicted for the float with general motion is in much closer agreement with experimental data than the vertically constrained system. Using variable particle mass distribution is shown to produce close agreement with a computation time 20% of that required with a uniformly fine resolution. Copyright (c) 2012 John Wiley & Sons, Ltd.

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

variable particle mass
manchester bobber
floating bodies
heaving cone
extreme waves


On the existence of stable equilibrium points in cellular neural networks This paper presents new criteria for the existence of stable equilibrium points in the total saturation region for cellular neural networks (CNNs). It is shown that the results obtained can be used to derive some complete stability conditions for some special classes of CNNs such as positive cell-linking CNNs, opposite-sign CNNs and dominant-template CNNs. Our results are also compared with the previous results derived in the literature for the existence of stable equilibrium points for CNNs.

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

cellular neural networks
complete stability
stable equilibrium points


Knowledge integration and information technology project performance Successful product and process design depends on management's ability to integrate fragmented pockets of specialized knowledge. This integrative capability has important implications for large-scale information technology projects. This article examines the relationship between timely project completion and two dimensions of management's integrative capability: access to external knowledge and internal knowledge integration. Measures of these two dimensions are used to predict on-time project completion, where completion is a function of the duration of IT-related project delays. In a longitudinal study of 74 enterprise application integration projects in the medical sector, integrative capability was measured from the point of view of the CIO and a facility IT manager. Accounting for several project controls, our Cox regression results indicate both integrative dimensions significantly mitigate the duration of IT-related project delays, thus promoting timely project completion. The analysis also reveals the importance of taking management structure into consideration when studying IT phenomena in networked organizations.

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

it performance
mis management
knowledge management
integrative capabilities
dynamic capabilities
project delay


towards a simple service compiler Over the last 10-15 years, our industry has developed and deployed many large-scale Internet services, from e-commerce to social networking sites, all facing common challenges in performance, reliability, and scalability. To address these challenges, developers consistently draw from a relatively small repertoire of software architecture design patterns or best practices, such as replication, tiering, pre-computation, and caching. The application of these techniques across different services, however, varies significantly in both their design and implementation. There is, however, a good reason for this variation in implementation; their effectiveness depends heavily on the service's semantic requirements, its workloads, performance and other runtime and environmental characteristics. The implication is that taking advantage of today's best practices and design patterns requires that developers have a deep, end-to-end understanding of their service's functionality, workloads, and system infrastructure. Our insight is that most of this critical information is directly measurable, and, in this presentation, discuss our research towards building a system, analogous to a profile-driven optimizing compiler, that separates architectural decisions to support performance, reliability, and scalability from service functionality.

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


Nonlinear L-2-by-3 transform for PAPR reduction in OFDM systems Orthogonal frequency division multiplexing (OFDM) the multicarrier modulation technique with high bandwidth efficiency and robustness against multipath fading is used in several high speed broadband communication systems including digital video broadcasting (DVB) digital audio broadcasting (DAB) asymmetric digital subscriber line (ADSL) wireless local area network (WLAN IEEE 802 11a g) high performance radio local area network (HIPERLAN 2) and worldwide interoperability for microwave access (WiMAX IEEE 802 16) However the transmit signal in OFDM system has a high peak-to average power ratio (PAPR) one of the major drawbacks of multicarrier transmission and therefore high dynamic range is required in both the digital to analog converter (DAC) and the power amplifier (PA) for proper operation Otherwise the nonlinearities of PA cause out-of-band distortion and increase in bit error rate (BER) Therefore the reduction in PAPR in OFDM system is desirable in order to obtain power efficiency and increase BER performance In this paper a new parametric PAPR reduction technique L-2 by 3 transform from sliding norm transform (SNT) family is proposed Based on its parameter a significant PAPR reduction is obtained This paper presents the analysis of power saving and computational complexity of the proposed method L-2-by 3 and comparison to two other methods selected mapping and partial transmit sequence (C) 2010 Elsevier Ltd All rights reserved

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

wireless lan
peak to average power ratio


A simple reduction from maximum weight matching to maximum cardinality matching Let MCM(m, n) and MWM(m. n. N) be the complexities of computing a maximum cardinality matching and a maximum weight matching, and let MCMbi, MWMbi be their counterparts for bipartite graphs, where m, n, and N are the edge count, vertex count, and maximum integer edge weight. Kao, Lam, Sung, and Ting (2001) [1] gave a general reduction showing MWMbi(m, n, N) = 0(N . MCMbi(m, n)) and Huang and Kavitha (2012) [2] recently proved the analogous result for general graphs, that MWM(m. n, N) = 0(N . MCM(m,n)). We show that Gabow's MWMbi and MWM algorithms from 1983 [3] and 1985 [4] can be modified to replicate the results of Kao et al. and Huang and Kavitha, but with dramatically simpler proofs. We also show that our reduction leads to new bounds on the complexity of MWM on sparse graph classes, e.g., (bipartite) planar graphs, bounded genus graphs, and H-minor-free graphs. (C) 2012 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


Prediction of acute aquatic toxicity in Tetrahymena pyriformis - 'Eco-Derek', a knowledge-based system approach A proof-of-concept' version of a software tool for making transparent predictions of acute aquatic toxicity has been developed. It is primarily limited to semi-quantitative predictions in one species, the ciliated protozoan, Tetrahymena pyriformis. A freely available system, Eco-Derek', was derived by adapting a well-established, knowledge-based structure-activity and reasoning platform (Derek for Windows, Lhasa Limited). The Derek reasoning code was modified to express potency rather than confidence. Structure-activity relationship (SAR) development utilised a curated version of a published dataset, supplemented with the CADASTER Challenge datasets. Forty-five structural alerts were produced. The dependence on log P was examined for each alert and entered into the system as qualitative reasoning rules specifying the predicted potency as Very Low, Low, Moderate, High or Very High. Evaluation studies showed: (a) moderate accuracy for the training set but low accuracy for an external test set; (b) non-linearity in the toxicity-log P relationship for chemicals without identified structural alerts; (c) insufficient differentiation of substituent effects in some of the reactivity-based structural alerts resulting in too few chemicals predicted with Very High toxicity; and (d) the need for additional structural alerts covering polar narcosis and less common reactive or metabolically activated chemical functionality.

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

qsar
ecotoxicity prediction
knowledge base system
validation


Kernel sparse representation-based classifier ensemble for face recognition Kernel sparse representation-based classifier (KSRC) has been proposed, which has good representation and classification performance on face image data. The performance of KSRC on face image data is partly dependent on the random projection matrix when using the random projection method and the kernel Gram matrix. This paper develops the kernel sparse representation-based classifier ensemble (KSRCE), which does not require to consider the effect of random projection and kernel Gram matrix on KSRC. Actually, the random projection matrix and the kernel Gram matrix could be used for designing the diversity schemes for KSRCE. In the combination stage, we can combine the labels or the reconstruction errors of a test sample. Experimental results on three face data sets show that KSRCE is very promising.

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

sparse representation-based classifier
kernel method
ensemble learning


Quantum lower bound for recursive Fourier sampling We revisit the oft-neglected 'recursive Fourier sampling' (RFS) problem, introduced by Bernstein and Vazirani to prove an oracle separation between BPP and BQP. We show that the known quantum algorithm for RFS is essentially optimal, despite its seemingly wasteful need to uncompute information. This implies that, to place BQP outside of PH [log] relative to an oracle, one would need to go outside the RFS framework. Our proof argues that, given any variant of RFS, either the adversary method of Ambainis yields a good quantum lower bound, or else there is an efficient classical algorithm. This technique may be of independent interest.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 computing
lower bounds
query complexity


A fully digital real-time power system simulator based on PC-cluster Many benefits come with the real-time simulation of electric machinery and drives. HYPERSIM, a fully digital real-time power system simulator, originally based on large parallel supercomputer, is now adapted to a new hardware platform, in order to increase its flexibility and accessibility. This paper presents a new hardware architecture, called PC-cluster, for real-time simulation of complex power system networks, including power electronics. A PC-cluster consists of several commodity PC interconnected with high-speed network. This new hardware platform for the HYPERSIM simulator is completely based on components-off-the-shelf (COTS), such as commercial motherboard, PCI input/output (I/O) board and communication board. The general implementation of the real-time parallel simulator is introduced in this paper. All aspects of the simulation, such as communication, calculation, synchronization, I/O access and acquisition, are presented in detail. To evaluate the performance of the new hardware platform in a real simulation, a complete application of electric machine drive is presented. This new hardware technology is bringing interesting benefits to power system engineers. It is now easier to have access to powerful simulation tools, in order to perform precise and complete power system studies. (C) 2003 Published by Elsevier B.V. on behalf of IMACS.

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

power system simulator
simulation
supercomputer


Dynamic assessment of disparity vergence ramps Previous work has shown that the disparity vergence eye movement system responds to inward (i.e., convergent) ramp stimuli with both smooth and step-like behavior depending on target velocity. The responses to diverging ramp stimuli have not been previously studied, but convergence and divergence responses to other stimuli often show different behaviors. Converging and diverging 6/s ramps were presented to four subjects over a stimulus range of 220. Step-like behavior was seen in both convergence and divergence responses, but the dynamics was different. For divergent ramps, the peak velocity of each step-like movement decreased as the stimulus moved away from the subject, but no such trend was observed for convergence. The step-like behavior seen in divergence supports the hypothesis that the transient component is active in disparity divergence similar to the transient component proposed for convergent movements. However, the transient component in divergence may be dependent on stimulus position which is not the case for convergence.

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

disparity vergence
convergence
divergence

oculomotor control
eye movements
vergence dynamics


Measurement bias detection in linear dynamic systems A new method to detect the existence of biased measured variables in dynamic processes is presented. Hence, this work presents a new Dynamic Global Test (DGT) and test procedure for dynamic gross error detection (GED) that brings to light certain of its attributes which have not hitherto (to our knowledge) been presented in GED literature. Recognition of these attributes leads to a scheme that enables identification of the type of biased measurement (e.g. flow or level). This approach is not computationally intensive and is applicable in the case of process leaks and multiple biased variables. Simulation results for the identification of the type of biased measurement (e.g. flow or level) and the estimation of the time of occurrence (ETOC) are given. The performance study in this work specifically varied the size of measurement bias (delta(i)), the bias location (i), the bias true time of occurrence (TTOC), the significance level (alpha), and the sample size (N). This study shows the proposed approach to be accurate in identifying the type of biased variable and its TTOC. The performance of the proposed scheme improves as N and delta(i) increase. (C) 2002 Elsevier Science Ltd. All rights reserved.

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


Multilevel routing with jumper insertion for antenna avoidance As technology advances into nanometer territory, the antenna problem has caused significant impact on routing tools. The antenna effect is a phenomenon of plasma-induced gate oxide degradation caused by charge accumulation on conductors. It directly influences reliability, manufacturability and yield of VLSI circuits, especially in deep-submicron technology using high-density plasma. Furthermore, the continuous increase of the problem size of IC routing is also a great challenge to existing routing algorithms. In this paper, we propose a novel framework for multilevel full-chip routing with antenna avoidance using built-in jumper insertion approach. Compared with the. state-of-the-art multilevel routing, the experimental results show that our approach reduced 100% antenna-violated gates and results in fewer wirelength, vias, and delay increase. (c) 2005 Elsevier B.V. All rights reserved.

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

multilevel optimization
design for manufacturability


need for integrated quality of service and quality of protection in mobile systems Recent large scale disasters have awaken governments at home and abroad to their needs for preparedness to support homeland security and public safety. First responders of various agencies are often on the frontline to assist in managing these events to protect lives and property. The effectiveness of their mission is highly dependent on capability of mobile wireless systems available at incident scenes, especially how their mobile infrastructure and devices can handle real-time responses and protection against threads and vulnerabilities in an integrated manner. In this talk, we present challenges to achieve such integration when taking into account resource limitations in mobile systems and possible threats at incident scenes under varying Quality of Service (QoS) and Quality of Protection demands. We will amplify these challenges on three examples: (a) key management issues, (b) alert mechanisms if threats are detected, and (c) trading QoS/QoP issues when streaming multimedia data among mobile devices. In case of the cryptographic key management issues, we will examine combinatorial key solutions within the scopes of symmetric key cryptography and public key cryptography and how they fare under resource limitations and possible threats. In case of alert mechanisms we will discuss solutions such as Mobi-Herald and examine it against resource limitations and possible threats. Trading QoS/QoP algorithms for allowing streaming data will be examined, especially how well they deliver data under end-to-end delay and confidentiality demands in these resource-constrained situations.

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


Nonsmooth optimization techniques for semisupervised classification We apply nonsmooth optimization techniques to classification problems, with particular reference to the Transductive Support Vector Machine ( TSVM) approach, where the considered decision function is nonconvex and nondifferentiable, hence difficult to minimize. We present some numerical results obtained by running the proposed method on some standard test problems drawn from the binary classification literature.

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


Creating ensemble classifiers through order and incremental data selection in a stream This paper presents an original time-sensitive traffic management application for road safety diagnosis in signalized intersections. Such applications require to deal with data streams that may be subject to concept drift over various time scales. The method for road safety analysis relies on the estimation of severity indicators for vehicle interactions based on complex and noisy spatial occupancy information. An expert provides imprecise labels based on video recordings of the traffic scenes. In order to improve the performanceoverall and for each classand the stability of learning in a stream, this paper presents new ensemble methods based on incremental algorithms that rely on their sensitivity to the processing order of instances. Different data selection criteria, many used in active learning methods, are studied in a comprehensive experimental evaluation, including benchmark datasets from the UCI machine learning repository and the prediction of severity indicators. The best performance is obtained with a criterion that selects instances which are misclassified by the current hypothesis. The proposed ensemble methods using this criterion and AdaBoost have similar principles and performance, while the proposed methods have a smaller computational training cost.

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

road safety
traffic management
ensemble methods
incremental algorithms


Employing box plots to build high-dimensional manufacturing models for new products in TFT-LCD plants Electronics product life cycles are becoming shorter and shorter because of the severe global competition. In such highly competitive industry, it has become an important strategy to accelerate new products launching to the market to earn more shares. However, the lead times of pilot runs are usually long in new product development (NPD) processes, and reducing pilot runs has thus become one of the key tasks of manufacturing systems. Specifically, since the shorter a test period is the smaller sample size one can obtain, making that to find a small data learning method for a manufacturing system being a new challenge. Facing the problem, this work, based on the box plots and the fuzzy techniques, develops an approach to systematically generate synthetic samples to help stabilize the learning process for the used back-propagation neural network (BPN). A real learning task taken from the Array process of a TFT-LCD manufacturer (a new high-resolution product of 4K2K in 2013) is employed as an example to illustrate the details of the proposed method. The task contains nine inputs and 72 output manufacturing attributes, but only with 20 samples. It is quite difficult for most existing modeling algorithms to deal with such a high dimensional situation when the sample size is small. The experiment results show that the proposed approach can effectively improve the robustness and preciseness of a BPN forecasting model. In addition to the reduction of pilot runs, more process knowledge is obtained in the inputoutput analysis.

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

small dataset
synthetic sample
information diffusion


Robust reliable guaranteed cost piecewise fuzzy control for discrete-time nonlinear systems with time-varying delay and actuator failures In this paper, we investigate the delay-dependent robust reliable guaranteed cost (RRGC) fuzzy control problem for discrete-time nonlinear systems with time-varying delays. The delays may simultaneously appear in the state and in the control input. Also, both parametric uncertainties and control component failure may exist. Through Takagi-Sugeno fuzzy modelling of nonlinear delayed-systems and based on an appropriate piecewise Lyapunov-Krasovskii functional, a piecewise fuzzy controller is designed. Sufficient conditions for the existence of a RRGC controller are derived in terms of linear matrix inequalities (LMIs). Furthermore, a suboptimal RRGC fuzzy controller is given by means of a convex optimization procedure with LMI constraints which can not only guarantee the stability of the closed-loop fuzzy system, but also provides an optimized upper bound of the given cost performance despite possible actuator faults. Two numerical examples are presented in this paper to illustrate the feasibility of the theoretical developments.

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

nonlinear systems
guaranteed cost
linear matrix inequalities

time-varying delay
robust reliable control
piecewise lyapunov-krasovskii function


Optimal left and right additive Schwarz preconditioning for minimal residual methods with Euclidean and energy norms For the solution of non-symmetric or indefinite linear systems arising from discretizations of elliptic problems, two-level additive Schwarz preconditioners are known to be optimal in the sense that convergence bounds for the preconditioned problem are independent of the mesh and the number of subdomains. These bounds are based on some kind of energy norm. However, in practice, iterative methods which minimize the Euclidean norm of the residual are used, despite the fact that the usual bounds are non-optimal, i.e., the quantities appearing in the bounds may depend on the mesh size; see [X.-C. Cai, J. Zou, Some observations on the l2 convergence of the additive Schwarz preconditioned GMRES method, Numer. Linear Algebra Appl. 9 (2002) 379397]. In this paper, iterative methods are presented which minimize the same energy norm in which the optimal Schwarz bounds are derived, thus maintaining the Schwarz optimality. As a consequence, bounds for the Euclidean norm minimization are also derived, thus providing a theoretical justification for the practical use of Euclidean norm minimization methods preconditioned with additive Schwarz. Both left and right preconditioners are considered, and relations between them are derived. Numerical experiments illustrate the theoretical developments.

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

indefinite and non-symmetric elliptic problems


Unsupervised upright orientation of man-made models Most man-made models can be posed at a unique upright orientation which is consistent to human sense. However, since produced by various techniques, digital man-made models, such as polygon meshes, might be sloped far from the upright orientation. We present a novel unsupervised approach for finding the upright orientation of man-made models by using a low-rank matrix theorem based technique. We propose that projections of the models could be regarded as low-rank matrices when they have been posed at axis-aligned orientations. The models are to be iteratively rotated by using the recently presented TILT technique, in order to ensure that their projections have optimal low-rank observations. After that, the upright orientation can be easily picked up from the six axis-aligned candidate orientations by analysis on geometric properties of the model. The approach does not require any other training set of models and should be regardless of the model quality. A number of experiments will be shown to illustrate the effectiveness and robustness of the proposed approach.

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

man-made models
low-rank matrix
geometric analysis


Improving medical diagnostic accuracy of ultrasound Doppler signals by combining neural network models There are a number of different quantitative models that can be used in a medical diagnostic decision support system including parametric methods (linear discriminant analysis or logistic regression), nonparametric models (k nearest neighbor or kernel density) and several neural network models. The complexity of the diagnostic task is thought to be one of the prime determinants of model selection. Unfortunately, there is no theory available to guide model selection. This paper illustrates the use of combined neural network models to guide model selection for diagnosis of ophthalmic and internal carotid arterial disorders. The ophthalmic and internal carotid arterial Doppler signals were decomposed into timefrequency representations using discrete wavelet transform and statistical features were calculated to depict their distribution. The first-level networks were implemented for the diagnosis of ophthalmic and internal carotid arterial disorders using the statistical features as inputs. To improve diagnostic accuracy, the second-level networks were trained using the outputs of the first-level networks as input data. The combined neural network models achieved accuracy rates which were higher than that of the stand-alone neural network models.

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

medical diagnostic accuracy
discrete wavelet transform

combined neural network model
doppler signal
ophthalmic artery
internal carotid artery


Solution of relativistic quantum optics problems using clusters of graphical processing units Numerical solution of relativistic quantum optics problems requires high performance computing due to the rapid oscillations in a relativistic wavefunction. Clusters of graphical processing units are used to accelerate the computation of a time dependent relativistic wavefunction in an arbitrary external potential. The stationary states in a Coulomb potential and uniform magnetic field are determined analytically and numerically, so that they can used as initial conditions in fully time dependent calculations. Relativistic energy levels in extreme magnetic fields are recovered as a means of validation. The relativistic ionization rate is computed for an ion illuminated by a laser field near the usual barrier suppression threshold, and the ionizing wavefunction is displayed.

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


Echo state networks based predictive model of vinyl chloride monomer convention velocity optimized by artificial fish swarm algorithm Conversion rate in the Polyvinylchloride (PVC) polymerizing process has a certain influence on the molecular weight of PVC, porosity, absorption rate of plasticizer, vinyl chloride monomer (VCM) residue and thermal stability. Therefore, a predictive model based on echo state networks (ESN) method optimized by the artificial fish swarm algorithm (AFSA) is proposed to predict the conversion velocity. Firstly, the hot balancing mechanisms of polymerizer and the influenced factors of convention rate of VCM are analyzed in details. Then the auxiliary variables of the predictive model kernel are selected by using the kernel principal component analysis method for reducing the model dimensionality. Thirdly, the structure parameters of the ESN are optimized by the AFSA to realize the nonlinear mapping between input and output variables of the discussed soft-sensor model. The artificial fish swarm behaviors, such as foraging, swarming, chasing, random, are introduced in details. Finally, simulation results show that the proposed model can significantly enhance the predictive accuracy and robustness of the technical index and satisfy the real-time control requirements of PVC polymerizing production process.

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

kernel principal component analysis
artificial fish swarm algorithm


A scheduling scheme for controlling allocation of CPU resources for mobile programs There is considerable interest in developing runtime infrastructures for programs that can migrate from one host to another. Mobile programs are appealing because they support efficient utilization of network resources and extensibility of information servers. In this paper, we present a scheduling scheme for allocating resources to a mix of real-time and non real-time mobile programs. Within this framework, both mobile programs and hosts can specify constraints on how CPU should be allocated. On the basis of the constraints, the scheme constructs a scheduling graph on which it applies several scheduling algorithms. In case of conflicts between mobile program and host specified constraints, the schemes implements a policy that resolves the conflicts in favor of the host. The resulting scheduling scheme is adaptive, flexible, and enforces both program and host specified constraints.

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

distributed systems
mobile agents
resource allocation
real-time systems
denial of resource attacks


OBSIFRAC: database-supported software for 3D modeling of rock mass fragmentation Under stress, fractures in rock masses tend to form fully connected networks. The mass can thus be thought of as a 3D series of blocks produced by fragmentation processes. A numerical model has been developed that uses a relational database to describe such a mass. The model, which assumes the fractures to be plane, allows data from natural networks to test theories concerning fragmentation processes. In the model, blocks are bordered by faces that are composed of edges and vertices. A fracture can originate from a seed point, its orientation being controlled by the stress field specified by an orientation matrix. Alternatively, it can be generated from a discrete set of given orientations and positions. Both kinds of fracture can occur together in a model. From an original simple block, a given fracture produces two simple polyhedral blocks, and the original block becomes compound. Compound and simple blocks created throughout fragmentation are stored in the database. Several fragmentation processes have been studied. In one scenario, a constant proportion of blocks is fragmented at each step of the process. The resulting distribution appears to be fractal, although seed points are random in each fragmented block. In a second scenario, division affects only one random block at each stage of the process, and gives a Weibull volume distribution law. This software can be used for a large number of other applications. (C) 2002 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 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 O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O B 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 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 B O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

fracture
numerical model
block
database
fractal


Analysis of power pools in the deregulated energy market through simulation The electricity market has changed rapidly in the Northern European countries. Harmonisation of the legislation and trading methods widens the market area outside national limits. Vertical integration among electricity companies is changing the traditional structure of the inner market. Successful business in this new, more volatile market requires sophisticated techniques for identifying new market opportunities and managing the increased risks. We study the new market from the perspectives of regional distributors and power pools. We analyse the trading possibilities and profitability of different kinds of power pools, when a spot market and several new contract structures are available along with existing capacity-based long-term contracts. Different policies for allocating the common benefits of a power pool among its members are compared and a new booking algorithm for balance settlement is introduced. To analyse the operation of different kinds of pools, we use simulation and optimisation techniques.

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

deregulated energy market
optimisation
simulation


Graph rigidity, cyclic belief propagation, and point pattern matching A recent paper [1] proposed a provably optimal polynomial time method for performing near-isometric point pattern matching by means of exact probabilistic inference in a chordal graphical model. Its fundamental result is that the chordal graph in question is shown to be globally rigid, implying that exact inference provides the same matching solution as exact inference in a complete graphical model. This implies that the algorithm is optimal when there is no noise in the point patterns. In this paper, we present a new graph that is also globally rigid but has an advantage over the graph proposed in [1]: Its maximal clique size is smaller, rendering inference significantly more efficient. However, this graph is not chordal, and thus, standard Junction Tree algorithms cannot be directly applied. Nevertheless, we show that loopy belief propagation in such a graph converges to the optimal solution. This allows us to retain the optimality guarantee in the noiseless case, while substantially reducing both memory requirements and processing time. Our experimental results show that the accuracy of the proposed solution is indistinguishable from that in [1] when there is noise in the point patterns.

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

point pattern matching
belief propagation

graph matching
graphical models
global rigidity
chordal graphs


The optimal strategy for a bioeconomical model of a harvesting renewable resource problem In recent years, bioeconomics has seen fast development in different areas of natural resource modelling. In this paper, we study a bioeconomic model, where the control is the fishing effort variation rate, rather than the effort in the classical model of Clark, which can be interpreted as an investment. This consideration leads to a nonlinear problem of optimal control. We first establish a result on stability of the equilibrium point. We also obtain the optimal strategy of the model by applying the inductive method based on the verification functions. (C) 2002 Elsevier Science Ltd. All rights reserved.

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

optimal control
inductive method
optimal strategy

asymptotic stability
verification function


managing social constraints on recharge behaviour for robot companions using memory In this paper, we present an approach to monitor human activities such as entry, exit and break times of people in a workplace environment. The companion robot then learns the users' presence patterns over a period of time through memory generalisation and plans a suitable time for re charging itself causing less hindrance to human-robot interaction.

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

social constraints
robot companions
memory


An asymptotic-preserving method for highly anisotropic elliptic equations based on a Micro-Macro decomposition The concern of the present work is the introduction of a very efficient asymptotic preserving scheme for the resolution of highly anisotropic diffusion equations. The characteristic features of this scheme are the uniform convergence with respect to the anisotropy parameter 0 < epsilon << 1, the applicability (on cartesian grids) to cases of non-uniform and non-aligned anisotropy fields b and the simple extension to the case of a non-constant anisotropy intensity 1/epsilon. The mathematical approach and the numerical scheme are different from those presented in the previous work [P. Degond, F. Deluzet, A. Lozinski, J. Narski, C. Negulescu, Duality-based asymptotic-preserving method for highly anisotropic diffusion equations, Communications in Mathematical Sciences 10 (1) (2012) 1-31] and its considerable advantages are pointed out. (C) 2011 Elsevier Inc. All rights reserved.

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

anisotropic diffusion
asymptotic preserving scheme


Life cycle data management: first step towards a new product lifecycle management standard Nowadays, companies need to focus on efficiency problems, assuring, at the same time, products to be compliant with quality standards, providing a full product support and managing suppliers' and customers' relationships. According to these needs, product is reassuming a central role as enterprise value creator. In literature, many authors agree that a correct and effective management of the product lifecycle could reduce costs by gaining, meanwhile, a higher customer satisfaction and brand loyalty. This kind of approach needs an integrated management of all product-related information and calls for a wide standardisation activity. Today, a data model, capable of collecting all the information regarding the product along its lifecycle, is still missing. This article aims at providing a concrete answer to this urgent industrial need, presenting the steps taken towards the creation of a new product lifecycle management standard, named life cycle data management. The development of this new standard is an effort to provide an effective and reliable information model to manage all product lifecycle data and information.

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

lifecycle support
product data and knowledge management
plm standard


An approach for predicting and describing patient outcome using multicriteria decision analysis and decision rules Patient outcome in brain trauma patients is affected by a multiplicity of factors, beginning with ambulatory transportation and routing, to the grade of the receiving facility and treatment therein, and finally the treatment and monitoring in definitive care (the brain trauma intensive care unit). Factors and events in each of these phases can be modeled as a multicriteria problem, where the objective is to optimize patient outcome; moreover, a more comprehensive model can embody the interactions of all three phases. This study focuses on modeling the factors that affect patient outcome in definitive care and on expressing these in machine readable format so that we can better describe or predict patient outcome using data mining tools. We use multicriteria decision analysis and decision rules for knowledge representation. Preliminary results suggest that the incorporation of a priori knowledge does help better predict or describe patient outcome when using decision tree induction.

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

data mining
multicriteria decision analysis

knowledge-based systems
decision support systems
traumatic brain injury


Digital Investigation as a distinct discipline: A pedagogic perspective Is Digital Investigation sufficiently different in character from existing academic disciplines such as Computer or Forensic Science to be called a distinct discipline? Is it a profession in its own right? The authors outline why the debate is a significant one in terms of its consequences for professional standards, quality control, academic and personal accreditation. The paper emphasises the differences in the way we teach digital investigations in comparison to computer science covering theory, practice, the education versus training debate, the interdisciplinary nature of the subject, a problem solving and problem based approach, and the need to emphasis professionalism and ethics. The arguments for four alternative positions are proposed: Digital Investigation as a branch of Computer Science, Digital Investigation as a branch of Forensic Science, Digital Investigation as an inter-disciplinary science and Digital Investigation as a distinct discipline. The experience gained in the development and delivery of three typical academic programmes in the area is used to support one position, namely that Digital Investigation is a distinct discipline that merits professional status.

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

digital investigation
education
training


combine and top down block placement algorithm for hierarchical logic vlsi layout A Combine and TOP down placement (CTOP) algorithm for determination of relative placement of blocks which are set of cells is presented. The objective functions of the CTOP algorithm are to minimize inter-block wiring space and dead space using a combine value P. P is defined as the combination of the connectivity and dead space factor. With use of the CTOP algorithm, chip size in our example is about 6\% smaller than with manual block placement. In the experiment reported on here, we used the same automatic placement and routing program for intra-block design.

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

value use factor space size design layout placement routing logic algorithm

hierarchic examples determinism object experience relation connection combinational blocking


Cobra: Parallel path following for computing the matrix pseudospectrum The construction of an accurate approximation of the is an element of -pseudospectrum of a matrix by means of the standard grid method is a very demanding computational task. In this paper, we describe Cobra. a domain-based method for the computation of pseudospectra that combines predictor corrector path following with a one-dimensional grid. The algorithm offers large and medium grain parallelism and becomes particularly attractive when we seek fine resolution of the pseudospectrum boundary. We implement Cobra using standard LAPACK components and show that it is more robust than the existing path following technique and faster than it and the traditional grid method. Cobra is also combined with a partial SVD algorithm to produce an effective parallel method for computing the matrix pseudospectrum. (C) 2001 Elsevier Science B.V. All rights reserved.

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

path following
matrix pseudospectrum
partial svd

parallel computing
singular value decomposition
shared-memory multiprocessors
numa
sgi origin


A tool for mapping and spatio-temporal analysis of hydrological data SPELLmap facilitates analysis of hydrological data in the spatio-temporal domains. Provides visualizations of spatio-temporal domains of hydrological observations. Incorporates toolsets for data metrics, processing, manipulation, and analysis. Geospatial capabilities and times series integration in a single application. SPELLmap, facilitates identification and extraction of 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

integrated environmental modeling
spatio-temporal analysis
hydrological modeling
data visualization
geospatial software
gis


Task mapping and priority assignment for soft real-time applications under deadline miss ratio constraints Both analysis and design optimisation of real-time systems has predominantly concentrated on considering hard real-time constraints. For a large class of applications, however, this is both unrealistic and leads to unnecessarily expensive implementations. This paper addresses the problem of task priority assignment and task mapping in the context of multiprocessor applications with stochastic execution times and in the presence of constraints on the percentage of missed deadlines. We propose a design space exploration strategy together with a fast method for system performance analysis. Experiments emphasize the efficiency of the proposed analysis method and optimisation heuristic in generating high-quality implementations of soft real-time systems with stochastic task execution times and constraints on deadline miss ratios.

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

performance
stochastic task execution times
mapping
priority assignment

theory
schedulability analysis
soft real-time systems


Improving the quality of use case models using antipatterns Use case (UC) modeling is a popular requirements modeling technique. While these models are simple to create and read; this simplicity is often misconceived, leading practitioners to believe that creating high quality models is straightforward. Therefore, many low quality models that are inconsistent, incorrect, contain premature restrictive design decision and contain ambiguous information are produced. To combat this problem of creating low quality UC models, this paper presents a new technique that utilizes antipatterns as a mechanism for remedying quality problems in UC models. The technique, supported by the tool ARBIUM, provides a framework for developers to define antipatterns. The feasibility of the approach is demonstrated by applying it to a real-world system. The results indicate that applying the technique improves the overall quality and clarity of UC models.

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

use cases
uml
use case modeling qualityattributes
ocl


Methodological basis of forecasting of sustainable development of economic system Since the adoption of the Rio-Declaration in 1992 the concept of sustainable development is raising more and more awareness in public perception. The concept requires the integration of economic, environment and social considerations into all decision-making, fostering intra-generational equity through the alleviation of poverty by concentrating the benefits of development in lesser developed areas and considering the needs of future generations to ensure that inter-generated equity exists. The implementation of sustainable development concept requires certain means. One major instrument is forecasting of development by using sustainable development indicators. In this article the problems of methodological basis of forecasting of sustainable development of economic system are considered. The authors investigate these problems on an example of Republic of Kazakhstan. (C) 2004 IMACS. Published by Elsevier B.V. All rights reserved.

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

population
consumption
natural resources


Bagged fuzzy clustering for fuzzy data: An application to a tourism market Introduces a novel segmentation method based on bagged and fuzzy clustering. Proposes how to adapt Bagged fuzzy clustering for fuzzy data. Segments the market of potential Chinese consumers to Western Europe. Four segments of perceived images are identified. Results have implications for the application of market segmentation algorithms in marketing.

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

bagged clustering
fuzzy c-means
likert-type scales


Base station location and service assignments in W-CDMA networks Designing a wideband code division multiple access (W-CDNIA) network is a complicated task requiring the selection of sites for radio towers, analysis of customer demand, and assurance of service quality in terms of signal-to-interference ratio requirements. This investigation presents a net-revenue maximization model that can help a network planner with the selection of tower sites and the calculation of service capacity. The integer programming model takes as input a set of candidate tower locations with corresponding costs, a number of customer locations with corresponding demand for traffic, and the revenue potential for each unit of capacity allocated to each demand point. Based on these data, the model can be used to determine the selection of radio towers and the service capacity of the resulting radio network. The basic model is a large integer program and requires a special algorithm for practical solution. Our algorithm uses a priority branching scheme, an optimization-gap tolerance between 1% and 10%, and two sets of global valid inequalities that tighten the upper bounds obtained from the linear prograrnming relaxation. The algorithm has been implemented in software for the AMPL/CPLEX system and an empirical investigation has been conducted. Using over 300 problem instances with up to 40 towers and 250 service locations, various combinations of algorithm settings have been evaluated. Using the recommended setting results in a design tool that generally runs in under 20 minutes on a 667 MHz AlphaStation.

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


Stochastic multi-objective models for network design problem Transportation network design problem (NDP) is inherently multi-objective in nature, because it involves a number of stakeholders with different needs. In addition, the decision-making process sometimes has to be made under uncertainty where certain inputs are not known exactly. In this paper, we develop three stochastic multi-objective models for designing transportation network under demand uncertainty. These three stochastic multi-objective NDP models are formulated as the expected value multi-objective programming (EVMOP) model, chance constrained multi-objective programming (CCMOP) model, and dependent chance multi-objective programming (DCMOP) model in a bi-level programming framework using different criteria to hedge against demand uncertainty. To solve these stochastic multi-objective NDP models. we develop a solution approach that explicitly optimizes all objectives under demand uncertainty by simultaneously generating a family of optimal solutions known as the Pareto optimal solution set. Numerical examples are also presented to illustrate the concept of the three stochastic multi-objective NDP models as well as the effectiveness of the solution approach. Published by Elsevier Ltd.

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

user equilibrium
traffic assignment
bi-level program
stochastic program
multi-objective
genetic algorithm


A quantum secure direct communication protocol using entangled modified spin coherent states In this paper, a new direct quantum communication protocol based on a modified spin coherent state as decoy particles is to be depicted, before that both the scheme of the communication and the modified spin coherent state of the \(SU(2)\) group will be presented. The final phase is to be devoted to the study of the transmission security analysis and the quantity information depending on the method of the entropy theory, using the constraint between the information which can be obtained by the eavesdropper and the occurring interference.

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

qsdc
eavesdropping detection
ping-pong protocol
continues variables
protocol security


towards practical genre classification of web documents Classification of documents by genre is typically done either using linguistic analysis or term frequency based techniques. The former provides better classification accuracy than the latter but at the cost of two orders of magnitude more computation time. While term frequency analysis requires much less computational resources than linguistic analysis,it returns poor classification accuracy when the genres are not sufficiently distinct. A method that removes or approximates the expensive portions of linguistic analysis is presented.The accuracy and computation time of this method then compared with both linguistic analysis and term frequency analysis. The results in this paper show that this method can significantly reduce the computation of both time of linguistic analysis and term frequency analysis, while retaining an accuracy that is higher than that of term frequency analysis.

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

linguistic
term frequency
genre classification


Grounded symbolic communication between heterogeneous cooperating robots In this paper, we describe the implementation of a heterogeneous cooperative multi-robot system that was designed with a goal of engineering a grounded symbolic representation in a bottom-up fashion. The system comprises two autonomous mobile robots that perform cooperative cleaning. Experiments demonstrate successful purposive navigation, map building and the symbolic communication of locations in a behavior-based system. We also examine the perceived shortcomings of the system in detail and attempt to understand them in terms of contemporary knowledge of human representation and symbolic communication. From this understanding, we propose the Adaptive Symbol Grounding Hypothesis as a conception for how symbolic systems can be envisioned.

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

symbolic communication
symbol grounding
representation
mobile robots

cooperative robotics
heterogeneous systems
learning
behavior-based


The rigour of EPOs patentability criteria: An insight into the induced withdrawals ? The EPO traditionally grants at least 60% of all patent applications, the rest being either withdrawn (3035%) or refused (5%). This paper provides quantitative evidence suggesting that up to 54% of all patent withdrawals could be considered as induced by the work of EPO examiners, and hence may be taken as a more appropriate indicator of the rigour of the EPO. Induced withdrawals and refusals occur for up to 23% of all applications at the EPO. This share varies according to (1) the route chosen for an EPO filing; (2) the technological field that is considered; and (3) the country of residence of the assignee. The number of claims only slightly affects the share of withdrawals. However, on average, two additional claims induce an additional communication from the EPO, which in turn prolongs the procedural duration by an additional year.

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

european patent office
grant
patent filing
communications
examination procedure


Fast detection of XML structural similarity Because of the widespread diffusion of semistructured data in XML format, much research effort is currently devoted to support the storage and retrieval of large collections of such documents. XML documents can be compared as to their structural similarity, in order to group them into clusters so that different storage, retrieval, and processing techniques can be effectively exploited. In this scenario, an efficient and effective similarity function is the key of a successful data management process. We present an approach for detecting structural similarity between XML documents which significantly differs from standard methods based on graph-matching algorithms, and allows a significant reduction of the required computation costs. Our proposal roughly consists of linearizing the structure of each XML document, by representing it as a numerical sequence and, then, comparing such sequences through the analysis of their frequencies. First, some basic strategies for encoding a document are proposed, which can focus on diverse structural facets. Moreover, the theory of Discrete Fourier Transform is exploited to effectively and efficiently compare the encoded documents (i.e., signals) in the domain of frequencies. Experimental results reveal the effectiveness of the approach, also in comparison with standard methods.

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

web mining
mining methods and algorithms
xml/xsl/rdf
text mining
similarity measures


Evaluating two ways of calculating priorities in requirements hierarchies - An experiment on hierarchical cumulative voting When developing large-scale software systems, there is often a large amount of requirements present, and they often reside on several hierarchical levels. In most cases, not all stated requirements can be implemented into the product due to different constraints, and the requirements must hence be prioritized. As requirements on different abstraction levels shall not be compared, prioritization techniques that are able to handle multi-level prioritization are needed. Different such techniques exist, but they seem to result in unfair comparisons when a hierarchy is unbalanced. In this paper, an empirical experiment is presented where an approach that compensate for this challenge is evaluated. The results indicate that some form of compensation is preferred, and that the subjects' preference is not influenced by the amount of information given. (C) 2008 Elsevier Inc. All rights reserved.

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

requirements hierarchies
empirical experiment

requirements prioritization
compensation factor
accuracy


Fifteen years of grey system theory research: A historical review and bibliometric analysis The grey system theory, identified as one of the developed multiple attribute decision-making techniques, has been published by and indexed in over 300 internationally recognized refereed journals. The objective of this study is to conduct a bibliometric study on publication and citation patterns of grey system theory published from 1996 to 2010 through a systemic search using the ISI web-based databases with a specific focus on grey relational analysis (GRA) and grey prediction. Results of the study demonstrate that there has been a substantial increase in the number of peer-reviewed papers on GRA or grey prediction indexed by the ISI Web of Knowledge. Also, citation analysis was used to examine the contributions of GRA and grey prediction studies. This bibliometric analysis would provide a ready reference for scholarly works on GRA and grey prediction, and serve as an informative summary kit for future research works.

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

bibliometric analysis
grey system theory
grey relational analysis
grey prediction


A self-stabilizing algorithm for cut problems in synchronous networks Consider a synchronized distributed system where each node can only observe the state of its neighbors. Such a system is called self-stabilizing if it reaches a stable global state in a finite number of rounds. Allowing two different states for each node induces a cut in the graph. In each round, every node decides whether it is (locally) satisfied with the current cut. Afterwards all unsatisfied nodes change sides independently with a fixed probability p. Using different notions of satisfaction enables the computation of maximal and minimal cuts, respectively. We analyze the expected time until such cuts are reached on several graph classes and study the impact of the parameter p and the initial Cut. (C) 2010 Elsevier B.V. All rights reserved.

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

self-stabilization
distributed computing
randomization


Central Baroreflex Resetting as a Means of Increasing and Decreasing Sympathetic Outflow and Arterial Pressure The arterial baroreflex has two important functions. First, the arterial baroreflex is a negative feedback reflex that regulates arterial pressure around a preset value called a set or operating point. Second, the arterial baroreflex also establishes the prevailing systemic arterial pressure when the operating point is reset. That is, modulating the response of barosensitive neurons in the central nervous system (CNS) establishes the operating point or prevailing systemic arterial pressure. Therefore, the operating point of the arterial baroreflex is not fixed, but is variable over a wide range of pressures and is determined by a variety of inputs from the peripheral and central nervous systems. At the onset of dynamic exercise, heart rate (HR) and sympathetic nerve activity (SNA) increase abruptly and dramatically. The initial increase in HR and SNA is mediated by central command. Central command operates by resetting the operating point of the arterial baroreflex to a higher pressure. In this situation, the operating point of the arterial baroreflex is above the prevailing arterial pressure, which elicits a blood pressure error. This error is corrected by activating SNA and inhibiting parasympathetic nerve activity, which increases cardiac output and peripheral resistance and, consequently, arterial pressure. After exercise, loss of central command and enhanced activity of the cardiopulmonary reflex resets the operating point of the arterial baroreflex to a lower pressure. In this situation, the operating point of the arterial baroreflex is below the prevailing arterial pressure, which elicits a blood pressure error. This error is corrected by inhibiting SNA, which decreases peripheral resistance and consequently arterial pressure. In these situations, central resetting of the arterial baroreflex is a means of increasing and decreasing sympathetic outflow and arterial pressure.

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

autonomic nervous system
post-exercise hypotension
hypotension


A safe algorithm for resolving OR deadlocks Deadlocks in the OR model are usually resolved by aborting a deadlocked process. Prior algorithms for the same model sometimes abort nodes needlessly wasting computing resources. This paper presents a new deadlock resolution algorithm for the OR model that satisfies the following correctness criteria: (Safety) the algorithm does not resolve false deadlocks; (Liveness) the algorithm resolves all deadlocks in finite time. The communication cost of the algorithm is similar to that of previous nonsafe proposals. The theoretical cost has been validated by simulation. In addition, different algorithm initiation alternatives have been analyzed in order to reduce the latency of deadlocks.

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

deadlock detection/resolution
or request model
distributed systems
distributed algorithms