towards real-time measurement of customer satisfaction using automatically generated call transcripts Customer satisfaction is a very important indicator of how successful a contact center is at providing services to the customers. Contact centers typically conduct a manual survey with a randomly selected group of customers to measure customer satisfaction. Manual customer satisfaction surveys, however, provide limited values due to high cost and the time lapse between the service and the survey. In this paper, we demonstrate that it is possible to automatically measure customer satisfaction by analyzing call transcripts enabling companies to measure customer satisfaction for every call in near real-time. We have identified various features from multiple knowledge sources indicating prosodic, linguistic and behavioral aspects of the speakers, and built machine learning models that predict the degree of customer satisfaction with high accuracy. The machine learning algorithms used in this work include Decision Tree, Naive Bayes, Logistic Regression and Support Vector Machines (SVMs). Experiments were conducted for a 5-point satisfaction measurement and a 2-point satisfaction measurement using customer calls to an automotive company. The experimental results show that customer satisfaction can be measured quite accurately both at the end of calls and in the middle of calls. The best performing 5-point satisfaction classification yields an accuracy of 66.09\% outperforming the DominantClass baseline by 15.16\%. The best performing 2-point classification shows an accuracy of 89.42\% and outperforms both the DominantClass baseline and the CSRJudgment baseline by 17.7\% and 3.3\% respectively. Furthermore, Decision Tree and SVMs achieve higher F-measure than the CSRJudgment baseline in identifying both satisfied customers and dissatisfied customers.

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

customer satisfaction
machine learning
classification

speech analytics
contact center calls
natural language processing
text mining


An Analysis of Group Key Agreement Schemes based on the Bellare-Rogaway Model in Multi-party Setting Group key agreement protocols derive a shared secret key for a group of users to ensure data confidentiality or/and integrity among the users in the subsequent communications. In this paper, we inspect two group key agreement schemes which have been proposed by Shi et al. and Zheng et al. in 2005 and 2007 respectively. Although both schemes were claimed to be secure in a heuristic way, we reveal several flaws using the Bellare-Rogaway security model extended to multi-party setting by Bresson et al. These flaws are found to be originated from inappropriate selection of key derivation function, inadvertent exclusion of partners' identities from the protocol specification and insufficient consideration in preserving known temporary information security and key freshness properties. Furthermore, we suggest and discuss proper countermeasures to address such flaws.

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

group key agreement protocol
cryptanalysis


A study on IGBT junction temperature (Tj) online estimation using gate-emitter voltage (Vge) at turn-off We propose a novel method to enable online estimation of IGBT junction temperature. Miller plateau width in Vge waveform depend linearly on IGBT junction temperature. A measurement circuit was implemented at gate level to measure Miller plateau width. A model has been proposed to extract junction temperature from Vge measurements. IGBT module with two chips at different temperatures was analyzed using Vge method.

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

igbt
junction temperature
miller plateau


Indirect formulations for symmetric Galerkin BEM and space derivartive problems An indirect symmetric Galerkin BEM (SGBEM) is applied to 2D potential problems in this paper. Based on the assumption that solutions from different methods should be the same, the hypersingular matrix appeared in SGBEM is approximately expressed by those matrices appeared in asymmetric Galerkin BEM (AGBEM). As only strong and weak singularities need to be solved, the problem becomes much simpler. The space derivatives of potential are expressed with a set of new meaning distributed flux, which will produce the same potential on the boundary position for Omega in the unbounded domain Omega+Omega', so that hypersingularity will not appear for boundary points. Therefore, there is no need of C-1,C-alpha for the spatial interpolation function (no Galerkin integration can be used for this purpose). Formulations for both the steady-state and time-domain potential problems are given. Three numerical examples are analyzed to demonstrate the effectiveness and accuracy of the proposed indirect method.

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

boundary element method
galerkin technique
steady state
time domain


the nsfnet backbone network The NSFNET Backbone Network interconnects six supercomputer sites, several regional networks and ARPANET. It supports the DARPA Internet protocol suite and DCN subnet protocols, which provide delay-based routing and very accurate time-synchronization services. This paper describes the design and implementation of this network, with special emphasis on robustness issues and congestion-control mechanisms.

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

network design supercomputer implementation routing internet paper

time-synchronization
region
delay
interconnect
service
congestion control
robust


Multiple solutions for a discrete boundary value problem involving the p-Laplacian Multiple solutions for a discrete boundary value problem involving the p-Laplacian are established. Our approach is based on critical point theory. (c) 2008 Elsevier Ltd. All rights reserved.

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

difference equations
discrete boundary value problems
p-laplacian
critical points theory


Tiara: A self-stabilizing deterministic skip list and skip graph We present Tiara a self-stabilizing peer-to-peer network maintenance algorithm. Tiara is truly deterministic which allows it to achieve exact performance bounds. Tiara allows logarithmic searches and topology updates. It is based on a novel sparse 0-1 skip list. We then describe its extension to a ringed structure and to a skip-graph. (C) 2012 Elsevier B.V. All rights reserved.

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

peer-to-peer networks
overlay networks
self-stabilization


A behavior-based mobile robot architecture for Learning from Demonstration Autonomous mobile robots (AMRs), to be truly flexible, should be equipped with learning capabilities, which allow them to adapt effectively to a dynamic and changing environment. This paper proposes a modular, behavior-based control architecture, which is particularly suited for Learning from Demonstration experiments in the spatial domain. The robot learns sensory-motor behaviors online by observing the actions of a person, another robot or another behavior. Offline learning phases are not necessary but might be used to trim the attained representation. First results applying RBF-approximation, growing neural cell structures and probabilistic models for progress estimation, are presented.

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

online learning from demonstration
behavior-based architecture
behavior classification
growing neural net
mobile service robot


Shortest Paths in Time-Dependent FIFO Networks In this paper, we study the time-dependent shortest paths problem for two types of time-dependent FIFO networks. First, we consider networks where the availability of links, given by a set of disjoint time intervals for each link, changes over time. Here, each interval is assigned a non-negative real value which represents the travel time on the link during the corresponding interval. The resulting shortest path problem is the time-dependent shortest path problem for availability intervals (TDSPint), which asks to compute all shortest paths to any (or all) destination node(s) d for all possible start times at a given source node s. Second, we study time-dependent networks where the cost of using a link is given by a non-decreasing piece-wise linear function of a real-valued argument. Here, each piece-wise linear function represents the travel time on the link based on the time when the link is used. The resulting shortest paths problem is the time-dependent shortest path problem for piece-wise linear functions (TDSPlin) which asks to compute, for a given source node s and destination d, the shortest paths from s to d, for all possible starting times. We present an algorithm for the TDSPlin problem that runs in time O((F-d + gamma)(|E|+|V|log |V|)) where F-d is the output size (i.e., number of linear pieces needed to represent the earliest arrival time function to d) and gamma is the input size (i.e., number of linear pieces needed to represent the local earliest arrival time functions for all links in the network). We then solve the TDSPint problem. Here, lambda denotes the total number of availability intervals in the entire network. Both methods improve significantly on the previously known algorithms.

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

earliest arrival time
shortest paths
algorithms


A multistage motion vector processing method for motion-compensated frame interpolation In this paper, a novel, low-complexity motion vector processing algorithm at the decoder is proposed for motion-compensated frame interpolation or frame rate up-conversion. We address the problems of having broken edges and deformed structures in an interpolated frame by hierarchically refining motion vectors on different block sizes. Our method explicitly considers the reliability of each received motion vector and has the capability of preserving the structure information. This is achieved by analyzing the distribution of residual energies and effectively merging blocks that have unreliable motion vectors. The motion vector reliability information is also used as a prior knowledge in motion vector refinement using a constrained vector median filter to avoid choosing identical unreliable one. We also propose using chrominance information in our method. Experimental results show that the proposed scheme has better visual quality and is also robust, even in video sequences with complex scenes and fast motion.

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

motion-compensated frame interpolation (mcfi)


High gain microstrip antenna design for broadband wireless applications This article presents a new broadband microstrip antenna for personal communications systems (PCS) applications. Using multilayer substrate structure with aperture-coupled feed, a rectangular microstrip patch antenna operating at 1.9-GHz band is designed and experimentally validated. This antenna configuration uses a quarter-wave transformer to enhance the matching between the feed transmission line and the antenna patch. To demonstrate the design procedure, a first experimental broadband microstrip antenna prototype is designed and implemented. To analyse its performance, measurements are carried out and good performances are achieved. However, this prototype has a low front-to-back ratio. To overcome this drawback, an optimization process is proposed, and a second prototype is designed and successfully realized. To examine the effect of the optimization, experimental investigations are carried out on the second prototype. Very good agreement is obtained between numerical and measured results. Experimental results indicate that the proposed antenna achieves a bandwidth of 21%, a gain of 9.5 dB, and a front-to-back ratio of 20 dB, which are very sufficient for broadband wireless applications. (C) 2003 Wiley Periodicals, Inc.

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


An analytic center quadratic cut method for the convex quadratic feasibility problem We consider a quadratic cut method based on analytic centers for two cases of convex quadratic feasibility problems. In the first case, the convex set is defined by a finite yet large number, N, of convex quadratic inequalities. We extend quadratic cut algorithm of Luo and Sun [3] for solving such problems by placing or translating the quadratic cuts directly through the current approximate center. We show that, in terms of total number of addition and translation of cuts, our algorithm has the same polynomial worst case complexity as theirs [3]. However, the total number of steps, where steps consist of (damped) Newton steps, function evaluations and arithmetic operations, required to update from one approximate center to another is O(1) + O(log(2) log(2) (N-2/epsilon(4))), where epsilon is the radius of the largest ball contained in the feasible set. In the second case, the convex set is defined by an infinite number of certain strongly convex quadratic inequalities. We adapt the same quadratic cut method for the first case to the second one. We show that in this case the quadratic cut algorithm is a fully polynomial approximation scheme. Furthermore, we show that, at each iteration, k, the total number steps (as described above) required to update from one approximate center to another is at most O(1) + O(log(2) log(2) (k(2)/epsilon(4))), with epsilon as defined above.

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

convex quadratic feasibility problem
analytic center
quadratic cuts

interior-point methods
potential function


Low-Power TCAMs for Very Large Forwarding Tables Ternary content-addressable memories (TCAMs) may be used to obtain a simple and very fast implementation of a router's forwarding engine. The applicability of TCAMs is, however, limited by their size and high power requirement. Zane et al. proposed a method and associated algorithms to reduce the power needed to search a forwarding table using a TCAM. We improve on both the algorithms proposed by them. Additionally, we show how to couple TCAMs and high-bandwidth SRAMs so as to overcome both the power and size limitations of a pure TCAM forwarding engine. By using one of our novel TCAM-SRAM coupling schemes (M-12 Wb), we are able to reduce TCAM memory by a factor of about 5 on IPv4 data sets and by a factor of about 2.5 on IPv6 data sets; TCAM power requirement is reduced by a factor of about 10 on IPv4 data sets and by a factor of about 6 on IPv6 data sets. These comparisons are with respect to the improved TCAM algorithms we have developed for the strategies of Zane et al. The stated improvements come at the cost of increasing SRAM requirement by a factor 2.5 for IPv4 data and a factor of 5 for IPv6 data. This cost is unimportant given that SRAMs are relatively quite cheap and have much less power requirement. For another of our novel TCAM-SRAM coupling schemes (1-12Wc), the TCAM memory and power reduced by factors of about 4 and 12 for IPv4 data sets, respectively, and by factors of about 2 and 10 for IPv6 data sets. The SRAM required, however, increased by factors of 3 and 7, respectively. These improvements come with no loss in the time (as measured by the number of TCAM searches and SRAM accesses) to do a lookup.

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

ternary content-addressable memory (tcam)


Content-based retrieval of historical Ottoman documents stored as textual images There is an accelerating demand to access the visual content of documents stored in historical and cultural archives. Availability of electronic imaging tools and effective image processing techniques makes it feasible to process the multimedia data in large databases. In this paper, a framework for content-based retrieval of historical documents in the Ottoman Empire archives is presented. The documents are stored as textual images, which are compressed by constructing a library of symbols occurring in a document, and the symbols in the original image are then replaced with pointers into the codebook to obtain a compressed representation of the image. The features in wavelet and spatial domain based on angular and distance span of shapes are used to extract the symbols. In order to make content-based retrieval in historical archives, a query is specified as a rectangular region in an input image and the same symbol-extraction process is applied to the query region. The queries are processed on the codebook of documents and the query images are identified in the resulting documents using the pointers in textual images. The querying process does not require decompression of images. The new content-based retrieval framework is also-applicable to many other document archives using different scripts.

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

binary wavelet decomposition
content-based retrieval
historical document compression
partial symbol-wise matching


Bayesian analysis of a two-way categorical table incorporating intraclass correlation It is straightforward to analyze data from a single multinomial table. Specifically, for the analysis of a two-way categorical table, the common chi-squared test of independence between the two variables and maximum likelihood estimators of the cell probabilities are readily available. When the counts in the two-way categorical table are formed from familial data (clusters of correlated data), the common chi-squared test no longer applies. We note that there are several approximate adjustments to the common chi-squared test. For example, Choi and McHugh (Choi, J.W. and McHugh, R.B., 1989, A reduction factor in goodness-of-fit and independence tests for clustered and weighted observations. Biometrics , 45, 979-996.) showed how to adjust the chi-squared statistic for clustered and weighted data. However, our main contribution is the construction and analysis of a Bayesian model which removes all analytical approximations. This is an extension of a standard multinomial-Dirichlet model to include the intraclass correlation associated with the individuals within a cluster. We have used a key formula described by Altham (Altham, P.M., 1976, Discrete variable analysis for individuals grouped into families. Biometrika , 63, 263-269.) to incorporate the intraclass correlation. This intraclass correlation varies with the size of the cluster, but we assume that it is the same for all clusters of the same size for the same variable. We use Markov chain Monte Carlo methods to fit our model, and to make posterior inference about the intraclass correlations and the cell probabilities. Also, using Monte Carlo integration with a binomial importance function, we obtain the Bayes factor for a test of no association. To demonstrate the performance of the alternative test and estimation procedure, we have used data on activity limitation status and age from the National Health Interview Survey and a simulation study.

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

clustered data
gibbs sampler
multinomial-dirichlet


Observation and numerical analysis of quantum subband energies from photoluminescence spectra of organic multiple-quantum wells The optical properties of organic light-emitting diodes (OLEDs) containing multiple-quantum wells have been studied. Photoluminescence and electroluminescence spectra clearly reveal a blue-shift with narrowing quantum wells (QWs). This indicates that subband energies are created in the organic QWs due to quantum size effect. Numerical analysis was performed to determine subband energies and effective masses of electrons. These results demonstrate that wavelength of OLEDs can be designed on the basis of quantum size effect.

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


a testbed for wide area atm research Asynchronous Transfer Mode (ATM) has been advocated as the basis of multiservice telecommunications in the next century. However, the public telecommunication technology of the 1990's will be ISDN, which presents a circuit switched subscriber interface. An obvious approach to building a wide area ATM network is to build it on top of primary rate ISDN. In this paper we describe the lessons learned through the design and deployment of such a network.

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

network deployment testbed research paper public telecommunication design


An agent-based perspective to handover management in 4G networks In 3G or earlier generation networks handovers are usually initiated and decided by the base station, oil the basis of measurements of RSS or SNR received by the terminal. cell congestion, terminal speed etc. In 4G, due to the diversity of available radio access services, additional factors. For example User profile, application requirements. and terminal device capabilities, need also to be taken into account. We propose an agent-based architecture that determines the timing and target network for handovers in a 4G network setting. The capabilities of the architecture are provided as a value-added service on top of network operators' wireless access infrastructure. Network selection spans both wireless access and core routing services and is performed by User agents executing in the network side. In order to deal with trust issues we study the integration of the regulatory authority in the architecture. A performance Study of the architecture's impact on handover latency is provided through a simulation system. Copyright (C) 2007 John Wiley & Sons, Ltd.

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


On certain subclasses of meromorphic functions associated with certain integral operators Let ? denote the class of functions of the form f ( z ) = 1 z + ? k = 1 ? a k z k whichare analytic in 0<|z|<1 0 < | z | < 1 . Two new integral operators P ? ? and Q ? ? defined on ? are introduced. This paper gives some subordination and convolution properties of certain subclasses of meromorphic functions which are defined bythe previously-mentioned integral operators.

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

meromorphic functions
integral operators

hadamard product
differential subordination


Pencil-like sketch rendering of 3D scenes using trajectory planning and dynamic tracking We describe a system that produces pencil-like sketches from 3D models. A hierarchical region segmentation and path planning algorithm are presented. A feedback algorithm is used for matching the render with the image. Perceived neatness, skill, and level-of-detail attributes can be controlled.

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

non-photorealistic rendering
dynamic pen model
drawing style


Docking and 3D-QSAR studies of acetohydroxy acid synthase inhibitor sulfonylurea derivatives Docking and three dimensional quantitative-structure activity relationship (3D-QSAR) studies were performed on acetohydroxy acid synthase (AHAS) inhibitor sulfonylurea analogues with potential herbicidal activity. The 3D-QSAR studies were carried out using shape, spatial and electronic descriptors along with a few structural parameters. Genetic function approximation (GFA) was used as the chemometric tool for this analysis. The whole data set (n=45) was divided into a training set (75% of the data set) and a test set (remaining 25%) on the basis of the K-means clustering technique on a standardised topological, physicochemical and structural descriptor matrix. Models developed from the training set were used to predict the activity of the test set compounds. All models were validated internally, externally and using the Y-randomisation technique. Docking studies suggested that the molecules bind within a pocket of the enzyme formed by some important amino acid residues (Met351, Asp375, Arg377, Gly509, Met570 and Val571). In QSAR studies, molecular shape analysis showed that bulky substitution at the R-1 position may enhance AHAS inhibitory activity. Charged surface area descriptors suggested that negative charge distributed over a large surface area may enhance this activity. The hydrogen bond acceptor parameter supported the charged surface area descriptors and suggested that, for better activity, the number of electronegative atoms present in the molecule should be high. The spatial descriptors show that, for better activity, the molecules should possess a bulky substituent and a small substitution at the R-2 and R-3 positions, respectively.

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

genetic function approximation
docking
acetohydroxy acid synthase
sulfonylurea


Layered data association using graph-theoretic formulation with applications to tennis ball tracking in monocular sequences In this paper, we propose a multilayered data association scheme with graph-theoretic formulation for tracking multiple objects that undergo switching dynamics in clutter. The proposed scheme takes as input object candidates detected in each frame. At the object candidate level, "tracklets" are "grown" from sets of candidates that have high probabilities of containing only true positives. At the tracklet level, a directed and weighted graph is constructed, where each node is a tracklet and the edge weight between two nodes is defined according to the "compatibility" of the two tracklets. The association problem is then formulated as an all-pairs shortest path (APSP) problem in this graph. Finally, at the path level, by analyzing the APSPs, all object trajectories are identified, and track initiation and track termination are automatically dealt with. By exploiting a special topological property of the graph, we have also developed a more efficient APSP algorithm than the general-purpose ones. The proposed data association scheme is applied to tennis sequences to track tennis balls. Experiments show that it works well on sequences where other data association methods perform poorly or fail completely.

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


A Reputation-Based Trust Evaluation Model for P2P E-Commerce P2P e-commerce as a new shopping pattern is developing rapidly, and users can transact with anybody anytime and anywhere in the P2P e-commerce system, but as users often interact with strangers, hence building trust among the users, make the users know each other well, estimate the risk of participating in a transaction, and enable to transact securely in the P2P e-commerce system is an urgent problem to be solved for P2P e-commerce nowadays. In order to settle the problem, this paper provides a novel reputation-based trust model in P2P e-commerce system. The main thought of the proposed trust model is that a node has two types of reputation: local reputation and global reputation. In the local reputation computing, we take the calculation of factors including the amount of transaction money and transaction time and so on, and in the global reputation computing, there are three factors introducedthe number of neighbor nodes, the direct trust level of neighbor nodes, and the trust evaluation weight of neighbor nodes, and finally the object node's trust level can be obtained by using the local reputation weight coefficient and the global reputation weight coefficient to integrate the node's local reputation with global reputation. We have conducted two experiments that show that our trust model contrast with the present typical trust models EigenRep and Beta in the aspects of the computing load and the successful transaction rate. The first experiment shows that the trust model has a lower computing load compared to the EigenRep and Beta, because we do not compute the node's reputation through the transitive recommending of the intermediate nodes; the second experiment shows that the trust model has a higher successful transaction rate when the malicious nodes exist in the system, and even the number of malicious nodes proportion is larger, the trust model also has a higher successful transaction rate. In conclusion, the trust model more roundly takes into account the factors affecting the local reputation and global reputation and can greatly improve their computing methods. The experiment results show that the trust model can reduce the trust level computing load, and have more improvements on the successful transaction rate and anti-attack capability compared to the existing trust models. But the trust model does not introduce the risk factor, and the logic of the trust mode is relatively simple, so our trust model still needs to be improved constantly.

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


Higher order deforestation Deforestation is a well known transformation algorithm which can eliminate intermediate structures from functional programs. In previous work, we have shown how the deforestation algorithm can be extended to handle higher order programs. A higher order treeless form of expression was defined to, ensure the termination of this algorithm. Our higher order algorithm was further extended by Seidl and Sorensen, and this extension was shown to remove some intermediate structures not removed by our algorithm (although our original algorithm can also remove some intermediate structures not removed by their technique). In this paper, we show how our original definition of higher order treeless form can be extended to allow the intermediate structures in the examples given by Seidl and Sorensen to be removed. We argue that, because our extended algorithm uses an easy to recognise treeless form, there is more transparency for the programmer in terms of the improvements which will be made. We prove that our new algorithm terminates, and we conjecture that it ensures that there is no efficiency loss, which we argue is essential for any optimisation.

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

deforestation transformation termination efficiency


Trajectory integration with potential energy discontinuities Many approximate methods of quantum chemistry yield potential energy surfaces with discontinuities. While clearly unphysical, such features often fall within the typical error bounds of the method, and cannot be easily eliminated. The integration of nuclear trajectories when the potential energy is locally discontinuous is obviously problematic. We propose a method to smooth out the discontinuities that are detected along a trajectory, based on the definition of a continuous function that fits locally the computed potential, and is used to integrate the trajectory across the discontinuity. With this correction, the energy conservation error can be reduced by about one order of magnitude, and a considerable improvement is obtained in the energy distribution among the internal coordinates.

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

discontinuous potentials
molecular dynamics


minimum energy probabilistic reliable data delivery in wireless sensor networks Many sensor network applications only require probabilistic data delivery, as they can tolerate some missing data samples. For example, in environmental monitoring, missing temperature, pressure and humidity level samples can often be inferred by spatial and/or temporal interpolations. In this paper we propose and study an adaptive p-persistent CSMA-based media access control protocol that supports end-to-end probabilistic reliability for sensor networks on a hop-by-hop basis. In an effort to reduce the probability of packet collisions, first we tune the carrier sensing range of the nodes; then given an end-to-end reliability requirement, we determine the optimal allocation of per-hop reliability requirements on each route to minimize the expected total number of transmissions needed; finally, our adaptive p-persistent CSMA protocol tunes its link persistence probability to further reduce the expected total number of transmissions, and thereby minimizes the energy consumption in the network. We formulate this latter problem as a constrained optimization problem, and then derive an algorithm to adapt the link persistence probabilities using the Lagrangian dual decomposition method.

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

sensor networks
data delivery
reliability


Synthesis of Networks of Custom Processing Elements for Real-Time Physical System Emulation Emulating a physical system in real-time or faster has numerous applications in cyber-physical system design and deployment. For example, testing of a cyber-device's software (e.g., a medical ventilator) can be done via interaction with a real-time digital emulation of the target physical system (e.g., a human's respiratory system). Physical system emulation typically involves iteratively solving thousands of ordinary differential equations (ODEs) that model the physical system. We describe an approach that creates custom processing elements (PEs) specialized to the ODEs of a particular model while maintaining some programmability, targeting implementation on field-programmable gate arrays (FPGAs). We detail the PE micro-architecture and accompanying automated compilation and synthesis techniques. Furthermore, we describe our efforts to use a high-level synthesis approach that incorporates regularity extraction techniques as an alternative FPGA-based solution, and also describe an approach using graphics processing units (GPUs). We perform experiments with five models: a Weibel lung model, a Lutchen lung model, an atrial heart model, a neuron model, and a wave model; each model consists of several thousand ODEs and targets a Xilinx Virtex 6 FPGA. Results of the experiments show that the custom PE approach achieves 4X-9X speedups (average 6.7X) versus our previous general ODE-solver PE approach, and 7X-10X speedups (average 8.7X) versus high-level synthesis, while using approximately the same or fewer FPGA resources. Furthermore, the approach achieves speedups of 18X-32X (average 26X) versus an Nvidia GTX 460 GPU, and average speedups of more than 100X compared to a six-core TI DSP processor or a four-core ARM processor, and 24X versus an Intel I7 quad core processor running at 3.06 GHz. While an FPGA implementation costs about 3X-5X more than the non-FPGA approaches, a speedup/dollar analysis shows 10X improvement versus the next best approach, with the trend of decreasing FPGA costs improving speedup/dollar in the future.

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

ordinary differential equation (ode) solving


On mean distance and girth We bound the mean distance in a connected graph which is not a tree in terms of its order n n and its girth g g . On one hand, we show that the mean distance is at most n + 1 3 ? g ( g 2 ? 4 ) 12 n ( n ? 1 ) ? g ( g ? 2 ) ( n ? g ) 2 n ( n ? 1 ) if g g is even and at most n + 1 3 ? g ( g 2 ? 1 ) 12 n ( n ? 1 ) ? ( g ? 1 ) 2 ( n ? g ) 2 n ( n ? 1 ) if g g is odd. On the other hand, we prove that the mean distance is at least n g 4 ( n ? 1 ) unless G G is an odd cycle. This resolves two conjectures of AutoGraphiX.

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


A categorical expert system Jurassic An expert system Jurassic from the field of paleontology for the determination of a dinosaur species is presented. It helps the paleontologist to determine creatures from uncertain knowledge. The system is composed of 423 rules arranged in a directed acyclic graph of a depth of five. This knowledge is represented by a taxonomical arrangement of verbal categories represented by associative memories. Categorical representation is psychologically motivated and also offers an explanation of how to deal with uncertain knowledge. It is an alternative to other well known uncertainty calculi. During the categorization the model learns to favor these categories which often lead to a successful goal. This may help to speed up the search. Experiments with the availability heuristic in which parts of the knowledge base are primed or forgotten are performed.

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

availability heuristic
uncertain knowledge

hierarchical categorization
neural networks
semantic networks


Efficient immune algorithm for optimal allocations in series-parallel continuous manufacturing systems This paper uses an immune algorithm (IA) meta-heuristic optimization method to solve the problem of structure optimization of series-parallel production systems. In the considered problem, redundant machines and buffers in process are included in order to attain a desirable level of availability. A procedure which determines the minimal cost system configuration is proposed. In this procedure, multiple choices of producing machines and buffers are allowed from a list of product available in the market. The elements of the system are characterized by their cost, estimated average up and down times, productivity rates and buffers capacities. The availability is defined as the ability to satisfy the consumer demand which is represented as a piecewise cumulative load curve. The proposed meta-heuristic is used as an optimization technique to seek for the optimal design configuration. The advantage of the proposed IA approach is that it allows machines and buffers with different parameters to be allocated.

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

manufacturing system
meta-heuristic optimization
availability evaluation


leveraging temporal dynamics of document content in relevance ranking Many web documents are dynamic, with content changing in varying amounts at varying frequencies. However, current document search algorithms have a static view of the document content, with only a single version of the document in the index at any point in time. In this paper, we present the first published analysis of using the temporal dynamics of document content to improve relevance ranking. We show that there is a strong relationship between the amount and frequency of content change and relevance. We develop a novel probabilistic document ranking algorithm that allows differential weighting of terms based on their temporal characteristics. By leveraging such content dynamics we show significant performance improvements for navigational queries.

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

web search
versioned documents
temporal change


On modelling mobility We present a model of distributed computation which is based on a fragment of the pi-calculus relying on asynchronous point-to-point communication. We enrich the model with the following features: the explicit distribution of processes to locations, the routing of messages, the mobility of processes, and the failure of locations and their detection. Our contributions are two folds. At the specification level, we give a synthetic and flexible formalization of the features mentioned above. At the verification level, we provide original methods to reason about the bisimilarity of processes. (C) 2000 Elsevier Science B.V. All rights reserved.

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


Porous alumina as low-? insulator for multilevel metallization Electrochemical anodizing technique was used to form an interlevel alumina insulator for multilevel aluminum metallization. The low dielectric constant of about 2.4 was reached by chemical etching of porous alumina films in anodizing solution. The interlevel insulator based on porous alumina had the following parameters measured: the breakdown voltage was more than 400 V, the leakage current at 15 V applied voltage was less than 10?9 A/cm2. The developed processing technique was tested for CMOS submicron technology. The fabricated aluminumporous alumina structure demonstrated a good chemical and thermal stability, excellent adhesion to underlying and top layers.

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

multilevel metallization
electrochemical anodizing
porous alumina


Errors of linear multistep methods for singularly perturbed Volterra delay-integro-differential equations This paper is concerned with the error behaviour of linear multistep methods applied to singularly perturbed Volterra delay-integro-differential equations. We derive global error estimates of A(alpha)-stable linear multistep methods with convergent quadrature rule. Numerical experiments confirm our theoretical analysis. (C) 2009 IMACS. Published by Elsevier B.V. All rights reserved.

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

linear multistep methods
quadrature rule


Estimating aggregate resource reservation for dynamic, scalable, and fair distribution of bandwidth The current best effort approach to Quality of Service in the Internet can no longer satisfy a diverse variety of customer service requirements, and that is why there is a need for alternative strategies. In order to solve this problem a number of service differentiation approaches have been proposed. Unfortunately, these schemes are often inadequate for providing proper service differentiation during periods of congestion. In this paper we introduce a new Bandwidth Distribution mechanism for supporting per-flow Quality of Service guarantees and for dealing with congestion. The Bandwidth Distribution scheme dynamically adjusts resource allocations at the network boundaries based on the network feedback. Within the Bandwidth Distribution framework we introduce a set of techniques for computing per-flow fair share. We evaluate these methods through simulation.

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

quality of service
bandwidth distribution
network feedback


Generalized Shapes and Point Sets Correspondence and Registration The theory of shapes, as proposed by David Kendall, is concerned with sets of labeled points in the Euclidean space \(\mathbb {R}^d\) that define a shape regardless of translations, rotations and dilatations. We present here a method that extends the theory of shapes, where, in this case, we use the term generalized shape for structures of unlabeled points. By using the distribution of distances between the points in a set we are able to define the existence of generalized shapes and to infer the computation of the correspondences and the orthogonal transformation between two elements of the same generalized shape equivalence class. This study is oriented to solve the registration of large set of landmarks or point sets derived from medical images but may be employed in other fields such as computer vision or biological morphometry.

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

generalized shapes
point sets
correspondence
registration


fear, uncertainty and statistics Statistics will provide the answer to our fear over the increasing uncertainty in chip performance. Our "confidence" in the correct operation of our integrated circuits will take on a new probabilistic meaning. This presentation will make the case for statistical optimization of integrated circuits in order to ensure high performance, yield and robustness. Today's discrete and continuous optimization techniques are not up to the task. New metrics will be required to allow physical synthesis tools to target these new optimization criteria. This presentation will describe the form that such metrics will take, and predict a phased introduction of statistical criteria in the optimization and automated fix-up process.

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


annotation as a support to user interaction for content enhancement in digital libraries This work describes the interface design and interaction of a generic annotation service for Digital Library Management Systems (DLMSs) , called Digital Library Annotation Service (DiLAS) , that has been designed and is currently undergoing development and user test in the framework of the DELOS European Network of Excellence. The objective of DiLAS is to design and develop an architecture and a framework able to support and evaluate a generic annotation service, i. e. a service that can be easily used into different DLMSs enhancing their User Interfaces (UIs) in order to offer to Digital Library (DL) users a set of uniform, user-tested (under certain required conditions), and recognizable functionalities.

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

multimedia document
user interface
annotation service
digital library management system


Characterization of biological internal dynamics by the synchronization of coupled chaotic system We investigate a characterization method of biological internal dynamics which exists in the background of biological signals. For the measured time series of the pulsation of human finger's capillary vessels, we extract an internal dynamics with a form of vector field by using embedding method. In order to characterize and recognize such dynamic structure, we construct an artificial dynamics of measured time series in the digital computer. Then we characterize the similarity of internal dynamics by the synchronized response of the artificial dynamics to the target internal dynamics. In this paper, we show the construction method of an artificial dynamics of measured time series and introduce three types of coupled system between original dynamics and artificial one. The effect of coupling is analyzed by the cross-correlation. (C) 1999 Elsevier Science B.V. All right reserved.

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

chaos
computation
nonlinear dynamics
brain


uncovering functional dependencies in mdd-compiled product catalogues A functional dependency is a logical relationship amongst the attributes that define a table of data. Specifically, a functional dependency holds when the values of a subset of the attributes in a dataset determine the values of one or more other attributes. Uncovering such dependencies is utilized in many domains, such as database design. We demonstrate that it can also be utilized in a recommendation context when datasets represent product catalogues. State-of-the-art approaches to discovering functional dependencies require a tabular representation of the data. However, product catalogues can sometimes be defined implicitly, for example, as a set of solutions to a combinatorial problem. Such combinatorial catalogues can have a very large number of products, thus making standard approaches to uncovering functional dependencies inapplicable. In this paper we present the first approach to computing functional dependencies over compiled knowledge representations which can often be small even for huge catalogues. In particular, we develop efficient algorithms that operate over decision diagrams, which allow us to handle catalogues that are out of reach for current approaches. We apply our algorithms to tabular and combinatorial benchmarks and detect a number of properties that could be considered as anomalies in product catalogues.

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

functional dependencies
decision diagrams


OntoGene in BioCreative II.5 We describe a system for the detection of mentions of protein-protein interactions in the biomedical scientific literature. The original system was developed as a part of the OntoGene project, which focuses on using advanced computational linguistic techniques for text mining applications in the biomedical domain. In this paper, we focus in particular on the participation to the BioCreative II.5 challenge, where the OntoGene system achieved best-ranked results. Additionally, we describe a feature-analysis experiment performed after the challenge, which shows the unexpected result that one single feature alone performs better than the combination of features used in the challenge.

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

biomedical text mining
natural language processing (nlp)
protein interactions


Detecting intrusion with rule-based integration of multiple models As the information technology grows interests in the intrusion detection system (IDS), which detects unauthorized usage, misuse by a local user and modification of important data, has been raised. In the field of anomaly-based IDS several data mining techniques such as hidden Markov model (HMM), artificial neural network, statistical techniques and expert systems are used to model network packets, system call audit data, etc. However, there are undetectable intrusion types for each measure and modeling method because each intrusion type makes anomalies at individual measure. To overcome this drawback of single-measure anomaly detector, this paper proposes a multiple-measure intrusion detection method. We measure normal behavior by systems calls, resource usage and file access events and build up profiles for normal behavior with hidden Markov model, statistical method and rule-base method, which are integrated with a rule-based approach. Experimental results with real data clearly demonstrate the effectiveness of the proposed method that has significantly low false-positive error rate against various types of intrusion.

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

intrusion detection systems
anomaly detection
multi-measure modeling


Design and evaluation of freehand menu selection interfaces using tilt and pinch gestures Freehand gestural interaction, in which the users hands move in mid-air to provide input, has been of interest to researchers, but freehand menu selection interfaces have been under-investigated so far. Freehand menu selection is inherently difficult, especially with increasing menu breadth (i.e., the number of items), largely because moving hands in free space cannot achieve precision as high as physical input devices such as mouse and stylus. We have designed a novel menu selection interface called the rapMenu (Ni et al., 2008), which is controlled by wrist tilt and multiple pinch gestures, and takes advantage of the multiple discrete gesture inputs to reduce the required precision of the user hand movements. In this article, we first review the visual design and behavior of the rapMenu technique, as well as related design issues and its potential advantages. In the second part, we present two studies of the rapMenu in order to further investigate the strengths and limitations of the design principle. In the first study, we compared the rapMenu to the extensively studied tilt menu technique (Rahman et al., 2009). Our results revealed that the rapMenu outperforms the tilt menu as menu breadth increases. In the second study, we investigated how the rapMenu affords the opportunity of eyes-free selection and users transition from novice to expert. We found that within 10min of practice, eyes-free selection with rapMenu has competitive speed and accuracy with the visual rapMenu and the tilt menu. Finally, we discuss design variations that use other axes of wrist movement and adopt alternative auditory feedback.

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

freehand gesture input
eyes-free menu selection


Solving the constrained p-center problem using heuristic algorithms The p-center problem is one of the location problems that have been studied in operations research and computational geometry. This paper describes a compatible discrete space version of the heuristic Voronoi diagram algorithm. Since the algorithm gets stuck in local optimums in some cases, we apply a number of changes in the body of the algorithm with regard to the geometry of the problem, in a way that it can reach the global optimum with a high probability. Finally, a comparison between the results of these two algorithms on several test problems and a real-world problem are presented.

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


A

geometric

multigrid

Poisson

solver

for

domains

containing

solid-inclusions

A

Cartesian

grid

method

for

the

fast

solution

of

the

Poisson

equation

in

three-dimensional

domains

with

embedded

solid

inclusions

is

presented

and

its

performance

analyzed.

The

efficiency

of

the

method,

which

assume

Neumann

conditions

at

the

immersed

boundaries,

is

comparable

to

that

of

a

multigrid

method

for

regular

domains.

The

method

is

light

in

terms

of

memory

usage,

and

easily

adaptable

to

parallel

architectures.

Tests

with

random

and

ordered

arrays

of

solid

inclusions,

including

spheres

and

ellipsoids,

demonstrate

smooth

convergence

of

the

residual

for

small

separation

between

the

inclusion

surfaces.

This

feature

is

important,

for

instance,

in

simulations

of

nearly-touching

finite-size

particles.

The

implementation

of

the

method,

"MG-Inc",

is

available

online.

Program

summary

Program

title:

MG-Inc

Catalogue

identifier:

Program

summary

URL:

Program

obtainable

from:

CPC

Program

Library,

Queen's

University,

Belfast,

N.

Ireland

Licensing

provisions:

Standard

CPC

licence,

No.

of

lines

in

distributed

program,

including

test

data,

etc.:

No.

of

bytes

in

distributed

program,

including

test

data,

etc.:

Distribution

format:

tar.gz

Programming

language:

C++

(fully

tested

with

GNU

GCC

compiler).

Computer:

Any

machine

supporting

standard

C++

compiler.

Operating

system:

Any

OS

supporting

standard

C++

compiler.

RAM:

About

for

resolution

Classification:

Nature

of

problem:

Poisson

equation

in

domains

containing

inclusions;

Neumann

boundary

conditions

at

immersed

boundaries.

Solution

method:

Geometric

multigrid

with

finite-volume

discretization.

Restrictions:

Stair-case

representation

of

the

immersed

boundaries.

Running

time:

Typically

a

fraction

of

a

minute

for

resolution.

(C)

Elsevier

B.V.

All

rights

reserved.

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


an object-oriented system for engineering applications One of the most promising approaches to database support of engineering applications is the concept of object-oriented database management. Object-orientation is usually approached from either a behavioral or structural viewpoint. The former emphasizes the application-specific manipulation of technical objects while hiding their structural details whereas the latter concentrates on the structural aspects and their efficient implementation. The thesis of the paper is that the two viewpoints may enter into a fruitful symbiosis where a behaviorally object-oriented system is implemented on top of a structurally object-oriented database system, thereby combining ease of use by the engineer with high database system performance. The thesis will be demonstrated in the paper by a user-friendly interface based on user-definable abstract datatypes and its implementation using a prototype for the non-first-normal-form (NF 2 ) relational model, and will be supported by an engineering example application from off-line robot programming.

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

applications use performance concept model paper management prototype implementation support manipulation database

examples
efficiency
engine
object
interfaces
normalization
object-oriented
combinational
user
program
aspect
structure
systems
abstraction
object-oriented database
behavior
robotics
relation


On edge-b-critical graphs ? A b-coloring of a graph G G is a proper coloring of the vertices of G G such that in each color class there exists a vertex having neighbors in all the other color classes. The b-chromatic number b(G) b ( G ) of a graph G G is the largest integer such that G G admits a b-coloring with k k colors. A graph G G is edge b-critical if deleting any edge decreases its b-chromatic number. We characterize the class of P5 P 5 -free graphs, d d -regular graphs and trees which are edge b-critical. As a consequence we show that deciding if a graph is edge-b-critical is NP-hard.

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

b-coloring
b-chromatic number
edge b-critical graph


Bounded solutions of nonlinear difference equatioris with advanced arguments Sufficient conditions of existence and uniqueness of alpha-bounded and bounded solutions to the difference equation with advanced arguments x(n + 1) = A(n)x(n) + B(n)x(sigma(1)(n)) + f(n,x(n),x(sigma(2)(n))), sigma(i)(n) greater than or equal to n + 1, i = 1,2, are given. It is proven that under certain conditions it is possible to find positive numbers R, mu, such that from every initial condition satisfying \xi\ less than or equal to R, a unique bounded solution, belonging to the ball \x\ less than or equal to mu, starts. (C) 2003 Elsevier Science Ltd. All rights reserved.

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

difference equations with advanced arguments


A reactive and dependable transport protocol for wireless mesh networks In the last few years, several different mesh network architectures have been conceived by both industry and academia; however, many issues on the deployment of efficient and fair transport protocols are still open. One of these issues is rate adaptation, that is, how to allocate the network resources among multiple flows, while minimizing the performance overhead. In order to address this problem, in this paper, we first define an analytical framework for a very simple topology. The model allows us to study the performance of an adaptive and responsive transport protocol when the effect of the lower layers are ignored. The mathematical approach alone does not represent a feasible solution, but it contributes to determining the strengths and weaknesses of our proposal. The main novelty of the proposed solution is that the congestion control approach is based on a hop-by-hop mechanism, which allows nodes to adapt their transmitting rates in a distributed way and to keep track of dynamic multi-hop network characteristics in a responsive manner. This is in contrast with classical literature solutions, founded on an end-to-end support. Anyway, to ensure the reliability, a coarse-grained end-to-end algorithm is integrated with the proposed hop-by-hop congestion control mechanism to provide packet level reliability at the transport layer. Performance evaluation, via extensive simulation experiments, shows that the proposed protocol achieves a high performance in terms of network throughput.

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

wireless mesh network
reliable transport protocol
mixed integer programming


Fuzzy rules for describing subgroups from Influenza A virus using a multi-objective evolutionary algorithm Extraction of biologically-meaningful knowledge is one of the important and challenging tasks in bioinformatics, in particular computational analysis of DNA and protein sequences, in order to identify biological function(s) and behaviour(s) of newly-extracted sequences. Computational intelligence techniques in corporation with sequence-driven features have been applied to tackle the problem and help classify different functional classes of the sequences. In order to study this problem, subgroup discovery algorithms together with a signal processing-based feature extraction method are applied, where the sequences are represented as a signal. The applicability of this method has been studied through four different Neuraminidase genes of Influenza A subtypes, H1N1, H2N2, H3N2 and H5N1. The results yielded not only higher predictive accuracy over these four classes of the proteins but also interpretable rule-based representation of the descriptive model with a significantly reduced feature set driven by means of the signal processing method. Subgroup discovery technique based on evolutionary fuzzy systems is expected to open new areas of research in bioinformatics and further help identify and understand more focused therapeutic protein targets.

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

influenza a virus
neuraminidase
subgroup discovery

evolutionary fuzzy system
multi-objective evolutionary algorithm


The binary extremal self-dual codes of lengths 38 and 40 We classify the extremal self-dual codes of lengths 38 or 40 having an automorphism of order 3 with six independent 3-cycles, 10 independent 3-cycles, or 12 independent 3-cycles. In this way we complete the classification of binary extremal self-dual codes of length up to 48 having automorphism of odd prime order.

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

extremal code
self-dual code
self-orthogonal code
weight enumerator


String matching with lookahead ? Forward-SBNDM is a recently introduced variation of the BNDM algorithm for exact string matching. Forward-SBNDM inspects a 2-gram in the text such that the first character is the last one of an alignment window of the pattern and the second one is then outside the window. We present a generalization of this idea by inspecting several lookahead characters beyond an alignment window and integrate it with SBNDMq q , a q q -gram variation of BNDM. As a result, we get several new variations of SBNDMq q . In addition, we introduce a greedy skip loop for SBNDM2. We tune up our algorithms and the reference algorithms with 2-byte read. According to our experiments, the best of the new variations are faster than the winners of recent algorithm comparisons for English, DNA, and binary data.

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

bit-parallelism
2-byte read
q q -grams q q q q q


how preschool children used a behaviour-based programming tool This paper presents a study of how five-year-old preschool children used a behaviour-based visual programming toolkit called Magic Words. The system represents behaviours with contextual word pads that are placed on graphical characters. The purpose of the study was to see how the children would use the tool when playing with it in an open-ended way. Our conclusion is that behaviour-based programming with contextual signs has a high level of directness, but support is needed to learn behaviours that do not give instant feedback.

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

visual programming
contextual signs
preschool children


Patient-recognition data-mining model for BCG-plus interferon immunotherapy bladder cancer treatment Bladder cancer is the fifth most common malignant disease in the United States with an annual incidence of around 63,210 new cases and 13,180 deaths. The cost for providing care for patients with bladder cancer disease is high. Bladder cancer treatment options such as immunotherapy, chemotherapy, radiation therapy, transurethral resection, and cystectomy, are used with varying success rates. In this research, data from a nationwide bacillus Calmette-Guerin (BCG) plus interferon-alpha (IFN-? ? ) immunotherapy clinical trial was considered. Data mining algorithms were used to analyze the effectiveness of immunotherapy treatment and to understand the prominent parameters and their interactions. The extracted knowledge was used to build a patient recognition model for prediction of treatment outcomes. The data was analyzed to understand the impact of various parameters on the treatment outcome. A list of significant parameters such as cumulative tumor size, presence of residual disease, stages of prior bladder cancer, current state of bladder cancer, and the presence of current bladder cancer (T1) is provided. The decision-making approach outlined in the paper supplemented with additional knowledge bases will lead to a comprehensive analytical road map of the BCG/IFN-? ? immunotherapy treatment. It will provide individualized guidelines for each stage of the treatment as well as measure the success of the treatment.

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

data mining
bladder cancer
patient recognition model


autonomic resource provisioning in rocks clusters using eucalyptus cloud computing Data centers always face challenges of peak and fluctuating resource demand from time to time. Building a data center that is large enough to meet a peak demand is not cost effective. The emerging of Cloud computing model allows the data center to dynamically acquire additional resources on demand and pay only for what resources having been used. So, the data center has a flexibility to satisfy users with higher QoS while keeping the investment on IT infrastructure at an affordable cost. In this work, we present an architecture of autonomic provisioning in High Throughput Cluster (HTC) computing system using resources from Cloud. The system is developed as an extension to Rocks Clusters. It allows a data center to transparently and securely extend a local cluster into remote Cloud computing resources on demand through dynamic provisioning mechanism. We also introduce a set of provisioning policies that are aware of the different resource requirement in each job and adapt the system accordingly. Experiments have been carried out in our testbed to show that the proposed system is self-configured and self-organized.

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


A high-efficiency multi-beam splitter for optical pickups using ultra-precision manufacturing We propose a seven-port beam splitter grating with novel double-groove structure. High efficiency of 91.81% energy is designed to split into the ?3T to +3T orders. The double-groove structure was fabricated using ultra-precision manufacturing. The deviation between the measured results and theoretically values is only 2.99%. It holds a high potential for mass production.

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

beam splitters
diffraction gratings
optical data storage
ultra-precision manufacturing


A non-ambiguous decomposition of regular languages and factorizing codes ? Given languages Z,L???,Z is L-decomposable (finitely L-decomposable, resp.) if there exists a non-trivial pair of languages (finite languages, resp.) (A,B), such that Z=AL+B and the operations are non-ambiguous. We show that it is decidable whether Z is L-decomposable and whether Z is finitely L-decomposable, in the case Z and L are regular languages. The result in the case Z=L allows one to decide whether, given a finite language S??? , there exist finite languages C,P such that SC?P=?? with non-ambiguous operations. This problem is related to Schtzenberger's Factorization Conjecture on codes. We also construct an infinite family of factorizing codes.

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

formal languages
non-ambiguous factorizations


An autonomous assessment system based on combined latent semantic kernels In this paper, we develop an autonomous assessment system based on the kernel combinations which are mixed by two kernel matrices from the WordNet and corpus. Many researchers have tried to integrate these two resources in many applications, to utilize diverse information extracted from each resource. However, since two resources have been represented in quite different ways, one resource has been secondary to another. To fully integrate two resources at the same level, we first transform the WordNet, which has a hierarchical structure, into a matrix structure. Concurrently, another matrix, which represents a co-occurrence of words in the collection of text documents, is constructed. We then build two initial latent semantic kernels from both matrices and merge them into a new single kernel matrix. When we merge two matrices, we split each initial matrix into independent columns and mix the columns with various methods. We acquire a few combined kernel matrices which show various performances in experiments. Compared to the basic vector space model, original kernel matrices, and the BLEU based method, the combined matrices improve the accuracy of assessment.

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

autonomous assessment system
wordnet
corpus
combined kernel
bleu

latent semantic kernel
singular value decomposition


dynamic optimization of migration topology in internet-based distributed genetic algorithms Distributed Genetic Algorithms (DGAs) designed for the Internet have to take its high communication cost into consideration. For island model GAs, the migration topology has a major impact on DGA performance. This paper describes and evaluates an adaptive migration topology optimizer that keeps the communication load low while maintaining high solution quality. Experiments on benchmark problems show that the optimized topology outperforms static or random topologies of the same degree of connectivity. The applicability of the method on real-world problems is demonstrated on a hard optimization problem in VLSI design.

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


rateless codes for data dissemination in sensor networks This paper discusses the use of rateless codes to increase performance in wireless sensor networks.

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


Decentralized formation control for small-scale robot teams with anonymity This paper presents decentralized formation controls for a team of anonymous mobile robots performing a task through cooperation. Robot teams are required to generate and maintain various geometric patterns adapting to environmental changes in many cooperative robotics applications. In particular, all robots must continue to strive toward achieving the team's mission even if some members fail to perform their role. Toward this end, formation control approaches are proposed under the conditions that robot teams are initially not allowed to have individual identification numbers (IDs), a predetermined leader, and agreement on coordinate systems. Therefore, all members are required first to reach agreement on their coordinate system and obtain unique IDs for role allocations in a self-organizing way. Then, employing IDs within a common coordinate system, two formation control approaches can be realized: leader-referenced and neighbor-referenced formations. Both approaches are verified using an in-house simulator and physical mobile robots. We detail and evaluate each formation control approach, whose common features include self-organization, robustness, and flexibility. (C) 2008 Elsevier Ltd. All rights reserved.

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

agreement on common coordinates and id allocations


Ontology-based multi-site software development methodology and tools The disadvantages associated with remote communication rather than face-to-face communication is a key problem in the multi-site distributed software development environment. Awareness of what work has been done, what task has been misunderstood, what problems have been raised, what issues have been clarified, and understanding of why a team or a software engineer does not follow the project plan, and how to carry out a discussion over a multi-site distributed environment and to make a just-in-time decision are the challenge. Different teams might not be aware of what tasks are being carried out by others, potentially leading to problems such as two groups overlapping in some work or other work not being performed due to misinterpretation of the task. Wrong tasks may be carried out due to ignorance of who to contact to get the proper details. If everyone working on a certain project is located in the same area, then situational awareness is relatively straightforward but the overheads in communications to get together to discuss the problems, to raise issues, to make decisions and to find answers in a multi-site distributed environment can become very large. Consequently, these problems cause project delay and anxiety among teams and managers. Ontologies coupled with a multi-agents system allow greater ease of communication by aggregating the agreed knowledge about the project, the domain knowledge, the concepts of software engineering into a shared information resource platform and allow them to be shared among the distributed teams across the sites and enable the intelligent agents to use the ontology to carry out initial communication and classification with developers when the problem is raised in the first instance. In this paper, we present the key challenges in multi-site software engineering and the ontology representation of commonly shared conceptualisations in software development. We demonstrate the agent communication with developers in the form of manmachine interactions and the great potential of such a system to be used in the future for software engineering in multi-site environments.

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

ontology development
software engineering ontology
agent-based system
multi-site software development


New Results on Rewrite-Based Satisfiability Procedures Program analysis and verification require decision procedures to reason on theories of data structures. Many problems can be reduced to the satisfiability of sets of ground literals in theory T. If a sound and complete inference system for first-order logic is guaranteed to terminate on T-satisfiability problems, any theorem-proving strategy with that system and a fair search plan is a T-satisfiability procedure. We prove termination of a rewrite-based first-order engine on the theories of records, integer offsets, integer offsets modulo and lists. We give a modularity theorem stating sufficient conditions for termination on a combination of theories, given termination on each. The above theories, as well as others, satisfy these conditions. We introduce several sets of benchmarks on these theories and their combinations, including both parametric synthetic benchmarks to test scalability, and real-world problems to test performances on huge sets of literals. We compare the rewrite-based theorem prover E with the validity checkers CVC and CVC Lite. Contrary to the folklore that a general-purpose prover cannot compete with reasoners with built-in theories, the experiments are overall favorable to the theorem prover, showing that not only the rewriting approach is elegant and conceptually simple, but has important practical implications.

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

theory
verification
decision procedures
combination of theories
inference
rewriting
termination
scalability

performance
automated reasoning
satisfiability modulo a theory
superposition


Theoretical clarity is not 'Manicheanism': A reply to Marcia Bates It is argued that in order to establish a new theoretical approach to information science it is necessary to express disagreement with some established views. The 'social turn' in information science is not just exemplified in relation to the works of Marcia Bates but in relation to many different researchers in the field. Therefore it should not be taken personally, and the debate should focus on the substance. Professor Bates has contributed considerably to information science. In spite of this, some of her theoretical points of departure may be challenged. It is important to seek theoretical clarity, and this may involve a degree of schematic confrontation that should not be confused with theoretical one-sidedness, 'Manicheanism' or lack of respect.

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

behavioural science
browsing
discursive view


Modified Gradient Search for Level Set Based Image Segmentation Level set methods are a popular way to solve the image segmentation problem. The solution contour is found by solving an optimization problem where a cost functional is minimized. Gradient descent methods are often used to solve this optimization problem since they are very easy to implement and applicable to general nonconvex functionals. They are, however, sensitive to local minima and often display slow convergence. Traditionally, cost functionals have been modified to avoid these problems. In this paper, we instead propose using two modified gradient descent methods, one using a momentum term and one based on resilient propagation. These methods are commonly used in the machine learning community. In a series of 2D/3-D-experiments using real and synthetic data with ground truth, the modifications are shown to reduce the sensitivity for local optima and to increase the convergence rate. The parameter sensitivity is also investigated. The proposed methods are very simple modifications of the basic method, and are directly compatible with any type of level set implementation. Downloadable reference code with examples is available online.

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

image segmentation
machine learning
optimization

active contours
gradient methods
level set method
variational problems


Robot coordination using task-priority and sliding-mode techniques We use task-priority and sliding-mode ideas for coordination of multi-robot systems. We define mandatory constraints representing the robot coordination. The method allows us to consider other constraints with lower priority. The fulfillment of the constraints is achieved using geometric invariance. We show the effectiveness of the method by simulation using two PUMA-762 robots.

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

multi-robot systems
cooperative robots
robot control
collision avoidance


Linear algebraic techniques to construct monochrome visual cryptographic schemes for general access structure and its applications to color images Though the monochrome (black and white) visual cryptography has a very rich literature, a very few papers have been published for the construction of general access structure. In this paper we put forward a method of construction of a strong monochrome visual cryptographic scheme (VCS) for general access structure using linear algebra. As a particular case of general access structure, \((k,n)\)-VCS for \(2 \le k \le n\) is obtained. The \((n,n)\)-VCS obtained from the scheme attains the optimal pixel expansion as well as optimal relative contrast. We provide an efficient construction of \((n-1,n)\)-VCS. We further extend our monochrome VCS to color VCS for restricted access structures. Finally, we provide some interesting examples that will lead to some future research directions in the area of VCS.

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

visual cryptography
linear algebra
pixel expansion
relative contrast


visualization of geo-annotated pictures in mobile phones In this work, a novel mobile browser for geo-referenced pictures is introduced and described. We use the term browser to denote a system aimed at browsing pictures selected from a large set like Internet photo sharing services. The criteria to filter a subset of pictures to browse are three: the user's actual position, the user's actual heading, and the user's preferences. In this work we only focus on the first two criteria leaving the integration of user's preferences for future developments.

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

arduino
gps
mobile photo browsing
geo-browsing
maps
compass


BIMTag: Concept-based automatic semantic annotation of online BIM product resources Present a concept-based automatic semantic annotation method for online BIM documents using the IFC ontology. A word-level annotation algorithm is developed for word-sense disambiguation. A document-level annotation algorithm is proposed to discover the relationships. Evaluate our method on the document collection and the result outperforms existing tools. Apply our method to a search engine.

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

building information modeling (bim)
industry foundation classes (ifc)
latent semantic analysis (lsa)
information retrieval


Design and analysis of SSSC-based supplementary damping controller Power-system stability improvement by a static synchronous series compensator (SSSC)-based damping controller is thoroughly investigated in this paper. The design problem of the proposed controller is formulated as an optimization problem, and real coded genetic algorithm (RCGA) is employed to search for the optimal controller parameters. Both local and remote signals with associated time delays are considered in the present study and a comparison has been made between the two signals. The performances of the proposed controllers are evaluated under different disturbances for both single-machine infinite-bus power system and multi-machine power system. Simulation results are presented and compared with a recently published modern heuristic optimization technique under various disturbances to show the effectiveness and robustness of the proposed approach.

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


A novel aggregation principle for hesitant fuzzy elements In this paper, we present and apply a new aggregation principle for hesitant fuzzy elements (HFEs). First, we introduce a membership uncertainty index of the HFEs. Then we present a new aggregation principle for aggregating hesitant fuzzy elements, which can effectively reduce the computational complexity specific to the conventional aggregation principle. By the virtue of the proposed aggregation principle, the number of terms (values) in the aggregation result is significantly reduced. Furthermore, a t-test confirms that the scores associated with the results of the aggregation under conventional and new principles have no significant difference. Finally, a series of simulations are provided to demonstrate the feasibility and validity of the proposed aggregation principle.

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

membership uncertainty
aggregation principle