A Survey of Secure Mobile Ad Hoc Routing Protocols Several routing protocols have been proposed in recent years for possible deployment of Mobile Ad hoc Networks (MANETs) in military, government and commercial applications. In this paper, we review these protocols with a particular focus on security aspects. The protocols differ in terms of routing methodologies and the information used to make routing decisions. Four representative routing protocols are chosen for analysis and evaluation including: Ad Hoc on demand Distance Vector routing (AODV), Dynamic Source Routing (DSR), Optimized Link State Routing (OLSR) and Temporally Ordered Routing Algorithm (TORA). Secure ad hoc networks have to meet five security requirements: confidentiality, integrity, authentication, non-repudiation and availability. The analyses of the secure versions of the proposed protocols are discussed with respect to the above security requirements.

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

ad hoc networks
routing protocols
security


Hybrid Booleans In this paper, we present a novel method to compute Boolean operations on polygonal meshes. Given a Boolean expression over an arbitrary number of input meshes we reliably and efficiently compute an output mesh which faithfully preserves the existing sharp features and precisely reconstructs the new features appearing along the intersections of the input meshes. The term "hybrid" applies to our method in two ways: First, our algorithm operates on a hybrid data structure which stores the original input polygons (surface data) in an adaptively refined octree (volume data). By this we combine the robustness of volumetric techniques with the accuracy of surface-oriented techniques. Second, we generate a new triangulation only in a close vicinity around the intersections of the input meshes and thus preserve as much of the original mesh structure as possible (hybrid mesh). Since the actual processing of the Boolean operation is confined to a very small region around the intersections of the input meshes, we can achieve very high adaptive refinement resolutions and hence very high precision. We demonstrate our method on a number of challenging examples.

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

solid modeling
geometry processing
hybrid geometry representations


almost free concurrency! (using gof patterns) We present a framework that provides concurrency-enhanced versions of the GOF object-oriented design patterns. The main benefit of our work is that if programmers improve program modularity by applying standard GOF design patterns while using the reusable pattern implementations from our framework, they receive implicit concurrency for free.

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


Compliance Flow - Managing the compliance of dynamic and complex processes To develop a reliable system or product, the current best practice for the development process is typically embodied in standards and guidelines, such as IEC61508 for safety and ISO9001 for quality assurance. Generally, the standard proposes a framework, which deals in a systematic manner with all the activities necessary to achieve the required quality. However, every application of a given standard is different because of differences in project details. One serious limitation of current workflow systems is the lack of the ability to ensure that the specification and execution of a process are compliant with the standard. This paper presents the treatment of managing process compliance in the Compliance Flow system. Process-based reasoning is used to identify compliance errors within a user-defined process by matching it against the standard model during both process specification and process execution. Examples drawing on a version of IEC61508 are used to illustrate the mechanism of modelling and compliance checks. A case study of the development of a light-guard is discussed. (C) 2007 Elsevier B.V. All rights reserved.

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

workflow management systems
automated compliance checks
model of standards


Assimilation patterns in the use of electronic procurement innovations: A cluster analysis Electronic procurement innovations (EPI) have been adopted by many firms as a means of improving their procurement efficiency and effectiveness, but little research has been conducted to determine whether the assimilation of EPI really increases procurement productivity and which factors influence its assimilation. Drawing on data from 166 firms, we conducted an exploratory study to address these questions, using cluster analysis that revealed four different clusters or patterns of EPI assimilation: none, focused niche, asymmetric, and broad-based deployment. The level of EPI assimilation was closely related to procurement productivity. Greater levels of EPI assimilation were associated with higher levels of top management support and greater IT sophistication. Also, interesting patterns emerged between the various elements of EPI infrastructure capability, specifically flexibility and comprehensiveness of standards, EPI security, and the level of EPI assimilation.

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

procurement productivity
cluster analysis

electronic procurement innovations (epi)


A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs This paper considers solving a special case of the nonadditive traffic equilibrium problem presented by Gabriel and Bernstein [Transportation Science 31 (4) (1997) 337348] in which the cost incurred on each path is made up of the sum of the arc travel times plus a path-specific cost for traveling on that path. A self-adaptive projection and contraction method is suggested to solve the path-specific cost traffic equilibrium problem, which is formulated as a nonlinear complementarity problem (NCP). The computational effort required per iteration is very modest. It consists of only two function evaluations and a simple projection on the nonnegative orthant. A self-adaptive technique is embedded in the projection and contraction method to find suitable scaling factor without the need to do a line search. The method is simple and has the ability to handle a general monotone mapping F. Numerical results are provided to demonstrate the features of the projection and contraction method.

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


A priori error estimates for wireless local area network positioning systems Location determination based on wireless local area networks has received considerable attention as an accurate and inexpensive means of indoor positioning. Research on this topic has mainly focused on experimental systems while little has been done to model and analyse the problem. Yet, analytical models are essential for understanding the influence of system parameters and a systems overall behaviour. This article introduces two analytical models that can provide pessimistic and optimistic estimates for the location error in a given environment. The findings are compared to measurements and simulations of a probabilistic Wireless LAN positioning system.

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

location determination modelling
location error estimation


A Method of Parallelizing Consensuses for Accelerating Byzantine Fault Tolerance We propose a new method that accelerates asynchronous Byzantine Fault Tolerant (BFT) protocols designed on the principle of state machine replication. State machine replication protocols ensure consistency among replicas by applying operations in the same order to all of them. A naive way to determine the application order of the operations is to repeatedly execute the BFT consensus to determine the next executed operation, but this may introduce inefficiency caused by waiting for the completion of the previous execution of the consensus protocol. To reduce this inefficiency, our method allows parallel execution of the consensuses while keeping consistency of the consensus results at the replicas. In this paper, we also prove the correctness of our method and experimentally compare it with the existing method in terms of latency and throughput. The evaluation results show that our method makes a BFT protocol three or four times faster than the existing one when some machines or message transmissions are delayed.

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

byzantine fault tolerance
consensus
state machine replication

asynchronous distributed system
agreement


An integrated design flow for the joint generation of control and interfaces from a business model The design of large systems suffers from communication problems inside design team and inconsistencies in design documentation. We have identified two concurrent but complementary approaches for design. The first is a bottom-up approach where the design is made by aggregation of standard components. The second is a top-down approach where the design is made by successive refining of a model. This paper offers an integrated design flow for the joint generation of controls and users interfaces for reconfigurable sociotechnical systems. In accordance with our industrial feedback our approach is based on a business model called the synoptic, and on a library of standard elements. We describe the tool Anaxagore, that implements this approach and with which one can generate, in few minutes, a command and an interface for two simple input models. The results of the generation are consistent with the specifications. (C) 2013 Elsevier B.V. All rights reserved.

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

human-machine systems
control system design
human-machine interfaces
model driven engineering
process engineering


secure computer operation with virtual machine partitioning In an earlier paper, I noted the extremes to which one commercial company, System Development Corporation (SDC), has gone to satisfy its disparate security/privacy requirements; this may be typical of at least one-half of the industry. In brief, the solution is to have two CPUs; six different operating systems, including two custom products; six user classes from research and development to a Corporate Management Information System; and four blocked-time periods, i.e., Periods Processing, per machine. This distasteful Periods Processing (PP) solution is the only choice for demanding facility operators, short of not processing sensitive data, and the only one accepted by the U.S. Department of Defense.

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

sensitive
research
custom
data
secure
virtual machine
paper
system development
user
management

partition
industrial
developer
computation
operating system
operability
process
timing
privacy
informal
class


A Simple Computational Cell: Coupling Boolean Gene and Protein Networks This article presents an abstract, tunable model containing two of the principal information-processing features of cells and explores its use with simulated evolution. The random Boolean model of genetic regulatory networks is extended to include a protein interaction network. The underlying behavior of the resulting two coupled dynamical networks is investigated before their evolvability is explored using a version of the NK model of fitness landscapes.

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

discrete dynamical systems
protein interaction networks
rbnk model


Tile-boundary artifact reduction using odd tile size and the low-pass first convention It is well known that tile-boundary artifacts occur in wavelet-based lossy image coding. However, until now, their cause has not been understood well. In this paper, we show that boundary artifacts are an inescapable consequence of the usual methods used to choose tile size and the type of symmetric extension employed in a wavelet-based image decomposition system. This paper presents a novel method for reducing these tile-boundary artifacts. The method employs odd the sizes (2(N) + 1 samples) rather than the conventional even tile sizes (2(N) samples). It is shown that, for the same bit rate, an image compressed using an odd tile length low-pass first (OTLPF) convention has significantly less boundary artifacts than an image compressed using even tile sizes. The OTLPF convention can also be incorporated into the JPEG 2000 image compression algorithm using extensions defined in Part 2 of this standard.

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


A Symbolic Verifier for CUDA Programs We present a preliminary automated verifier based on mechanical decision procedures which is able to prove functional correctness of CUDA programs and guarantee to detect bugs such as race conditions. We also employ a symbolic partial order reduction (POR) technique to mitigate the interleaving explosion problem.

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

verification
formal verification
symbolic analysis
spmd


the locus distributed operating system LOCUS is a distributed operating system which supports transparent access to data through a network wide filesystem, permits automatic replication of storage, supports transparent distributed process execution, supplies a number of high reliability functions such as nested transactions, and is upward compatible with Unix. Partitioned operation of subnet's and their dynamic merge is also supported. The system has been operational for about two years at UCLA and extensive experience in its use has been obtained. The complete system architecture is outlined in this paper, and that experience is summarized.

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

network
use
replication
reliability
dynamic
storage
operating system
data
process
experience
paper
distributed
access
system architecture

systems transparency transaction completeness


An Integrated Planning and Adaptive Resource Management Architecture for Distributed Real-Time Embedded Systems Real-time and embedded systems have traditionally been designed for closed environments where operating conditions, input workloads, and resource availability are known a priori and are subject to little or no change at runtime. There is an increasing demand, however, for autonomous capabilities in open distributed real-time and embedded (DRE) systems that execute in environments where input workload and resource availability cannot be accurately characterized a priori. These systems can benefit from autonomic computing capabilities, such as self-(re)configuration and self-optimization, that enable autonomous adaptation under varying-even unpredictable-operational conditions. A challenging problem faced by researchers and developers in enabling autonomic computing capabilities to open DRE systems involves devising adaptive planning and resource management strategies that can meet mission objectives and end-to-end quality of service (QoS) requirements of applications. To address this challenge, this paper presents the Integrated Planning, Allocation, and Control (IPAC) framework, which provides decision-theoretic planning, dynamic resource allocation, and runtime system control to provide coordinated system adaptation and enable the autonomous operation of open DRE systems. This paper presents two contributions to research on autonomic computing for open DRE systems. First, we describe the design of IPAC and show how IPAC resolves the challenges associated with the autonomous operation of a representative open DRE system case study. Second, we empirically evaluate the planning and adaptive resource management capabilities of IPAC in the context of our case study. Our experimental results demonstrate that IPAC enables the autonomous operation of open DRE systems by performing adaptive planning and management of system resources.

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

real-time and embedded systems
distributed systems
hierarchical design


A polynomial time algorithm for strong edge coloring of partial k-trees A matching M in a graph is called induced if there is no edge in the graph connecting two edges of M. The strong edge coloring problem is to find an edge coloring of a given graph with minimum number of colors such that each color class is an induced matching. This problem is known to be NP-complete, even in very restricted cases. Here, we show that it can be solved in polynomial time on graphs with bounded treewidth, i.e partial k-trees. This answers an open question of Mahdian (Discrete Appl. Math. 118 (2002) 239).

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

strong matching
strong edge coloring
bounded tree-width


Redesigning multi-channel P2P live video systems with View-Upload Decoupling In current multi-channel P2P live video systems, there are several fundamental performance problems including exceedingly-large channel switching delays, long playback lags, and poor performance for less popular channels. These performance problems primarily stem from two intrinsic characteristics of multi-channel P2P video systems: channel churn and channel-resource imbalance. In this paper, we propose a radically different cross-channel P2P streaming framework, called View-Upload Decoupling (VUD). VUD strictly decouples peer downloading from uploading, bringing stability to multi-channel systems and enabling cross-channel resource sharing. We propose a set of peer assignment and bandwidth allocation algorithms to properly provision bandwidth among channels, and introduce substream-swarming to reduce the bandwidth overhead. We evaluate the performance of VUD via extensive simulations as well with a PlanetLab implementation. Our simulation and PlanetLab results show that VUD is resilient to channel churn, and achieves lower switching delay and better streaming quality. In particular, the streaming quality of small channels is greatly improved.

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


Registration for 3-D point cloud using angular-invariant feature This paper proposes an angular-invariant feature for 3-D registration procedure to perform reliable selection of point correspondence. The feature is a k k -dimensional vector, and each element within the vector is an angle between the normal vector and one of its k k nearest neighbors. The angular feature is invariant to scale and rotation transformation, and is applicable for the surface with small curvature. The feature improves the convergence and error without any assumptions about the initial transformation. Besides, no strict sampling strategy is required. Experiments illustrate that the proposed angular-based algorithm is more effective than iterative closest point (ICP) and the curvature-based algorithm.

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

3-d registration
angular invariant
curvature invariant
3-d point cloud


DEVELOPMENT AND OPTIMIZATION OF COMPUTATIONAL CHEMISTRY ALGORITHMS The challenges specific to the development; of computational chemistry software are discussed. Selected solutions are presented, including examples of algorithmic optimizations and improved load-balancing for parallel calculations. A software framework for development of new quantum-chemical algorithms is proposed. Key design points are discussed. Optimization techniques are briefly described. Important implementation aspects, like automatic code generation, are highlighted.

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

computational chemistry
optimization
software framework


Real wavepacket code for ABC plus D -> AB plus CD reactive scattering We discuss a six-dimensional, time-dependent real wavepacket (RWP) code designed to obtain reaction probabilities for ABC(v(l))+ D -> AB+CD four-atom reactions, where v(l) is a collective index for the initial quantum state of the triatomic molecule. The code provides exact results for total angular momentum J = 0, and invokes the helicity decoupling (or centrifugal sudden) approximation for J > 0. Our new RWP code has been extensively checked by considering the benchmark H + H2O -> H-2 + OH abstraction reaction.

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

reactive scattering
centrifugal sudden approximation
reaction probabilities

atom plus triatom reactions
time-dependent quantum mechanics
wavepackets
reaction dynamics
helicity decoupling approximation
reaction cross sections
reaction rate constants


Planning step-stress life-test with a target acceleration-factor A sequential approach is presented to plan a multiple-steps step-stress accelerated life test (SSALT) with type-I censoring so as to achieve a pre-specified acceleration factor. An initial optimal plan for a simple SSALT, where one not only has to determine the optimum hold-time under low stress but also the optimum low stress level, is obtained by solving a constrained non-linear program. A backward recursion scheme generates the subsequent optimal low-stress levels and hold-times for multiple-step SSALT. An illustration using a 3-step SSALT is presented. The relative efficiency of the 2-step and 3-step SSALT is investigated. A numerical example illustrates the method under 2-step and 3-step SSALT.

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

multiple steps
exponential distribution
optimal design


A stochastic model for the implementation of postponement strategies in global distribution networks When designing global production and distribution systems an important aspect becoming more and more relevant is the question of how to deal with demand uncertainties. Due to the proliferation of product variants that have to be handled in production and distribution, long lead times due to overseas transportation and increasingly volatile, uncertain and market specific demands, an appropriate concept to deal with these problems has to be established. One concept that has been proposed but not yet been fully explored in this context is postponement. In this concept the customization and finalization of a product is procrastinated, i.e., the final products are not completed in factories but in facilities of a distribution network that are located on the network from factories to customers. This may also entail a resequencing of manufacturing steps. Until now, research has mainly focused on general statements regarding advantages and disadvantages of postponement strategies. In contrast, quantitative models that allow for decision making for specific postponement implementations are rare, particularly models that explicitly take into account stochastic demands and long lead times. In order to allow for decision making for specific postponement implementations in uncertain environments, we present a two-stage stochastic mixed integer linear programming model in this paper. We design a case study inspired by decision support issues in the apparel industry. By means of this case study we show that the presented model formulation can support managers to determine an appropriate production and distribution network in uncertain environments. Benefits from the concept of postponement are exemplified using (commercially) available mathematical programming software.

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

network design
stochastic optimization
supply chain management


experiencing nfc-based touch for home healthcare Ambient Assisted Living (AAL) aims to enhance quality of life of elder and impaired people. Thanks to the advances in Information and Communication Technology (ICT) and medical technologies, it is now possible to support new home healthcare services to improve their quality of life. In particular, Near Field Communication Technology (NFC) seems to play an important role in elderly homecare. In this paper, a health monitoring system is shown where users can identify themselves by simple touch with an NFC-enabled device and different health information can be wirelessly collected and associated with the identified user. Furthermore, this system enables caregivers or physicians to monitor these health readings and patient actions at home. This system was tested with 17 users that led us to a better understanding of usability and effectiveness of this health system and user needs, and showed their preferences for a certain NFC-enabled device to be used in user identification.

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

healthcare
near field communication
ambient assisted living


A robust approach for multi-agent natural resource allocation based on stochastic optimization algorithms A decentralized machine learning method that deals with learning in non-communicating non-observable stochastic games. Embeds domain knowledge using a parameterized function that is automatically estimated using stochastic optimization. The proposed method was applied on a realistic large scale multiagent simulation model of natural resource allocation. Experiments revealed the robustness and superiority of the proposed method, compared to decentralized Q-learning variants.

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

natural resource allocation
stochastic optimization

multi-agent learning
evolutionary methods
genetic algorithms
covariance matrix adaptation


Life time comparison of LED package and the self-ballasted LED lamps by simple linear regression analysis We try to find out new approach for LED Lamp's life based on single LED life. We use slop compare with single LDE package and LED lamp life We show at each thermal stress for increasing number of LED

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


Thermophysical and thermochemical properties on-demand for chemical process and product design The article provides a perspective of chemical process and product design on-demand, plus its implementation and impact in addressing modern challenges faced by the chemical industry. The concepts of Global Information Systems in Science and Engineering in application to the field of thermodynamics as well as Dynamic Data Evaluation for thermophysical and thermochemical properties are discussed as underlying principles for implementation of chemical process and product design on-demand. Published by Elsevier Ltd.

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

dynamic data evaluation
global information systems
product design
thermochemical properties

on demand
process design
thermophysical properties


A family of elliptic curve pseudorandom binary sequences In this paper we give a new family of elliptic curve pseudorandom binary sequences, and study the well-distribution, correlation, linear complexity, collision and avalanche effect of the family of sequences, by using the estimate of exponential sums over elliptic curves.

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

correlation
linear complexity
collision
avalanche effect


Automatic detection of residential buildings using LIDAR data and multispectral imagery This paper presents an automatic building detection technique using LIDAR data and multispectral imagery. Two masks are obtained from the LIDAR data: a primary building mask and a secondary building mask. The primary building mask indicates the void areas where the laser does not reach below a certain height threshold. The secondary building mask indicates the filled areas, from where the laser reflects, above the same threshold. Line segments are extracted from around the void areas in the primary building mask. Line segments around trees are removed using the normalized difference vegetation index derived from the orthorectified multispectral images. The initial building positions are obtained based on the remaining line segments. The complete buildings are detected from their initial positions using the two masks and multispectral images in the YIQ colour system. It is experimentally shown that the proposed technique can successfully detect urban residential buildings, when assessed in terms of 15 indices including completeness, correctness and quality.

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

building detection
lidar
multispectral imagery


Transmission-Efficient Broadcast Encryption Scheme with Personalized Messages Broadcast encryption scheme with personalized messages (BEPM) is a new primitive that allows a broadcaster to encrypt both a common message and individual messages. BEPM is necessary in applications where individual messages include information related to user's privacy. Recently, Fujii et al. suggested a BEPM that is extended from a public key broadcast encryption (PKBE) scheme by Boneh, Gentry, and Waters. In this paper, we point out that 1) Conditional Access System using Fujii et al's BEPM should be revised in a way that decryption algorithm takes as input public key as well, and 2) performance analysis of Fujii et al.'s BEPM should be done depending on whether the public key is transmitted along with ciphertext or stored into user's device. Finally, we propose a new BEPM that is transmission-efficient, while preserving 0(1) user storage cost. Our construction is based on a PKBE scheme suggested by Park, Kim, Sung, and Lee, which is also considered as being one of the best PKBE schemes.

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

broadcast encryption
conditional access system
personalized messages


Distributed identification of the lineality space of a cone A distributed approach is described for solving lineality (or linearity) space (LS) problems with large cardinalities and a large number of dimensions. The LS solution has applications in engineering, science, and business, and includes a subset of solutions of the more general extended linear complementarity problem (ELCP). A parallel MATLAB framework is employed and results are computed on an 8-node Rocks based cluster computer using Remote Procedure Calls (RPCs) and the MPICH2 Message Passing Interface (MPI). Results show that both approaches perform comparably when solving distributed LS problems. This indicates that when deciding which parallel approach to use, the implementation details particular to the method are the decisive factors, which in this investigation give MPICH2 MPI the advantage.

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

beowulf cluster
parallel distribution
generators
positive hull


Multi-stakeholder collaboration in the redesign of family-centered rounds process We explored stakeholder experience with collaboration in healthcare system redesign. We proposed a model of stakeholder collaboration in healthcare system redesign. We identified challenges to stakeholder collaboration in healthcare system redesign.

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

multi-stakeholder collaboration
family-centered rounds


an efficient finite-domain constraint solver for circuits We present a novel hybrid finite-domain constraint solving engine for RTL circuits, that automatically uses data-path abstraction. We describe how DPLL search can be modified by using efficient finite-domain constraint propagation to improve communication between interacting integer and Boolean domains. This enables efficient combination of Boolean SAT and linear integer arithmetic solving techniques. We use conflict-based learning using the variables on the boundary of control and data-path for additional performance benefits. Finally, the hybrid constraint solver is experimentally analyzed using some example circuits.

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

design verification
boolean satisfiability
constraints
integer linear programming
decision procedures
bit-vector arithmetic


an aspect-oriented generative approach The integration of generative and aspect-oriented techniques is not a trivial task. This paper describes our experience in the definition of an aspect-oriented generative approach for the context of multi-agent systems. Our generative approach is composed of: (i) a domain-specific language called Agent-DSL, which allows to model crosscutting and non-crosscuting agent features; (ii) an aspect-oriented architecture that models a family of software agents; and (iii) a code generator that maps abstractions of the Agent-DSL to specific compositions of objects and aspects in specific implementations of agent architectures. The use of aspect-oriented techniques in the definition of our generative approach brought benefits to the modeling and code generation of crosscutting features since early design stages.

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

aspect-oriented software development
multi-agent systems
generative programming


People and computers some recent highlights This paper aims to review selectively a fair proportion of the literature on humancomputer interaction (HCI) over the three years since Shackel (J. Am. Soc. Inform. Sci. 48 (11) (1997) 970986). After a brief note of history I discuss traditional input, output and workplace aspects, the web and E-topics, web-related aspects, virtual reality, safety-critical systems, and the need to move from HCI to human-system integration (HSI). Finally I suggest, and consider briefly, some future possibilities and issues including web consequences, embedded ubiquitous computing, and back to systems ergonomics?.

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

humancomputer interaction
systems ergonomics


Efficient exact evaluation of signs of determinants This paper presents a theoretical and experimental study on two different methods to evaluate the sign of a determinant with integer entries. The first one is a method based on the Gram-Schmidt orthogonalization process which has been proposed by Clarkson [Cl]. We review his algorithm and propose a variant of his method, for which we give a complete analysis. The second method is an extension to n x n determinants of the ABDPY method [ABD(+)2] which works only for 2 x 2 and 3 x 3 determinants. Both methods compute the sign of an n x n determinant whose entries are integers on b bits, by using exact arithmetic on only b + O(n) bits. Furthermore, both methods are adaptive, dealing quickly with easy cases and resorting to full-length computation only for null determinants.

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

computational geometry
precision
robust algorithms


Custom Networks-on-Chip Architectures With Multicast Routing In this paper, we consider the problem of synthesizing custom networks-on-chip (NoC) architectures that are optimized for a given application. We consider both unicast and multicast traffic flows in the input specification. Multicast traffic flows are used in a variety of applications, and their direct support with only replication of packets at optimal bifurcation points rather than full end-to-end replication can significantly reduce network contention and resource requirements. Our problem formulation is based on the decomposition of the problem into the inter-related steps of finding good flow partitions, deriving a good physical network topology for each group in the partition, and providing an optimized network implementation for the derived topologies. Our solutions may be comprised of multiple custom networks, each interconnecting a subset of communicating modules. We propose several algorithms that can systematically examine different flow partitions, and we propose Rectilinear-Steiner-Tree (RST)-based algorithms for generating efficient network topologies. Our design flow integrates floorplanning, and our solutions consider deadlock-free routing. Experimental results on a variety of NoC benchmarks showed that our synthesis results can on average achieve a 4.82 times reduction in power consumption over different mesh implementations on unicast benchmarks and a 1.92 times reduction in power consumption on multicast benchmarks. Significant improvements in performance were also achieved, with an average of 2.92 times reduction in hop count on unicast benchmarks and 1.82 times reduction in hop count on multicast benchmarks. To further gauge the effectiveness of our heuristic algorithms, we also implemented an exact algorithm that enumerates all distinct set partitions. For the benchmarks where exact results could be obtained, our algorithms on average can achieve results within 3% of exact results, but with much shorter execution times.

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

network-on-chip (noc)
system-on-chip (soc)


A quantitative study on the influence of ASON/GMPLS on OPEX ASON/GMPLS is promoted as one of the key technologies to reduce operational expenditures (OPEX) of network operators, since it provides the tools for automating the network operations. This paper gives a detailed model and qualitative analysis of the major OPEX-affecting operation processes in the area of core and metropolitan area transport networks. Moreover, a first quantitative evaluation of the changes in the operational efforts induced by ASON/GMPLS is described. The evaluation shows a significant potential to reduce OPEX, which is to some extent independent of the type of operator.

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


Asynchronous sequential processes Deterministic behavior for parallel and distributed computation is rather difficult to ensure. To reach that goal, many formal calculi, languages, and techniques with well-defined semantics have been proposed in the past. But none of them focused on an imperative object calculus with asynchronous communications and futures. in this article, an object calculus, Asynchronous Sequential Processes (ASP), is defined, with its semantics. We prove also confluence properties for the ASP calculus. ASPs main characteristics are asynchronous communications with futures, and sequential execution within each process. This paper provides a very general and dynamic property ensuring confluence. Further, more specific and static properties are derived. Additionally, we present a formalization of distributed components based on ASP, and show how such components are used to statically ensure determinacy. This paper can also be seen as a formalization of the concept of futures in a distributed object setting. (C) 2009 Elsevier Inc. All rights reserved

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

concurrency
distribution
parallelism
object-oriented languages
determinism


EC3: Elastic Cloud Computing Cluster We developed a tool that creates elastic virtual clusters on top of IaaS Clouds. It manages the cluster size to dynamically adapt to its workload. It enables the interaction with different IaaS Cloud backends. Clusters become self-managed without requiring external entities. Significant cost savings are obtained for such clusters in Amazon EC2.

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


Computational algorithms and neuronal network models underlying decision processes Animals or humans often encounter such situations in which they must choose their behavioral responses to be made in the near or distant future. Such a decision is made through continuous and bidirectional interactions between the environment surrounding the brain and its internal state or dynamical processes. Therefore, decision making may provide a unique field of researches for studying information processing by the brain, a biological system open to information exchanges with the external world. To make a decision, the brain must analyze pieces of information given externally, past experiences in a similar situation, possible behavioral responses, and predicted outcomes of the individual responses. In this article, we review results of recent experimental and theoretical studies of neuronal substrates and computational algorithms for decision processes.

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

recurrent network
neural integrator
bistable neurons
reward
reinforcement learning
td error
matching behavior


Cellular genetic algorithms without additional parameters Cellular genetic algorithms (cGAs) are a kind of genetic algorithms (GAs) with decentralized population in which interactions among individuals are restricted to close ones. The use of decentralized populations in GAs allows to keep the population diversity for longer, usually resulting in a better exploration of the search space and, therefore, in a better performance of the algorithm. However, it supposes the need of several new parameters that have a major impact on the behavior of the algorithm. In the case of cGAs, these parameters are the population and neighborhood shapes. We propose in this work two innovative cGAs with new adaptive techniques that allow removing the neighborhood and population shape from the algorithms configuration. As a result, the new adaptive cGAs are highly competitive (statistically) with all the compared cGAs in terms of the average solutions found in the continuous and combinatorial domains, while finding, in general, the best solutions for the considered problems, and with less computational effort.

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

adaptive algorithms
cellular populations
evolutionary algorithm


Quasi-Chebyshev splines with connection matrices: application to variable degree polynomial splines Extending a result recently obtained for Chebyshevian splines, we give a necessary and sufficient condition for the existence of blossoms (or, equivalently, of B-spline bases) for splines with connection matrices and with sections in different four-dimensional quasi-Chebyshev spaces. We apply this result to the study of variable degree polynomial splines. (C) 2001 Elsevier Science B.V. All rights reserved.

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

connection matrices
variable degree polynomial splines

chebyshev blossoming
b-spline basis
osculating flats
quasi-chebyshev splines


Efficient parallel recognition of cographs In this paper, we establish structural properties for the class of complement reducible graphs or cographs, which enable us to describe efficient parallel algorithms for recognizing cographs and for constructing the cotree of a graph if it is a cograph; if the input graph is not a cograph, both algorithms return an induced P4 P 4 . For a graph on n n vertices and m m edges, both our cograph recognition and cotree construction algorithms run in O ( log 2 n ) time and require O((n+m)/logn) O ( ( n + m ) / log n ) processors on the EREW PRAM model of computation. Our algorithms are motivated by the work of Dahlhaus (Discrete Appl. Math. 57 (1995) 2944) and take advantage of the optimal O(logn) O ( log n ) -time computation of the co-connected components of a general graph (Theory Comput. Systems 37 (2004) 527546) and of an optimal O(logn) O ( log n ) -time parallel algorithm for computing the connected components of a cograph, which we present. Our results improve upon the previously known linear-processor parallel algorithms for the problems (Discrete Appl. Math. 57 (1995) 2944; J. Algorithms 15 (1993) 284313): we achieve a better time-processor product using a weaker model of computation and we provide a certificate (an induced P4 P 4 ) whenever our algorithms decide that the input graphs are not cographs.

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

cographs
cotree
parallel algorithms
parallel recognition

perfect graphs
connected and co-connected components
certifying algorithms


Profiling instances in noise reduction ? The dependency on the quality of the training data has led to significant work in noise reduction for instance-based learning algorithms. This paper presents an empirical evaluation of current noise reduction techniques, not just from the perspective of their comparative performance, but from the perspective of investigating the types of instances that they focus on for removal. A novel instance profiling technique known as RDCL profiling allows the structure of a training set to be analysed at the instance level categorising each instance based on modelling their local competence properties. This profiling approach offers the opportunity of investigating the types of instances removed by the noise reduction techniques that are currently in use in instance-based learning. The paper also considers the effect of removing instances with specific profiles from a dataset and shows that a very simple approach of removing instances that are misclassified by the training set and cause other instances in the dataset to be misclassified is an effective noise reduction technique.

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

instance based learning
case-based editing
visualisation


Downlink data transmission scheduling algorithms in wireless networks The problem of downlink data transmission scheduling in wireless networks is studied. It is pointed out that every downlink data transmission scheduling algorithm must have two components to solve the two subproblems of power assignment and transmission scheduling. Two types of downlink data transmission scheduling algorithms are proposed. In the first type, power assignment is performed before transmission scheduling. In the second type, power assignment is performed after transmission scheduling. The performance of two algorithms of the first type which use the equal power allocation method are analyzed. It is shown that both algorithms exhibit excellent worst-case performance and asymptotically optimal average-case performance under the condition that the total transmission power is equally allocated to the channels. In general, both algorithms exhibit excellent average-case performance. It is demonstrated that two algorithms of the second type perform better than the two algorithms of the first type due to the equal time power allocation method. Furthermore, the performance of our algorithms are very close to the optimal and the room for further performance improvement is very limited. It is shown that all the above algorithms can be extended to schedule downlink data transmissions with parallel channels. It is also shown that the simple sequential scheduling algorithm is optimal if the total transmission power is equally allocated to the channels. As an extra contribution, an M/G/1 queueing model for the FCFS queueing discipline is established, and it is observed that increasing the number of channels has more impact on the reduction of the average response time than increasing the total transmission power.

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

downlink data transmission
power assignment
transmission scheduling

average-case performance
simulation
wireless network
worst-case performance


Efficient Fuzzy Search in Large Text Collections We consider the problem of fuzzy full-text search in large text collections, that is, full-text search which is robust against errors both on the side of the query as well as on the side of the documents. Standard inverted-index techniques work extremely well for ordinary full-text search but fail to achieve interactive query times (below 100 milliseconds) for fuzzy full-text search even on moderately-sized text collections (above 10 GBs of text). We present new preprocessing techniques that achieve interactive query times on large text collections (100 GB of text, served by a single machine). We consider two similarity measures, one where the query terms match similar terms in the collection (e.g., algorithm matches algoritm or vice versa) and one where the query terms match terms with a similar prefix in the collection (e.g., alori matches algorithm). The latter is important when we want to display results instantly after each keystroke (search as you type). All algorithms have been fully integrated into the CompleteSearch engine.

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

design
experimentation
performance
theory
approximate dictionary search
approximate text search
error tolerant autocomplete
hyb index
inverted index


Modelling the dispersion of aerial pollutants from agricultural buildings - an evaluation of computational fluid dynamics (CFD) Agricultural buildings, especially those used for intensive livestock production, are significant sources of aerial pollutants. This paper explores some of the computational modelling methods available to predict near field concentrations of a pollutant emitted from a building opening. The modelling approaches used here are restricted in application to effectively weightless particles, such as a low concentration pollutant gas. The how patterns were predicted using computational fluid dynamics (CFD) and linked to this computed flow field were two dispersion models, a Eulerian diffusion model and a Lagrangian particle tracking technique, both used to predict ensemble mean gas concentration. Explicit account has been taken here of variations in mean wind direction, using a new technique based on the weighted summation of individual wind direction results according to the probability density function of the wind direction. The atmospheric boundary layer is characterised by variations in wind direction that do not occur in simulated wind tunnel flows and are not generally reproduced in current computational methods. For comparison, the results of the modelling approach are compared with mean concentrations of ammonia gas released as a tracer from an isolated low rise building. The results of this comparison indicate that at a distance of more than three building heights downstream the predictions from both models are satisfactory but that in the near wake the diffusion model is less successful. The weighted solutions, taking account of wind direction, give significantly improved predictions over unweighted results. Lack of plume spread is identified as the main cause of inaccuracies in predictions and this is linked to inadequate resolution of flow features and mixing in the CFD model. The use of modelling based on CFD and existing dispersion models is clearly limited and further work on non-steady state simulations of wake Rows for dispersion studies is required. (C) 2001 Elsevier Science B.V. All rights reserved.

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

dispersion modelling
pollution
environment
atmosphere


Robustness Analysis of Global Exponential Stability of Recurrent Neural Networks in the Presence of Time Delays and Random Disturbances In recent years, the global stability of recurrent neural networks (RNNs) has been investigated extensively. It is well known that time delays and external disturbances can derail the stability of RNNs. In this paper, we analyze the robustness of global stability of RNNs subject to time delays and random disturbances. Given a globally exponentially stable neural network, the problem to be addressed here is how much time delay and noise the RNN can withstand to be globally exponentially stable in the presence of delay and noise. The upper bounds of the time delay and noise intensity are characterized by using transcendental equations for the RNNs to sustain global exponential stability. Moreover, we prove theoretically that, for any globally exponentially stable RNNs, if additive noises and time delays are smaller than the derived lower bounds arrived at here, then the perturbed RNNs are guaranteed to also be globally exponentially stable. Three numerical examples are provided to substantiate the theoretical results.

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

global exponential stability
random disturbances
recurrent neural networks
robustness
time delays


Developmental Stereo: Emergence of Disparity Preference in Models of the Visual Cortex How our brains develop disparity tuned V1 and V2 cells and then integrate binocular disparity into 3-D perception of the visual world is still largely a mystery. Moreover, computational models that take into account the role of the 6-layer architecture of the laminar cortex and temporal aspects of visual stimuli are elusive for stereo. In this paper, we present cortex-inspired computational models that simulate the development of stereo receptive fields, and use developed disparity sensitive neurons to estimate binocular disparity. Not only do the results show that the use of top-down signals in the form of supervision or temporal context greatly improves the performance of the networks, but also results in biologically compatible cortical maps-the representation of disparity selectivity is grouped, and changes gradually along the cortex. To our knowledge, this work is the first neuromorphic, end-to-end model of laminar cortex that integrates temporal context to develop internal representation, and generates accurate motor actions in the challenging problem of detecting disparity in binocular natural images. The networks reach a subpixel average error in regression, and 0.90 success rate in classification, given limited resources.

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

binocular vision
neuromorphic modeling
spatiotemporal
six-layer laminar cortical architecture


Example-driven meta-model development The intensive use of models in model-driven engineering (MDE) raises the need to develop meta-models with different aims, such as the construction of textual and visual modelling languages and the specification of source and target ends of model-to-model transformations. While domain experts have the knowledge about the concepts of the domain, they usually lack the skills to build meta-models. Moreover, meta-models typically need to be tailored according to their future usage and specific implementation platform, which demands knowledge available only to engineers with great expertise in specific MDE platforms. These issues hinder a wider adoption of MDE both by domain experts and software engineers. In order to alleviate this situation, we propose an interactive, iterative approach to meta-model construction, enabling the specification of example model fragments by domain experts, with the possibility of using informal drawing tools like Dia or yED. These fragments can be annotated with hints about the intention or needs for certain elements. A meta-model is then automatically induced, which can be refactored in an interactive way, and then compiled into an implementation meta-model using profiles and patterns for different platforms and purposes. Our approach includes the use of a virtual assistant, which provides suggestions for improving the meta-model based on well-known refactorings, and a validation mode, enabling the validation of the meta-model by means of examples.

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

meta-modelling
domain-specific modelling languages
interactive meta-modelling
meta-model induction
example-driven modelling
meta-model design exploration
meta-model validation


The Adaptive Direction Selection Mechanism for Estimation Obstacle Areas in Smart Sensor Environments We propose a cellular automat (CA) mechanism to form hole-like shapes with each of several sensor nodes equipped with a directional antenna called CACR-DOA. In the system, we use an adaptive beamformer that can receive useful signals and adjust receiving angles through direction-of-arrival (DOA) estimations. We analyze single sources and links with sensor nodes to form a path around a given holes margins. This works proposed mechanism uses different receiving angles to detect a single source, and through the source message, we can detect and determine the given holes margins. We use cognitive radio (CR) to estimate the energy of sensor nodes. We also propose energy consumption control via a game scheme to prolong sensor nodes lifetime. This innovative mechanism increases performance and convenience, and improves our ability to make rigorous calculations regarding environmental topography.

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


Visualization and Analysis of Second-Order Tensors: Moving Beyond the Symmetric Positive-Definite Case Tensors provide a powerful language to describe physical phenomena. Consequently, they have a long tradition in physics and appear in various application areas, either as the final result of simulations or as intermediate product. Due to their complexity, tensors are hard to interpret. This motivates the development of well-conceived visualization methods. As a sub-branch of scientific visualization, tensor field visualization has been especially pushed forward by diffusion tensor imaging. In this review, we focus on second-order tensors that are not diffusion tensors. Until now, these tensors, which might be neither positive-definite nor symmetric, are under-represented in visualization and existing visualization tools are often not appropriate for these tensors. Hence, we discuss the strengths and limitations of existing methods when dealing with such tensors as well as challenges introduced by them. The goal of this paper is to reveal the importance of the field and to encourage the development of new visualization methods for tensors from various application fields.

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

second-order tensors
tensor visualization


Fast computation of equispaced Pareto manifolds and Pareto fronts for multiobjective optimization problems In this paper, we consider the problem of generating a well sampled discrete representation of the Pareto manifold or the Pareto front corresponding to the equilibrium points of a multi-objective optimization problem. We show how the introduction of simple additional constraints into a continuation procedure produces equispaced points in either of those two sets. Moreover, we describe ill detail a novel algorithm for global continuation that requires two orders of magnitude less function evaluations than evolutionary algorithms commonly used to solve this problem. The performance of the methods is demonstrated on problems from the current literature. (C) 2007 IMACS. Published by Elsevier B.V. All rights reserved.

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

pareto manifolds
pareto fronts
multiobjective optimization


Optimal Replacement Policy for Multi-State System Under Imperfect Maintenance A multi-state system (MSS) has more than two discrete states corresponding to different performance rates. Usually, MSS is viewed as in a failure state once its performance rate falls below user demand, and maintenance is carried out immediately. Generally, the repaired system cannot be regarded as good as new, and oftentimes the system restoration is stochastic. We introduce an optimal replacement policy for MSSs, called policy. Under this policy, a MSS is replaced whenever its failure number reaches. We assess the dynamic element state probabilities of each aging multi-state element (MSE) using a stochastic process model which is identified as a non-homogeneous continuous time Markov model (NHCTMM), and we evaluate the state distribution of the entire MSS via the combination of the stochastic process, and the universal generating function (UGF). To quantify the quality of imperfect maintenance, a quasi-renewal process is used to describe the stochastic behavior of each individual MSE after repair. Moreover, we derive an explicit expression of the long-run expected profit per unit time, and determine the optimal failure number to replace the entire system. The proposed models are demonstrated via an illustrative case, followed by some comparative studies.

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

imperfect maintenance
universal generating function

non-homogeneous continuous time markov model


Sub-mA single ended CMOS low noise amplifier with 2.41 dB noise figure This paper presents a single ended low noise amplifier (LNA) using 0.18 mu m CMOS process packed and tested on a printed circuit board. The LNA is powered at 1.0 V supply and drains 0.95 mA only. The LNA provides a forward gain of 11.91 dB with a noise figure of only 2.41 dB operating in the 0.9 GHz band. The measured value of IIP3 is 0.7 dBm and of P1dB is -12 dBm.

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


Parameter estimation of the copernicus decompression model with venous gas emboli in human divers Decompression Sickness (DCS) may occur when divers decompress from a hyperbaric environment. To prevent this, decompression procedures are used to get safely back to the surface. The models whose procedures are calculated from, are traditionally validated using clinical symptoms as an endpoint. However, DCS is an uncommon phenomenon and the wide variation in individual response to decompression stress is poorly understood. And generally, using clinical examination alone for validation is disadvantageous from a modeling perspective. Currently, the only objective and quantitative measure of decompression stress is Venous Gas Emboli (VGE), measured by either ultrasonic imaging or Doppler. VGE has been shown to be statistically correlated with DCS, and is now widely used in science to evaluate decompression stress from a dive. Until recently no mathematical model has existed to predict VGE from a dive, which motivated the development of the Copernicus model. The present article compiles a selection experimental dives and field data containing computer recorded depth profiles associated with ultrasound measurements of VGE. It describes a parameter estimation problem to fit the model with these data. A total of 185 square bounce dives from DCIEM, Canada, 188 recreational dives with a mix of single, repetitive and multi-day exposures from DAN USA and 84 experimentally designed decompression dives from Split Croatia were used, giving a total of 457 dives. Five selected parameters in the Copernicus bubble model were assigned for estimation and a non-linear optimization problem was formalized with a weighted least square cost function. A bias factor to the DCIEM chamber dives was also included. A Quasi-Newton algorithm (BFGS) from the TOMLAB numerical package solved the problem which was proved to be convex. With the parameter set presented in this article, Copernicus can be implemented in any programming language to estimate VGE from an air dive.

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

nonlinear optimization
ultrasound
decompression sickness


An integrative study of information systems security effectiveness As organizations become increasingly dependent on information systems (IS) for strategic advantage and operations, the issue of IS security also becomes increasingly important. In the interconnected electronic business environment of today, security concerns are paramount. Management must invest in IS security to prevent abuses that can lead to competitive disadvantage. Using the literature on security practices and organizational factors, this study develops an integrative model of IS security effectiveness and empirically tests the model. The data were collected through a survey of IS managers from various sectors of the economy. Small and medium-sized enterprises were found to engage in fewer deterrent efforts compared to larger organizations. Organizations with stronger top management support were found to engage in more preventive efforts than organizations with weaker support from higher management. Financial organizations were found to undertake more deterrent efforts and have stiffer deterrent severity than organizations in other sectors. Moreover, greater deterrent efforts and preventive measures were found to lead to enhanced IS security effectiveness. Implications of these findings for further research and practice are discussed.

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

information systems
strategic advantage
security
organizations


Generalized discrete event simulation of dynamic systems Given a process whose output is a dynamic function of time, the traditional discrete event abstraction approximates the input, output, and state trajectories through piecewise constant segments. For processes that defy accurate modeling through piecewise constant segments, this paper presents GDEVS, a Generalized Discrete Event Specification, wherein the trajectories are organized through piecewise polynomial segments. The utilization of arbitrary polynomial functions for segments promises higher accuracies in modeling continuous processes as discrete event abstractions that, in turn, permit faster execution on host computers in contrast to continuous simulations. A key contribution of GDEVS is that it permits the development of a uniform simulation environment for hybrid, i.e., both continuous and discrete, systems. For complex systems that employ hierarchical descriptions, the need to interconnect models at different levels of abstraction gives rise to the issue of coupled models in GDEVS. This paper introduces the notion of a coupled model and illustrates with examples of GDEVS simulations of continuous systems.

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

discrete event model
devs
hybrid systems


Optimal frequency hopping sequences: A combinatorial approach Frequency hopping multiple access (FHMA) spread-spectrum communication systems employing multiple frequency-shift keying (MFSK) as data modulation technique are investigated from a combinatorial approach. A correspondence between optimal frequency hopping (FH) sequences and partition-type difference packings is first established. By virtue of this correspondence, FHMA systems with a single optimal FH sequence each are constructed from various combinatorial structures such as affine geometries, cyclic designs, and difference families. Combinatorial recursive constructions are also presented. Many new infinite series of optimal FH sequences are thus obtained. These new FH sequences are also useful in ultra wideband (UWB) communication 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 B I O O O O O O O O O O O O O O O O O O O O O O O O O B I B I O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

affine geometries
cyclic designs
difference families
difference packings

1-rotational designs
difference matrices
frequency hopping (fh) sequences
partition type
resolvable designs
ultra wideband (uwb)


Using the first-level caches as filters to reduce the pollution caused by speculative memory references High-performance processors employ aggressive branch prediction and prefetching techniques to increase performance. Speculative memory references caused by these techniques sometimes bring data into the caches that are not needed by correct execution. This paper proposes the use of the first-level caches as filters that predict the usefulness of speculative memory references. With the proposed technique, speculative memory references bring data only into the first-level caches rather than all levels in the cache hierarchy. The processor monitors the use of the cache blocks in the first-level caches and decides which blocks to keep in the cache hierarchy based on the usefulness of cache blocks. It is shown that a simple implementation of this technique usually outperforms inclusive and exclusive baseline cache hierarchies commonly used by today's processors and results in IPC performance improvements of up to 10% on the SPEC CPU2000 integer benchmarks.

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

cache pollution
cache filtering
runahead execution


A new statistical strategy for pooling: ELI We present a new statistical method, namely ELI, for forming assessment pools. This method is adaptive to the standard TREC practice without employing any extra human effort. A methodology for evaluating the effectiveness analysis is constructed. ELIs? pools are significantly more effective than a corresponding TREC type pool generated by TREC 5 data.

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

information retrieval
expected level of importance


Factors influencing acceptance of technology for aging in place: A systematic review Overview of factors influencing acceptance of electronic technology for aging in place. Comparison between pre- and post-implementation factors. Comparison between results from qualitative and quantitative research. Recommendations for research in this field.

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

independent living
aged
behavior
assistive technology
ehealth


The diatomic anharmonic oscillator according to matrix mechanics We determine the energies of states of the diatomic anharmonic oscillator by matrix mechanics in its original form as developed by Heisenberg, Born and Jordan using perturbation theory in successive orders. We present exact formulae for the second-, fourth-, and sixth-order contributions to the energy that were computed with Maple. The calculations involve matrices of finite rank with symbolic entries. We include the Maple programs. (C) 1999 IMACS/Elsevier Science B.V. All rights reserved.

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

anharmonic oscillator
matrix mechanics
maple programs


A TAXONOMY OF DETERMINISTIC FORGETTING AUTOMATA We investigate deterministic forgetting automata, i.e., deterministic linear bounded automata which can only use the operations 'move', 'erase' (rewrite with a blank symbol) and 'delete' (remove completely). We give a taxonomy of deterministic forgetting automata and draw comparisons to other kinds of automata (namely deterministic one-turn pushdown automata and one-way one-counter automata).

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

counter automata
deterministic context-free languages
deterministic linear languages


Characterization of 2 (n) -periodic binary sequences with fixed 2-error or 3-error linear complexity The linear complexity of sequences is an important measure of the cryptographic strength of key streams used in stream ciphers. The instability of linear complexity caused by changing a few symbols of sequences can be measured using k-error linear complexity. In their SETA 2006 paper, Fu et al. (SETA, pp. 88-103, 2006) studied the linear complexity and the 1-error linear complexity of 2 (n) -periodic binary sequences to characterize such sequences with fixed 1-error linear complexity. In this paper we study the linear complexity and the k-error linear complexity of 2 (n) -periodic binary sequences in a more general setting using a combination of algebraic, combinatorial, and algorithmic methods. This approach allows us to characterize 2 (n) -periodic binary sequences with fixed 2- or 3-error linear complexity. Using this characterization we obtain the counting function for the number of 2 (n) -periodic binary sequences with fixed k-error linear complexity for k = 2 and 3.

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

periodic sequence
k-error linear complexity


AMAZING: A sentiment mining and retrieval system With the rapid growth of e-commerce, there are a great number of customer reviews on the e-commerce websites. Generally, potential customers usually wade through a lot of on-line reviews in order to make an informed decision. However, retrieving sentiment information relevant to customer's interest still remains challenging. Developing a sentiment mining and retrieval system is a good way to overcome the problem of overloaded information in customer reviews. In this paper, we propose a sentiment mining and retrieval system which mines useful knowledge from consumer product reviews by utilizing data mining and information retrieval technology. A novel ranking mechanism taking temporal opinion quality (TOQ) and relevance into account is developed to meet customers' information need. Besides the trend movement of customer reviews and the comparison between positive and negative evaluation are presented visually in the system. Experimental results on a real-world data set show the system is feasible and effective. (C) 2008 Elsevier Ltd. All rights reserved.

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

sentiment mining
temporal opinion quality


Dual joints for 3D-structures The increasing popularity of 3D printing is drawing the interest of the research community to the possibilities and challenges of this manufacturing method. Amongst its many uncertainties, we are concerned here with one of its certaintiesthat reduction of the material required in 3D printing is critical for efficiency and affordability. In this paper, we propose a solution to the computer graphics problem of, given a volume boundary, automatically defining the mesh of a low density internal structure that is 3D-printable. The proposed solution involves two steps. The first step is to define a cell complex partition for the internal space of a volume defined by its boundaries. The second step, is to apply the Skin4Skeleton algorithm, which uses the cell complex dual to produce a 3D-printable cell-complex mesh with a parametrised thickness.

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

cell complexes
additive manufacturing
low density structures


Link adaptation algorithm for distributed coded transmissions in cooperative OFDMA systems This paper proposes a link adaptation algorithm for cooperative transmissions in the down-link connection of an OFDMA-based wireless system. The algorithm aims at maximizing the spectral efficiency of a relay-aided communication link, while satisfying the block error rate constraints at both the relay and the destination nodes. The optimal solution would be to perform an exhaustive search over a high-dimensional space determined by all possible combinations of modulations, code rates and information block lengths on the individual channels of the cooperative link; clearly, such an approach has an intractable complexity. Our solution is to use a link performance prediction method and a trellis diagram representation such that the resulting algorithm outputs the link configuration that conveys as many information bits as possible and also fulfilling the block error rate constraints. The proposed link adaptation algorithm has linear complexity with the number of available resource blocks, while still provides a very good performance, as shown by simulation results.

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

link adaptation
link performance prediction

cooperative wireless communications
distributed channel coding


Structural modeling of glucanase-substrate complexes suggests a conserved tyrosine is involved in carbohydrate recognition in plant 1,3-1,4-beta-d-glucanases Glycosyl hydrolase family 16 (GHF16) truncated Fibrobacter succinogenes (TFs) and GHF17 barley 1,3-1,4-beta-d-glucanases (beta-glucanases) possess different structural folds, beta-jellyroll and (beta/alpha)(8), although they both catalyze the specific hydrolysis of beta-1,4 glycosidic bonds adjacent to beta-1,3 linkages in mixed beta-1,3 and beta-1,4 beta-d-glucans or lichenan. Differences in the active site region residues of TFs beta-glucanase and barley beta-glucanase create binding site topographies that require different substrate conformations. In contrast to barley beta-glucanase, TFs beta-glucanase possesses a unique and compact active site. The structural analysis results suggest that the tyrosine residue, which is conserved in all known 1,3-1,4-beta-d-glucanases, is involved in the recognition of mixed beta-1,3 and beta-1,4 linked polysaccharide.

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


Non-fragile H? H ? filtering for nonlinear systems with randomly occurring gain variations and channel fadings In this paper, the H? H ? filtering problem is addressed for a class of discrete-time stochastic systems subject to randomly occurring gain variations (ROGVs), channel fadings, as well as randomly occurring nonlinearities (RONs). Due to the random nature of the occurrence of the gain variations in actual implementation, ROGVs, to be regulated by a group of random variables with Gaussian distribution, are utilized to better reflect this phenomenon. Then a L -th Rice fadings model is employed to represent channel fadings and time-delays simultaneously, in which the channel coefficients are mutually independent random variables conforming to any probability density function on [0, 1]. Furthermore, a kind of stochastic nonlinear disturbance is also considered in the H? H ? filtering research by means of a Bernoulli distributed white sequence. The purpose of this paper is to devise a non-fragile H? H ? filter such that the overall error dynamics is stochastically stable and satisfies the prescribed H? H ? performance. Through the Lyapunov stability theory, intensive stochastic analysis along with LMI methods, sufficient conditions are set up for the desired stochastic stability and H? H ? disturbance attenuation, and the proposed non-fragile filtering problem is converted into solving a convex optimization problem by the semidefinite programming technique. Finally, a numerical simulation example is provided to illustrate the effectiveness of the proposed design approach.

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

randomly occurring gain variations
channel fadings
randomly occurring nonlinearities

non-fragile h? h ? filtering h? h ? h? h ? h ?


A statistical process control approach to selecting a warm-up period for a discrete-event simulation The selection of a warm-up period for a discrete-event simulation continues to be problematic. A variety of selection methods have been devised, and are briefly reviewed. It is apparent that no one method can be recommended above any other. A new approach, based upon the principles of statistical process control, is described (SPC method). Because simulation output data are often highly autocorrelated and potentially non-normal, the batch means method is employed in constructing the control chart. The SPC method is tested on seven data sets and encouraging results are obtained concerning its accuracy. The approach is also discussed with respect to its ease of implementation, simplicity, generality of use and requirements for parameter estimation.

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


A framework for seamless roaming across heterogeneous next generation wireless networks In the future, wireless and mobile users will have increased demands for seamless roaming across different types of wireless networks, quality of service guarantees and support of different types of services. This awareness has led to research activities directed towards inter-system and global roaming and can be noticed in the numerous products like multimode handsets, inter-working gateways and some ongoing standards and research work on signaling protocols for inter-system roaming. This article proposes a global mobility management framework. The framework is like an overlay network comprising of Inter-System Interface Control Units IICU to support inter-network communication and control for Location Management. The protocols and functions of this framework will be distributed and exist partly within the wireless networks and partly within the core-network. A hierarchy introduced among the IICUs will accommodate for the varying mobility coverage required by the mobile user. The IICU may be configured to perform various functions depending on its placement in the hierarchy of the framework. This approach aims to optimize across call set up delays, signaling traffic, database processing, handoff facilitation for seamless roaming and QoS mapping and negotiations as the user moves across different wireless networks. It avoids centralized database dependency with its associated single-point bottleneck and failures(1). We restrict our analysis of the framework to a 2-network and a 3-network roaming scenario. The presentation has been further restricted to cost and delay analysis of the location update and call delivery procedures. We have taken into account the signalling requirements when the mobile user roams across networks with and without an active call.

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

handoff management
heterogenous wireless networks
qos provisioning


Numerical calculations using the hyper-molecular dynamics simulation method Hyper-molecular dynamics (H-MD) is a new simulation method developed to increase the time scale over which a molecular dynamics simulation can be carried out. Adding a bias potential to the interatomic potential, the simulated time can be boosted by a factor dependent upon the temperature of the system. A bias potential which gives a substantial 'boost' can be defined as a function of the lowest eigenvalue of the Hessian matrix of the total interatomic potential with respect to the atom co-ordinates and the projection of the gradient of the potential onto the eigenvector. In order to obtain a numerical approximation for these quantities without the diagonalization of the Hessian matrix, numerical minimization methods have been proposed. The performance of a hyper-molecular dynamics simulation depends on the accuracy and speed of such minimization methods. Here we present a numerical approximation for the H-MD simulation method and prove the mathematical expressions required for that approach. The speed of a H-MD simulation increases by a factor of up to 3 compared to previous derivations with improved accuracy. Some numerical examples are calculated and compared in order to assess the applicability of the method. (C) 2001 Elsevier Science B.V. All rights reserved.

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

hyper-molecular dynamics
diffusion processes
rate of escape
long time scales
numerical iteratives methods
lowest eigenvalues