Architecture of multi-OLT PON systems and its bandwidth allocation algorithms In this paper, we propose a novel passive optical network (PON) architecture that has multiple optical line terminals (OLTs). Unlike existing PONs where all ONUs are connected to a single OLT, the proposed multi-OLT PON allows subscribers to choose their own service providers from among multiple OLTs. Service companies and subscribers can make service level agreements (SLA) on the amount of bandwidth that each OLT or ONU requires. A new control protocol and bandwidth allocation algorithms appropriate in this new PON environments are suggested. For the downstream, a scheme to share the bandwidth among multiple OLTs is studied to maximize the total transmitted packets while guaranteeing each OLTs SLA. A modified Limited Dynamic Bandwidth Allocation named mLimited scheme is also proposed for upstream transmission toward multiple OLTs, which maximizes the total upstream throughput while minimizing the delay of each ONU. Performances of the proposed PON architecture and algorithms are analyzed. A PON system with two OLTs and 16 ONUs is used in the analysis. Self-similar traffic reflecting current packet distribution is used in the packet generation. The results show that the proposed DBA schemes efficiently manage bandwidth even when the occurred traffic load is quite different from the reserved bandwidth. It is found that the proposed PON architecture is appropriate in supporting diverse services in future high-speed optical access network.

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

passive optical network (pon)
limited dba
mlimited dba
multi-olt
shared-bandwidth dba
self-similar traffic


on computing, storing and querying frequent patterns Extensive efforts have been devoted to developing efficient algorithms for mining frequent patterns. However, frequent pattern mining remains a time-consuming process, especially for very large datasets. It is therefore desirable to adopt a "mining once and using many times" strategy. Unfortunately, there has been little work reported on managing and organizing a large set of patterns for future use. In this paper, we propose a disk-based data structure, CFP-tree (Condensed Frequent Pattern Tree), for organizing frequent patterns discovered from transactional databases. In addition to an efficient algorithm for CFP-tree construction, we also developed algorithms to efficiently support two important types of queries, namely queries with minimum support constraints and queries with item constraints, against the stored patterns, as these two types of queries are basic building blocks for complex frequent pattern related mining tasks. Comprehensive experimental study has been conducted to demonstrate the effectiveness of CFP-tree and efficiency of related algorithms.

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


inferring users' online activities through traffic analysis Traffic analysis may threaten user privacy, even if the traffic is encrypted. In this paper, we use IEEE 802.11 wireless local area networks (WLANs) as an example to show that inferring users' online activities accurately by traffic analysis without the administrator's privilege is possible during very short periods (e.g., a few seconds). The online activities we investigated include web browsing, chatting, online gaming, downloading, uploading and video watching, etc. We implement a hierarchical classification system based on machine learning algorithms to discover what a user is doing on his/her computer. Furthermore, we conduct experiments in different network environments (e.g., at home, on university campus, and in public areas) with different application scenarios to evaluate the performance of the classification system. Results show that our system can distinguish different online applications on the accuracy of about 80\% in 5 seconds and over 90\% accuracy if the eavesdropping lasts for 1 minute.

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

privacy
machine learning
traffic analysis


Optimal experimental design applied to the dehydrochlorination of poly(vinyl chloride) Various factors are known to influence the hydrochloride release of poly(vinyl chloride) (PVC). The variables chosen for this study were heating, stirring, and illumination. For screening, the influence of these three factors on the dehydrochlorination yield of PVC swelled in sodium 3-methylbutoxide (SMB), and a sequence of experiments was planned according to a 2 3 full factorial design with two replicates. It was found that main effects, as well as two- and three-factor interaction effects, were statistically significant. Higher responses were obtained when the reaction mixture was heated under reflux in the presence of light. On the other hand, lower dehydrochlorination yields were measured when the samples were stirred. (c) 2005 Elsevier B.V. All rights reserved.

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

full factorial design
dehydrochlorination
pvc


Statistical evaluation of reproducibility of automated ECG measurements: An example from arrhythmogenic right ventricular dysplasia/cardiomyopathy clinic Comprehensive statistical evaluation of reproducibility of automated ECG measurements is important for appropriate interpretation of ECG. Automated ECG measurements of QRS duration and terminal activation duration in right precordial leads are reproducible to within 25%. Precision of automated averaged QRS duration measurement was 99.96%. 95% limits of agreement of QRS duration in V1V3 exceeded 10ms.

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

reproducibility
qrs duration
terminal activation duration

electrocardiogram
automated measurement
arvd/c


Agent-based decision-making process in airport ground handling management Recent research on highly distributed control methods has produced a series of new philosophies based on negotiation, which bring together the process engineering with computer science. Among these control philosophies, the ones based on Multi-agent Systems (MAS) have become especially relevant to address complex tasks and to support distributed decision making in asset management, manufacturing, and logistics. However, these MAS models have the drawback of an excessive dependence on up-to-date field information. In this work, a theoretical and experimental MAS, called MAS-DUO, is presented to test new strategies for managing handling operations supported by feedback coming from radio frequency identification (RFID) systems. These strategies have been based on a new distributed organization model to enforce the idea of division between physical elements and information and communication technologies (ICT) in the product scheduling control. This division in two platforms simplifies the design, the development, and the validation of the MAS, allowing an abstraction and preserving the independency between platforms. The communication between both platforms is based on sharing the parameters of the Markov reward function. This function is mainly made up of the field information coming from the RFID readers incorporated as the internal beliefs of the agent. The proposed MAS have been deployed on the Ciudad Real Central Airport in Spain in order to dimension the ground handling resources.

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


A pairing-based user authentication scheme for wireless clients with smart cards With rapid growth of mobile wireless networks, handheld devices are popularly used by people and many mobile applications have been rapidly developed. Considering the limited computing capability of smart cards or mobile devices, the security scheme design suitable for these mobile devices is a nontrivial challenge. A user authentication scheme is a mechanism to authenticate a remote user over an open network. In 2006, Das et al.. proposed an identity (ID)based remote user authentication scheme with smart cards using bilinear pairings. Unfortunately, their scheme is insecure against forgery attack. Recently, Giri and Srivastava proposed an improved scheme to overcome the forgery attack. The computational cost required by the Giri-Srivastava scheme is expensive, especially for smart cards with limited computing capability. In addition, the Giri-Srivastava scheme is unable to be used for a multi-server environment. This paper presents an efficient and secure ID-based remote user authentication scheme using bilinear pairings. Based on the computational Diffie-Hellman assumption, we show that the proposed scheme is secure against existential forgery on adaptively chosen-message and ID attack in the random oracle model, As compared with the recently proposed pairing-based authentication schemes, our scheme has better performance in term of the computational cost and it is suitable for a multi-server environment in distributed networks. Performance analysis and experimental data of related pairing operations on smartcards are given to demonstrate that our scheme is well suited for mobile devices with limited computing capability.

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

wireless client
identity-based
smart card
bilinear pairing


The impacts of congestion on time-definitive urban freight distribution networks CO2 emission levels: Results from a case study in Portland, Oregon Increased congestion during peak morning and afternoon periods in urban areas is increasing logistics costs. In addition, environmental, social, and political pressures to limit the impacts associated with CO2 emissions are mounting rapidly. A key challenge for transportation agencies and businesses is to improve the efficiency of urban freight and commercial vehicle movements while ensuring environmental quality, livable communities, and economic growth. However, research and policy efforts to analyze and quantify the impacts of congestion and freight public policies on CO2 emissions are hindered by the complexities of vehicle routing problems with time-dependent travel times and the lack of network-wide congestion data. This research focuses on the analysis of CO2 emissions for different levels of congestion and time-definitive customer demands. Travel time data from an extensive archive of freeway sensors, time-dependent vehicle routing algorithms, and problems-instances with different types of binding constraints are used to analyze the impacts of congestion on commercial vehicle emissions. Results from the case study indicate that the impacts of congestion or speed limits on commercial vehicle emissions are significant but difficult to predict since it is shown that it is possible to construct instances where total route distance or duration increases but emissions decrease. Public agencies should carefully study the implications of policies that regulate depot locations and travel speeds as they may have unintended negative consequences in terms of CO2 emissions.

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

time-dependent travel time speed
ghg or co2 emissions
urban congestion
depot location


supporting mobile payment qos by data mining gsm network traffic In mobile commerce, short-message-service (SMS) is an important technique for delivering payment instruction. A payment model "SMS Credit" was proposed earlier [1]. Such payment service or similar relies on the transmission of SMS; it is needed to reduce the occurrence of packet losses and delay, to improve the quality of packet transmission services (QOS) in the network. This paper discusses how the payment service operates in a configurable radio resource environment via data mining. A Radio Resource Management and Prediction Server equipped with data mining algorithms will optimize the radio resources for both voice and data services in order to provide an optimized QOS. Specifically, data mining techniques are applied to define traffic policy and to calculate optimization result through traffic profile analysis.

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

quality of service
data-mining
grade of service


Adaptive optimizing compilers for the 21st century Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This paper describes a prototype system that uses biased random search to discover a program-specific compilation sequence that minimizes an explicit, external objective function. The result is a compiler framework that adapts its behavior to the application being compiled, to the pool of available transformations, to the objective function, and to the target machine. This paper describes experiments that attempt to characterize the space that the adaptive compiler must search. The preliminary results suggest that optimal solutions are rare and that local minima are frequent. If this holds true, biased random searches, such as a genetic algorithm, should find good solutions more quickly than simpler strategies, such as hill climbing.

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

biased random search
optimizing compilers

configurable compilers
order of optimization


Multimedia distributed learning environments: Evolution towards intelligent communications In this paper we describe the realization of a Multimedia Distributed Learning System developed by means of the Java language in a Intranet environment. In particular, we focus our discussion on the definition of the existing scenario, on the requirements specification and on the description of our overall system, by providing also first experimental results. We decided to add to our system a Software Agents based Intelligent Communication Support to manage both high level and low level communication needs coming from the nature of the application. Such communication needs could reasonably be considered as shared by a large family of distributed applications based on Intranet technologies. We present the main characteristics of our agents and describe how to use them to better achieve defined goals in terms of flexibility and scalability and to add network-awareness capabilities to the application.

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

learning environments
software agents
intelligent communications


experiments in using tangible interfaces to enhance collaborative learning experiences TICLE (Tangible Interfaces for Collaborative Learning Environments) is a project that explores new ways that a computer can enhance learning without dominating the educational experience. We have developed a prototype system that "watches" as students play with Tangram pieces on a physical tabletop, and acts as a "guide on the side" by offering help at appropriate times. This system is currently installed at the Goudreau Museum of Mathematics in Art and Science. Our paper describes the implementation of our prototype and results of a usability study conducted at the museum. We also discuss ongoing enhancements and plans for further testing. Although this work focuses on learning with mathematical puzzles, it has implications for other physical learning activities.

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

k-12 math education
multimedia user interface
tangible interface
multimodal interaction


Mid-term electricity market clearing price forecasting utilizing hybrid support vector machine and auto-regressive moving average with external input A hybrid SVM-ARMAX mid-term forecasting model is proposed. Mid-term forecasting is different from short-term forecasting. The proposed work assumes that all forecasting input data are given. The forecast output contains 720 continuous hourly electricity MCPs. MAE and MSRE are selected for regression computation performance evaluation.

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

auto-regressive moving average with external input (armax)


A study of statistical techniques and performance measures for genetics-based machine learning: accuracy and interpretability The experimental analysis on the performance of a proposed method is a crucial and necessary task to carry out in a research. This paper is focused on the statistical analysis of the results in the field of genetics-based machine Learning. It presents a study involving a set of techniques which can be used for doing a rigorous comparison among algorithms, in terms of obtaining successful classification models. Two accuracy measures for multi-class problems have been employed: classification rate and Cohens kappa. Furthermore, two interpretability measures have been employed: size of the rule set and number of antecedents. We have studied whether the samples of results obtained by genetics-based classifiers, using the performance measures cited above, check the necessary conditions for being analysed by means of parametrical tests. The results obtained state that the fulfillment of these conditions are problem-dependent and indefinite, which supports the use of non-parametric statistics in the experimental analysis. In addition, non-parametric tests can be satisfactorily employed for comparing generic classifiers over various data-sets considering any performance measure. According to these facts, we propose the use of the most powerful non-parametric statistical tests to carry out multiple comparisons. However, the statistical analysis conducted on interpretability must be carefully considered.

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

statistical tests
cohens kappa
interpretability
classification

genetics-based machine learning
genetic algorithms
non-parametric tests


Nonlinear dynamic analysis of Timoshenko beam-columns partially supported on tensionless Winkler foundation In this paper, a boundary element method is developed for the nonlinear dynamic analysis of beam-columns of arbitrary doubly symmetric simply or multiply connected constant cross section, partially supported on tensionless Winkler foundation, undergoing moderate large deflections under general boundary conditions, taking into account the effects of shear deformation and rotary inertia. The beam-column is subjected to the combined action of arbitrarily distributed or concentrated transverse loading and bending moments in both directions as well as to axial loading. To account for shear deformations, the concept of shear deformation coefficients is used. Five boundary value problems are formulated with respect to the transverse displacements, to the axial displacement and to two stress functions and solved using the analog equation method, a BEM based method. Application of the boundary element technique yields a nonlinear coupled system of equations of motion. The solution of this system is accomplished iteratively by employing the average acceleration method in combination with the modified Newton Raphson method. The evaluation of the shear deformation coefficients is accomplished from the aforementioned stress functions using only boundary integration. The proposed model takes into account the coupling effects of bending and shear deformations along the member as well as the shear forces along the span induced by the applied axial loading. Numerical examples are worked out to illustrate the efficiency, wherever possible the accuracy and the range of applications of the developed method.

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

nonlinear dynamic analysis
large deflections
shear deformation coefficients
boundary element method
tensionless winkler foundation


towards identity anonymization on graphs The proliferation of network data in various application domains has raised privacy concerns for the individuals involved. Recent studies show that simply removing the identities of the nodes before publishing the graph/social network data does not guarantee privacy. The structure of the graph itself, and in its basic form the degree of the nodes, can be revealing the identities of individuals. To address this issue, we study a specific graph-anonymization problem. We call a graph k -degree anonymous if for every node v , there exist at least k -1 other nodes in the graph with the same degree as v . This definition of anonymity prevents the re-identification of individuals by adversaries with a priori knowledge of the degree of certain nodes. We formally define the graph-anonymization problem that, given a graph G , asks for the k -degree anonymous graph that stems from G with the minimum number of graph-modification operations. We devise simple and efficient algorithms for solving this problem. Our algorithms are based on principles related to the realizability of degree sequences. We apply our methods to a large spectrum of synthetic and real datasets and demonstrate their efficiency and practical utility.

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

network structure efficiency definition data demonstrate graph anonymity knowledge privacy utility practical

applications
method
dynamic programming
social network
ident
identification
domain
addressing
operability
publish
algorithm
sequence
degree sequence


Differential Evolution algorithms applied to Neural Network training suffer from stagnation Differential Evolution algorithms applied to ANN training suffer from stagnation. The lack of difference vectors of small magnitude is noted during ANN training by Differential Evolution methods. In case of benchmark problems the lack of difference vectors of small magnitude is only occasionally observed. DEGL algorithm outperforms other Differential Evolution variants for ANN training. Best algorithms found for benchmark problems do not perform well for ANN training.

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

differential evolution
stagnation
benchmark problems

artificial neural networks
global and local optimization
algorithm population size


Modeling and Analysis of the Nonrectangular Gate Effect for Postlithography Circuit Simulation For nanoscale CMOS devices, gate roughness has severe impact on the device-characteristics, particularly in the subthreshold region. In particular, the nonrectangular gate (NRG) geometries are caused by subwavelength lithography and have relatively low spatial frequency. In this paper, we present an analytical approach to model NRG effects on characteristics. To predict the change I-V of-characteristics due to the NRG effect, the proposed model converts the postlithography gate profile into an equivalent gate length (L(e)), which is a function of the gate bias voltage but independent of the drain bias voltage. We demonstrate the accuracy of this approach by comparing it to TCAD simulation results for 65-nm technology. The new model is readily integrated into standard transistor models in traditional circuit simulation tools, such as SPICE, for both dc and transient analyses. We further develop a generic procedure to systematically extract the value from the postlithography gate profile. The interaction with the narrow-width effect is also efficiently incorporated into the proposed algorithm. TCAD verification demonstrates that the proposed model is simple for implementation, scalable with both transistor geometries and bias conditions, and also continuous across all the operation regions.

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

equivalent gate length (egl)
leakage
line-edge roughness (ler)
narrow-width effect (nwe)
nonrectangular gate (nrg)


Orthogonal array based performance improvement in the gravitational search algorithm The gravitational search algorithm (GSA) is a novel heuristic method inspired by Newton's gravity and velocity equations. In addition, it is a population-based algorithm, in which each member (called an agent) in the population has a mass, velocity, and acceleration. Beginning with the first population state, agents influence each other via mass and velocity relations. This mutual effect causes agents to reach the optimum. Hence, the performance of the GSA to attain the optimum is related to the initial population formation, like other population-based algorithms. In this study, the orthogonal array (OA) concept is applied and injected to the GSA algorithm in the initialization phase. Hence, the GSA benefits from the homogenized agent distribution tendency of the OA. The implementation results are utilized to compare the conventional and proposed methods (i.e. conventional GSA and the so-called "OA-GSA"), and the efficiency of the proposed method is demonstrated.

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

gravitational search algorithm
orthogonal array

benchmark functions
gravity based search
taguchi method


Visual computing for medical diagnosis and treatment Diagnostic algorithms and efficient visualization techniques are of major importance for preoperative decisions, intra-operative imaging and image-guided surgery. Complex diagnostic decisions are characterized by a high information flow and fast decisions, requiring efficient and intuitive presentation of complex medical data and precision in the visualization. For intra-operative medical treatment, the pre-operative visualization results of the diagnostic systems have to be transferred to the patient on the operation room table. Via augmented reality, additional information of the hidden regions can be displayed virtually. This state-of-the-art report summarizes visual computing algorithms for medical diagnosis and treatment. After starting with direct volume rendering and tagged volume rendering as general techniques for visualizing anatomical structures, we go into more detail by focusing on the visualization of tissue and vessel structures. Afterwards, algorithms and techniques that are used for medical treatment in the context of image-guided surgery, intra-operative imaging and augmented reality are discussed and reviewed.

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

medical visualization
diffusion tensor imaging
vessel visualization
image-guided surgery
intra-operative imaging
virtual and mixed reality
occlusion handling
collision detection


Theoretical studies and vibrational spectra of 1H-indole-3-acetic acid. Exploratory conformational analysis of dimeric species Theoretical studies on 1H-indole-3-acetic acid (IAA) were performed to investigate the conformational properties of dimeric species and vibrational spectra. Experimental infrared spectra at 100 K and 297 K and Raman spectrum at 297 K were analyzed and compared against calculations performed at B3LYP/6-31G** level. A exploratory study of the conformational space of dimeric species was performed. Our analysis showed that dimeric forms predicted theoretically contribute distinctively to the assignments of experimental results. These structures are defined by the orientation of the acetyl moieties with respect to the plane of indole ring. The dimers are formed by two symmetrical IAA monomers (one of them with the acetyl moiety upward oriented, Re-face, and the other isomer having the acetyl moiety downward oriented, Si-face) in tail-to-tail way. The X-ray geometry and FTIR vibrational frequencies were compared with the results of DFT calculations. A conformational equilibrium involving the non-equivalent IAA dimers: CCT-CCT, A(+)A(+)T-A(-)A(-)T, A(+)A(-)T-A(-)A(+)T, and A(+)CT-A(-)CT was found. The relation of the conformational properties of the IAA molecule with the features of the vibrational spectra was described in detail. The band assignments were discussed as related to the conformations properties. Our analysis shows the significance of the theoretical study of the conformational space of the monomeric molecule in the rationalization of experimental results.

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

density functional theory
1h-indole-3-acetic acid (iaa)
infrared spectroscopy
raman spectroscopy


Examination of the reliability of a technical object after its regeneration in a maintenance system with an artificial neural network This article presents the issues of an examination and evaluation of the reliability of a technical object after its regeneration in a maintenance system. The preventive activities (regeneration) of an object are conducted in a maintenance system which includes an artificial neural network. The author made an attempt in the paper to prove that an artificial neural network has an indirect influence on the quality of preventive activities organized for a technical object and hence on the level of its reliability. This influence is the result of the fact that information developed by a neural network constitutes the basis in the process of the generation of an expert knowledge base on the basis of which the maintenance system is organized. This paper also covers the theoretical basis. Those quantities were defined which may be used in reliability tests of technical objects. The possibilities were presented of testing the reliability: the quality of the use of an object after its regeneration. These tests may be carried out in a short period of time and in a longer period of time after the preventive activities have been carried out for a device. This article also presents the idea of a reliability test conducted for a technical object on the example of a device which controls the work of a petrol engine. For this purpose, the structure of a maintenance system was designed on the basis of an expert knowledge base determined for an object. Diagnostic information from an artificial neural network constitutes the basis for these activities. A substantial part of the article is devoted to the description of the method of the reliability test of the object and to an analysis of the results obtained. The test was carried out in a simulation manner after a long period of time following regeneration of a technical object.

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

servicing process
system modelling
expert system
artificial neural networks
diagnostics information


Nonparametric Bayesian clustering to detect bipolar methylated genomic loci With recent development in sequencing technology, a large number of genome-wide DNA methylation studies have generated massive amounts of bisulfite sequencing data. The analysis of DNA methylation patterns helps researchers understand epigenetic regulatory mechanisms. Highly variable methylation patterns reflect stochastic fluctuations in DNA methylation, whereas well-structured methylation patterns imply deterministic methylation events. Among these methylation patterns, bipolar patterns are important as they may originate from allele-specific methylation (ASM) or cell-specific methylation (CSM).

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


On the dimension of an APN code A map f?:?V:?=?GF(2 m ) ? V is APN (almost perfect nonlinear) if its directional derivatives in nonzero directions are all 2-to-1. If m is greater than 2 and f vanishes at 0, then this derivative condition is equivalent to the condition that the binary linear code of length 2 m ???1, whose parity check matrix has jth column equal to \({\omega^j \brack f(\omega^j)}\), is double-error-correcting, where ? is primitive in V. Carlet et al. (Designs Codes Cryptogr 15:125156, 1998) proved that this code has dimension 2 m ???1???2m; but their indirect proof uses a subtle argument involving general code parameter bounds to show that a double-error correcting code of this length could not be larger. We show here that this result follows immediately from a well-known result on bent functions ...a subject dear to the heart of Jacques Wolfmann.

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

double-error-correcting code
primary 94b05
secondary 05b10


Comparison of position repeatability of a human operator and an industrial manipulating robot Robot performance criteria of position repeatability are studied. Weight-to-payload ratio is in manipulating robots significantly higher than in human operators. Bracing strategy improving the robot performances is introduced in the paper. The strategy copies human behavior during fine motion operations. A comparison is made between the robot and the human operator performing approximately the same manipulating task. Contactless measurements of position repeatability were accomplished with the OPTOTRAK motion analysis system. The results of tests demonstrate considerable improvement of robot and human operator's position repeatability when using bracing.

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

human operator
repeatability
measurements
bracing strategy


Dynamical features simulated by recurrent neural networks The evolution of two-dimensional neural network models with rank one connecting matrices and saturated linear transfer functions is dynamically equivalent to that of piecewise linear maps on an interval. It is shown that their iterative behavior ranges from being highly predictable, where almost every orbit accumulates to an attracting fixed point, to the existence of chaotic regions with cycles of arbitrarily large period.

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


A Dual Decomposition Approach to Feature Correspondence In this paper, we present a new approach for establishing correspondences between sparse image features related by an unknown nonrigid mapping and corrupted by clutter and occlusion, such as points extracted from images of different instances of the same object category. We formulate this matching task as an energy minimization problem by defining an elaborate objective function of the appearance and the spatial arrangement of the features. Optimization of this energy is an instance of graph matching, which is in general an NP-hard problem. We describe a novel graph matching optimization technique, which we refer to as dual decomposition (DD), and demonstrate on a variety of examples that this method outperforms existing graph matching algorithms. In the majority of our examples, DD is able to find the global minimum within a minute. The ability to globally optimize the objective allows us to accurately learn the parameters of our matching model from training examples. We show on several matching tasks that our learned model yields results superior to those of state-of-the-art methods.

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

graph matching
feature correspondence
dual decomposition


IR-sintering efficiency on inkjet-printed conductive structures on paper substrates The use of fibre-based materials as substrates in printed electronics has been increasing, mainly due to its attractive characteristics, such as low-cost or wide availability. Additionally, paper enables recycling and it shows attractive features, such as high thermal stability, when compared to traditional polymer-based substrates (Tobjrk and sterbacka, 2011 [1]). Nevertheless, one of the drawbacks of using paper substrates is that the surface usually is very rough, typically, showing roughness values above 10?m2. In most cases, printing structures that need to be highly uniform, without disruptions, require additional coating. Inkjet printing provides sharp detail reproduction and strict lines on printed structures. Sintering is required for drying the ink. Thermal sintering is the traditionally used method, but requires long periods of time and promotes the ageing of the paper due to a long exposure at high temperature. When printing conductive structures on paper alternative photonic sintering methods such as IR-sintering show some attractive characteristics. IR-sintering is compatible with roll-to-roll fabrication, providing low-cost, fast and localized sintering, which makes it suitable for fibre-based substrates (Tobjrk et al., 2012 [3]). This work has been carried out to study and compare the efficiency of thermal and IR sintering of conductive structures on different paper and polymer substrates. All substrates were printed using silver based ink, which was applied on the substrate surface by inkjet. Resistivity values of the printed structures were used to compare the performance on the substrates. IR-sintering showed the best results in terms of achieved conductivity of the printed lines when using short sintering time of no more than 10min. The conductivity values of the inkjet-printed silver lines on Lumi silk substrate reached about 40% of the bulk silver value after IR-sintering, whereas with thermal-sintering this value only reached about 20% of the bulk silver value. IR-sintering improves the sintering process, increasing the conductivity of the printed structures and at the same time reducing significantly the sintering time. In the case of Lumi silk substrate, high conductivity was observed after only two minutes of sintering time when IR-oven was used. Both techniques can be used in a roll-to-roll mass manufacturing process, enabling the fabrication in large scale of flexible electronic devices, on paper substrates, without the need for extra steps, such as coatings.

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

paper substrate
ir-sintering
inkjet-printing
conductive patterns
nanoparticles


processing queries with quantifiers a horticultural approach Most research on query processing has focussed on quantifier-free conjunctive queries. Existing techniques for processing queries with quantifiers either compile the query into a nested loop program or use variants of Codd's reduction from the Relational Calculus to the Relational Algebra. In this paper we propose an alternative technique that uses an algebra of graft and prune operations on trees. This technique provides a significant savings in space and time. We show how to transform a quantified conjunctive query into a sequence of graft and prune operations.

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

research
use
space
reduction
conjunctive queries
trees
queries
paper
algebra
sequence
prune
query processing
query

relation algebra
operability
process
timing
relation
transformation


A survey on wireless body area networks The increasing use of wireless networks and the constant miniaturization of electrical devices has empowered the development of Wireless Body Area Networks (WBANs). In these networks various sensors are attached on clothing or on the body or even implanted under the skin. The wireless nature of the network and the wide variety of sensors offer numerous new, practical and innovative applications to improve health care and the Quality of Life. The sensors of a WBAN measure for example the heartbeat, the body temperature or record a prolonged electrocardiogram. Using a WBAN, the patient experiences a greater physical mobility and is no longer compelled to stay in the hospital. This paper offers a survey of the concept of Wireless Body Area Networks. First, we focus on some applications with special interest in patient monitoring. Then the communication in a WBAN and its positioning between the different technologies is discussed. An overview of the current research on the physical layer, existing MAC and network protocols is given. Further, cross layer and quality of service is discussed. As WBANs are placed on the human body and often transport private data, security is also considered. An overview of current and past projects is given. Finally, the open research issues and challenges are pointed out.

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


Sign Language Phoneme Transcription with Rule-based Hand Trajectory Segmentation A common approach to extract phonemes of sign language is to use an unsupervised clustering algorithm to group the sign segments. However, simple clustering algorithms based on distance measures usually do not work well on temporal data and require complex algorithms. In this paper, we present a simple and effective approach to extract phonemes from American sign language sentences. We first apply a rule-based segmentation algorithm to segment the hand motion trajectories of signed sentences. We then extract feature descriptors based on principal component analysis to represent the segments efficiently. The segments are clustered by k-means using these high level features to derive phonemes. 25 different continuously signed sentences from a deaf signer were used to perform the analysis. After phoneme transcription, we trained Hidden Markov Models to recognize the sequence of phonemes in the sentences. Overall, our automatic approach yielded 165 segments, and 58 phonemes were obtained based on these segments. The average number of recognition errors was 18.8 (11.4%). In comparison, completely manual trajectory segmentation and phoneme transcription, involving considerable labor yielded 173 segments, 57 phonemes, and the average number of recognition errors was 33.8 (19.5%).

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

phoneme transcription
trajectory segmentation

american sign language (asl)
principal component analysis (pca)
hidden markov models (hmm)


Problems for a Philosophy of Software Engineering On the basis of an earlier contribution to the philosophy of computer science by Amnon Eden, this essay discusses to what extent Edens paradigms of computer science can be transferred or applied to software engineering. This discussion implies an analysis of how software engineering and computer science are related to each other. The essay concludes that software engineering can neither be fully subsumed by computer science, nor vice versa. Consequently, also the philosophies of computer science and software engineeringthough related to each otherare not identical branches of a general philosophy of science. This also implies that not all of Edens earlier arguments can be directly mapped from the domain of computer science into the domain of software science. After the discussion of this main topic, the essay also points to some further problems and open issues for future studies in the philosophy of software science and engineering.

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

computer science
software engineering
paradigms


The impact of voluntary disclosure on a firms investment policy We provide a model describing how disclosure affects firms investment decisions. Uncertainty over way in which information disclosed will be interpreted by market. This can lead to sub-optimal investment timing decisions. Extent of sub-optimality depends on stock price impact from disclosure.

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

economics
real options
sub-optimal investment


Sub-10nm resolution after lift-off using HSQ/PMMA double layer resist A HSQ/PMMA double layer resist process reaching sub-10nm resolution after lift-off. Utilizing a PMMA sacrificial layer beneath HSQ to perform lift-off without using HF. High resolution patterning using HSQ and lift-off employing organic solvents.

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

electron beam lithography
hsq/pmma double layer resist
sub-10 nm resolution
hf free lift-off
plasmonics


Computing the number of cubic runs in standard Sturmian words The standard Sturmian words (standard words in short) are extensively studied in combinatorics of words. They are complicated enough to have many interesting properties, and, at the same time, due to their recurrent structure, they are highly compressible. In this paper, we present compact formulas for the number of cubic runs in any standard word w w (denoted by ?(3)(w) ? ( 3 ) ( w ) ). We show also that

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

sturmian words
standard words
cubic runs


TRIAL: A Tool for Finding Distant Structural Similarities Finding structural similarities in distantly related proteins can reveal functional relationships that can not be identified using sequence comparison. Given two proteins A and B and threshold epsilon angstrom, we develop an algorithm, TRiplet-based Iterative ALignment (TRIAL) for computing the transformation of B that maximizes the number of aligned residues such that the root mean square deviation (RMSD) of the alignment is at most epsilon angstrom. Our algorithm is designed with the specific goal of effectively handling proteins with low similarity in primary structure, where existing algorithms perform particularly poorly. Experiments show that our method outperforms existing methods. TRIAL alignment brings the secondary structures of distantly related proteins to similar orientations. It also finds larger number of secondary structure matches at lower RMSD values and increased overall alignment lengths. Its classification accuracy is up to 63 percent better than other methods, including CE and DALI. TRIAL successfully aligns 83 percent of the residues from the smaller protein in reasonable time while other methods align only 29 to 65 percent of the residues for the same set of proteins.

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


Bluetooth based home automation system The past decade has seen significant advancement in the field of consumer electronics. Various intelligent appliances such as cellular phones, air-conditioners, home security devices, home theatres, etc. are set to realize the concept of a smart home. They have given rise to a Personal Area Network in home environment, where all these appliances can be interconnected and monitored using a single controller. Busy families and individuals with physical limitation represent an attractive market for home automation and networking. A wireless home network that does not incur additional costs of wiring would be desirable. Bluetooth technology, which has emerged in late 1990s, is an ideal solution for this purpose. This paper describes an application of Bluetooth technology in home automation and networking environment. It proposes a network, which contains a remote, mobile host controller and several client modules (home appliances). The client modules communicate with the host controller through Bluetooth devices.

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


Capturing significant events with neural networks Smartphone video capture and transmission to the Web contributes to data pollution. In contrast, mammalian eyes sense all, capture only significant events, allowing us vividly recall the causalities. Likewise in our videos, we wish to skip redundancies and keep only significantly differences, as determined by real-time local medium filters. We construct a Picture Index (PI) of ones (center of gravity changes) among zeros (no changes) as Motion Organized Sparseness (MOS). Only non-overlapping time-ordered PI pair is admitted in the outer-product Associative Memory (AM). Another outer product between PI and its image builds Hetero-AM (HAM) for fault tolerant retrievals.

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

compressive sensing
human visual system
compressive video sampling


Camera-based eye blinks pattern detection for intelligent mouse Humancomputer interface systems provide an alternative input modality to allow people with severe disabilities to access computer systems. One of the inexpensive and unobtrusive methods for this purpose is image-based eye blinks detection. Currently, available humancomputer interface systems are often intrusive, limit in head rotation, require special hardware, and have special lighting or manual initialization. This paper presented a new robust method for real-time eye blinks detection. This method enables interaction using blink patterns, which are sequences of long and short blinks interpreted as semiotic messages. The precise location of the eye is determined automatically through multi-cues, accompanied by integration of eye variance feature and Gaussian Mixture Model classifier. The detected eye window is converted into a binary image. The eyelids distance is extracted by applying a variance projection derivative function. By following the eyelids distance in a finite-state machine, the blink patterns can be detected. The performance of the presented algorithm is evaluated using several frame streams. The experimental results show a robust eye blink pattern detection system in real 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 B I I O O O O O O O O O O O O O O O O O O O O O O O B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

eye variance feature
variance projection derivative function


computer science education in small colleges A Subcommittee on Small College Programs, was appointed by the Committee on Curriculum in Computer Science, of the Association for Computing Machinery in 1969. This group was charged with responsibility of making recommendations for the development of programs in computer science in smaller colleges and universities. The report will consider course structure, to be offered with the constraints of limited faculty, and with a wide variety of objectives. Outlines of the key courses will be included, as well as recommendations for independent study courses. Another significant factor involved in these considerations, is the relationship of computer science to the computer center, and to the college as a whole. In particular, the service nature of the department and the center, and the development of meaningful computer use within the schools will be considered. Finally, recommendations will be given regarding faculty acquisition and development.

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

computer science
use
structure
factor
association
faculty
group
curriculum

program
recommendation
relationships
developer
computer science education
computation
object
response
constraint


A data mining approach to face detection In this paper, we propose a novel face detection method based on the MAFIA algorithm. Our proposed method consists of two phases, namely, training and detection. In the training phase, we first apply Sobel's edge detection operator, morphological operator, and thresholding to each training image, and transform it into an edge image. Next, we use the MAFIA algorithm to mine the maximal frequent patterns from those edge images and obtain the positive feature pattern. Similarly, we can obtain the negative feature pattern from the complements of edge images. Based on the feature patterns mined, we construct a face detector to prune non-face candidates. In the detection phase, we apply a sliding window to the testing image in different scales. For each sliding window, if the slide window passes the face detector, it is considered as a human face. The proposed method can automatically find the feature patterns that capture most of facial features. By using the feature patterns to construct a face detector, the proposed method is robust to races, illumination, and facial expressions. The experimental results show that the proposed method has outstanding performance in the MIT-CMU dataset and comparable performance in the BioID dataset in terms of false positive and detection rate.

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

face detection
feature pattern
data mining

maximal frequent pattern
support vector machine


CSM-SD: Methodology for contrast set mining through subgroup discovery ? This paper addresses a data analysis task, known as contrast set mining, whose goal is to find differences between contrasting groups. As a methodological novelty, it is shown that this task can be effectively solved by transforming it to a more common and well-understood subgroup discovery task. The transformation is studied in two learning settings, a one-versus-all and a pairwise contrast set mining setting, uncovering the conditions for each of the two choices. Moreover, the paper shows that the explanatory potential of discovered contrast sets can be improved by offering additional contrast set descriptors, called the supporting factors. The proposed methodology has been applied to uncover distinguishing characteristics of two groups of brain stroke patients, both with rapidly developing loss of brain function due to ischemia:those with ischemia caused by thrombosis and by embolism, respectively.

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

contrast set mining
subgroup discovery
supporting factors


revealing delay in collaborative environments Delay is an unavoidable reality in collaborative environments. We propose an approach to dealing with delay in which 'decorators' are introduced into the interface. Decorators show the presence, magnitude and effects of delay so that participants can better understand its consequences and adopt their own natural coping strategies. Two experiments with different decorators show that this approach can significantly reduce errors in specific collaborative activities. We conclude that revealing delays is one way in which groupware can benefit from accepting and working with the reality of distributed systems, rather than trying to maintain the illusion of copresent interaction.

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

interaction
groupware
strategies
delay
presence
collaborative environments
errors
distributed systems

activation
collaboration
shared workspaces
maintainability
jitter
interfaces
experience
latency
effect
network delay
participant


routing in a cyclic mobispace A key challenge of routing in delay tolerant networks (DTNs) is finding routes that have high delivery rates and low end-to-end delays. When oracles are not available for future connectivity, opportunistic routing is preferred in DTNs, in which messages are forwarded to nodes with higher delivery probabilities. We observe that real objects have repetitive motions, but no prior research work has investigated the cyclic delivery probability of messages between nodes. In this paper, we propose to use the expected minimum delay (EMD) as a new delivery probability metric in DTNs with repetitive but non-deterministic mobility. Specifically, we model the network as a probabilistic time-space graph with historical contact information or prior knowledge about the network. We then translate it into a probabilistic state-space graph in which the time dimension is removed. Finally, we apply the Markov decision process to derive the EMDs of the messages at particular times. Our proposed EMD-based routing protocol, called routing in cyclic MobiSpace (RCM), outperforms several existing opportunistic routing protocols when simulated using both real and synthetic traces.

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

simulation
trace
delay tolerant networks (dtns)


Combination of turbo decoding and equalization using soft-output Viterbi algorithm An iterative decoder of turbo code over an inter-symbol interference channel is proposed. A component decoder realizes decoding and equalization simultaneously with the soft-output Viterbi algorithm (SOVA). A decoding algorithm and simulation results are shown.

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


A simple and efficient real-coded genetic algorithm for constrained optimization A novel and efficient RCGA for constrained optimization has been proposed. The proposed RCGA integrates three effective and novel evolutionary operators named RS, DBX and DRM. The proposed RCGA is proven to have a small complexity index and outperform many state-of-the-art algorithms. The proposed RCGA has been successfully applied to optimize the GaAs film-growth performance of an MOCVD process.

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

evolutionary algorithms
real-coded genetic algorithm
crossover operator
penalty functions


Cloud Computing System Management Under Flat Rate Pricing Success of cloud computing service depends on an acceptable pricing mechanism both by users and the service provider. Piece rate pricing by counting work load should be favorable for the service provider due to the QoS control and finite resource, such as computing and, communication powers. Though the pricing mechanism based on counting work load is reasonable and fair, the experiences learned from ADSL, 3G and Wi-Fi show a different story. The flat rate pricing mechanism is the winner all the way. This study proposes a flat rate pricing mechanism with congestion control, called FRPCC. In the cloud computing system, allocation of resources can be formulated as an optimization problem seeking to maximize the sum of the utility function of each user under the constraints of fairness. The piece rate pricing mechanism is easy to achieve the social welfare but is not easy to be acceptable for customers. Consequently, we propose a congestion control scheme to reach the same goal with a flat rate pricing mechanism. The proposed FRPCC approach can achieve social welfare in the cloud computing environment. Performance evaluations show efficacy of, FRPCC approach in providing social welfare under fairness and preventing congestion.

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

fairness
pricing mechanism
social welfare

performance evaluation
tragedy of the commons


A General Framework for Efficient Continuous Multidimensional Top-k Query Processing in Sensor Networks Top-k query has long been a crucial problem in multiple fields of computer science, such as data processing and information retrieval. In emerging cyber-physical systems, where there can be a large number of users searching information directly into the physical world, many new challenges arise for top-k query processing. From the client's perspective, users may request different sets of information, with different priorities and at different times. Thus, top-k search should not only be multidimensional, but also be across time domain. From the system's perspective, data collection is usually carried out by small sensing devices. Unlike the data centers used for searching in the cyber-space, these devices are often extremely resource constrained and system efficiency is of paramount importance. In this paper, we develop a framework that can effectively satisfy demands from the two aspects. The sensor network maintains an efficient dominant graph data structure for data readings. A simple top-k extraction algorithm is used for user query processing and two schemes are proposed to further reduce communication cost. Our methods can be used for top-k query with any linear convex query function. The framework is adaptive enough to incorporate some advanced features; for example, we show how approximate queries and data aging can be applied. To the best of our knowledge, this is the first work for continuous multidimensional top-k query processing in sensor networks. Simulation results show that our schemes can reduce the total communication cost by up to 90 percent, compared with a centralized scheme or a straightforward extension from previous top-k algorithm on 1D sensor data.

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

algorithm/protocol design
top-k extraction


Statistical approaches to combining binary classifiers for multi-class classification One of the popular methods for multi-class classification is to combine binary classifiers. In this paper, we propose a new approach for combining binary classifiers. Our method trains a combining method of binary classifiers using statistical techniques such as penalized logistic regression, stacking, and a sparsity promoting penalty. Our approach has several advantages. Firstly, our method outperforms existing methods even if the base classifiers are well-tuned. Secondly, an estimate of conditional probability for each class can be naturally obtained. Furthermore, we propose selecting relevant binary classifiers by adding the group lasso type penalty in training the combining method.

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

combining binary classifiers
stacking
group lasso


Channel Aware Multiuser Scalable Video Streaming Over Lossy Under-Provisioned Channels: Modeling and Analysis In this paper, we analyze the performance of media-aware multiuser video streaming strategies in capacity limited wireless channels suffering from latency problems and packet losses. Wireless video streaming applications are characterized by their bandwidth-intensity, delay-sensitivity, and loss-tolerance. Our main contributions include i) a rate-minimized unequal erasure protection (UXP) scheme, ii) an analytical expression for packet delay and play-out deadline of UXP protected scalable video, iii) a loss-distortion model for hierarchical predictive video coders with picture copy concealment, iv) an analysis of the performance and complexity of delay-aware, capacity-aware, and optimized UXP streaming scenarios, and v) we show that the use of unequal error protection causes a rate-constrained optimization problem to be nonconvex. Performance evaluations using a 3GPP network simulator show that, for different channel capacities and packet loss rates, delay-aware nonstationary rate-allocation streaming policies deliver significant gains which range between 1.65 dB to 2 dB in average Y-PSNR of the received video streams over delay-unaware strategies. These gains come at a cost of increased offline computation which is performed prior to the start of the streaming session or in batches during transmission and therefore, do not affect the run-time performance of the streaming system.

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

loss-distortion modeling
scalable video coding (svc)
streaming delay analysis
unequal erasure protection (uxp)


Effective information technology (IT) governance mechanisms: An IT outsourcing perspective Effective IT governance will ensure alignment between IT and business goals. Organizations with ineffective IT governance will suffer due to poor performance of IT resources such as inaccurate information quality, inefficient operating costs, runaway IT project and even the demise of its IT department. This study seeks to examine empirically the individual IT governance mechanisms that influence the overall effectiveness of IT governance. Furthermore, this study examines the relationship of effective IT governance, the extent of IT outsourcing decisions within the organizations, and the level of IT Intensity in the organizations. We used structural equation modeling analysis to examine 110 responses from members of ISACA (Information Systems and Audit Control Association) Australia in which their organizations have outsourced their IT functions. Results suggest significant positive relationships between the overall level of effective IT governance and the following mechanisms: the involvement of senior management in IT, the existence of ethic or culture of compliance in IT, and corporate communication systems.

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

it governance
it intensity
it outsourcing
australia


Novel Tensor Product Models for Automatic Transmission System Control This paper discusses novel tensor product (TP) models for the control of two complex components of the vehicle automatic transmission systems, namely the drive line without clutch and, the valve-clutch. The TP models are obtained by a transformation of the linear parameter-varying models derived from the first principle nonlinear mathematical models of the controlled processes. Experimental results validate the performance of the proposed TP models.

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

control systems
tensor product (tp) models
valve-clutch


Driver Risk Perception and Physiological State During Car-Following Experiments Using a Driving Simulator For passengers to become comfortable with automatic driving, it is important to clarify when they sense danger. For the sake of safety and reproducibility of dangerous situations, experiments using a driving simulator are preferred to experiments in actual traffic. However, drivers sense of danger in a driving simulator has not been well studied. We conducted two experiments using a driving simulator to examine drivers sense of danger. In Experiment 1, drivers followed a car. We measured driver perspiration when the forward car suddenly decelerated. Experiment 2 was a simulation of two platooning trucks. We observed the perspiration of the driver in the following truck. Results indicated a correlation between inverse Time-To-Collision and perspiration rate change. We analyzed the correlation between perspiration and car motion variables for practical application to automatic driving.

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

platooning
driving simulator
sense of danger


main components of a mpls recovery approach The paper discusses some of the main components of an eDirectory integrated Multiprotocol Label Switching (MPLS) recovery approach.

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

multiprotocol label switching (mpls)
traffic engineering
qos


Synergy between combinatorial chemistry and de novo design Traditional de novo design algorithms are able to generate many thousands of ligand structures that meet the constraints of a protein structure, but these structures are often not synthetically tractable. In this article, we describe how concepts from structure-based de novo design can be used to explore the search space in library design. A key features of the approach is the requirement that specific templates are included within the designed structures. Each template corresponds to the "central core" of a combinatorial library. The template is positioned within an acyclic chain whose length and bond orders are systematically varied, and the conformational space of each structure that results (core plus chain) is explored to determine whether it is able to link together two or more strongly interacting functional groups or pharmacophores located within a protein binding site. This fragment connection algorithm provides "generic" 3D molecules in the sense that the linking part (minus the template) is built from an all-carbon chain whose synthesis may not be easily achieved. Thus, in the second phase, 2D queries are derived from the molecular skeletons and used to identify possible reagents from a database. Each potential reagent is checked to ensure that it is compatible with the conformation of its parent 3D conformation and the constraints of the binding site. Combinations of these reagents according to the combinatorial library reaction scheme give product molecules that contain the desired core template and the key functional/pharmacophoric groups, and would be able to adopt a conformation compatible with the original molecular skeleton without any unfavorable intermolecular or intramolecular interactions. We discuss how this strategy compares with and relates to alternative approaches to both structure-based library design and de novo design. (C) 2000 by Elsevier Science Inc.

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

structure-based design
combinatorial libraries


Improved minimax bounds on the test and training distortion of empirically designed vector quantizers It has been shown by earlier results that the minimax expected (test) distortion redundancy of empirical vector quantizers with three or more levels designed from n independent and identically distributed (i.i.d.) data points is at least Omega(1/root n) for the class of distributions on a bounded set. In this correspondence, a much simpler construction and proof for this are given with much better constants. There are similar bounds for the training distortion of the empirically optimal vector quantizer with three or more levels. These rates, however, do not hold for a one-level quantizer. Here, the two-level quantizer case is clarified, showing that it already shares the behavior of the general case. Given that the minimax bounds are proved using a construction that involves discrete distributions, one suspects that for the class of distributions with uniformly bounded continuous densities, the expected distortion redundancy might decrease as o(1/root n) uniformly. It is shown as well that this is not so, proving that the lower bound for the expected test distortion remains true for these subclasses.

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

clustering methods
empirical design
lower bounds
minimax control
vector quantization


An incremental approach for maintaining functional dependencies A general assumption in all existing algorithms permitting to mine functional dependencies is that the database is static. However, real life databases are frequently updated. To the best of our knowledge, the discovery of functional dependencies in dynamic databases has never been studied. A naive solution consists in re-applying one of the existing algorithms to discover functional dependencies holding on the updated database. Nevertheless, in many domains, where response time is crucial, re-executing algorithms from scratch would be inacceptable. In this paper, we propose a new technique that makes use of the previously discovered results to cut down the amount of work that has been done to discover the new set of functional dependencies satisfied by the updated database.

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

evolving databases
data mining
knowledge discover
maintenance


SMPLearner: learning to predict software maintainability Accurate and practical software maintainability prediction enables organizations to effectively manage their maintenance resources and guide maintenance-related decision making. This paper presents SMPLearner, an automated learning-based approach to train maintainability predictors by harvesting the actual average maintenance effort computed from the code change history as well as employing a much richer set of 44 four-level hierarchical code metrics collected by static code analysis tools. We systematically evaluated SMPLearner on 150 observations partitioned from releases of eight large scale open source software systems. Our evaluation showed that SMPLearner not only outperformed the traditional 4-metric MI model but also the recent learning-based maintainability predictors constructed based on single Class-level metrics, demonstrating that single Class-level metrics were not sufficient for maintainability prediction.

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

software maintainability
maintenance effort


Aggregating preferences rankings with variable weights A new model based on scoring rules is proposed for ranking candidates. It allows to assess each candidate with the most favorable vector for him/her. It avoids some problems that other models have. Closed expressions for the scores of candidates are given in some cases.

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


Improving the Evaluation of Software Development Methodology Adoption and its Impact on Enterprise Performance Although the literature studying software development methodologies (SDMs) lists several significant positive effects of the deployment of SDMs, investments into SDMs by the enterprises remain relatively limited. Strategic investments decisions, such as SDMs investments, are mostly taken with the goal of improving enterprise performance. In this paper a model for evaluation of the adoption of SDMs that focuses on the abovementioned SDMs impact on enterprise performance is proposed. The model was empirically tested in four case studies in software development small and medium enterprises (SMEs) in Slovenia. The case studies confirmed that the use of the proposed model enabled SMEs to improve SDMs related investment and adoption decisions and enabled SMEs to invest their limited resources in the most productive and competitive way. The case study experience with the proposed model suggests that its use would also bring similar benefits to larger software development enterprises.

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

software development methodologies
enterprise performance


A survey of computational steering environments Computational steering is a powerful concept that allows scientists to interactively control a computational process during its execution. In this paper, a survey of computational steering environments for the on-line steering of ongoing scientific and engineering simulations is presented. These environments can be used to create steerable applications for model exploration, algorithm experimentation, or performance optimization. For each environment the scope is identified, the architecture is summarized, and the concepts of the user interface are described. The environments are compared and conclusions and future research issues are given.

O O O B I O B I O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 generalization of the E-LOTOS trapping operator: towards reconciliation with LOTOS LOTOS and its enhanced version E-LOTOS are standard languages for formal specification of concurrent and reactive systems. For better backward compatibility of E-LOTOS with LOTOS, we introduce into E-LOTOS specification and trapping of non-urgent and potentially decisive successful termination of processes.

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


a set of multi-touch graph interaction techniques Interactive node-link diagrams are useful for describing and exploring data relationships in many domains such as network analysis and transportation planning. We describe a multi-touch interaction technique set (IT set) that focuses on edge interactions for node-link diagrams. The set includes five techniques (TouchPlucking, TouchPinning, TouchStrumming, TouchBundling and PushLens) and provides the flexibility to combine them in either sequential or simultaneous actions in order to address edge congestion.

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

interaction technique set
interaction techniques

multi-touch
node-link graph manipulation
gestures


Simulation of endovascular guidewire behaviour and experimental validation Guidewire manipulation is a core skill in endovascular interventional radiology procedures. Simulation-based training offers a valuable alternative for mastering these skills, but requires a faithful replication of complex guidewire behaviour inside the vasculature. This paper presents the integration of real flexural modulus (FM) measurements into our guidewire model that mimics the flexibility of standard guidewires. The variation of FM along the length of each wire was determined for seven commonly used guidewires using a three-point bending test for the main body and a two-point bending test for the flexible end. Guidewire FM values were then attributed to seven different models, each formed by a series of particles connected by links of variable FM and replicating the flexible end shape. The FM integration was done through a trial and error process matching real FM to virtual bending coefficient. This mass-spring representation captures the required range of behaviour and enables accurate deformation within virtual vasculature.

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

interventional radiology
guidewire model


Symbol grounding through robotic manipulation in cognitive systems Though proposals have been put forth to solve the classical symbol grounding problem through robotic sensorimotor interactions, only little progress has been made in this direction with actual working systems, and symbol grounding through physical interaction has been rarely dealt with. We address this problem in the context of robotic manipulation for cognitive systems, and claim that there are symbols which do not refer simply to physical objects but rather to the embodied interactions between the robot and the objects in its environment. Through the description of two manipulation experiments we offer a proposal on which to build a theory of symbolic representations for physical interactions. Some important neuroscience studies that support our view are also briefly described.

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

symbol grounding
sensorimotor interactions
cognitive systems

visually-guided grasping
peg in hole insertion


Scaling the fractional advectivedispersive equation for numerical evaluation of microbial dynamics in confined geometries with sticky boundaries Microbial motility is often characterized by run and tumble behavior which consists of bacteria making sequences of runs followed by tumbles (random changes in direction). As a superset of Brownian motion, Levy motion seems to describe such a motility pattern. The Eulerian (FokkerPlanck) equation describing these motions is similar to the classical advectiondiffusion equation except that the order of highest derivative is fractional, ??(0,2]. The Lagrangian equation, driven by a Levy measure with drift, is stochastic and employed to numerically explore the dynamics of microbes in a flow cell with sticky boundaries. The Eulerian equation is used to non-dimensionalize parameters. The amount of sorbed time on the boundaries is modeled as a random variable that can vary over a wide range of values. Salient features of first passage time are studied with respect to scaled parameters.

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

levy motion
microbial dynamics
sticky boundaries

stochastic ordinary differential equations


Mesh smoothing using the Geometric Element Transformation Method A novel method for smoothing triangular surface meshes is presented. It is based on the Geometric Element Transformation Method (GETMe) representing a simple geometric operation. In contrast to existing smoothing techniques, GETMe transforms single elements thus resulting in a simultaneous movement of all nodes of an element. The effect of this transformation, if applied iteratively, is the asymptotical but rapid regularization of the initial element. Mesh smoothing is achieved by applying this transformation to every poor quality element until overall mesh quality reaches a user defined level. Thereby, a lower bound for the minimal element angle and an upper bound for the maximal element angle serve as natural control variables in order to freely adjust mesh quality with respect to subsequent applications. Descriptions of the basic smoothing algorithm as well as modifications to preserve shape and to incorporate constraints on nodes are given. Numerical experiments on both artificial and real world meshes demonstrate the methods potential and flexibility.

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

iterative element optimization
triangulation
surface mesh
finite element mesh


learning, anticipation and time-deception in evolutionary online dynamic optimization In this paper we focus on an important source of problem-difficulty in (online) dynamic optimization problems that has so far received significantly less attention than the traditional shifting of optima. Intuitively put, decisions taken now (i.e. setting the problem variables to certain values) may influence the score that can be obtained in the future. We indicate how such time-linkage can deceive an optimizer and cause it to find a suboptimal solution trajectory. We then propose a means to address time-linkage: predict the future by learning from the past. We formalize this means in an algorithmic framework. Also, we indicate why evolutionary algorithms are specifically of interest in this framework. We have performed experiments with two new benchmark problems that contain time-linkage. The results show, as a proof of principle, that in the presence of time-linkage EAs based upon this framework can obtain better results than classic EAs that do not predict the future.

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

learning
dynamic optimization
evolutionary algorithms


Automorphisms of constant weight codes and of divisible designs We show that the automorphism group of a divisible design D is isomorphic to a subgroup H of index 1 or 2 in the automorphism group Aut C(D) of the associated constant weight code. Only in very special cases H is not the full automorphism group.

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

divisible design
constant weight code
automorphism group