Maze Routing with Buffer Insertion and Wiresizing The authors propose an elegant formulation of the Maze Routing with Buffer Insertion and Wiresizing problem as a graph-theoretic shortest path problem. This formulation provides time and space performance improvements over previously proposed dynamic programming based techniques. Routing constraints such as wiring obstacles and restrictions on buffer locations and types are easily incorporated in the formulation. They construct a buffer planning (BP)-graph such that the length of every path in this graph is equal to the Elmore delay. Therefore, finding the minimum Elmore delay path becomes a finite shortest path problem. The buffer choices and insertion locations are represented as the vertices in the BP-graph. The interconnect wires are sized by constructing a look-up table for buffer-to-buffer wiresizing solutions. The authors also provide a technique that is able to tremendously improve the runtime. Experiments show improvements over previously proposed methods.

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


BHP flooding vulnerability and countermeasure Optical burst switching (OBS) is a switching technology that can efficiently operate in the optical core network using WDM technology and can also develop the future optical internet. The OBS switching technology presents a trade-off between the two switching technologies: optical circuit switching (OCS) and optical packet switching (OPS). This switching approach increases resource utilization compared with OCS technology and avoids the technological barriers of OPS networks. In OBS networks, many packets are assembled into one data burst at the edge node and a burst header packet (BHP) is sent before the burst transmission by an offset time in order to reserve the required resources in core nodes. This can cause security issues in the network and more specifically denial of service attacks that can occur if a source node is compromised. In this paper, we study a specific denial of service attack which we refer to as BHP flooding attack, which prevents legitimate traffics from reserving the required resources at intermediate core nodes. We also propose the design of a reconfigurable BHP flooding countermeasure module that allows to counter against this type of attacks in an OBS network.

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

optical codewords
tunable decoder
virtual optical memory


rapid on-line temporal sequence prediction by an adaptive agent Robust sequence prediction is an essential component of an intelligent agent acting in a dynamic world. We consider the case of near-future event prediction by an online learning agent operating in a non-stationary environment. The challenge for a learning agent under these conditions is to exploit the relevant experience from a limited environmental event history while preserving flexibility.We propose a novel time/space efficient method for learning temporal sequences and making short-term predictions. Our method operates on-line, requires few exemplars, and adapts easily and quickly to changes in the underlying stochastic world model. Using a short-term memory of recent observations, the method maintains a dynamic space of candidate hypotheses in which the growth of the space is systematically and dynamically pruned using an entropy measure over the observed predictive quality of each candidate hypothesis.The method compares well against Markov-chain predictions, and adapts faster than learned Markov-chain models to changes in the underlying distribution of events. We demonstrate the method using both synthetic data and empirical experience from a game-playing scenario with human opponents.

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

markov decision process
n-gram
rapid learning


Control and Limitations of Navigating a Tail Rotor/Actuator Failed Unmanned Helicopter According to Federal Aviation Administration (FAA) statistics on mechanical failures, tail rotor failure is the third highest cause of fatal accidents in helicopters. Tail rotor failure represents a serious hazard to personnel and mission objectives and can create high fiscal loss. This is especially true for unmanned helicopters, which cannot be equipped with the fail-safes standard on manned counterparts. This work provides an overview of how a helicopter can be controlled after a tail rotor failure and its applicability to both manned and unmanned vehicles. This work specifically details some of the limitations of this type of software failure control.

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

helicopter reliability
safety
helicopter control


Optimal diagonal-norm SBP operators Optimal boundary closures are derived for first derivative, finite difference operators of order 2, 4, 6 and 8. The closures are based on a diagonal-norm summation-by-parts (SBP) framework, thereby guaranteeing linear stability on piecewise curvilinear multi-block grids and entropy stability for nonlinear equations that support a convex extension. The new closures are developed by enriching conventional approaches with additional boundary closure stencils and non-equidistant grid distributions at the domain boundaries. Greatly improved accuracy is achieved near the boundaries, as compared with traditional diagonal-norm operators of the same order. The superior accuracy of the new optimal diagonal-norm SBP operators is demonstrated for linear hyperbolic systems in one dimension and for the nonlinear compressible Euler equations in two dimensions.

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

finite difference methods
multi-block grids
high order accuracy
boundary treatment


Model validation by permutation tests: Applications to variable selection Regression model validation by permutation tests was explored. Especially in cases where the model significance is doubtful, a permutation test adds crucial information which can often can be decisive for the existence of the model. The background and applicability of the test procedure are described. As an example, the use of permutation tests was extended to validation and investigation of four predictor variable selection techniques, namely MUSEUM, GOLPE, VEP and IVS-PLS. The selection methods are briefly reviewed and compared. The permutation tests were applied before, during and after variable selection. Some similarities and differences in the behaviour of the variable selection techniques were found and are commented upon. (C) 1996 by John Wiley & Sons, Ltd.

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

permutation
variable selection
golpe
museum


Analytic sets in descriptive set theory and NP sets in complexity theory Motivated by the analogy "(NP/Poly) similar to analytic", we propose a co-analytic set W whose finite equivalent W-finite is coNP-complete. The complement of W is in fact a variant of "infinite clique". A combinatorial proof of the non-analyticity of W is produced and studied in order to be (eventually) "finitized" into a probabilistic proof of "W-finite is not an element of NP/Poly (this would imply NP not equal CoNP). A reasonable objective could be to determine a specific class of nondeterministic circuits which allow a finitization of the arguments of the infinite case, and thus which cannot compute W-finite.

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


Exploiting discourse information to identify paraphrases ? We show the relation between discourse units and paraphrasing. We propose a new method for computing text similarity based on elementary discourse units. We apply the method to the task of paraphrase identification. We achieved 93.4% accuracy in experiments conducted on the PAN corpus..

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

paraphrase identification
text similarity

discourse segmentation
elementary discourse unit
mt metric
support vector machine


measurements and modeling of intrinsic fluctuations in mosfet threshold voltage Fluctuations in intrinsic linear V t , free of impact of parasitics, are measured for large arrays of NMOS and PMOS devices on a testchip in a 150nm logic technology. Local intrinsic ?V T , free of extrinsic process, length and width variations, is random, and worsens with reverse body bias. Although the traditional area-dependent component is dominant, a significant component of the fluctuations in small devices depends only on device width or length.

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

random dopant variation
transistor mismatch
vt mismatch
vt variation
vt
process variation
variation
mismatch
transistor threshold voltage mismatch
cmos
threshold voltage variation
transistors
integrated circuits


Numerical Calculations for Geophysics Inversion Problem Using Apache Hadoop Technology There are considerations on the problem of time-consuming calculations in this article. This type of computational problems concerns to multiple aspects of earth sciences. Distributed computing allows to perform calculations in reasonable time. This way of processing requires a cluster architecture. The authors propose using Apache Hadoop technology to solve geophysics inversion problem. This solution is designed rather for analyzing data, but it also enables to perform computations. There is an architecture of solution proposed and real test carried out to determine the performance of method.

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


Dynamic discriminant analysis for predictive maintenance of electrical components subjected to stochastic wear An optimal maintenance program for electrical power system components should be based on their reliability. Since, for components characterized by high reliability and cost such as HV circuit breakers, available statistical data are in limited number, a physical model for their ageing is opportune. In the paper a Predictive Maintenance Program (PMP), for determining when a RV circuit-breaker should be rebuilt, is formated; it is based upon an adequate stochastic model of electrical wear associated with breaking operations due to system faults. In the model, both fault times and amplitudes are described by means of random variables, in order to deduce a reliability function used as input data for a Bayesian discriminant analysis which dynamically estimates, also in the presence of observation errors, the state of the component, determining the optimal times to perform a maintenance action.

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

bayesian statistics
predictive techniques
electrical devices


Disjoint linear codes from algebraic function fields In this correspondence, we study disjoint linear codes and give constructions of families of disjoint linear codes based on algebraic function fields. It turns out that, for some parameters, our constructions improve on a result of Johansson and Pasalic.

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

algebraic function field
algebraic-geometry code
resilient function
riemann-roch space


A novel framework for IP DiffServ over optical burst switching networks This paper presents a novel framework for IP Differentiated Services (DiffServ) over optical burst switching (OBS), namely, DS-OBS. The network architecture, functional model of edge nodes and core nodes, the control packet format, a novel burst assembly scheme at ingress nodes and scheduling algorithm of core nodes are presented. The basic idea is to apply DiffServ capable burst assembly at ingress nodes and perform different per hop behavior (PHB) electronic treatments for control packets of different QoS class services at core nodes. Simulation results show that the proposed schemes can provide the best differentiated service for expedited forwarding (EF), assured forwarding (AF) and best effort (BE) services in terms of end-to-end delay, throughput and IP packet loss probability.

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

differentiated service
per hop behavior
optical burst switching


A simple fault-tolerant adaptive and minimal routing approach in 3-D meshes In this paper we propose a sufficient condition for minimal routing in 3-dimensional (3-D) meshes with faulty nodes. It is based on an early work of the author on minimal routing in 2-dimensional (2-D) meshes. Unlike many traditional models that assume all the nodes know global fault distribution or just adjacent fault information, our approach is based on the concept of limited global fault information. First, we propose a fault model called faulty cube in which all faulty nodes in the system are contained in a set of faulty cubes. Fault information is then distributed to limited number of nodes while it is still sufficient to support minimal routing. The limited fault information collected at each node is represented by a vector called extended safety level. The extended safety level associated with a node can be used to determine the existence of a minimal path from this node to a given destination. Specifically, we study the existence of minimal paths at a given source node, limited distribution of fault information, minimal routing, and deadlock-free and livelock-free routing. Our results show that any minimal routing that is partially adaptive can be applied in our model as long as the destination node meets a certain condition. We also propose a dynamic planar-adaptive routing scheme that offers better fault tolerance and adaptivity than the planar-adaptive routing scheme in 3-D meshes. Our approach is the first attempt to address adaptive and minimal routing in 3-D meshes with faulty nodes using limited fault information.

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

3-d meshes
adaptive routing
deadlock
livelock


Evaluation and comparison of implementation alternatives for look-up tables for plastic cell architecture In this paper, the efficient structure of an LUT (look-up table) for an asynchronous reconfigurable PCA (Plastic Cell Architecture) device is investigated. A total of 15 types of implementation alternatives for LUTs are evaluated and compared in an empirical manner in which full custom layout design is developed and simulated. The evaluation results show that by introducing transmission gates in memory cells in an LUT, read time can be improved by 14.3% at the cost of 13.6% area increase compared to a conventional speed oriented implementation. It is also shown that use of transmission gates reduces 6.4% of area and 19.2% of read time against a conventional area oriented LUT implementation.

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

look-up table
static memory
reconfigurable device
transmission gate


rank vs depth for array partitioning In some applications a subset of the dimensions of an array is used to define a framework which holds instances of cells defined by the complementary subset. A rank four array might be viewed as a page containing several rows of graphs. This structure could be used to apply a rotate function to each of the graphs. Existing proposals to implement a general scheme of program controlled distribution of functions over data arrays are compared. Nested arrays are suggested as the preferred technique. The analogy between the EACH operator and the ENCLOSE function in APL2/NARS leads to remarks on arrays of functions. In that context function distribution becomes a special case of scalar extension.

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

framework rotate applications structure context arrays data case general scheme

partition paging functional operability graph extensibility distributed analog ranking


Multiple views system to support awareness for cooperative design We devise a cooperative awareness model to describe cooperative awareness information in product design. We propose concept of awareness intensity and an object-oriented method to identify and filter overloaded cooperative awareness model. A mechanism which responds to changes of lean cooperative awareness information is proposed to plan and execute task in product design. A navigation net managed by a multiple views system is proposed to browser lean cooperative awareness information set.

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

multiple view
cooperation awareness
information overload


Evolution styles: using architectural knowledge as an evolution driver Software evolution is an increasingly challenging and compelling concern for every developed software system because of the changes in the requirements, the technology, etc. When software evolution is carried out, software architecture emerges as one of the cornerstones that should be considered from two different points of view: as an artifact for the evolution, as it helps the architect plan and restructure the system, and as an artifact of the evolution, because it has to be modified as well. This paper focuses on the second point of viewthat is, on the evolution of the software architecture, but taking into account architectural knowledge as a key driver of the process. Given that architecture rationale and design intent are critical in evolving software systems, it is imperative that they be captured in some useful form to aid that evolution process. We present a new approach for evolution styles that extends them by considering in their description the architectural knowledge as a valuable asset of the evolution process. Copyright (c) 2012 John Wiley & Sons, Ltd.

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

architectural knowledge
evolution styles


parallelizing continuum crowds In this paper, we present a novel parallelizing method for crowd simulators constructed with a continuum model rather than an agent-based model. The basic idea is to partition a crowded virtual environment into some districts, each of which keeps its own dynamic continuum fields and has several transitional blocks to make individuals keep continuum motion from one district to another. Our method makes continuum models to be parallelizable while preserving their existing superiority of generating smooth motion. Moreover, for most of large-scale applications, our partitioning method effectively simplifies the complexity of simulation. Experiments show that our method has achieved super-linear speedup and could employ more than one hundred worker processors to simulate 1 million people in an area of 672,400 m 2 .

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

parallel computing
continuum dynamic
large crowds


speech-driven embodied entrainment character system with hand motion input in mobile environment InterActor is a speech-input-driven CG-embodied interaction character that can generate communicative movements and actions for entrained interactions. InterPuppet, on the other hand, is an embodied interaction character that is driven by both speech input-similar to InterActor-and hand motion input, like a puppet. Therefore, humans can use InterPuppet to effectively communicate by using deliberate body movements and natural communicative movements and actions. In this paper, an advanced InterPuppet system that uses a cellular-phone-type device is developed, which can be used in a mobile environment. The effectiveness of the system is demonstrated by performing a sensory evaluation experiment in an actual remote communication scenario.

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

human interaction
embodied communication
human communication
cellular phone


Making a Cadastre law for 3D properties in Norway A pending proposal for a new Law on the Cadastre in Norway [Norwegian State Reports: NOU 1999:1 Lov om eiendomsregistrering (Law on the Cadastre)] includes for the first time regulations for establishing and registering properties under and above the surface. The new regulations shall typically cover for registration of parking garages in the underground, or registration of buildings/constructions on pillars above the surface, as separate properties. It is assumed that the law will be adopted by the Parliament in 20022003. The proposed regulations consider 3D properties to be subdivided and registered largely in line with establishing parcels on the surface. The Law Committee saw no major problems in making neighbouring properties above each other, than dividing properties on the surface making neighbours next to each other. The proposal refers to 3D properties as construction properties, proposing that such properties should only be registered when it is needed for realisation of a specific construction. An important issue is to ensure a distinction between construction properties and condominiums.

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


Maximum Estrada index of bicyclic graphs ? Let G G be a simple graph of order n n , let ?1(G),?2(G),,?n(G) ? 1 ( G ) , ? 2 ( G ) , , ? n ( G ) be the eigenvalues of the adjacency matrix of G G . The Estrada index of G G is defined as E E ( G ) = ? i = 1 n e ? i ( G ) . In this paper we determine the unique graph with maximum Estrada index among bicyclic graphs with fixed order.

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

bicyclic graphs
estrada index
eigenvalues


Robust and accurate viscous discretization via upwind scheme - I: Basic principle In this paper, we introduce a general principle for constructing robust and accurate viscous discretization, which is applicable to various discretization methods, including finite-volume, residual-distribution, discontinuous-Galerkin, and spectral-volume methods. The principle is based on a hyperbolic model for the viscous term. It is to discretize the hyperbolic system by an advection scheme, and then derive a viscous discretization from the result. A distinguished feature of the proposed principle is that it automatically introduces a damping term into the resulting viscous scheme, which is essential for effective high-frequency error damping and, in some cases, for consistency also. In this paper, we demonstrate the general principle for the diffusion equation on uniform grids in one dimension and unstructured grids in two dimensions, for node/cell-centered finite-volume, residual-distribution, discontinuous-Galerkin, and spectral-volume methods. Numerical results are presented to verify the accuracy of the derived diffusion schemes and to illustrate the importance of the damping term for highly-skewed typical viscous grids. (C) 2011 Elsevier Ltd. All rights reserved.

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

hyperbolic model
upwind
unstructured grids
viscous discretization

diffusion scheme
finite-volume discontinuous galerkin
spectral-volume
residual-distribution
grid skewness
viscous mesh


Adaptive antenna selection and Tx/Rx beamforming for large-scale MIMO systems in 60 GHz channels We consider a large-scale MIMO system operating in the 60 GHz band employing beamforming for high-speed data transmission. We assume that the number of RF chains is smaller than the number of antennas, which motivates the use of antenna selection to exploit the beamforming gain afforded by the large-scale antenna array. However, the system constraint that at the receiver, only a linear combination of the receive antenna outputs is available, which together with the large dimension of the MIMO system makes it challenging to devise an efficient antenna selection algorithm. By exploiting the strong line-of-sight property of the 60 GHz channels, we propose an iterative antenna selection algorithm based on discrete stochastic approximation that can quickly lock onto a near-optimal antenna subset. Moreover, given a selected antenna subset, we propose an adaptive transmit and receive beamforming algorithm based on the stochastic gradient method that makes use of a low-rate feedback channel to inform the transmitter about the selected beams. Simulation results show that both the proposed antenna selection and the adaptive beamforming techniques exhibit fast convergence and near-optimal performance.

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

mimo
antenna selection
stochastic approximation
beamforming
stochastic gradient


High-order Implicit Large Eddy Simulation of gaseous fuel injection and mixing of a bluff body burner Implicit Large Eddy Simulation (ILES) with high-resolution and high-order computational modelling was applied to a turbulent mixing fuel injector flow. In the ILES calculation, the governing equations for three dimensional, non-reactive, multi-species compressible flows were solved using a finite volume Godunov-type method. Up to ninth-order spatial accurate reconstruction methods were examined with a second order explicit Runge-Kutta time integration. Mean and root mean square velocity and mixture fraction profiles showed good agreement with experimental data, which demonstrated that ILES using high-order methods successfully captured complex turbulent flow structure without using an explicit subgrid scale model. The effects of grid resolution and the influence of order of spatial accuracy on the resolution of the kinetic energy spectrum were investigated. An k(-5/3) decay of energy could be seen in a certain range and the cut-off wavenumbers increased with grid resolution or order of spatial accuracy. The effective cut-off wavenumbers are shown to be larger than the maximum wavenumbers appearing on the given grid for all test cases, implying that the numerical dissipation represents sufficiently the energy transport between resolved and unresolved eddies. The fifth-order limiter with a 0.6 million grid points was found to be optimal in terms of the resolution of kinetic energy and reasonable computational time. (C) 2011 Elsevier Ltd. All rights reserved.

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

large eddy simulation
turbulent mixing
fuel injector


Swarm intelligence approaches to estimate electricity energy demand in Turkey This paper proposes two new models based on artificial bee colony (ABC) and particle swarm optimization (PSO) techniques to estimate electricity energy demand in Turkey. ABC and PSO electricity energy estimation models (ABCEE and PSOEE) are developed by incorporating gross domestic product (GDP), population, import and export figures of Turkey as inputs. All models are proposed in two forms, linear and quadratic. Also different neighbor selection mechanisms are attempted for ABCEE model to increase convergence to minimum of the algorithm. In order to indicate the applicability and accuracy of the proposed models, a comparison is made with ant colony optimization (ACO) which is available for the same problem in the literature. According to obtained results, relative estimation errors of the proposed models are lower than ACO and quadratic form provides better-fit solutions than linear form due to fluctuations of the socio-economic indicators. Finally, Turkeys electricity energy demand is projected until 2025 according to three different scenarios.

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

ant colony optimization
artificial bee colony
particle swarm optimization
electricity energy estimation
swarm intelligence


Increasing the flexibility of the herding attack Chosen-target-forced-prefix (CTFP) preimage resistance is a hash function security property guaranteeing the inability of an attacker to commit to a hash function outcome h without knowing the prefix of the message to be hashed in advance. At EUROCRYPT 2006, Kelsey and Kohno described the herding attack against the Merkle-Damgard design that results in a CTFP-preimage of length about n/3 blocks in approximately root n . 2(2n/3) compression function calls. Using an additional parameter l, the attack can be sped-up at the cost of exponentially large preimages (the elongated herding attack). In this work, we re-investigate speed vs. message length tradeoffs for the herding attack. Using a third parameter d, we introduce the generalized elongated multidimensional herding attack. The parameters l and d allow for full control over the efficiency of the attack versus the length of the preimages: increasing l results in faster attacks with longer messages, while increasing d results in shorter messages with higher attack complexity. Using advanced methods in graph theory we analyze the complexity of the generalized attack, and we describe several variants for different values of l, d. On the extreme, a CTFP-preimage of 2(n/2) blocks can be found in n . 2(n/2) queries. One can find a CTFP-preimage of length about n/8 blocks in 3 root n . 2(3n/4) work. (C) 2011 Elsevier B.V. All rights reserved.

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

cryptography
hash functions
chosen-target-forced-prefix
generalized herding attack
hypergraphs


Non-reducible descriptions for conditional Kolmogorov complexity Assume that a program p on input a outputs b. We are looking for a shorter program q having the same property (q (a) = b). In addition, we want q to be simple conditional to p (this means that the conditional Kolmogorov complexity K (q I p) is negligible). In the present paper, we prove that sometimes there is no such program q, even in the case when the complexity of p is much bigger than K(b vertical bar a). We give three different constructions that use the game approach, probabilistic arguments and algebraic arguments, respectively. (c) 2007 Elsevier B.V. All rights reserved.

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


An interactive digital design system for corn modeling An interactive digital design system for corn modeling is presented in this paper. The system is designed and developed based on the growth model of corn, thus the digital design for corn issui table for biological and physiological characteristics according to the natural growth process of corn.The framework is supported by the agricultural knowledge model in steps :knowledge model, mathematical model, geometric model and display model. Specially, a template-based method is implemented for leaf modeling.The system is composed of several key function modules: computer graphic design, template, geometric modeling, database support, data processing and graphic - user interface, and developed by CCC program language based on OpenGL graphic library. The main functions of this system include plant type design, organs of corn model design, plant model design, corn colony design, display of colony and calculation of light distribution in the plant can opylayer. As an interactive digital design tool for corn modeling, the system provides a convenient way for rapid three-dimensional data acquisition and construction. (C) 2009 Elsevier Ltd. All rights reserved.

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

interactive
digital design system
corn modeling


Domination of ordered weighted averaging operators over t-norms The fusion of transitive fuzzy relations preserving the transitivity is linked to the domination of the involved aggregation operator. The aim of this contribution is to investigate the domination of OWA operators over t-norms whereas the main emphasis is on the domination over the Lukasiewicz t-norm. The domination of OWA operators and related operators over continuous Archimedean t-norms will also be discussed.

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


Algorithms and application in decision-making for the finest splitting of a set of formulae ? Belief revision, as one central problem in artificial intelligence, is of interest in decision-making and game theory. To deal with local belief change that is a desirable property for belief revision, a novel notion the finest splitting was proposed by Parikh, Kourousias and Makinson, respectively. But it was not clear how to construct the finest splitting of a propositional theory (a closed set of propositional formulae). In this paper, we propose a constructive method, that is intractable generally, to compute the finest splitting of a propositional theory. We also propose a polynomial time algorithm to compute the finest splitting of a propositional theory consisting of clauses. As an application in the diagnosis theory, we show that, given a diagnosis system (SD,COMP,OBS) ( SD , COMP , OBS ) , it is quite easy to compute all of its diagnosis if the splitting of SD?OBS SD ? OBS is pre-computed. Additionally, in terms of this approach, we can have more specific reason to interpret observation than the original one.

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

belief change
splitting
constructive method
algorithm


Component recognition with three-dimensional fluorescence spectra based on non-negative matrix factorization Non-negative matrix factorization (NMF) is a widely used approach in signal processing. In this work, we apply it to the component recognition of mixtures with multicomponent three-dimensional fluorescence spectra. Compared with the popular PARAFAC for component recognition, NMF has the following advantages: on one hand, the decomposed spectra are three dimensional, and thus, more information can be obtained, which is beneficial for component recognition; on the other hand, the decomposed spectra are non-negative and thus have a certain physical significance. More importantly, we propose a type of integrated similarity indices for the three-dimensional fluorescence spectra, which, by construction, is good at component recognition from overlapping fluorescence spectra. Experiment results demonstrate that NMF combined with integrated similarity index provides an effective method for component recognition of multicomponent three-dimensional overlapping fluorescence spectra. Copyright (C) 2011 John Wiley & Sons, Ltd.

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

integrated similarity index
component recognition

non-negative matrix factorization
three-dimensional fluorescence spectra


Evaluating subtopic retrieval methods: Clustering versus diversification of search results To address the inability of current ranking systems to support subtopic retrieval, two main post-processing techniques of search results have been investigated: clustering and diversification. In this paper we present a comparative study of their performance, using a set of complementary evaluation measures that can be applied to both partitions and ranked lists, and two specialized test collections focusing on broad and ambiguous queries, respectively. The main finding of our experiments is that diversification of top hits is more useful for quick coverage of distinct subtopics whereas clustering is better for full retrieval of single subtopics, with a better balance in performance achieved through generating multiple subsets of diverse search results. We also found that there is little scope for improvement over the search engine baseline unless we are interested in strict full-subtopic retrieval, and that search results clustering methods do not perform well on queries with low divergence subtopics, mainly due to the difficulty of generating discriminative cluster labels.

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

subtopic retrieval
clustering
diversification

search results re-ranking
search results clustering
search results diversification
subtopic retrieval evaluation


An online learning approach: A methodology for time varying applications In this paper, a new procedure to continuously adjust M eights in a multi-layered neural network is proposed. The network is initially trained by using a traditional backprogagation algorithm. After this first step, a non-linear programming technique is used to properly calculate the new M eights sets online. This methodology is tailored to be used in time varying (non-stationary) models, eliminating the necessity for retraining. Numerical results for a controlled experiment and for real data are presented.

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

neural networks
non-stationary data
online training


a pricing strategy for campus networks Network Quality of Service (QoS) concerns the transformation of current internets into systems that can offer one or more levels of QoS. Choosing the "best" QoS will require making decisions about the relative costs of network capacity and the machinery to manage it. Pricing is not only needed for recovering costs, but is also needed as a method of control. The congestion that has plagued the Internet, where pricing is based largely on a flat rate pricing, highlights the fact that without a more efficient pricing method it is difficult to control congestion and share network resources. This research uses the time-volume charging scheme, which determines that both the service time and transmitted volume are able to reflect the usage of a network. Service contracts for communications services do not specify fully the resources that are required to produce a unit of output, and therefore prices can be used both to regulate resource sharing and to maximize social efficiency.

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

effective bandwidth
diffserv
leaky buckets
time-volume


RISK ASSESSMENT OF ATTACK-INDUCED CASCADE IN COMPLEX NETWORKS For the complex networks, including scale-free, small-world, local-world and random networks, the global quantitative evaluation of attack-induced cascade is investigated in this paper by introducing the risk assessment, which integrates the probability of occurrence with the damage size of attacks on nodes. It is discovered by simulations, among the several kinds of networks, that the small-world network has the largest risk assessment of attack-induced cascade; the risk assessment of three other networks are all very low and the most protection against attack should be given to the small-world network accordingly. Furthermore, the percentage of the most fragile nodes in the scale-free network is very low, compared with that in the small-world network.

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


Detection and prevention of slip using sensors with different properties embedded in elastic artificial skin on the basis of previous experience In dexterous robotic manipulation, it is essential to control the force exerted by the robot hands while grasping. This paper describes a method by which robot hands can be controlled on the basis of previous experience of slippage of objects held by the hand. We developed an anthropomorphic human scale robot hand equipped with an elastic skin in which two types of sensor are randomly embedded. One of these sensors is a piezoelectric polyvinylidenefluoride (PVDF) film which can be used for the detection of pressure changes. The other is a strain gauge which can measure static pressure. In our system, PVDF films are used to detect slipping, and strain gauges to measure stresses which are caused by normal and shear forces. The stress measured by the strain gauges is used as input data to a neural network which controls the actuators of the robot. Once slip is detected, the neural network is updated to prevent it. We show that this system can control the grasp force of the robot hand and adapt it to the weight of the object. By using this method, it was shown that robots can hold objects safely.

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

soft finger
multimodal distributed sensors
force control of grasp


Post-buckling analysis of viscoelastic plates with fractional derivative models The post-buckling response of thin plates made of linear viscoelastic materials is investigated. The employed viscoelastic material is described with fractional order time derivatives. The governing equations, which are derived by considering the equilibrium of the plate element, are three coupled nonlinear fractional partial evolution type differential equations in terms of three displacements. The nonlinearity is due to nonlinear kinematic relations based on the von Krmn assumption. The solution is achieved using the analog equation method (AEM), which transforms the original equations into three uncoupled linear equations, namely a linear plate (biharmonic) equation for the transverse deflection and two linear membrane (Poissons) equations for the inplane deformation under fictitious loads. The resulting initial value problem for the fictitious sources is a system of nonlinear fractional ordinary differential equations, which is solved using the numerical method developed recently by Katsikadelis for multi-term nonlinear fractional differential equations. The numerical examples not only demonstrate the efficiency and validate the accuracy of the solution procedure, but also give a better insight into this complicated but very interesting engineering plate problem

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

large deflections
buckling
boundary element method
viscoelasticity
fractional derivatives


An analysis of the performance of Artificial Neural Network technique for apple classification The purpose of this paper is to develop Artificial Neural Network (ANN)-based apple classifier. Testing effort is calculated using ANN method. The complete system is divided into two modules. In the first module, input (surface level apple quality parameter) from the different sources is collected by the software developed in Visual Basic through different input device like web camera, weight machine, etc. In the second module, the input data are used by ANN simulator to classify the apple according to their quality. The final result of an ANN model for apple classification is discussed; however, the modeling results showed that there is excellent agreement between the experimental data and predicted values. A low level of error prediction confirmed the fact that the Neural Network model is an effective instrument of the apple quality estimation. There is not any misclassification during testing. The paper presents alternative method for quality assessment of apple and provides consumers with a safer food supply.

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

machine vision
scaled conjugate gradient
mean square error
back propagation
root mean square error


A mesh patching method for finite volume modelling of shallow water flow A new mesh-patching model is presented for shallow water flow described by the 2D non-linear shallow water (NLSW) equations. The mesh-patching model is based on AMAZON, a high-resolution NLSW engine with an improved HLLC approximate Riemann solver. A new patching algorithm has been developed, which not only provides improved spatial resolution of flow features in particular parts of the mesh, but also simplifies and speeds up the (structured) grid generation process for an area with complicated geometry. The new patching technique is also compatible with increasingly popular parallel computing and adaptive grid techniques. The patching algorithm has been tested with moving bores, and results of test problems are presented and compared to previous work. Copyright (c) 2005 John Wiley & Sons, Ltd.

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

mesh patching
approximate riemann solver

nonlinear shallow water equations
finite volume method
multi-block


Asymptotic Results on Adaptive False Discovery Rate Controlling Procedures Based on Kernel Estimators The False Discovery Rate (FDR) is a commonly used type I error rate in multiple testing problems. It is defined as the expected False Discovery Proportion (FDP), that is, the expected fraction of false positives among rejected hypotheses. When the hypotheses are independent, the Benjamini-Hochberg procedure achieves FDR control at any pre-specified level. By construction, FDR control offers no guarantee in terms of power, or type II error. A number of alternative procedures have been developed, including plug-in procedures that aim at gaining power by incorporating an estimate of the proportion of true null hypotheses. In this paper, we study the asymptotic behavior of a class of plug-in procedures based on kernel estimators of the density of the p-values, as the number m of tested hypotheses grows to infinity. In a setting where the hypotheses tested are independent, we prove that these procedures are asymptotically more powerful in two respects: (i) a tighter asymptotic FDR control for any target FDR level and (ii) a broader range of target levels yielding positive asymptotic power. We also show that this increased asymptotic power comes at the price of slower, non-parametric convergence rates for the FDP. These rates are of the form m(-k/(2k+1)), where k is determined by the regularity of the density of the p-value distribution, or, equivalently, of the test statistics distribution. These results are applied to one-and two-sided tests statistics for Gaussian and Laplace location models, and for the Student model.

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

multiple testing
false discovery rate
power
test statistics distribution
convergence rates
kernel estimators

benjamini hochberg's procedure
criticality
plug-in procedures
adaptive control


The effects of electronic word-of-mouth messages, psychological endowment and anticipated regret on online bidding behavior This study applied an empirical method to understand the impact of electronic word-of-mouth messages, psychological endowment and anticipated regret on consumers' online bidding behavior. The results indicated that during the early stage of an online auction, the more positive than negative electronic word-of-mouth messages there are, the higher the consumers' bidding intention and bidding price. During the auction's bidding stage, bidders who respond with psychological endowment have higher rebidding intention and a rebidding price than those without psychological endowment. In addition, those bidders who respond with psychological endowment will raise their bidding price even more at the final stage of the auction because of their sense of anticipated regret. These results will allow online auction companies to set up criteria for the operation and management of customer-to-customer transactions. (C) 2010 Elsevier Ltd. All rights reserved.

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

psychological endowment
anticipated regret
bidding behavior
online auction


Stochastic Jiles-Atherton model accounting for soft magnetic material variability Purpose - Classically the magnetic material models are considered with a deterministic approach. Nevertheless, when submitted to the fabrication process, the magnetic core properties are negatively impacted and may be subject to variability during the process. This variability can be of such importance that the performances of the final device (electrical machine) will also present a noticeable variability. The aim of this research is to develop a stochastic model of the magnetic behaviour law of slinky stators used in claw pole generators. The proposed methodology is general and can be applied to other physical properties of electrical devices. Design/methodology/approach - The approach is based on a methodology that uses experimental data and a statistical description of the magnetic properties. To that end, a set of samples issued from the same chain of assembly is considered. The hysteresis model is then developed by accounting for the parameter correlation structure. Findings - It is found that the magnetic hysteresis properties of the studied samples can be modelled by means of statistical tools applied to the parameters of the hysteresis model. The dependency of the parameters can also be accounted for a more accurate modelling. Originality/value - The paper proposes a statistical approach and a methodology that are applied to the hysteresis modelling accounting for the variability of the magnetic properties. The developed model can be further used in a numerical tool to represent the impact on the performances of electrical devices that are subject to the fabrication process variability.

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

jiles-atherton
stochastic modelling
slinky stator
materials


wearable scanning laser projector (wslp) for augmenting shared space A novel wearable apparatus was developed for ubiquitous and augmented reality. The head-mounted projection system uses rapidly scanned lasers to display information directly onto any object using the object as a "projection screen". The wearer's augmented vision can be shared by his colleagues, both nearby and in remote locations.

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


Fast Visual Retrieval Using Accelerated Sequence Matching We present an approach to represent, match, and index various types of visual data, with the primary goal of enabling effective and computationally efficient searches. In this approach, an image/video is represented by an ordered list of feature descriptors. Similarities between such representations are then measured by the approximate string matching technique. This approach unifies visual appearance and the ordering information in a holistic manner with joint consideration of visual-order consistency between the query and the reference instances, and can be used for automatically identifying local alignments between two pieces of visual data. This capability is essential for tasks such as video copy detection where only small portions of the query and the reference videos are similar. To deal with large volumes of data, we further show that this approach can be significantly accelerated along with a dedicated indexing structure. Extensive experiments on various visual retrieval and classification tasks demonstrate the superior performance of the proposed techniques compared to existing solutions.

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

image classification
similarity measure
video retrieval


Forest representation of vessels in cone-beam computed tomographic angiography Cone-beam computed tomographic angiography (CBCTA) provides a fast three-dimensional (3D) vascular imaging modality, aiming at digitally representing the spatial vascular structure in an angiographic volume. Due to the finite coverage of cone-beam scan, as well as the volume cropping in volumetric image processing, an angiographic volume may fail to contain a whole vascular tree, but rather consist of a multitude of vessel segments or subtrees. As such, it is convenient to represent multitudinal components by a forest. The vessel tracking issue then becomes component characterization/identification in the forest. The forest representation brings several conveniences for vessel tracking: (1) to sort and count the vessels in an angiographic volume, for example, according to spatial occupancy and skeleton pathlength; (2) to single out a vessel and perform in situ 3D measurement and 3D visualization in the support space; (3) to delineate individual vessels from the original angiographic volume; and (4) to cull the forest by getting rid of non-vessels and small vessels. A 3D skeletonization is used to generate component skeletons. For tree construction from skeletons, we suggest a pathlength-based procedure, which lifts the restrictions of unit-width skeleton and root determination. We experimentally demonstrate the forest representation of a dog's carotid arteries in a CBCTA system. In principle, the forest representation is useful for managing vessels in both 2D angiographic images and 3D angiographic volumes.

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

3d skeletonization
tree construction
forest representation

cone-beam ct angiography
3d vessel tracking
forest culling


evaluating distance metrics for animation blending Reusing motion capture data is of great importance in games and simulations. Therefore, many techniques from motion synthesis aim at concatenating or blending existing pieces of motion. For concatenation, a distance metric is required to detect good transition points. In this paper, three common distance metrics are evaluated both quantitatively and qualitatively. In the quantitive analysis we evaluate foot-skate, path deviation and on-line running time. The qualitative analysis is done by a user study. We observed that the point cloud metric results in a very slow graph search and a high path deviation compared to the other metrics. However, this metric results in less foot skating. We also show that increasing the graph size does not alway introduce more visual artifacts. Based on our observations, we propose a set of guidelines when using these metrics in a motion synthesizer.

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

metric animation blending synthesis motion


A Low Power Reconfigurable Channel Filter Using Multi-Band and Masking Architecture for Channel Adaptation in Cognitive Radio Cognitive radio (CR) is an adaptive spectrum sharing paradigm targeted to provide opportunistic spectrum access to secondary users for whom the frequency bands have not been licensed. The key tasks in a CR are to sense the spectral environment over a wide frequency band and allow unlicensed secondary users (CR users) to dynamically transmit/receive data over frequency bands unutilized by licensed primary users. Thus the CR transceiver should dynamically adapt its channel (frequency band) in response to the time-varying frequencies of wideband signal for seamless communication. In this paper, we present a low complexity reconfigurable filter architecture based on multi-band filtering and frequency masking techniques for dynamic channel adaptation in CR terminal. The proposed multi-standard architecture is capable of adapting to channels having different bandwidths corresponding to the channel spacing of time-varying channels. Design examples show that proposed architecture offers 12.2% power reduction and 26.5% average gate count reduction over conventional Per-Channel based architecture.

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

cognitive radio
channel adaptation
channel filter
low complexity
low power

multi-band filter
masking filter
reconfigurability


The motivational and control structure underlying the acceptance of adaptive museum guides - An empirical study Acceptance of adaptive museum guides raises important issues stemming from both the nature of the scenario (museum visit) and the very kind of technological approach adopted (adaptivity). As to the former, museum guides play a utilitarian role in a hedonic scenario: at present, however, it is not clear how this reflects on the balance between intrinsic and extrinsic motivations for guide acceptance. The adaptive nature of the guide, in turn, raises questions about the impact of the opaqueness of the system behavior, of the alleged loss of perceived control over the interaction, and the role of presentation personalization. All these issues are explored in this paper by means of a model derived from TAM and comprising both extrinsic and intrinsic motivational constructs. The results of a analysis of data from 115 subjects show that the motivational structure of the guide usage is mainly utilitarian, with intrinsic motivations playing a role insofar as they acquire an instrumental value. The impact of the control issues on acceptability is low and indirect, while the importance of the feedback provided by the system is confirmed. Finally, personalization positively impacts on user engagement, this way strengthening the empirical and theoretical groundings for work in adaptive systems. (C) 2009 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 B I I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

technology acceptance
adaptive guides
utilitarian and hedonic systems


Improved texture image classification through the use of a corrosion-inspired cellular automaton A cellular automata (CA) approach for texture analysis and recognition is proposed. The models were inspired in the corrosion model of alloy surfaces. The image is modeled as an alloy surface and the CA simulates the corrosion evolution. The corrosion behavior provides features that are used to characterize the texture. Results show the proposed method outperformed state-of-the-art methods.

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

pattern recognition
pitting corrosion
texture classification


Optimal Ternary Cyclic Codes From Monomials Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. Perfect nonlinear monomials were employed to construct optimal ternary cyclic codes with parameters [3(m) - 1, 3(m) - 1 - 2m, 4] by Carlet, Ding, and Yuan in 2005. In this paper, almost perfect nonlinear monomials, and a number of other monomials over GF (3(m)) are used to construct optimal ternary cyclic codes with the same parameters. Nine open problems on such codes are also presented.

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

almost perfect nonlinear (apn) functions


FPGA architecture of the LDPS Motion Estimation for H.264/AVC Video Coding Motion estimation is a highly computational demanding operation during video compression process and significantly affects the output quality of an encoded sequence. Special hardware architectures are required to achieve real-time compression performance. Many fast search block matching motion estimation (BMME) algorithms have been developed in order to minimize search positions and speed up computation but they do not take into account how they can be effectively implemented by hardware. In this paper, we propose three new hardware architectures of fast search block matching motion estimation algorithm using Line Diamond Parallel Search (LDPS) for H.264/AVC video coding system. These architectures use pipeline and parallel processing techniques and present minimum latency, maximum throughput and full utilization of hardware resources. The VHDL code has been tested and can work at high frequency in a Xilinx Virtex-5 FPGA circuit for the three proposed architectures.

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


Least square methods in structural analysis A new approach to structural analysis is presented. The method uses equilibrium and deformation geometry field relations directly without resorting to an energy formulation. A matrix vector of errors in the field relations is minimized first with respect to the internal quantities, e.g., the moments. Subsequently the error is minimized with respect to the external forces and displacements. In the latter formulation, the internal quantities have been eliminated by back substitution. The least-square method for minimizing functional forms is the precedent for this work. The method is tested on beam and plate problems. The development of the pertinent matrices is interesting and depends on the trial functions used to represent the internal quantities.

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

mixed formulation
generalized inverse
convergence


Beating oscillations of magneto-optical spectra in simple hexagonal graphite The magneto-optical properties of simple hexagonal graphite exhibit rich beating oscillations, which are dominated by the field strength and photon energy. The former has a strong effect on the intensity, the energy range of the beating and the number of groups, and the latter modulates the total group numbers of the oscillation structures. The single-particle and collective excitations are simultaneously presented in the magnetoreflectance spectra and can be precisely distinguished. For the loss function and reflectance, the beating pattern of the first group displays stronger intensities and broader energy range than other groups. Simple hexagonal graphite possesses unique magneto-optical characteristics that can serve to identify other bulk graphites.

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

landau subbands
magnetic field
dielectric function
beating patterns


Symmetric discharge logic against differential power analysis Differential power analysis (DPA) is an effective technique that extracts secret keys from cryptographic systems through statistical analysis of the power traces obtained during encryption and decryption operations. This letter proposes symmetric discharge logic (SDL), a circuit-level countermeasure against DPA, which exhibits uniform power traces for every clock period by maintaining a set of discharge paths independent of input values. This feature minimizes differences in power traces and improves resistance to DPA attacks. HSPICE simulations for the test circuits using 0.18 mu m TSMC CMOS process parameters indicate that SDL reduces power differences by an order of magnitude, compared to the existing circuit-level technique.

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

symmetric discharge logic
sdl
differential power analysis
dpa


Use of Web 2.0 technologies in LIS education: experiences at Tallinn University, Estonia Purpose - The purpose of this paper is to describe the experiences of the Institute of Information Studies of Tallinn University in introducing ICT, including Web 2.0 technologies, in library and information science education, and to explore the role that these can play in new models of learning and teaching. Design/methodology/approach - Web 2.0 applications are reviewed in this paper and the role that these can play in new models of learning and teaching. The introduction of new technologies into library and information science (LIS) education is examined through a case study at the Tallinn University. Findings - Web 2.0 is influencing the way in which people learn, access information and communicate with one another. The Institute of Information Studies of Tallinn University has a long history in using ICT in its teaching and learning. Experiences with open and distance learning and e-learning have transformed teaching and learning, provided new alternative delivery modes, and helped to reach new target groups. Recently the staff have been experimenting with Web 2.0 technologies and a few have successfully adopted them in teaching and learning. Practical implications - The paper suggests that in order to be successful in our modem society LIS educators should take advantage of new ICT and consider the learning preferences of digital natives as well as digital immigrants. Web 2.0 supports constructivist approaches to learning and has great potential to socialise online learning to a greater extent than we have previously seen. Web 2.0 technologies should be implemented taking into account pedagogical perspectives. Originality/value - This paper supports the idea that integration of information and communication technologies, including Web 2.0 technologies, into LIS education is an important challenge for LIS educators.

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

information science
communication technologies
estonia


Backstepping generalized synchronization for neural network with delays based on tracing control method This paper studies the problem of backstepping generalized synchronization problem of neural network with delays. Based on tracing control method, the controller of backstepping generalized synchronization is designed, and the controller can realize backstepping generalized synchronization for neural network with delays. The experiment of numerical simulation is provided to further demonstrate the effectiveness of the proposed scheme.

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

back stepping generalized synchronization


A genetic algorithm for interval nonlinear integer programming problem In this paper, we formulate an optimal design of system reliability problem as a nonlinear integer programming problem with interval coefficients, transform it into a single objective nonlinear integer programming problem without interval coefficients, and solve it directly with keeping nonlinearity of the objective function by using Genetic Algorithms (GA). Also, we demonstrate the efficiency of this method with incomplete Fault Detecting and Switching (FDS) for allocating redundant units.

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

nonlinear integer programming
genetic algorithms


Computing and visualizing popular places Data analysis and knowledge discovery in trajectory databases is an emerging field with a growing number of applications such as managing traffic, planning tourism infrastructures, analyzing professional sport matches or better understanding wildlife. A well-known collection of patterns which can occur for a subset of trajectories of moving objects exists. In this paper, we study the popular places pattern, that is, locations that are visited by many moving objects. We consider two criteria, strong and weak, to establish either the exact number of times that an object has visited a place during its complete trajectory or whether it has visited the place, or not. To solve the problem of reporting popular places, we introduce the popularity map. The popularity of a point is a measure of how many times the moving objects of a set have visited that point. The popularity map is the subdivision, into regions, of a plane where all the points have the same popularity. We propose different algorithms to efficiently compute and visualize popular places, the so-called popular regions and their schematization, by taking advantage of the parallel computing capabilities of the graphics processing units. Finally, we provide and discuss the experimental results obtained with the implementation of our algorithms.

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

popular places
graphics processing units

movement patterns
computational geometry


A review and outlook for a 'Building Information Model' (BIM): A multi-standpoint framework for technological development This study provides a review of important issues for 'Building Information Modelling' (BIM) tools and standards and comprehensive recommendations for their advancement and development that may improve BIM technologies and provide a basis for inter-operability, integration, model-based communication, and collaboration in building projects. Based on a critical review of Building Product Modelling, including the development of standards for exchange and the features of over 150 AEC/O (Architecture, Engineering, Construction, and Operation) tools and digital models, a methodological framework is proposed for improvements to both BIM tools and schemata. The features relevant to the framework were studied using a conceptual process model and a 'BIM System-of-Systems' (BIM-SoS) model. The development, implementation, and use of the BIM Schema are analysed from the standpoint of standardisation. The results embrace the requirements for a BIM research methodology, with an example of methods and procedures, an R&D review with critique, and a multi-standpoint framework for developments with concrete recommendations, supported by BIM metrics, upon which the progress of tools, models, and standards may be measured, evaluated, streamlined, and judged. It is also proposed that any BIM Schema will never be 'completed' but should be developed as evolutionary ontology by 'segmented standpoint models' to better account for evolving tools and AEC/O practices. (C) 2010 Elsevier Ltd. All rights reserved.

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

building information modelling
standards

standpoints
engineering communication
project information management


Determination of the optimal heat energy targets in heat pinch analysis using a geometry-based approach A simple and direct numerical technique is proposed to determine the optimal heat energy targets in heat pinch analysis. The technique is based on a geometrical approach, i.e., utilization of the horizontal shift between the cold composite curve (CC) and the stationary hot CC. The stream and target temperatures of the streams are a subset of an ordered set to form the overall temperature range J. If the temperature subinterval in the overlap region of the CCs is equal to the minimum temperature differential Delta T-min, simple formulas that utilize the enthalpy flow values can be used to determine the corresponding horizontal shift (bias) B between the CCs. In the overlap range, Bs are determined at all points on one CC and other points on the other CC using Delta T-min to form the set B. The maximum value of Bs in set B, B*, is used to determine the optimal heat energy targets. If the temperature subinterval in the overlap range is not equal to AT in, the conventional temperature shift of the CCs is employed first and the resulting stream and target temperatures of the streams are set J. In this case the same algebraic formulas are applicable. Heat pinch locations at end points or on a parallel section on the CCs are discussed. It is shown, again, that the same algebraic formulas are applicable. The proposed technique is different from the conventional one since it starts with the determination of the optimally positioned CCs and then proceeds to determine the optimal heat energy targets, heat pinch point location, and grand composite curve (GCC). In the conventional heat pinch analysis, the problem table algorithm (PTA) is employed first. Furthermore, the present technique is conceptually different from the PTA and the simple problem table algorithm (SPTA) since it is developed based on a geometrical approach not energy cascade over the overlap temperature subintervals. While the PTA and SPTA are only applicable using temperature-shifted data the proposed geometry-based technique is applicable to both shifted- and unshifted-temperature data sets. Moreover, the proposed numerical technique can handle both quasilinear CCs and CCs exhibiting discontinuities (assuming the critical lower bound on Delta T-min, Delta T-min(c), is known) hence, it is more robust and versatile and avoids the lumping and cascading stages in the PTA. Crown Copyright (c) 2005 Published by Elsevier Ltd. All rights reserved.

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

heat pinch design methods
minimum approach temperature
process integration
discontinuous composite curve
problem table algorithm (pta)
simple problem table algorithm (spta)


Interactive object modelling based on piecewise planar surface patches ? Detecting elements such as planes in 3D is essential to describe objects for applications such as robotics and augmented reality. While plane estimation is well studied, table-top scenes exhibit a large number of planes and methods often lock onto a dominant plane or do not estimate 3D object structure but only homographies of individual planes. In this paper we introduce MDL to the problem of incrementally detecting multiple planar patches in a scene using tracked interest points in image sequences. Planar patches are reconstructed and stored in a keyframe-based graph structure. In case different motions occur, separate object hypotheses are modelled from currently visible patches and patches seen in previous frames. We evaluate our approach on a standard data set published by the Visual Geometry Group at the University of Oxford [24] and on our own data set containing table-top scenes. Results indicate that our approach significantly improves over the state-of-the-art algorithms.

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

plane detection
reconstruction
multiple structure from motion


An analytical model for wireless sensor networks with sleeping nodes We consider a wireless sensor network whose nodes may enter the so-called sleep mode, corresponding to low power consumption and reduced operational capabilities. We develop a Markov model of the network representing: 1) the behavior of a single sensor as well as the dynamics of the entire network, 2) the channel contention among sensors, and 3) the data routing through the network. We use this model to evaluate the system performance in terms of energy consumption, network capacity, and data delivery delay. Analytical results present a very good matching with simulation results for a large variety of system scenarios, showing the accuracy of our approach.

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

energy-efficiency
performance evaluation
modeling


Laws of Order: Expensive Synchronization in Concurrent Algorithms Cannot be Eliminated Building correct and efficient concurrent algorithms is known to be a difficult problem of fundamental importance. To achieve efficiency, designers try to remove unnecessary and costly synchronization. However, not only is this manual trial-and-error process ad-hoc, time consuming and error-prone, but it often leaves designers pondering the question of: is it inherently impossible to eliminate certain synchronization, or is it that I was unable to eliminate it on this attempt and I should keep trying? In this paper we respond to this question. We prove that it is impossible to build concurrent implementations of classic and ubiquitous specifications such as sets, queues, stacks, mutual exclusion and read-modify-write operations, that completely eliminate the use of expensive synchronization. We prove that one cannot avoid the use of either: i) read-after-write (RAW), where a write to shared variable A is followed by a read to a different shared variable B without a write to B in between, or ii) atomic write-after-read (AWAR), where an atomic operation reads and then writes to shared locations. Unfortunately, enforcing RAW or AWAR is expensive on all current mainstream processors. To enforce RAW, memory ordering-also called fence or barrier-instructions must be used. To enforce AWAR, atomic instructions such as compare-and-swap are required. However, these instructions are typically substantially slower than regular instructions. Although algorithm designers frequently struggle to avoid RAW and AWAR, their attempts are often futile. Our result characterizes the cases where avoiding RAW and AWAR is impossible. On the flip side, our result can be used to guide designers towards new algorithms where RAW and AWAR can be eliminated.

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

theory
concurrency
lower bounds
memory fences
memory barriers


Rule-based multi-FNN identification with the aid of evolutionary fuzzy granulation In this paper, we introduce a category of Multi-Fuzzy-Neural Networks (Multi-FNNs) models, analyze the underlying architectures and propose a comprehensive identification framework. The proposed Multi-FNNs are based on a concept of fuzzy rule-based FNNs that use H ard C-M eans (HCM) clustering and evolutionary fuzzy granulation and exploit linear inference being treated as a generic inference mechanism of approximate reasoning. By this nature, this FNN model is geared toward capturing relationships between information granulesfuzzy sets. The form of the information granules themselves (in particular their distribution and a type of membership functions) becomes an important design feature of the FNN model that contributes to its structural and parametric optimization. The genetically guided global optimization is then augmented by more refined gradient-based learning mechanisms such as a standard back-propagation. The HCM algorithm, whose role is to carry out preprocessing of the experimental data, is utilized to determine the structure of Multi-FNNs. The detailed parameters of the Multi-FNN (such as apexes of membership functions, learning rates, and momentum coefficients) are adjusted using genetic algorithms. The proposed aggregate performance index helps achieve a sound balance between approximation and generalization (predictive) abilities of the model. To evaluate an effectiveness of the introduced model, several numeric data sets are experimented with. Those include a time-series data of gas furnace, NOx emission process of gas turbine power plant and some synthetic data.

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

information granules
evolutionary fuzzy granulation
genetic algorithms

rule-based multi-fuzzy-neural networks
linear fuzzy inference
hard c-means clustering
design methodology


Image encryption using chaotic logistic map In recent years, the chaos based cryptographic algorithms have suggested some new and efficient ways to develop secure image encryption techniques. In this communication, we propose a new approach for image encryption based on chaotic logistic maps in order to meet the requirements of the secure image transfer. In the proposed image encryption scheme, an external secret key of 80-bit and two chaotic logistic maps are employed. The initial conditions for the both logistic maps are derived using the external secret key by providing different weightage to all its bits. Further, in the proposed encryption process, eight different types of operations are used to encrypt the pixels of an image and which one of them will be used for a particular pixel is decided by the outcome of the logistic map. To make the cipher more robust against any attack, the secret key is modified after encrypting each block of sixteen pixels of the image. The results of several experimental, statistical analysis and key sensitivity tests show that the proposed image encryption scheme provides an efficient and secure way for real-time image encryption and transmission.

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


Stress, the Endoplasmic Reticulum, and Insulin Resistance Stress, such as nutrient deprivation, viral infections, inflammation, heat shock, or lipid accumulation, imposes a serious threat to the body. These stimuli, acting both on the central control stations of the stress system and its final effectors, catecholamines and glucocorticoids, and on the peripheral target tissues, can modulate insulin action in the body. Metabolic complications, such as diabetes, visceral obesity, and atherosclerosis have emerged as major health threats in the modern societies. Indeed, obesity and atherosclerosis are regarded as states of chronic low-grade inflammation, while inflammatory mediators and lipid accumulation can evoke a chronic stress at the cellular level, principally affecting the endoplasmic reticulum (ER). It has recently been shown that ER responds to metabolic stressors through a well coordinated molecular response that involves the transcriptional activation of multiple genes, the attenuation of protein synthesis and degradation of the ER-localized misfolded proteins, and the onset of apoptosis. This article examines the emerging role of stress on ER and its possible link with obesity, insulin resistance, and type 2 diabetes

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

endoplasmic reticulum
stress
obesity
insulin resistance
diabetes


Simultaneous determination of mixtures of organic acids or bases based on the differences in the titration spectra Based on the differences in titration spectra, mixtures of organic acids with similar p K-a were determined simultaneously. Principal component regression calibration was used for the evaluation of titration spectra. The effects of differences in pK(a) and sampling interval of pH on accuracy were studied in detail. Combining precipitation and the acid-base reaction of organic acid, precipitation-acid-base titrimetry is proposed, The mixture of acids with almost the same pK(a) can be determined simultaneously and accurately only if their pK(sp) values are different. Synthetic mixtures of isomer of chlorobenzoic acid and homologue of phenol were determined simultaneously and acceptable results were obtained. (C) 1999 Elsevier Science B.V. All rights reserved.

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

principal component regression
organic acid

titration spectrum
precipitation-acid-base titrimetry


Multiple Functional Neural Fuzzy Networks Fusion Using Fuzzy Integral This paper presents multiple functional neural fuzzy networks (FNFN) fusion using fuzzy integral (FI). Since the classifiers are able to complement each other, the fusion of multiple classifiers overcomes the limitations of applying a single classifier, in addition, the Ft is a better decision-combination scheme than the majority voting method that uses the subjectively defined relevance of classifiers. A combination of multiple FNFN classifiers with FI is proposed to achieve data classification with higher accuracy than existing traditional methods. The advantage of the proposed method is that not only are the classification results combined but the relative importance of the different networks is also considered. Computer simulations for the Iris, Wisconsin breast cancer, and wine classifications show that the fusion of multiple FNFNs using FI can perform better than existing traditional methods.

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

functional neural fuzzy network
fuzzy measures
on-line learning


cooperation between self-interested agents in normal form games We study how to achieve cooperation between two self-interested agents that play repeated randomly generated normal form games. We take inspiration from a model originally designed to identify cooperative actions by humans who play a game, but we use the model in a prescriptive rather than descriptive manner. To identify cooperative intent, agents use a particle filter to learn the parameters of the model.

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

multiagent learning
game theory
implicit cooperation