The electron scattering at grain boundaries in tungsten films The impact of electron scattering at grain boundaries in polycrystalline tungsten (W) thin films is studied with a unique approach. Two nominally 300nm-thick films, a (110)-oriented epitaxial and a (110)-textured polycrystalline W film, were prepared in identical fabrication conditions except for the substrates, i.e., Al2O3 substrate for the epitaxial film and thermally oxidized Si substrate for the polycrystalline film. The significantly larger dimension of the film thickness than the electron mean free path in W allows the contribution of surface scattering to be negligible, and the additional resistivity for the polycrystalline W film relative to the epitaxial film is attributed to grain boundary scattering. The MayadasShatzkes (MS) grain boundary scattering model is employed for quantitative analyses, with the grain boundary reflection coefficient determined to be 0.420.02 and 0.400.02 at 293K and 4.2K, respectively, using the measured lateral grain size of 1197nm. Based on the grain boundary reflection coefficient determined in this study and the surface scattering coefficient (p=0.11) of the FuchsSondheimer model given elsewhere, the resistivity of W lines having line-widths less than 10nm is predicted to be lower than that of Cu lines.

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


A new method of designing a dither matrix This paper presents a new method of designing a dither matrix based on simulated annealing. Air obtained dither matrix (halftone screen/mask) is appropriate for press printing. Because of several physical reasons, halftoning for press printing is more difficult than halftoning for electronic displays; or ink-jet printers. Even if stochastic dispersed-dot screening (so-called FM-screening) is one of the best solutions for halftoning, that is not appropriate for press printing. On the other hand, classical periodic clustered-dot screening (so-called AM-screening) is more important and is widely used even now. We recognize unfavorable quality of AM-screening, but we can not ignore its productive stability in printing section. The proposed halftone dither matrix has aperiodic clustered-dot pattern, and size of cluster can be controlled by a weighting parameter of a cost function. We will obtain a dither matrix which consists of clustered-dots. Some characteristics of the design algorithm and half-toned images are investigated in detail. As a result, the fact that air obtained dither matrix is superior to ANI-screen and comparable to FM-screen in visual quality, and the matrix is comparable to AM-screen and superior to FM-screen in press printability is confirmed.

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

simulated annealing
dither matrix
press printing


a distributed debugger for amoeba We describe a debugger that is being developed for distributed programs in Amoeba. A major goal in our work is to make the debugger independent of the Amoeba kernel. Our design integrates many facilities found in other debuggers, such as execution replay, breakpointing, and an event-based view of the execution of the target program. This paper discusses the influence of Amoeba's architecture on the attainability of our goals and the desired functionality of the debugger. We also consider such problems as how to deal with timeouts and interactions between the target program and its environment.

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

program influence paper distributed replay goals architecture design

interaction environments event functional


Shannon capacity of M-ary redundant multitrack runlength limited codes We consider multiamplitude, multitrack runlength-limited (d, k) constrained channels with and without clock redundancy. We calculate the Shannon capacities of these channels and present some simple 100% efficient codes, To compute capacity a constraint graph equivalent to the usual runlength-limited constraint graph is used, The introduced graph model has the vertex labeling independent of number of tracks to be written on (in parallel), which provides computational savings when the number of tracks is large. We show that increasing the number of tracks written on in parallel provides significant increase of per-track capacity for the more restrictive clocking constraint case, i.e., when k < d, but it does not have much influence on the channel capacity, when k greater than or equal to d.

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

multitrack codes
noiseless constrained channels
recording codes
runlength-limited codes


Extending answer sets for logic programming agents We present systems of logic programming agents (LPAS) to model the interactions between decision-makers while evolving to a conclusion. Such a system consists of a number of agents connected by means of unidirectional communication channels. Agents communicate with each other by passing answer sets obtained by updating the information received from connected agents with their own private information. We introduce a credulous answer set semantics for logic programming agents. As an application, we show how extensive games with perfect information can be conveniently represented as logic programming agent systems, where each agent embodies the reasoning of a game player, such that the equilibria of the game correspond with the semantics agreed upon by the agents in the LPAS.

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

answer set programming
multi-agent sytems
knowledge representation
game theory


Optimal halting policies in Markov population decision chains with constant risk posture This paper concerns infinite-horizon Markov population decision chains with finite state-action space, where one exerts control on a population of individuals in different states by assigning an action to each individual in the system in each period. In every transition, each individual earns a random reward and generates a random progeny vector. The objective of the decision maker is to maximize expected (infinite-horizon) system utility under the following assumptions: (i) The utility function exhibits constant risk posture, (ii)the (random) progeny vectors of distinct individuals are independent, and (iii) the progeny vectors of individuals in a state who take the same action are identically distributed. The paper deals with the problem of finding an optimal stationary halting policy and shows that this problem can be solved efficiently using successive approximations with the original state-action space without enlarging it to include information about the population in each state or any other aspect of the system history in a state. The proposed algorithm terminates after a finite number of iterations with an optimal stationary halting policy or with proof of nonexistence.

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

markov population decision chains
constant risk posture
halting policies

markov decision chains
stochastic control
dynamic programming


Autonomous Coordination Technology through Community Organization for Resource Utilization The challenge in resource utilization under dynamic environment is how to utilize appropriate resources to the right users at the right time and the right location. In conventional system, centralized management system is applied but it tends to congest when user requests increase or resources rapidly move. Therefore, this paper proposes Autonomous Coordination Technology (ACT) through community organization for resource utilization. In ACT, a node which has surplus resources autonomously constructs community with a surplus-level based size and distributes resources to members which are deficient in resources. ACT consists of autonomous coordination within community and among communities. According to community organization, online property and flexibility can be satisfied. However, it is difficult to achieve service provision timeliness and resource allocation operatability in the mean time. Thus, ACT includes successive transportation method, and autonomous resource allocation which dynamic decision is made by a tradeoff between timeliness and operatability. As a result, the service assurance in terms of timeliness and operatability can be assured. The effectiveness of proposed technology is affirmed through the simulation of taxi dispatching application in terms of response time and standard deviation versus user rates.

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

resource utilization
autonomous coordination

autonomous decentralized community system


Interval criteria for oscillation of second-order functional differential equations By using averaging functions, new interval oscillation criteria are established for the second-order functional differential equation, (r (t) vertical bar x' (t)vertical bar(alpha-1) x' (t))' + F (t, x (t), x (tau (t)), x' (t), x' (tau (t))) = 0, t >= t(0), that are different from most known ones in the sense that they are based on information only on a sequence of subintervals of [t(0), infinity), rather than on the whole half-line. Our results can be applied to three cases: ordinary, delay, and advance differential equations. In the case of half-linear functional differential equations, our criteria implies that the tau(t) = t advance cases do not affect the oscillation. In particular, several examples are given to illustrate the importance of our results. (c) 2005 Elsevier Ltd. All rights reserved.

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

quasilinear differential equation
generalized riccati technique
integral averaging method


Comparing OPEN and UML: the two third-generation OO development approaches Recent efforts have been made to coalesce object-oriented methods and object-oriented modelling languages and, at the same time, to put them on a more rigorous footing by the use of metamodelling techniques. Two so-called third-generation approaches, OPEN (a full methodology) and UML (a modelling language) are described and compared here. These two approaches are compared by focusing on two main areas: (1) process and lifecycle support and, predominantly, (2) metamodel and notation.

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


On the Construction of Structured LDPC Codes Free of Small Trapping Sets We present a method to construct low-density parity-check (LDPC) codes with low error floors on the binary symmetric channel. Codes are constructed so that their Tanner graphs are free of certain small trapping sets. These trapping sets are selected from the trapping set ontology for the Gallager A/B decoder. They are selected based on their relative harmfulness for a given decoding algorithm. We evaluate the relative harmfulness of different trapping sets for the sum-product algorithm by using the topological relations among them and by analyzing the decoding failures on one trapping set in the presence or absence of other trapping sets. We apply this method to construct structured LDPC codes. To facilitate the discussion, we give a new description of structured LDPC codes whose parity-check matrices are arrays of permutation matrices. This description uses Latin squares to define a set of permutation matrices that have disjoint support and to derive a simple necessary and sufficient condition for the Tanner graph of a code to be free of four cycles.

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

structured low-density parity-check codes


A filter bank-based source extraction algorithm for heart sound removal in respiratory sounds In this paper, we consider the problem of heart sounds (HS) removal from respiratory sounds (RS), and a novel semi-blind single-channel source extraction algorithm is proposed. The proposed method is able to extract the underlying pure RS from the HS corrupted noisy input signals by incorporating the filter banks and template-based matching using FIR filters. For performance evaluation of the presented method, the average power spectral densities (PSD) of the input RS segments without HS have been compared with the PSD of the reconstructed signals over six selected frequency bands from 20 to 800Hz. The proposed method is tested for various types of RS recordings and found effective by yielding an overall maximum spectral difference of 2.8707 0.9875 dB for a frequency range below 800Hz.

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

respiratory sound (rs)
heart sound (hs)
single-channel source extraction
template matching


A Large-Scale Empirical Study of Just-in-Time Quality Assurance Defect prediction models are a well-known technique for identifying defect-prone files or packages such that practitioners can allocate their quality assurance efforts (e. g., testing and code reviews). However, once the critical files or packages have been identified, developers still need to spend considerable time drilling down to the functions or even code snippets that should be reviewed or tested. This makes the approach too time consuming and impractical for large software systems. Instead, we consider defect prediction models that focus on identifying defect-prone ("risky") software changes instead of files or packages. We refer to this type of quality assurance activity as "Just-In-Time Quality Assurance," because developers can review and test these risky changes while they are still fresh in their minds (i.e., at check-in time). To build a change risk model, we use a wide range of factors based on the characteristics of a software change, such as the number of added lines, and developer experience. A large-scale study of six open source and five commercial projects from multiple domains shows that our models can predict whether or not a change will lead to a defect with an average accuracy of 68 percent and an average recall of 64 percent. Furthermore, when considering the effort needed to review changes, we find that using only 20 percent of the effort it would take to inspect all changes, we can identify 35 percent of all defect-inducing changes. Our findings indicate that "Just-In-Time Quality Assurance" may provide an effort-reducing way to focus on the most risky changes and thus reduce the costs of developing high-quality software.

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

maintenance
software metrics
mining software repositories
just-in-time prediction


Steps towards advanced cell control systems: An application in Flexible Assembly Systems This paper presents an advanced cell control system which integrates design, modelling control and monitoring capabilities and demonstrates its use in a class of Flexible Assembly System (FAS). From this research work a Timed Colour Petri Net (TCPN) based model for the design and modelling of FAS is proposed. Furthermore, through the adoption of a Manufacturing Message Specifications (MMS) based open network communication scheme, a realtime distributed client/server control methodology is formulated. These techniques am integrated within an advanced cell control architecture which is demonstrated through the implementation of a class of FAS using multiple robotic workstations and a conveyor based materials handling system for concurrent manufacture of products in small batch quantities. Operational flexibility is enhanced by the introduction of a flexible process planning scheme and a genetic algorithm for real-time searching of near-optimal production sequences and operation assignments. Such an architecture can facilitate some fault recovery capabilities within the cell control system.

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

petri-net
advanced manufacturing systems


Vectorized Matlab codes for linear two-dimensional elasticity A vectorized Matlab implementation for the linear finite element is provided for the two-dimensional linear elasticity with mixed boundary conditions. Vectorization means that there is no loop over triangles. Numerical experiments show that our implementation is more efficient than the standard implementation with a loop over all triangles.

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


A modelling and evaluation methodology for E-Commerce enabled BPR This paper proposes a structured methodology for the evaluation of alternative Electronic Commerce technologies to be introduced into SMEs' (small to medium enterprises) every-day business practices. The main tools used by the methodology are discrete event simulation and activity-based costing/management (ABC/ABM). The enterprise strategy definition is supported by the GRAI methodology, whereas the business process modelling is carried out with the use of IDEF-0 and IDEF-3 activity modelling tools. The application of the methodology and the results produced are demonstrated for a Greek medium-sized enterprise operating in the Clothing Industry. Conclusions and further research efforts are presented in the end of the paper. (C) 2002 Elsevier Science B.V. All rights reserved.

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


Environmentally adaptive acoustic transmission loss prediction in turbulent and nonturbulent atmospheres An environmentally adaptive system for prediction of acoustic transmission loss (TL) in the atmosphere is developed in this paper. This system uses several back propagation neural network predictors, each corresponding to a specific environmental condition. The outputs of the expert predictors are combined using a fuzzy confidence measure and a nonlinear fusion system. Using this prediction methodology the computational intractability of traditional acoustic model-based approaches is eliminated. The proposed TL prediction system is tested on two synthetic acoustic data sets for a wide range of geometrical, source and environmental conditions including both nonturbulent and turbulent atmospheres. Test results of the system showed root mean square (RMS) errors of 1.84dB for the nonturbulent and 1.36dB for the turbulent conditions, respectively, which are acceptable levels for near real-time performance. Additionally, the environmentally adaptive system demonstrated improved TL prediction accuracy at high frequencies and large values of horizontal separation between source and receiver.

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

atmospheric acoustics
turbulent scattering
parabolic equation
fuzzy-logic fusion


Finite element speaker-specific face model generation for the study of speech production In situations where automatic mesh generation is unsuitable, the finite element (FE) mesh registration technique known as mesh-match-and-repair (MMRep) is an interesting option for quickly creating a subject-specific FE model by fitting a predefined template mesh onto the target organ. The irregular or poor quality elements produced by the elastic deformation are corrected by a 'mesh reparation' procedure ensuring that the desired regularity and quality standards are met. Here, we further extend the MMRep capabilities and demonstrate the possibility of taking into account additional relevant anatomical features. We illustrate this approach with an example of biomechanical model generation of a speaker's face comprising face muscle insertions. While taking advantage of the a priori knowledge about tissues conveyed by the template model, this novel, fast and automatic mesh registration technique makes it possible to achieve greater modelling realism by accurately representing the organ surface as well as inner anatomical or functional structures of 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

finite element mesh generation
biomechanical modelling
elastic registration
finite element mesh quality


Forward stage-wise ensemble regression algorithm to improve base regressors prediction ability: an empirical study Analysis of scientific data requires accurate regressor algorithms to decrease prediction errors. Lots of machine learning algorithms, that is, neural networks, rule-based algorithms, regression trees and some kinds of lazy learners, are used to realize this need. In recent years, different ensemble regression strategies were improved to obtain enhanced predictors with lower forecasting errors. Ensemble algorithms combine good models that make errors in different parts of analyzed data. There are mainly two approaches in ensemble regression algorithm generation; boosting and bagging. The aim of this article is to evaluate a boosting-based ensemble approach, forward stage-wise additive modelling (FSAM), to improve some widely used base regressors prediction ability. We used 10 regression algorithms in four different types to make predictions on 10 diverse data from different scientific areas and we compared the experimental results in terms of correlation coefficient, mean absolute error, and root mean squared error metrics. Furthermore, we made use of scatter plots to demonstrate the effect of ensemble modelling on the prediction accuracies of evaluated algorithms. We empirically obtained that in general FSAM enhances the accuracies of base regressors or it at least maintains the base regressor performance.

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

forward stage-wise additive modelling
boosting ensemble regression


A new evolutionary computation technique for economic dispatch with security constraints This paper presents an efficient and reliable evolutionary based approach to solve the economic load dispatch (ELD) with security constraints. A new approach is proposed which employs attractive and repulsive particle swarm optimization (ARPSO) algorithm for ELD. Incorporation of ARPSO as a derivative-free optimization technique in solving ELD with security (voltages and line-flows) constraints significantly relieves the assumptions imposed on the optimized objective function. The proposed approach has been implemented on three representative systems, i.e. IEEE 14 bus, IEEE 30 bus and IEEE 57 bus systems, respectively. The feasibility of the proposed method is demonstrated and the results are compared with linear programming, quadratic programming and genetic algorithm, respectively. The premature convergence problem, that is common in all evolutionary computation techniques, is solved in ARPSO by including the diversity factor in the Type 1 PSO algorithm. The developed algorithms are computationally faster (in terms of the number of load flows carried out) than the other methods because only one run is required.

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

economic load dispatch
particle swarm optimization

power system optimization
line-flow
voltage constraints


extending cscw into domestic environments (workshop session) (abstract only) This half-day workshop will aim to build a community of interest and research agenda around extending CSCW methods and technologies to home settings. Relevant issues include the coordination of activities in public and private spaces; shared resource technologies; distributed coordination in and between households and the role of technology in everyday life.

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

role coordination research home technologies environments workshop public distributed resource

sharing activation method communities abstraction relevance


Capacitated Arc Stabbing In the Capacitated Arc Stabbing problem (CAS) we are given a set of arcs and a set of points on a circle. We say that a point p covers, or stabs, an arc A if p is contained in A. Each point has a weight and a capacity that determines the number of arcs it may cover. The goal is to find a minimum weight set of points that stabs all the arcs. CAS models a periodic multi-item lot sizing problem in which we are given a set of production requests each with its own periodic release time and deadline. Production takes place in batches of bounded capacity: each time unit t is associated with a capacity c(t) c ( t ) and weight w(t) w ( t ) , where c(t) c ( t ) bounds the number of requests that can be manufactured at time t , and w(t) w ( t ) is a fixed cost for manufacturing any positive number of requests up to c(t) c ( t ) at time t. The goal is to find a minimum weight periodic schedule. We present a polynomial time algorithm for CAS that is based on a non-trivial reduction to Capacitated Interval Stabbing. Our approach applies to both hard and soft capacities. We also consider two variants of CAS in which some arcs may remain uncovered: in the partial variant there is a covering requirement g, and the goal is to find a minimum weight set of points that covers at least g arcs; and in the prize collecting variant each arc has a penalty that must be paid if this arc is not covered.

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

arc stabbing
interval stabbing
lot sizing

capacitated covering
partial covering
prize collecting covering


lattices that admit logarithmic worst-case to average-case connection factors We exhibit an average-case problem that is as hard as finding ?(n)-approximate shortest nonzero vectors in certain n -dimensional lattices in the worst case, for ?(n) = O(?log n). The previously best known factor for any non-trivial class of lattices was ?(n) = (n). Our results apply to families of lattices having special algebraic structure. Specifically, we consider lattices that correspond to ideals in the ring of integers of an algebraic number field. The worst-case problem we rely on is to find approximate shortest vectors in these lattices, under an appropriate form of preprocessing of the number field. For the connection factors ?(n) we achieve, the corresponding decision problems on ideal lattices are not known to be NP-hard; in fact, they are in P. However, the search approximation problems still appear to be very hard. Indeed, ideal lattices are well-studied objects in computational number theory, and the best known algorithms for them seem to perform no better than the best known algorithms for general lattices. To obtain the best possible connection factor, we instantiate our constructions with infinite families of number fields having constant root discriminant . Such families are known to exist and are computable, though no efficient construction is yet known. Our work motivates the search for such constructions. Even constructions of number fields having root discriminant up to O(n 2/3-? ) would yield connection factors better than (n). As an additional contribution, we give reductions between various worst-case problems on ideal lattices, showing for example that the shortest vector problem is no harder than the closest vector problem. These results are analogous to previously-known reductions for general lattices.

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

worst-case to average-case reductions
algebraic number theory


Simple algorithms for partial point set pattern matching under rigid motion ? This paper presents simple and deterministic algorithms for partial point set pattern matching in 2D. Given a set P of n points, called sample set, and a query set Q of k points (n?k n ? k ), the problem is to find a matching of Q with a subset of P under rigid motion. The match may be of two types: exact and approximate. If an exact matching exists, then each point in Q coincides with the corresponding point in P under some translation and/or rotation. For an approximate match, some translation and/or rotation may be allowed such that each point in Q lies in a predefined ? ? -neighborhood region around some point in P . The proposed algorithm for the exact matching needs O(n2) O ( n 2 ) space and O ( n 2 log n ) preprocessing time. The existence of a match for a given query set Q can be checked in O ( k ? log n ) time in the worst-case, where ? ? is the maximum number of equidistant pairs of point in P. For a set of n points, ? ? may be O(n4/3) O ( n 4 / 3 ) in the worst-case. Some applications of the partial point set pattern matching are then illustrated. Experimental results on random point sets and some fingerprint databases show that, in practice, the computation time is much smaller than the worst-case requirement. The algorithm is then extended for checking the exact match of a set of k line segments in the query set with a k-subset of n line segments in the sample set under rigid motion in O ( kn log n ) time. Next, a simple version of the approximate matching problem is studied where one point of Q exactly matches with a point of P, and each of the other points of Q lie in the ? ? -neighborhood of some point of P . The worst-case time and space complexities of the proposed algorithm are O ( n 2 k 2 log n ) and O(n) O ( n ) , respectively. The proposed algorithms will find many applications to fingerprint matching, image registration, and object recognition.

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

point set pattern matching
approximate matching
fingerprint matching
algorithms


Multiagent learning is not the answer. It is the question The article by Shoham, Powers, and Grenager called "If multi-agent learning is the answer, what is the question?" does a great job of laying out the current state of the art and open issues at the intersection of game theory and artificial intelligence (AI). However, from the AI perspective, the term "multiagent learning" applies more broadly than can be usefully framed in game theoretic terms. In this larger context, how (and perhaps whether) multiagent learning can be usefully applied in complex domains is still a large open question. (c) 2007 Elsevier B.V. All rights reserved.

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


A vortex axis and vortex core border grid adaptation algorithm In the design process of hydrodynamical and aerodynamical technical applications, the numerical simulation of massively separated vortical flow is crucial for predicting, for example, lift or drag. To obtain reliable numerical results, it is mandatory to accurately predict the physical behavior of vortices. Thus, the dominant vortical flow structures have to be resolved in detail, which requires a local grid refinement and certain adaptation techniques. In this paper, a vortex flow structure adaptation algorithm is presented, which is particularly designed for local grid refinement at vortex axes positions and associated vortex core border locations. To this end, a fast and efficient vortex axis detection scheme is introduced and the algorithm for the vortex core border determination is explained. As the interaction between vortices makes the assignment of grid points to a certain vortex axis difficult, a helicity-based vortex distinction approach in combination with a geometrical rotational sensor is developed. After describing the combined different techniques in detail, the vortex feature adaptation algorithm is applied to analytical and more realistic examples, which show that the described grid adaptation algorithm is able to enhance the grid cell resolution locally such that all significant vortical flow phenomena are resolved. Copyright (C) 2008 John Wiley & Sons, Ltd.

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


The implementation of broadband network technologies in CARNet During the first decade of its existence, Croatian Academic and Research Network-CARNet faced a number of changes in all segments of its activities. In its efforts not to wait for future to happen, but to predict its users needs, and present acceptable solutions to them, a lot of research and practical work is done concluding with a strong network infrastructure and a number of network services, including real-time applications. In this paper, researches in the field of lower layers network technologies and multimedia application like videoconferencing, media on demand and broadcast technologies implementation in CARNet network is presented. (C) 2002 Elsevier Science B.V. All rights reserved.

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

academic isp
xdsl
multicast
mod
streaming


study of leakage current mechanisms in ballistic deflection transistors In this paper, the Ballistic Deflection Transistor (BDT) is reviewed for variations in performance of the device including leakage with respect to geometry modifications. Monte Carlo and Silvaco modeling tools are used to study current leakage mechanism in BDT. Low power selection criteria and theory behind position of deflector in the device are examined. Since ballistic conduction is not dissipative, power loss should be low. Leakage can be reduced by placing deflector at about 25\% of its own length lower than the exact centre of the device. Current leakages that occurred during device operation are compared with each other and with the output current. It is observed that magnitude of leakage current is distinct at different ports of the device. For a specific set of parameters, leakage is comparable to the output which essentially motivates to choose optimum device architecture.

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

geometry
deflection transistors
current leakage mechanism

silvaco simulation
monte carlo simulation
ballistic transport


Completely derandomized self-adaptation in evolution strategies This paper puts forward two useful methods for self-adaptation of the mutation distribution - the concepts of derandomization and cumulation. Principle shortcomings of the concept of mutative strategy parameter control and two levels of derandomization are reviewed. Basic demands on the self-adaptation of arbitrary (normal) mutation distributions are developed. Applying arbitrary, normal Mutation distributions is equivalent to applying a general, linear problem encoding. The underlying objective of mutative strategy parameter control is roughly to favor previously selected mutation steps in the future. If this objective is pursued rigorously, a completely derandomized self-adaptation scheme results, which adapts arbitrary normal mutation distributions. This scheme, called covariance matrix adaptation (CMA), meets the previously stated demands. It can still be considerably improved by cumulation - utilizing an evolution path rather than single search steps. Simulations on various test functions reveal local and global search properties of the evolution strategy with and without covariance matrix adaptation. Their performances are comparable only on perfectly scaled functions. On badly scaled, nonseparable functions usually a speed up factor of several orders of magnitude is observed. On moderately mis-scaled functions a speed up factor of three to ten can be expected.

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

evolution strategy
strategy parameter control
derandomization
covariance matrix adaptation
evolution path
cumulation

self-adaptation
step size control
derandomized self-adaptation
cumulative path length control


Multidisciplinary design optimization of a vehicle system in a scalable, high performance computing environment Multidisciplinary Design Optimization of a vehicle system for safety, NVH (noise, vibration and harshness) and weight, in a scalable HPC environment, is addressed. High performance computing, utilizing several hundred processors in conjunction with approximation methods, formal MDO strategies and engineering judgement are effectively used to obtain superior design solutions with significantly reduced elapsed computing times. The increased computational complexity in this MDO work is due to addressing multiple safety modes including frontal crash, offset crash, side impact and roof crush, in addition to the NVH discipline, all with detailed, high fidelity models and analysis tools. The reduction in large-scale MDO solution times through HPC is significant in that it now makes it possible for such technologies to impact the vehicle design cycle and improve the engineering productivity.

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

multidisciplinary design optimization
high performance computing
nvh

crashworthiness
surrogate modeling and approximations


Evaluation of Attention-Guiding Video Visualization We investigate four different variants of attention-guiding video visualization techniques that aim to help users distribute their attention equally among potential objects of interest: bounding box visualization, force-directed visualization, top-down visualization, grid visualization. Objects of interest are highlighted by rectangular shapes and then we concentrate on the manipulation of color, motion, and size. We conducted a controlled laboratory user study (n=25) to compare the four visualization techniques and the unmodified video material as baseline. We evaluated task performance and distribution of attention in a search task. These two properties become especially important when video material with numerous objects has to be observed. The distribution of attention was measured by eye tracking. Our results show that a more even distribution of attention between the objects can be achieved by attention-guiding visualization, compared to unmodified video. Many participants feel more comfortable when they look at bounding boxes and the grid, but improvements in search task performance could not be confirmed. Categories and Subject Descriptors (according to ACM CCS): H. 5.1 [Information Interfaces and Presentation]: Multimedia Information Systems- Evaluation/methodology; I. 3. m [Computer Graphics]: Miscellaneous- Video visualization; I. 3.3 [Computer Graphics]: Picture/Image Generation- Display algorithms

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

h.5.1 [information interfaces and presentation]: multimedia information systems

i.3.3 [computer graphics]: picture/image generation


Using a contextual entropy model to expand emotion words and their intensity for the sentiment classification of stock market news Sentiment classification of stock market news involves identifying positive and negative news articles, and is an emerging technique for making stock trend predictions which can facilitate investor decision making. In this paper, we propose the presence and intensity of emotion words as features to classify the sentiment of stock market news articles. To identify such words and their intensity, a contextual entropy model is developed to expand a set of seed words generated from a small corpus of stock market news articles with sentiment annotation. The contextual entropy model measures the similarity between two words by comparing their contextual distributions using an entropy measure, allowing for the discovery of words similar to the seed words. Experimental results show that the proposed method can discover more useful emotion words and their corresponding intensity, thus improving classification performance. Performance was further improved by the incorporation of intensity into the classification, and the proposed method outperformed the previously-proposed pointwise mutual information (PMI)-based expansion methods.

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

sentiment classification
contextual entropy model
stock market news

word expansion
natural language processing


Coscheduling of Processor Voltage and Control Task Period for Energy-Efficient Control Systems The Dynamic Voltage Scaling (DVS) technique has been widely studied for energy-constrained real-time systems; however, its application to control systems has not been studied in a variety of aspects. This article presents a novel method to simultaneously schedule processor voltage and control-task periods online, considering energy-efficiency of control systems as a whole. Anew performance index is proposed, which contains both control performance and processor energy terms. Then, an online scheduler assigning processor voltage and control-task periods that maximizes the performance index is proposed. The performance of the proposed scheduler under varying control workload is verified using MATLAB simulations and experiments on an actual DVS hardware platform.

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

performance
dynamic voltage scaling
energy
task period

design
measurement
real-time control
scheduling


Data Structures in Multi-Objective Evolutionary Algorithms Data structures used for an algorithm can have a great impact on its performance, particularly for the solution of large and complex problems, such as multi-objective optimization problems (MOPs). Multi-objective evolutionary algorithms (MOEAs) are considered an attractive approach for solving MOPs, since they are able to explore several parts of the Pareto front simultaneously. The data structures for storing and updating populations and non-dominated solutions (archives) may affect the efficiency of the search process. This article describes data structures used in MOEAs for realizing populations and archives in a comparative way, emphasizing their computational requirements and general applicability reported in the original work.

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

multi-objective evolutionary algorithm
data structure
paseto front
archive
population


The inverse limit in the category of topological molecular lattices In this paper, we first introduce the definition of an inverse system in the category of topological molecular lattices, and give the structure of the inverse limit of an inverse system. Then we establish the concept of a mapping between two inverse systems, and induce the concept of a continuous mapping between the inverse limits of two inverse systems. Finally, we discuss a series of properties of continuous mappings. Therefore, the difficult problem in the theory of topological molecular lattices is solved. (C) 2001 Elsevier Science B.V. All rights reserved.

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

limit in category
topological molecular lattice


Variationally universal hashing The strongest well-known measure for the quality of a universal hash-function family H is its being E-strongly universal, which measures, for randomly chosen h is an element of H, one's inability to guess h(m') even if h(m) is known for some m not equal m'. We give example applications in which this measure is too weak, and we introduce a stronger measure for the quality of a hash-function family, E-variationally universal, which measures one's inability to distinguish h(m') from a random value even if h(m) is known for some m not equal m'. We explain the utility of this notion and,provide an approach for constructing efficiently computable epsilon-VU hash-function families. (c) 2006 Elsevier B.V. All rights reserved.

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

randomized algorithms
cryptography
universal hashing


3D-GIS in networking environments In this paper, we present a data model for 3D geometry and topology in a 3D-GIS. This data model includes the concept of multiple representations for the same feature. Together with a spatial index, these multiple representations will be used to visualize the 3D-GIS data in a distributed networking environment. The data model and the progressive transmission is tested with an area-wide city model of Darmstadt.

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


Tree coding combined with TDHS for speech coding at 6.4 and 4.8 kbps Tree coding is combined with time domain harmonic scaling (TDHS) for speech coding at 6.4 and 4.8 kbps. In order to improve the robustness to channel errors, new pitch predictor, short-term predictor adaptation and gain adaptation methods are proposed for tree coder. New code trees with appropriate gain adaptation rules, new backward adaptive pitch predictor and robust short-term predictor adaptation algorithms are evaluated for both ideal and noisy channels. Paired comparison listening tests show that the 6.4 kbps coder (2-to-1 TDHS/2 bits/samples tree coding) has speech quality equivalent to 6 bit log-PCM at a sampling rate of 6400 samples/s.

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


Combining evidence with a probabilistic framework for answer ranking and answer merging in question answering Question answering (QA) aims at finding exact answers to a users question from a large collection of documents. Most QA systems combine information retrieval with extraction techniques to identify a set of likely candidates and then utilize some ranking strategy to generate the final answers. This ranking process can be challenging, as it entails identifying the relevant answers amongst many irrelevant ones. This is more challenging in multi-strategy QA, in which multiple answering agents are used to extract answer candidates. As answer candidates come from different agents with different score distributions, how to merge answer candidates plays an important role in answer ranking. In this paper, we propose a unified probabilistic framework which combines multiple evidence to address challenges in answer ranking and answer merging. The hypotheses of the paper are that: (1) the framework effectively combines multiple evidence for identifying answer relevance and their correlation in answer ranking, (2) the framework supports answer merging on answer candidates returned by multiple extraction techniques, (3) the framework can support list questions as well as factoid questions, (4) the framework can be easily applied to a different QA system, and (5) the framework significantly improves performance of a QA system. An extensive set of experiments was done to support our hypotheses and demonstrate the effectiveness of the framework. All of the work substantially extends the preliminary research in Ko et al. (2007a). A probabilistic framework for answer selection in question answering. In: Proceedings of NAACL/HLT.

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

answer ranking
answer merging
question answering


Quantum advantage without entanglement We study the advantage of pure-state quantum computation without entanglement over classical computation. For the Deutsch-Jozsa algorithm we present the maximal subproblem that can be solved without entanglement, and show that the algorithm still has an advantage over the classical ones. We further show that this subproblem is of greater significance, by proving that it contains all the Boolean functions whose quantum phase-oracle is non-entangling. For Simon's and Grover's algorithms we provide simple proofs that no non-trivial subproblems can be solved by these algorithms without entanglement.

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

quantum algorithms
tensor product states
separability


High-dimensional indexing technologies for large scale content-based image retrieval: a review The boom of Internet and multimedia technology leads to the explosion of multimedia information, especially image, which has created an urgent need of quickly retrieving similar and interested images from huge image collections. The content-based high-dimensional indexing mechanism holds the key to achieving this goal by efficiently organizing the content of images and storing them in computer memory. In the past decades, many important developments in high-dimensional image indexing technologies have occurred to cope with the 'curse of dimensionality'. The high-dimensional indexing mechanisms can mainly be divided into three categories: tree-based index, hashing-based index, and visual words based inverted index. In this paper we review the technologies with respect to these three categories of mechanisms, and make several recommendations for future research issues.

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

tree-based index
hashing-based index
bag-of-features (bof)
descriptor encoding


Gear parameter identification in a wind turbine gearbox using vibration signals Fine Tuned Harmonic/Sideband cursor approach for the blind determination of the number of teeth for each gear of a wind turbine. Real life signals taken from a wind turbine. A challenging Wind turbine signal order tracking with no reference tachometer. A Practical Example for understanding the system characteristics through vibration signal.

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

harmonics
sidebands
gear mesh frequency
spectrogram
wind turbines


Mining marketing maps for business alliances A business can strengthen its competitive advantage and increase its market share by forming a strategic alliance. With the help of alliances, businesses can bring to bear significant resources beyond the capabilities of the individual co-operating firms. Thus how to effectively evaluate and select alliance partners is an important task for businesses because a successful corporation partner selection can therefore reduce the possible risk and avoid failure results on business alliance. This paper proposes the Apriori algorithm as a methodology of association rules for data mining, which is implemented for mining marketing map knowledge from customers. Knowledge extraction from marketing maps is illustrated as knowledge patterns and rules in order to propose suggestions for business alliances and possible co-operation solutions. Finally, this study suggests that integration of different research factors, variables, theories, and methods for investigating this research topic of business alliance could improve research results and scope.

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

business alliance
marketing maps
data mining
association rules
knowledge extraction


Two- and higher-dimensional pattern matching in optimal expected time Algorithms with optimal expected running time are presented for searching the occurrences of a two-dimensional m x m pattern P in a two-dimensional n x n text T over an alphabet of size c. The algorithms are based on placing in the text a static grid of test points, determined only by n, m, and c (not dynamically by earlier test results). Using test strings read from the test points the algorithms eliminate as many potential occurrences of P as possible. The remaining potential occurrences are separately checked for actual occurrences. A suitable choice of the test point set leads to algorithms with expected running time O(n(2) log(c) m(2)/m(2)) using the uniform Bernoulli model of randomness. This is shown to be optimal by a generalization of a one-dimensional lower bound result by Yao. Experimental results show that the algorithms are efficient in practice, too. The method is also generalized for the k mismatches problem. The resulting algorithm has expected running time O(kn(2) log(c) m(2)/m(2)), provided that k less than or equal to (mright perpendicularm/inverted right perpendicularlog(c) m(2)inverted left perpendicularleft perpendicular - 1)/2. All algorithms need preprocessing of P which takes time and space O(m(2)). The text processing can be done on-line, using a rather small window. The algorithms easily generalize to d-dimensional matching for any d.

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

multidimensional matching
average case analysis
approximate matching


Moving meshes, conservation laws and least squares equidistribution In this paper a least squares measure of a residual is minimized to move an unstructured triangular mesh into an optimal position, both for the solution of steady systems of conservation laws and for functional approximation. The result minimizes a least squares measure of an equidistribution norm, which is a norm measuring the uniformity of a fluctuation monitor. The minimization is carried out using a steepest descent approach. Shocks are treated using a mesh with degenerate triangles. Results are shown for a steady-scalar advection problem and two flows governed by the Euler equations of gasdynamics. Copyright (C) 2002 John Wiley Sons, Ltd.

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

moving meshes
conservation laws
least squares equidistribution


Social networks and information retrieval, how are they converging? A survey, a taxonomy and an analysis of social information retrieval approaches and platforms A review of the most representative contributions in Social Information Retrieval. A taxonomy to categorize these contributions in order to structure this wide domain. An analysis of some of these contributions and tools with respect to several criteria.

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

social information retrieval
social search
social recommendation


A direct hashing directory for fast inode lookup In a conventional file system, the directory tree is traversed to find the inode number of a file. The mode lookup performance degrades as the size of the directory tree increases. In this letter, a new directory scheme, called direct hashing directory, is proposed. The mode number of a file is the cyclic redundancy code of the file's absolute path name such that the inode number can be computed directly. The average number of disk accesses for inode lookup is 1.08, which is order of magnitude faster than the conventional directory schemes such as hashing, B tree, and sequential directory.

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


DualMAC: A soft handoff mechanism for real-time communications in secured WLANs WLAN has been widely deployed over public and private areas in recent years and has become one of the most popular access technologies for mobile Internet services. Handoffs between WLAN access points (APs) that introduce packet loss and delay during a network session is one of the critical issues for real-time communication services. Unfortunately, most of the previous studies in reducing handoff latency and packet loss in WLANs rely on WLAN infrastructure upgrades, and those solutions suffer from deployment problems in the well-established WLAN hotspots. In this work, a pure station (STA)-side approach which only requires the firmware or software upgrade on WLAN STAs without the enhancements of the WLAN standards and infrastructures is presented. The proposed mechanism developed from a time division duplex concept maintains both connections with the serving and target AP simultaneously using two different medium access control (MAC) addresses. Thus, an STA can perform WLAN association, authentication, security key handshake procedures with the target AP, or further acquires an IP address in a new subnet while transmitting and receiving real-time packets through the serving AP at the same time. Simulation results demonstrate that seamless handoffs for real-time communications in secured WLANs can be easily achieved by the proposed mechanism. (C) 2007 Elsevier B.V. All rights reserved.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 (wlan)
mobility management
real-time communication
voice over ip (voip) over wlan (vowlan)


AN INFORMATION SYSTEM FOR THE SHORTEST ORIGEN-DESTINATION ROUTE IN A TRANSPORTATION NETWORK There exist several information systems to find and display the shortest origin-destination route in a transportation network. Usually these systems are created by organizations purchasing expensive software aiming to build them easily, quickly and correctly. This goal, however, still remains elusive. In this paper, an information system that finds and displays the shortest origin-destination route in a transportation network is presented. The system is mainly built using free software. In the literature, there were found at least three fast algorithms to obtain the shortest route in a given network. From these three, one was selected for being more efficient and less memory consuming according to the experimental analysis carried out. The functionality of the system is showed using Toluca's transportation network, one of the largest cities in Mexico.

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

transportation systems
shortest origin-destination algorithms


A social network-empowered research analytics framework for project selection Traditional approaches for research project selection by government funding agencies mainly focus on the matching of research relevance by keywords or disciplines. Other research relevant information such as social connections (e.g., collaboration and co-authorship) and productivity (e.g., quality, quantity, and citations of published journal articles) of researchers is largely ignored. To overcome these limitations, this paper proposes a social network-empowered research analytics framework (RAF) for research project selections. Scholarmate.com, a professional research social network with easy access to research relevant information, serves as a platform to build researcher profiles from three dimensions, i.e., relevance, productivity and connectivity. Building upon profiles of both proposals and researchers, we develop a unique matching algorithm to assist decision makers (e.g. panel chairs or division managers) in optimizing the assignment of reviewers to research project proposals. The proposed framework is implemented and tested by the largest government funding agency in China to aid the grant proposal evaluation process. The new system generated significant economic benefits including great cost savings and quality improvement in the proposal evaluation process.

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

research project selection
research analytics


Fast approach to the optimal production/PM policy We study the economical manufacturing quality (EMQ) problem in the presence of an imperfect process. When the production process goes out of control, the production process produces some proportion of defective items. Thus, lot sizing and periodic inspection of the process are needed to operate the system economically. Performing a preventive maintenance (PM) action immediately after inspection and possible adjustment of the production process will be helpful to enhance the process reliability of a deteriorating production system; thus, an EMQ model for inspection/PM was proposed in the literature. However, it is not easy to derive the optimal lot sizing and inspection/PM policy simultaneously. Therefore, a two-dimensional search procedure is needed to find the optimal production/PM scheme. In this paper, we study the structural properties of the production/PM problem and show the uniqueness of the optimal inspection interval for a given number of inspections in a production run. To solve the production/PM problem, we provide lower and upper bounds for the optimal inspection interval when the number of inspections is given during a production run and use them to reduce the search ranges in a numerical solution procedure. Also, a criterion for stopping the process of searching for the optimal production/PM policy is provided. (C) 2000 Elsevier Science Ltd. All rights reserved.

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


Trellis decoding complexity of linear block codes In this partially tutorial paper, we examine minimal trellis representations of linear block codes and analyze several measures of trellis complexity: maximum state and edge dimensions, total span length, and total vertices, edges and mergers. We obtain bounds on these complexities as extensions of well-known dimension/length profile (DLP) bounds, Codes meeting these bounds minimize all the complexity measures simultaneously; conversely, a code attaining the bound for total span length, vertices, or edges, must likewise attain it for all the others, We define a notion of ''uniform'' optimality that embraces different domains of optimization, such as different permutations of a code or different codes with the same parameters, and we give examples of uniformly optimal codes and permutations, We also give some conditions that identify certain cases when no code or permutation can meet the bounds, In addition to DLP-based bounds, we derive new inequalities relating one complexity measure to another, which can be used in conjunction with known. bounds on one measure to imply bounds on the others, As an application, we infer new bounds on maximum state and edge complexity and on total vertices and edges from bounds on span lengths.

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

decoding complexity
minimal trellises
dimension/length profiles


The ClasSi coefficient for the evaluation of ranking quality in the presence of class similarities Evaluation measures play an important role in the design of new approaches, and often quality is measured by assessing the relevance of the obtained result set. While many evaluation measures based on precision/recall are based on a binary relevance model, ranking correlation coefficients are better suited for multi-class problems. State-of-the-art ranking correlation coefficients like Kendall's tau and Spearman's rho do not allow the user to specify similarities between differing object classes and thus treat the transposition of objects from similar classes the same way as that of objects from dissimilar classes. We propose ClasSi, a new ranking correlation coefficient which deals with class label rankings and employs a class distance function to model the similarities between the classes. We also introduce a graphical representation of ClasSi which describes how the correlation evolves throughout the ranking.

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


combining learn-based and lexicon-based techniques for sentiment detection without using labeled examples In this work, we propose a novel scheme for sentiment classification (without labeled examples) which combines the strengths of both "learn-based" and "lexicon-based" approaches as follows: we first use a lexicon-based technique to label a portion of informative examples from given task (or domain); then learn a new supervised classifier based on these labeled ones; finally apply this classifier to the task. The experimental results indicate that proposed scheme could dramatically outperform "learn-based" and "lexicon-based" techniques.

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


synthesis of network delays for voice packets in service overlay networks Toll quality Voice-over-IP (VoIP) provision over Service Overlay Networks (SONs) is still a big challenge for the current best-effort Internet. The end to end network delay, as one of the most important performance concerns, is the focus in this paper. In the paper, network delay characteristics, e.g. probability distribution and autocorrelation are studied. We propose an approach to synthesize network delay traces for QoS routing research in a full mesh Service Overlay Network(SON) given only partial information of the network delay trace. The main contributions of the paper include: 1) A parametric model of the network delay; 2) Method to synthesize network delay traces for voice packets sent over SONs. The synthesized network delay traces are shown to be close to real network delay traces. The synthetic network delay traces can be used to study quality of service provision mechanisms for VoIP applications over the Service Overlay Networks.

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

service overlay network
voice-over-ip
internet delay


Nontrivial solutions for higher order multi-point boundary value problems In the case where a nonlinearity may change sign and contains higher derivatives, we consider the existence of nontrivial solutions for a class of higher order multi-point boundary value problems. Some sufficient conditions for the existence of nontrivial solutions are established under certain suitable growth conditions, our proof is based on LeraySchauder nonlinear alternative.

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

nontrivial solutions
lerayschauder nonlinear alternative

multi-point boundary value problems
fixed point


Stability and convergence analysis of a dynamics-based collective method for random sphere packing The simulation of granular materials requires an initial overlap-free packing of spherical particles at high volume packing fractions. In previous work, a dynamics-based collective approach, the Quasi-Dynamics Method (QDM), has been proposed to generate densely distributed spheres in an enclosed container. However, the stability and efficiency of the QDM were not fully addressed. In this paper, the algorithm is reformulated with two control parameters and the impact of these parameters on the algorithm performance is investigated. First, theoretical analyses and numerical verifications for extreme 1-D/2-D packing systems are conducted and the range of the control parameters in which the algorithm is convergent is analytically determined. Then, the analysis is extended to 3-D packing systems and the estimation of the parameter range is verified numerically. Finally, the algorithm is applied to modeling a cylindrical 3-D packing system and the convergence performance at different volume packing fractions is studied. Results show that the QDM is highly efficient in packing spheres at volume packing fractions that are close to the random close packing limit.

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

granular material
quasi-dynamics method
stability analysis
convergence rate
packing fraction distribution


Optimization of the V-T-control method for low-power ultra-thin double-gate SOI logic circuits Application of the V-T-control method is studied in ultra-thin double-gate (DG) SOI inverter, as the simplest building block of SOI logic circuits. Two control voltages, V-CN and V-CP, are applied to the back-gates of the n- and p-type transistors, respectively, to reduce the leakage current when the inverter is in the idle mode. Simulations with DESSIS disclose that both control voltages may be set at an optimum value for a given circuit activity, leading to the lowest possible gate power-delay product. Simulations have been performed for 10 nm gate-length technology at the end of the ITRS roadmap. These results indicate that the optimized V-T-control method is a promising way for realizing low-power SOI logic circuits. Furthermore, the scalability of this technique is verified by extending the simulations to other generations of the ITRS roadmap. (C) 2004 Elsevier B.V. All rights reserved.

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

dynamic threshold voltage
double-gate soi
low-power


The combination of self-organizing feature maps and support vector regression for solving the inverse ECG problem Noninvasive electrical imaging of the heart aims to quantitatively reconstruct transmembrane potentials (TMPs) from body surface potentials (BSPs), which is a typical inverse problem. Classically, electrocardiography (ECG) inverse problem is solved by regularization techniques. In this study, it is treated as a regression problem with multi-inputs (BSPs) and multi-outputs (TMPs). Then the resultant regression problem is solved by a hybrid method, which combines the support vector regression (SVR) method with self-organizing feature map (SOFM) techniques. The hybrid SOFMSVR method conducts a two-step process: SOFM algorithm is used to cluster the training samples and the individual SVR method is employed to construct the regression model. For each testing sample, the cluster operation can effectively improve the efficiency of the regression algorithm, and also helps the setup of the corresponding SVR model for the TMPs reconstruction. The performance of the developed SOFMSVR model is tested using our previously developed realistic heart-torso model. The experiment results show that, compared with traditional single SVR method in solving the inverse ECG problem, the proposed method can reduce the cost of training time and improve the reconstruction accuracy in solving the inverse ECG problem.

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

support vector regression
inverse ecg problem

self-organizing feature map
transmembrane potentials (tmps)


Hepatitis disease diagnosis using a novel hybrid method based on support vector machine and simulated annealing (SVM-SA) In this study, diagnosis of hepatitis disease, which is a very common and important disease, is conducted with a machine learning method. We have proposed a novel machine learning method that hybridizes support vector machine (SVM) and simulated annealing (SA). Simulated annealing is a stochastic method currently in wide use for difficult optimization problems. Intensively explored support vector machine due to its several unique advantages is successfully verified as a predicting method in recent years. We take the dataset used in our study from the UCI machine learning database. The classification accuracy is obtained via 10-fold cross validation. The obtained classification accuracy of our method is 96.25% and it is very promising with regard to the other classification methods in the literature for this problem.

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

machine learning approach
parameters tuning


scheme-based web programming as a basis for a cs0 curriculum The thesis of this paper is that Scheme-based web programming is a worthy organizing topic for CS0 computer literacy courses. We describe an approach to introducing non-science majors to Computer Science by teaching them to write webpages using HTML and CSS and to also write applets and servlets using Scheme. The programming component of our approach is completed in about nine weeks of a thirteen week course, leaving time for a treatment of more traditional CS0 topics such as intellectual property, privacy, artificial intelligence, the limits of computability, PC architecture, Operating Systems, CMOS and logic circuits. We argue that the use of a high level scripting language (like Scheme) is essential to the success of this approach. We also argue that wide scale success in teaching web programming to non-majors could enhance the students productivity when they enter the job market, and hence this approach deserves further study.

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

curriculum scheme applets html css servlets


Predicting business failure using multiple case-based reasoning combined with support vector machine Financial distress prediction of business institutions is a long cherished topic concentrating on reducing loss of the society. Case-based reasoning (CBR) is an easily understandable methodology for problem solving. Support vector machine (SVM) is a new technology developed recently with high classification performance. Combining-classifiers system is capable of taking advantages of various single techniques to produce high performance. In this research, we develop a new combining-classifiers system for financial distress prediction, where four independent CBR systems with k-nearest neighbor (KNN) algorithms are employed as classifiers to be combined, and SVM is utilized as the algorithm fulfilling combining-classifiers. The new combining-classifiers system is named as Multiple CBR systems by SVM (Multi-CBRSVM). The four CBR systems, respectively, are found on similarity measure on the basis of Euclidean distance metric, Manhattan distance metric, Grey coefficient metric, and Outranking relation metric. Outputs of independent CBRs are transferred as inputs of SVM to carry out combination. How to implement the combining-classifiers system with collected data is illustrated in detail. In the experiment, 83 pairs of sample companies in health and distress from Shanghai and Shenzhen Stock Exchange were collected, the technique of grid-search was utilized to get optimal parameters, leave-one-out cross-validation (LOO-CV) was used as assessment in parameter optimization, and predictive performances on 30-times hold-out data were used to make comparisons among Multi-CBRSVM, its components and statistical models. Empirical results have indicated that Multi-CBRSVM is feasible and validated for listed companies business failure prediction in China.

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

business failure prediction
support vector machine

multiple case-based reasoning
combining-classifiers
chinese listed companies


An adaptive algorithm for blind MMSE equalization of SIMO channels In this paper, a new adaptive method is proposed to estimate blind minimum mean-square error equalizer with arbitrary delay of single-input-multiple-output channel. By using a recursive least-square-similar algorithm to recursively update a correlation matrix and its pseudo-inverse, the proposed algorithm ensures convergence and is not sensitive to the initialization of its parameters. Compared with other batch-type approaches, the new adaptive method does not require to compute the pseudo-inverse or singular value decomposition directly, consequently does not need rank estimation nor channel order estimation. Furthermore, the fast convergence enables the proposed method to be used in real time communication applications. Simulation results are provided to demonstrate the performance of the proposed method.

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


Pure Type Systems with Corecursion on Streams From Finite to Infinitary Normalisation In this paper, we use types for ensuring that programs involving streams are well-behaved. We extend pure type systems with a type constructor for streams, a modal operator next and a fixed point operator for expressing corecursion. This extension is called Pure Type Systems with Corecursion (CoPTS). The typed lambda calculus for reactive programs defined by Krishnaswami and Benton can be obtained as a CoPTS. CoPTSs allow us to study a wide range of typed lambda calculi extended with corecursion using only one framework. In particular, we study this extension for the calculus of constructions which is the underlying formal language of Coq. We use the machinery of infinitary rewriting and formalise the idea of well-behaved programs using the concept of infinitary normalisation. The set of finite and infinite terms is defined as a metric completion. We establish a precise connection between the modal operator (center dot A) and the metric at a syntactic level by relating a variable of type (center dot A) with the depth of all its occurrences in a term. This syntactic connection between the modal operator and the depth is the key to the proofs of infinitary weak and strong normalisation.

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

typed lambda calculus
modal operator
streams
infinitary normalisation


Multi-objective genetic algorithm for single machine scheduling problem under fuzziness This paper presents a new multi-objective approach to a single machine scheduling problem in the presence of uncertainty. The uncertain parameters under consideration are due dates of jobs. They are modelled by fuzzy sets where membership degrees represent decision maker's satisfaction grade with respect to the jobs' completion times. The two objectives defined are to minimise the maximum and the average tardiness of the jobs. Due to fuzziness in the due dates, the two objectives become fuzzy too. In order to find a job schedule that maximises the aggregated satisfaction grade of the objectives, a hybrid algorithm that combines a multi-objective genetic algorithm with local search is developed. The algorithm is applied to solve a real-life problem of a manufacturing pottery company.

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

single machine scheduling
fuzzy sets
local search

multi-objective optimisation
genetic algorithms


cluster-based navigation for a virtual museum The Virtual Museum of the Pacific (VMP) is designed around the use of Formal Concept Analysis [4] to organize digital library content. It creates an associative network based on semantic themes according to a museological view of content. The system allows the extensible creation of new views, the addition of new attributes and contains a social tagging interface that encourages the Museum's stakeholders to annotate content and build custom views of the collection according to their communities of 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

semi-structured information retrieval
semantic web application
rich internet application
domain-specific ir
data provenance
user experience (interfaces)
information integration
classification and clustering
social media


The distribution of the probability mass of biconic copulas We study the probability mass distribution of biconic copulas, provide a counterexample to a result given in Jwaid etal. (2012) [29] concerning a characterization of singular biconic copulas, and provide a new one.

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


Restarts and exponential acceleration of the Davis-Putnam-Loveland-Logemann algorithm: A large deviation analysis of the generalized unit clause heuristic for random 3-SAT An analysis of the hardness of resolution of random 3-SAT instances using the Davis Putnam - Loveland - Logemann (DPLL) algorithm slightly below threshold is presented. While finding a solution for such instances demands exponential effort with high probability, we show that an exponentially small fraction of resolutions require a computation scaling linearly in the size of the instance only. We compute analytically this exponentially small probability of easy resolutions from a large deviation analysis of DPLL with the Generalized Unit Clause search heuristic, and show that the corresponding exponent is smaller ( in absolute value) than the growth exponent of the typical resolution time. Our study therefore gives some quantitative basis to heuristic restart solving procedures, and suggests a natural cut-off cost ( the size of the instance) for the restart.

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


Trading Regret for Efficiency: Online Convex Optimization with Long Term Constraints In this paper we propose efficient algorithms for solving constrained online convex optimization problems. Our motivation stems from the observation that most algorithms proposed for online convex optimization require a projection onto the convex set K from which the decisions are made. While the projection is straightforward for simple shapes (e.g., Euclidean ball), for arbitrary complex sets it is the main computational challenge and may be inefficient in practice. In this paper, we consider an alternative online convex optimization problem. Instead of requiring that decisions belong to K for all rounds, we only require that the constraints, which define the set K, be satisfied in the long run. By turning the problem into an online convex-concave optimization problem, we propose an efficient algorithm which achieves O(root T) regret bound and O(T-3/4) bound on the violation of constraints. Then, we modify the algorithm in order to guarantee that the constraints are satisfied in the long run. This gain is achieved at the price of getting O(T-3/4) regret bound. Our second algorithm is based on the mirror prox method (Nemirovski, 2005) to solve variational inequalities which achieves O(T-2/3) bound for both regret and the violation of constraints when the domain K can be described by a finite number of linear constraints. Finally, we extend the results to the setting where we only have partial access to the convex set K and propose a multipoint bandit feedback algorithm with the same bounds in expectation as our first algorithm.

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

online convex optimization
bandit feedback

convex-concave optimization
variational inequality


A full Eulerian finite difference approach for solving fluid-structure coupling problems A new simulation method for solving fluid-structure coupling problems has been developed. All the basic equations are numerically solved on a fixed Cartesian grid using a finite difference scheme. A volume-of-fluid formulation [Hirt, Nichols, J. Comput. Phys. 39 (1981) 201], which has been widely used for multiphase flow simulations, is applied to describing the multi-component geometry. The temporal change in the solid deformation is described in the Eulerian frame by updating a left Cauchy-Green deformation tensor, which is used to express constitutive equations for nonlinear Mooney-Rivlin materials. In this paper, various verifications and validations of the present full Eulerian method, which solves the fluid and solid motions on a fixed grid, are demonstrated, and the numerical accuracy involved in the fluid-structure coupling problems is examined. (C) 2010 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

fluid-structure interaction
finite difference method
eulerian formulation
volume-of-fluid
hyperelastic material