Executable specifications for hypothesis-based reasoning with Prolog and Constraint Handling Rules Constraint Handling Rules (CHR) is an extension to Prolog which opens up a spectrum of hypothesis-based reasoning in logic programs without additional interpretation overhead. Abduction with integrity constraints is one example of hypothesis-based reasoning which can be implemented directly in Prolog and CHR with a straightforward use of available and efficiently implemented facilities. The present paper clarifies the semantic foundations for this way of doing abduction in CHR and Prolog as well as other examples of hypothesis-based reasoning that is possible, including assumptive logic programming, hypotheses with priority and scope, and nonmonotonic reasoning. Examples are presented as executable code so the paper may also serve the additional purpose of a practical guide for developing such programs, and it is demonstrated that the approach provides a seamless integration with existing constraint solvers. (C) 2008 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 B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O 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

abduction as deduction
hypothesis-based reasoning


The exploration of meditation in the neuroscience of attention and consciousness Many recent behavioral and neuroscientific studies have revealed the importance of investigating meditation states and traits to achieve an increased understanding of cognitive and affective neuroplasticity, attention and self-awareness, as well as for their increasingly recognized clinical relevance. The investigation of states and traits related to meditation has especially pronounced implications for the neuroscience of attention, consciousness, self-awareness, empathy and theory of mind. In this article we present the main features of meditation-based mental training and characterize the current scientific approach to meditation states and traits with special reference to attention and consciousness, in light of the articles contributed to this issue.

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

meditation consciousness attention neuroplasticity


Recovery-based error estimation in the dynamic analysis of offshore wind turbine monopile foundations Offshore wind turbine foundations are affected by cyclic loads due to oscillatory kinematic loads, such as those from wind, waves, and earthquakes. Monopiles are often used as a foundation concept for offshore windmill turbines. In this study, coupled dynamic equations with the u-P u - P formulation for low-frequency load are considered for an offshore wind turbine monopile foundation, to present the response in terms of pore water pressure (PWP), stress and strain distribution in an elastic porous medium at regions around the monopile foundation. Different stress recovery techniques based on the ZienkeiwiczZhu (ZZ) error estimator namely, super-convergent patch recovery (SPR), weighted super-convergent patch recovery (WSPR), and L2-projection techniques are also investigated to recover the stresses at nodal points in the finite element method. To estimate errors in the time domain when performing transient simulations, three recovery processes are used with different meshes. The convergence of the dynamic problem is also studied. The results are verified with findings in the literature, revealing that the time period of effective stresses follows the applied load frequency. In conclusion, the history of the shear stress can have an important effect on the shear stress distribution, making it asymmetric in the time domain.

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

recovery-based error estimation
dynamic behavior
coupled equations
cyclic load
offshore foundation


xensible interruptions from your mobile phone Mobile phones may interrupt in any place at any time. Using the SocioXensor research tool on people's own mobile phones, we conducted an experience sampling study to explore which context information predicts a person's availability for a phone call, and which context information people wanted to disclose to particular social relations. Like other studies, we found that a small set of context information can help initiators of phone calls to improve their ability to know when recipients are receptive to phone calls. We also found that if we restrict the information to information recipients actually want to disclose, which is only a small subset of all information, enough context information is still available for initiators of phone calls to improve their ability to know when recipients are receptive to phone calls.

O B O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 unified scheme for generalizing cardinality estimators to sum aggregation ? We discuss cardinality estimation algorithms. We show how to generalize every such an algorithm to a weighted version. To this end, we use properties of the beta distribution.

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


Geometrically uniform frames We introduce a new class of finite-dimensional frames with strong symmetry properties, called geometrically uniform (GU) frames, that are defined over a finite Abelian group of unitary matrices and are generated by a single generating vector. The notion of GU frames is then extended to compound GU (CGU) frames which are generated by a finite Abelian group of unitary matrices using multiple generating vectors. The dual frame vectors and canonical tight frame vectors associated with GU frames are shown to be GU and, therefore, also generated by a single generating vector, which can be computed very efficiently using a Fourier transform (FT) defined over the generating group of the frame. Similarly, the dual frame vectors and canonical tight frame vectors associated with CGU frames are shown to be CGU. The impact of removing single or multiple elements from a GU frame is considered. A systematic method for constructing optimal GU frames from a given set of frame vectors that are not GU is also developed. Finally, the Euclidean distance properties of GU frames are discussed and conditions are derived on the Abelian group of unitary matrices to yield GU frames with strictly positive distance spectrum irrespective of the generating vector.

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

compound geometrically uniform (cgu) frames


a relative time implementation for delay-tolerant networks This demo shows a relative time implementation for the delay-tolerant networking architecture. In this system, bundle age is used to track expiration in situations where ac curate real world time is not available. The relative time functionality is implemented on top of the DTN2 reference implementation and the Bytewalla Android implementation which allows for its use on commercial mobile devices. Our demo, using multiple smartphones and netbooks, shows that devices are still able to communicate despite unsynchronized or incorrect clocks.

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 B I O O O O O O O O O O O O O O O O O O O O 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 defence scheme against Identity Theft Attack based on multiple social networks We define the Identity Theft Attacks on multi-dimensional social networks. We propose a scheme to protect users from Identity Theft Attacks. Our scheme does not violate the nature of social networks. We validate the availability of our scheme through experimental results.

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


A high level FPGA-based abstract machine for image processing Image processing requires high computational power, plus the ability to experiment with algorithms. Recently, reconfigurable hardware devices in the form of field programmable gate arrays (FPGAs) have been proposed as a way of obtaining high performance at an economical price. At present, however, users must program FPGAs at a very low level and have a detailed knowledge of the architecture of the device being used. They do not therefore facilitate easy development of, or experimentation with, image processing algorithms. To try to reconcile the dual requirements of high performance and ease of development, this paper reports on the design and realisation of an FPGA based image processing machine and its associated high level programming model. This abstract programming model allows an application developer to concentrate on the image processing algorithm in hand rather than on its hardware implementation. The abstract machine is based on a PC host system with a PCI-bus add-on card containing Xilinx XC6200 series FPGA(s). The machine's high level instruction set is based on the operators of image algebra. XC6200 series FPGA configurations have been developed to implement each high level instruction.

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

digital image processing
custom computing
high performance architectures
fpga's


Measurement of soil water content and electrical conductivity by time domain reflectometry: a review ? Non-destructive measurement of soil water content and electrical conductivity has been desired for many years. Recent development of time domain reflectometry (TDR) enables us to simultaneously obtain soil water content and electrical conductivity using a single probe with a minimal disturbance of soil. Research on water and solute transport in porous media using TDR has flourished in the last few years. In this review article, an overview of theoretical background for measuring water content and electrical conductivity is presented as well as characteristics of different types of probes. Limitations of applying TDR techniques to measuring soil water content and salinity are also addressed. The review is designed to equip other scientists and engineers with background information so that the development of TDR for studies on water and chemical movement can continue.

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

measurement
time domain reflectometry
water content
electrical conductivity
soil


SLM-based data position permutation method for PAPR reduction in OFDM systems The high peak-to-average power ratio (PAPR) in orthogonal frequency division multiplexing (OFDM) systems not only increases the complexity of the analog-to-digital (A/D) and digital-to-analog (D/A) converters but also reduces the efficiency of the radio frequency (RF) power amplifier. In this paper, we present a data position permutation (DPP) method, which is based on a selected mapping (SLM) scheme, for reducing the PAPR in OFDM systems. The candidate signal on each branch of the SLM scheme is generated by permuting the position and rotating the phase of the original data. In addition, a modified DPP method with lower bit error rate (BER) is proposed. The simulation results show that the proposed method provides better performance with regard to complexity, spectrum efficiency, and BER as compared to that of the SLM-based dummy sequence insertion (SLM-DSI) method. Copyright 2008 John Wiley & Sons, Ltd.

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


QCScreen: a software tool for data quality control in LC-HRMS based metabolomics Metabolomics experiments often comprise large numbers of biological samples resulting in huge amounts of data. This data needs to be inspected for plausibility before data evaluation to detect putative sources of error e.g. retention time or mass accuracy shifts. Especially in liquid chromatography-high resolution mass spectrometry (LC-HRMS) based metabolomics research, proper quality control checks (e.g. for precision, signal drifts or offsets) are crucial prerequisites to achieve reliable and comparable results within and across experimental measurement sequences. Software tools can support this process.

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

qc
lc-hrms
retention time shift
mass accuracy shift
mzxml


Personalized topic-based tag recommendation More and more content on the Web is generated by users. To organize this information and make it accessible via current search technology, tagging systems have gained tremendous popularity. Especially for multimedia content they allow to annotate resources with keywords (tags) which opens the door for classic text-based information retrieval. To support the user in choosing the right keywords, tag recommendation algorithms have emerged. In this setting, not only the content is decisive for recommending relevant tags but also the user's preferences. In this paper we introduce an approach to personalized tag recommendation that combines a probabilistic model of tags from the resource with tags from the user. As models we investigate simple language models as well as Latent Dirichlet Allocation. Extensive experiments on a real world dataset crawled from a big tagging system show that personalization improves tag recommendation, and our approach significantly outperforms state-of-the-art approaches.

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

tag recommendation
personalization
language models


Escaping your comfort zone: A graph-based recommender system for finding novel recommendations among relevant items A recommender system based on a positively-related item-graph targeted for novel and relevant recommendations is proposed. A live test was performed comparing the proposed system with a state-of-the-art matrix factorization algorithm. The proposed system consistently outperforms matrix factorization in finding items that are both novel and relevant. By finding novel and relevant items, the system addresses popularity bias commonly found in collaborative filtering-based recommender systems.

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


A Near-Optimal Algorithm Attacking the Topology Mismatch Problem in Unstructured Peer-to-Peer Networks In an unstructured peer-to-peer (P2P) network (e. g., Gnutella), participating peers choose their neighbors randomly such that the resultant P2P network mismatches its underlying physical network, resulting in the lengthy communication between the peers and redundant network traffics generated in the underlying network. Previous solutions to the topology mismatch problem in the literature either have no performance guarantees or are far from the optimum. In this paper, we propose a novel topology matching algorithm based on the Metropolis-Hastings method. Our proposal is guided by our insight analytical model and is close to the optimal design. Specifically, we show that our proposal constructs an unstructured P2P network in which a broadcast message, originated by any node v, reaches any other node u by taking approximately the only physical end-to-end delay between v and u. In addition, our design guarantees the exponential broadcast scope. We verify our solution through extensive simulations and show that our proposal considerably outperforms state-of-the-art solutions.

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

unstructured peer-to-peer systems
location awareness


Almost perfect nonlinear power functions on GF(2(n)): The Welch case We summarize the state of the classification of almost perfect nonlinear (APN) power functions x(d) on GF(2(n)) and contribute two new cases. To prove these cases we derive new permutation polynomials, The first case supports a well-known conjecture of Welch stating that for odd n = 2m + 1, the power function x(2m)+3 is even maximally nonlinear or, in other terms, that the crosscorrelation function between a binary maximum-length linear shift register sequences of degree n and a decimation of that sequence by 2(m) + 3 takes on precisely the three values -1, -1 +/-2(m+1).

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

crosscorrelation
permutation polynomials
power functions

almost perfect nonlinear mappings
maximally nonlinear mappings
walsh transform
welch conjecture


Data Placement in P2P Data Grids Considering the Availability, Security, Access Performance and Load Balancing Data dependability is an important issue in data Grids. Replication schemes have been widely used in distributed systems to ensure availability and improve access performance. Alternatively, data partitioning schemes (secret sharing, erasure coding with encryption) can be used to provide availability and, in addition, to offer confidentiality protection. In peer-to-peer data Grids, such confidentiality protection is essential since the nodes hosting the data shares may not be trustworthy or may be compromised. However, difficulties in generating new shares and potential security concerns for share reallocation make a pure data partitioning scheme not easily adaptable to dynamic user access patterns. In this paper, we consider combining replication and data partitioning to assure data availability, confidentiality, load balance, and efficient access for data Grid applications. Data are partitioned and shares are dispersed. The shares may be replicated to achieve better performance, load balance, and availability. Models for assessing confidentiality, availability, load balance, and communication cost are developed and used as the metrics to guide placement decisions. Due to the nature of contradicting goals, we model the placement decision problem as a multi-objective problem and use a genetic algorithm to determine solutions that are approximate to the Pareto optimal placement solutions.

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

p2p data grids
availability
load balance
access performance


Sensitive topics: Are there modal differences? ? As organizations such as the US Navy move toward web-based survey administration, it is important to determine whether responses to sensitive questions are equivalent regardless of the administration method. It is possible that having to enter a military website and provide a username to access the survey might increase anonymity and confidentiality concerns, thereby increasing the likelihood of response distortion. Although previous research has shown that self-administered questionnaires (both paper- and computer-based) generally result in equivalent responses, to date little research has investigated the effects of asking sensitive information in a web-based survey format. In order to test for potential response bias, a survey was created containing questions about family planning attitudes and birth control usage, impression management and self-deception scales, and privacy and confidentiality concerns. Paper surveys were sent to about 3300 randomly selected enlisted Navy personnel while another 3300 received an invitational letter to a survey website. In general, the results show few differences between web-based and paper-based survey responses, demonstrating that sensitive data can be collected via web-based surveys without significantly influencing the honesty of survey responses. In addition, the perceived levels of privacy and confidentiality did not result in a significant difference between the responses provided.

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

surveys
impression management
family planning attitudes


A novel pattern classification scheme using the Baker's map We demonstrate a novel application of nonlinear systems in the design of pattern classification systems. We show that pattern classification systems can be designed based upon training algorithms designed to control the qualitative behaviour of a nonlinear system. Our paradigm is illustrated by means of a simple chaotic systemthe Baker's map. Algorithms for training the system are presented and examples are given to illustrate the operation and learning of the system for pattern classification tasks.

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


Modelling software development methodologies: A conceptual foundation Current modelling approaches often purport to be based on a strong theoretical underpinning but, in fact, contain many ill-defined concepts or even contradictions leading to potential misinterpretation. Although much modelling in object-oriented contexts is focussed on the use of the Unified Modelling Language (UML), this paper presents a technology-agnostic approach that analyses the basic concepts of structural models and modelling in software engineering, using an approach based on representation theory. We examine the different kinds of interpretive mappings (either isotypical, prototypical or metatypical) that are required in order to trace model entities back to the SUS (subject under study) entities that they represent. The difference between forward- and backward-looking models is also explained, as are issues relating to the appropriate definition of modelling languages in general based on representation theory. The need for product and process integration in methodologies is then addressed, leading to the conclusion that a mesh of verbal plus nominal nodes is necessary in any methodology metamodel. Finally, the need for a common, cross-cutting modelling infrastructure is established, and a solution proposed in the form of an ontologically universal modelling language, OOLang. Examples of the application of these theoretical analyses to the suite of OMG products (particularly SPEM, UML and MOF) are given throughout, with the hope that awareness of the importance of a better modelling infrastructure can be developed.

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

modelling
software development methodologies


Wideband coherent sources localization based on a two-node distributed sensor networks A Teoplitz matrix based on two sensors can de-correlate multiple wideband sources. Exist noise subspace orthogonal to signal subspace even matrix is non-Hermitian. The prior geometrical information can be helpful to eliminate false intersection. Combine all the ideas above, the localization of wideband sources can be achieved.

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

wideband coherent
sensor networks
localization


symbolic/numeric algorithms for partial differential equations Symbolic computation has been used to generate classes of numeric algorithms for solving linear partial differential equations A two-phase procedure is described for automatically producing multiparameter families of difference approximations to the heat operator. In the first phase, a truncated series expansion is used to form the appropriate difference operator. The coefficients of the operator, functions of free parameters, are determined in the second phase. When the region is rectilinear, Vandermonde matrices are constructed which permit this phase to be computed numerically. When the region is irregular, a symbolic approach appears to be more efficient

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

symbolic mathematical computation
finite differences


Transparent access to Grid resources for user software Grid computing promises access to large amounts of computing power, but so far adoption of Grid computing has been limited to highly specialized experts for three reasons. First, users are used to batch systems, and interfaces to Grid software are often complex and different to those in batch systems. Second, users are used to having transparent file access, which Grid software does not conveniently provide. Third, efforts to achieve wide-spread coordination of computers while solving the first two problems is hampered when clusters are on private networks. Here we bring together a variety of software that allows users to almost transparently use Grid resources as if they were local resources while providing transparent access to files, even when private networks intervene. As a motivating example, the BaBar Monte Carlo production system is deployed on a truly distributed environment, the European DataGrid, without any modification to the application itself. Copyright (c) 2005 John Wiley & Sons, Ltd.

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

high-energy physics
virtual file system
user interface


Preference-Inspired Coevolutionary Algorithms for Many-Objective Optimization The simultaneous optimization of many objectives (in excess of 3), in order to obtain a full and satisfactory set of tradeoff solutions to support a posteriori decision making, remains a challenging problem. The concept of coevolving a family of decision-maker preferences together with a population of candidate solutions is studied here and demonstrated to have promising performance characteristics for such problems. After introducing the concept of the preference-inspired co-evolutionary algorithm (PICEA), a realization of this concept, PICEA-g, is systematically compared with four of the best-in-class evolutionary algorithms (EAs); random search is also studied as a baseline approach. The four EAs used in the comparison are a Pareto-dominance relation-based algorithm (NSGA-II), an epsilon-dominance relation-based algorithm [epsilon-multiobjective evolutionary algorithm (MOEA)], a scalarizing function-based algorithm (MOEA/D), and an indicator-based algorithm [hypervolume-based algorithm (HypE)]. It is demonstrated that, for bi-objective problems, all of the multi-objective evolutionary algorithms perform competitively. As the number of objectives increases, PICEA-g and HypE, which have comparable performance, tend to outperform NSGA-II, epsilon-MOEA, and MOEA/D. All the algorithms outperformed random search.

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


Estimate for the lower bound of rank and the upper bound of eigenvalues norms' sum of given quaternion matrix This work is concerned with estimating the lower bound of rank for a given quaternion square matrix, rectangular matrix or normal matrix, and estimating the upper bound for the sum of the eigenvalue norms of a given quaternion matrix. A sufficient condition is provided to confirm whether a given quaternion matrix is nonsingular. It sharpens some results due to Tu Bo-xun and Semyon Aranovich Gerschgorin and Schur, respectively. Some examples are provided to show the effectiveness of our results. (C) 2010 Elsevier Ltd. All rights reserved.

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

quaternion matrix
rank
lower bound
eigenvalue
upper bound


Simulation

in

university

education:

The

artificial

agent

PSI

as

a

teaching

tool

One

weakness

of

undergraduate

psychology

education

in

Germany

is

that

students

do

not

have

many

opportunities

to

practice

their

theoretical

knowledge.

To

fill

this

gap,

a

new

teaching

approach

has

been

introduced

to

the

curriculum

at

the

University

of

Bamberg,

Germany.

The

students

conduct

experiments

with

an

artificial

agent,

a

computer

simulation

originating

from

a

cognitive

modeling

approach.

The

agent,

called

"PSI"

(see

for

various

versions),

is

the

implementation

of

the

PSI

theory

(see

Dorner,

D.,

Bauplan

fur

eine

Seele,

Rowohlt,

Reinbek).

The

PSI

theory

integrates

approaches

to

cognition,

emotions,

motivation,

human

action

regulation,

and

perception.

One

major

benefit

of

the

work

with

the

simulation

(besides

the

students

gaining

practical

experience)

is

that

it

is

possible

to

convey

knowledge

about

psychological

processes

and

that

interaction

of

different

processes

difficult

to

isolate

in

natural

agents

become

clearly

visible

to

students.

In

the

evaluation

of

the

course,

students

rated

the

course

as

a

valuable

addendum

to

the

traditional

education

in

psychology.

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


Incremental inductive learning algorithm and its performance evaluation: Rough set approach Classical methods to find a minimal set of rules based on the rough set theory are known to be ineffective in dealing with new instances added to them universe. This paper introduces an inductive teaming algorithm for incrementally retrieving a minimal set of rules from a given decision table. Then, the algorithm is validated via simulations with two sets of data, in comparison with a classical non-incremental algorithm. The simulation results show that the proposed algorithm is effective in dealing with new instances, especially in practical use.

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

rough sets
minimal set of decision rules
reduct change criteria


An integrated design for double-layered structures The geometric configuration in the double-layered structure is very required to be started from the conceptual design with low cost, high performance and quality. In this point, a structural-topological shape concerned with conceptual design of structure is important. The method used in this paper combines three optimization techniques, where the shape and physical dimensions of the shell structure and material distribution are hierachically optimized, with the maximum rigidity of structure and lightweight.

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

double-layered structure
size optimization
shape optimization
topology optimization


More realistic, flexible, and expressive social crowds using transactional analysis Recent algorithms have been able to simulate social crowds that allow agents to interact socially as opposed to only treating other agents as obstacles. Unfortunately, past social crowd algorithms lack realism and flexibility because they do not allow agents to move in and out of different and repeated social interactions, are built around a specific obstacle avoidance algorithm, or are tuned only for a specific social setting and do not allow for artist directed changes. We propose a new, simplified social crowd algorithm that focuses on the evolving social needs of agents and allows each agent to join and leave different encounters as desired. Our algorithm is based on the psychology research area of transactional analysis, does not require a specific obstacle avoidance algorithm, and allows for easy artist direction for determining the precise social environment being simulated. Our algorithm runs in real-time with 3,000 to 4,000 agents without the restrictions of previous research.

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

crowd simulation
social crowd simulation
pair walking


A time integration algorithm based on the state transition matrix for structures with time varying and nonlinear properties A variable order method of integrating the structural dynamics equations that is based on the state transition matrix has been developed. The method has been evaluated for linear time variant and nonlinear systems of equations. When the time variation of the system can be modeled exactly by a polynomial it produces nearly exact solutions for a wide range of time step sizes. Solutions of a model nonlinear dynamic response exhibiting chaotic behavior have been computed. Accuracy of the method has been demonstrated by comparison with solutions obtained by established methods.

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

linear
time variant
nonlinear
state transition matrix
structural dynamics


matlab as a development environment for fpga design In this paper we discuss an efficient design flow from Matlab to FPGA. Employing Matlab for algorithm research and as system level language allows efficient transition from algorithm development to implementation. We show that integrating Matlab with HDL design tools such as HDL designer and Precision-C , an efficient design flow, suitable for rapid prototyping, can be obtained. The design flow accelerates process of algorithm development and simplifies test-bench formulation and verification process. The overall development time thus can be significantly reduced. We elaborate on the advantages and disadvantages of the design flow. It will be shown that Matlab based design flow generates functional specifications that are useful for RTL development.

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


Continuity in Wireless Video Security System-Based Physical Security Services Traditional physical security policy considers an intentional use of budgets and a way of using physical spaces. It represents difficulties in responses to the environment, which is dynamically changed, because the plan is determined as static and stereotypical manners. Thus, in this study a wireless IP camera is used as a method that expands monitoring ranges in existing physical spaces in order to propose a security service structure that can support instantaneous detections and responses to disasters. Although the effort for protecting facilities and equipments using a video monitoring system using wireless IP cameras for temporal threats is a proper way for providing a physical security service according to needs of an adaptable security level. Moreover, if a security level for a specific section is to be upgraded according to changes in external environments, the security level, which is guaranteed by periodic guard patrols, can be improved and supported using a wireless IP camera-based video monitoring system for 24h during the period to be required. Also, it is possible to establish an environment that enables instantaneous detections and responses for a moment of accidents through performing a continuous video monitoring work from the beginning of rainfall to a dangerous level of flooding.

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

security policy
video security system
business continuity management


Two Classes of Symmetric Boolean Functions With Optimum Algebraic Immunity: Construction and Analysis This paper discusses two classes of symmetric Boolean functions. For each class, a necessary and sufficient condition for having optimum algebraic immunity is proposed. The algebraic degree and nonlinearity of the Boolean functions are also completely determined. And then we prove several of Braeken's conjectures about the algebraic degree and nonlinearity of the Boolean functions with optimum algebraic immunity in the two classes.

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

algebraic attacks
stream cipher
symmetric boolean function


Nonlinear multiscale analysis of three-dimensional echocardiographic sequences We introduce a new; model for multiscale analysis of space-time echocardiographic sequences. The proposed nonlinear partial differential equation, representing the multiscale analysis, filters the sequence while keeping the space-time coherent structures, It combines the ideas of regularized Perona-Malik anisotropic diffusion and the Galilean invariant mol ie multiscale analysis of Alvarez, Guichard, Lions and Morel. A numerical method for solving the proposed partial differential equation is suggested and its stability is shown. Computational results on synthesized and real sequences are provided, A qualitative and quantitative evaluation of the accuracy of the method is presented.

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

echocardiography
image multiscale analysis
nonlinear scale space
numerical solution
partial differential equations


Comments on "Segment Shared Protection in Mesh Communication Networks With Guaranteed Tunnels" In this Comment, two typos in Ho et al., 2004, "Segment Shared Protection in Mesh Communication Networks With Bandwidth Guaranteed Tunnels", are pointed out. These typos may puzzle readers or prevent them from correctly understand this paper. In the second part of this Comment, we present corrections to the typos.

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

segment shared protection (ssp)
survivable routing
working and protection paths


E(2)MAC: An energy efficient MAC for RFID-enhanced wireless sensor networks The primary aim of any anti-collision protocols is to identify tags quickly, as doing so ensures that a Radio Frequency IDentification (RFID) reader incurs minimal energy wastage and achieves high identification rate. To date, researchers have proposed various protocols to minimize tag collisions and idle slots - key factors that determine a reader's read rate and energy expenditure. Most of these protocols, however, are designed for single reader systems. To this end, we propose E(2)MAC, an energy efficient, distributed Medium Access Control (MAC) protocol for identifying and monitoring tags in RFID-enhanced wireless sensor networks. E(2)MAC exploits the low power capability of a ultra-wideband transceiver and distinct pulses to address the reader collision problem. In addition, it uses ResMon, an enhanced dynamic frame slotted Aloha protocol to read and monitor tags. Lastly, E(2)MAC uses a novel load balancing algorithm to amortize the cost of reading and monitoring tags to multiple readers. These E(2)MAC features ensure that the contention level at each reader is kept at a minimum and distributed fairly. As a result, E(2)MAC has a high reading rate and low energy consumption. In addition, E(2)MAC helps in minimizing the impact of the tag orientation problem, where a tag becomes unreadable if its antenna is parallel to a reader's field lines. In particular, the use of multiple readers increases spatial diversity and hence increases the likelihood that a tag is readable by at least one reader. Our simulation results show E(2)MAC to have very low energy consumption, reading delay and per-reader collision. More importantly, system designers have the flexibility to lower these metrics further with additional readers, bigger frame sizes, or by dividing tags into small groups. (C) 2011 Elsevier B.V. All rights reserved.

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

wireless sensor networks
rfid
energy efficient


Modeling of inhibition/excitation firing in olfactory bulb through spiking neurons Spiking neural systems are based on biologically inspired neural models of computation since they take into account the precise timing of spike events and therefore are suitable to analyze dynamical aspects of neuronal signal transmission. These systems gained increasing interest because they are more sophisticated than simple neuron models found in artificial neural systems; they are closer to biophysical models of neurons, synapses, and related elements and their synchronized firing of neuronal assemblies could serve the brain as a code for feature binding and pattern segmentation. The simulations are designed to exemplify certain properties of the olfactory bulb (OB) dynamics and are based on an extension of the integrate-and-fire (IF) neuron, and the idea of locally coupled excitation and inhibition cells. We introduce the background theory to making an appropriate choice of model parameters. The following two forms of connectivity offering certain computational and analytical advantages, either through symmetry or statistical properties in the study of OB dynamics have been used: all-to-all coupling, receptive field style coupling. Our simulations showed that the inter-neuron transmission delay controls the size of spatial variations of the input and also smoothes the network response. Our IF extended model proves to be a useful basis from which we can study more sophisticated features as complex pattern formation, and global stability and chaos of OB dynamics.

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


Online Continuous Scale Estimation of Hand Gestures The style of a gesture provides significant information for communication, and thus understanding the style is of great importance in improving gestural interfaces using hand gestures. We present a novel method to estimate temporal and spatial scale which are considered principal elements of the style of hand gestures. Gesture synchronization is proposed for matching progression between spatio-temporally varying gestures, and scales are estimated based on the progression matching. For comparing gestures of various sizes and speeds, gesture representation is defined by adopting turning angle representation. Also, LCSS is used as a similarity measure for reliability and robustness to noise and outliers. Performance of our algorithm is evaluated with synthesized data to show the accuracy and robustness to noise and experiments are carried out using recorded hand gestures to analyze applicability under real-world situations.

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

hand gestures
gesture synchronization
scale estimation


Path following algorithm for highly redundant manipulators An algorithm for path planning for highly redundant manipulators is presented in this paper. Assuming an approximated path is given by B-spline curves, path following is defined by requiring manipulator links to remain approximately tangent to these curves. The algorithm decouples manipulator links and establishes each links position relative to the curve using a numerical approach. As a result, the whole link achieves manoeuvring around the curve. A robust propagation procedure between links is also performed, which checks every links position and moves the links coming after the most recently moved link. These features lead to handling a huge number of degrees of freedom (DOFs) while keeping tight manoeuvring ability of highly redundant manipulators as illustrated with several examples.

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


Automatic capture and reconstruction of computational provenance The Earth System Science Server (ES3) project is developing a local infrastructure for managing Earth science data products derived from satellite remote sensing. By 'local,' we mean the infrastructure that a scientist uses to manage the creation and dissemination of her own data products, particularly those that are constantly incorporating corrections or improvements based on the scientist's own research. Therefore, in addition to being robust and capacious enough to support public access, ES3 is intended to be flexible enough to manage the idiosyncratic computing ensembles that typify scientific research. Instead of specifying provenance explicitly with a workflow model, ES3 extracts provenance information automatically from arbitrary applications by monitoring their interactions with their execution environment. These interactions (arguments, file I/O, system calls, etc.) are logged to the ES3 database, which assembles them into provenance graphs. These graphs resemble workflow specifications, but are really reports-they describe what actually happened, as opposed to what was requested. The ES3 database supports forward and backward navigation through provenance graphs (i.e. ancestor/descendant queries), as well as graph retrieval. Copyright (C) 2007 John Wiley & Sons, Ltd.

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

instrumentation lineage passive transparency


a concurrent copying garbage collector for languages that distinguish (im)mutable data This paper describes the design and implementation of a concurrent compacting garbage collector for languages that distinguish mutable data from immutable data ( e.g. , ML) as well for languages that manipulate only immutable data ( e.g. , pure functional languages such as Haskell). The collector runs on shared-memory parallel computers and requires minimal mutator/collector synchronization. No special hardware or operating system support is required. Our concurrent collector derives from sequential semi-space copying collectors. The collector requires that a heap object includes forwarding pointer in addition to its data fields. An access to an immutable object can be satisfied either by the original or the forwarded copy of the object. A mutable object is always accessed through the forwarded copy, if one exists. Measurements of this collector in a Standard ML compiler on a shared-memory computer indicate that it eliminates perceptible garbage-collection pauses by reclaiming storage in parallel with the computation proper. All observed pause times are less than 20 milliseconds. We describe extensions for the concurrent collection of multiple mutator threads and refinements to our design that can improve its efficiency.

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

ml
haskell
efficiency
synchronization
design
computation
object
paper
access
minimal
parallel
storage
operating system
implementation
data
support
hardware
functional languages

collect
standardization
extensibility
thread
shared memory
compact
space
language
perception
concurrency
compilation
parallel computation
refine


Restricted Risk Bayes Linear State Estimation The problem of state estimation with stochastic uncertainties in the initial state, model noise, and measurement noise is considered using the restricted risk Bayes approach. It is assumed that the a priori distributions of these quantities are not perfectly known, but that some information about them may be available. While offering robustness, the restricted risk Bayes approach incorporates the available a priori information to give less conservative state estimators than the Gamma-minimax approach popular in the literature. When attention is restricted to linear estimators based on a quadratic loss function, a systematic method to derive restricted risk Bayes estimators is proposed. Applying to the filtering problem, the restricted risk Bayes approach provides us with a robust method to calibrate the Kalman filter (KF), considering the presence of stochastic uncertainties. This method is illustrated with a target tracking example and a wireless channel tracking example for which the Bayes, minimax, and restricted risk Bayes estimators are derived and their performance is compared.

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

bayes solution
kalman filter (kf)
minimax estimator
restricted risk bayes estimation
risk function


Numerical challenges in particle-based approaches for the simulation of semiconductor devices The aim of this paper is to review and discuss the most challenging aspects of the particle-based methods for simulation of charge transport in semiconductor devices. Since the early theoretical works on the Ensemble Monte Carlo (EMC) method applied to device simulation, and several successive works addressing both the physics and the numerical aspects of the EMC method, the basic algorithmic approaches have been modified to exploit the continuous improvements of both hardware and software tools. Typical examples of the algorithmic evolution are the adoption of the full band representation of the electronic structure, the so-called cellular automaton (CA), and the simulation of increasingly complex three-dimensional (313) structures. This paper will address some of the most significant problems which are still considered open in spite of the recent technological and scientific progresses. (C) 2002 IMACS. Published by 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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Parametric POMDPs for planning in continuous state spaces This work addresses the problem of decision-making under uncertainty for robot navigation. Since robot navigation is most naturally represented in a continuous domain, the problem is cast as a continuous-state POMDP. Probability distributions over state space, or beliefs, are represented in parametric form using low-dimensional vectors of sufficient statistics. The belief space, over which the value function must be estimated, has dimensionality equal to the number of sufficient statistics. Compared to methods based on discretising the state space, this work trades the loss of the belief spaces convexity for a reduction in its dimensionality and an efficient closed-form solution for belief updates. Fitted value iteration is used to solve the POMDP. The approach is empirically compared to a discrete POMDP solution method on a simulated continuous navigation problem. We show that, for a suitable environment and parametric form, the proposed method is capable of scaling to large state-spaces.

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

partially observable markov decision processes


Intelligent phase plane switching control of pneumatic artificial muscle manipulators with magneto-rheological brake The pneumatic artificial muscle (PAM) is undoubtedly the most promising artificial muscle for the actuation of new types of industrial robots such as rubber actuator and PAM manipulators because it provides these advantages Such as high strength and high power/ weight ratio. low cost, compactness. case of maintenance, cleanliness, readily available and cheap power Source, inherent safety and mobility assistance to humans performing tasks. However, some limitations still exist, such as the air compressibility and the lack of damping ability of the actuator bring the dynamic delay of the pressure response and cause the oscillatory motion. In addition, the nor)linearities in the PAM manipulator still limit the controllability. Therefore, it is not easy to realize motion with high accuracy and high speed and with respect to various external inertia loads in order to realize a human-friendly therapy robot. To overcome these problems a novel controller which harmonizes a phase plane switching control method (PPSC) with conventional PID controller and the adaptabilities of neural network, is newly proposed. In order to realize satisfactory control performance a variable damper. magneto-rheological brake (MRB), is equipped to the joint of the manipulator. Superb mixture of conventional PID controller and an intelligent phase plane switching control using neural network (IPPSC) brings LIS a novel controller. The experiments Were carried Out in practical PAM manipulator and the effectiveness of the proposed control algorithm was demonstrated through experiments. which had proved that the stability of the manipulator can be improved greatly in a high gain control by Using MRB with IPPSC and without regard for the changes of external inertia loads. (C) 2005 Elsevier Ltd. All rights reserved.

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

pneumatic artificial muscle
phase plane switching control
manipulator
neural network


Properness defects of projection and minimal discriminant variety The problem of describing the solutions of a polynomial system appears in many different fields such as robotic, control theory, etc. When the system depends on parameters, its minimal discriminant variety is the set of parameter values around which the roots of the system cannot be expressed as a continuous function of the parameters. In particular, an important component of the minimal discriminant variety is the set of properness defects. This article presents a method efficient in practice and in theory to compute the non-properness set of a projection mapping, by reducing the problem to a problem of variable elimination. We also present a reduction of the computation of the minimal discriminant variety to the computation of the non-properness set of a projection mapping. This result allows us to deduce a bound on the degree and the time computation of the minimal discriminant variety of a parametric system under some assumptions. (C) 2011 Elsevier Ltd. All rights reserved.

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

parametric polynomial system
deterministic complexity


Linear Bayes policy for learning in contextual-bandits A new selection rule for Contextual Bandits and single-step Reinforcement Learning. The use of empirical approximations to the Bayesrule is an effective approach. This technique arrived second at new Challenges for Exploration & Exploitation 3.

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

online advertising
recommender systems
one-to-one marketing
empirical bayes


Detecting exponential dichotomy on the real line: SVD and QR algorithms In this paper we propose and implement numerical methods to detect exponential dichotomy on the real line. Our algorithms are based on the singular value decomposition and the QR factorization of a fundamental matrix solution. The theoretical justification for our methods was laid down in the companion paper: "Exponential Dichotomy on the real line: SVD and QR methods.".

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


A practical language and toolkit for high-integrity tools This paper shows how a safe interface to heap storage, based on garbage collection as provided in implementations of pure functional languages, can be combined with imperative languages. It also shows how expressive notation from functional languages, such as algebraic data types and equational definition of functions with pattern matching, can be adopted. The paper argues that the resulting combination is appropriate for the construction of high-integrity tools, based on an assessment against the same criteria as have been used for assessing the suitability of imperative languages for producing high-integrity software.

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

functional languages
imperative languages
heap storage
algebraic data types


Maximum lifetime routing in wireless sensor networks A routing problem in static wireless ad hoe networks is considered as it arises in a rapidly deployed, sensor based, monitoring system known as the wireless sensor network. Information obtained by the monitoring nodes needs to be routed to a set of designated gateway nodes. In these networks, every node is capable of sensing, data processing, and communication, And operates on its limited amount of battery energy consumed mostly in transmission and reception at its radio transceiver. If we assume that the transmitter power level can be adjusted to use the minimum energy required to reach the intended next hop receiver then the energy consumption rate per unit information transmission depends on the choice of the next hop node, i.e., the routing decision. We formulate the routing problem as a linear programming problem, where the objective is to maximize the network lifetime, which is equivalent to the time until the network partition due to battery outage. Two different models are considered for the information-generation processes. One assumes constant rates and the other assumes an arbitrary process. A shortest cost path routing algorithm is proposed which uses link costs that reflect both the communication energy consumption rates and the residual energy levels at the two end nodes. The algorithm is amenable to distributed implementation. Simulation results with both information-generation process models show that the proposed algorithm can achieve network lifetime that is very close to the optimal network lifetime obtained by solving the linear programming problem.

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

energy-sensitive routing
power aware routing
wireless ad hoc networks


Analytical determination and classification of pollutant concentration fields using air pollution monitoring network data: Methodology and application in the Paris area, during episodes with peak nitrogen dioxide levels During the last years, an important number of episodes with peak nitrogen dioxide levels occurred in the Paris region. Modelling air pollution is necessary to predict future episodes and to take decisions for the protection of populations. Our study proposes a methodology for urban air pollution analysis, as a preliminary stage of its modelling. This paper focuses on two major points: the estimation of pollutant concentration fields using measures from a monitoring network, and the definition of a reduced number of concentration spatial patterns. Interpolation by thin plate splines is proposed and the approximation quality is estimated by leave-one-out cross validation tests. Analysis of large numbers of pollutant fields is difficult: cluster analysis of spatial distributions is proposed. For this study, Ward's algorithm is selected and applied to AIRPARIF nitrogen dioxide data during peak episodes from January 1993 to December 1997. Finally, some results and conclusions are presented.

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

thin plate spline functions
leave-one-out cross validation tests
ward's algorithm


Stability of ALM tree with selfish receivers: A simulation study Application Layer Multicast (ALM) is an effective supplement to IP Multicast. However, unlike the multicast tree in IP Multicast which is constructed on routers, the multicast tree in ALM is composed of host receivers. As selfish entities which have their own interests, the host receivers may cheat about their private information. Receiver cheating may transform the multicast tree, and lead to its instability. We establish the cheating model of selfish ALM receivers, and study the stability of ALM tree with selfish receivers through simulations. Simulation results show that receiver cheating has considerably negative effects on the stability of ALM tree. This discovery brings forward a new issue in ALM study, that is, we should take receiver cheating into consideration to maintain a stable ALM tree when designing ALM,protocols. (c) 2006 Elsevier B.V. All rights reserved.

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

alm
stability
cheating
selfish receivers


Data envelopment analysis of mutual funds based on second-order stochastic dominance Although data envelopment analysis (DEA) has been extensively used to assess the performance of mutual funds (MF), most of the approaches overestimate the risk associated to the endogenous benchmark portfolio. This is because in the conventional DEA technology the risk of the target portfolio is computed as a linear combination of the risk of the assessed MF. This neglects the important effects of portfolio diversification. Other approaches based on meanvariance or meanvarianceskewness are non-linear. We propose to combine DEA with stochastic dominance criteria. Thus, in this paper, six distinct DEA-like linear programming (LP) models are proposed for computing relative efficiency scores consistent (in the sense of necessity) with second-order stochastic dominance (SSD). The aim is that, being SSD efficient, the obtained target portfolio should be an optimal benchmark for any rational risk-averse investor. The proposed models are compared with several related approaches from the literature.

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

data envelopment analysis
stochastic dominance
ssd
lp


Children's Environmental Health: Intergenerational Equity in ActionA Civil Society Perspective Since World War II, approximately 80,000 new commercial synthetic chemicals have been released into the environment, with approximately 1500 new chemicals released annually. Most of these have not been adequately tested for their impacts on human health or their particular impacts on children and the developing fetus. Yet, children are exposed to hazardous chemicals through residues in their food, indoor and outdoor air pollution, and through household products and contaminated house dust. Many of these synthetic chemicals are persistent and bio-accumulative, remaining in the human body long after exposure. Developing fetuses acquire toxic chemicals that have bioaccumulated in the mother's body and readily cross the placental barrier. Babies are now born with many man-made chemicals in their small bodies. Newborns take in more through breast milk or formula. There are no tests to assess the combined impacts of the chemical soup to which children are exposed. WHO, UNICEF, and UNEP have reported a growing number of children's health impacts caused by exposure to hazardous chemicals, including asthma, birth defects, hypospadias, behavioral disorders, learning disabilities, autism, cancer, dysfunctional immune systems, neurological impairments, and reproductive disorders. WHO states that approximately 3 million children under the age of five die every year due to environmental hazards, and this is not limited to developing countries. All children, both in the developing and developed world are affected by exposure to hazardous chemicals. In 2004, the European Union's Ministerial Conference on Children's Environmental Health identified air pollution, unsafe water conditions, and lead exposure as the main culprits in the death and disabling of children in Europe. The conference found that by reducing exposure to hazardous chemicals, the lives of many children could be saved. The key issues in children's environmental health and potential policy and management remedies are examined from both national (Australian) and international perspectives.

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


Learning from ambiguously labeled examples Inducing a classification function from a set of examples in the form of labeled instances is a standard problem in supervised machine learning. In this paper, we are concerned with ambiguous label classification (ALC), an extension of this setting in which several candidate labels may be assigned to a single example. By extending three concrete classification methods to the ALC setting (nearest neighbor classification, decision tree learning, and rule induction) and evaluating their performance on benchmark data sets, we show that appropriately designed learning algorithms can successfully exploit the information contained in ambiguously labeled examples. Our results indicate that the fundamental idea of the extended methods, namely to disambiguate the label information by means of the inductive bias underlying (heuristic) machine learning methods, works well in practice.

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

machine learning
classification
inductive bias
rule induction

missing data
nearest neighbor estimation
decision trees


Segmentation and Edge Detection Based on Spiking Neural Network Model The process of segmenting images is one of the most critical ones in automatic image analysis whose goal can be regarded as to find what objects are present in images. Artificial neural networks have been well developed so far. First two generations of neural networks have a lot of successful applications. Spiking neuron networks (SNNs) are often referred to as the third generation of neural networks which have potential to solve problems related to biological stimuli. They derive their strength and interest from an accurate modeling of synaptic interactions between neurons, taking into account the time of spike emission. SNNs overcome the computational power of neural networks made of threshold or sigmoidal units. Based on dynamic event-driven processing, they open up new horizons for developing models with an exponential capacity of memorizing and a strong ability to fast adaptation. Moreover, SNNs add a new dimension, the temporal axis, to the representation capacity and the processing abilities of neural networks. In this paper, we present how SNN can be applied with efficacy in image segmentation and edge detection. Results obtained confirm the validity of the approach.

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

spiking neuron networks
segmentation
edge detection


Automatic correction of the time step in implicit simulations of the stamping process A specific aspect of simulations of stamping processes is the numerical method adopted to include the non-linearities associated with the frictional contact problem in large deformation plasticity. In fact, convergence problems are frequently encountered, especially when using a quasi-static implicit algorithm. One way of increasing the numerical robustness of these algorithms is to adopt an augmented Lagrangian method to incorporate the problem of contact with friction. The resulting non-linear system can be solved by a NewtonRaphson type method, for which a trial solution must be given to start the iterative equilibrium loop. The quality of this trial solution is determinant for the convergence of the iterative process. An automatic control of the size of the time step can improve this trial solution. In this study, a new size control for the time step, imposing restrictions not only on the increments of the state variables but also on the increments of the contact forces, is proposed. An example of a bending test is used to analyse the influence of this new limitation on the overall convergence behaviour of the fully implicit code DD3IMP.

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

finite element analysis
implicit algorithms


Parallel flux sweep algorithm for neutron transport on unstructured grid Discontinuous finite element discrete ordinates (DFE-S-n) method is widely used to solve the time-dependent neutron transport equation for nuclear science and engineering applications. Most efficiently, the kernel is to iteratively sweep the neutron flux across the computational grid. However, for unstructured grid this will bring forward several challenges while implemented on distributed memory parallel computers where the grid are decomposed across processors. This paper presents a parallel flux sweep algorithm to improve the parallel scalability of this basic sweep algorithm on unstructured grid under 2-D cylindrical Lagrange coordinates system from two sides. One is to prioritize the sweep order of elements within each subdomain, another is to better decompose the unstructured grid across processors. With optimal combination of domain decomposition method and priority queuing algorithm, this parallel algorithm has successfully been incorporated into DFE-S-n method and has been implemented with MPI to solve the neutron and photon coupled transport equation for complex physics. Performance results for two different applications on hundreds of processors of two parallel computers are given in this paper. In particular, the parallel solver has respectively achieved speedup larger than 72 using 92 processors and 78 using 256 processors on these two machines.

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

unstructured grid
neutron transport
parallel flux sweep algorithm


a formal framework for a functional language with adaptable components We propose a component programming language called FLAC, Functional Language for Adaptable Components , on top of a functional programming language which authorizes full adaptability of components while ensuring type safety. The langage is given together with a type system that offers a complete static type ckecking of any programs (including adaptations) to ensure error-free run-time adaptations. Dynamic adaptability and static type checking might seem at first sight paradoxical, but our approach allows it because, first, we use a single language for traditional services and control services (i.e., services for adaptations), and secondly, a specific merge operation takes care of adaptations.

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


An efficient NAND flash file system for flash memory storage In this paper, we present an efficient flash file system for flash memory storage. Flash memory, especially NAND flash memory, has become a major method for data storage. Currently, a block level translation interface is required between an existing file system and flash memory chips due to its physical characteristics. However, the approach of existing file systems on top of the emulating block interface has many restrictions and is, thus, inefficient because existing file systems are designed for disk-based storage systems. The flash file system proposed in this paper is designed for NAND flash memory storage while considering the existing file system characteristics. Our target performance metrics are the system booting time and garbage collection overheads, which are important issues in flash memory. In our experiments, the proposed flash file system outperformed other flash file systems both in booting time and garbage collection overheads.

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

flash file system
nand flash memory
garbage collection


why i came back to ada After the Air Force Academy switched its curriculum to Java, I extracted myself from the Ada community and moved on to other research interests, particularly computer security. In this talk, I'll explain the new developments that brought me back to Ada and how Ada and SPARK may be a secret weapon in the 21st century.

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


On fuzzy approximation operators in attribute reduction with fuzzy rough sets Generally speaking, there are four fuzzy approximation operators defined on a general triangular norm (t-norm) framework in fuzzy rough sets. Different types of t-norms specify various approximation operators. One issue whether and how the different fuzzy approximation operators affect the result of attribute reduction is then arisen. This paper addresses this issue from the theoretical viewpoint by reviewing attribute reduction with fuzzy rough sets and then describing and proving some theorems which demonstrate the effects of the fuzzy approximation operators on the results of attribute reduction. First, we review some notions of attribute reduction with fuzzy rough sets, such as positive region, dependency degree and attribute reduction. We then present and prove some theorems which describe how and to what degree fuzzy approximation operators impact the performance of attribute reduction. Finally, we report some experimental simulation results which demonstrate the effectiveness and correctness of the theoretical contributions. One main contribution in this paper is that we have described and proven that each attribute reduction obtained using one type of fuzzy lower approximation operator always contains one reduction obtained using the other type of fuzzy lower approximation operator.

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

fuzzy approximation operator
triangular norm (t-norm)
residual implicator


Thymosin ?4 Is Not Always the Main ?-Thymosin in Mammalian Platelets ?-thymosins constitute a family of highly conserved 5-kDa polypeptides. Thymosin ?4, the most abundant member of this family, is expressed in most mammalian cell types and is regarded as the main intracellular G-actin sequestering peptide. In addition to this important intracellular function several other activities have been attributed to this peptide. Thymosin ?4 is released from human platelets and cross-linked to fibrin after activation of platelets with thrombin. While in most mammalian tissues thymosin ?4 is accompanied by a second member of this peptide family, in human platelets only thymosin ?4 is present. To elucidate if it is common to mammalian platelets that only one ?-thymosin is present, we analyzed platelets from several mammals for their ?-thymosin content. In human platelets only thymosin ?4 could be detected, whereas in bovine platelets thymosin ?9, which is normally the minor ?-thymosin in bovine tissues, was identified as the main ?-thymosin. In rabbit platelets, thymosin ?4 is not simply replaced by the most homologous thymosin ?4Ala, as might be expected from sequence homology. Thymosin ?4Ala and thymosin ?10 were found, but thymosin ?10 is present in about 2.5-fold higher amounts. Because thymosin ?4Ala possesses about threefold higher affinity to G-actin, compared to thymosin ?4, ?10, and ?9, we suggest that expression of ?-thymosins is triggered by functional requirements and not sequence homology

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

?-thymosins
actin sequestering
dissociation constant


Image retrieval using hierarchical self-organizing feature maps ? This paper presents a scheme for image retrieval that lets a user retrieve images either by exploring summary views of the image collection at different levels or by similarity retrieval using query images. The proposed scheme is based on image clustering through a hierarchy of self-organizing feature maps. While the suggested scheme can work with any kind of low-level feature representation of images, our implementation and description of the system is centered on the use of image color information. Experimental results using a database of 2100 images are presented to show the efficacy of the suggested scheme.

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

exploration-based retrieval
image databases
self-organizing feature maps


an indoor localization platform for ambient assisted living using uwb Localization of elderly people is considered to be a key task in ambient assisted living platforms. The problem of timely and valid emergency medical services notifications may be addressed in the context of a location-aware, event-triggered system provided an accurate, robust and reliable underlying localization system exists. Furthermore, first responders' reaction quality can improve considerably in the case where location-related information is available. In this paper, a system capable of providing localization data to an overlying ambient assisted living and event detection platform is presented, together with initial measurements results. Furthermore, the proposed localization technique offers enhanced accuracy and reliability with respect to a typical Ultra Wideband (UWB) system.

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

time of arrival
radio position measurement
indoor environments
direction of arrival


Metrics on the Relative Spacecraft Motion Invariant Manifold Abstract: This paper establishes a methodology for obtaining the general solution to the spacecraft relative motion problem by utilizing Cartesian configuration space in conjunction with classical orbital elements. The geometry of the relative motion configuration space is analyzed, and the relative motion invariant manifold is determined. Most importantly, the geometric structure of the relative motion problem is used to derive useful metrics for quantification of the minimum, maximum, and mean distance between spacecraft for commensurable and non-commensurable mean motions. A number of analytic solutions, as well as useful examples, are provided, illustrating the calculated bounds. A few particular cases are given that yield simple solutions.

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

metrics
relative spacecraft motion
invariant manifold


Solving hierarchical constraints over finite domains with local search Many real world problems have requirements and constraints which conflict with each other. One approach for dealing with such over-constrained problems is with constraint hierarchies. In the constraint hierarchy framework, constraints are classified into ranks, and appropriate solutions are selected using a comparator which takes into account the constraints and their ranks. In this paper, we present a local search solution to solving hierarchical constraint problems over finite domains (HCPs). This is an extension of local search for over-constrained integer programs WSAT(OIP) to constraint hierarchies and general finite domain constraints. The motivation for this work arose from solving large airport gate allocation problems. We show how gate allocation problems can be formulated as HCPs using typical gate allocation constraints. Using the gate allocation benchmarks, we investigate how constraint heirarchy selection strategies and the problem formulation using two models: a 0 - 1 linear constraint hierarchy model and a nonlinear finite domain constraint hierarchy model.

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

hierarchical constraints
finite domain constraints
airport gate allocation


The Linear Complexity of a Class of Binary Sequences with Three-Level Autocorrelation Binary sequences with good autocorrelation and large linear complexity have found many applications in communication systems. A construction of almost difference sets was given by Cai and Ding in 2009. Many classes of binary sequences with three-level autocorrelation could be obtained by this construction and the linear complexity of two classes of binary sequences from the construction have been determined by Wang in 2010. Inspired by the analysis of Wang, we deternime the linear complexity and the minimal polynomials of another class of binary sequences, i.e., the class based on the WG difference set, from the construction by Cai and Ding. Furthermore, a generalized version of the construction by Cai and Ding is also presented.

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


Construction of a Mindlin pseudospectral plate element and evaluating efficiency of the element In this paper, a Mindlin pseudospectral plate element is constructed to perform static, dynamic, and wave propagation analyses of plate-like structures. Chebyshev polynomials are used as basis functions and ChebyshevGaussLobatto points are used as grid points. Two integration schemes, i.e., GaussLegendre quadrature (GLEQ) and Chebyshev points quadrature (CPQ), are employed independently to form the elemental stiffness matrix of the present element. A lumped elemental mass matrix is generated by only using CPQ due to the discrete orthogonality of Chebyshev polynomials and overlapping of the quadrature points with the grid points. This results in a remarkable reduction of numerical operations in solving the equation of motion for being able to use explicit time integration schemes. Numerical calculations are carried out to investigate the influence of the above two numerical integration schemes in the elemental stiffness formation on the accuracy of static and dynamic response analyses. By comparing with the results of ABAQUS, this study shows that CPQ performs slightly better than GLEQ in various plates with different thicknesses, especially in thick plates. Finally, a one dimensional (1D) and a 2D wave propagation problems are used to demonstrate the efficiency of the present Mindlin pseudospectral plate element.

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


UPS: Universal Protocol Stack for emerging wireless networks Recent devices developed for emerging wireless networks, such as 4G cellular networks, wireless mesh networks, and mobile ad hoc networks, support multiple communication substrates and require execution of multiple protocols within a layer, which cannot be supported efficiently by traditional, layered protocol stack approaches. While cross-layer approaches can be designed to support these new requirements, the lack of modularity makes cross-layer approaches inflexible and hence difficult to adapt for future devices and protocols. Thus, there is a need for a new protocol architecture to provide universal support for cross-layer interactions between layers, while also supporting multiple communication substrates and multiple protocols within a stack. In this paper, we propose Universal Protocol Stack (UPS), which provides such support in a modular way through packet-switching, information-sharing and memory management. To show that UPS is realizable with very low overhead and that it enables concurrent and independent execution of protocols of the same stack layer, first, we present a wireless sensor network test-bed evaluation, where UPS is implemented in TinyOS and installed on individual sensor motes. Two cross-layer routing protocols are implemented and evaluated with UPS and without UPS. We also implemented UPS in the OPNET simulator, where the IP (e.g., Routing Information Protocol (RIP)) and AODV routing protocols are executed concurrently to support networks with both static and mobile wireless nodes. Our implementation shows that the overhead incurred to implement UPS is very low, and little or no modification is required to adapt existing protocols to the UPS framework. Both studies also show the advantage of enabling concurrent protocol execution within a stack layer, improving the successful packet delivery ratio or the total number of packets sent for the investigated scenarios.

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

protocol design
network algorithms
wireless communication
network protocol stack


Identification of movement-related cortical potentials with optimized spatial filtering and principal component analysis We present a method for detecting movement intention from multichannel electroencephalographic (EEG) recordings. Movement intention is expressed as a slow negative deflection in amplitude of the EEG signal recorded above the motor cortex. This deflection is known as a movement-related cortical potential (MRCP). Detection of movement intention implies discrimination between MRCPs and noise. The signal-to-noise ratio of MRCPs was improved by an optimized spatial filter. Features were extracted with principal component analysis or locality preserving projections from the spatially filtered signals and classification between MRCPs and noise was performed with a k-nearest neighbors algorithm, modified by adjusting the decision rule to improve specificity, and a support vector machine approach. In one representative subject the sensitivity and specificity in detection were in the range 8090% and 9899.5%, respectively. The method seems promising for the development of asynchronous braincomputer interfaces (BCIs) based on MRCPs.

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

movement-related cortical potential
event detection
k-nearest neighbor
braincomputer interface


An Improved Anchor Shot Detection Method Using Fitness of Face Location and Dissimilarity of Icon Region In this letter, we propose an improved anchor shot detection (ASD) method in at del to effectively retrieve anchor shots from news video The face location and dissimilarity of icon region are used to reduce false alarms in the proposed method According to the results of the experiment on several types of news video. the proposed method obtained high anchor detection results compared with previous methods

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

news analysis
minimum spanning tree
fuzzy c-means clustering