Fuzzy-rough feature selection aided support vector machines for Mars image classification ? This paper presents a novel application of advanced machine learning techniques for Mars terrain image classification. Fuzzy-rough feature selection (FRFS) is adapted and then employed in conjunction with Support Vector Machines (SVMs) to construct image classifiers. These techniques are integrated to address problems in space engineering where the images are of many classes, large-scale, and diverse representational properties. The use of the adapted FRFS allows the induction of low-dimensionality feature sets from feature patterns of a much higher dimensionality. To evaluate the proposed work, K-Nearest Neighbours (KNNs) and decision trees (DTREEs) based image classifiers as well as information gain rank (IGR) based feature selection are also investigated here, as possible alternatives to the underlying machine learning techniques adopted. The results of systematic comparative studies demonstrate that in general, feature selection improves the performance of classifiers that are intended for use in high dimensional domains. In particular, the proposed approach helps to increase the classification accuracy, while enhancing classification efficiency by requiring considerably less features. This is evident in that the resultant SVM-based classifiers which utilise FRFS-selected features generally outperform KNN and DTREE based classifiers and those which use IGR-returned features. The work is therefore shown to be of great potential for on-board or ground-based image classification in future Mars rover missions.

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

support vector machines
image classification

fuzzy-rough feature selection
mars terrain images


An evolutionary search procedure for optimizing time-cost performance of projects under multiple renewable resource constraints This paper presents an effective procedure for optimizing time-cost performance of multi-mode resource constrained project scheduling problems in which activities are subject to finish-start precedence constraints under renewable limited resources. Associated with each execution mode of activities, there exists a direct cost, a processing time, and a set of required renewable resources. In optimizing time-cost performance, the procedure treats the cost as a non-renewable resource whose limit can affect the duration of the project and balances cost versus time through the notion of priority-rank. This is performed by the use of a module which handles multimode projects, and since the procedure has to call this module with different limits on the cost, the effectiveness of this module plays a key role in the overall efficiency. For this reason, an effective evolutionary search technique has been developed to create the basis of this module. For testing its effectiveness, this module has been tested on 552 largest multimode benchmark instances of the PSPLIB and the results are promising: For over 98% of instances, the module finds the best available solutions in the literature. The module also produces a solution for one of these benchmark instances that is better than all of the current solutions in the literature. (C) 2013 Elsevier Ltd. All rights reserved.

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

project management
time-cost trade-off
overall cost minimization
evolutionary computation


FastTrack: Efficient and Precise Dynamic Race Detection Multithreaded programs are notoriously prone to race conditions. Prior work on dynamic race detectors includes fast but imprecise race detectors that report false alarms, as well as slow but precise race detectors that never report false alarms. The latter typically use expensive vector clock operations that require time linear in the number of program threads. This paper exploits the insight that the full generality of vector clocks is unnecessary in most cases. That is, we can replace heavyweight vector clocks with an adaptive lightweight representation that, for almost all operations of the target program, requires only constant space and supports constant-time operations. This representation change significantly improves time and space performance, with no loss in precision. Experimental results on Java benchmarks including the Eclipse development environment show that our FASTTRACK race detector is an order of magnitude faster than a traditional vector-clock race detector, and roughly twice as fast as the high-performance DJIT(+) algorithm. FASTTRACK is even comparable in speed to ERASER on our Java benchmarks, while never reporting false alarms.

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

languages
algorithms
verification
concurrency
dynamic analysis


Evaluating collaborative information-seeking interfaces with a search-oriented inspection method and re-framed information seeking theory Despite the many implicit references to the social contexts of search within information seeking and retrieval research, there has been relatively little work that has specifically investigated the additional requirements for collaborative information-seeking interfaces. Here, we re-assess an existing analytical inspection framework, designed for individual information seeking, and then apply it to evaluate a recent collaborative information-seeking interface: SearchTogether. The framework was built upon two models of solitary information seeking, and so as part of the re-assessment we first re-frame the models for collaborative contexts. We re-frame a model of search tactics, providing revised definitions that consider known collaborators. We then re-frame a model of searcher profiles to analyse support for different group dynamics. After presenting an analysis of SearchTogether, we reflect on its accuracy, showing that the framework identified eight known truths, eight new insights, and no known-to-be-untrue insights into the design. We conclude that the framework: (a) can still be applied to collaborative information-seeking interfaces; (b) can successfully produce additional requirements for collaborative information-seeking interfaces; and (c) can successfully model different dynamics of collaborating searchers.

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

collaborative search information seeking inspection analytical


A closer look on social presence as a causing factor in computer-mediated collaboration So far, research in computer-mediated collaboration has investigated various factors influencing the amount of social presence experienced in online settings. This experimental study broadens the perspective and investigates social presence as a causing factor on participants perception on task, medium and collaboration. Therefore an experiment with between subject design was conducted, with manipulation of three different levels of social presence: Full (f2f), medium online and low social presence (each n=20). Participants had to solve an online puzzle in dyads. Findings mainly confirm a favourable influence of social presence on the perception of task and collaboration. Additionally, this study supports the importance of considering the reciprocal nature of social presence.

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

computer-mediated collaboration
chat
ict experience
online media experience


Upbeat-Torsional Nystagmus and Contralateral Fourth-Nerve Palsy due to Unilateral Dorsal Ponto Mesencephalic Lesion The central projections of the anterior semicircular canals are thought to be conveyed from the vestibular nuclei to the oculomotor nuclei in the midbrain by three distinct brainstem pathways: the medial longitudinal fasciculus, crossing ventral tegmental tract, and brachium conjunctivum. There is controversy as to whether upbeat nystagmus could result from lesions involving each of these pathways. We report a 52-year-old man who presented with a contralesional fourth-nerve palsy and primary-position upbeat-torsional nystagmus due to a small unilateral dorsal pontomesencephalic lymphomatous deposit. It is postulated that the upbeat-torsional nystagmus was caused by involvement of the brachium conjunctivum, which lies adjacent to the fourth-nerve fascicles at the dorsal pontomesencephalic junction, but involvement of the crossing ventral tegmental tract cannot be excluded. These observations suggest that, in humans, excitatory upward-torsional eye movement signals from the anterior semicircular canals could be partly conveyed to the midbrain by the brachium conjunctivum.

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

torsional nystagmus
fourth-nerve palsy
pons
mesencephalon


Control of an automotive shape memory alloy mirror actuator Automobile designers are continuously trying to improve the safety and comfort of new car models In many cases this translates to the need for less expensive and compact actuators. There are many features that are commonly found in cars that utilize electromechanical type actuators. Power mirrors are one such application that has been becoming more and more standard on cars today. A cost effective mirror actuator was designed and built that utilizes shape memory alloy (SMA) wires to position the external side mirrors. This paper present a second generation SMA-actuated mirror. A robust control algorithm is developed for the mirror to provide stable and accurate positioning. This variable structure controller provides accurate positioning without adding unnecessary complexity to the computational requirements for the mirror. Experimental results are compiled to show the tracking response of the SMA mirror actuator (C) 2010 Elsevier Ltd. All rights reserved

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


Learning styles and cognitive traits Their relationship and its benefits in web-based educational systems Different learners have different needs; they differ, for example, in their learning goals, their prior knowledge, their learning styles, and their cognitive abilities. Adaptive web-based educational systems aim to cater individual learners by customizing courses to suit their needs. In this paper, we investigate the benefits of incorporating learning styles and cognitive traits in web-based educational systems. Adaptivity aspects based on cognitive traits and learning styles enrich each other, enabling systems to provide learners with courses which fit their needs more accurately. Furthermore, consideration of learning styles and cognitive traits can contribute to more accurate student modelling. In this paper, the relationship between learning styles, in particular the FelderSilverman learning style model (FSLSM), and working memory capacity, a cognitive trait, is investigated. For adaptive educational systems that consider either only learning styles or only cognitive traits, the additional information can be used to provide more holistic adaptivity. For systems that already incorporate both learning styles and cognitive traits, the relationship can be used to improve the detection process of both by including the additional information of learning style into the detection process of cognitive traits and vice versa. This leads to a more reliable student model.

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

adaptivity
cognitive traits
learning styles
feldersilverman learning style model
student modelling
working memory capacity


Region-adaptive image restoration using wavelet denoising technique Space-variant approaches subject to local image characteristics are useful in practical image restoration because many natural images are nonstationary. Motivated by the success of denoising approaches in the wavelet domain, we propose a region-adaptive restoration approach which adopts a wavelet denoising technique in fiat regions after an under-regularized constrained least squares restoration. Experimental results verify that this approach not only improves image quality in mean square error but also contributes to ringing reduction.

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

image restoration
constrained least squares
wavelet denoising


Terrain surface classification with a control mode update rule using a 2D laser stripe-based structured light sensor It is necessary for autonomous ground vehicles operating on outdoor terrains to identify and adapt to different terrains in order to improve their mobility and safety. This work presents a classification scheme to identify outdoor terrains and an update rule to reduce the possibility of implementing control modes based on classification inaccuracies. A laser stripe-based structured light sensor, which has a laser and infrared camera component, is used to sense terrains directly in front of the vehicle ( < 1 m ). Use of this infrared vision system allows sensing at night, without external lighting, unlike many previous vision-based approaches that rely on stand-alone cameras. Also, unlike many previous results, the classification algorithm presented here does not rely on measures of color, which are subject to illumination and weather conditions. Instead, the method presented here relies on spatial relationships which are captured in two quantities: spatial frequency from range data and texture from camera data. The presented terrain classification scheme uses a probabilistic neural network classifier to exploit the spatial differences in four terrains: asphalt, grass, gravel and sand. This approach yields empirical results that report a greater than 97% classification accuracy when both spatial frequency and texture features are used. Color robustness and lighting robustness is then shown through additional experiments. Furthermore, instead of implementing control modes directly from the identified terrains, it is shown that the use of current and past terrain detections allows for the rejection of misclassifications with minimal effect on the rate at which a new control mode can be implemented.

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

terrain-dependent control
computer vision


Mining the interests of Chinese microbloggers via keyword extraction Microblogging provides a new platform for communicating and sharing information among Web users. Users can express opinions and record daily life using microblogs. Microblogs that are posted by users indicate their interests to some extent. We aim to mine user interests via keyword extraction from microblogs. Traditional keyword extraction methods are usually designed for formal documents such as news articles or scientific papers. Messages posted by microblogging users, however, are usually noisy and full of new words, which is a challenge for keyword extraction. In this paper, we combine a translation-based method with a frequency-based method for keyword extraction. In our experiments, we extract keywords for microblog users from the largest microblogging website in China, Sina Weibo. The results show that our method can identify users' interests accurately and efficiently.

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


Improving Asynchronous Motor Speed and Flux Loop Control by Using Hybrid Fuzzy-SMC Controllers This paper presents a new method combining sliding mode control (SMC) and fuzzy logic control (FLC) to enhance the robustness and performance for a class of non-linear control systems. This fuzzy sliding mode control (FSMC) is developed for application in the area for controlling the speed and flux loops of asynchronous motors. The proposed control law can solve those problems associated with the conventional control by sliding mode control, such as high current, flux and torque chattering, variable switching frequency and variation of parameters, in which a robust fuzzy logic controller replaces the discontinuous part of the classical sliding mode control law. Simulation results of the proposed FSMC technique on the speed and flux rotor controllers present good dynamic and steady-state performances compared to the classical SMC in terms of reduction of the torque chattering, quick dynamic torque response and robustness to disturbance and variation of parameters.

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

sliding mode control
fuzzy logic control

induction motor
fuzzy sliding mode control
chattering phenomenon


CT findings of abdominal tuberculosis in 12 patients Our purpose was to evaluate the Computed Tomography (CT) findings of the abdominal tuberculosis (TBC) retrospectively which was diagnosed histopatologically. This study included 12 patients. All patients were evaluated by abdominal CT study. Most findings of CT studies were mesenteric calcified or noncalcified lymphadenopathies, ascites, thickened intestinal wall located on the right lower quadrant of abdomen, thickening of peritoneum, mottled soft-tissue densities in omentum and mesenterium. In addition, one of the patients had bilateral calcified adrenal glands and one of them had calcified mass in adrenal gland. If peritoneal thickening, ascites, abdominal lymphadenophaties and thickened intestinal walls are obtained, TBC should be considered in differential diagnosis in developing countries.

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

abdominal tuberculosis
lymph node
peritoneal tuberculosis


Purification of entangled coherent states We suggest an entanglement purification scheme for mixed entangled coherent states using 50-50 beam splitters and photodetectors. This scheme is directly applicable for mixed entangled coherent states of the Werner type, and can be useful for general mixed states using additional nonlinear interactions. We apply our scheme to entangled coherent states decohered in a vacuum environment and find the decay time until which they can be purified.

B 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

entangled coherent state
quantum information


enabling adaptive time-based web applications with smil state In this paper we examine adaptive time-based web applications (or presentations). These are interactive presentations where time dictates the major structure, and that require interactivity and other dynamic adaptation. We investigate the current technologies available to create such presentations and their shortcomings, and suggest a mechanism for addressing these shortcomings. This mechanism, SMIL State, can be used to add user-defined state to declarative time-based languages such as SMIL or SVG animation, thereby enabling the author to create control flows that are difficult to realize within the temporal containment model of the host languages. In addition, SMIL State can be used as a bridging mechanism between languages, enabling easy integration of external components into the web application.

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

multimedia web applications
delayed ad viewing
declarative languages


J &: Nested intersection for scalable software composition This paper introduces a programming language that makes it convenient to compose large software systems, combining their features in a modular way. J& supports nested intersection, building on earlier work on nested inheritance in the language Jx. Nested inheritance permits modular, type-safe extension of a package (including nested packages and classes), while preserving existing type relationships. Nested intersection enables composition and extension of two or more packages, combining their types and behavior while resolving conflicts with a relatively small amount of code. The utility of J& is demonstrated by using it to construct two composable, extensible frameworks: a compiler framework for Java, and a peer-to-peer networking system. Both frameworks support composition of extensions. For example, two compilers adding different, domain-specific features to Java can be composed to obtain a compiler for a language that supports both sets of features.

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

nested intersection
nested inheritance
compilers


managing deviant behavior in online communities Wherever groups of people gather, norms for appropriate behavior emerge, and some people chose to violate those norms. What is an exercise of free speech to one person, to another is disruptive, harassing, racist, or worse. For groups that communicate online, a range of technical and social mechanisms are available to help create a climate conducive to meeting the group's stated mission. How do designers of online systems decide what kind of conduct is acceptable? How are these expectations communicated to members? How can designers help prevent and manage deviant behavior? What are the implications of corporate control of content for ideals of free expression? This panel brings together experts from media theory, computer-supported collaborative learning (CSCL), computer-supported cooperative work (CSCW), and online entertainment to explore current issues in this complex research area.

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

deviant behavior
norms
online communities

community standards
socio-technical systems


User perspectives in public transport timetable optimisation We reduce passengers transfer waiting time by changing the departure time of buses. We explicitly derive passengers transfer patterns to obtain accurate passenger weights in the timetable optimisation. We demonstrate the feasibility of the proposed approach on a large-scale transit network. We yielded a yearly reduction in weighted waiting time equivalent to approximately 45 million DKK (9 million Dollars).

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

bus timetabling
public transport optimisation
passenger behaviour
large-scale application


Statistical insight into controlled forming and forming free stacks for HfOx RRAM Percolation model used to optimize oxide and cap thickness for forming-free RRAM. Hot forming helps reduce variability in the forming voltage statistics. Quantum point contact formulation has been used to explain hot forming. Forming is two-stage process involving filament nucleation (SBD) and growth (PBD). Convolution of filament nucleation and growth gives non-Weibullian statistics.

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

forming
percolation model
quantum point contact

progressive breakdown
resistive switching
soft breakdown


Charge-recovery computing on silicon Three decades ago, theoretical physicists suggested that the controlled recovery of charges could result in electronic circuitry whose power dissipation approaches thermodynamic limits, growing at a significantly slower pace than the fCV(2) rate for CMOS switching power. Early engineering research in this field, which became generally known as adiabatic computing, focused on the asymptotic energetics of computation, exploring VLSI designs that use reversible logic and adiabatic switching to preserve information and achieve nearly zero power dissipation as operating frequencies approach zero. Recent advances in CMOS VLSI design have taken us to real working chips that rely on controlled charge recovery to operate at substantially lower power dissipation levels than their conventional counterparts. Although their origins can be traced back to the early adiabatic circuits, these chargere-covering systems approach energy recycling from a more practical angle, shedding reversibility to achieve operating frequencies in the hundreds of MHz with relatively low overhead. Among other charge-recovery designs, researchers have demonstrated micro-controllers, standard-cell ASICs, SRAMs, LCD panel drivers, I/O drivers, and multi-GHz clock networks. In this paper, we present an overview of the field and focus on two chip designs that highlight some of the promising charge recovering techniques in practice.

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

energy-recovering circuits
resonant systems
energy efficient computing
voltage scaling


How slow is Shannon?s reconstruction for bandlimited signals? Shannon?s sampling theorem is fundamental in signal processing. It provides the exact reconstruction of a bandlimited signal from its samples at the Nyquist rate by the cardinal series. But this reconstruction formula is not applied widely in practice because of its slow convergence. It is of theoretical interests to find out how slow the convergence of this reconstruction could be. In this work, the convergence rate of Shannon?s reconstruction is studied by the theory on the slow convergence of operator sequences. It is proved that the Shannon?s reconstruction consists of a sequence of arbitrarily slow convergent operators. Specifically, for any positive sequence ?(n)?0 ? ( n ) ? 0 , there exists a bandlimited signal f such that the n -th truncation error of its cardinal series is larger than ?(n) ? ( n ) for all n, where the truncation errors are measured in Lp norms, for 1<p<? 1 < p < ? . It is also shown that the acceleration techniques by over-sampling and convergence factor do not resolve the slowness too much, which only change the convergence rate from arbitrarily slow to almost arbitrarily slow.

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

shannon?s sampling theorem
arbitrarily slow convergence
almost arbitrarily slow convergence


Generalized analysis of MU-MISO time reversal-based systems over correlated multipath channels with estimation error In this letter, we analyze the performance of multi-user multiple-input single-output time reversal (MU MISO TR)-based systems in a generalized framework. The considered propagation is correlated in both the space and the frequency domains, and channel estimation errors (CEEs) at the transmitter side are also taken into account. We derive a novel average signal-to-interference-plus-noise (SINR) formula in closed-form for TR-based systems. This formula is based on the exact expressions of the expectations of the powers of the desired signal, the inter-symbol interference (ISI) and the inter-user interference (IUI) components. These expressions allow us to reveal, for the first time, properties of time reversal which remained unknown up to now. More precisely, CEE has no influence on the ISI in terms of average power, whereas it degrades the power of the desired message-bearing signal. Moreover, irrespective of the central tap, the other taps of the IUI are independent from the effects of both inter-user correlation and CEE. Our analytical results are validated in both ultra-wideband and conventional broadband channels. Finally, these results are numerically compared to previous works.

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

time reversal
broadband
sinr
correlation


Offsetting inventory cycles of items sharing storage The ability to determine the optimal frequencies and offsets for independent and unrestricted ordering cycles for multiple items can be very valuable for managing storage capacity constrained facilities in a supply chain. The complexity of this problem has resulted in researchers focusing on more tractable surrogate problems that are special cases of the base problem. This research has focused on developing fundamental properties of the original problem. We exploit the problem structure and present a heuristic for offsetting independent and unrestricted ordering cycles for items to minimize their joint storage requirements. Heuristics of this type may prove useful in solving the more general problem of selecting order quantities to minimize combined holding, ordering, and storage costs.

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

shared capacity
offsetting cycles
modeling


Weighted Fuzzy Interpolative Reasoning Based on Weighted Increment Transformation and Weighted Ratio Transformation Techniques In this paper, we present a new weighted fuzzy interpolative reasoning method for sparse fuzzy rule-based systems. The proposed method uses weighted increment transformation and weighted ratio transformation techniques to handle weighted fuzzy interpolative reasoning in sparse fuzzy rule-based systems. It allows each variable that appears in the antecedent parts of fuzzy rules to associate with a weight between zero and one. Moreover, we also propose an algorithm that automatically tunes the optimal weights of the antecedent variables appearing in the antecedent parts of fuzzy rules. We also apply the proposed weighted fuzzy interpolative reasoning method to handle the truck backer-upper control problem. The proposed weighted fuzzy interpolative reasoning method performs better than the ones obtained by the traditional fuzzy inference system (2000), Huang and Shen's method (2008), and Chen and Ko's method (2008). The proposed method provides us with a useful way to deal with weighted fuzzy interpolative reasoning in sparse fuzzy rule-based systems.

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

transformation techniques
weighted fuzzy interpolative reasoning
weighted increment transformation

alpha-cuts
sparse fuzzy rule-based systems
weighted ratio transformation


Utilization-based admission control for aperiodic tasks under EDF scheduling Utilization-based admission control policies for processors executing aperiodic tasks are often favored due to their low overhead. This paper investigates utilization-based admission control for uniprocessor systems executing aperiodic tasks following the earliest deadline first priority assignment. We first propose a new constant time utilization-based admission control policy, CTAC. We prove that CTAC is safe and will admit any task instance that can be admitted by the best existing utilization-based admission control policy, ASL, given the same processor state. We also introduce an optimal utilization-based admission control policy, OPAC. It is proved that given the same processor state, a newly arriving task instance that can be admitted by any other safe utilization-based admission control policy can also be admitted by OPAC. We also show that OPAC cannot be implemented in constant time. Simulation results show that CTAC indeed outperforms ASL with constant time complexity and achieves performance close to OPAC in terms of various metrics.

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


Parallel Dynamic Cloud Rendering Method Based on Physical Cellular Automata Model Due to the complicated composition of cloud and its disordered transformation, the rendering of cloud does not perfectly meet actual prospect by current methods. Based on physical characteristics of cloud, a physical cellular automata model of Dynamic cloud is designed according to intrinsic factor of cloud, which describes the rules of hydro-movement, deposition and accumulation and diffusion. Then a parallel computing architecture is designed to compute the large-scale data set required by the rendering of dynamical cloud, and a GPU-based ray-casting algorithm is implemented to render the cloud volume data. The experiment shows that cloud rendering method based on physical cellular automata model is very efficient and able to adequately exhibit the detail of cloud.

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


Genetic algorithm optimization of a planar slot array using full wave method-of-moments analysis Waveguide-fed slot arrays in standing wave mode have been employed successfully in space based remote sensing radars because of their high efficiency, ease of deployment and their ability to withstand the radiation environment. Although the bandwidth requirement in such systems is minimal, at Ka band and above manufacturing tolerances in the order of 1 mil (25 ?m), achieved in the dip brazing process, may affect their performance. To produce designs that are less sensitive to manufacturing tolerance, genetic algorithm (GA) optimization is employed in conjunction with a full wave analysis utilizing the method-of-moments solution to the pertinent integral equations of slot apertures of a planar array. In this work, a single 8 10 sub-array of an interferometric antenna, proposed previously for a planetary mapping application, was investigated. The array was first designed by the Elliott's procedure and subsequently the design parameters were perturbed by GA optimization using the moment method analysis. The fitness parameter is a weighted function of return loss and gain over a number of frequencies in the operating band. A matching waveguide section consisting of inductive irises is also optimized using GA and mode matching technique. Optimum designs producing nearly constant gain and good return loss over 6% bandwidth are found to be less sensitive to manufacturing tolerance than the initial Elliott design. 2013 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2013.

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

genetic algorithms
method-of-moments
global optimization


Brainstorming: weighted voting prediction of inhibitors for protein targets The "Brainstorming" approach presented in this paper is a weighted voting method that can improve the quality of predictions generated by several machine learning (ML) methods. First, an ensemble of heterogeneous ML algorithms is trained on available experimental data, then all solutions are gathered and a consensus is built between them. The final prediction is performed using a voting procedure, whereby the vote of each method is weighted according to a quality coefficient calculated using multivariable linear regression (MLR). The MLR optimization procedure is very fast, therefore no additional computational cost is introduced by using this jury approach. Here, brainstorming is applied to selecting actives from large collections of compounds relating to five diverse biological targets of medicinal interest, namely HIV-reverse transcriptase, cyclooxygenase-2, dihydrofolate reductase, estrogen receptor, and thrombin. The MDL Drug Data Report (MDDR) database was used for selecting known inhibitors for these protein targets, and experimental data was then used to train a set of machine learning methods. The benchmark dataset (available at http://bio.icm.edu.pl/similar to darman/chemoinfo/benchmark.tar.gz) can be used for further testing of various clustering and machine learning methods when predicting the biological activity of compounds. Depending on the protein target, the overall recall value is raised by at least 20% in comparison to any single machine learning method (including ensemble methods like random forest) and unweighted simple majority voting procedures.

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

ligand classification
protein target specificity
machine-learning
support vector machine


finding low-entropy sets and trees from binary data The discovery of subsets with special properties from binary data hasbeen one of the key themes in pattern discovery. Pattern classes suchas frequent itemsets stress the co-occurrence of the value 1 in the data. While this choice makes sense in the context of sparse binary data, it disregards potentially interesting subsets of attributes that have some other type of dependency structure. We consider the problem of finding all subsets of attributes that have low complexity. The complexity is measured by either the entropy of the projection of the data on the subset, or the entropy of the data for the subset when modeled using a Bayesian tree, with downward or upward pointing edges. We show that the entropy measure on sets has a monotonicity property, and thus a levelwise approach can find all low-entropy itemsets. We also show that the tree-based measures are bounded above by the entropy of the corresponding itemset, allowing similar algorithms to be used for finding low-entropy trees. We describe algorithms for finding all subsets satisfying an entropy condition. We give an extensive empirical evaluation of the performance of the methods both on synthetic and on real data. We also discuss the search for high-entropy subsets and the computation of the Vapnik-Chervonenkis dimension of the data.

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


exception analysis for non-strict languages In this paper we present the first exception analysis for a non-strict language. We augment a simply-typed functional language with exceptions, and show that we can define a type-based inference system to detect uncaught exceptions. We have implemented this exception analysis in the GHC compiler for Haskell, which has been recently extended with exceptions. We give empirical evidence that the analysis is practical.

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

haskell inference analysis language exceptions evidence paper practical

boolean constraints
systems
type inference
compilation
effect systems
functional languages


Dominance-based multiobjective simulated annealing Simulated annealing is a provably convergent optimizer for single-objective problems. Previously proposed multiobjective extensions have mostly taken the form of a single-objective simulated annealer optimizing a composite function of the objectives. We propose a multiobjective simulated annealer utilizing the relative dominance of a solution as the system energy for optimization, eliminating problems associated with composite objective functions. We also propose a method for choosing perturbation scalings promoting search both towards and across the Pareto front. We illustrate the simulated annealer's performance on a suite of standard test problems and provide comparisons with another multiobjective simulated annealer and the NSGA-II genetic algorithm. The new simulated annealer is shown to promote rapid convergence to the true Pareto front with a good coverage of solutions across it comparing favorably with the other algorithms. An application of the simulated annealer to an industrial problem, the optimization of a code-division-multiple access (CDMA) mobile telecommunications network's air interface, is presented and the simulated annealer is shown to generate nondominated solutions with an even and dense coverage that outperforms single objective genetic algorithm optimizers.

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

code-division multiple-access (cdma) networks


Scientific publications of engineers in South Africa, 1975-2005 In the production of scientific knowledge, as revealed by publication output, South Africa is at the forefront of many other countries in the developing world and in the African continent. This study examines for the first time the publication trends of South African engineering researchers for a period of 30 years since 1975. Drawing data from the ISI Web of Knowledge, this paper specifically looks at the publication patterns of engineering researchers in South Africa.

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


Filament diffusion model for simulating reset and retention processes in RRAM Resistive switching memory (RRAM) devices are attracting an increasing interest as a possible future technology for ultra-scaled, high-density nonvolatile/dynamic memory. Although the RRAM concept is promising from the integration and scaling viewpoints, the switching mechanism and its controllability are still under debate. This paper addresses the modeling of reset and retention processes in unipolar resistive-switching memory devices. Reset transition and data loss are described in terms of the dissolution of a conductive filament, which is modeled by thermally-activated diffusion of defects/dopants. Carrier transport, Joule heating and diffusion of oxygen ions/vacancies during the electrical pulse and/or the annealing are modeled within a 3D numerical solver. The model can account for the observed dependence of reset voltage on the width of the applied triangular pulse and on the initial resistance for NiO-based RRAM devices. Retention simulations as a function of annealing temperature also agree with available data. The model provides a first example of device simulation tool for the design and the exploration of scaling and performance of RRAM cells.

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

electro-thermal modeling
non-volatile memories
resistive-switching memory (rram)
percolation conduction


Solving bicriteria 01 knapsack problems using a labeling algorithm This paper examines the performances of a new labeling algorithm to find all the efficient paths (or non-dominated evaluation vectors) of the bicriteria 01 knapsack problem. To our knowledge this is the first time a bicriteria 01 knapsack is solved taking advantage of its previous conversion into a bicriteria shortest path problem over an acyclic network. Computational experiments and results are also presented regarding bicriteria instances of up to 900 items. The algorithm is very efficient for the hard bicriteria 01 knapsack instances considered in the paper. Scope and purpose The knapsack problem is a well-known combinatorial optimization problem. While most of the existing papers in the literature studied the single criterion model, this paper deals with the knapsack problem with two criteria. Literature on this topic is scarce. There is a growing need for new algorithms able to compute non-dominated solutions quickly. The motivation of this study was to explore the use of efficient labeling algorithms to obtain non-dominated solutions of combinatorial optimization problems that can be formulated as network models. The purpose of the article is to implement a new algorithm for the bicriteria 01 knapsack problem. After converting the knapsack model into a bicriteria path problem over an acyclic network, the methodology proposes the use of a very efficient labeling algorithm. The scope of applications of the algorithm includes capital budgeting problems, transportation investments, and so on. The major advantage of our approach is to compute non-dominated solutions for bicriteria 01 knapsack problems faster than other approaches as shown by the computational 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 B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

bicriteria shortest path problem
labeling algorithms


Cache-Oblivious parallel SIMD Viterbi decoding for sequence search in HMMER HMMER is a commonly used bioinformatics tool based on Hidden Markov Models (HMMs) to analyze and process biological sequences. One of its main homology engines is based on the Viterbi decoding algorithm, which was already highly parallelized and optimized using Farrars striped processing pattern with Intel SSE2 instruction set extension.

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

sequences alignment
hidden markov model
parallelization
streaming simd extensions (sse)


Talking design: negotiating the verbalvisual translation Design is commonly regarded as an act of individual creation to which both verbalisation and logical analysis are only peripherally relevant. Based on interview data from a graphic design consultancy, this paper develops an alternative view of design, in which the outputs of individual creativity are progressively negotiated to a mutually satisfactory outcome, first with other designers and subsequently with the client. In this process the ability to articulate verbal meanings associated with visual design, and conversely, to interpret verbal messages in visual terms is a core skill. Viewed in this light, the whole of the design process is directed towards the achievement of a mutually acceptable visual `translation' of the brief, and it is achieved through the medium of lesser translations from the verbal to the visual and back again.

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

communication
verbal/visual translation
case study


a low-power 12-bit 80mhz cmos dac using pseudo-segmentation This paper describes the design of a low-power 12-bit CMOS DAC using pseudo-segmentation technique. Pseudo-segmentation used in binary decoder consists of simple parallel buffers for low power because of simpler configuration than that of thermometer decoder. The measurement results show the conversion rate of 80MHz and the power dissipation of 46.8mW at single supply voltage of 1.8V. 1.6LSB / 1.2LSB of INL and DNL have been measured for linearity. The ENOB and SFDR of the proposed 12bit DAC were measured to be 10.67 bit and 66.01dBc @ Fs=80MHz, Fin=1MHz, respectively. Glitch energy was measured to be 49 pV"s.

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

pseudo-segmentation
swing reduced driver


Empirical Comparison of 3-D Virtual World and Face-to-Face Classroom for Higher Education Many higher education institutions have set up virtual classrooms in the 3-D virtual world. In this research, the authors assess the relative effectiveness of a 3-D virtual world learning environment, Second Life, compared to traditional face-to-face learning environment. They also assess the effects of instructional strategies in these two learning environments on interactivity, perceived learning, and satisfaction. The authors' findings suggest that learning environment interacts with instructional strategy to affect the learners' perceived learning and satisfaction. Specifically, when interactive instructional strategy is used, there is no significant difference for perceived learning and satisfaction between the 3-D virtual world and face-to-face learning environment. However, when a direct instructional strategy is used, there is a significant difference for perceived learning and satisfaction. They also assessed whether or not technology helps increase learner and instructor interaction. The result suggests that in interactive instructional sessions, students experienced a higher level of classroom interactivity in Second Life than in face-to-face classroom.

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

classroom interactivity
instructional strategies
perceived learning
second life

3-d virtual world
perceived ease of use
perceived usefulness
social presence


Quantum homomorphic signature Quantum signature is an effective approach to identity authentication for single stream in quantum networks, but it is constrained in the crossing case of multiple streams. To solve this problem, we present a quantum homomorphic signature scheme to enhance the security of quantum networks. By entanglement swapping, this scheme can combine two quantum signatures and generate a new homomorphic signature. Analysis results show that the proposed signature scheme can effectively guarantee the security of secret key and verify the identity of different data sources in a quantum network.

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

quantum signature
homomorphic signature
entanglement swapping
quantum network
multiple streams


using markov chain analysis to study dynamic behaviour in large-scale grid systems In large-scale grid systems with decentralized control, the interactions of many service providers and consumers will likely lead to emergent global system behaviours that result in unpredictable, often detrimental, outcomes. This possibility argues for developing analytical tools to allow understanding, and prediction, of complex system behaviour in order to ensure availability and reliability of grid computing services. This paper presents an approach for using piece-wise homogeneous Discrete Time Markov chains to provide rapid, potentially scalable, simulation of large-scale grid systems. This approach, previously used in other domains, is used here to model dynamics of large-scale grid systems. In this approach, a Markov chain model of a grid system is first represented in a reduced, compact form. This model can then be perturbed to produce alternative system execution paths and identify scenarios in which system performance is likely to degrade or anomalous behaviours occur. The expeditious generation of these scenarios allows prediction of how a larger system will react to failures or high stress conditions. Though computational effort increases in proportion to the number of paths modelled, this cost is shown to be far less than the cost of using detailed simulation or testbeds. Moreover, cost is unaffected by size of system being modelled, expressed in terms of workload and number of computational resources, and is adaptable to systems that are non-homogenous with respect to time. The paper provides detailed examples of the application of this approach.

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

perturbation analysis
discrete markov chain
piece-wise homogenous markov chain


Simulation of vertical merged MOS elements with optical power supply Functional optoelectronic vertical merged MOS (OVMMOS) elements with optical power supply increasing the packaging density for advanced high-speed low-voltage low-power deep-submicron ULSI are considered. Two types of new OVVMOS logical elements are proposed, analyzed and simulated. The simple reduced but adequate numerical electricaloptical model for the OVMMOS is formulated. Low-voltage low-power OVMMOS with combined channels for electrons and holes to increase integration level are simulated using two-dimensional (2D)-numerical device simulators. The problems of low light power operations and optimizations of OVMMOS elements are investigated using 2D simulators.

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

optical power supply
electricaloptical model


a mathematical toolbox for the software architec It is suggested that Category Theory provides the right level of mathematical abstraction to address languages for describing software architectures. Contrarily to most other formalisations of SA concepts, Category Theory does not promote any particular formalism for component and connector description but provides instead the very semantics of the concepts that are related to the gross modularisation of complex systems like "interconnection", "configuration", "instantiation" and "composition". Two examples, a category of programs for a parallel program design language and a category of temporal logic specifications, together with comparisons with other work, namely by Allen and Garlan, and Moriconi and Qian, are adduced to justify this claim.

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

program
software
examples
abstraction
formalism
language
design
complex systems
theory
temporal
logic
connector
component

software architecture
semantic
parallel programming
concept
addressing
configurability
interconnect
compositing


Contextual hidden Markov tree model for signal denoising The hidden Markov tree (HMT) model is a novel statistical model for signal and image processing in the wavelet domain. The HMT model captures the interscale persistence property of wavelet coefficients, but includes only a tiny intrascale clustering property of wavelet coefficients. In this paper, we propose the contextual hidden Markov tree (CHMT) model to enhance the clustering property of the HMT model by adding extended coefficients associated with the wavelet coefficients. The extended coefficients are regarded as leaves to link wavelet coefficients in the wavelet tree model without destroying the wavelet persistence property; hence, the training approach of the HMT model can be modified to estimate the parameters of the CHMT model. In experiments, the proposed CHMT model produced better results than the HMT model for signal denoising. Furthermore, the CHMT model needs fewer iterations of training than the HMT model to get the same denoised results.

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

hidden markov tree model
signal denoising

contextual analysis
hidden markov model
wavelet transform


Active Filter-Based Hybrid On-Chip DC-DC Converter for Point-of-Load Voltage Regulation An active filter-based on-chip DC-DC voltage converter for application to distributed on-chip power supplies in multivoltage systems is described in this paper. No inductor or output capacitor is required in the proposed converter. The area of the voltage converter is therefore significantly less than that of a conventional low-dropout (LDO) regulator. Hence, the proposed circuit is appropriate for point-of-load voltage regulation for noise sensitive portions of an integrated circuit. The performance of the circuit has been verified with Cadence Spectre simulations and fabricated with a commercial 110 nm complimentary metal oxide semiconductor (CMOS) technology. The area of the voltage regulator is 0.015 mm(2) and delivers up to 80 mA of output current. The transient response with no output capacitor ranges from 72 to 192 ns. The parameter sensitivity of the active filter is also described. The advantages and disadvantages of the active filter-based, conventional switching, linear, and switched capacitor voltage converters are compared. The proposed circuit is an alternative to classical LDO voltage regulators, providing a means for distributing multiple local power supplies across an integrated circuit while maintaining high current efficiency and fast response time within a small area.

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

hybrid regulator
low-dropout regulator
on-chip voltage regulation
point-of-load voltage regulation


testing the correctness of tasking supervisors with tsl specifications This paper describes the application of behavior specifications to the testing of tasking supervisors , an important component of an implementation of a concurrent programming language. The goal of such testing is to determine whether or not a tasking supervisor correctly implements the semantics of its associated language. We have tested a distributed tasking supervisor for the Ada programming language by monitoring the execution behavior of Ada tasking programs that have been compiled and linked with the supervisor. This behavior is checked for consistency with an event-based formalization of the Ada tasking semantics expressed in the TSL specification language. The TSL Runtime System automatically performs all monitoring and consistency checking at runtime. Our approach improves upon other approaches to testing tasking supervisors, particularly the Ada Compiler Validation Capability (ACVC), and also an approach described by Klarund. In contrast with these other approaches, in our approach (1) we test only the behavior of the tasking supervisor, not the behavior of the test programs; and (2) any Ada tasking program may be employed as test data, because the TSL specifications we construct describe the semantics of Ada language statements, not the semantics of application programs.

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

runtime system
program
test
specification language
behavior
language
correctness
implementation
data
consistency
distributed
paper
runtime
component

task
applications
concurrent program
formalism
semantic
event
association
compilation
monitor
programming language


Evaluating ontology extraction tools using a comprehensive evaluation framework Ontologies are a key component of the Semantic Web; thus, they are widely used in various applications. However, most ontologies are still built manually, a time-consuming activity which requires many resources. Several tools such as ontology editing tools, ontology merging tools, and ontology extraction tools have therefore been proposed to speed up ontology development. To minimize building time, one promising solution is the automation of the ontology development process. Consequently, the need for an automatic ontology extraction tool has increased in the last two decades and many tools have been developed for this purpose. However, there is still no comprehensive framework for evaluating such tools. In this paper, we proposed a set of criteria for evaluating ontology extraction tools and carried out an evaluation experiment on four ontology extraction tools (i.e., OntoLT, Text2Onto, OntoBuilder, and DODDLE-OWL) using our proposed evaluation framework. Based on the results of our experiment, we concluded that ontology extraction tools still lack the ability to automate the extraction process fully and thus require functional performance improvement.

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

ontology extraction tool
tool evaluation


Prediction of industrial, biophysical and extreme geophysical flows using particle methods Purpose - The purpose of this paper is to show how simulation of the flow of particulates and fluids using discrete element modelling (DEM) and smoothed particle dynamics (SPH) particle methods, offer opportunities for better understanding the dynamics of flow processes. Design/methodology/approach - DEM and SPH methods are demonstrated in a broad range of computationally-demanding applications including comminution, biomedical, geophysical extreme flow events (risk/disaster modelling), eating of food by humans and elite water-based sports. Findings - DEM is ideally suited to predicting industrial and geophysical applications where collisions between particles are the dominant physics. SPH is highly suited to multi-physics fluid flow applications in industrial, biophysical and geophysical applications. The advantages and disadvantages of these particle methods are discussed. Research limitations/implications - Research results are limited by the numerical resolution that can currently be afforded. Practical implications - The paper demonstrates the use of particle-based computational methods in a series of high value applications. Enterprises that share interests in these applications will benefit in their product and service development by adopting these methods. Social implications - The ability to model disasters provides governments and companies with the opportunity and obligation to use these to render knowable disasters which were previously considered unknowable. The ability to predict the breakdown of food during eating opens up opportunities for the design of superior performing foods with lower salt, sugar and fat that can directly contribute to improved health outcomes and can influence government food regulatory policy. Originality/value - The paper extends the scale and range of modelling of particle methods for demanding leading-edge problems, of practical interest in engineering and applied sciences.

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

smoothed particle hydrodynamics
discrete element method
industrial flows
biophysical flows


Sensing under uncertainty for mobile robots In this work we present a control strategy under uncertainty for mobile robot navigation. In particular, we implement a server-client model, where the server executes the commands and the clients run in parallel, each performing its tasks. Tolerance analysis is performed to incorporate sensing uncertainties into the proposed model. The sensory system is depicted with a framework that allows different levels of data representation, based on the robust modeling of the sensing uncertainties.

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

uncertainty modeling
distributed control


efficient register and memory assignment for non-orthogonal architectures via graph coloring and mst algorithms Finding an optimal assignment of program variables into registers and memory is prohibitively difficult in code generation for application specific instruction-set processors (ASIPs). This is mainly because, in order to meet stringent speed and power requirements for embedded applications, ASIPs commonly employ non-orthogonal architectures which are typically characterized by irregular data paths, heterogeneous registers and multiple memory banks. As a result, existing techniques mainly developed for relatively regular, orthogonal general-purpose processors (GPPs) are obsolete for these recently emerging ASIP architectures. In this paper, we attempt to tackle this issue by exploiting conventional graph coloring and maximum spanning tree (MST) algorithms with special constraints added to handle the non-orthogonality of ASIP architectures. The results in our study indicate that our algorithm finds a fairly good assignment of variables into heterogeneous registers and multi-memories while it runs extremely faster than previous work that employed exceedingly expensive algorithms to address this issue.

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

maximum spanning tree
graph coloring
memory assignment

non-orthogonal architecture
compiler
dual memory


Recommending software upgrades with Mojave ? We characterize 96 bug reports spanning 5 versions of OpenSSH. The results show that 41% of the bugs were due to upgrades. In addition, we find that the majority of the bugs are caused by both the user's environment and input. We propose Mojave, the first recommendation system for software upgrades. Mojave leverages data from the existing and new users, machine learning, and static and dynamic source analyses to recommend for or against an upgrade to new users. We evaluate Mojave for 5 upgrade problems with 3 widely used applications. Across all our experiments, Mojave accurately predicts the upgrade failure for 93100% of the users.

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

manageability
recommendation systems
static analysis
dynamic analysis


design space exploration of the turbo decoding algorithm on gpus In this paper, we explore the design space of the Turbo decoding algorithm on GPUs and find a performance bottleneck. We consider three axes for the design space exploration: a radix degree, a parallelization method, and the number of sub-frames per thread block. In Turbo decoding, a degree of radix affects computational complexity and memory access patterns in both algorithmic and implementation viewpoints. Second, computations of branch metrics (BMs) and state metrics (SMs) have a different degree of parallelism, which affects the mapping method of computational tasks to GPU threads. Finally, we can easily adjust the number of sub-frames per thread block to balance the occupancy and memory access traffic. Experimental results show that the radix-4 algorithm with the SM-centric mapping method shows the best performance at four sub-frames per thread block. According to our analysis, two factors -- the occupancy and shared memory bank conflicts -- differentiate the performance of different cases in the design space. We show further performance improvements by optimizing a kernel operation (max*) and applying the MAX-Log-Maximum A Posteriori (MAP) algorithm. A performance bottleneck at the finally optimized case is global memory access latency. Since the most optimized performance is comparable to that of the other programmable platforms, the GPU can be considered as another type of coprocessor for Turbo decoding implementations in mobile devices.

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

design space exploration
gpu
turbo decoding


A temporal network analysis reveals the unprofitability of arbitrage in The Prosper Marketplace There is an increasing focus on methods for network data analysis that consider temporal aspects of the data. We propose a method of network analysis based on the idea of a time-respecting subgraph composed of paths of consecutive edge activations. We present an algorithm to identify these structures and apply the algorithm to a network comprising data from The Prosper Marketplace, an online peer-to-peer lending system. To examine the flow of funds in the network, we extract time-respecting subgraphs. In the larger time-respecting structures, some members act as both borrowers and lenders, possibly attempting to profit from the difference between interest rates of incoming and outgoing loans. We present an analysis of the distribution of time-respecting structures over the lifetime of The Prosper Marketplace and we examine some structures in detail to show that they do represent arbitrage. (c) 2012 Elsevier Ltd. All rights reserved.

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

graph mining
social network analysis
peer-to-peer lending


On the infeasibility of modeling polymorphic shellcode Re-thinking the role of learning in intrusion detection systems Current trends demonstrate an increasing use of polymorphism by attackers to disguise their exploits. The ability for malicious code to be easily, and automatically, transformed into semantically equivalent variants frustrates attempts to construct simple, easily verifiable representations for use in security sensors. In this paper, we present a quantitative analysis of the strengths and limitations of shellcode polymorphism, and describe the impact that these techniques have in the context of learning-based IDS systems. Our examination focuses on dual problems: shellcode encryption-based evasion methods and targeted "blending" attacks. Both techniques are currently being used in the wild, allowing real exploits to evade IDS sensors. This paper provides metrics to measure the effectiveness of modern polymorphic engines and provide insights into their designs. We describe methods to evade statistics-based IDS sensors and present suggestions on how to defend against them. Our experimental results illustrate that the challenge of modeling self-modifying shellcode by signature-based methods, and certain classes of statistical models, is likely an intractable problem.

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


Internet visual media processing: a survey with graphics and vision applications In recent years, the computer graphics and computer vision communities have devoted significant attention to research based on Internet visual media resources. The huge number of images and videos continually being uploaded by millions of people have stimulated a variety of visual media creation and editing applications, while also posing serious challenges of retrieval, organization, and utilization. This article surveys recent research as regards processing of large collections of images and video, including work on analysis, manipulation, and synthesis. It discusses the problems involved, and suggests possible future directions in this emerging research area.

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

internet visual media
images
video
survey


Neural networks for power system condition monitoring and protection To maintain a good voltage quality level to customers in power distribution system, it is essential to minimise transients, line voltage dips and spikes due to a variety of causes, including fault occurrence, power interruption and large load changes. In case of private generating systems it is essential that ultra-rapid switching devices be used which cut off the customer plant from the utility system so quickly that the presence of voltage dips is not perceived by the industrial plant's sensitive loads. These devices require very fast acquisition and control systems which permit to diagnose and, possibly, predict abnormal events. In this paper, a control methodology based on a locally recurrent-globally feed-forward neural network and on a neural classifier is proposed. It will be shown that it is possible to predict with good accuracy the value of the control variables based on previously acquired samples and use these values to recognise the kind of abnormal event that is about to occur on the 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


Adaptive slice-level parallelism for H.264/AVC encoding using pre macroblock mode selection In order to achieve high computational performance and low power consumption, many modern microprocessors are equipped with special multimedia instructions and multi-core processing capabilities. The number of cores on a single chip increases double every three years. Therefore, besides complexity reduction by smart algorithms such as fast macroblock mode selection, an effective algorithm for parallelizing H.264/AVC is also very crucial in implementing a real-time encoder on a multi-core system. This algorithm serves to uniformly distribute workloads for H.264/AVC encoding over several slower and simpler processor cores on a single chip. In this paper, we propose a new adaptive slice-size selection technique for efficient slice-level parallelism of H.264/AVC encoding on a multi-core processor using fast macroblock mode selection as a pre-processing step. For this we propose an estimation method for the computational complexity of each macroblock using pre macroblock mode selection. Simulation results, with a number of test video sequences, show that, without any noticeable degradation, the proposed fast macroblock mode selection reduces the total encoding time by about 57.30%. The proposed adaptive slice-level parallelism has good parallel performance compared to conventional fixed slice-size parallelism. The proposed method can be applied to many multi-core systems for real-time H.264 video encoding. (C) 2008 Elsevier Inc. All rights reserved.

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

parallel processing
thread-level parallelism
slice-level parallelism
h.264/avc
fast inter mode selection
fast mode decision
selective intra coding


Improving the WCET computation in the presence of a lockable instruction cache in multitasking real-time systems In multitasking real-time systems it is required to compute the WCET of each task and also the effects of interferences between tasks in the worst case. This is very complex with variable latency hardware, such as instruction cache memories, or, to a lesser extent, the line buffers usually found in the fetch path of commercial processors. Some methods disable cache replacement so that it is easier to model the cache behavior. The difficulty in these cache-locking methods lies in obtaining a good selection of the memory lines to be locked into cache. In this paper, we propose an ILP-based method to select the best lines to be loaded and locked into the instruction cache at each context switch (dynamic locking), taking into account both intra-task and inter-task interferences, and we compare it with static locking. Our results show that, without cache, the spatial locality captured by a line buffer doubles the performance of the processor. When adding a lockable instruction cache, dynamic locking systems are schedulable with a cache size between 12.5% and 50% of the cache size required by static locking. Additionally, the computation time of our analysis method is not dependent on the number of possible paths in the task. This allows its to analyze large codes in a relatively short time (100 KB with 10(65) paths in less than 3 min). (C) 2010 Elsevier B.V. All rights reserved.

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


on multi-robot area coverage Area coverage is one of the emerging problems in multi-robot coordination. In this task a team of robots is cooperatively trying to observe or sweep an entire area, possibly containing obstacles, with their sensors or actuators. The goal is to build an efficient path for each robot which jointly ensure that every single point in the environment can be seen or swept by at least one of the robots while performing the task.

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

heterogeneity
open systems
communication
teamwork
online coverage
offline coverage
multi-robot systems


multi-level genetic algorithm (mlga) for the construction of clock binary tree The clock signal and clock skew become more and more important for the circuit performance. Since there are salient shortcomings in the conventional topology construction algorithms for designing a clock network, the multi-level model of clock binary tree is built, and the binary tree construction algorithm of clock signal based on multi-level genetic algorithm (MLGA) is presented. The experiments on random test cases and standard benchmark test cases show that multi-level genetic algorithm can produce much better clock network design in most cases when compared with conventional heuristic algorithms.

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

genetic algorithms
clock routing
multi-level model


Knowledge-driven path planning for mobile robots: relative state tree Path planning is important in the field of mobile robot. However, traditional path planning techniques optimize the navigation path solely based on the models of the robot and the environments. Owing to the time-varying environment, the robot is expected to launch the replanning procedure in real-time continuously. It is slow and wastes computing resources for repeated decisions. In this study, a new perspective is adopted which utilizes a knowledge-driven approach for path planning. The concept of relative state tree is proposed to develop an incremental learning method based on a path planning knowledge base. The knowledge library, which stores a collection of the mappings from environmental information to robot decisions, can be established by offline or online learnings. As the robot plans online, its movement is guided by the optimal decision that is retrieved from the library based on the information which matches mostly the current environment. A large number of simulations are executed to verify the proposed method. When comparing to \(k\)-d tree, this novel method has shown to use smaller storage space and have higher efficiency.

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

path planning
relative state tree
incremental learning


Which process metrics can significantly improve defect prediction models? An empirical study The knowledge about the software metrics which serve as defect indicators is vital for the efficient allocation of resources for quality assurance. It is the process metrics, although sometimes difficult to collect, which have recently become popular with regard to defect prediction. However, in order to identify rightly the process metrics which are actually worth collecting, we need the evidence validating their ability to improve the product metric-based defect prediction models. This paper presents an empirical evaluation in which several process metrics were investigated in order to identify the ones which significantly improve the defect prediction models based on product metrics. Data from a wide range of software projects (both, industrial and open source) were collected. The predictions of the models that use only product metrics (simple models) were compared with the predictions of the models which used product metrics, as well as one of the process metrics under scrutiny (advanced models). To decide whether the improvements were significant or not, statistical tests were performed and effect sizes were calculated. The advanced defect prediction models trained on a data set containing product metrics and additionally Number of Distinct Committers (NDC) were significantly better than the simple models without NDC, while the effect size was medium and the probability of superiority (PS) of the advanced models over simple ones was high (\(p=.016\), \(r=-.29\), \(\hbox {PS}=.76\)), which is a substantial finding useful in defect prediction. A similar result with slightly smaller PS was achieved by the advanced models trained on a data set containing product metrics and additionally all of the investigated process metrics (\(p=.038\), \(r=-.29\), \(\hbox {PS}=.68\)). The advanced models trained on a data set containing product metrics and additionally Number of Modified Lines (NML) were significantly better than the simple models without NML, but the effect size was small (\(p=.038\), \(r=.06\)). Hence, it is reasonable to recommend the NDC process metric in building the defect prediction models.

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

software metrics
product metrics
process metrics
defect prediction models


investigation of subjective preferences in multiple degrees-of-freedom inputs With the rapid proliferation of a wide range of input devices, there are many choices in designing or selecting a 6DOF input device. User perception of the devices is an important aspect of design. We complement existing literature on the influence of grip of dominant hand on performance times with our experiments on the influence of grip of non-dominant hand on perceived ease-of-use, control and fatigue. Our results show that for the non-dominant hand, the finger grip is perceived as being easy to use, less fatiguing and more controllable.

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

multiple degrees of freedom
ease of use
3d interface


An value-centric event driven model and architecture: A case study of adaptive complement of SOA for distributed care service delivery The Web is now evolving into a medium for providing a wide array of e-commerce and other information based services that are solely based on distributed software interactions for collaborative work. Service-oriented and event-driven architectures (SOA and EDA) are the complementary paradigms for building such distributed information systems based on software interactions as their characteristics of modularity, loose-couplings, and flexibility. However, given the rapid change of the web environment (including the dynamic behavior of the users), these paradigms are not yet able to empower a built system adapting its behavior according to the changes in its environment or in parts of the system itself. This paper presents an architecture of adaptive integration of EDA and SOA based on the novel concept of value-centric processing and communication of events grounded on value theory. This architecture has also been used on a case study of distributed care service delivery. In the architecture, value models are devised to represent events consumed and develop a value-centric mechanism for this adaptive integration. We have also implemented the system and simulated certain representative scenarios in order to justify the claimed values of this adaptive integration on the case study. (C) 2008 Elsevier Ltd. All rights reserved.

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

distributed service delivery
intelligent agents
electronic care systems


Violent and slow relaxations to sinh?Poisson equilibrium state in two?dimensional point vortex system Characteristics of numerically?obtained typical distributions of a two?dimensional point vortex system after a violent relaxation at positive and negative temperatures are examined. It is anticipated that like gravitational N?body systems, the point vortex system rapidly relaxes to a state near the thermal equilibrium state by the violent relaxation and after that the system evolves toward the genuine thermal equilibrium state driven by a collisional slow process (the slow relaxation). The time scale of the slow relaxation is proportional to the number of the point vortices. Namely, it takes a very long time to reach the final thermal equilibrium state. The detailed mechanism of the violent and slow relaxations are still unclear. In this paper, we examine the mechanism of the slow relaxation numerically. When the system temperature determined by the initial system energy is negative, the system evolves to a state consisting of many small areas with different temperatures by the violent relaxation. In this state, the vorticity is determined as a function of the stream function, which means that the motion of the vortices across an isosurface of the stream function is restricted. Due to this restriction, the collisional relaxation process following the violent relaxation is slow.

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

2d point vortex system
onsager theory
negative temperature


Multicomponent transport algorithms for partially ionized mixtures We investigate iterative methods for solving linear systems arising from the kinetic theory of gases and providing multicomponent transport coefficients of partially ionized plasmas. We consider the situations of weak and strong magnetic fields as well as electron temperature nonequilibrium and the linear systems are investigated in their natural constrained singular symmetric form. Stationary iterative techniques are considered with new more singular formulations of the transport linear systems as well as orthogonal residuals algorithms. The new formulations are derived by considering generalized inverses with nullspaces of increasing dimension. Numerical tests are performed with high temperature air and iterative techniques lead to fast and accurate evaluation of the transport coefficients for all ionization levels and magnetic field intensities.

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

transport linear systems
transport coefficients
nonequilibrium

ionized mixture
iterative algorithms
anisotropy
multicomponent diffusion


Comments On Selecting Ephemeral Ports Careless selection of the ephemeral port number portion of a transport protocol's connection identifier has been shown to potentially degrade security by opening the connection up to injection attacks from "blind" or "off path" attackers-or, attackers that cannot directly observe the connection. This short paper empirically explores a number of algorithms for choosing the ephemeral port number that attempt to obscure the choice from such attackers and hence make mounting these blind attacks more difficult.

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

measurement
experimentation
tcp
port numbers