Algorithms for dominating clique problems We handle in this paper three dominating clique problems, namely, the decision problem to detect whether a graph has a dominating clique and two optimization versions asking to compute a maximum- and a minimum-size dominating clique of a graph G, if G has a dominating clique. For the three problems we propose exact moderately exponential algorithms with worst-case running time upper bounds improving those by Kratsch and Liedloff [D. Kratsch, M. Liedloff, An exact algorithm for the minimum dominating clique problem, Theoret. Comput. Sci. 385 (1-3) (2007) 226-240]. We then study the three problems in sparse and dense graphs also providing improved running time upper bounds. Finally, we propose some exponential time approximation algorithms for the optimization versions. (C) 2012 Elsevier B.V. All rights reserved.

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

exponential time algorithms
exact and approximation algorithms


Technical note: Evaluation of a new system for measuring feeding behavior of dairy cows We developed a new measurement system for recording feeding behavior of cattle. The automatic system bases on electromyography (EMG). Measurement of single jaw movements during chewing and ruminating is possible. Validation results showed adequate agreement of the results of both assessments.

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

emg electromyography
ft feeding time
rt rumination time


Influence of sample size on line-based positional assessment methods for road data Sample size influences considerably the variability of results of estimation processes, but this issue has never previously been analyzed for line-based positional assessment methods. The basis of the analysis is a simulation process which extracts homologous road axes from the product and from the control survey and applies the four methods. Sample sizes of road axes range from 10Km up to 200Km, and for each sample size 1000 simulations were run. Results for each sample size were compared to population parameters or population distribution functions by means of statistical tests. The variability of estimations was reduced in the order of 2.54.5 times when sample size increased from 10Km to 200Km.

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


A study on drag reduction of a rotationally oscillating circular cylinder at low Reynolds number The flow field around a rotationally oscillating circular cylinder in a uniform flow is studied by using a particle image velocimetry to understand the mechanism of drag reduction and the corresponding suppression of vortex shedding in the cylinder wake at low Reynolds number. Experiments are conducted on the flow around the circular cylinder under rotational oscillation at forcing Strouhal number 1, rotational amplitude 2 and Reynolds number 2,000. It is found from the flow measurement by PIV that the width of the wake is narrowed and the velocity fluctuations are reduced by the rotational oscillation of the cylinder, which results in the drag reduction rate of 30%. The mechanism of drag reduction is studied by phase-averaged PIV measurement, which indicates the formation of periodic small-scale vortices from both sides of the cylinder. It is found from the cross-correlation measurement between the velocity fluctuations that the large-scale structure of vortex shedding is almost removed in the cylinder wake, when the small-scale vortices are generated at the unstable frequency of shear layer by the influence of rotational oscillation.

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

vortex shedding
circular cylinder
wake
piv


Designing computer-based frameworks that facilitate doctorpatient collaboration A current trend in medicine involves establishing collaborative problem solving between patients and physicians in order to involve patients more in their own care. Neither diagnosis nor therapy can be completely successful unless the patient and the doctor understand each other and collaborate with each other in an effort to gauge the other's requests, needs and concerns. This is made even more difficult by the fact that there is often a big difference between the doctors and patients in terms of expectations, vocabulary used, and other factors. For diagnosis of many disorders, a detailed description of the problem and of the patient's history are required. For therapy, patients must understand how and when to take prescribed drugs, what changes to make in diet, exercise, or lifestyleand why they are important. This paper describes a model of asynchronous collaboration between people with very different knowledge of medicine in which a computer framework attempts to mediate between patients and physicians and reduce some of the differences in communication. It allows patients to pace themselves in familiarizing themselves with the relevant domain terms, some of the medical factors underlying the conditions under question, and the justifications and implications of the prescribed treatment plan. It also allows physicians to request more information of patients and gives patients contextual information to help them understand the underlying reasons for the questions. This framework has been partially implemented in the domain of migraines. As described in the paper, not only is the system designed to cooperate with the patient, but using the system also results in better mutual understanding between the doctor and the patient, thus leading to better collaboration between them.

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


Continuous reinforcement learning to robust fault tolerant control for a class of unknown nonlinear systems Proposing two robust adaptive FTC systems based on machine learning approaches. Presenting adaptation laws in the sense of the proposed Lyapunov function. Using an intelligent observer for unknown nonlinear systems in presence of faults. Adapting the critic and actor of continuous RL based on the Lyapunov function.

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

fault tolerant control
continuous reinforcement learning

neural network
actor-critic learning
adaptive control
variable structure control


A Privacy Preserving Message Delivery Protocol Using Identity-Hidden Index in VDTNs Vehicular Delay Tolerant Networks (VDTNs) are characterized model of Vehicular Ad Hoc Networks where vehicles disseminate messages through fixed relay nodes placed on roadside by utilizing a store-carry-forward method. In this paper, we propose a secure message delivery protocol for protecting receiver-location privacy in socialspot-based VDTN because location privacy is one of the most important security requirements. To design a simplified protocol, we eliminate the use of conventional pseudonym-based vehicle identification accompanied with a complex pseudonymous certificate management. Instead, we introduce an identity-hidden message indexing which enables a receiver vehicle to query a message whose destination is itself to the socialspot RSU without revealing its identity, and we make use of non-interactive key agreement scheme to establish a secure communication channel between message source and destination vehicles. Furthermore, we demonstrate experimental results to confirm the reduced cryptographic overhead and the effectiveness of privacy preservation for the proposed protocol.

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


Separation-network synthesis: global optimum through rigorous super-structure The available algorithmic methods often fail to yield with certainty the global optima in solving even a relatively simple class of separation-network synthesis problem for which the cost functions are considered to be linear. This is attributable to two complications; firstly the super-structures on which the solutions are based are incomplete; and the secondly, the mathematical programming models derived for the problems are unnecessarily cumbersome. To circumvent these complications, a novel method is proposed here to generate the complete super-structure and the corresponding mathematical programming model necessary for the separation-network synthesis problem with linear cost function. The efficacy of the proposed method is demonstrated by re-examining Four published problems for which the optima obtained are claimed to be global. For all the problems re-examined, the costs of the solutions resulting from the present method are the same or as much as 30% lower than those of the published solutions. (C) 2000 Elsevier Science Ltd. All rights reserved.

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

process synthesis
separation network
rigorous super-structure


A layered architecture for probabilistic complex pattern recognition to detect user preferences The recognition of complex patterns is nowadays one of the most challenging tasks in machine learning, and it promises to be of great benefit for many applications, e.g. by allowing advanced human computer interaction to access the users situative context. This work examines a layered architecture that operates on different temporal granularities to infer complex patterns of user preferences. Classical hidden Markov models (HMM), conditioned HMM (CHMM) and fuzzy CHMM (FCHMM) are compared to find the best configuration in the lower architecture layers. In the uppermost layer, a Markov logic network (MLN) is applied to infer the user preference in a probabilistic rule-based manner. For each layer a comprehensive evaluation is given. We provide empirical evidence showing that the layered architecture using FCHMM and MLN is well-suited to recognize patterns on different layers.

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


bring integrated gis data and modeling capabilities into hubzero platform The rapid advancement in the collection of environmental data, geospatial analysis and modeling software calls for new GIS-enabled cyberinfrastructure (CI) capable of support large scale integrated data and modeling activities. Although the HUBzero platform is gaining popularity as a portal development framework for many science and engineering communities, it has limited success in earth and environmental science domains, mainly due to its lack of native support for large geospatial data management and GIS functionalities in the Rappture toolkit. In this paper, we describe our initial work on bringing integrated GIS data and modeling capabilities into the HUBzero platform. We describe the overall architecture of our CI solution which is scalable, extensible and portable to other gateway framework as well. Two prototype applications are presented as a proof-of-concept. Coupling the scalable GIS capabilities with a wealth of tools for user participation and community building on the HUBzero platform, we hope to help new science communities in utilizing this platform.

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

science gateway
data and model integration
gis-enabled cyberinfrastructure


Enhancing parallel quasi-static particle-in-cell simulations with a pipelining algorithm A pipelining algorithm to overcome the limitation on scaling quasi-static particle-in-cell models of relativistic beams in plasmas to a very large number of processors is described. The pipelining algorithm uses multiple groups of processors and optimizes the job allocation on the processors in parallel computing. The algorithm is implemented on the quasi-static code QuickPIC and is shown to scale to over 103 processors and increased the scale and speed by two orders of magnitude over the non-pipelined model. The new approach opens the door to performing full scale 3D simulations of future plasma wakefield accelerators or full lifetime models of beam interaction with electron clouds in circular accelerators such as the Large Hadron Collider (LHC) at CERN.

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


The Roles of Satellite Cells and Hematopoietic Stem Cells in Impaired Regeneration of Skeletal Muscle in Old Rats Abstract:?Sarcopenia is the involuntary loss of skeletal muscle mass and strength that occurs with aging, resulting in physical frailty. One potential explanation for sarcopenia is the failure of muscle to regenerate after damage, some of which may be due to changes in the function of satellite cells. Recent studies have identified novel populations of adult stem cells in skeletal muscle, such as hematopoietic stem cells. To understand the cellular mechanisms of sarcopenia, we examined the expression of satellite cells and hematopoietic stem cells in old regenerating muscles based on the expression profiles of several markers related to those cells.

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

sarcopenia
satellite cells
hematopoietic stem cells


Reinforcement of a PDMS master using an oxide-coated silicon plate In this work, a new method was developed to increase the stiffness of Polydimethylsiloxane (PDMS) masters using oxide-coated silicon plates, aimed at reducing the residual and deflecting deformations of the PDMS masters for proper pattern transfer. Using this method, these two types of deformations in the reinforced PDMS master have been reduced.

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

pdms master
pattern transfer
residual and deflecting deformations
reinforcement


The effects of simulated fog and motion on simulator sickness in a driving simulator and the duration of after-effects We checked how the simulator test conditions affect the simulator sickness. The sickness symptoms persisted at the highest level for the mobile platform. The simulator sickness symptoms varied depending on the time.

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

disorientation symptoms
driving task
nausea
oculomotor disturbance


Application of new fast multipole boundary integral equation method to crack problems in 3D Fast multipole method (FMM) has been developed as a technique to reduce the computational cost and memory requirements in solving large scale problems. This paper discusses an application of the new version of FMM to three-dimensional boundary integral equation method (BIEM) for crack problems for the Laplace equation. The boundary integral equation is discretised with collocation method. The resulting algebraic equation is solved with generalised minimum residual method (GMRES). The numerical results show that the new version of FMM is more efficient than the original FMM.

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


Blind Separation of Orthogonal Mixtures of Spatially-Sparse Sources with Unknown Sparsity Levels and with Temporal Blocks We address the problem of blind separation of a static, linear orthogonal mixture, where separation is not based on statistical assumptions (such as independence), but on the sources spatial sparsity. An algorithm for this problem was proposed by Mishali and Eldar in 2008. It consists of first recovering the supports of the sources, and then recovering their values, but has two shortcomings: One is an assumption that the spatial sparsity level at each time-instant is constant and known; The second is the algorithms sensitivity to possible presence of temporal blocks of the signals, sharing identical supports. In this work we propose two pre-processing stages for improving the algorithms applicability and the performance. A first stage is aimed at identifying blocks of similar support, and pruning the data accordingly. A second stage is aimed at recovering the sparsity level at each time-instant. We demonstrate the improvement using both synthetic data and mixed text-images. We also show that the improved algorithm outperforms the recovery rate of alternative source separation methods for such contexts, including K-SVD, a leading method for dictionary learning.

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

sparsity
temporal blocks
orthogonal mixtures


Hardware Error Likelihood Induced by the Operation of Software The influence of the software, and its interaction and interdependency with the hardware in the creation and propagation of hardware failures, are usually neglected in reliability analyses of safety critical systems. The software operation is responsible for the usage of semiconductor devices along the system lifetime. This usage consists of voltage changes and current flows that steadily degrade the materials of circuit devices until the degradation becomes permanent, and the device can no longer perform its intended function. At the circuit level, these failures manifest as stuck-at values, signal delays, or circuit functional changes. These failures are permanent in nature. Due to the extremely high scaling of complementary metal-oxide-semiconductor (CMOS) technology into deep submicron regimes, permanent hardware failures are a key concern, and can no longer be neglected compared to transient failures in radiation-intense applications. Our work proposes a methodology for the reliability analysis of permanent failure manifestations of hardware devices due to the usage induced by the execution of embedded software applications. The methodology is illustrated with a case study based on a safety critical application.

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

circuit simulation
embedded systems
failure propagation
hardware-software interaction


Extracting elite pairwise constraints for clustering Semi-supervised clustering under pairwise constraints (i.e. must-links and cannot-links) has been a hot topic in the data mining community in recent years. Since pairwise constraints provided by distinct domain experts may conflict with each other, a lot of research work has been conducted to evaluate the effects of noise imposing on semi-supervised clustering. In this paper, we introduce elite pairwise constraints, including elite must-link (EML) and elite cannot-link (ECL) constraints. In contrast to traditional constraints, both EML and ECL constraints are required to be satisfied in every optimal partition (i.e. a partition with the minimum criterion function). Therefore, no conflict will be caused by those new constraints. First, we prove that it is NP-hard to obtain EML or ECL constraints. Then, a heuristic method named Limit Crossing is proposed to achieve a fraction of those new constraints. In practice, this new method can always retrieve a lot of EML or ECL constraints. To evaluate the effectiveness of Limit Crossing, multi-partition based and distance based methods are also proposed in this paper to generate faux elite pairwise constraints. Extensive experiments have been conducted on both UCI and synthetic data sets using a semi-supervised clustering algorithm named COP-KMedoids. Experimental results demonstrate that COP-KMedoids under EML and ECL constraints generated by Limit Crossing can outperform those under either faux constraints or no constraints.

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


Synchronization of Chaotic Gyro Systems using Recurrent Wavelet CMAC This study addresses synchronization of two chaotic gyros by using an adaptive recurrent wavelet cerebellar model articulation controller (RWCMAC). The proposed adaptive RWCMAC system contains an RWCMAC and a robust controller. Based on Lyapunov stability theory, the parameters of RWCMAC are on-line tuned and the robust controller is designed for achieving H(infinity) robust performance. Finally, the proposed adaptive RWCMAC system is applied to synchronize two chaotic gyros. Numerical simulation results demonstrate the effectiveness of the proposed control scheme.

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


Constructing fair sports league schedules with regard to strength groups A single round robin tournament (SRRT) consists of n n teams and a set of periods. Matches between the teams have to be scheduled such that each team plays against each other team exactly once and each team plays at most once per period. In order to establish fairness among teams, we consider a partition of the teams into strength groups. Then, the goal is to avoid matches where a team plays against extremely weak or extremely strong teams in consecutive periods. In this paper, we pick up two concepts ensuring different degrees of fairness and address several questions which remained open so far.

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

sports scheduling
round robin tournaments
graphs


A novel intelligent verification platform based on a structured analysis model An intelligent verification platform based on a structured analysis model is presented. Using an abstract model mechanism with specific signal interfaces for user callback, the unified structured analysis data, shared by the electronic system level design, functional verification, and performance evaluation, enables efficient management review, auto-generation of code, and modeling in the transaction level. We introduce the class tree, flow parameter diagram, structured flow chart, and event-driven finite state machine as structured analysis models. As a sand table to carry maps from different perspectives and levels via an engine, this highly reusable platform provides the mapping topology to search for unintended consequences and the graph theory for comprehensive coverage and smart test cases. Experimental results show that the engine generates efficient test sequences, with a sharp increase in coverage for the same vector count compared with a random test.

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

intelligent verification platform
structured analysis model
mapping topology

verification automation
graph theory algorithm


Toward cooperative genomic knowledge inference This paper proposes an efficient infrastructure for distributed genomic knowledge reasoning. A genomic semantic network complying with the UMLS is used as backbone knowledge representation system.

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


Near-optimal dynamic trajectory generation and control of an omnidirectional vehicle This paper describes a computationally inexpensive, yet high performance trajectory generation algorithm for omnidirectional vehicles. It is shown that the associated non-linear control problem can be made tractable by restricting the set of admissible control functions. The resulting problem is linear with coupled control efforts and a near-optimal control strategy is shown to be piecewise constant (bangbang type). A very favorable trade-off between optimality and computational efficiency is achieved. The proposed algorithm is based on a small number of evaluations of simple closed-form expressions and is thus extremely efficient. The low computational cost makes this method ideal for path planning in dynamic environments.

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


LSH-RANSAC: Incremental Matching of Large-Size Maps This paper presents a novel approach for robot localization using landmark maps. With recent progress in SLAM researches, it has become crucial for a robot to obtain and use large-size maps that are incrementally built by other mapper robots. Our localization approach successfully works with such incremental and large-size maps. In literature, RANSAC map-matching has been a promising approach for large-size maps. We extend the RANSAC map-matching so as to deal with incremental maps. We combine the incremental RANSAC with an incremental LSH database and develop a hybrid of the position-based and the appearance-based approaches. A series of experiments using radish dataset show promising results.

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

mobile robot
self-localization
incremental map-matching


Data mining as a tool for research and knowledge development in nursing The ability to collect and store data has grown at a dramatic rate in all disciplines over the past two decades. Healthcare has been no exception. The shift toward evidence-based practice and outcomes research presents significant opportunities and challenges to extract meaningful information from massive amounts of clinical data to transform it into the best available knowledge to guide nursing practice. Data mining, a step in the process of Knowledge Discovery in Databases, is a method of unearthing information from large data sets. Built upon statistical analysis, artificial intelligence, and machine learning technologies, data mining can analyze massive amounts of data and provide useful and interesting information about patterns and relationships that exist within the data that might otherwise be missed. As domain experts, nurse researchers are in ideal positions to use this proven technology to transform the information that is available in existing data repositories into useful and understandable knowledge to guide nursing practice and for active interdisciplinary collaboration and research.

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


Some properties of pseudo almost periodic sequences In this paper, some new properties of pseudo almost periodic sequences are established. Especially, we obtain two interesting characterization theorems for pseudo almost periodic sequences.

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


soft typing with conditional types We present a simple and powerful type inference method for dynamically typed languages where no type information is supplied by the user. Type inference is reduced to the problem of solvability of a system of type inclusion constraints over a type language that includes function types, constructor types, union, intersection, and recursive types, and conditional types. Conditional types enable us to analyze control flow using type inference, thus facilitating computation of accurate types. We demonstrate the power and practicality of the method with examples and performance results from an implementation.

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

intersection
method
examples
inclusion
language
performance
computation
type inference
types
implementation
demonstrate
power
control flow
user

systems recursion functional constraint informal


H? filter design for fuzzy systems with quantized measurements ? This paper addresses the problem of H? H ? filtering for a class of discrete time TS model based fuzzy systems with quantized measurements. The measurement signal is quantized by a logarithmic quantizer. By using basis dependent Lyapunov function, a sufficient condition is provided to ensure the stability of the filtering error system and to guarantee a given H? H ? performance level. Based on this analysis result of the filtering error system, an explicit filter design approach is proposed and the basis dependent filtering algorithm is further improved by using a kind of relaxed technique. Two numerical examples are also presented to show that the filtering algorithm based on the basis dependent Lyapunov function has less conservative than the one based on the basis independent Lyapunov function.

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

basis-dependent lyapunov function
h? h ? filtering h? h ? h? h ? h ?
quantization


Generation of shape functions for straight beam elements Straight beam finite elements with greater than two nodes are used for edge stiffening in plane stress analyses and elsewhere. It is often necessary to match the number of nodes on the edge stiffener to the number on a whole plane stress element side. Beam elements employ shape functions which are recognised to be level one Hermitian polynomials. An alternative to the commonly adopted method for determining these shape functions is given in this note, using a formula widely reported in mathematical texts which has hitherto not been applied to this task in the finite element literature. The procedure derives shape functions for beams entirely from the set of Lagrangian interpolating polynomials. Examples are given for the derivation of functions for a three and four-noded beam element.

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


Novel low-voltage low-power high-precision CCII based on bulk-driven folded cascode OTA This paper presents possible approaches to the design of a novel low-voltage, low-power, and high-precision current conveyor of the second generation (CCII) based on the bulk-driven folded cascode operational transconductance amplifier (OTA) with extended input common-mode voltage range. This CCII utilizes bulk-driven differential pairs to obtain a nearly rail-to-rail input stage at a low supply voltage. The proposed conveyor operates at a low supply voltage of 400mV with a reduced power consumption of only 64?W. A current-mode multifunction filter is presented as an application of the CCII. This filter provides five transfer functions simultaneously, namely low-pass, band-pass, high-pass, notch, and all-pass. The filter has the following properties and advantages: it employs three bulk-driven current conveyors BD-CCII, three grounded resistors, and two grounded capacitors, which is suitable for integrated circuit implementation. Furthermore, the input signal is connected to the low-impedance X terminal of the BD-CCII whereas the output signals are taken from the high-impedance output terminals Z+ and Z?. Finally, the pole frequency and quality factor of the designed filter are tunable independent of each other. PSpice simulation results using the 0.18?m CMOS technology are included to prove the results.

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

bulk-driven most
current mode
universal filter


Modeling the spatial layout of images beyond spatial pyramids Several state-of-the-art image representations consist in averaging local statistics computed from patch-level descriptors. It has been shown by Boureau et al. that such average statistics suffer from two sources of variance. The first one comes from the fact that a finite set of local statistics are averaged. The second one is due to the variation in the proportion of object-dependent information between different images of the same class. For the problem of object classification, these sources of variance affect negatively the accuracy since they increase the overlap between class-conditional probabilities. Our goal is to include information about the spatial layout of images in image signatures based on average statistics. We show that the traditional approach to including the spatial layout the spatial pyramid (SP) increases the first source of variance while only weakly reducing the second one. We therefore propose two complementary approaches to account for the spatial layout which are compatible with our goal of variance reduction. The first one models the spatial layout in an image-independent manner (as is the case of the SP) while the second one adapts to the image content. A significant benefit of these approaches with respect to the SP is that they do not incur an increase of the image signature dimensionality. We show on PASCAL VOC 2007, 2008 and 2009 the benefits of our approach.

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

image representation
image categorization
fisher vectors
pascal voc datasets


improving interactive performance using tipme On the vast majority of today's computers, the dominant form of computation is GUI-based user interaction. In such an environment, the user's perception is the final arbiter of performance. Human-factors research shows that a user's perception of performance is affected by unexpectedly long delays. However, most performance-tuning techniques currently rely on throughput-sensitive benchmarks. While these techniques improve the average performance of the system, they do little to detect or eliminate response-time variabilitiesin particular, unexpectedly long delays. We introduce a measurement infrastructure that allows us to improve user-perceived performance by helping us to identify and eliminate the causes of the unexpected long response times that users find unacceptable. We describe TIPME (The Interactive Performance Monitoring Environment), a collection of measurement tools that allowed us to quickly and easily diagnose interactive performance bugs in a mature operating system. We present two case studies that demonstrate the effectiveness of our measurement infrastructure. Each of the performance problems we identify drastically affects variability in response time in a mature system, demonstrating that current tuning techniques do not address this class of performance problems.

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


application neutrality and a paradox of side payments The ongoing debate over net neutrality covers a broad set of issues related to the regulation of public networks. In two ways, we extend an idealized usage-priced game-theoretic framework based on a common linear demand-response model [1]. First, we study the impact of "side payments" among a plurality of Internet service (access) providers and content providers. In the non-monopolistic case, our analysis reveals an interesting "paradox" of side payments in that overall revenues are reduced for those that receive them. Second, assuming different application types ( e.g. , HTTP web traffic, peer-to-peer file sharing, media streaming, interactive VoIP), we extend this model to accommodate differential pricing among them in order to study the issue of application neutrality. Revenues for neutral and non-neutral pricing are compared for the case of two application types.

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


Toward Generating Reducible Replay Logs Logging and replay is important to reproducing software failures and recovering from failures. Replaying a long execution is time consuming, especially when replay is further integrated with runtime techniques that require expensive instrumentation, such as dependence detection. In this paper, we propose a technique to reduce a replay log while retaining its ability to reproduce a failure. While traditional logging records only system calls and signals, our technique leverages the compiler to selectively collect additional information on the fly. Upon a failure, the log can be reduced by analyzing itself. The collection is highly optimized. The additional runtime overhead of our technique, compared to a plain logging tool, is trivial (2.61% average) and the size of additional log is comparable to the original log. Substantial reduction can be cost-effectively achieved through a search based algorithm. The reduced log is guaranteed to reproduce the failure.

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

reliability
performance
software reliability
log reduction
debugging


Analog circuit synthesis performing fast Pareto frontier exploration and analysis through 3D graphs This paper presents a technique for performing analog design synthesis at circuit level providing feedback to the designer through the exploration of the Pareto frontier. A modified simulated annealing which is able to perform crossover with past anchor points when a local minimum is found which is used as the optimization algorithm on the initial synthesis procedure. After all specifications are met, the algorithm searches for the extreme points of the Pareto frontier in order to obtain a non-exhaustive exploration of the Pareto front. Finally, multi-objective particle swarm optimization is used to spread the results and to find a more accurate frontier. Piecewise linear functions are used as single-objective cost functions to produce a smooth and equal convergence of all measurements to the desired specifications during the composition of the aggregate objective function. To verify the presented technique two circuits were designed, which are: a Miller amplifier with 96 dB Voltage gain, 15.48 MHz unity gain frequency, slew rate of 19.2 V/mu s with a current supply of 385.15 mu A, and a complementary folded cascode with 104.25 dB Voltage gain, 18.15 MHz of unity gain frequency and a slew rate of 13.370 MV/mu s. These circuits were synthesized using a 0.35 mu m technology. The results show that the method provides a fast approach for good solutions using the modified SA and further good Pareto front exploration through its connection to the particle swarm optimization algorithm.

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

amplifier
simulated annealing
pareto front


A Model Based Approach to Modular Multi-Objective Robot Control Two broad classes of robot controllers are the modular, and the model based approaches. The modular approaches include the Reactive or Behavior Based designs. They do not rely on mathematical system models, but are easy to design, modify and extend. In the model based approaches, a model is used to design a single controller with verifiable system properties. The resulting designs are however often hard to extend, without jeopardizing the previously proven properties. This paper describes an attempt to narrow the gap between the flexibility of the modular approaches, and the predictability of the model based approaches, by proposing a modular design that does the combination, or arbitration, of the different modules in a model based way. By taking the (model based) time derivatives of scalar, Lyapunov-like, objective functions into account, the arbitration module can keep track of the time evolution of the objectives. This enables it to handle objective tradeoffs in a predictable way by finding controls that preserve an important objective that is currently met, while striving to satisfy another, less important one that is not yet achieved. To illustrate the approach a UAV control problem from the literature is solved, resulting in comparable, or better, performance.

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

robotics
reactive control
behavior-based systems
lyapunov function


idletime scheduling with preemption intervals This paper presents the idletime scheduler; a generic, kernel-level mechanism for using idle resource capacity in the background without slowing down concurrent foreground use. Many operating systems fail to support transparent background use and concurrent foreground performance can decrease by 50\% or more. The idletime scheduler minimizes this interference by partially relaxing the work conservation principle during preemption intervals , during which it serves no background requests even if the resource is idle. The length of preemption intervals is a controlling parameter of the scheduler: short intervals aggressively utilize idle capacity; long intervals reduce the impact of background use on foreground performance. Unlike existing approaches to establish prioritized resource use, idletime scheduling requires only localized modifications to a limited number of system schedulers. In experiments, a FreeBSD implementation for idletime network scheduling maintains over 90\% of foreground TCP throughput, while allowing concurrent, high-rate UDP background flows to consume up to 80\% of remaining link capacity. A FreeBSD disk scheduler implementation maintains 80\% of foreground read performance, while enabling concurrent background operations to reach 70\% throughput.

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

background processing
resource scheduler
queuing
preemption interval
network scheduler


Fault-tolerant pancyclicity of augmented cubes As an enhancement on the hypercube Q(n), the augmented cube AQ(n) prosed by Choudum and Sunitha [S.A. Choudum, V. Sunitha, Augmented cubes, Networks 40 (2) (2002) 71-84], not only retains some favorable properties of Q(n) but also possesses some embedding properties that Q(n) does not. For example, AQ(n) is pancyclic, that is, AQ(n) contains cycles of arbitrary length for n >= 2. This paper shows that AQ(n) remains pancyclic provided faulty vertices and/or edges do not exceed 2n-3 and n >= 4. (C) 2007 Elsevier B.V. All rights reserved.

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


Genetic algorithms for satellite scheduling problems Recently there has been a growing interest in mission operations scheduling problem. The problem, in a variety of formulations, arises in management of satellite/space missions requiring efficient allocation of user requests to make possible the communication between operations teams and spacecraft systems. Not only large space agencies, such as ESA (European Space Agency) and NASA, but also smaller research institutions and universities can establish nowadays their satellite mission, and thus need intelligent systems to automate the allocation of ground station services to space missions. In this paper, we present some relevant formulations of the satellite scheduling viewed as a family of problems and identify various forms of optimization objectives. The main complexities, due highly constrained nature, windows accessibility and visibility, multi-objectives and conflicting objectives are examined. Then, we discuss the resolution of the problem through different heuristic methods. In particular, we focus on the version of ground station scheduling, for which we present computational results obtained with Genetic Algorithms using the STK simulation toolkit.

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

genetic algorithms
satellite scheduling
ground station
mission operations

multi-objective optimization
stk toolkit


Minimum degree thresholds for bipartite graph tiling Given a bipartite graph H and a positive integer n such that v(H) divides 2n, we define the minimum degree threshold for bipartite H-tiling, ?2(n, H), as the smallest integer k such that every bipartite graph G with n vertices in each partition and minimum degree ?(G)?k contains a spanning subgraph consisting of vertex-disjoint copies of H. Zhao, Hladk-Schacht, Czygrinow-DeBiasio determined ?2(n, Ks, t) exactly for all s?t and suffi-ciently large n. In this article we determine ?2(n, H), up to an additive constant, for all bipartite H and sufficiently large n. Additionally, we give a corresponding minimum degree threshold to guarantee that G has an H-tiling missing only a constant number of vertices. Our ?2(n, H) depends on either the chromatic number ?(H) or the critical chromatic number ?cr(H), while the threshold for the almost perfect tiling only depends on ?cr(H). These results can be viewed as bipartite analogs to the results of Kuhn and Osthus [Combinatorica 29 (2009), 65107] and of Shokoufandeh and Zhao [Rand Struc Alg 23 (2003), 180205]. 2011 Wiley Periodicals, Inc. J Graph Theory

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

graph packing
regularity lemma
blow-up lemma


Fusing ant colony optimization with Lagrangian relaxation for the multiple-choice multidimensional knapsack problem The multiple-choice multidimensional knapsack problem (MMKP) concerns a wide variety of practical problems. It is strongly constrained and NP-hard; thus searching for an efficient heuristic approach for MMKP is of great significance. In this study, we attempt to solve MMKP by fusing ant colony optimization (ACO) with Lagrangian relaxation (LR). The algorithm used here follows the algorithmic scheme of maxmin ant system for its outstanding performance in solving many other combinatorial optimization problems. The Lagrangian value of the item in MMKP, obtained from LR, is used as the heuristic factor in ACO since it performs best among the six domain-based heuristic factors we define. Furthermore, a novel infeasibility index is proposed for the development of a new repair operator, which converts possibly infeasible solutions into feasible ones. The proposed algorithm was compared with four existing algorithms by applying them to three groups of instances. Computational results demonstrate that the proposed algorithm is capable of producing competitive solutions.

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

ant colony optimization
lagrangian relaxation


Computation of the minimum data storage and applications in memory management for multimedia signal processing The amount of the data storage in signal processing systems, whose behavior is described by loop-organized algorithmic specifications, has an important impact on the overall energy consumption, chip area, as well as system performance. This paper presents a methodology based on lattices [25] which can be used to address several memory management tasks for applications with high-level specifications, where the main data structures are multidimensional arrays. This methodology was used in the past for the exact computation of the minimum data storage in applications with procedural, affine specifications [2]. The paper discusses two applications of that technique in the memory management of data-dominated signal processing systems: (1) the evaluation of the impact of loop transformations on the data storage, and (2) the assessment and efficient implementation of models of mapping multidimensional signals into the physical memory.

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

memory management
loop transformations
multimedia signal processing

memory size computation
signal-to-memory mapping


Towards unrestricted lip reading Lip reading provides useful information in speech perception and language understanding, especially when the auditory speech is degraded. However, many current automatic lip reading systems impose some restrictions on users. In this paper, we present our research efforts in the Interactive System Laboratory, towards unrestricted lip reading. We first introduce a top-down approach to automatically track and extract lip regions. This technique makes it possible to acquire visual information in real-time without limiting the user's freedom of movement. We then discuss normalization algorithms to preprocess images for different lightning conditions (global illumination and side illumination). We also compare different visual preprocessing methods such as raw image, Linear Discriminant Analysis (LDA), and Principle Component Analysis (PCA). We demonstrate the feasibility of the proposed methods by the development of a modular system for flexible human-computer interaction via both visual and acoustic speech. The system is based on an extension of the existing state-of-the-art speech recognition system, a modular Multiple State-Time Delayed Neural Network (MS-TDNN) system. We have developed adaptive combination methods at several different levels of the recognition network. The system can automatically track a speaker and extract his/her lip region in real-time. The system has been evaluated under different noisy conditions such as white noise, music, and mechanical noise. The experimental results indicate that the system can achieve up to 55% error reduction using visual information in addition to the acoustic signal.

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

lip reading
speech recognition
neural network

face tracking
multimodal human computer interaction.


Analysis of Shortest Path Routing for Large Multi-Hop Wireless Networks In this paper, we analyze the impact of straight line routing in large homogeneous multi-hop wireless networks. We estimate the nodal load, which is defined as the number of packets served at a node, induced by straight line routing. For a given total offered load on the network, our analysis shows that the nodal load at each node is a function of the node's Voronoi cell, the node's location in the network, and the traffic pattern specified by the source and destination randomness and straight line routing. In the asymptotic regime, we show that each node's probability that the node serves a packet arriving to the network approaches the products of half the length of the Voronoi cell perimeter and the load density function that a packet goes through the node's location. The density function depends on the traffic pattern generated by straight line routing, and determines where the hot spot is created in the network. Hence, contrary to conventional wisdom, straight line routing can balance the load over the network, depending on the traffic patterns.

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

geometric probability
multi-hop wireless network
simulations


Inductive Defense for Sceptical Semantics of Extended Argumentation An abstract argumentation framework may have many extensions. Which extension should be adopted as the semantics depends on the sceptical attitudes of the reasoners. Different degrees of scepticism lead to different semantics ranging from the grounded extension as the most sceptical semantics to preferred extensions as the least sceptical semantics. Extending abstract argumentation to allow attacks to be attacked, subjects attacks to argumentation and hence gives rise to a new dimension of scepticism for characterizing how sceptically attacks are accepted. In this article, we present a semantics based on the notion of inductive (grounded) defense of attacks which is sceptical towards the acceptance of attacks but credulous towards the acceptance of arguments. We show that the semantics preserves fundamental properties of abstract argumentation including the monotonicity of the characteristic function. We further show that any extension of the semantics proposed by Gabbay; Baroni, Cerutti, Giacomin and Guida; and Modgil contains a sceptical part being an extension of our semantics, and a credulous part resulted from its credulousness towards the acceptance of attacks. We then introduce a stratified form of extended argumentation which still allows an unbounded number of levels of attacks against attacks while assuring that all proposed semantics coincide. In this article, we also develop a sound and complete dialectical proof procedure for the presented semantics following a model of dispute that alternates between argumentation to accept arguments and to accept attacks.

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

inductive defense
extended argumentation


Simple tests for peakedness, fat tails and leptokurtosis based on quantiles The conventional test for leptokurtosis is based on the fourth moment of the standardized sample. This test suffers from various weaknesses: It cannot account for peakedness and fat tails separately and it is extremely sensitive with respect to outliers resulting in a lack of robustness concerning the error of the first kind. We suggest alternative tests for fat tails, peakedness and leptokurtosis. They are based on selector statistics as introduced by Hogg. Quantiles of the test statistics under normality for sample sizes of up to 2000 are derived by Monte-Carlo simulation. The asymptotic distribution is derived analytically as well. We apply the tests to daily, weekly and monthly asset returns of three German stocks. One can conclude that the new tests give a much more subtle picture of the structure of leptokurtosis in the data than the conventional test.

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

heavy tails
return distribution
?-robustness
validity robustness


Justification logics, logics of knowledge, and conservativity Several justification logics have been created, starting with the logic LP, (Artemov, Bull Symbolic Logic 7(1): 1-36, 2001). These can be thought of as explicit versions of modal logics, or of logics of knowledge or belief, in which the unanalyzed necessity (knowledge, belief) operator has been replaced with a family of explicit justification terms. We begin by sketching the basics of justification logics and their relations with modal logics. Then we move to new material. Modal logics come in various strengths. For their corresponding justification logics, differing strength is reflected in different vocabularies. What we show here is that for justification logics corresponding to modal logics extending T, various familiar extensions are actually conservative with respect to each other. Our method of proof is very simple, and general enough to handle several justification logics not directly corresponding to distinct modal logics. Our methods do not, however, allow us to prove comparable results for justification logics corresponding to modal logics that do not extend T. That is, we are able to handle explicit logics of knowledge, but not explicit logics of belief. This remains open.

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

modal logic
logic of knowledge
justification logic


Optimal block-type-decodable encoders for constrained systems A constrained system is presented by a finite-state labeled graph. For such systems, we focus on block-type-decodable encoders, comprising three classes known as block, block-decodable, and deterministic encoders. Franaszek gives a sufficient condition which guarantees the equality of the optimal rates of block-decodable and deterministic encoders for the same block length. In this paper, we introduce another sufficient condition, called the straight-line condition, which yields the same result. Run-length limited RLL(d, k) and maximum transition run MTR(j, k) constraints are shown to satisfy both conditions. In general, block-type-decodable encoders are constructed by choosing a subset of states of the graph to be used as encoder states. Such a subset is known as a set of principal states. For each type of encoder and each block length, a natural problem is to find a set of principal states which maximizes the code rate. We show how to compute the asymptotically optimal sets of principal states for deterministic encoders and how they are related to the case of large but finite block lengths. We give optimal sets of principal states for MTR(j, k)-block-type-decodable encoders for all code-word lengths. Finally we compare the code rate of nonreturn to zero inverted (NRZI) encoders to that of corresponding nonreturn to zero (NRZ) and signed NRZI encoders.

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

maximum transition run system
precoding
run-length-limited (rll) system


Virus propagation power of the dynamic network With the development of mobile networks, propagation characteristics and defense mechanism of the virus have attracted increasing research attention. But current researches are mainly concerned with static network topology or community structure and some studies focus on characteristics of virus and malware. Little attention is paid to the influence of dynamic changes of network topology to virus propagation. Meanwhile, many studies focus on the threshold rate of the infection (or the immunization rate) for virus outbreak. In this paper, we present a new way to assess and restrain virus propagation by proposing the concepts of propagation power and propagation structure. Three basic propagation structures are presented through which the infection risk can be quantified, and a framework is proposed to assess the impact of virus propagation in different network structures. The relationship between the speed of virus propagation and network structure is also explored. An algorithm is designed to assess the propagation power in a dynamic network with no need to redetect the community under the dynamic network which may significantly improve the efficiency of assessment in a large-scale dynamic network. This study offers a feasible approach for quantifying the risk of virus infection in the network community which is valuable for designing and optimizing the virus defense systems.

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

virus restraint
basic propagation structure


Evaluating supplier performance using DEA and piecewise triangular fuzzy AHP Data envelopment analysis (DEA) has been widely applied in evaluating multicriteria decision making problems, which have multi-input and multi-output. However, the traditional DEA method does neither take the decision maker's subjective preferences to the individual criteria into consideration nor rank the selected options or decision making units (DMUs). On the other hand, Satty's analytical hierarchy process (AHP) was established to rank options or DMUs under multi-input and multi-output through pairwise comparisons. However, in most cases, the AHP pairwise comparison method is not perfectly consistent, which may give rise to confusions in determining the appropriate priorities of each criterion to be considered. The inconsistency implicates the fuzziness in generating the relative important weight for each criterion. In this paper, a novel method, which employs both DEA and AHP methods, is proposed to evaluate the overall performance of suppliers' involvement in the production of a manufacturing company. This method has been developed through modifying the DEA method into a weighting constrained DEA method by using a piecewise triangular weighting fuzzy set, which is generated from the inconsistent AHP comparisons. A bias tolerance ratio (BTR) is introduced to represent the varying but restrained weighting values of each criterion. Accordingly, the BTR provides the decision maker a controllable parameter by tightening or loosening the range of the weighting values in evaluating the overall performance of available suppliers, which in hence, overcomes the two weaknesses of the traditional DEA method.

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

data envelopment analysis (dea)
piecewise triangular fuzzy set
analytical hierarchy process (ahp)
supplier evaluation


An improved localization algorithm with wireless heartbeat monitoring system for patient safety in psychiatric wards Psychiatric patients often require continuous monitoring to keep them out of dangerous situations. Accordingly, hospitals hire additional staff to monitor patients' vital signs, maintain patient safety, and ensure that patients do not leave the hospital without notice. However, ward staff have difficulty knowing whenever a psychiatric patient is stepping into potential danger zones or encountering any safety threat. This paper reports the development of a wireless monitoring system to improve patient safety in psychiatric wards and reduce avoidable risks. The proposed system can ease the workload of nurses, help locate patients, and monitor patients' heartbeats. A two-step clustering localization algorithm is proposed for use in tracking patients' locations. This study marks for the first time that heartbeat detection using a ZigBee-based platform with localization function has been proposed. A proof-of-concept system is developed to understand the current hardware challenges and to enable functional analysis of the proposed ZigBee-based patient localization system. The error distance of the proposed localization algorithm is approximately 1m. Its location accuracy is 90% with the error distance of up to 3m. The proposed system is expected to improve patient safety significantly in psychiatric wards at low cost.

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

wireless sensor network
healthcare
data mining


Moments of utility functions and their applications This paper presents moments and cross-moments of utility functions and measures of utility dependence. We start with an interpretation of the nth moment of a utility function, and describe methods for its assessment in practice and consistency checks that need to be satisfied for any assessed moments. We then show how moments of a utility function (i) provide a new method to determine the parameters of a given functional form of a utility function and (ii) to derive the functional form of a utility function that satisfies some given moment assessments. Next, we derive a fundamental formula that relates the expected utility of a joint distribution to the expected utility of the marginal distributions for multiattribute utility functions. We use this formulation to provide an intuitive interpretation for cross-moments of utility functions and illustrate their use in (i) constructing multiattribute utility functions that incorporate utility dependence and (ii) in providing necessary conditions for utility independence in decisions with multiple attributes. We end with a new measure of utility dependence for multiattribute utility functions and work through several examples to illustrate the approach.

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


Mobile Multigigabit Indoor Optical Wireless Systems Employing Multibeam Power Adaptation and Imaging Diversity Receivers In this paper, we introduce two novel methods (beam power adaptation and diversity imaging) to the design of optical wireless systems to improve link performance. The aim is to reduce the effect of intersymbol interference and to enhance the signal-to-noise ratio (SNR), thus enabling the system to achieve mobility while operating at high bit rates. In good agreement with previous work, the results show that the imaging conventional diffuse system (CDS) with maximum ratio combining (MRC) offers 20 dB better SNR than the nonimaging CDS. The new adaptive line strip multibeam system (ALSMS) with a new imaging diversity receiver provides an SNR improvement of 39 dB over the imaging diversity CDS when both systems employ MRC and operate at 30 Mbits/s. This result illustrates the SNR improvement achieved through the use of our adaptive algorithm coupled with spot diffusing. The lower bit rate, 30 Mbits/s. facilitates comparison with previous work. The results also indicate that the combination of transmit power adaptation and spot diffusing coupled with imaging diversity receivers can enable fully mobile 2.5 Gbit/s optical wireless communication. Such a 2.5 Gbit/s system (imaging MRC ALSMS) achieved an SNR improvement of 27 dB over a lower data rate, 30 Mbits/s. nonimaging CDS.

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

signal-to-noise ratio (snr)
imaging diversity detection


Resultants for unmixed bivariate polynomial systems produced using the Dixon formulation A necessary and sufficient condition on the support of a generic unmixed bivariate polynomial system is identified such that for polynomial systems with such support, the Dixon resultant formulation produces their resultants. It is shown that Sylvester-type matrices, called Dixon dialytic matrices, can also be obtained for such polynomial systems. These results are shown to be a generalization of related results reported by Chionh as well as Zhang and Goldman. For a support not satisfying the above condition, the degree of the extraneous factor in the projection operator computed by the Dixon formulation is calculated by analyzing how much the support deviates from a related rectangular support satisfying the condition. This degree estimate is an upper bound on the degree of the extraneous factor in the case when the polynomial system with a given unmixed support is generic. The concept of a support hull interior point of a support is introduced. A generic inclusion of terms corresponding to support hull interior points in an unmixed polynomial system is shown not to affect the degree of the projection operator computed by the Dixon construction. It is shown that the proposed construction for Dixon dialytic matrices works especially well for mixed bivariate systems. Good Sylvester-type matrices can be constructed by solving an optimization problem on their supports (by translating supports so that they have maximal overlap). The determinant of such a matrix gives a projection operator with a low degree extraneous factor, i.e. the degree of the extraneous factor in a projection operator computed from the original polynomial system is at least as much as the degree of the extraneous factor in a projection operator computed from the corresponding translated polynomial system. The results are illustrated on a variety of examples.

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

bzoutian
support hull
dialytic method
sylvester-type matrices


accurate histogram-based xml summarization In this paper, we propose the use of histograms to characterize node set distributions in an XML document, which then can be recursively evaluated for query optimization tasks. We identify and deal with special cases for effectively using histograms to summarize structural aspects of XML documents. To reveal the potential of our approach, we perform comparative experiments on our native XML database management system called XTC.

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

xml query processing
hierarchical summarization
selectivity estimation


Distributed self-stabilizing placement of replicated resources in emerging networks Emerging large scale distributed networking systems, such as P2P file sharing systems, sensor networks, and ad hoe wireless networks, require replication of content, functionality, or configuration to enact or optimize communication tasks. The placement of these replicated resources can significantly impact performance. We present a novel self-stabilizing, fully distributed, asynchronous, scalable protocol that can be used to place replicated resources such that each node is "close" to some copy of any object. We describe our protocol in the context of a graph with colored nodes, where a node's color indicates the replica/task that it is assigned. Our combination of theoretical results and simulation prove stabilization of the protocol, and evaluate its performance in the context of convergence time, message transmissions, and color distance. Our results show that the protocol generates colorings that are close to the optimal under a set of metrics, making such a protocol ideal for emerging networking systems.

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


Molecular mechanisms in evolutionary cardiology failure Integration of the relevant evolutionary paradigm in cardiology has not yet been fully achieved: In the past, heart failure (HF) was mainly ascribed to infections, and the origins of cardiac hypertrophy (CH) were regarded as mechanical. Recent changes in lifestyle have both reduced the incidence of infections and increased lifespan, and HF is now seen as a complex diseaseone that is still caused by mechanical disorder, but also associated with ischemia and senescence. The long-held view that CH serves to restore myocardial economy back to normal is still valid. The adaptive process is characterized by a quantitative and a qualitative fetal gene reprogramming, which is now being confirmed by recent advances in microRNA research. It underscores the fact CH is the physiologic reaction of the heart to a pathologic stimulus. The goal for therapy is economic, not inotropic. Another major issue is myocardial fibrosis, a major determinant of diastolic function and arrhythmias. Recent changes in lifestyle have crucially modified the context in which HF occurs.

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

heart failure
cardiac hypertrophy
microrna
fibrosis

fetal hypothesis
wall stress hypothesis
laplace's law
aldosterone
evolution
darwinian or evolutionary medicine


Task Types for Pervasive Atomicity Atomic regions are an important concept in correct concurrent programming: since atomic regions can be viewed as having executed in a single step, atomicity greatly reduces the number of possible interleavings the programmer needs to consider. This paper describes a method for building atomicity into a programming language in an organic fashion. We take the view that atomicity holds for whole threads by default, and a division into smaller atomic regions occurs only at points where an explicit need for sharing is needed and declared. A corollary of this view is every line of code is part of some atomic region. We define a polymorphic type system, Task Types, to enforce most of the desired atomicity properties statically. We show the reasonableness of our type system by proving that type soundness, isolation invariance, and atomicity enforcement properties hold at run time. We also present initial results of a Task Types implementation built on Java.

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

design
languages
theory
type systems
sharing-aware programming


INTERPRETATION OF THE GENERALIZED ZIPF-MANDELBROT LAW PARAMETERS This article provides an interpretation of the parameters of the generalized Zipf-Mandelbrot law, which the authors have called the generalized range-frequency law which has been developed in 2009. Said law models the distribution of frequencies of words in school textbooks obtained using a Pearson system. The significance of the parameters gathered was obtained by analyzing certain variables. The fact that the statistical law can be applied to texts written using natural language means that it may be applicable to ecological models, these being considered as a particular case of mathematical models written as texts in a formal language, as developed in 1999. After establishing certain hypotheses regarding the significance of the parameters of the generalized law obtained for natural language, this study was designed to analyze whether this law is applicable to models considered as texts written in formal language. If this were so, the law would be a very useful tool for comparing models.

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


Energy-synchronized computing for sustainable sensor networks To ensure sustainable operations of wireless sensor systems, environmental energy harvesting has been regarded as one of the most fundamental solutions for long-term applications. In energy-dynamic environments, energy conservation is no longer considered necessarily beneficial, because energy storage units (e.g., batteries or capacitors) are limited in capacity and leakage-prone. In contrast to legacy energy conservation approaches, we aim at energy-synchronized computing for wireless sensor devices. The starting point of this work is TwinStar, which uses ultra-capacitor as the only energy storage unit. To efficiently use the harvested energy, we design and implement leakage-aware feedback control techniques to match the activities of sensor nodes with dynamic energy supply from environments. We conduct system evaluation under both indoor and outdoor typical real-world settings. Results indicate our leakage-aware energy-synchronized control can effectively utilize energy that could otherwise leak away.

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


Reactive firewalls - a new technique Firewalls are a well-established and integral part of network security. However, in most situations firewalls are configured according to a set of static rules based upon a policy. To date, development in firewall architectures which can react to attacks such as those demonstrated by the Nimda virus are very limited. Yet it is essential that firewalls are able to cope with and react to such attacks. The idea of a firewall changing or adapting its rules in the face of adverse situations is proposed and demonstrated by way of a prototype in this paper. This new concept of rule adaptation permits security management beyond conventional stateful connection tracking, and incorporates the overall system state as well as the effects of multiple connections. (C) 2003 Elsevier Science B.V. All rights reserved.

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

packet filter
application proxy
stateful packet filter
firewall architecture
conditional firewall rules
token bucket
iptables


Moment invariants for recognition under changing viewpoint and illumination Generalised color moments combine shape and color information and put them on an equal footing. Rational expressions of such moments can be designed, that are invariant under both geometric deformations and photometric changes. These generalised color moment invariants are effective features for recognition under changing viewpoint and illumination. The paper gives a systematic overview of such moment invariants for several combinations of deformations and photometric changes. Their validity and potential is corroborated through a series of experiments. Both the cases of indoor and outdoor images are considered, as illumination changes tend to differ between these circumstances. Although the generalised color moment invariants are extracted from planar surface patches, it is argued that invariant neighbourhoods offer a concept through which they can also be used to deal with 3D objects and scenes.

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

color
moment invariants
recognition
illumination changes


predictive rule discovery from electronic health records Automated procedures are described for discovering predictive rules from electronic health records. These patient records are structured, but are not collected relative to any targeted labels or study objectives. The learning methods cycle through all features, simulating labels and converting the problem from unlabeled learning to supervised classification and regression. Each feature in turn is processed as a simulated label, and a prediction is made from the remaining features. Using a decision-rule representation for knowledge extraction, machine learning techniques are applied to a large collection of electronic health records. Many rules are readily induced with significant predictive performance. By formulating the rules as queries to a web search engine, and then counting hit frequencies, we show how medical researchers can assess and rank potential for new insight among a collection of empirically strong associations.

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

literature search
clinical analytics
decision rule discovery


characteristics of workloads used in high performance and technical computing This paper provides a systematic comparison of various characteristics of computationally-intensive workloads. Our analysis focuses on standard HPC benchmarks and representative applications. For the selected workloads we provide a wide range of characterizations based on instruction tracing and hardware counter measurements. Each workload is analyzed at the instruction level by comparing the dynamic distribution of executed instructions. We also analyze memory access patterns including various aspects of cache utilization and locality properties of address distributions. Since prefetching plays an important role in the performance of computational workloads, we explore the prefetching potential and for parallel workloads we study the sharing properties of memory accesses. For the purpose of completeness, HPC workloads are compared to two commonly used commercial computing benchmarks. The results of this work show that the HPC application space is surprisingly diverse, with some codes showing similar data sharing and locality properties with commercial applications. The wide range of studies presented in this paper are instrumental in uncovering the diversity of this application space.

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

prefetching applications analysis performance paper access hpc locality sharing role cache diversity space workload parallel dynamic instruction hardware

measurement
traces
characterization
instruction decomposition
software prefetch
benchmark
computation
high-performance
addressing
standardization
instrument
comparisons
exploration
pattern
cache coherency
data sharing
aspect
workload characterization
memorialized
distributed
data locality


enhancing keyword-based botanical information retrieval with information extraction Keyword-based retrieval matches search terms and documents via term co-occurrence. Such an approach does not allow matching based on the specific plant characteristic descriptions that are often used in botanical text retrieval. This study applies information extraction techniques to automatically extract plant characteristic information from text and allows users to search using such information in combination with keywords. An evaluation experiment was conducted using actual users. The results indicate that this approach enhances task-based retrieval performance.

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

information retrieval
information extraction
botanical text retrieval


Non-photorealistic rendering for aesthetic virtual environments The line integral convolution (LIC) method, originally developed for imaging vector fields in scientific visualization, has the potential to produce images with directional characteristics. In this paper, we present four techniques to explore the use of LIC in generating images in the style of the Impressionists. In particular, we develop an Impressionist Line Integral Convolution algorithm (ILIC) to generate images with impressionist styles. This algorithm takes advantage of directional information given by a photographic image, incorporates a shading technique to blend cool and warm colors into the image, and finally applies the revised LIC method to imitate artists, paintings done in impressionist styles. Furthermore, we propose a color fidelity technique, which takes advantage of the cool-to-warm scheme, initiating artists' conventional painting to enhance visual depth perception. We also present an information preservation technique, which quantifies image details to control the convolution length, making it possible to preserve subtle information during the convolution process. Finally, we demonstrate a top-down sampling technique, where a series of artistic mip-maps is generated to construct aesthetic virtual environments. These maps provide constant strokes with directional cues, thus achieving frame-to-frame coherence in an interactive walkthrough system, Both the silhouette drawing and tour into the Picture (TIP) approaches are employed to enhance the user's immersion in a virtual world. The experimental results demonstrate the merits of our techniques in generating images in impressionist styles and constructing an interactive walkthrough system that provides an immersion experience rendered in painting styles.

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

line integral convolution method
non-photorealistic rendering
vector field
aesthetic virtual environment
artistic mip-map


On the asynchronous information embedding for event-driven systems in molecular communications Molecular communications is emerging as a promising paradigm for nanoscale communications in nanotechnology. Though still at an early stage, research efforts have been devoted and various molecular communication systems have been proposed. However, each proposed system possesses a specific structure to achieve communications in its own way. To our best knowledge, no unified system description exists so far. In this paper, we propose an abstract system structure called an event-driven system; a significant group of molecular communication systems can be classified into such an abstract form. We define event-driven systems and further show that, for these systems, there is a signaling scheme called asynchronous information embedding which carries additional information while at the same time keeping the original communication mechanisms uninfluenced. Instead of investigating asynchronous information embedding in full generality, we consider synchronous type-based systems as a demonstrative example which still captures most of the features. For such type-based systems, we develop an approximation method for obtaining the channel capacity as a general performance measure. Numerical results are provided to show the capacity gain of asynchronous information embedding.

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

molecular communications
asynchronous
channel capacity


An integrated strategy for the hierarchical multilevel MINLP synthesis of overall process flowsheets using the combined synthesis/analysis approach This paper describes an integrated strategy for a hierarchical multilevel mixed-integer nonlinear programming (MINLP) synthesis of overall process schemes using a combined synthesis/analysis approach. The synthesis is carried out by multilevel-hierarchical MINLP optimization of the flexible superstructure, whilst the analysis is performed in the economic attainable region (EAR). The role of the MINLP synthesis step is to obtain a feasible and optimal solution of the multi-D process problem, and the role of the subsequent EAR analysis step is to verify the MINLP solution and in the feedback loop to propose any profitable superstructure modifications for the next MINLP. The main objective of the integrated synthesis is to exploit the interactions between the reactor network, separator network and the remaining part of the heat/energy integrated process scheme. (C) 2004 Elsevier Ltd. All rights reserved.

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

attainable region (ar)
economic attainable region (ear)
concentration attainable region (car)