A control structure for PWM-controlled static synchronous compensators under unbalanced conditions and grid faults The VSC-based STATCOM are sensitive to the unbalanced grid. Keep the VSC-based STATCOM online under the unbalanced condition. Limiting the negative sequence current. No need to redesign/overdesign of the converter power components. Performance verified by simulation and Hardware-In-the-Loop test.

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

pwm-controlled statcom
ac-system fault
voltage regulation


causality representation and cancellation mechanism in time warp simulations The Time Warp synchronization protocol allows causality errors and then recovers from them with the assistance of a cancellation mechanism. Cancellation can cause the rollback of several other simulation objects that may trigger a cascading rollback situation where the rollback cycles back to the original simulation object. These cycles of rollback can cause the simulation to enter a unstable (or thrashing) state where little real forward simulation progress is achieved. To address this problem, knowledge of causal relations between events can be used during cancellation to avoid cascading rollbacks and to initiate early recovery operations from causality errors. In this paper, we describe a logical time representation for Time Warp simulations that is used to disseminate causality information. The new timestamp representation, called Total Clocks, has two components: (i) a virtual time component, and (ii) a vector of event counters similar to Vector clocks. The virtual time component provides a one dimensional global simulation time, and the vector of event counters records event processing rates by the simulation objects. This time representation allows us to disseminate causality information during event execution that can be used to allow early recovery during cancellation. We propose a cancellation mechanism using Total Clocks that avoids cascading rollbacks in Time Warp simulations that have FIFO communication channels .

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

virtual time
vector clocks
time warp
logical time


HIGH-PRECISION BIO-MOLECULAR EVENT EXTRACTION FROM TEXT USING PARALLEL BINARY CLASSIFIERS We have developed a machine learning framework to accurately extract complex genetic interactions from text. Employing type-specific classifiers, this framework processes research articles to extract various biological events. Subsequently, the algorithm identifies regulation events that take other events as arguments, allowing a nested structure of predictions. All predictions are merged into an integrated network, useful for visualization and for deduction of new biological knowledge.

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


Location discovery in Wireless Sensor Networks using metaheuristics Wireless Sensor Networks (WSN) monitor the physical world using small wireless devices known as sensor nodes, with high precision and in real time, without the intervention of a human operator. Location information plays a critical role in many of the applications where WSN are used. Though a simple and effective solution could be to equip every node with self-locating hardware such as a GPS, the resulting cost renders such a solution unefficient. A widely used self-locating mechanism consists in equipping a small subset of the nodes with some GPS-like hardware, while the rest of the nodes employ reference estimations (received signal strength, time-of-arrival, etc.) in order to determine their locations. The task of determining the node locations using node-to-node distances combined with a set of known node locations is referred to as location discovery (LD). The main difficulty found in LD is the presence of distance estimation errors, which result in node positioning errors. We describe in this work an error model for the estimations, and propose a two-stage search procedure that combines minimization of an error norm function with maximization of a maximum likelihood function to solve the problem. We perform an empirical study of the performance of several variants of the guiding functions, and several metaheuristics used to solve real LD problem instances. Finally, we test our proposed technique against the single phase techniques in order to evaluate its performance. (C) 2010 Elsevier B.V. All rights reserved.

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

wireless sensor networks
location discovery
metaheuristics


Approximation of the objective function: multiquadrics versus neural networks Global optimization in electrical engineering using stochastic methods requires usually a large amount of CPU time to locate the optimum, if the objective function is calculated either with the finite element method (FEM) or the boundary element method (BEM). One approach to reduce the number of FEM or BEM calls using neural networks and another one using multiquadric functions have been introduced recently. This paper compares the efficiency of both methods, which are applied to a couple of test problems and the results are discussed.

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


Non-negativity and dependence constrained sparse coding for image classification ? Non-negative dictionary is learnt with localized, bandpass and oriented attributes. Graph Laplacian is used to take the dependence relationship among local features. Along with spatial pooling method, the proposed framework is extended to BoW model.

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

graph laplacian
sparse coding
image classification

non-negative matrix factorization
dictionary learning
spatial pyramid
parameter selection
sparseness


exploring bimanual camera control and object manipulation in 3d graphics interfaces We explore the use of the non-dominant hand to control a virtual camera while the dominant hand performs other tasks in a virtual 3D scene. Two experiments and an informal study are presented which evaluate this interaction style by comparing it to the status-quo unimanual interaction. In the first experiment, we find that for a target selection task, performance using the bimanual technique was 20\% faster. Experiment 2 compared performance in a more complicated object docking task. Performance advantages are shown, however, only after practice. Free-form 3D painting was explored in the user study. In both experiments and in the user study participants strongly preferred the bimanual technique. The results also indicate that user preferences concerning bimanual interaction may be driven by factors other than simple time-motion performance advantages.

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

task use performance object interfaces graphics informal control interaction 3d manipulation

interaction styles
experience
timing
interaction techniques
practical
empirical evaluation
motion
exploration
bimanual input
select
3d interfaces
user preference
paint
factor
camera control
virtualization
user studies


Link-level measurements from an 802.11b mesh network This paper analyzes the causes of packet loss in a 38-node urban multi-hop 802.11b network. The patterns and causes of loss are important in the design of routing and error-correction protocols, as well as in network planning. The paper makes the following observations. The distribution of inter-node loss rates is relatively uniform over the whole range of loss rates; there is no clear threshold separating "in range" and "out of range." Most links have relatively stable loss rates from one second to the next, though a small minority have very bursty losses at that time scale. Signal-to-noise ratio and distance have little predictive value for loss rate. The large number of links with intermediate loss rates is probably due to multi-path fading rather than attenuation or interference. The phenomena discussed here are all well-known. The contributions of this paper are an understanding of their relative importance, of how they interact, and of the implications for MAC and routing protocol design.

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


The encoding complexity of network coding In the multicast network coding problem, a source s needs to deliver h packets to a set of k terminals over an underlying communication network G. The nodes of the multicast network can be broadly categorized into two groups. The first group incudes encoding nodes, i.e., nodes that generate new packets by combining data received from two or more incoming links. The second group includes forwarding nodes that can only duplicate and forward the incoming packets. Encoding nodes are, in general, more expensive due to the need to equip them with encoding capabilities. In addition, encoding nodes incur delay and increase the overall complexity of the network. Accordingly, in this paper, we study the design of multicast coding networks with a limited number of encoding nodes. We prove that in a directed acyclic coding network, the number of encoding nodes required to achieve the capacity of the network is bounded by h(3)k(2). Namely, we present (efficiently constructible) network codes that achieve capacity in which the total number of encoding nodes is independent of the size of the network and is bounded by MO. We show that the number of encoding nodes may depend both on h and k by presenting acyclic coding networks that require Omega(h(2)k) encoding nodes. In the general case of coding networks with cycles, we show that the number of encoding nodes is limited by the size of the minimum feedback link set, i.e., the minimum number of links that must be removed from the network in order to eliminate cycles. We prove that the number of encoding nodes is bounded by (2B + 1)h(3)k(2), where B is the minimum size of a feedback link set. Finally, we observe that determining or even crudely approximating the minimum number of required encoding nodes is an NP-hard problem.

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

coding networks
encoding nodes
multicast
network coding


Some remarks on the problem of model matching by state feedback The problem of model matching by state feedback is reconsidered and some of the latest results are discussed.

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


Exploring the spectrum of dynamical regimes and timescales in spontaneous cortical activity Rhythms at slow (<1Hz) frequency of alternating Up and Down states occur during slow-wave sleep states, under deep anaesthesia and in cortical slices of mammals maintained in vitro. Such spontaneous oscillations result from the interplay between network reverberations nonlinearly sustained by a strong synaptic coupling and a fatigue mechanism inhibiting the neurons firing in an activity-dependent manner. Varying pharmacologically the excitability level of brain slices we exploit the network dynamics underlying slow rhythms, uncovering an intrinsic anticorrelation between Up and Down state durations. Besides, a non-monotonic change of Down state duration is also observed, which shrinks the distribution of the accessible frequencies of the slow rhythms. Attractor dynamics with activity-dependent self-inhibition predicts a similar trend even when the system excitability is reduced, because of a stability loss of Up and Down states. Hence, such cortical rhythms tend to display a maximal size of the distribution of Up/Down frequencies, envisaging the location of the system dynamics on a critical boundary of the parameter space. This would be an optimal solution for the system in order to display a wide spectrum of dynamical regimes and timescales.

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

slow oscillations
mean-field theory
if neuron networks
bifurcation analysis
relaxation oscillators


On Constructing Minimal Formulae Given a Boolean propositional formula, phi(X(n)) over the basis Omega = {boolean AND, boolean OR, ->}, we consider the following decision problem: is there a subset of literals, S, for which phi(X(n)) equivalent to boolean AND(gamma is an element of S) y or phi(X(n)) equivalent to boolean OR(gamma is an element of S) y? We prove that the 'obvious' Sigma(p)(2) upper bound is suboptimal and that the problem is decidable in P(parallel to)(NP) the class of languages decidable by polynomial time methods allowed to make non-adaptive quer| i| es to an np oracle. We further show that the associated function problem of computing a witnessing such subset when one exists can be solved in FP(parallel to)(NP).

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

boolean formulae
minimum equivalent expression problem
non-adaptive np oracle computations
graph-based algorithms


Foundational contributions of K. Asai and H. Tanaka to fuzzy optimization The first researchers to publish an operationalization of the Bellman and Zadeh's original approach to Decision making in a fuzzy environment [1] were H. Tanaka and K. Asai in their 1973 article [2] which was published in English in 1974 [3]. These two researchers developed many fundamental theories and methods including novel concepts of fuzzy operations research [4] with their collaborators. They went beyond the original proposal for fuzzy optimization set forth by Bellman/Zadeh. They are important founders of fuzzy optimization. This paper gives an overview of their great contributions to fuzzy optimization.

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

fuzzy linear programming
possibility theory
fuzzy number


Algorithms for Context Based Sequential Pattern Mining This paper describes practical aspects of a novel approach to the sequential pattern mining named Context Based Sequential Pattern Mining (CBSPM). It introduces a novel ContextMapping algorithm used for the context pattern mining and an illustrative example showing some advantages of the proposed method. The approach presented here takes into consideration some shortcomings of the classic problem of the sequential pattern mining. The significant advantage of the classic sequential patterns mining is simplicity. It introduces simple element construction, built upon set of atomic items. The comparison of sequence's elements utilizes simple inclusion of sets. But many practical problems like web event mining, monitoring, tracking and rules generation often require mining more complex data. The CBSPM takes into account non nominal attributes and similarity of sequence's elements. An approach described here extends traditional problem adding a vector of context attributes of any kind to sequences and sequences elements. Context vectors contain details about sequence's and element's origin. The mining process results in context patterns containing additional, valuable context information useful in interpretation of patterns origin.

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

knowledge discovery
events mining
context pattems
context mapping


malware detection using adaptive data compression A popular approach in current commercial anti-malware software detects malicious programs by searching in the code of programs for scan strings that are byte sequences indicative of malicious code. The scan strings, also known as the signatures of existing malware, are extracted by malware analysts from known malware samples, and stored in a database often referred to as a virus dictionary. This process often involves a significant amount of human efforts. In addition, there are two major limitations in this technique. First, not all malicious programs have bit patterns that are evidence of their malicious nature. Therefore, some malware is not recorded in the virus dictionary and can not be detected through signature matching. Second, searching for specific bit patterns will not work on malware that can take many forms--obfuscated malware. Signature matching has been shown to be incapable of identifying new malware patterns and fails to recognize obfuscated malware. This paper presents a malware detection technique that discovers malware by means of a learning engine trained on a set of malware instances and a set of benign code instances. The learning engine uses an adaptive data compression model--prediction by partial matching (PPM)--to build two compression models, one from the malware instances and the other from the benign code instances. A code instance is classified, either as "malware" or "benign", by minimizing its estimated cross entropy. Our preliminary results are very promising. We achieved about 0.94 true positive rate with as low as 0.016 false positive rate. Our experiments also demonstrate that this technique can effectively detect unknown and obfuscated malware.

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

machine learning
statistical data compression


An n log n algorithm for hyper-minimizing a (minimized) deterministic automaton We improve a recent result [A. Badr, Hyper-minimization in O(n(2)), Internat. J. Found. Comput. Sci. 20 (4) (2009) 735-746] for hyper-minimized finite automata. Namely, we present an O(n log n) algorithm that computes for a given deterministic finite automaton (dfa) an almost-equivalent dfa that is as small as possible such an automaton is called hyper-minimal. Here two finite automata are almost-equivalent if and only if the symmetric difference of their languages is finite. In other words, two almost-equivalent automata disagree on acceptance on finitely many inputs. In this way, we solve an open problem stated in [A. Badr, V. Geffert, I. Shipman, Hyper-minimizing minimized deterministic finite state automata, RAIRO Theor. Inf. Appl. 43 (1) (2009) 69-94] and by Badr. Moreover, we show that minimization linearly reduces to hyper-minimization, which shows that the time-bound 0(n log n) is optimal for hyper-minimization. Independently, similar results were obtained in [P. Gawrychowski, A. Jez, Hyper-minimisation made efficient, in: Proc. 34th Int. Symp. Mathematical Foundations of Computer Science, in: LNCS, vol. 5734, Springer, 2009, pp. 356-368]. (C) 2010 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 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 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

deterministic finite automaton
minimization


Measurement of femoral neck anteversion in 3D. Part 1: 3D imaging method Femoral neck anteversion is the torsion of the femoral head with reference to the distal femur. Conventional methods that use cross-sectional computed tomography (CT) magnetic resonance or ultrasound images to estimate femoral anteversion have met with several problems owing to the complex, three-dimensional (3D) structure of the femur. These problems include not only the difficulty of defining the direction of the femoral neck axis and condylar line but also the dependency upon patient positioning. In particular, the femoral neck axis, the direction of the femoral head, known as the major source of error, is difficult to determine from either a single or several two-dimensional (2D) cross-sectional images. A new method has been devised for the measurement of femoral anteversion using the 3D imaging technique. 3D reconstructed CT images from the femoral head and trochanter to the distal femur are used to measure the anteversion. It is necessary to remove the soft tissue from the CT images and extract just the bone part: Then, the femoral anteversion is measured from a computer-rendered femur image. The 3D imaging method is compared with both the conventional 2D method and the physical method using 20 dried femurs. For the physical method, which is used as a reference valve, a special apparatus is devised. The average difference between the results of the physical method and those of the 2D CT method is 5.33 degrees. The average difference between the results of the physical method and those of the 3D imaging method is 0.45 degrees Seventy-four patients, who suffer from foe-in-gait disease, are tested to compare the 3D imaging method with the conventional 2D CT method. The average difference between the 2D and 3D methods is 8.6 degrees, and the standard is 7.43 degrees. This method provides a very accurate and reliable measurement of femoral anteversion, as it is virtually equivalent to the direct measurement of bisected dried femur in vitro.

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

femoral anteversion
3d imaging
measurement


CFD analysis of single-phase flows inside helically coiled tubes It has been well established that heat transfer in a helical coil is higher than that in a corresponding straight pipe However, the detailed characteristics of fluid flow and heat transfer inside helical coil is not available from the present literature This paper brings out clearly the variation of local Nusselt number along the length and circumference at the wall of a helical pipe. Movement of fluid particles in a helical pipe has been traced CFD simulations are carried out for vertically oriented helical coils by varying coil parameters such as (i) pitch circle diameter, (ii) tube pitch and (iii) pipe diameter and their influence on heat transfer has been studied. After establishing influence of these parameters, correlations for prediction of Nusselt number has been developed. A correlation to predict the local values of Nusselt number as a function of angular location of the point is also presented (C) 2009 Elsevier Ltd. All rights reserved.

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

computational fluid dynamics (cfd)
fluid mechanics
numerical analysis
mathematical modelling


Tracking nonrigid motion and structure from 2D satellite cloud images without correspondences Tracking both structure and motion of nonrigid objects from monocular images is an important problem in vision. In this paper, a hierarchical method which integrates local analysis (that recovers small details) and global analysis (that appropriately limits possible nonrigid behaviors) is developed to recover dense depth values and nonrigid motion from a sequence of 2D satellite cloud images without any prior knowledge of point correspondences. This problem is challenging not only due to the absence of correspondence information but also due to the lack of depth cues in the 2D cloud images (scaled orthographic projection). In our method, the cloud images are segmented into several small regions and local analysis is performed for each region. A recursive algorithm is proposed to integrate local analysis with appropriate global fluid model constraints, based on which a structure and motion analysis system, SMAS, is developed. We believe that this is the first reported system in estimating dense structure and nonrigid motion under scaled orthographic views using fluid model constraints. Experiments on cloud image sequences captured by meteorological satellites (GOES-8 and GOES-9) have been performed using our system, along with their validation and analyses. Both structure and 3D motion correspondences are estimated to subpixel accuracy. Our results are very encouraging and have many potential applications in earth and space sciences, especially in cloud models for weather prediction.

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

structure estimation
image motion estimation
fluid models


dynamic simplicial meshes Dynamic simplicial meshes will enable real time unconstrained deformation of triangular and tetrahedral meshes regardless of topological limitations, by means of combining a quality measure with complex topological operations and smoothing techniques, which automatically improve and maintain the quality of the mesh, aiming at mesh and geometry processing applications.

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

quality measure
unconstrained deformation

topology processing
dynamic meshes
mesh optimization


QueryGen: Semantic interpretation of keyword queries over heterogeneous information systems In the last years, users have become used to keyword-based search interfaces due to their ease of use. By matching input keywords against huge amounts of textual information and labeled multimedia files, current search engines satisfy most of users information needs. However, the principal problem of this kind of search is the semantic gap between the input and the real user need, as keywords are a simplification of the query intended by the user. Moreover, different users could use the same set of keywords to search different information; even the same user could do it at different times. The search system, before accessing any data, should discover first the intended semantics behind the user keywords, in order to return only data fulfilling such semantics. The use of formal query languages is not an option for non-expert users, so a semantic keyword-based search based on semantic interpretation of keyword queries could be the solution, i.e., a search that starts discovering the semantics intended for the input user keywords, and then only data relevant to that semantics are returned as answer. In this paper we present a system that performs semantic keyword interpretation on different data repositories. Our system (1) discovers the meaning of the input keywords by consulting a generic pool of ontologies and applying different disambiguation techniques; (2) once the meaning of each keyword has been established, the system combines them in a formal query that captures the semantics intended by the user, considering different formal query languages and possibilities that could arise, but avoiding inconsistent and semantically equivalent queries; and, finally, (3) after the user has validated the generated query that best fits her/his intended meaning, the system routes the query to the appropriate data repositories that will retrieve data according to the semantics of such a query. Experimental results show the semantic interpretation capabilities and the feasibility of our approach.

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

semantic keyword interpretation
ontologies

semantic search
semantic web
knowledge discovery


Coordinated design of probabilistic PSS and SVC damping controllers This paper presents an application of probabilistic theory to the coordinated design of power system stabilizers (PSSs) and FACTS controllers, taking static VAr system (SVC) as an example. The aim is to enhance the damping of multi electro-mechanical modes in a multimachine system over a large and pre-specified set of operating conditions. In this work, conventional eigenvalue analysis is extended to the probabilistic environment in which the statistical nature of eigenvalues corresponding to different operating conditions is described by their expectations and variances. Probabilistic sensitivity indices (PSIs) are used for robust damping controller site selection and for optimization objective functions. A probabilistic eigenvalue-based objective function is employed for coordinated design of PSS and SVC controller parameters. The effectiveness of the proposed controllers is demonstrated on an 8-machine system.

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

eigenvalue sensitivity
probabilistic method


Mind and paradox: paradoxes depend on minds Paradoxes are mind-dependent in a number of ways. First, by definition, paradoxes offer surprises or apparent contradictions. Since surprise and appearance rely on subjective psychological reactions, paradoxes rely on psychological events. Second, propositional versions of the liar paradox must eventually appeal to sentences if they are to achieve traction, yet sentential versions of the liar paradox rely on language and hence on mentality. Third, belief paradoxes such as B, "No one believes B", transparently hinge on the existence of mental states. (Belief paradoxes extending work by Burge, Buridan, Grim, Sainsbury, and Sorensen demonstrate a fundamental limitation on all cognitive systems: that none can hold all and only truths.) Finally, it is argued that belief paradoxes, like liar paradoxes, arise from the nature of semantic representation.

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

incompleteness
blindspot
belief paradox
epistemic paradox
semantic paradox
anti-realism


Aspects concerning the use of biosensors for process control: experimental and simulation investigations Modeling, optimization and control techniques are indicated to improve the productivity, yield and efficiency of biotechnological processes. The availability of on-line measurements of the state variables plays an important role in the application of these techniques. The most common measurements are pH, temperature, dissolved oxygen, CO2, among others. However, it is also necessary to measure substrate and product concentrations efficiently. Biosensors can be used for that purpose. This paper investigates the use of biosensors-coupled with 'flow injection analysis' (FIA)-for process control. The experimental use of an enzymatic lactose biosensor in a real fermentation media is described. The nonlinear nature of the biosensor is illustrated and modeling approaches of these systems are introduced with the objective of providing tools for the optimization of the process. (C) 2003 Elsevier Science Ltd. All rights reserved.

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

biosensor
flow injection analysis
modeling
control


Power domination in block graphs The problem of monitoring an electric power system by placing as few measurement devices in the system as possible is closely related to the well-known domination problem in graphs. In 2002, Haynes et al. considered the graph theoretical representation of this problem as a variation of the domination problem. They defined a set S to be a power dominating set of a graph if every vertex and every edge in the system is monitored by the set S (following a set of rules for power system monitoring). The power domination number gamma(p) (G) of a graph G is the minimum cardinality of a power dominating set of G. This problem was proved NP-complete even when restricted to bipartite graphs and chordal graphs. In this paper, we present a linear time algorithm for solving the power domination problem in block graphs. As an application of the algorithm, we establish a sharp upper bound for power domination number in block graphs and characterize the extremal graphs. (C) 2006 Elsevier B.V. All rights reserved.

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

algorithm
power dominating set
block graphs
electric power system


Efficient bulk maritime logistics for the supply and delivery of multiple chemicals Many multinational chemical companies (MNCs) manage the inventories of several raw materials at their worldwide sites. Maritime transportation plays a key role in this chemical logistics. In this paper, we address an inventory service problem in which a chemical MNC uses a fleet of multi-parcel ships with dedicated compartments to move multiple chemicals continually among its internal and external production and consumption sites. The objective is to ensure continuity of operation at all sites by maintaining adequate inventory levels of all raw materials. We develop a novel multi-grid continuous-time mixed-integer linear programming (MILP) formulation based (Susarla, Li, & Karimi. 2010) for this chemical logistics problem. Our model allows limited jetties at each site, non-zero transfer times, variable load/unload quantities, transfer task sequencing, etc. In contrast to the literature, it needs no separate estimates for arrivals at each site. Several examples are solved to illustrate the efficiency of our proposed formulation. (C) 2010 Elsevier Ltd. All rights reserved.

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

routing
scheduling
mixed-integer linear programming
supply chains
inventory management


Business process reengineering for health-care system using multicriteria mathematical programming This paper presents an application of multicriteria mathematical programming (MCMP) as an aid to strategic planning for business process infrastructure development in an organization. The MCMP model is formulated and evaluated to address the strategic planning in business process infrastructure development. The goal levels are identified and prioritized using the analytic hierarchy process. The model result is analyzed and the solution implication is evaluated to improve the model applicability. The MCMP model application reinforces the strategic planning of the organization's business process infrastructure development and other production and operations planning settings.

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

multicriteria mathematical programming
business process reengineering

goal programming
health-care infrastructure


A faster capacity scaling algorithm for minimum cost submodular flow We describe an O(n(4)h min{log U, n(2) log n}) capacity scaling algorithm for the minimum cost submodular flow problem. Our algorithm modifies and extends the Edmonds-Karp capacity seating algorithm for minimum cost flow to solve the minimum cost submodular flow problem. The modification entails scaling a relaxation parameter delta, Capacities are relaxed by attaching a complete directed graph with uniform arc capacity delta in each scaling phase. We then modify a feasible submodular flow by relaxing the submodular constraints, so that complementary slackness is satisfied. This creates discrepancies between the boundary of the flow and the base polyhedron of a relaxed submodular function. To reduce these discrepancies, we use a variant of the successive shortest path algorithm that augments flow along minimum cost paths of residual capacity at least delta. The shortest augmenting path subroutine we use is a variant of Dijkstra's algorithm modified to handle exchange capacity arcs efficiently. The result is a weakly polynomial time algorithm whose running time is better than any existing submodular flow algorithm when U is small and C is big. We also show how to use maximum mean cuts to make the algorithm strongly polynomial. The resulting algorithm is the first capacity scaling algorithm to match the current best strongly polynomial bound for submodular flow.

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


An application of zeroone goal programming in project selection and resource planning a case study from the Woodward Governor Company This paper deals with a project for the Aircraft Controls Group but the model is applicable to all companies that have multiple projects to select and limited resources. The zeroone goal programming (GP) model of this paper focuses on a specific component in the engine control system that has been identified as a potential growth area. Woodward has performed a detailed market analysis and has selected several potential engine programs to pursue. Decisions must be made to determine most advantageous programs to pursue in light of limited resources including capital, personnel and machinery. Therefore, a quantitative method is required for determining which programs to pursue and when they should be pursued. The GP model described in this paper has been developed to determine which programs to pursue in an effort to maximize profit over a four-year period, develop machine procurement plans and estimate personnel requirements. This paper addresses the quantitative methodology for determining possible implementable solutions to project selection problems in Woodward Governor Company using computers. Also, this paper describes how mathematical methodology can be used for the actual real-world business applications. The purpose of this paper is to present an application of goal programming as an aid in project selection. The model determines most advantageous project to pursue in light of limited resources including capital, personnel and machinery by utilizing a quantitative methodology. The model is applied in a real-word setting and implementation procedure and results are discussed.

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

project selection
zeroone goal programming


Analytic optimization of shrinkage parameters based on regularized subspace information criterion For obtaining a higher level of generalization capability in supervised learning, model parameters should be optimized, i.e., they should be determined in such a way that the generalization error is minimized. However, since the generalization error is inaccessible in practice, model parameters are usually determined in such a way that an estimate, of the generalization error is minimized. A standard procedure for model parameter optimization is to first prepare a finite set of candidates of model parameter values, estimate the generalization error for each candidate, and then choose the best one from the candidates. If the number of candidates is increased in this procedure, the optimization quality may be improved. However, this in turn increases the computational cost. In this paper, we give methods for analytically finding the optimal model parameter value from a set of infinitely many candidates. This maximally enhances the optimization quality while the computational cost is kept reasonable.

O O O O O O O B I I I O O O O O O B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 Tangent Bundle Theory for Visual Curve Completion Visual curve completion is a fundamental perceptual mechanism that completes the missing parts (e. g., due to occlusion) between observed contour fragments. Previous research into the shape of completed curves has generally followed an "axiomatic" approach, where desired perceptual/geometrical properties are first defined as axioms, followed by mathematical investigation into curves that satisfy them. However, determining psychophysically such desired properties is difficult and researchers still debate what they should be in the first place. Instead, here we exploit the observation that curve completion is an early visual process to formalize the problem in the unit tangent bundle R-2 x S-1, which abstracts the primary visual cortex (V1) and facilitates exploration of basic principles from which perceptual properties are later derived rather than imposed. Exploring here the elementary principle of least action in V1, we show how the problem becomes one of finding minimum-length admissible curves in R-2 x S-1. We formalize the problem in variational terms, we analyze it theoretically, and we formulate practical algorithms for the reconstruction of these completed curves. We then explore their induced visual properties vis-a-vis popular perceptual axioms and show how our theory predicts many perceptual properties reported in the corresponding perceptual literature. Finally, we demonstrate a variety of curve completions and report comparisons to psychophysical data and other completion models.

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


WAVELET ANALYSIS FOR STATOR FAULT DETECTION IN INDUCTION MACHINES The main objective of the proposed analysis is the detection of inter-turn short circuits in the stator windings of an induction machine. The analysis of the space vector current modulus of an induction motor is presented in this paper. This analysis is based on Daubechies 8 wavelet with seven decomposition levels. The 5th decomposition-level detail signal for a 4 kHz sampling frequency is chosen as a fault indicator, based on simulation results that show different behaviors of the energy contained in the detail signals independent of the percentage of load and fault levels. Experimental results that validate the proposed strategy are also presented. These results also show that the strategy is in addition immune to load variations as well as to feeding voltage unbalances.

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


Development of an Air Force Warehouse Logistics Index to continuously improve logistics capabilities For the effective operation of air power in the modern war, the logistics systems of Air Force warehouses need to be well-maintained. The best logistics system can be established through continuous improvements in logistics capabilities. Although there have been some studies on key performance indicators for logistics capability, they have neither considered the structural relationship among various influential factors, nor the feedback mechanisms in warehouse logistics capabilities. In this study, we propose a structural equations model (SEM) to develop an Air Force Warehouse Logistics Index (WLI). The concept of a Customer Satisfaction Index is used to assess the WLI for strategic improvement plans for various warehouse groups. It is expected that our model can be used to evaluate the logistics support capability of ROKAF (Republic of Korea Air Force) warehouses and contribute to warehouse modernization plans.

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

air force warehouse
structural equations model


Application of the variance compensation likelihood measure for robust hidden Markov model in noise This letter presents covariance matrix adaptation based upon the incorporation of the projection-based group delay scheme (PGDS) with a semi-continuous hidden Markov model (HMM) for the minimization of undesirable effects in noisy environments. The proposed approach fits the covariance matrix using a variance adaptive function to balance the mismatch between different environments.

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

group delay scheme
hidden markov model
variance adaptive function

projection measure
mean compensation bias


Mapping of user interfaces on electronic appliances The purpose of this study was to investigate mapping of user interfaces on consumer electronic appliances. A digital clock with five different interface modes was chosen for the experiment. Forty elderly subjects (above 65 years) and 40 middle-aged subjects (4564 years) participated in the study. Every subject had to complete three different tasks, namely time setting, alarm time setting and date setting. The researchers investigated what problems were encountered when performing these tasks and collected data such as operational time, the number of total inputs, subjective estimation and interview information. The findings of this study indicated that the interface modes had significant effects on operational time, the number of total inputs and subjective estimation. Finally, the study confirms that when the spatial relationship between buttons and display contents are clearly indicated, the operation is easier to complete.

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

the elderly
user interface
electronic appliance


Assessing the behaviour of polygonal approximation algorithms In a recent paper, we described a method for assessing the accuracy of polygonal approximation algorithms (IEEE Trans. PAMI 19(6) (1997) 659). Here, we develop several measures to assess the stability of such approximation algorithms under two classes of variations, namely perturbations of the data and changes in the algorithms scale parameters. In order to quantify the former, a break-point stability index is defined and tested. For the latter, two indices are introduced; (1) a monotonicity index is applied to analyse the change in the approximation error or the number of line segments against increasing scale, and (2) a consistency index quantifies the variation in results produced at the same scale by an algorithm (but with different input parameter values). Finally, the previously developed accuracy figure of merit is calculated and averaged over 21 test curves for different parameter values to obtain more reliable scores.

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


integrated mobile visualization and interaction of events and pois We propose a new approach for mobile visualization and interaction of temporal information by integrating support for time with today's most prevalent visualization of spatial information the map. Our approach allows for an easy and precise selection of the time that is of interest and provides immediate feedback to the users when interacting with it. It has been developed in an evolutionary process gaining formative feedback from end users.

O O B O O O B O B O O O O O O O B O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O 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 taxonomy of discovery services and gap analysis for ultra-large scale systems Timely discovery of services in ultra-large scale (ULS) systems plays a vital role in critical areas, such as national power grids, homeland security, and health care. This paper develops a taxonomy for classifying discovery services and presents an overview of existing discovery service technologies. It then classifies these discovery services using the taxonomy and performs a gap analysis for discovery services with respect to emerging ULS systems. Our results show that while discovery services are fairly mature and broadly applicable to today's systems much R&D remains to support emerging systems of ultra-large scale effectively.

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

gap analysis
uls systems
discovery services
taxonomy


A novel hybrid algorithm for scheduling steel-making continuous casting production In this paper, steel-making continuous casting (SCC) scheduling problem (SCCSP) is investigated. This problem is a specific case of hybrid flow shop scheduling problem accompanied by technological constraints of steel-making. Since classic optimization methods fail to obtain an optimal solution for this problem over a suitable time, a novel iterative algorithm is developed. The proposed algorithm, named HANO, is based on a combination of ant colony optimization (ACO) and non-linear optimization methods. The solution construction in HANO is broken up into two phases. The first phase determines the discrete variables (corresponding to job-machine assignment and sequencing), while the second phase determines the continuous ones (corresponding to timing of the jobs on their assigned machines) through a non-linear optimization method. The efficiency of HANO is compared with a heuristic algorithm as a real case used at Mobarakeh Steel Company (MSC), the biggest steel factory in the Middle East. In addition, the proposed algorithm is compared with Genetic Algorithm, as a search method for both discrete and continuous variables, through solving several instances. Numerical results reveal the higher efficiency of the proposed approach compared with the heuristic one used at MSC. Furthermore, the efficiency of HANO is compared with GA to show that HANO enjoys a better performance in more than 95% of the cases while in the remaining 5%, its performance efficiency shows no difference.

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


Codes for a long silence We determine the exact exponential asymptotics of the maximum number of n-length binary strings any two of which differs in the following strong sense: there must be a coordinate in which one of them has a 1 in correspondence with a predetermined position within a "long run" of zeros in the other string and discuss some generalizations and implications of this result.

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

binary block codes
channels with memory
error correction
zero-error capacity


A modular rewriting semantics for CML This paper presents a modular rewriting semantics (MRS) specification for Reppy's ConcurrentML (CML), based on Peter Mosses' modular structural operational semantics specification for CML. A modular rewriting semantics specification for a programming language is a rewrite theory in rewriting logic written using techniques that support the modular development of the specification in the precise sense that every module extension is conservative. We show that the MRS of CML can be used to interpret CML programs using the rewrite engine of the Maude system, a high-performance implementation of rewriting logic, and to verify CML programs using Maude's built-in LTL model checker. It is assumed that the reader is familiar with basic concepts of structural operational semantics and algebraic specifications.

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

semantics of programming languages
modularity
concurrent ml


Dynamic of a non-autonomous predator-prey system with infinite delay and diffusionl In the present paper, a nonlinear non-autonomous predator-prey dispersion model with continuous delay is studied. Sufficient conditions which guarantee the existence of a periodic positive solution are obtained by using Gaines and Mawhin's continuation theorem of coincidence degree theory. Moreover, globally asymptotically stability of the system is also obtained by means of a suitable Lyapunov functional. The applications show that these criteria are easily verified. (c) 2008 Elsevier Ltd. All rights reserved.

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

time delay
periodic solution
persistent
globally asymptotically stable


Efficient location traffic management with multiple virtual layers In mobile wireless networks, efficient location management for tracking and finding the mobile users is a critical issue. The traffic for location update can be excessive, especially at base stations that are near location area (LA) boundaries. In this paper we propose a new location update scheme which can significantly reduce the signaling traffic for location update. It is based on the virtual layer approach employing SubMSCs. Here the virtual layer is laid upon the original layer of LA's such that the mobile terminals moving around the boundary cells of adjacent LA's begin moving within a virtual LA. As a result, the proposed scheme significantly reduces the location update traffic compared to an overlapping scheme which is the most recent and efficient location update scheme.

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

location area
mobile terminals
signaling traffic


an architecture for a wide area distributed system Distributed systems provide sharing of resources and information over a computer network. A key design issue that makes these systems attractive is that all aspects related to distribution are transparent to users. Unfortunately, general-purpose wide area distributed systems that allow users to share and manage arbitrary resources in a transparent way hardly exist. In particular, they generally do not take into account the most important properties that characterize wide area systems: 1) A very large number of users and resources, 2) an inherent latency problem caused by the distance between nodes, 3) heterogeneity due to a variety of underlying operating systems and networks, and 4) involvement of multiple administrative organizations.The research described in this paper is part of the Globe Project (Globe stands for GLobal Object Based Environment). The goal of this project is the design and implementation of a wide area distributed system that provides a convenient programming abstraction and full transparency. The main contribution of this paper is the description of a new system for distributed shared objects. In contrast to other systems, the implementation of distribution, consistency, and replication of state is completely encapsulated in a distributed shared object. This allows for object-specific solutions, and provides the right mechanism for building efficient and truly scalable systems.

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

network
replication
design
object
project
account
paper
heterogeneity
distributed systems
sharing
distance
research
systems
latency
abstraction
users
transparency
architecture
implementation
consistency
distributed
global

efficiency
scalability
computation
general
informal
management
program
organization
aspect
environments
operating system
resource


Prediction of asynchronous dimensional emotion ratings from audiovisual and physiological data We study the relevance of context-learning for handling asynchrony of annotation. We unite audiovisual and physiological data for continuous affect analysis. We propose multi-time resolution features extraction from multimodal data. The use of context-learning allows to include reaction time delay of raters. Fusion of audiovisual and physiological data performs best on arousal and valence.

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

multitime resolution features extraction

context-learning long short-term memory recurrent neural networks


Automated eye tracking system calibration using artificial neural networks The electro-oculogram (EOG) continues to be widely used to record eye movements especially in clinical settings. However, an efficient and accurate means of converting these recordings into eye position is lacking. An artificial neural network (ANN) that maps two-dimensional (2D) eye movement recordings into 2D eye positions can enhance the utility of such recordings. Multi-layer perceptrons (MLPs) with non-linear activation functions and trained with back propagation proved to be capable of calibrating simulated EOG data to a mean accuracy of 0.33. Linear perceptrons (LPs) were only nearly half as accurate. For five subjects, the mean accuracy provided by the MLPs was 1.09 of visual angle () for EOG data, and 0.98 for an infrared eye tracker. MLPs enabled calibration of 2D saccadic EOG to an accuracy not significantly different from that obtained with the infrared tracker. Using initial weights trained on another person reduced MLP training time, reaching convergence in as little as 20 iterations.

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

calibration
eye tracking
eog
artificial neural network

saccadic eye movements
multi-layer perceptron


Reliable scalable symbolic computation: The design of SymGridPar2 This paper presents the design and initial evaluation of SymGridPar2. SymGridPar2 is designed to provide scalability and fault tolerance. Scalability using layering and by allowing the programmer to control task placement. We report the scalability and efficiency, including weak scaling to about 32k cores. We present a fault tolerant work stealing protocol and measure supervision overheads.

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

parallel functional programming
locality control


The role of the potentials in electromagnetism There are two conflicting views about electromagnetic phenomena. The first is based on the action between stationary and moving particles of electric charge and the second on energy distributions in electric and magnetic fields. The difference between these approaches is seen most clearly in the roles assigned to the potentials. According to the particle view the potentials convey the force from one particle to another, whereas in the field approach the potentials are system parameters related to the field energy. The article compares the two views and concludes that the particle view faces impossible difficulties because it ascribes local significance to quantities which are unobservable and conflicts with the quantum-mechanical understanding of charge as a statistical distribution.

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


Resource constrained scheduling on multiple machines This paper is devoted to RESOURCE CONSTRAINED SCHEDULING. An instance for this problem is given by a set of n jobs with lengths and weights and a set of m machines with capacities. At every time each machine can run arbitrary many jobs in parallel but the total weight of these jobs must not exceed the capacity of the machine. Furthermore the m machines work in parallel and we wish to find a schedule that minimizes the makespan or the sum of completion times. Thus load balancing on a cluster of servers is a typical application for scheduling under resource constraints. For both measures the problem is NP-complete even for m = 1. We show that the problem is approximable within factors of 2 (makespan) and 14.85 (sum of completion times) for arbitrary m. (C) 2004 Elsevier B.V. All rights reserved.

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


IMMSIM, a flexible model for in machina experiments on immune system responses This paper describes the basic structure and the developments of IMMSIM, a modified cellular automaton to simulate chance encounters and discrete effects of cellcell and cellmolecule interactions in the lymphoid system. Thanks to its flexibility, this model has proven a useful tool in theoretical immunology, experimental research and educational applications. Of the various versions available, we show here the most advanced one (IMMSIM3), that incorporates both humoral and cellular responses. We describe the results obtained by simulating the responses to viral infection, the impact of viral behavior on the quality of response needed to reach a cure, the cooperation/competition relation between cellular and humoral branches and the effect of vaccination.

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


time-predictable memory arbitration for a java chip-multiprocessor In this paper, we propose an approach to calculate worst-case execution times (WCET) of tasks running on a homogeneous Java multiprocessor. These processors access a shared main memory. Hence, the tasks running on different CPUs may influence the execution times of each other. Therefore, we implemented a time division multiple access arbiter that divides the memory access time into equal time slots, one time slot for each CPU. This memory arbitration allows calculating upper bounds for the execution time of Java bytecodes depending on the number of CPUs, the size of the time slot, and the memory access time. A WCET analysis tool can utilize these results and generate temporal, upper bounds for application tasks. We further explore how the size of the time slot and the number of CPUs in the system influence the WCET results. Furthermore, a real-world application task is used to compare the analyzed results with measured execution times. This paper describes the timing analysis of a time-predictable Java multiprocessor with shared memory.

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

worst-case execution time
chip-multiprocessor


Regularized shallow water equations and a new method of numerical simulation of the open channel flows The regularized shallow water (RSW) equation system is proposed together with a central-difference algorithm for its numerical solution. The possibilities of the new computational model are demonstrated for a 1D dam break and Le-Veque's perturbation tests, and for 2D asymmetric dam break test problems. (C) 2010 Elsevier Ltd. All rights reserved.

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

finite-volume
central-differences
quasi gas dynamic equations


A framework for fusion methods and rendering techniques of multimodal volume data Many different direct volume rendering methods have been developed to visualize 3D scalar fields on uniform rectilinear grids. However, little work has been done on rendering simultaneously various properties of the same 3D region measured with different registration devices or at different instants of time. The demand for this type of visualization is rapidly increasing in scientific applications such as medicine in which the visual integration of multiple modalities allows a better comprehension of the anatomy and a perception of its relationships with activity. This paper presents different strategies of direct multimodal volume rendering (DMVR). It is restricted to voxel models With a known 3D rigid alignment transformation. The paper evaluates at Which steps of the rendering pipeline the data fusion must be realized in order to accomplish the desired visual integration and to provide fast re-renders When sonic fusion parameters are modified. In addition, it analyses how existing monomodal visualization algorithms can be extended to multiple datasets and it compares their efficiency and their computational cost. Copyright (C) 2004 John Wiley & Sons, Ltd.

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


polish parsers, step by step We present the derivation of a space efficient parser combinator library: the constructed parsers do not keep unnecessary references to the input, produce online results and efficiently handle ambiguous grammars. The underlying techniques can be applied in many contexts where traditionally backtracking is used.We present two data types, one for keeping track of the progress of the search process, and one for representing the final result in a linear way. Once these data types are combined into a single type, we can perform a breadth-first search, while returning parts of the result as early as possible.

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

online results
backtracking
ambiguous grammars
parser
input
space
types
process
data
search

polish representation
glr parsing
efficiency
breadth-first search
context
tracking
parser combinators
libraries
online
combinational
grammar


Relationships between topographically expressed zones of flow accumulation and sites of fault intersection: analysis by means of digital terrain modelling Topographically expressed zones of flow accumulation often coincide with fault intersections because of increased rock fracturing. We have conducted a study of the interrelationships between topographically expressed accumulation zones and fault intersections, and the function of these sites in landscape evolution. The investigation has been performed with the use of digital terrain models, geological and soil data for the Crimean Peninsula. First, we carried out an analysis of associations of sites of fault intersections, intensive rock fracturing and abnormally high discharges of springs and boreholes, relating to fault intersections, with three types of landform element (zones of flow accumulation, transit and dissipation). We found that all phenomena under study are closely associated with topographically expressed accumulation zones. This has demonstrated that, within these zones, the soil moisture is influenced both by upward transport of deep-seated groundwater and by accumulation of overland lateral flows. Second, we predicted the effect of topography on irrigation-induced changes in the salt regime of soils and the groundwater level, assuming that topographically expressed accumulation zones can be marked by properties of fault intersections. We found that water leaking out of the North Crimean Canal can result in secondary salinisation of soils and a considerable rise of the watertable within some accumulation zones located downslope. Salts collected in the accumulation zones, and their slow movement through rock fractures, can lead to salinisation of the aquifers. We believe that topographically expressed accumulation zones are areas of contact and substance exchange between overland lateral and deep flows.

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

topography fault accumulation salinisation watertable

digital terrain model
fracture zone
overland flow


UML as domain specific language for the construction of knowledge-based configuration systems In many domains, software development has to meet the challenges of developing highly adaptable software very rapidly. In order to accomplish this task, domain specific, formal description languages and knowledge-based systems are employed. From the viewpoint of the industrial software development process, it is important to integrate the construction and maintenance of these systems into standard software engineering processes. In addition, the descriptions should be comprehensible for the domain experts in order to facilitate the review process. For the realization of product configuration systems, we show how these requirements can be met by using a standard design language (UML-Unified Modeling Language) as notation in order to simplify the construction of a logic-based description of the domain knowledge. We show how classical description concepts for expressing configuration knowledge can be introduced into UML and be translated into logical sentences automatically. These sentences are exploited by a general inference engine solving the configuration task.

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

knowledge representation
automated reasoning


Design of a knowledge-based logistics strategy system Traditionally, the formulation of logistics strategies to execute various logistics services is done by human experts. In this paper, a knowledge-based logistics strategy system (KLSS) is designed in helping them to support the logistics strategy development stage by retrieving and analyzing useful knowledge and solutions in a timely and cost effective manner. The proposed knowledge-based system, which is suitable for usage in Hong Kong/Pearl River Delta region, enhances the effectiveness in formulating logistics strategies by integrating techniques like data warehouse, on-line analytical processing, multi-dimensional database management system and case-based reasoning. Through applying KLSS in Eastern Worldwide Company (EWW), resource utilization is maximized and work efficiency is greatly reduced.

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

knowledge-based system
on-line analytical processing
case-based reasoning


Stateful relational database gateways for the World Wide Web The World Wide Web is currently considered as the most appropriate software platform for the deployment of applications in wide area networks (telematics) as well as corporate intranets. Such applications are, in the majority of cases, tightly coupled with legacy databases hosted by relational management systems. However, the nature of the database enabled WWW systems is quite different from that of classical database applications developed with tools like 4GLs, Forms, Menus, etc. The basic difference lies in the stateless character of the WWW. The `user session' concept, encountered in conventional database applications, does not apply in the WWW environment. Instead, interaction with the information server is accomplished through a series of hits (requestresponse interactions) which are treated independently. This paper presents an architecture for the deployment of stateful database gateways for WWW servers. Although the server still treats each individual hit independently, state information maintained in the WWW browser as well as in specialized agents that operate behind the WWW server renders the WWW appropriate for a `session-aware' database application. The effort required to port an existing `session-aware' database application to the WWW environment is minimal.

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

rdbms
stateless http
stateful applications
cookies


Skeleton correspondence construction and its applications in animation style reusing The production of cartoon animation is a very expensive and time-consuming task even for experienced animators because smooth motions are required to create cartoon-style animations that are expressive and stylized. If it is possible to provide a reusable technique, we can efficiently produce new animations that have similar motion styles but different cartoon characters. In this paper, we provide a novel method which can extract motions from existing animation sequences and retarget them to other cartoon characters. Specifically, we implement a skeleton correspondence construction method to extract the motion information from the existing animation sequence, and apply inverse kinematics (IK) to transform the motion onto the target skeleton. The proposed cartoon reusing method can efficiently reduce the workload on the animator and accelerate the development of animation industry. The experimental results conducted on our cartoon dataset suggest the effectiveness of the proposed methods for cartoon animation reusing.

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

correspondence construction
animation reusing


Structure-cytotoxicity relationships for a series of HEPT derivatives Structure-cytotoxicity relationships were studied for a series of 90 HEPT derivatives by means of multiple linear regression (MLR) and artificial neural network (ANN) techniques. The values of log(1/CC50) (CC50=cytotoxic dose of compound required to reduce the proliferation of normal uninfected MT-4 cells by 50%) of the studied compounds were correlated with the descriptors encoding the chemical structures. Using the pertinent descriptors revealed by the regression analysis, a correlation coefficient of 0.935 (s=0.149) for the training set (n=81) was obtained for the ANN model with a 5-6-1 configuration. The results obtained from this study indicate that the cytotoxicity of HEPT derivatives is strongly dependent on hydrophobic factors, mainly log P(R-1), and dependent on the steric factors, especially SigmaMW(R-3+R-4). Comparison of the descriptors' contribution obtained in MLR and ANN analysis shows that the contribution of some of the descriptors to cytotoxicity may be non-linear.

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

artificial neural network
hept derivatives
multiple linear
regression

descriptors' contribution
structure-cytotoxicity relationships


Driving behaviour models enabling the simulation of Advanced Driving Assistance Systems: revisiting the Action Point paradigm We investigate driving behaviours. Based on a pilot survey, we confirm the Action Point (AP) theory, with some simplifications. We propose a new characterisation of the AP theory in terms of opening and closing waves. Based on the pilot survey, we identify a (linear) pattern for the distribution of action points.

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

adas
car-following
microscopic
action point theory
its
instrumented vehicle


A high-precision spread spectrum clock generator based on a fractional-N phase locked loop A low jitter Spread Spectrum Clock Generator (SSCG) based on a fractional-N Phase Locked Loop (PLL) capable of generating various Electromagnetic Interference (EMI) reduction levels is proposed. A digital compensation filter is fully integrated in the design to prevent various triangular modulation profiles from being distorted by the prohibitively small PLL loop bandwidth. A simple but comprehensive logic design included in the digital filter provides independently controllable modulation frequency, f (m), and modulation ratio, delta(m) within all modulation modes (up, down, center). The proposed SSCG is designed in a 0.18 mu m CMOS standard cell library and operates at 72 MHz with f (m) ranging from 58 to 112.5 kHz and delta(m) ranging from 0.75 to 2 %.

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

emi reduction
spread spectrum clock generator

frequency modulation
triangular modulation profile
fractional-n pll


Multivariate L-1 Methods: The Package MNM In the paper we present an R package MNM dedicated to multivariate data analysis based on the L-1 norm. The analysis proceeds very much as does a traditional multivariate analysis. The regular L-2 norm is just replaced by different L-1 norms, observation vectors are replaced by their (standardized and centered) spatial signs, spatial ranks, and spatial signed-ranks, and so on. The procedures are fairly efficient and robust, and no moment assumptions are needed for asymptotic approximations. The background theory is briefly explained in the multivariate linear regression model case, and the use of the package is illustrated with several examples using the R package MNM.

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

least absolute deviation
mean deviation
mean difference
shape matrix
spatial sign
spatial signed-rank
spatial rank
transformation-retransformation method


There goes the neighborhood Lipreading and the structure of the mental lexicon A central question in spoken word recognition research is whether words are recognized relationally, in the context of other words in the mental lexicon (McClelland and Elman, 1986, Luce and Pisoni 1998) The current research evaluated metrics for measuring the influence of the mental lexicon on visually perceived (lipread) spoken word recognition Lexical competition (the extent to which perceptually similar words influence recognition of a stimulus word) was quantified using metrics that are well-established in the literature, as well as a novel statistical method for calculating perceptual confusability, based on the Phi square statistic The Phi square statistic proved an effective measure for assessing lexical competition and explained significant variance in visual spoken word recognition beyond that accounted for by traditional metrics Because these values include the influence of a large subset of the lexicon (rather than only perceptually similar words) it suggests that even perceptually distant words may receive some activation, and therefore provide competition, during spoken word recognition This work supports and extends earlier research (Auer, 2002, Mattys et al, 2002) that proposed a common recognition system underlying auditory and visual spoken word recognition and provides support for the use of the Phi-square statistic for quantifying lexical competition (C) 2010 Elsevier B V All rights reserved

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

lipreading
spoken word recognition
lexical competition


Visual task identification and characterization using polynomial models Developing robust and reliable control code for autonomous mobile robots is difficult, because the interaction between a physical robot and the environment is highly complex, subject to noise and variation, and therefore partly unpredictable. This means that to date it is not possible to predict robot behaviour based on theoretical models. Instead, current methods to develop robot control code still require a substantial trial-and-error component to the software design process. This paper proposes a method of dealing with these issues by (a) establishing task-achieving sensor-motor couplings through robot training, and (b) representing these couplings through transparent mathematical functions that can be used to form hypotheses and theoretical analyses of robot behaviour. We demonstrate the viability of this approach by teaching a mobile robot to track a moving football and subsequently modelling this task using the NARMAX system identification technique.

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

autonomous mobile robots
system identification


Distinct multicolored region descriptors for object recognition The problem of object recognition has been considered here. Color descriptions from distinct regions covering multiple segments are considered for object representation. Distinct multicolored regions are detected using edge maps and clustering. Performance of the proposed methodologies has been evaluated on three data sets and the results are found to be better than existing methods when a small number of training views is considered.

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

object representation
object recognition

object descriptor
object matching
image representation


Multi-scale Daubechies wavelet-based method for 2-D elastic problems In this paper, the multi-scale Daubechies (DB) wavelet method is used for solution of 2-D plain elastic problems. Unlike the single scale wavelet method, the DB wavelet functions are also used in function approximation for solving problems with local complicated deformation in the multi-scale method. Using the ideas of some meshless methods and Galerkin methods, the solution formulations for two dimensional elastic problems in multi-scale approach are established. In order to treat general boundaries and improve the efficiency and accuracy of solution, a method for evaluation of integrals in general region is proposed. Numerical examples of 2-D elastic problems illustrate that this multi-scale Daubechies wavelet method is effective and stable.

O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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-scale
waveletgalerkin method
general boundary


Construction of Codes for the Wiretap Channel and the Secret Key Agreement From Correlated Source Outputs Based on the Hash Property The aim of this paper is to prove coding theorems for the wiretap channel and the secret key agreement based on the the notion of a hash property for an ensemble of functions. These theorems imply that codes using sparse matrices can achieve the optimal rate. Furthermore, fixed-rate universal coding theorems for a wiretap channel and a secret key agreement are also proved.

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

secret key agreement from correlated source outputs

linear codes
maximum-likelihood decoding
minimum-divergence encoding
minimum-entropy decoding
shannon theory
sparse matrix
universal codes


Melatonin as an Apoptosis Antagonist The pineal hormone melatonin (Mel), in addition to having a well-established role as a regulator of circadian rhythms, modulates nonneural compartments by acting on specific plasma membrane receptors (MT1/MT2) present in many different cell types. Mel plays immunomodulatory roles and is an oncostatic and antiproliferative agent; this led to the widespread belief that Mel may induce or potentiate apoptosis on tumor cells, even though no clear indications have been presented so far. Here we report that Mel is not apoptogenic on U937 human monocytic cells, which are known to possess MT1 receptors at the times (up to 48 h) and doses (up to 1 mM) tested. Mel does not even potentiate apoptosis, but instead, significantly reduces apoptosis induced by both cell-damaging agents (intrinsic pathway) and physiological means (extrinsic pathway). The doses required for the antiapoptotic effect (?100 ?M) are apparently not compatible with receptor stimulation (receptor affinity <1 nM). However, receptor involvement cannot be ruled out, because we discovered that the actual Mel concentration active on cells was lower than the nominal one because of sequestration by fetal calf serum (FCS). Accordingly, in FCS-free conditions, Mel doses required for a significant antiapoptotic effect are much lower

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


Java in the High Performance Computing arena: Research, practice and experience The rising interest in Java for High Performance Computing (HPC) is based on the appealing features of this language for programming multi-core cluster architectures, particularly the built-in networking and multithreading support, and the continuous increase in Java Virtual Machine (JVM) performance. However, its adoption in this area is being delayed by the lack of analysis of the existing programming options in Java for HPC and thorough and up-to-date evaluations of their performance, as well as the unawareness on current research projects in this field, whose solutions are needed in order to boost the embracement of Java in HPC. This paper analyzes the current state of Java for HPC, both for shared and distributed memory programming, presents related research projects, and finally, evaluates the performance of current Java HPC solutions and research developments on two shared memory environments and two InfiniBand multi-core clusters. The main conclusions are that: (1) the significant interest in Java for HPC has led to the development of numerous projects, although usually quite modest, which may have prevented a higher development of Java in this field; (2) Java can achieve almost similar performance to natively compiled languages, both for sequential and parallel applications, being an alternative for HPC programming; (3) the recent advances in the efficient support of Java communications on shared memory and low-latency networks are bridging the gap between Java and natively compiled applications in HPC. Thus, the good prospects of Java in this area are attracting the attention of both industry and academia, which can take significant advantage of Java adoption in HPC. (C) 2011 Elsevier B.V. All rights reserved.

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

java
high performance computing
cluster
infiniband

performance evaluation
multi-core architectures
message-passing
threads


Fault-diagnosis of grid structures The problem of fault diagnosis in grid-connected systems is considered. A diagnosis algorithm, called DAGS and based on the PMC model, is presented. DAGS provides a diagnosis which is shown to be correct, although possibly incomplete, if the cardinality of the actual fault set is below a bound T-sigma dependent of the actual syndrome sigma. A bound T independent of sigma is also derived by a worst-case analysis covering the cases of triangular, square, hexagonal and octagonal grids. T is shown to be Theta(n(2/3)), where n is the size of the system, for all the grids considered. (C) 2002 Elsevier Science B.V. All rights reserved.

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

fault-tolerance
system-level diagnosis
parallel architectures