Automatic syllabification for Spanish using lemmatization and derivation to solve the prefix's prominence issue The syllabification of Spanish's words follows a few basic rules, but the syllabification of some words deviates from the general rules according to a number of factors described in this paper. Prefixes are major cause of variations on syllabification. Since, in Spanish, prefixes tend to do not integrate into other syllables when they are prominent, the syllabification of words can vary depending on the prominence of the prefixes. This paper shows that, in many cases, the prominence of a prefix can be inferred by means of some morphological and lexical knowledge. This paper proposes a syllabification algorithm that implements the basic syllabification rules and combines them with morphological and lexical information obtained from three sources: a lemmatizer, a derivation database, and the Corpus de Referenda del Espanol Actual (CREA) of Royal Spanish Academy. Using this additional information, this paper attempts to provide a solution to the problem of taken into account the prefixes according to its prominence for a correct syllabification. (C) 2013 Elsevier Ltd. All rights reserved.

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

syllabification lemmatization derivation prefix


view-dependent tetrahedral meshing and rendering Interactive exploration of huge tetrahedral meshes is required by many applications but the limitations of the current hardware do not allow for the full dataset to be rendered at interactive frame rates. Multi resolution representations are an important tool to adapt the tetrahedral mesh complexity to the current viewing parameters in real time rendering environments.We present a meshing framework that builds a compact multi resolution representation for large tetrahedral meshes. A preprocessing step simplifies the mesh into a binary vertex hierarchy which is used at run time to adapt the mesh to viewing parameters. Exploiting the redundancy in the connectivity information of the mesh enables us to store the vertex hierarchy compactly such that a vertex split or edge collapse can be performed by knowing incremental updates only.We integrated this multiresolution representation into a volume rendering environment that supports direct volume rendering as well as a new point based rendering approach.

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

point rendering
multi resolution meshes
view-dependent rendering


The generalized assignment problem with minimum quantities We consider a variant of the generalized assignment problem (GAP) where the amount of space used in each bin is restricted to be either zero (if the bin is not opened) or above a given lower bound (a minimum quantity). We provide several complexity results for different versions of the problem and give polynomial time exact algorithms and approximation algorithms for restricted cases. For the most general version of the problem, we show that it does not admit a polynomial time approximation algorithm (unless P=NP), even for the case of a single bin. This motivates to study dual approximation algorithms that compute solutions violating the bin capacities and minimum quantities by a constant factor. When the number of bins is fixed and the minimum quantity of each bin is at least a factor ?>1 larger than the largest size of an item in the bin, we show how to obtain a polynomial time dual approximation algorithm that computes a solution violating the minimum quantities and bin capacities by at most a factor 1 - 1 ? and 1 + 1 ? , respectively, and whose profit is at least as large as the profit of the best solution that satisfies the minimum quantities and bin capacities strictly. In particular, for ?=2, we obtain a polynomial time (1,2)-approximation algorithm.

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

assignment problems
combinatorial optimization
computational complexity


Balancing mixed-model assembly lines using adjacent cross-training in a demand variation environment This paper presents a contribution related to a straight-paced MAL with adjacent cross-training to meet the variation in production demand. With adjacent cross-training, tasks can be reallocated to adjacent stations where workers can deal with when demand changes. The assembly line can achieve quick response to the new demand without too many changes. For all the 450 instances, our algorithm can find the optimal solution for 388 instances in 100s, and the gaps between the obtained objective values and the lower bounds are 1.62 for the remaining 62 instances on average. In total, 83 out of the 388 instances use fewer stations with the adjacent cross-training policy than without the policy.

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

mixed-model assembly line
cross-training
branch
bound and remember


Transformation-based metamaterials to eliminate the staircasing error in the finite difference time domain method A coordinate transformation technique is introduced for the finite difference time domain method to alleviate the effects of errors introduced by the staircasing approximation of curved geometries that do not conform to a Cartesian grid. An anisotropic metamaterial region, which is adapted to the Cartesian grid and designed by the coordinate transformation technique, is constructed around the curved boundary of the object, and the region occupied between the curved boundary and the inner boundary of the anisotropic metamaterial layer is discarded. The technique is validated via several numerical simulations. 2012 Wiley Periodicals, Inc. Int J RF and Microwave CAE 22:530540, 2012.

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

method
staircasing error
coordinate transformation

finite difference time domain (fdtd)
anisotropic metamaterials
transformation media


query suggestions in the absence of query logs After an end-user has partially input a query, intelligent search engines can suggest possible completions of the partial query to help end-users quickly express their information needs. All major web-search engines and most proposed methods that suggest queries rely on search engine query logs to determine possible query suggestions. However, for customized search systems in the enterprise domain, intranet search, or personalized search such as email or desktop search or for infrequent queries, query logs are either not available or the user base and the number of past user queries is too small to learn appropriate models. We propose a probabilistic mechanism for generating query suggestions from the corpus without using query logs. We utilize the document corpus to extract a set of candidate phrases. As soon as a user starts typing a query, phrases that are highly correlated with the partial user query are selected as completions of the partial query and are offered as query suggestions. Our proposed approach is tested on a variety of datasets and is compared with state-of-the-art approaches. The experimental results clearly demonstrate the effectiveness of our approach in suggesting queries with higher quality.

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

query formulation
enterprise search
query log analysis
query completion
query suggestion


Decentralized earth fault selectivity using transient front slopes for unearthed MV networks Differentiating the residual current waveforms extracted the earth fault surge slopes. The relative polarities of the transient slopes discriminated the faulty section. They also decided the fault direction at the secondary substation. The proposed selectivity function is integrated with the decentralized control for distribution networks.

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

unearthed/compensated mv networks
earth faults
decentralized fault management


Feature-enhanced synthetic aperture radar image formation based on nonquadratic regularization We develop a method for the formation of spotlight-mode synthetic aperture radar (SAR) images with enhanced features. The approach is based on a regularized reconstruction of the scattering field which combines a tomographic model of the SAR observation process with prior information regarding the nature of the features of interest. Compared to conventional SAR techniques, the method we propose produces images with increased resolution, reduced sidelobes, reduced speckle and easier-to-segment regions. Our technique effectively deals with the complex-valued, random-phase nature of the underlying SAR reflectivities, Efficient and robust numerical solution is achieved through extensions of half-quadratic regularization methods to the complex-valued SAR problem. We demonstrate the performance of the method on synthetic and real SAR scenes.

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

computed imaging
half-quadratic regularization
image reconstruction
inverse problems
nonquadratic optimization


supporting multi-dimensional range query in hd tree There are two basic concerns for supporting multi-dimensional range query in P2P overlay networks. The first is to preserve data locality in the process of data space partitioning, and the second is the maintenance of data locality among data items with an exponentially expanding rate and an exponentially extending rate. The first problem has been well addressed by using recursive decomposition schemes, such as Quad tree, K-d tree, Z-order, and Hilbert curve. While the second problem was recently identified by our novel data structure: HD Tree. This paper is a follow-up to our previous work in HD Tree. In this paper, we explore how data locality can be easily maintained, and how range query can be efficiently supported in HD Tree. This is done by introducing two basic routing strategies, hierarchical routing and distributed routing. Although hierarchical routing can be applied to any two nodes in the system, it generates high volume traffic towards nodes near the root, and has very limited options to cope with a node failure. On the other hand, distributed routing concerns source and destination pairs only at the same depth, but traffic load is bound to some nodes at two neighboring depths, and multiple options can be found to redirect a routing request. Because HD Tree supports multiple routes between any two nodes in the system, routing in HD Tree is very flexible, and can be designed for many purposes, like fault tolerance, or dynamic load balancing. Distributed Routing Oriented Combined Routing algorithm is one such routing strategies implemented so far. It is a hybrid algorithm combining advantages from both the hierarchical routing and the distributed routing. The experimental results show that the DROCR algorithm achieves considerable performance gain over the equivalent tree routing at the highest depth examined. In the experiment of supporting multi-dimensional range query, we employ the Z-order space filling curve over the HD Tree overlay layer. We are expecting that the performance of range query will vary proportionally with the change of range size, and reasonably with the increase of dimensionality.

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

hd tree
range query
data space partitioning
distributed
overlay
p2p

multi-dimensional
associative searching
ddm
peer-to-peer
data structures


Application of DempsterShafer theory in fault diagnosis of induction motors using vibration and current signals This paper presents an approach for the fault diagnosis in induction motors by using DempsterShafer theory. Features are extracted from motor stator current and vibration signals and with reducing data transfers. The technique makes it possible for on-line application. Neural network is trained and tested by the selected features of the measured data. The fusion of classification results from vibration and current classifiers increases the diagnostic accuracy. The efficiency of the proposed system is demonstrated by detecting motor electrical and mechanical faults originated from the induction motors. The results of the test confirm that the proposed system has potential for real-time applications.

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

dempstershafer theory
neural network
fault diagnosis

data fusion
induction motor
condition monitoring
vibration signal
stator current signal


Acquisition of the 3D surface of the palate by in-vivo digitization with Wave An accurate characterization of the morphology of the hard palate is essential for understanding its role in human speech. The position of the tongue is adjusted in the oral cavity, of which the hard palate is a key anatomical structure. Methods for modeling the palate are limited at present. This paper evaluated the use of a thin plate spline (TPS) technique for reconstructing the palate surface from a series of in-vivo tracings obtained with electromagnetic articulography using Wave (NDI). Twenty-four individuals (13 females and 11 males) provided upper dental casts and in-vivo tracings. Models of the palate surfaces were derived from data acquired in-vivo and compared to the scanned casts. The optimal value for the smoothness parameter for the TPS technique, which provided the smallest error of fit between the modeled and scanned surfaces, was determined empirically (the value of 0.05). Significant predictors of the quality of the fit were determined and included the individuals palate characteristics such as palate slope and curvature. The tracing protocol composed of four different traces produced the best palate models for the in-vivo procedure. Evidence demonstrated that the TPS procedure as a whole is suitable for modeling the palate surface using a small number of in-vivo tracings.

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

hard palate modeling
thin plate spline (tps) technique
palate casts
the wave system


Regularization approach to inductive genetic programming This paper presents an approach to regularization of inductive genetic programming tuned for learning polynomials. The objective is to achieve optimal evolutionary performance when searching high-order multivariate polynomials represented as tree structures. We show how to improve the genetic programming of polynomials by balancing its statistical bias with its variance. Bias reduction is achieved by employing a set of basis polynomials in the tree nodes for better agreement with the examples. Since this often leads to overfitting, such tendencies are counteracted by decreasing the variance through regularization of the fitness function. We demonstrate that this balance facilitates the search as well as enables discovery of parsimonious, accurate, and predictive polynomials. The presented experimental results show that this regularization approach outperforms traditional genetic programming on benchmark data mining and practical time-series prediction tasks.

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

kolmogorov-gabor polynomials
time series prediction


Distribution of controlled Lyapunov exponents: a statistical simulation study A feedback control design method was proposed in Chen and Lai (1996, Internat. J. Bifur, Chaos 6, 13411349) towards anti-control of chaos by means of making an arbitrary discrete-time dynamical system behave chaotically, where the feedback control can force all the Lyapunov exponents of the controlled system become strictly positive. Since a control sequence so designed is not uniquely determined, random mechanism can be used to select a suitable control-gain sequence. The behavior (distribution) of the controlled Lyapunov exponents generated by the proposed method is important and hence calls for further statistical analysis. Using Monte Carlo simulations, we examine the distribution empirically in this paper.

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


Cluster analysis in industrial market segmentation through artificial neural network Market segmentation has commonly applied cluster analysis. This study intends to make the comparison of conventional two-stage method with proposed two-stage method through the simulated data. The proposed two-stage method is the combination of self-organizing feature maps and K-means method. The simulation results show that the proposed scheme is better than the conventional two-stage method based on the rate of misclassification. (C) 2002 Elsevier Science Ltd. All rights reserved.

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

monte carlo simulation
self-organizing feature maps
k-means


Use of the TRIPOD overlay network for resource discovery ? This paper presents a fully decentralised, efficient and highly scalable resource-discovery approach that is applicable to large heterogeneous and highly dynamic distributed systems. The approach is based on a hybrid overlay network, named TRIPOD, which enables an efficient search for resources in the aforementioned highly distributed, dynamic and largely heterogeneous systems. The key advantages of our solution are its efficient proximity searching, an ability to search over highly dynamic resource properties, the in-built fault tolerance and robustness and, finally, its very low and manageable network overhead.

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

proximity search
overlay networks
grid computing
dynamic systems


Keynote Address: The Challenge of Thalassemia for the Developing Countries Abstract: The thalassemias occur at some of their highest frequencies in the developing countries, particularly those of Asia. In many countries, facilities for the control of these conditions are extremely limited. Although a great deal can be done to help the situation by developing further North-South and South-South partnerships for disseminating better practice, the major problem for the future lies in the unwillingness of governments and international health agencies to accept that the thalassemias present a health burden comparable to that of other major diseases in the developing countries. However, preliminary analyses suggest that, at least in the case of Asia, this is not true. Further work of this nature, together with more detailed frequency and economic data, are required to provide solid evidence for the health burden posed by thalassemia in the developing world. Unless this is done, the large populations of patients with thalassemia in these countries will continue to be neglected.

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

monogenic diseases
sickle cell disorders


Anfis model for vibration signals based on aging process in electric motors In this study, the aging process of an electric motor is accomplished by adaptive neuro-fuzzy inference system (ANFIS) using vibration signals. Different ANFIS models are compared for representing the aging process in the best possible way. An artificial aging experiment is performed and vibration data taken from the initial (healthy) and final (faulty) cases are used to identify the aging process. Four different ANFIS models are presented. Moving average (MA) filters are applied to the input and output pairs for different lagging factors to change the smoothness degree of the data and thus the performance of system identification. The success of the models is evaluated on three conditions; the performance of the ANFIS and the linear correlation between expected output (faulty case data) and aging model output, in time and frequency domains.The study also evaluates the influence of preprocessing using MA filtering on the ANFIS performance for vibration data which have stochastic characteristics.

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

anfis
electric motor
aging
moving average

correlation coefficient
spectral analysis


Learning fuzzy classification rules from labeled data The automatic design of fuzzy rule-based classification systems based on labeled data is considered. It is recognized that both classification performance and interpretability are of major importance and effort is made to keep the resulting rule bases small and comprehensible. For this purpose, an iterative approach for developing fuzzy classifiers is proposed. The initial model is derived from the data and subsequently, feature selection and rule-base simplification are applied to reduce the model, while a genetic algorithm is used for parameter optimization. An application to the Wine data classification problem is shown.

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

compact fuzzy classifier
linguistic model
similarity-driven rule-base reduction


are we living in a robot cargo cult? We use the Cargo Cult metaphor to discuss visions, methods and communication of robot research. Essentially cargo cult involves performing of imitative rituals that are conducted without understanding the underlying cause of a phenomenon. We discuss how this is an ongoing challenge within the field of HRI, and what researchers could do to avoid contributing to a robotic cargo cult.

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

robots in popular culture
robotics research
human-robot interaction


incorporating place name extents into geo-ir ranking This paper proposes a novel Geo-IR ranking method that realizes effective searches that emphasize the user's immediate surroundings. It assesses the extent implied by place names in documents and then emphasizes place names that are highly specific in terms of identifying locations.

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

geographic information retrieval
mobile devices


THE DERIVATIONAL COMPLEXITY INDUCED BY THE DEPENDENCY PAIR METHOD We study the derivational complexity induced by the dependency pair method, enhanced with standard refinements. We obtain upper bounds on the derivational complexity induced by the dependency pair method in terms of the derivational complexity of the base techniques employed. In particular we show that the derivational complexity induced by the dependency pair method based on some direct technique, possibly refined by argument filtering, the usable rules criterion, or dependency graphs, is primitive recursive in the derivational complexity induced by the direct method. This implies that the derivational complexity induced by a standard application of the dependency pair method based on traditional termination orders like KBO, LPO, and MPO is exactly the same as if those orders were applied as the

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


a software architecture-based framework for highly distributed and data intensive scientific applications Modern scientific research is increasingly conducted by virtual communities of scientists distributed around the world. The data volumes created by these communities are extremely large, and growing rapidly. The management of the resulting highly distributed, virtual data systems is a complex task, characterized by a number of formidable technical challenges, many of which are of a software engineering nature. In this paper we describe our experience over the past seven years in constructing and deploying OODT, a software framework that supports large, distributed, virtual scientific communities. We outline the key software engineering challenges that we faced, and addressed, along the way. We argue that a major contributor to the success of OODT was its explicit focus on software architecture. We describe several large-scale, real-world deployments of OODT, and the manner in which OODT helped us to address the domain-specific challenges induced by each deployment.

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


A case against K-d-based transport models: natural attenuation at a mill tailings site This study compares numerical modeling results of contaminant transport using a multi-component coupled reactive mass transport model and a distribution coefficient (K-d)-based transport model. The study site is a contaminated groundwater aquifer underneath a uranium mill tailings pond in the western USA. Advective-dispersive-reactive transport is simulated for a 5-year period of intrusion of tailings fluid into the shallow aquifer, followed by flushing with uncontaminated upgradient groundwater for 1600 years. The coupled model shows that groundwater-sediment interactions result in multiple concentration waves, strong interactions among solutes, and chemical heterogeneity in both space and time. As a result, calculated K-d values vary spatially and temporarily. None of these characteristics can be simulated with a K-d-based model. These results illustrate the shortcomings of the K-d approach, the usage of which is prevalent in the regulatory environment. (C) 2003 Elsevier Science Ltd. All rights reserved.

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


Inferential MIMO predictive control of the particle size distribution in emulsion polymerization A new inferential 2-step multiple input/multiple output (MIMO) model predictive control (MPC) of the particle size distribution (PSD) in emulsion polymerization processes is proposed. The bulk-like model describing the PSD is used with the material balances of initiator, radicals, monomer and surfactant. The inferential 2-step control strategy uses two measurements available online (without delay): the concentration of surfactant in the aqueous phase by conductimetry, and the concentration of monomer by calorimetry. In a first step, the optimal trajectory of surfactant concentration leading to the target PSD is calculated offline. In a second step, a multivariable model predictive control manipulates online the monomer and surfactant flow rates in order to track the precalculated surfactant concentration trajectory and to maximise the monomer concentration in the polymer particles in a constrained set-point tracking. Two control strategies are compared (nonlinear MPC and linearized MPC) with and without modelling errors. (C) 2011 Elsevier Ltd. All rights reserved.

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

model predictive control
emulsion polymerization
particle size distribution

nonlinear distributed parameter system
inferential control


Multicanonical jump walk annealing assisted by tabu for dynamic optimization of chemical engineering processes A hybrid methodology, viz., multicanonical jump walk annealing assisted by tabu list (MJWAT) is proposed for solving dynamic optimization problems in chemically reacting systems. This method combines the power of multicanonical sampling with the beneficial features of simulated annealing. Incorporating tabu list further enhances the efficiency of the method. The superior performance of the MJWAT is highlighted with the help of five benchmark case studies.

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

dynamic optimization
simulated annealing

monte carlo simulations
multicanonical algorithms
metaheuristics
tabu conditions


a generalized bound on lpt sequencing In this paper we shall generalize Graham's result so as to include a parameter characterizing the number of tasks assigned to processors by the LPT rule. The new result will show that the worst-case performance bound for LPT sequencing approaches unity approximately as 1+1/k, where k is the least number of tasks on any processor, or where k is the number of tasks on a processor whose last task terminates the schedule. Thus, we shall have a result very similar to the parameterized bounds for bin-packing heuristics [JDUGG]. We shall also obtain out of the analysis an alternate proof of Graham's result.

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

processor task heuristics paper analysis performance


Adaptive Memetic Differential Evolution with Global and Local neighborhood-based mutation operators Differential Evolution (DE) is one of the most popular optimization methods for real-valued problems and a large number of its variants have been proposed so far. However, bringing together different ideas that already led to successful DE versions is rare in the literature. In the present paper a novel DE algorithm is proposed, in which three among the most efficient concepts already applied separately within DE framework are gathered together, namely: (1) the adaptation of algorithm control parameters and probabilities of using different mutation strategies; (2) the use of NelderMead algorithm as a local search method hybridized with DE; and (3) the splitting mutation into Global and Local models, when Local mutation model is based on the concept of neighborhood of individuals organized on a ring topology. The performance of the novel algorithm, called Adaptive Memetic DE with Global and Local neighborhood-based mutation operators is compared with 13 different DE variants on a set of 25 popular problems which include rotated, shifted and hybrid composition functions. It is found that, although none DE algorithm outperforms all the others for the majority of problems, on average the proposed approach perform better than all 13 DE algorithms selected for comparison. The proposed algorithm is another heuristic approach developed to solve optimization problems. The question may arise, whether proposing novel methods is useful as No Free Lunch theorems for optimization state that the expected performance of all possible heuristics on all possible problems is equal. In the last section of the paper the limitations and implications of No Free Lunch theorems are discussed based on rich, but unfortunately frequently neglected literature. A very simple continuous and differentiable minimization problem is proposed, for which it is empirically verified that each among considered 14 DE algorithms perform poorer than random sampling. It is also empirically shown that when all considered DE algorithms search for the maximum of the proposed problem, they found lower minimum than DE algorithms searching for the minimum. Such result is not unexpected according to No Free Lunch theorems and should be considered as a precaution from generalization of good performance of heuristic optimization methods.

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

evolutionary algorithm
memetic algorithm
memetic computing
self-adaptation
global numerical optimization


Fabrication of various curved relief structures through concave surface forming and soft replica molding In this case, our groups presented various optical structures through the presented method, involving concave surface forming and soft replica molding. The method of concave surface forming is mainly for the fabrication of concave surface. The method of soft replica molding is mainly for the fabrication of replica. Concave and convex relief structures, including circular curved relief structures, convex relief structures with platform structures on the top, refractive beam-shaping elements, these structures with dual curvatures and asymmetric structures, can be easily made through the presented method, respectively. All processes of manufacture are in several simple steps without multistep optical lithography and complex masks.

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

soft replica molding
concave surface forming
curved relief structures


Computing the ground state and dynamics of the nonlinear Schrdinger equation with nonlocal interactions via the nonuniform FFT We present efficient and accurate numerical methods for computing the ground state and dynamics of the nonlinear Schrdinger equation (NLSE) with nonlocal interactions based on a fast and accurate evaluation of the long-range interactions via the nonuniform fast Fourier transform (NUFFT). We begin with a review of the fast and accurate NUFFT based method in [29] for nonlocal interactions where the singularity of the Fourier symbol of the interaction kernel at the origin can be canceled by switching to spherical or polar coordinates. We then extend the method to compute other nonlocal interactions whose Fourier symbols have stronger singularity at the origin that cannot be canceled by the coordinate transform. Many of these interactions do not decay at infinity in the physical space, which adds another layer of complexity since it is more difficult to impose the correct artificial boundary conditions for the truncated bounded computational domain. The performance of our method against other existing methods is illustrated numerically, with particular attention on the effect of the size of the computational domain in the physical space. Finally, to study the ground state and dynamics of the NLSE, we propose efficient and accurate numerical methods by combining the NUFFT method for potential evaluation with the normalized gradient flow using backward Euler Fourier pseudospectral discretization and time-splitting Fourier pseudospectral method, respectively. Extensive numerical comparisons are carried out between these methods and other existing methods for computing the ground state and dynamics of the NLSE with various nonlocal interactions. Numerical results show that our scheme performs much better than those existing methods in terms of both accuracy and efficiency.

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

nonlinear schrdinger equation
nonlocal interactions
nonuniform fft
ground state
dynamics

poisson equation
fractional poisson equation


Comparison of three simulation methods for colloidal aggregates in Stokes flow: Finite elements, lattice Boltzmann and Stokesian dynamics Dilute suspensions of colloidal aggregates of two different types are investigated numerically by three different methods; Stokesian dynamics (SD), the finite element method (FEM) and the lattice Boltzmann method (LBM). The Navier-Stokes equations are solved in the zero-Reynolds-number limit, and the fluid forces acting on particles within the aggregates as well as the aggregates' influence on the fluid flow are evaluated by the discrete methods. Two fluid-flow profiles are considered; uniform plug flow and linear shear flow. The paper compares three methods in their own typical simulation environment. Thus, the results may provide practical guidelines on which methods to chose for certain accuracy requirements. (C) 2013 Elsevier Ltd. All rights reserved.

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

aggregate
colloid
uniform and shear flow
low reynolds number
comparison of methods


Band structure optimization of two-dimensional photonic crystals in H-polarization In the study of photonic crystals, the question arises naturally: Which crystals produce the largest band gaps? This question is investigated by means of an optimization This question based evolution algorithm which, given two dielectric materials, seeks to produce a material distribution within the fundamental cell which produces a maximal band gap at a given point in the spectrum. The case of H-polarization in two dimensions is considered. Several numerical examples are presented. (C) 2000 Academic Press.

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


ONTOLOGICAL COGNITIVE MAP A cognitive map model provides a graphical representation of an influence network between concepts. One drawback of this model is that large cognitive maps are difficult to exploit and understand. This paper introduces an ontological cognitive map model that enables the designer to organize concepts in an ontology. On the one hand, this model provides an ontological influence mechanism that shows the influence from any concept of the ontology to any other according to the map. The map is then easier to exploit. On the other hand, the ontology is used for providing a synthetical view of a map. The map is then easier to understand.

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


Characterization of Co-blockers for Simple Perfect Matchings in a Convex Geometric Graph Consider the complete convex geometric graph on vertices, CGG , i.e., the set of all boundary edges and diagonals of a planar convex -gon P. In (Keller and Perles, Israel J Math 187:465-484, 2012), the smallest sets of edges that meet all the simple perfect matchings (SPMs) in CGG (called "blockers") are characterized, and it is shown that all these sets are caterpillar graphs with a special structure, and that their total number is . In this paper we characterize the co-blockers for SPMs in CGG , that is, the smallest sets of edges that meet all the blockers. We show that the co-blockers are exactly those perfect matchings M in CGG where all edges are of odd order, and two edges of M that emanate from two adjacent vertices of P never cross. In particular, while the number of SPMs and the number of blockers grow exponentially with m, the number of co-blockers grows super-exponentially.

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

convex geometric graphs
semi-perfect matchings


Planar straight-line point-set embedding of trees with partial embeddings Given a set P of n points in the plane, an n-node tree T, and a partial embedding E of T on P (i.e. a planar straight-line point-set embedding of some sub-trees of T on a sub-set of P), we show that the problem of deciding whether there is a planar straight-line point-set embedding of T on P that includes E is NP-complete. This problem was posed as an open problem in E. Di Giacomo et al. (2009) [8]. (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 O O O O O O O O O O O O O O O O O O O O O O O O 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 geometry
computational complexity
geometric embedding
point-set embedding
constrained graph drawing
partial drawing


Adaptive PI Hermite neural control for MIMO uncertain nonlinear systems This paper presents an adaptive PI Hermite neural control (APIHNC) system for multi-input multi-output (MIMO) uncertain nonlinear systems. The proposed APIHNC system is composed of a neural controller and a robust compensator. The neural controller uses a three-layer Hermite neural network (HNN) to online mimic an ideal controller and the robust compensator is designed to eliminate the effect of the approximation error introduced by the neural controller upon the system stability in the Lyapunov sense. Moreover, a proportionalintegral learning algorithm is derived to speed up the convergence of the tracking error. Finally, the proposed APIHNC system is applied to an inverted double pendulums and a two-link robotic manipulator. Simulation results verify that the proposed APIHNC system can achieve high-precision tracking performance. It should be emphasized that the proposed APIHNC system is clearly and easily used for real-time applications.

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

hermite neural network
neural control
robotic manipulator


Study of the Mach-Zehnder interferometric technique for dielectric resonator tuning The modulation of a microwave-scale Mach-Zehnder interferometer coupled to a dielectric resonator (DR) tunes the DR resonance frequency. We report on a theoretical study to develop an understanding of the intrinsic tuning properties of an Mach-Zehnder interferometer ring-DR-microstrip line system and present an experimental verification. 2013 Wiley Periodicals, Inc. Int J RF and Microwave CAE 24:229236, 2014.

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

satellite communications
mach-zehnder interferometer


Efficient cross-layer protocol for bandwidth-satisfied multicast in multi-rate MANETs Since the multi-rate enhancements have been implemented in 802.11 wireless networks, QoS-constrained multicast protocols for multimedia communication should be adapted to exploit them fully. This work proposes a multicast protocol for data rate selection and bandwidth-satisfied multicast tree determination with an efficient cross-layer design based on the integration of PHY and MAC layers into the network layer. To use bandwidth efficiently and increase network capacity (which is the number of multicast flows supported by the network), we aim to select the combination of data rates and a multicast tree whose total amount of bandwidth consumption to the network is minimal in order to maximize the network capacity. The performance of the proposed protocol is compared with two existing protocols. Simulation results indicate that the proposed protocol has the ability to admit more multicast flows.

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

ad-hoc network
cross-layer
multi-rate
bandwidth-satisfied


the decidability of the reachability problem for vector addition systems (preliminary version) Let V be a finite set of integral vectors in Euclidian N-space, and let &abarbelow; be an integral point in the first orthant of N-space. The reachability set R(&abarbelow;,V) is the set of integral points &bbarbelow; in the first orthant such that there is a polygonal path &ggr; from &abarbelow; to &bbarbelow; satisfying (i) all of &ggr; lies in the first orthant, and (ii) the edges of &ggr; are translates of the vectors in V. The reachability problem for the vector addition system (&abarbelow;,V) asks for an algorithm to decide which integral points &bbarbelow; are in R(&abarbelow;,V). In this paper we give an algorithm to solve this problem.

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

point version paper algorithm systems decidability reachability


from sockets and rmi to web services Traditional coverage of network programming techniques in a computer networking course addresses sockets, remote procedure call, and object-oriented remote procedure call. We propose two innovations to that coverage. The first is to emphasize the historical development of those techniques as a sequence with each technique evolving from the previous one. The second innovation is to extend the historical development and the techniques to the important current technique of web services.

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

java remote method invocation
net-centric computing
computer science education


Distributed vector processing of a new local multiscale Fourier transform for medical imaging applications The recently developed S-transform (ST) combines features of the Fourier and Wavelet transforms; it reveals frequency variation over both space and time. It is a potentially powerful tool that can be applied to medical image processing including texture analysis and noise filtering. However, calculation of the ST is computationally intensive, making conventional implementations too slow for many medical applications. This problem was addressed by combining parallel and vector computations to provide a 25-fold reduction in computation time. This approach could help accelerate many medical image processing algorithms.

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

biomedical image processing
discrete fourier transforms
distributed computing


Kinematics and workspace modeling of a new hybrid robot used in minimally invasive surgery The geometric and kinematic models of a new surgical hybrid robot used for camera and active instruments positioning are presented in this paper. The robot workspace is computed and illustrated following the singularities analysis. The robot structure consists of two modules: the PARAMIS robot, and the new serial positioning module. The serial positioning module is used to obtain a mechanically fixed remote center of motion (RCM), enabling the structure to manipulate also active instruments. The new robot provides the necessary motion control to respect the particularities and restrictions of surgical applications. The detailed workspace analysis demonstrates the importance of the relative positioning between the robot and the patient. A constructive solution of the new serial module, the numerical results and conclusions from the performed simulations are described.

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

kinematics
hybrid robot
minimally invasive surgery
workspace modeling


Hospital information systems: perspectives on problems and prospects, 1979 and 2002 Purpose: To assess progress made in hospital information systems (HIS) since 1979, when the forerunner of the International Medical Informatics Association Working Group on HIS first met. Methods: A review of the recommendations made in 1979 identified core concerns, which were analyzed in light of the state of the art in 2002. Results: Despite significant changes over the years, the underlying concerns identified in 1979 are still valid today. In 2002 as in 1979, HIS must be integrated into the hospital's organizational structure; financial and economic benefits depend upon using technology as an enabler of improved clinical outcomes; and education and training remain critical to the successful use of technology solutions. The tools available for addressing these concerns have changed enormously. Where there were dumb terminals, there are the World Wide Web and handheld devices. As a result, we are raising our expectations and changing the terms of our discussions. Today the focus is shifting to patient safety, decision support, and evidence-based practice; the concerns voiced in 1979 have become medical informatics cornerstones. New tools and new approaches now available can improve the quality of care. Using them appropriately requires careful planning and education for patients as well as healthcare professionals.

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

hospital information systems
medical informatics

clinical informatics
patient care
international conferences


Leveraging Coordinative Conventions to Promote Collaboration Awareness The paper discusses the conventions used by medical practitioners to improve their collaboration mediated by Clinical Records. The case study focuses on the coordinative conventions identified in two wards of an Italian hospital and highlights their role and importance in the definition of the requirements of any system supportive of collaborative work practices. These requirements are expressed in terms of the provision of artifact-mediated information that promotes collaboration awareness. The study identified several kinds of Awareness Promoting Information (API): the paper discusses how they can be conveyed both in the web of documental artifacts constituting a Clinical Record and in its computer-based counterpart, the Electronic Patient Record (EPR). The paper ends with the implications for the design of EPRs and for their integration with Hospital Information Systems in light of the findings.

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

clinical record
coordinative conventions
collaboration awareness
awareness promoting information
electronic patient record


Improvement of wireless power transmission efficiency of implantable subcutaneous devices by closed magnetic circuit mechanism Induction coils were fabricated based on flexible printed circuit board for inductive transcutaneous power transmission. The coil had closed magnetic circuit (CMC) structure consisting of inner and outer magnetic core. The power transmission efficiency of the fabricated device was measured in the air and in vivo condition. It was confirmed that the CMC coil had higher transmission efficiency than typical air-core coil. The power transmission efficiency during a misalignment between primary coil and implanted secondary coil was also evaluated. The decrease of mutual inductance between the two coils caused by the misalignment led to a low efficiency of the inductive link. Therefore, it is important to properly align the primary coil and implanted secondary coil for effective power transmission. To align the coils, a feedback coil was proposed. This was integrated on the backside of the primary coil and enabled the detection of a misalignment of the primary and secondary coils. As a result of using the feedback coil, the primary and secondary coils could be aligned without knowledge of the position of the implanted secondary coil.

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

transcutaneous
implantable
wireless power transmission
closed magnetic circuit
misalignment


Comment on the paper On the memory complexity of the forwardbackward algorithm, by Khreich W., Granger E., Miri A., Sabourin, R. The EFFBS algorithm, proposed by Khreich et. al (2010) as an alternative to the Baum-Welch recursions, is reviewed. The EFFBS algorithm suffers from a numerical problem that limits its applicability in estimating HM models. The problem is due to an accumulation of a round-off error that leads the solution to diverge form the correct one. A possible explanation of the reasons of the error is given together with some illustrative examples.

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

hidden markov model
em algorithm
decoding


An Approximation Algorithm for the Minimum Breakpoint Linearization Problem In the recent years, there has been a growing interest in inferring the total order of genes or markers on a chromosome, since current genetic mapping efforts might only suffice to produce a partial order. Many interesting optimization problems were thus formulated in the framework of genome rearrangement. As an important one among them, the minimum breakpoint linearization (MBL) problem is to find the total order of a partially ordered genome that minimizes its breakpoint distance to a reference genome whose genes are already totally ordered. It was previously shown to be NP-hard, and the algorithms proposed so far are all heuristic. In this paper, we present an m(2)+m/2-approximation algorithm for the MBL problem, where m is the number of gene maps that are combined together to form a partial order of the genome under investigation.

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

comparative genomics
partially ordered genomes
approximation algorithms


Petaflop hydrokinetic simulations of complex flows on massive GPU clusters We present recent extensions of the MUPHYcomputational framework for multi-scale simulation of complex bio-fluidic phenomena in real-life geometries. The new framework, which builds on concurrent advances of the computational modeling and parallelization techniques, is able to simulate suspensions with several hundreds of millions of finite-size bodies, interacting with each other and with the surrounding fluid, in geometries of realistic anatomic complexity. Blood flow through the human coronary arteries, at physiological hematocrit values, is simulated with a spatial resolution of 10 micrometers, comparable with the size of red blood cells. The simulation exhibits excellent parallel scalability on a cluster of 4000 M2050 Nvidia GPUs, with an aggregate performance close to 1 Petaflop/s.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 elements modelling of scattering problems for flexural waves in thin plates: Application to elliptic invisibility cloaks, rotators and the mirage effect We propose a finite elements algorithm to solve a fourth order partial differential equation governing the propagation of time-harmonic bending waves in thin elastic plates. Specially designed perfectly matched layers are implemented to deal with the infinite extent of the plates. These are deduced from a geometric transform in the biharmonic equation. To numerically illustrate the power of elastodynamic transformations, we analyze the elastic response of an elliptic invisibility cloak surrounding a clamped obstacle in the presence of a cylindrical excitation i.e. a concentrated point force. Elliptic cloaking for flexural waves involves a density and an orthotropic Youngs modulus which depend on the radial and azimuthal positions, as deduced from a coordinates transformation for circular cloaks in the spirit of Pendry et al. [Science 312, 1780 (2006)], but with a further stretch of a coordinate axis. We find that a wave radiated by a concentrated point force located a couple of wavelengths away from the cloak is almost unperturbed in magnitude and in phase. However, when the point force lies within the coating, it seems to radiate from a shifted location. Finally, we emphasize the versatility of transformation elastodynamics with the design of an elliptic cloak which rotates the wavevector of a flexural wave within its core.

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

finite elements
perfectly matched layers
transformation elastodynamics
cloaking


Object tracking under low signal-to-noise-ratio with the instantaneous-possible-moving-position model Combing image processing technique and the probabilistic data association (PDA) motion model, we develop a novel framework to solve the problem of object tracking for non-electromechanical system with overwhelming noise background. The new model has two advantages: (1) By integrating the statistical motion model, the movement of object in many non-electromechanical systems could be more precisely simulated than existing ones. (2) Because of the adoption of a global search for optimal model parameters, the proposed model is better to track objects in high noise environment, comparing with other methods that rely on consecutive frames differentiating. We derive the expectationmaximization (EM) algorithm within the proposed model. Its usefulness is demonstrated with both synthesized data and image data set. Model Stability is introduced to quantify the usefulness of the model.

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

object tracking
motion model
em algorithm
probabilistic data association


Low-Rank Matrix Recovery From Errors and Erasures This paper considers the recovery of a low-rank matrix from an observed version that simultaneously contains both 1) erasures, most entries are not observed, and 2) errors, values at a constant fraction of (unknown) locations are arbitrarily corrupted. We provide a new unified performance guarantee on when minimizing nuclear norm plus norm succeeds in exact recovery. Our result allows for the simultaneous presence of random and deterministic components in both the error and erasure patterns. By specializing this one single result in different ways, we recover (up to poly-log factors) as corollaries all the existing results in exact matrix completion, and exact sparse and low-rank matrix decomposition. Our unified result also provides the first guarantees for 1) recovery when we observe a vanishing fraction of entries of a corrupted matrix, and 2) deterministic matrix completion.

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

low-rank
robustness
sparsity
statistical learning


Global optimal ICA and its application in MEG data analysis This paper presents a new global optimal independent component analysis (ICA) algorithm. The constrained optimization problem, which is typically encountered with conventional ICA, is converted to an unconstrained problem with the orthogonal projection approach. Then the particle swarm optimization (PSO) is employed to solve the unconstrained problem and determine the separating matrix of ICA. Applications in the analysis of the magnetoencephalographic recordings (MEG) illustrate the efficiency of the proposed PSOICA 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 B O

independent component analysis (ica)
global optimization
particle swarm optimization (pso)


On the exact solution of the multi-period portfolio choice problem for an exponential utility under return predictability We consider the multi-period portfolio choice problem for an exponential utility. The closed-form solution is derived under return predictability. The results without predictable variables are obtained as a partial case. The cumulative empirical distribution function of the investors wealth is analyzed.

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

multi-period asset allocation
expected utility optimization
exponential utility function


Biplanar Graphs:: A Survey A graph is called biplanar if it is the union of two planar graphs. In this survey, we present a variety of results on biplanar graphs, some special families of such graphs, and some generalizations.

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

thickness
doubly linear graphs
visibility graphs


A deterministic inventory/production model with general inventory cost rate function and piecewise linear concave production costs We present a thorough analysis of the economic production quantity model with shortages under a general inventory cost rate function and piecewise linear concave production costs. Consequently, an effective solution procedure, particularly useful for an approximation scheme, is proposed. A computational study is appended to illustrate the performance of the proposed solution procedure.

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


E-beam lithography of computer generated holograms using a fully vectorial 3D beam propagation method A fully vectorial 3D beam propagation method (BPM) has been applied to obtain a required pattern of computer generated hologram (CGH) with a variable profile of four phase levels. The computer reconstruction of the CGH image having one and two focal spots was performed by application of the fully vectorial 3D BPM method. After transferring the CGH by EBL technique an adequate phase profile was obtained. Inter-level parameter method was developed to obtain the estimated an electron beam dose required for the even topographical patterning. Using this method, an EBL exposure dose determined to achieve the required relief amplitude of 1.29?m was 43?C/cm2. The manufactured holograms showed that the overall proposed production process, from the 3D BPM computer simulation to e-beam lithography, can be used to obtain good quality product with reasonable time and computational resources.

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

fully vectorial beam propagation method
e-beam lithography


Effective bandwidth estimation and testing for Markov sources This work addresses the resource sharing problem in broadband communication networks that can guarantee some quality of service (QoS), and develops some results about data source and traffic modelling, especially in aspects of model testing and parameter estimation. The multiplexing of variable bit rate (VBR) sources poses a mathematical and statistical problem: the estimation of the resource requirements of a source or set of sources. The estimation method shall be simple enough to be practically implemented in the connection acceptance control (CAC) function. In this paper, the VBR video sources are taken as a typical case of variable rate, with real-time constraints. This association of requirements makes the case especially interesting. A Markov model is assumed for the VBR sources. The validity of such models is under research; they seem to be appropriate at least in certain time scales. The model is tested against real video traces. In order to estimate the resource allocation or channel occupation of each source, the concept of equivalent bandwidth proposed by Kelly [Notes on effective bandwidth, in: F.P. Kelly, S. Zachary, I.B. Ziedins (Eds.), Stochastic Networks: Theory and Applications, Oxford University Press, Oxford, 1996, pp. 141] is used; it is based on a consistent mathematical theory, and has proven to be robust and useful for technical applications. A calculation of the equivalent bandwidth of a Markov source, given its parameters, can be found in the literature [IEEE ACM Trans. Networking 1 (4) (1993) 424]. But in fact, one can only estimate model and parameters. In this work, an estimation of the equivalent bandwidth is given, which can be obtained from real data. The convergence and the consistency of the estimation are studied, and practical bounds are found. Illustrative calculations are performed from real video traces that were obtained using a software MPEG coder, developed by the authors. The mathematical and statistical results are valid for whatever phenomenon that can be modelled as a Markov process.

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

effective bandwidths
infinitesimal generators
central limit theorems
traffic on broadband networks
real time on atm


sensory puzzles Traditional jigsaw puzzles provide interesting visual stimulation, but hold diminished rewards for visually impaired users. We have built a puzzle whose pieces play portions of music and include a tangible topology representing their contents, giving auditory and tactile feedback about the pieces' role in the puzzle's overall solution. In addition to providing entertainment, the puzzle pieces support learning about music, experimentation, and social, collaborative construction. By employing multiple senses --hearing, touch, vision-- our sensory puzzle provides a rich interaction, play and learning space accessible to individuals with various sensory abilities.

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

tangible interfaces
education
collaboration
multimodal


Ontologies as facilitators for repurposing web documents This paper investigates the role of ontologies as a central part of an architecture to repurpose existing material from the web. A prototype system called ArtEquAKT is presented, which combines information extraction, knowledge management and consolidation techniques and adaptive document generation. All of these components are co-ordinated using one central ontology, providing a common vocabulary for describing the information fragments as they are processed. Each of the components of the architecture is described in detail and an evaluation of the system discussed. Conclusions are drawn as to the effectiveness of such an approach and further challenges are outlined.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 extraction
ontology population
narrative generation


A simplified implicit Maxwell solver We apply the second-order formulation of Maxwell's equations proposed by Jiang et al. (1996, J. Comput. Phys. 125, 104) to the solution of the implicit formulation of the three-dimensional, time-dependent Vlasov-Maxwell's system. An implicit finite difference algorithm is developed to solve the Maxwell's equations in a bounded domain with physical boundary conditions comprising electrically conducting walls (perfect conductors) and constant magnetic flux walls. We formulate the boundary conditions for Maxwell's equations to satisfy Poisson's equation throughout the domain by solving it only on the boundary. This eliminates the need for a separate projection step. We compare numerical results with analytical solutions for electromagnetic waves in vacuo, and using the implicit particle-in-cell code CELESTE3D, we test the new solver on the geospace environment modeling magnetic reconnection challenge problem. (C) 2002 Elsevier Science (USA).

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

maxwell's equations
divergence constraints
implicit numerical method
particle-in-cell implicit method


A millimeter-wave resistor-less pulse generator with a new dipole-patch antenna in 65-nm CMOS This paper presents a millimeter-wave (mm-wave) pulse generator (PG) integrated with a new dipole-patch antenna in a 65-nm CMOS process for short range and portable active imaging applications. The integrated wide-band dipole-patch antenna is a combination of two type of radiators, patch and dipole, to exploit both advantages of the two antenna types. The 395-mu m x 625-mu m dipole-patch antenna in the top metal layer of the 65-nm CMOS process has a wide 30.2-GHz bandwidth from 73.9 to 104.1 GHz with minimum reflection coefficient of -29 dB at 101.6 GHz and resistance from 27.3 to 47.5 Omega by simulation in Momentum, ADS 2009. We proposed a resistor-less mm-wave damping PG whose peak-to-peak pulse output is 1.66-V with 9.1-ps duration in HSPICE simulation at the antenna input terminals. Radiation measurements by using a horn antenna and a Schottky diode placed at a 39-mm distance from the chip's surface show the main beam's peak at theta (max) = 17 degrees with a half-power beam-width (HPBW) of 9 degrees and the second beam's peak at theta (sec) = -23 degrees. Maximum radiated powers in horizontal and vertical planes are respectively 2.4 and 0.5 mu W.

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

cmos millimeter-wave integrated circuit
on-chip wide-band antenna


Local Region Descriptors for Active Contours Evolution Edge-based and region-based active contours are frequently used in image segmentation. While edges characterize small neighborhoods of pixels, region descriptors characterize entire image regions that may have overlapping probability densities. In this paper, we propose to characterize image regions locally by defining Local Region Descriptors (LRDs). These are essentially feature statistics from pixels located within windows centered on the evolving contour, and they may reduce the overlap between distributions. LRDs are used to define general-form energies based on level sets. In general, a particular energy is associated with an active contour by means of the logarithm of the probability density of features conditioned on the region. In order to reduce the number of local minima of such energies, we introduce two novel functions for constructing the energy functional which are both based on the assumption that local densities are approximately Gaussian. The first uses a similarity measure between features of pixels that involves confidence intervals. The second employs a local Markov Random Field (MRF) model. By minimizing the associated energies, we obtain active contours that can segment objects that have largely overlapping global probability densities. Our experiments show that the proposed method can accurately segment natural large images in very short time when using a fast level-set implementation.

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


Medium access control in mobile ad hoc networks: challenges and solutions Mobile ad hoc networks (MANETs) are useful in environment where fixed network infrastructure is unavailable. To function normally, MANETs demand an efficient and distributed medium access control (MAC) protocol. However, characteristics of MANETs such as radio link vulnerability, mobility, limited power pose great challenges oil MAC design. This paper surveys the recent advances in MAC design for MANETs. We first identify the challenges that are facing MAC ill MANETs. Then we discuss the proposed MAC schemes according to their design goals, focusing on some critical design issues, and tradeoffs. Finally, we point out some future research directions. Copyright (c) 2006 John Wiley & Sons, Ltd.

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

medium access control (mac)
mobile ad hoc networks (manets)
quality of service (qos)
fairness
energy-efficiency


Follicle stimulating hormone receptor in mesenchymal stem cells integrates effects of glycoprotein reproductive hormones Previously we reported that follicle stimulating hormone (FSH) affects bone degradation in human cells and in follicle stimulating hormone receptor (FSH-R) null mice. Here we describe a FSH-R knockout bone-formation phenotype. We used mesenchymal stem cells (MSCs), osteoblast precursors that express FSH-R, to determine whether FSH regulates bone formation. FSH stimulates MSC cell adhesion 13 h and proliferation at 24 h after addition. On the basis of phylogenetic and clinical precedents, we also examined effects of pregnant levels of human chorionic gonadotropin (hCG) on MSCs. We found effects similar to those of FSH, and RNAi knockdown of FSH-R abrogated both FSH and hCG effects on MSCs. In contrast to effects on MSCs, neither FSH nor hCG had significant effects on osteoblast maturation. Also in MSCs, short-term treatment by FSH and hCG altered signaling pathways for proliferation, including Erk1/2 phosphorylation. Our results show augmentation of MSC proliferation by either FSH at menopausal levels or hCG at normal pregnant levels. We conclude that FSH-R participates in regulation of MSC precursor pools in response to either FSH or hCG, integrating the effects of these two glycoprotein hormones.

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


Improving FPGA repair under real-time constraints An approach to repair FPGA-systems under real time constraints is proposed. The approach dynamically chooses an optimized configuration frame to start scrubbing. A translation circuit converts diagnosis signatures into the chosen frame. A compression heuristic provides translation circuits with manageable sizes. Improvements in probability of successful repair and failures in time are measured.

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


AHA: a knowledge based system for automatic hazard identification in chemical plant by multimodel approach AHA (automatic hazard analyzer), an expert system with new process knowledge models and inference algorithms for hazard analysis, is developed and tested. A multimodel approach is used to build better process models suited to chemical process. Knowledge representation models are composed of a unit knowledge base, an organizational knowledge base and a material knowledge base. Three hazard analysis algorithms (deviation, malfunction and accident analysis algorithm) are proposed. AHA is developed using expert system shell G2. The unit knowledge base is devised to model a process unit. It consists of a unit behavior model and a unit function model. In the unit knowledge base, a process unit is modeled in different terms of variable and function. This model represents physical hazards. The organizational knowledge base gives information about spatial arrangement of process units and streams. In a material knowledge base, material properties are considered according to NFPA code. This system performs hazard analysis in terms of both functional failure and variable deviation and thereby improves the quality of analysis and more possible accidents can be identified. The result of analysis provides a pathway leading to an accident, and, therefore, gives not only clear understanding of the accident, but useful information for hazard assessment. Using AHA, proposed methodology is applied to the feed section of an olefin dimerization plant, and performed better than traditional qualitative hazard analysis methods such as HAZOP study.

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


An evaluation of constructive heuristic methods for solving the alternative subgraphs assembly line balancing problem This paper evaluates a set of constructive heuristic methods developed to solve the novel Alternative Subgraphs Assembly Line Balancing Problem (ASALBP), which considers variants for different parts of a production or manufacturing process. Each variant is represented by a precedence subgraph that defines the tasks to be performed and their processing times. The proposed methods use priority rules and random choice to select the assembly subgraphs and to assign the tasks to the stations in order to minimize the number of required workstations. The methods are evaluated by a computational experiment based on medium- and large-scale benchmark problems.

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


ERROR ANALYSIS FOR THE SPARSE GRAPH-BASED SEMI-SUPERVISED CLASSIFICATION ALGORITHM Recently, semi-supervised learning (SSL) has attracted significant attention in machine learning fields. While numerous experimental results have shown the effectiveness of SSL methods, the theoretical analysis in this area is still poorly understood. In this paper, we investigate the generalization performance of the recently proposed sparse graph-based semi-supervised classification algorithm. We use a computationally more simple way to solve the algorithm and present the excess misclassification error bounds. In detail, the Fenchel-Legendre conjugate is first employed to reform the algorithm to an inf-sup problem. Then, the covering number is used to estimate the excess misclassification error. Experiment results are given to demonstrate the effectiveness of the sparse SSL algorithm with new solving strategy.

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

graph-based semi-supervised learning
sparsified manifold regularizer
fenchel-legendre conjugate


Combining the Hanning windowed interpolated FFT in both directions The interpolated fast Fourier transform (IFFT) has been proposed as a way to eliminate the picket fence effect (PFE) of the fast Fourier transform. The modulus based IFFT, cited in most relevant references, makes use of only the 1st and 2nd highest spectral lines. An approach using three principal spectral lines is proposed. This new approach combines both directions of the complex spectrum based IFFT with the Hanning window. The optimal weight to minimize the estimation variance is established on the first order Taylor series expansion of noise interference. A numerical simulation is carried out, and the results are compared with the CramerRao bound. It is demonstrated that the proposed approach has a lower estimation variance than the two-spectral-line approach. The improvement depends on the extent of sampling deviating from the coherent condition, and the best is decreasing variance by 2/7. However, it is also shown that the estimation variance of the windowed IFFT with the Hanning is significantly higher than that of without windowing.

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

interpolated fft
cramerrao bound
hanning window

fast fourier transform (fft)
picket-fence effect


A comparison between Web Service and JAVA Message Service technologies for Event-Driven Mashup execution This paper presents a Service Execution Platform (SEP) for Event-Driven service compositions (a.k.a. Mashups), typically used in domains characterised by a working principle based on asynchronous events. The platform reference model is based on an orchestration system and on a set of Service Proxies (SPs) hosted in the SEP. The orchestration system executes Mashup Sessions by coordinating the actions of the SPs, and takes care of load balancing, security (AAA) and fault tolerance. The paper presents and compares two versions of the SEP based on two different technologies, namely Web Services (WSs) and JAVA Message Service (JMS).

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

mashup
wss
web services
jms
java message service
orchestration


practical dht-based location service for wireless mesh networks Mobility management in Wireless Mesh Networks (WMN) is a hot topic still lacking a final, widely accepted, and deployed solution. The major drawbacks of existing proposals is the fact that they rely on some sort of flooding-based technique and very often they need support from end-users' devices. Flooding in wireless environments leads to increased latency and broadcast storm problems, thus providing low performances. In this paper, we argue that a DHT-based approach can overcome such limitations and provide an effective solution to the mobility management problem. A preliminary evaluation of our DHT-based scheme on a real WMN test-bed shows encouraging results when compared to previous solutions.

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


model driven distribution pattern design for dynamic web service compositions Web service compositions are often used to realise service-based enterpriseapplications. These enterprise systems are built from many existing discreteapplications, often legacy applications exposed using Web service interfaces.Acceptance of these systems is often constrained by non-functional aspects,such as Quality of Service (QoS). A number of factors affect the QoS of anenterprise system, including availability, scalability and performance. Thereare a number of architectural configurations or distribution patterns, whichexpress how a composed system is to be deployed. These distribution patternshave a direct impact upon the QoS of the composition. However, the amount ofcode required to realise these distribution patterns is considerable. Additionally, there is an increased deployment time associated with setting updifferent distribution patterns. We therefore propose a novel approach whichcombines a Model Driven Architecture using UML 2.0 for modeling andsubsequently generating Web service compositions, with a method for achieving dynamic decentralised interaction amongst services with reduced deployment overheads. These approaches combined provide for the generation of dynamic Web service compositions driven by a distribution pattern model.

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


Chemistry of belief - Experiments with doxastic solutions An artificial chemistry approach is adopted to explore new ways of investigating a global dynamic of a collective belief Five derivatives of belief are considered-knowledge, misbelief, delusion, ignorance, and doubt-to be reactants of an abstract chemical solution. The reactants interact one with another by certain laws obtained though unconventional interpretation of a belief update. Several types of reaction systems are studied in computational experiments with the doxastic solutions. A global dynamic of doxastic chemical solutions is also interpreted from a common-sense Point of view.

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

cybernetics
artificial intelligence
behavioural sciences


The surface/surface intersection problem by means of matrix based representations Evaluating the intersection of two rational parameterized algebraic surfaces is an important problem in solid modeling. In this paper, we make use of some generalized matrix based representations of parameterized surfaces in order to represent the intersection curve of two such surfaces as the zero set of a matrix determinant. As a consequence, we extend to a dramatically larger class of rational parameterized surfaces, the applicability of a general approach to the surface/surface intersection problem due to J. Canny and D. Manocha. In this way, we obtain compact and efficient representations of intersection curves allowing to reduce some geometric operations on such curves to matrix operations using results from linear algebra. (c) 2012 Elsevier B.V. All rights reserved.

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

spectrum of bivariate pencils of matrices


Biological sequence alignment on the computational grid using the GrADS framework In spite of the existence of several grid middleware projects, developing and executing programs on the computational grid remains a user intensive process. The goal of the Grid Application Development Software (GrADS) project is to make the grid simpler to use despite the dynamically changing status of grid resources. Protein and genome sequence alignment is a basic operation in bioinformatics, and it requires large data sets and tends to be highly compute intensive. In this paper, we present work done to grid-enable a biological sequence alignment package (FASTA) and to run it under the GrADS framework. We discuss the advantages of using GrADS framework for FASTA.

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

grads project
biological sequence alignment


Unbounded-error quantum query complexity This work studies the quantum query complexity of Boolean functions in an unbounded-error scenario where it is only required that the query algorithm succeeds with a probability strictly greater than 1/2. We show that, just as in the communication complexity model, the unbounded-error quantum query complexity is exactly half of its classical counterpart for any (partial or total) Boolean function. Moreover, connecting the query and communication complexity results, we show that the "black-box" approach to convert quantum query algorithms into communication protocols by Buhrman-Cleve-Wigderson [STOC'98] is optimal even in the unbounded-error setting. We also study a related setting, called the weakly unbounded-error setting, where the cost of a query algorithm is given by q+log(1/2(p 1/2)), where q is the number of queries made and p > 1/2 is the success probability of the algorithm. In contrast to the case of communication complexity, we show a tight multiplicative Theta(log n) separation between quantum and classical query complexity in this setting for a partial Boolean function. The asymptotic equivalence between them is also shown for some well-studied total Boolean functions. Crown Copyright (C) 2011 Published by Elsevier B.V. All rights reserved.

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

query complexity
communication complexity


Relational Operations and Uncertainty Measure in Rough Relational Database The traditional relational database model (RDM) is not effective for dealing with imprecise and uncertain data as it deals with precise and unambiguous data. Hence, Beaubouef et al. proposed the rough relational database model (RRDM) for the management of uncertainty in relational databases. Beaubouef et al. defined the corresponding rough relational operators in rough relational databases as in ordinary relational databases. And to give an effective measure of uncertainty in rough relational databases, they defined the rough relation entropy. In this paper, we further discuss the issues of relational operations and uncertainty measure in rough relational databases. We give some new definitions for rough relational operators and rough relation entropy in rough relational databases. Furthermore, we discuss the basic properties of rough relational operators and rough relation entropy, as well as the connections between rough relational operators and rough relation entropy.

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

rdm
rrdm
rough relation entropy
relational operations