Designing Fast and Scalable XACML Policy Evaluation Engines Most prior research on policies has focused on correctness. While correctness is an important issue, the adoption of policy-based computing may be limited if the resulting systems are not implemented efficiently and thus perform poorly. To increase the effectiveness and adoption of policy-based computing, in this paper, we propose fast policy evaluation algorithms that can be adapted to support various policy languages. In this paper, we focus on XACML policy evaluation because XACML has become the de facto standard for specifying access control policies, has been widely used on web servers, and is most complex among existing policy languages. We implemented our algorithms in a policy evaluation system called XEngine and conducted side-by-side comparison with Sun Policy Decision Point (PDP), the industrial standard for XACML policy evaluation. The results show that XEngine is orders of magnitude faster than Sun PDP. The performance difference grows almost linearly with the number of rules in an XACML policy. To our best knowledge, there is no prior work on improving XACML policy evaluation performance. This paper represents the first step in exploring this unknown space.

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

web servers
xacml
policy evaluation
access control
policy decision point


Integration of multiple middlewares on a single computing resource ? A concept for the integration of multiple grid middleware systems in a compute facility, such as a Linux cluster, was developed within the D-Grid Integration Project. Its aim was to allow concurrent job submission from different middlewares and execution of the jobs on the same hardware. We describe here our proof-of-concept installation which integrates gLite, Globus Toolkit 4, and UNICORE, as well as storage facilities using dCache and OGSA-DAI.

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

grid computing
resource management
virtual organisation


Enhanced fault tolerant routing algorithms using a concept of balanced ring ? Fault rings can be used to guide messages bypass faulty nodes/links in a fault tolerant interconnection network. However, nodes on the fault ring become hot spots, thus causing uneven distribution of the traffic loads. To avoid such traffic congestion, a concept of the balanced ring is proposed in this paper. The proposed balanced ring, defined as concentric rings of a given fault ring, can be applied to the fault tolerant routing algorithms for mesh and torus topologies. By properly guiding messages to route on the balanced ring and the fault ring, more balanced link utilization and greatly reduced traffic congestion can be achieved on a fault tolerant network. Methods of applying the balanced ring concept to some published fault tolerant routing algorithms are discussed. Proof of deadlock and livelock freedom is also presented. The use of balanced ring does not need to add new virtual channels. The performance of two routing algorithms with and without the balanced ring is simulated and evaluated. The results indicate that routing algorithms with the balanced rings constantly yield larger throughput and smaller latency than those without.

O B I I 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 B I O O O O O O O B I O O O O O O O O O O O O O O B I I I O B O B O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O B I I 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 B I 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 routing algorithms
balanced ring
mesh
torus


Unresolved systems of language equations: Expressive power and decision problems sUnresolved language equations and inequalities with various sets of operations are considered. It is proved that systems of unresolved equations with linear concatenation and Union only, as well as systems with linear concatenation and intersection only, are as expressive as the more general unresolved inequalities with all Boolean operations and unrestricted concatenation: the class of languages defined by unique (least, greatest) solutions of these systems is shown to coincide with the families of recursive (RE, co-RE, resp.) sets, which result extends even to individual equations of the form boolean OR u(j) X-ij nu(j) = w boolean OR boolean OR y(j) X-tj z(j). On the other hand, unresolved equations with different sets of operations are shown to differ in the hardness of their decision problems, and it is demonstrated that several types of unresolved equations cannot effectively simulate each other in spite of the equality of the language families they define. (c) 2005 Elsevier B.V. All rights reserved.

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


A synchronous distance discussion procedure with reinforcement mechanism: Designed for elementary school students to achieve the attending and responding stages of the affective domain teaching goals within a class period Distance education courses must cope with the difficulties imposed by delivering a class at a distance. As most courses only emphasize the cognitive aspects of the class and neglect the course's effect on the students, this gives no help for reaching the affective domain teaching goals. Especially for younger students, in distance education, when younger students are out of the sight of teachers, they could easily be distracted by the environment around them. This research outlines a synchronous discussion procedure with reinforcement mechanism designed for elementary school students to integrate the affective aspects of teaching into distance education within a class period. The mechanism allows teachers to understand students' attitudes within the class and provides instant feedback to the teacher. Learners can also get information about their attitudes and help to reach the affective domain teaching goals of the courses. This mechanism was implemented and investigated. Comparative assessments were made by administering interviews and questionnaires to elementary school students. The results show that the procedure can supervise learners and help them reach the response stage of the affective domain teaching goals. (C) 2008 Elsevier Ltd. All rights reserved.

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

distance education and telelearning
interactive learning environment
computer-mediated-communication
teaching strategies


Microfluidic capture of endothelial progenitor cells in human blood samples We present a method to efficiently trap circulating endothelial progenitor cells (EPCs) in human blood samples by using a microfluidic device with a short cell traveling length. This device consists of a wide channel separated into three parallel parts by two linear arrays of micro-columns. Flow-derivation microstructures are patterned on both up- and down-side walls of the center part of the channel, forcing the cells to encounter the narrowly spaced micro-columns and then be trapped with the help of specified immunological interaction. Both theoretical and experimental data confirmed the reliability of this concept. By using human umbilical cord blood-derived EPCs spiked into a buffer solution or a blood sample, we demonstrate a capture rate of more than 50% for a traveling length of only 1cm, which is clearly advantageous in terms of cell trapping efficiency and image processing speed.

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


Towards scalable and data efficient learning of Markov boundaries We propose algorithms for learning Markov boundaries from data without having to learn a Bayesian network first. We study their correctness, scalability and data efficiency. The last two properties are important because we aim to apply the algorithms to identify the minimal set of features that is needed for probabilistic classification in databases with thousands of features but few instances, e.g. gene expression databases. We evaluate the algorithms on synthetic and real databases, including one with 139.351 features. (C) 2006 Elsevier Inc. 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 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

bayesian networks
feature subset selection


peak to average power ratio of orthogonal spreading codes for multicarrier cdma system Multicarrier CDMA is being proposed as a predominant candidate for future generation wireless mobile communication. One of the major drawbacks of a CDMA system coupled with multicarrier modulation is high value of PAPR due to multicarrier transmission. This PAPR can be effectively controlled through proper selection of a spreading code. The objective of this paper is to perform an exhaustive evaluation and comparison of PAPR for various types of orthogonal spreading codes i.e. Walsh Hadamard codes, Golay Complementary codes, Orthogonal Gold codes and non-orthogonal Gold codes.

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

code division multiple access (cdma)
peak to average power ratio (papr)
multicarrier (mc)


Improving information security awareness and behaviour through dialogue, participation and collective reflection. An intervention study The paper discusses and evaluates the effects of an information security awareness programme. The programme emphasised employee participation, dialogue and collective reflection in groups. The intervention consisted of small-sized workshops aimed at improving information security awareness and behaviour. An experimental research design consisting of one survey before and two after the intervention was used to evaluate whether the intended changes occurred. Statistical analyses revealed that the intervention was powerful enough to significantly change a broad range of awareness and behaviour indicators among the intervention participants. In the control group, awareness and behaviour remained by and large unchanged during the period of the study. Unlike the approach taken by the intervention studied in this paper, mainstream information security awareness measures are typically top-down, and seek to bring about changes at the individual level by means of an expert-based approach directed at a large population, e.g. through formal presentations, e-mail messages, leaflets and posters. This study demonstrates that local employee participation, collective reflection and group processes produce changes in short-term information security awareness and behaviour.

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

information security
awareness
behaviour
participation
intervention study


Establishing user requirements: incorporating gamer preferences into interactive games design In a previous paper we investigated how various aspects of rally/racing game design can be quantified for the development of future titles. This paper explores how gamer preferences can be prioritised, analysed, and incorporated into the design of rally games by structuring information via a technique known as the Analytic Hierarchy Process, so as to allow the data to be put to practical effect by games designers. Combined with other techniques developed by the authors of this paper, the results can be used for a holistic management of the design and development process for many categories of interactive video games.

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

design strategy
design techniques
product design
product development


Development of two-level decision tree-based real-time scheduling system under product mix variety environment Most of the research on machine learning-based real-time scheduling (RTS) systems has been aimed toward product constant mix environments. However, in a product mix variety manufacturing environment, the scheduling knowledge base (KB) is dynamic; therefore, it would be interesting to develop a procedure that would automatically modify the scheduling knowledge when important changes occur in the manufacturing system. All of the machine learning-based RTS systems (including a KB refinement mechanism) proposed in earlier studies periodically require the addition of new training samples and regeneration of new KBs. Hence, previous approaches investigating machine learning-based RTS systems have been confronted with the training data overflow problem and an increase in the scheduling KB building time, which are unsuitable for RTS control. The objective of this paper is to develop a KB class selection mechanism that can be supported in various product mix ratio environments. Hence, the RTS KB is developed by a two-level decision tree (DT) learning approach. First, a suitable scheduling KB class is selected. Then, for each KB class, the best (proper) dispatching rule is selected for the next scheduling period. Here, the proposed two-level DT RTS system comprises five key components: (1) training samples generation mechanism, (2) GA/DT-based feature selection mechanism, (3) building a KB class label by a two-level self-organizing map, (4) DT-based KB class selection module, and (5) DT-based dynamic dispatching rule selection module. The proposed two-level DT-based KB RTS system yields better system performance than that by a one-level DT-based RTS system and heuristic individual dispatching rules in a flexible manufacturing system under various performance criteria over a long period.

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

real-time scheduling
machine learning
decision tree learning
self-organizing map


Documenting young children's technology use: Observations in the home While there has been much interest in children's use of different technologies, research is often done with school-age children in their classrooms. This exploratory research study looks at fifteen preschool children (aged three to five) in Queensland, Australia and their use of different technologies in their own homes. This paper examines data from a checklist of technologies available in the home and video recording data of children's interactions with online technologies and other people captured by parents, which were analyzed using a modified seating sweeps (Given & Leckie 2003) approach to gain a detailed, descriptive analysis of the home environment.

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

preschool children
technology use
home environment


Spatial data availability and its implications for sustainable development of the Brazilian Amazon In the Amazonia region, general policy based on sustainable development must be adopted to counterbalance natural conservation and the needs of people. To discuss and monitor the regional development requires a significant variety of spatial data. However, making data available is not simple and various solutions usually are presented in non-standardized and non-interchangeable databases. This paper presents an overview of spatial data available for the Amazonia region, and initiatives of data dissemination systems, considering various geographical scales and data access. From this general perspective, we discuss some ideas about the importance of spatial data for sustainability and suggest interactive systems that could contribute to local development and environmental conservation. The limitation on the promotion of spatial information and data sharing in Amazonia is neither computational nor technological. Rather, it is a matter of informing those who generate the data about the benefits of knowledge as a public good and promoting collaborative work. Creating a convergent spatial consciousness about the territory, and bringing together every environmental player, is a step towards the discussion and planning of the sustainable development of the Amazonia.

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

amazonia
data dissemination systems
sustainability


Acquiring engineering knowledge from design processes Knowledge management has recently become the focus of public attention in business and engineering. Because knowledge acquisition is situated in the upstream of knowledge management, capturing knowledge is an important step for enterprises to achieve successful knowledge management. We focus on how engineers solve their design problems under given design contexts and propose a novel model and methods to capture knowledge from engineering design processes. Our goal is to acquire know-how knowledge without disrupting the normal design process. A three-layer design process model is introduced to represent generic design processes, and a grammar and extended dynamic programming (GEDP) method is developed based on the process model. GEDP adopts the grammar approach and EDP to automatically identify meaningful clusters, called operations, from primitive design events. Our approach is evaluated through a case study of designing a double-reduction gear system.

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

know-how knowledge
strategic knowledge
three-layer design process model


Concept learning by fuzzy k-NN classification and relevance feedback for efficient image retrieval A new method for combining visual and semantic features in image retrieval is presented. A fuzzy k-NN classifier assigns initial semantic labels to database images. These labels are gradually modified by relevance feedbacks from the users. Experimental results on a database of 1000 images from 10 semantic groups are reported.

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

semantic feature
semantic network
fuzzy classification
content-based image retrieval


Monte Carlo simulations of photohadronic processes in astrophysics A new Monte Carlo program for photohadronic interactions of relativistic nucleons with an ambient photon radiation field is presented. The event generator is designed to fulfill typical astrophysical requirements, but can also be used for radiation and background studies at high energy colliders such as LEP2 and HERA, as well as for simulations of photon induced air showers. We consider the full photopion production cross section from the pion production threshold up to high energies. it includes resonance excitation and decay, direct single pion production and diffractive and non-diffractive multiparticle production. The cross section of each individual process is calculated by fitting experimental data, while the kinematics is determined by the underlying particle production process. We demonstrate that our model is capable of reproducing known accelerator data over a wide energy range. (C) 2000 Elsevier Science B.V. All rights reserved.

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

photon-hadron interactions
resonance production
resonance decay
photoproduction cross section
monte carlo event generator


A GPU-based discrete event simulation kernel The graphic processing unit (GPU) can perform some large-scale simulations in an economical way. However, harnessing the power of a GPU to discrete event simulation (DES) is difficult because of the mismatch between GPU's synchronous execution mode and DES's asynchronous time advance mechanism. In this paper, we present a GPU-based simulation kernel (gDES) to support DES and propose three algorithms to support high efficiency. Since both limited parallelism and redundant synchronization affect the performance of DES based on a GPU, we propose a breadth-expansion conservative time window algorithm to increase the degree of parallelism while retaining the number of synchronizations. By using the expansion method, it can import as many as possible safe' events. The irregular and dynamic requirement for storing the events leads to uneven and sparse memory usage, thereby causing waste of memory and unnecessary overhead. A memory management algorithm is proposed to store events in a balanced and compact way by using a lightweight stochastic method. When events processed by threads in a warp have different types, the performance of gDES decreases rapidly because of branch divergence. An event redistribution algorithm is proposed by reassigning events of the same type to neighboring threads to reduce the probability of branch divergence. We analyze the superiority of the proposed algorithms and gDES with a series of experiments. Compared to a CPU-based simulator on a multicore platform, the gDES can achieve up to 11x, 5x, and 8x speedup in PHOLD, QUEUING NETWORK, and epidemic simulation, respectively.

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

gpu
memory management
event redistribution

parallel discrete event simulation
time management


A Practical-Time Related-Key Attack on the KASUMI Cryptosystem Used in GSM and 3G Telephony Over the last 20 years, the privacy of most GSM phone conversations was protected by the A5/1 and A5/2 stream ciphers, which were repeatedly shown to be cryptographically weak. They are being replaced now by the new A5/3 and A5/4 algorithms, which are based on the block cipher KASUMI. In this paper we describe a new type of attack called a sandwich attack, and use it to construct a simple related-key distinguisher for 7 of the 8 rounds of KASUMI with an amazingly high probability of 2?14. By using this distinguisher and analyzing the single remaining round, we can derive the complete 128-bit key of the full KASUMI with a related-key attack which uses only 4related keys, 226 data, 230 bytes of memory, and 232 time. These completely practical complexities were experimentally verified by performing the attack in less than two hours on a single-core of a PC. Interestingly, neither our technique nor any other published attack can break the original MISTY block cipher (on which KASUMI is based) significantly faster than exhaustive search. Our results thus indicate that the modifications made by ETSIs SAGE group in moving from MISTY to KASUMI made it extremely weak when related-key attacks are allowed, but do not imply anything about its resistance to single-key attacks. Consequently, there is no indication that the way KASUMI is implemented in GSM and 3G networks is practically vulnerable in any realistic attack model.

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

gsm/3g security
related-key
boomerang attack


A nonadaptive NC checker for permutation group intersection We design a nonadaptive NC checker for permutation group intersection, sharpening a result of Blum and Kannan (J. ACM 43 (1995) 269-291). Additionally, we also get non-adaptive NC checkers for some related group-theoretic problems. (C) 2001 Elsevier Science B.V. All rights reserved.

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

program checking
parallel algorithms
interactive proofs
permutation groups


Overview of prior-art cross-lingual information retrieval approaches Prior-art search in patent data has specific properties, which set it apart from other traditional information retrieval processes. One major issue is that patents are usually described in generic terms in order to avoid narrowing down the scope of the inventions. Given the growing amount of patents in different countries using different languages, prior-art search applications nowadays need to find patent claims across languages. This has prompted the current research efforts into how to tackle cross-lingual patent search issues. In this paper, we review the state-of-the art of approaches for cross-lingual prior-art search. This includes cross-lingual information retrieval approaches in general and issues that prevent them from working well for prior-art search. Furthermore, we give a brief overview of existing cross-lingual prior-art search approaches and discuss whether they are able to overcome the problems that traditional cross-lingual retrieval approaches have in this area. Finally, a critical analysis based on this overview is presented and ideas on how to tackle some open research issues in cross-lingual prior-art search are given.

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

international patent classification system


the use of context for correcting garbled english text The paper describes two different methods for using context to correct garbled English text. The first makes use of a dictionary of English words containing their probability of occurrence. The second uses letter digram frequencies to roughly approximate English word probabilities. Probabilities of various letter substitutions are obtained from a confusion matrix of the simulated character recognizer whose operation produced the garbling. This information is combined using a maximum likelihood scheme to obtain word recognition or, if only digram information is available, the recognition of word approximations. In order to test the methods empirically, computer programs were written, and experiments were run using textual material from various sources. Besides a rather limited comparison of the -and-ldquo;dictionary-and-rdquo; and -and-ldquo;digram-and-rdquo; methods on material from a children's primer, a test was made of a combined system on material from newspaper articles and from a book on psychology.

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

character
order
use
test
recognition
psychology
context
text
material
probability
paper
scheme
maximum likelihood

children program method systems simulation dictionaries approximation computation experience comparisons informal


N?-(Carboxymethyl)lysine during the Early Development of Hypertension Advanced glycation end products (AGEs) are associated with hypertension. Whether N?-(carboxymethyl)lysine (CML) contributes to the development of hypertension in young spontaneously hypertensive rats (SHR) remains to be established compared to WKY. We determined blood pressure, renal function, marker for oxidative stress (OS), and CML in young WKY rats and SHR. We found blood pressure was increased in SHR with no difference in renal function and OS compared to WKY. CML was elevated in plasma (2.30.3 vs. 1.30.2?mol/L) and kidney (1.00.1 vs. 0.50.1?mol/L) compared to WKY. Early CML accumulation may contribute to the development of hypertension potentially by inducing early renal inflammation independent of glomerular dysfunction or oxidative stress.

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

hypertension
renal function
oxidative stress

n?-(carboxymethyl)lysine
spontaneously hypertensive rat


Data Collection in Wireless Sensor Networks by Utilizing Multiple Mobile Nodes Data collection is a fundamental and important issue in wireless sensor networks (WSNs). Recent research has shown that using mobile nodes to collect and carry data in WSNs has many advantages over static multi-hop routing. In this paper, we focus on the problem of data collection in WSNs with the minimum mobile nodes. A mobile node can pick up the data cached in a sensor node via one-hop wireless communications when it passes by a point that R meters away from this stationary sensor node. Since the storage capability of sensor node is limited, each mobile node must visit the sensor nodes, that assigned to it, every t seconds to avoid the overflow of sensor data. In order to reduce the cost of mobile nodes, we try to minimize the number of mobile nodes. But, we find that the problem of minimizing the number of mobile nodes required by periodical data collection in WSNs is NP hard. So, we propose a path planning algorithm to reduce the number of mobile nodes as much as possible. Our simulation results show that our approach can notably reduce the number of required mobile nodes as much as 55%.

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


Improved concept drift handling in surgery prediction and other applications The article presents a new algorithm for handling concept drift: the Trigger-based Ensemble (TBE) is designed to handle concept drift in surgery prediction but it is shown to perform well for other classification problems as well. At the primary care, queries about the need for surgical treatment are referred to a surgeon specialist. At the secondary care, referrals are reviewed by a team of specialists. The possible outcomes of this review are that the referral: (i) is canceled, (ii) needs to be complemented, or (iii) is predicted to lead to surgery. In the third case, the referred patient is scheduled for an appointment with a surgeon specialist. This article focuses on the binary prediction of case three (surgery prediction). The guidelines for the referral and the review of the referral are changed due to, e.g., scientific developments and clinical practices. Existing decision support is based on the expert systems approach, which usually requires manual updates when changes in clinical practice occur. In order to automatically revise decision rules, the occurrence of concept drift (CD) must be detected and handled. The existing CD handling techniques are often specialized; it is challenging to develop a more generic technique that performs well regardless of CD type. Experiments are conducted to measure the impact of CD on prediction performance and to reduce CD impact. The experiments evaluate and compare TBE to three existing CD handling methods (AWE, Active Classifier, and Learn++) on one real-world dataset and one artificial dataset. TBA significantly outperforms the other algorithms on both datasets but is less accurate on noisy synthetic variations of the real-world dataset.

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


Deploying a network of smart cameras for traffic monitoring on a city kernel A relevant aspect when evaluating the city smartness is related to the innovative approach to urban traffic management. We present a system called city kernel, designed to handle several subsystems, each addressing a specific sensor network and we describe an infrastructure for wide traffic control via a vision sensor network. This infrastructure consists of a network of smart cameras operating over an outdoor public lighting thanks to power line communication technology and equipped with a vehicle counting and classification algorithm. We discuss the deployment of this network on the city kernel and some related services exposed to urban actors.

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

traffic monitoring
power line communication
city kernel

smart city
sensors networks
urban innovation


Efficient face candidates selector for face detection In this paper an efficient face candidates selector is proposed for face detection tasks in still gray level images. The proposed method acts as a selective attentional mechanism. Eye-analogue segments at a given scale are discovered by finding regions which are roughly as large as real eyes and are darker than their neighborhoods. Then a pair of eye-analogue segments are hypothesized to be eyes in a face and combined into a face candidate if their placement is consistent with the anthropological characteristic of human eyes. The proposed method is robust in that it can deal with illumination changes and moderate rotations. A subset of the FERET data set and the BioID face database are used to evaluate the proposed method. The proposed face candidates selector is successful in 98.75% and 98.6% cases, respectively.

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


agent-based coordination of human-multirobot teams in complex environments Room clearing, in which building surveillance is conducted to search for criminals, continues to be a dangerous and difficult problem in urban settings, for both the military as well as for police. In a typical setting, an unknown number of hostile forces may be located in a building, and they may be armed. Furthermore, there may be innocent civilians. The goal of the friendly units is to enter the room and secure it, but without loss of life of friendly forces, hostile forces, and most especially of innocent civilians. It would be beneficial to allow robots to be a part of the friendly team, however it is very challenging to have robots that do not either slow down or obstruct their human teammate. This is especially difficult since nearly all robots in use by the military and police today are tele-operated. In this paper, we describe work we have developed in cooperation with the army, for the room clearing domain. We constructed an algorithm whereby multiple agents, in the form of robots, can accomplish a room clearing task. We augmented the agent algorithms to introduce Adjustable Autonomy, allowing cooperation with humans. We describe simulated results of the algorithm on building maps, and furthermore we describe how we intend to next conduct hardware tests, and eventual plans to field the system. This agent-based solution has great potential to increase the acceptance and leverage of robotics in complex environments.

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


Using Visual Context and Region Semantics for High-Level Concept Detection In this paper we investigate detection of high-level concepts in multimedia content through an integrated approach of visual thesaurus analysis and visual context. In the former, detection is based on model vectors that represent image composition in terms of region types, obtained through clustering over a large data set. The latter deals with two aspects, namely high-level concepts and region types of the thesaurus, employing a model of a priori specified semantic relations among concepts and automatically extracted topological relations among region types; thus it combines both conceptual and topological context. A set of algorithms is presented, which modify either the confidence values of detected concepts, or the model vectors based on which detection is performed. Visual context exploitation is evaluated on TRECVID and Corel data sets and compared to a number of related visual thesaurus approaches.

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

concept detection
region types
visual context


Robust H-infinity Fuzzy Output Feedback Control for Uncertain Discrete-time Nonlinear Systems In this paper, a generalized non-quadratic Lyapunov function and non-parallel distributed compensation (non-PDC) law are proposed for robust fuzzy control of discrete-time uncertain nonlinear systems. The focus is on designing a robust output feedback observer such that the observer error system is robustly asymptotically stable and has a guaranteed H, performance. A new basis-dependent idea is introduced to solve the fuzzy observer-based control problem, which is different from the quadratic framework that entails fixed matrices for the entire membership function, or the linearly basis-dependent framework that uses linear convex combinations of s matrices. This idea is realized by carefully selecting the structure of the matrices involved in the products with system matrices. Linear matrix inequality (LMI) conditions are obtained for the existence of observer and based on these the results are casted into a convex optimization problem, which can be readily solved via standard numerical software. The effectiveness and the superiority of the proposed approach are demonstrated by two examples borrowed from the literature.

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

takagi-sugeno's fuzzy model
non-quadratic lyapunov function
h-infinity performance
state observer


Use of magnetic monitoring of vehicles for proactive strategy development Passive magnetic method was used to obtain data about vehicles moving direction, velocity, dimensions, clearance. Variety of eight vehicles were used as a research objects in natural environment of urban area. Two different passive magnetic sensors were compared which drastically vary on the purchase price. Possibility of assessing stress in the vehicles body was discussed. Crash experiment data reveals magneto-mechanical phenomena allowing for collision detection.

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

magnetic signature
vehicle identification
crash detection


Set-theoretic Approaches to Granular Computing A framework is proposed for studying a particular class of set-theoretic approaches to granular computing. A granule is a subset of a universal set, a granular structure is a family of subsets of the universal set, and relationship between granules is given by the standard set-inclusion relation. By imposing different conditions on the family of subsets, we can define several types of granular structures. A number of studies, including rough set analysis, formal concept analysis and knowledge spaces, adopt specific models of granular structures. The proposed framework therefore provides a common ground for unifying these studies. The notion of approximations is examined based on granular structures.

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

granular computing
granular structures
rough set analysis
formal concept analysis
knowledge spaces


Increasing the yield from a chemical reactor with spontaneously oscillatory chemical reactions by a nonlinear feedback mechanism Oscillations in chemical reactions are often deemed inexpedient because of their propensity to cause operational complexities. Nevertheless, it has been demonstrated in our previous work that such oscillations need not always be avoided: In fact, it has been shown that the yield of the desired product from an autocatalytic reaction in a continuous stirred-tank reactor can be quadrupled with a linear feedback mechanism. It is highly likely that we can take advantage of such a feedback mechanism for practical application. Thus, an attempt has been made in the current work to enhance the efficacy of this feedback mechanism by imparting nonlinearity to it. This has given rise to roughly as much as a sevenfold increase in the yield of the desired product instead of a fourfold increase without nonlinearity. (C) 2001 Elsevier Science Ltd. All rights reserved.

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 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 B I O O O O O O O O O O O O O O O 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 stirred-tank reactor
autocalculator


mining navigation history for recommendation Although a user's navigation history contains a lot of hidden information about the relationship between web pages and between users, this information is usually not exploited. The information hidden in the history can be an invaluable source of knowledge in assisting a user to better surf the Web. We presented a system which actively monitors and tracks a user's navigation. Once a user's navigation history is captured, we apply data mining techniques to discover the hidden knowledge contained in the history. The knowledge is then used to suggest potentially interesting web pages to users.

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

mining recommendation users web knowledge navigation user

histories
relationships
systems
web page
data mining
tracking
monitor
intelligent user interface
informal


Hybrid Fourier-Vlasov simulation in non-inertial reference frames We present some useful extensions of the spectral Fourier-Vlasov algorithm for simulations of interactions of collisionless plasmas with ion beams. For many practical applications the relative drifts of various particle populations require high resolution of particle distribution functions (PDFs) or the use of large phase space domain, which makes the simulations extremely memory- and time-consuming. We propose using non-inertial reference frames moving in the velocity dimensions for the beam particle distribution functions. As a result, it is possible to simulate plasma-beam interactions at a much lower resolution. This method is particularly suitable for simulations of fast particle beams and plasmas with heavy ion species or cold particle populations. In addition, for simulations of strongly nonlinear instabilities which cause strong plasma heating, the adaptive mesh refinement and phase space reduction are proposed. Contrary to the Vlasov simulation in the real velocity space, plasma heating in the Fourier-inverted space leads to the PDF profile shrinking. Thus, instead of having to extrapolate the PDF into the regions where it was previously undefined, in the Fourier-space, it is sufficient to interpolate the pre-existing solution. (C) 2011 Elsevier B.V. All rights reserved.

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


Multi-Label Learning With Fused Multimodal Bi-Relational Graph The problem of multi-label image classification using multiple feature modalities is considered in this work. Given a collection of images with partial labels, we first model the association between different feature modalities and the images labels. These associations are then propagated with a graph diffusion kernel to classify the unlabeled images. Towards this objective, a novel Fused Multimodal Bi-relational Graph representation is proposed, with multiple graphs corresponding to different feature modalities, and one graph corresponding to the image labels. Such a representation allows for effective exploitation of both feature complementariness and label correlation. This contrasts with previous work where these two factors are considered in isolation. Furthermore, we provide a solution to learn the weight for each image graph by estimating the discriminative power of the corresponding feature modality. Experimental results with our proposed method on two standard multi-label image datasets are very promising.

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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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-based semi-supervised learning
multi-label classification


Numerical construction of optimal adaptive grids in two spatial dimensions This article concerns a new procedure to generate a solution-adaptive grid for convection dominated problems in two spatial dimensions based on finite element approximations. The procedure extends a one-dimensional equidistribution principle which minimizes the interpolation error in appropriate norms. The idea in extending such a technique to two spatial dimensions is to select two directions which can reflect the physics of the problems, and then the one-dimensional equidistribution principle is applied to the chosen directions. The final grids generated are connected through a sweep-line based unstructured grid technique. Model problems considered are the two-dimensional convection-diffusion problems where boundary and interior layers occur. Numerical results of model problems illustrating the efficiency of the proposed scheme are presented. Comparisons of the solutions with an existing scheme will also be provided. (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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

numerical grid generation
adaptive grid generation
convection-diffusion problem
least-square fem
finite element method


A fuzzy multi-criteria decision-making model based on simple additive weighting method and relative preference relation In this article, we combine SAW with relative preference relation in a FMCDM model to solve FMCDM problems. The FMCDM model avoids multiplying two fuzzy numbers into a pooled fuzzy number, and reserves fuzzy information. The FMCDM model based on SAW and relative preference relation to resolve the ties of fuzzy multiplication, aggregation and ranking.

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

fmcdm
fuzzy numbers
model
relative preference relation


centrality metric for dynamic networks Centrality is an important notion in network analysis and is used to measure the degree to which network structure contributes to the importance of a node in a network. While many different centrality measures exist, most of them apply to static networks. Most networks, on the other hand, are dynamic in nature, evolving over time through the addition or deletion of nodes and edges. A popular approach to analyzing such networks represents them by a static network that aggregates all edges observed over some time period. This approach, however, under or overestimates centrality of some nodes. We address this problem by introducing a novel centrality metric for dynamic network analysis. This metric exploits an intuition that in order for one node in a dynamic network to influence another over some period of time, there must exist a path that connects the source and destination nodes through intermediaries at different times. We demonstrate on an example network that the proposed metric leads to a very different ranking than analysis of an equivalent static network. We use dynamic centrality to study a dynamic citations network and contrast results to those reached by static network analysis.

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


implementation of file interpolation detection system Recently we have found a high possibility to encounter file interpolation and Web defacements by vicious crackers and software. It is not easy for us to find such interpolated files because of the numbers and volumes of files are great in computer systems. We need a good tool such as "Tripwire" for that purpose. However, such a system is only for system administrators and not for users. It is also difficult for administrators to set up the configuration file to do the suitable file check. We implemented the file interpolation detection system for both administrators and users. The system detects insertion, deletion, and modification (interpolation) of files. Both administrators and users can check the files concerned to themselves and get the result. Users can update the file specification information in the database by command, then it makes the system possible to avoid finding of the error interpolation. The system can be periodically executed by CRON or on demand by users, and then compares the value of MD5 for each file to detect file interpolation. The system has the command line interface and Web interface. The system first creates the database that contains full path file name, last update time, and values of MD5 according to the information set-upped by users that specifies the location to check for each user. It judges the insertion and deletion of files by the existence and no existence of records in the database. It also judges the file interpolation by the comparison with the value of MD5 for every file. It reports the result by e-mail, in command line interface, or in Web interface.

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


A reconstruction method of projection image on worker honeybees compound eye ? Visual perception by insect compound eyes is of interest in visual science for revealing neuronal principals of vision, and applying their small and simple structures to artificial vision systems. In order to investigate how animal behavior is related to sensory stimuli, it is important to take into account real input signals to the nervous system. In the case of an insect with compound eyes, sceneries projected onto compound eye are the basic signals for visual information processing. In this paper, a method to reconstruct the projected images on the honeybee compound eyes is presented. This method estimates the illuminance change of a single ommatidium surface. It may be applied to analyze the correspondence between input images and retinal responses.

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


Approximate traveling wave solutions for coupled Whitham-Broer-Kaup shallow water Homotopy Perturbation Method (H PM) was used for computing the Coupled Whitham-Broer-Kaup Shallow Water. Then HPM solution verified against exact one and compared with another approximate solution, the Homotopy Analysis Method (HAM). The existent error of the methods computed and convergence of the HPM solution has presented. Results reveal that HPM is an effective and powerful in solving the non-linear systems in mechanic, analytically. (C) 2010 Elsevier Ltd. All rights reserved.

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

homotopy perturbation method
traveling wave
approximate solution

shallow water equation (swe)
coupled whitham-broer-kaup (wbk)
approximate long wave (alw)


Solving the bi-objective personnel assignment problem using particle swarm optimization ? A particle swarm optimization (PSO) algorithm combined with the random-key (RK) encoding scheme (named as PSORK) for solving a bi-objective personnel assignment problem (BOPAP) is presented. The main contribution of this work is to improve the f1_f2 heuristic algorithm which was proposed by Huang et al. [3]. The objective of the f1_f2 heuristic algorithm is to get a satisfaction level (SL) value which is satisfied to the bi-objective values f1, and f2 for the personnel assignment problem. In this paper, PSORK algorithm searches the solution of BOPAP space thoroughly. The experimental results show that the solution quality of BOPAP based on the proposed method is far better than that of the f1_f2 heuristic algorithm.

O O O O O O O B I I O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 macaulay 2 package for computing sum of squares decompositions of polynomials with rational coefficients In recent years semideffinite programming (SDP) has become the standard technique for computing sum of squares (SOS) decompositions of nonnegative polynomials. Due to the nature of the underlying methods, the solutions are computed numerically, and thus are never exact. In this paper we present a software package for Macaulay 2, which aims at computing an exact SOS decomposition from a numerical solution.

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

sum of squares
semideffinite programming

symbolic/numerical methods
algebraic geometry


The Compressed Feature Matrix - a novel descriptor for adaptive similarity search The Compressed Feature Matrix (CFM) is a new molecular descriptor for adaptive similarity searching. Depending on the requirements, it is based on a distance or geometry matrix. Thus, the CFM permits topological and three-dimensional comparisons of molecules. In contrast to the common distance matrix, the CFM is based on features instead of atoms. Each kind of these features may be weighted separately, depending on its (estimated) contribution to the biological effect of the molecule. In this work, we show that the CFM allows us to adapt similarity evaluations to particular ligands as well as to classification requirements. The CFM method is analyzed regarding correctness, adaptivity and speed. Applying the basic setting of feature weights, the similarity evaluations using the CFM on the one hand and the Tanimoto coefficient together with MACCS Keys on the other yield similar results. However, in contrast to the latter method, the CFM even permits us to focus on small parts of molecules to serve as a basis for similarity. Accordingly, we have achieved striking results not only by readjusting the feature weights with regard to the scaffold but also to the side chain of the respective target. The results of the latter run turned out to be rather independent of the molecular scaffold. Hence, the CFM is suitable not only for common similarity evaluation, but also for techniques such as lead or scaffold hopping.

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


Application-specific garbage collection ? ?? Prior work, including our own, shows that application performance in garbage collected languages is highly dependent upon the application behavior and on underlying resource availability. We show that given a wide range of diverse garbage collection (GC) algorithms, no single system performs best across programs and heap sizes. We present a Java Virtual Machine extension for dynamic and automatic switching between diverse, widely used GCs for application-specific garbage collection selection. We describe annotation-guided, and automatic GC switching. We also describe a novel extension to extant on-stack replacement (OSR) mechanisms for aggressive GC specialization that is readily amenable to compiler optimization.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 O O O O O O O O O O O O O O O O O O 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-specific garbage collection
dynamic gc selection
adaptive garbage collection


Object extraction scheme and protocol for energy efficient image communication over wireless sensor networks ? To date, wireless sensor networks lack the most powerful human sense vision. This is largely due to two main problems: (1) available wireless sensor nodes lack the processing capability and energy resource required to efficiently process and communicate large volume of image data and (2) the available protocols do not provide the queue control and error detection capabilities required to reduce packet error rate and retransmissions to a level suitable for wireless sensor networks. This paper presents an innovative architecture for object extraction and a robust application-layer protocol for energy efficient image communication over wireless sensor networks. The protocol incorporates packet queue control mechanism with built-in CRC to reduce packet error rate and thereby increase data throughput. Unlike other image transmission protocols, the proposed protocol offers flexibility to adjust the image packet size based on link conditions. The proposed processing architecture achieves high speed object extraction with minimum hardware requirement and low power consumption. The system was successfully designed and implemented on FPGA. Experimental results obtained from a network of sensor nodes utilizing the proposed architecture and the application-layer protocol reveal that this novel approach is suitable for effectively communicating multimedia data over wireless sensor networks.

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

wireless sensor networks
image communication
object extraction

energy efficiency
field programmable gate array (fpga)


co-evolutionary differential evolution with dynamic population size and adaptive migration strategy As the performance of differential evolution (DE) is significantly affected by its mutation schemes and parameter settings when solving different problems, this paper proposes a simple yet efficient co-evolutionary DE (CEDE) to enhance the algorithm performance. The CEDE algorithm uses multiple populations to optimize the problem cooperatively, with each population using different operators and/or different parameters. Moreover, as different populations may show different performance on the same problem, we further design an efficient adaptive migration strategy (AMS) to dynamically control the population size of different populations. The CEDE algorithm is tested and compared on four benchmark functions. Experimental results demonstrate the good performance of CEDE when compared with conventional DEs using different operators and/or parameters.

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

dynamic population size
adaptive migration strategy

differential evolution (de)
co-evolutionary algorithm


Fast decomposition of digital curves into polygons using the Haar transform The perimeters of features in digital images are decomposed into sets of straight lines using the Haar transform. The Haar basis functions preserve sharp changes in direction along the perimeter while still allowing smoothing. The coefficients of the Haar transform are simply related to the error between the polygonal decomposition and the true perimeter. The Haar transform can be calculated efficiently with a computational overhead linear in the number of data points.

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

haar transform
digital curves
polygonal decomposition


A primaldual algorithm for the economic lot-sizing problem with multi-mode replenishment The classical economic lot-sizing problem assumes that a single supplier and a single transportation mode are used to replenish the inventory. This paper studies an extension of this problem where several suppliers and transportation modes are available. The decision-making process in this case involves identifying (i) the timing for an order; (ii) the choice of shipment modes; and (iii) the order size for each mode. The problem is defined as a network flow problem with multiple setups cost function and additional side constraints. This study provides an MIP formulation for the problem. We also provide an additional formulation of the problem by redefining its decision variables and show that the dual of the corresponding LP-relaxation has a special structure. We take advantage of the structure of the dual problem to develop a primaldual algorithm that generates tight lower and upper bounds. Computational results demonstrate the effectiveness of the algorithm.

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

economic lot-sizing
multi-setups costs
network flows


Solving an urban waste collection problem using ants heuristics This paper describes the methodology that we have applied for the solution of an urban waste collection problem in the municipality of Sant Boi de Llobregat, within the metropolitan area of Barcelona (Spain). The basic nature of the considered problem is that of a capacitated arc routing problem, although it has several specific characteristics, mainly derived from traffic regulations. We present the model that we have built for the problem, which results after an appropriate transformation of the problem into a node routing one. We also present the ant colonies heuristics that we have used to obtain the solutions to the problem. These combine constructive methods, based on nearest neighbor and on nearest insertion, with a local search that explores various neighborhoods. The application of the proposed methods gives results that improve considerably the ones that were previously used in the municipality.

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


Sketching distributed sliding-window data streams While traditional data management systems focus on evaluating single, ad hoc queries over static data sets in a centralized setting, several emerging applications require (possibly, continuous) answers to queries on dynamic data that is widely distributed and constantly updated. Furthermore, such query answers often need to discount data that is stale and operate solely on a sliding window of recent data arrivals (e.g., data updates occurring over the last 24h). Such distributed data streaming applications mandate novel algorithmic solutions that are both time and space efficient (to manage high-speed data streams) and also communication efficient (to deal with physical data distribution). In this paper, we consider the problem of complex query answering over distributed, high-dimensional data streams in the sliding-window model. We introduce a novel sketching technique (termed ECM-sketch) that allows effective summarization of streaming data over both time-based and count-based sliding windows with probabilistic accuracy guarantees. Our sketch structure enables point, as well as inner product, queries and can be employed to address a broad range of problems, such as maintaining frequency statistics, finding heavy hitters, and computing quantiles in the sliding-window model. Focusing on distributed environments, we demonstrate how ECM-sketches of individual, local streams can be composed to generate a (low-error) ECM-sketch summary of the order-preserving merging of all streams; furthermore, we show how ECM-sketches can be exploited for continuous monitoring of sliding-window queries over distributed streams. Our extensive experimental study with two real-life data sets validates our theoretical claims and verifies the effectiveness of our techniques. To the best of our knowledge, ours is the first work to address efficient, guaranteed-error complex query answering over distributed data streams in the sliding-window model.

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

sketches
continuous queries
distributed monitoring


A new multi-objective particle swarm optimization algorithm based on decomposition The diversity of solutions is of great importance for multi-objective evolutionary algorithms. In this paper, a new multi-objective particle swarm optimization algorithm based on decomposition (MPSO/D) is proposed. Firstly, the objective space of a multi-objective problem is decomposed into a set of sub-regions based on a set of direction vectors. Then MPSO/D makes each sub-region have a solution to maintain the diversity. Secondly, considering the convergence of solutions, MPSO/D uses the crowding distance to calculate the fitness values of the reserved solutions for selection operator, and uses the neighboring particles of a particle to determine the global best historical position (gbest) of the particle. The proposed algorithm has been compared with NSGAII, MOEA/D and NNIA on sixteen test sets. The experimental results illustrate that the proposed algorithm outperforms NSGAII, MOEA/D and NNIA in terms of convergence and diversity.

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

particle swarm optimization
decomposition
crowding distance

multi-objective optimization
artificial intelligence


Bounds on the expected length of optimal one-to-one codes In this correspondence, we consider one-to-one encodings for a discrete memoryless source, which are "one-shot" encodings associating a distinct codeword with each source symbol. Such encodings could be employed when only a single source symbol rather than a sequence of source symbols needs to be transmitted. For example, such a situation can arise when the last message must be acknowledged before the next message can be transmitted. We consider two slightly different types of one-to-one encodings (depending on whether the empty codeword is used or not) and obtain lower and upper bounds on the expected length of optimal one-to-one codes. We first give an extension of a known tight lower bound on the expected length of optimal one-to-one codes for the case that the the size of the source alphabet is finite and partial information about the source symbol probabilities is available. As expected, our lower bound is no less than the previously known lower bound obtained without side information about the source symbol probabilities. We then consider the case that the source entropy is available and derive arbitrarily tight lower bounds on the expected length of optimal one-to-one codes. We also derive arbitrarily tight lower bounds for the case that the source entropy and the probability of the most likely source symbol are available. Finally, given that the probability of the most likely source symbol is available, we obtain an upper bound on the expected length of optimal one-to-one codes. Our upper bound is tighter than the best upper bound known in the literature.

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

nonprefix codes
one-to-one codes
source coding


On the applicability of Post's lattice For decision problems Pi(B) defined over Boolean circuits using gates from a restricted set B only, we have Pi(B) <=(AC0)(m) Pi(B') for all finite sets B and B' of gates such that all gates from B can be computed by circuits over gates from B'. In this note, we show that a weaker version of this statement holds for decision problems defined over Boolean formulae, namely that Pi(B) <=(NnC2)(m) Pi(B'boolean OR{boolean AND, boolean OR}) and Pi(B) <=(NC2)(m) Pi(B'boolean OR{0,1}) for all finite sets B and B' of Boolean functions such that all f is an element of B can be defined in B'. (C) 2012 Elsevier B.V. All rights reserved.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 design of feature spaces for pattern classifiers Functional piecewise approximation seeks data representation that is compact, highly simplified and meaningful. This study presents a genetic algorithm (GA)-based approach for computing a piecewise polynomial representation of functions, with the focus being on piecewise linear approximation in an application of biomedical spectral data. The area of piecewise linear approximation has been researched in the past four decades approximately, and the method presented here is compared with another well-known approach. The expansion of this method to piecewise polynomial representation is shown to be straightforward. Finally, the application of this method as a feature extraction method for classification of a dataset of feature vectors, specifically biomedical spectra, is demonstrated.

pattern classification
feature formation and reduction
genetic algorithms
curve fitting


Analytical model for MPEG video frame loss rates and playback interruptions on packet networks This paper presents and studies objective video quality evaluation techniques for a network where frame losses can be considered independent, for example a best effort not heavy loaded packet switching network. The total or partial loss of a frames information affects the quality of video playback, as the frame cannot be decoded and other frames that depend on it cannot be correctly decoded too. Therefore, during some time the video playback has errors in the image and the user will perceive them as interruptions. In this paper, the total number of decoded frames and the video playback interruptions duration will be considered important parameters to quantify the video quality. The analytical formulation for them will be presented and the importance of considering them together will be highlighted.

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

quality of service
quality of experience
video communications
decodable frame rate
video cut durations


Bus dependency matrix of electrical power systems A method for identifying critical nodes for smart and bulk power transmission grid environment is presented in this paper. A new model based on bidirectional power flow is considered. Applicability of these methods in smart grid environment is evaluated. The consequence of removing critical nodes found from the analysis is discussed. The efficacy of bidirectional model is studied through rank similarity analysis.

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

degree centrality
closeness centrality
betweenness centrality


The IgM Response to Modified LDL in Experimental Atherosclerosis Introduction: It is hypothesized that IgM antibodies to oxidized LDL are anti-atherogenic. Myeloperoxidase from plaque-infiltrating neutrophils catalyzes the production of hypochlorite (HOCl), which oxidizes LDL. Here we study the IgM response to HOCl-modified LDL in comparison to titers of T15 clonotypic natural antibodies. Methods: Plasma of LDLR?/? mice fed a normal chow or high-fat diet was obtained after 6 and 16 weeks. The IgM responses to HOCl-modified LDL and T15 clonotypic natural IgM antibodies were measured by ELISA. Results: The IgM levels in response to HOCl-modified LDL increased dramatically in the atherosclerotic group after introduction of the high-fat diet, but not in mice on normal chow. The natural IgM T15 clonotypic antibody titers revealed a more moderate increase during atherogenesis. Conclusion: Our results show that during atherogenesis there is a strong induction of IgM antibodies to HOCl-modified LDL particles. Whether these induced IgM antibodies are pro- or anti-atherogenic remains to be established.

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


a dual-core system solution for wearable health monitors This paper presents a system design study for wearable sensor devices intended for healthcare and lifestyle applications based on ECG, EEG and activity monitoring. In order to meet the low-power requirement of these applications, a dual-core signal processing system is proposed which combines an ultra-low-power bio-medical Application Specific Instruction-set Processor (BioASIP) and a low-power general-purpose micro-controller (MSP430). To validate the merits of the proposed architecture, system-level power analysis and trade-offs are conducted using real hardware measurements of an ECG R-peak detection application. The results show that the proposed dual-core architecture consumes around 65.38W, about 25.8x smaller than an MSP430-only approach. Out of 65.38W, the BioASIP consumes only 11W and the rest is used in the analog front-end, A/D conversion, and control tasks.

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

low power
biomedical processing
system level simulation
wsim


An information dissemination model of product quality and safety based on scale-free networks In the small-world model, information nodes positions are relatively ordered. However, information dissemination between nodes is unordered on the Internet. In this study, a product quality and safety information dissemination model on the Internet is proposed in terms of the characteristics of the scale-free model in the complex network. Using the simulation tests, we found that the information diffusion rate will speed up and the time needed for the system to reach the equilibrium will shorten when the spontaneous dissemination coefficient increases. Additionally, the scope of information coverage also increases as the systems size increases. However, the time of information diffusion needed to cover the maximum area does not change with the systems size. The medias influence has also been found to have an effect on the information dissemination.

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

propagation model
small-world model
scale-free networks


Systemkonsolidierung und Datenmigration als geschftskritische Erfolgsfaktoren Unternehmen, die Fusionen, Zu- oder Verkufen, oder internen Umstrukturierungsvorhaben gegenberstehen, bentigen effiziente und verlssliche Lsungen zur Datenmigration, um die Organisationsstrukturen und Prozesse innerhalb ihrer Systemlandschaft an die betrieblichen Vernderungen anzupassen. Viele Unternehmen stehen auch vor der Herausforderung ihre Systemlandschaft zu harmonisieren und zu konsolidieren, um unternehmensweit einheitliche Strukturen zu etablieren, die Systemkomplexitt zu reduzieren und den Geschftsbetrieb durch Reduzierung von Schnittstellen und redundanten Daten zu verbessern. Der Beitrag geht auf die Anforderungen und Lsungsanstze in Datenmigrations-und Konsolidierungsszenarien im SAP-Umfeld ein und prsentiert zwei erfolgreiche Fallbeispiele von SAP Kunden aus den Branchen Maschinenbau und Automobilindustrie.

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

konsolidierung
standardisierung
harmonisierung
umstrukturierung
restrukturierung
selektive datenmigration nach sap hana
akquisitionen und fusionen


RACECAR: A Heuristic for Automatic Function Specialization on Multi-core Heterogeneous Systems High-performance computing systems increasingly combine multi-core processors and heterogeneous resources such as graphics-processing units and field-programmable gate arrays. However, significant application design complexity for such systems has often led to untapped performance potential. Application designers targeting such systems currently must determine how to parallelize computation, create device-specialized implementations for each heterogeneous resource, and determine how to partition work for each resource. In this paper, we present the RACECAR heuristic to automate the optimization of applications for multi-core heterogeneous systems by automatically exploring implementation alternatives that include different algorithms, parallelization strategies, and work distributions. Experimental results show RACECAR-specialized implementations achieve speedups up to 117x and average 11x compared to a single CPU thread when parallelizing computation across multiple cores, graphics-processing units, and field-programmable gate arrays.

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

algorithms design performance heterogeneous optimization racecar


Engaging consumers online through websites and social media: A gender study of Italian Generation Y clothing consumers We study consumers engagement online through websites and social networking sites and related peer recommendations. Data has been collected from Generation Y consumer segments who shop online. Online shopping via Facebook and website service quality has positive effect on trust. Peer recommendations have a significantly stronger influence on attitudes of females than they do on attitudes of males. Trust has a positive and significant effect on attitude toward e-tailer and loyalty intentions.

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

facebook
online shopping
peer recommendations
trust
gender


Advanced life support therapy on out-of-hospital cardiac arrest patients: Applying signal processing and pattern recognition methods In the US alone, several hundred thousands die of sudden cardiac arrests each year. Basic life support defined as chest compressions and ventilations and early defibrillation are the only factors proven to increase the survival of patients with out-of-hospital cardiac arrest, and are key elements in the chain of survival defined by the American Heart Association. The current cardiopulmonary resuscitation guidelines treat all patients the same, but studies show need for more individualization of treatment. This review will focus on ideas on how to strengthen the weak parts of the chain of survival including the ability to measure the effects of therapy, improve time efficiency, and optimize the sequence and quality of the various components of cardiopulmonary resuscitation.

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

cardiac arrest
cardiopulmonary resuscitation
defibrillation

ventricular fibrillation
ecg analysis
decision support
cpr artefact removal


Sequential co-design of an artifact and its controller via control proxy functions Optimization of a 'smart' product requires optimizing the design of both the physical system, or artifact, and its controller. If the artifact and control optimization are coupled, then a combined approach is typically used in order to produce optimal solutions. The combined approach presents certain disadvantages, however. This combined approach obviates a natural decomposition of the problem into smaller design and control sub-problems that can be a disadvantage from a modeling and solution practicality viewpoint. In this paper, it is shown that a modified sequential approach utilizing a Control Proxy Function (CPF) can be used to produce optimal, or near-optimal, solutions while allowing this decomposition. Two physical bases for CPFs are presented, natural frequency and the controllability Gramrnian matrix, and their range of applicability is discussed. These concepts are demonstrated, for a positioning gantry example and on an active/passive automotive suspension, to be quite effective. (C) 2013 Elsevier Ltd. All rights reserved.

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

co-design
design optimization
controller design
active suspension


On the Application of Ensembles of Classifiers to the Diagnosis of Pathologies of the Vertebral Column: A Comparative Analysis This paper reports results from a comprehensive performance comparison among standalone machine learning algorithms (SVM, MLP and GRNN) and their combinations in ensembles of classifiers when applied to a medical diagnosis problem in the field of Orthopedics. All the aforementioned learning strategies, which currently comprises the classification module of the SINPATCO platform, are evaluated according to their ability in discriminating patients as belonging to one out of three categories: Normal, Disk Hernia and Spondylolisthesis. Confusion matrices of all learning algorithms are also reported, as well as a study of the effect of diversity in the design of the ensembles. The obtained results clearly indicate that the ensembles of classifiers have better generalization performance than standalone classifiers.

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

vertebral column
ensembles of classifiers

computer-aided diagnosis
support vector machine
neural networks


multi-user interaction using handheld projectors Recent research on handheld projector interaction has expanded the display and interaction space of handheld devices by projecting information onto the physical environment around the user, but has mainly focused on single-user scenarios. We extend this prior single-user research to co-located multi-user interaction using multiple handheld projectors. We present a set of interaction techniques for supporting co-located collaboration with multiple handheld projectors, and discuss application scenarios enabled by them.

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


The impact of breakdowns disciplines and repeated attempts on performances of Small Cell Networks Proposition of new breakdowns disciplines with priority of interrupted customers. Conception and implementation of algorithms for a direct computing of the infinitesimal generator. We developed formulas of stationary performance and reliability indices as a function of the stationary probabilities. The performance and reliability indices are independent of the reachability set markings. Numerical examples show the effect of the network parameters, the breakdowns disciplines and the priority on performances.

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

priority of interrupted customers
infinitesimal generator

retrial phenomenon
small cell mobile networks
active breakdowns
dependent breakdowns
performance and reliability measures


Image reconstruction algorithm from compressed sensing measurements by dictionary learning It is a challenge task to reconstruct images from compressed sensing measurement due to its implicit ill-posed property. In this paper, we propose an image reconstruction algorithm for compressed sensing image application based on the adaptive dictionary, which is learned from the reconstructed image itself. The sparsity level is enhanced since the sparse coding of overlapping image patches emphasizes the local image features; accordingly the quality of the reconstructed image is also improved. In addition, Batch-OMP algorithm, linearization technique and dynamic updating sparse coding algorithm are used to reduce the computational complexity of our proposed algorithm. Numerical experiments are conducted on several test images with a variety of sampling ratios. The results demonstrate that our proposed algorithm can efficiently reconstruct images from compressed sensing measurements and achieve more than 3dB gain averagely over the current leading CS reconstruction algorithm.

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

compressed sensing
image reconstruction
dictionary learning
linearization technique


The Structure of Multiplicative Motions in Natural Imagery A theoretical investigation of the frequency structure of multiplicative image motion signals is presented, e. g., as associated with translucency phenomena. Previous work has claimed that the multiplicative composition of visual signals generally results in the annihilation of oriented structure in the spectral domain. As a result, research has focused on multiplicative signals in highly specialized scenarios where highly structured spectral signatures are prevalent, or introduced a nonlinearity to transform the multiplicative image signal to an additive one. In contrast, in this paper, it is shown that oriented structure is present in multiplicative cases when natural domain constraints are taken into account. This analysis suggests that the various instances of naturally occurring multiple motion structures can be treated in a unified manner. As an example application of the developed theory, a multiple motion estimator previously proposed for translation, additive transparency, and occlusion is adapted to multiplicative image motions. This estimator is shown to yield superior performance over the alternative practice of introducing a nonlinear preprocessing step.

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

multiplicative motion
dynamic occlusion
pseudotransparency
non-fourier motion
spectral analysis
optical flow


A Markov Chain Monte Carlo version of the genetic algorithm differential evolution: easy Bayesian computing for real parameter spaces Differential Evolution (DE) is a simple genetic algorithm for numerical optimization in real parameter spaces. In a statistical context one would not just want the optimum but also its uncertainty. The uncertainty distribution can be obtained by a Bayesian analysis (after specifying prior and likelihood) using Markov Chain Monte Carlo (MCMC) simulation. This paper integrates the essential ideas of DE and MCMC, resulting in Differential Evolution Markov Chain (DE-MC). DE-MC is a population MCMC algorithm, in which multiple chains are run in parallel. DE-MC solves an important problem in MCMC, namely that of choosing an appropriate scale and orientation for the jumping distribution. In DE-MC the jumps are simply a fixed multiple of the differences of two random parameter vectors that are currently in the population. The selection process of DE-MC works via the usual Metropolis ratio which defines the probability with which a proposal is accepted. In tests with known uncertainty distributions, the efficiency of DE-MC with respect to random walk Metropolis with optimal multivariate Normal jumps ranged from 68% for small population sizes to 100% for large population sizes and even to 500% for the 97.5% point of a variable from a 50-dimensional Student distribution. Two Bayesian examples illustrate the potential of DE-MC in practice. DE-MC is shown to facilitate multidimensional updates in a multi-chain "Metropolis-within-Gibbs" sampling approach. The advantage of DE-MC over conventional MCMC are simplicity, speed of calculation and convergence, even for nearly collinear parameters and multimodal densities.

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

block updating
evolutionary monte carlo
metropolis algorithm
population markov chain monte carlo
simulated annealing
simulated tempering
theophylline kinetics