A lattice-based approach for updating access control policies in real-time ? Real-time update of access control policies, that is, updating policies while they are in effect and enforcing the changes immediately and automatically, is necessary for many dynamic environments. Examples of such environments include disaster relief and war zone. In such situations, system resources may need re-configuration or operational modes may change, necessitating a change of policies. For the system to continue functioning, the policies must be changed immediately and the modified policies automatically enforced. In this paper, we propose a solution to this problemwe consider real-time update of access control policies in the context of a database system. In our model, a database consists of a set of objects that are read and updated through transactions. Access to the data objects are controlled by access control policies which are stored in the form of policy objects. We consider an environment in which different kinds of transactions execute concurrently; some of these may be transactions updating policy objects. Updating policy objects while they are deployed can lead to potential security problems. We propose algorithms that not only prevent such security problems, but also ensure serializable execution of transactions. The algorithms differ on the degree of concurrency provided and the kinds of policies each can update.

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

security policies
concurrency control
transaction management


One Case, Four Theories In this chapter, clinical material illustrates key theoretical concepts and underscores the value of Heinz Kohut's radical approach to psychoanalysis. The psychodynamic treatment of Matthew spans over a decade and traces the therapist's immersion in four clinical modalities. The transition from Kleinian and British object relations orientations to a therapeutic style informed by psychoanalytic self psychology and intersubjective systems theory broke through impasses generated in the earlier chapters of Matthew's therapy. The empathic listening stance, the impact of the analyst's subjectivity on the treatment's progress, and the vital role of selfobject experiences in the development, restoration, and maintenance of an individual's sense of self constitute a few of the crucial and enduring curative elements brought to the field of psychoanalysis and psychodynamic therapy by Kohut's pioneering efforts.

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

self psychology
intersubjective systems theory
sense of self

empathy
comparative psychoanalysis
organizing principles
impasse
kohut
self-cohesion


4-Sets-Cut-Decoding algorithms for random codes based on quasigroups The decoding speed is the biggest problem of random codes based on quasigroups proposed elsewhere. These codes are a combination of cryptographic algorithms and error-correcting codes. In our previous paper we proposed Cut-Decoding algorithm which is 4.5 times faster than the original one for code (72,288). In this paper, four new modifications (so-called 4-Sets-Cut-Decoding algorithms) of this algorithm are proposed in order to obtain an improvement of the decoding speed. We present and analyze several experimental results obtained with different algorithms for random codes based on quasigroups. It is shown that using new algorithms, improvement of the efficiency and decoding speed is obtained. Also, we derive the upper bound for packet-error probability obtained with Cut-Decoding and 4-Sets-Cut-Decoding algorithm. At the end, some methods for reducing the number of unsuccessful decodings in the new proposed algorithms are considered.

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


A robust method for handling low density regions in hybrid simulations for collisionless plasmas A robust method to handle vacuum and near vacuum regions in hybrid simulations for space and astrophysical plasmas is presented. The conventional hybrid simulation model dealing with kinetic ions and a massless charge-neutralizing electron fluid is known to be susceptible to numerical instability due to divergence of the whistler-mode wave dispersion, as well as division-by-density operation in regions of low density. Consequently, a pure vacuum region is not allowed to exist in the simulation domain unless some ad hoc technique is used. To resolve this difficulty, an alternative way to introduce finite electron inertia effect is proposed. Contrary to the conventional method, the proposed one introduces a correction to the electric field rather than the magnetic field. It is shown that the generalized Ohm's law correctly reduces to Laplace's equation in a vacuum which therefore does not involve any numerical problems. In addition, a variable ion-to-electron mass ratio is introduced to reduce the phase velocity of high frequency whistler waves at low density regions so that the stability condition is always satisfied. It is demonstrated that the proposed model is able to handle near vacuum regions generated as a result of nonlinear self-consistent development of the system, as well as pure vacuum regions set up at the initial condition, without losing the advantages of the standard hybrid code.

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


Emergent cooperative goal-satisfaction in large-scale automated-agent systems Cooperation among autonomous agents has been discussed in the DAI community for several years. Papers about cooperation (Conte et al., 1991; Rosenschein, 1986), negotiation (Kraus and Wilkenfeld, 1991), distributed planning (Conry et al., 1988), and coalition formation (Ketchpel, 1994; Sandholm and Lesser, 1997), have provided a variety of approaches and several algorithms and solutions to situations wherein cooperation is possible. However, the case of cooperation in large-scale multi-agent systems (MAS) has not been thoroughly examined. Therefore, in this paper we present a framework for cooperative goal-satisfaction in large-scale environments focusing on a low-complexity physics-oriented approach. The multi-agent systems with which we deal are modeled by a physics-oriented model. According to the model, MAS inherit physical properties, and therefore the evolution of the computational systems is similar to the evolution of physical systems. To enable implementation of the model, we provide a detailed algorithm to be used by a single agent within the system. The model and the algorithm are appropriate for large-scale, dynamic, Distributed Problem Solver systems, in which agents try to increase the benefits of the whole system. The complexity is very low, and in some specific cases it is proved to be optimal. The analysis and assessment of the algorithm are performed via the well-known behavior and properties of the modeling physical system. (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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Visualizing Image Collections Using High-Entropy Layout Distributions Mechanisms for visualizing image collections are essential for browsing and exploring their content. This is especially true when metadata are ineffective in retrieving items due to the sparsity or esoteric nature of text. An obvious approach is to automatically lay out sets of images in ways that reflect relationships between the items. However, dimensionality reduction methods that map from high-dimensional content-based feature distributions to low-dimensional layout spaces for visualization often result in displays in which many items are occluded whilst large regions are empty or only sparsely populated. Furthermore, such methods do not consider the shape of the region of layout space to be populated. This paper proposes a method, high-entropy layout distributions. that addresses these limitations. Layout distributions with low differential entropy are penalized. An optimization strategy is presented that finds layouts that have high differential entropy and that reflect inter-image similarities. Efficient optimization is obtained using a step-size constraint and an approximation to quadratic (Renyi) entropy. Two image archives of cultural and commercial importance are used to illustrate and evaluate the method. A comparison with related methods demonstrates its effectiveness.

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

content-based browsing
high-entropy layout distribution (held)
image layouts
manifold learning


Hard problems in similarity searching The Closest Substring Problem is one of the most important problems in the field of computational biology. It is stated as follows: given a set of t sequences s1,s2,,st over an alphabet ?, and two integers k,d with d?k, can one find a string s of length k and, for all i=1,2,,t, substrings oi of si, all of length k, such that d(s,oi)?d (for all i=1,2,,t)? (here, d(.,.) represents the Hamming distance). Closest Substring was shown to be NP-hard (Proceedings of 10th SODA, 1999, pp. 633642) and W[1]-hard with respect to the number t of input sequences (Proceedings of STACS02, Lecture Notes in Computer Science, Vol. 2285, 2002, pp. 262273); recently, an important number of results concerning the parameterized computational complexity of Closest Substring has been added in Evans et al. (Theoret. Comput. Sci. 306 (13) (2003) 407). In this paper we introduce and analyze two variants of the Closest Substring Problem, obtained by imposing restrictions on the pairwise distances between the substrings oi: the bounded Hamming distance constraint asks that d(oi,oj)?p, for all i,j?{1,2,,t} (where p<2d is a given constant) and yields the problem called BCCS; the sum-of-pairs constraint asks that ?1?i<j?td(oi,oj)?P ? 1 ? i < j ? t d ( o i , o j ) ? P (where P<dt(t?1) is a given constant) and yields the problem called SCCS.

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


A Scalable Farm Skeleton for Hybrid Parallel and Distributed Programming Multi-core processors and clusters of multi-core processors are ubiquitous. They provide scalable performance yet introducing complex and low-level programming models for shared and distributed memory programming. Thus, fully exploiting the potential of shared and distributed memory parallelization can be a tedious and error-prone task: programmers must take care of low-level threading and communication (e.g. message passing) details. In order to assist programmers in developing performant and reliable parallel applications Algorithmic Skeletons have been proposed. They encapsulate well-defined, frequently recurring parallel and distributed programming patterns, thus shielding programmers from low-level aspects of parallel and distributed programming. In this paper we take on the design and implementation of the well-known Farm skeleton. In order to address the hybrid architecture of multi-core clusters we present a two-tier implementation built on top of MPI and OpenMP. On the basis of three benchmark applications, including a simple ray tracer, an interacting particles system, and an application for calculating the Mandelbrot set, we illustrate the advantages of both skeletal programming in general and this two-tier approach in particular.

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

high-level parallel programming
shared/distributed memory


Patterns from the sky - Satellite image analysis using pulse coupled neural networks for pre-processing, segmentation and edge detection In this work we attempt to distinguish land from water in satellite images, specifically images taken by the FORTE satellite. First, we successfully approximate areas hidden by stationary artefacts in the image. We then segment regions of land from water. Finally, we determine the boundaries of the surrounding landmasses. (C) 2000 Elsevier Science B.V. All rights reserved.

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

satellite images
segmentation
artefacts
forte


Dynamic influent pollutant disturbance scenario generation using a phenomenological modelling approach Activated Sludge Models are widely used for simulation-based evaluation of wastewater treatment plant (WWTP) performance. However, due to the high workload and cost of a measuring campaign on a full-scale WWTP, many simulation studies suffer from lack of sufficiently long influent flow rate and concentration time series representing realistic wastewater influent dynamics. In this paper, a simple phenomenological modelling approach is proposed as an alternative to generate dynamic influent pollutant disturbance scenarios. The presented set of models is constructed following the principles of parsimony (limiting the number of parameters as much as possible), transparency (using parameters with physical meaning where possible) and flexibility (easily extendable to other applications where long dynamic influent time series are needed). The proposed approach is sub-divided in four main model blocks: 1) model block for flow rate generation, 2) model block for pollutants generation (carbon, nitrogen and phosphorus), 3) model block for temperature generation and 4) model block for transport of water and pollutants. The paper is illustrated with the results obtained during the development of the dynamic influent of the Benchmark Simulation Model no. 2 (BSM2). The series of simulations show that it is possible to generate a dry weather influent describing diurnal flow rate dynamics (low rate at night, high rate during day time), weekend effects (with different flow rate during weekends, compared to weekdays), holiday effects (where the wastewater production is assumed to be different for a number of weeks) and seasonal effects (with variations in the infiltration and thus also the flow rate to the WWTP). In addition, the dry weather model can be extended with a rain and storm weather generator, where the proposed phenomenological model can also mimic the first flush effect from the sewer network and the influent dilution phenomena that are typically observed at full-scale WWTPs following a rain event. Finally, the extension of the sewersystem can be incorporated in the influent dynamics as well: the larger the simulated sewer network, the smoother the simulated diurnal flow rate and concentration variations. In the discussion, it is pointed out how the proposed phenomenological models can be expanded to other applications, for example to represent heavy metal or organic micro-pollutant loads entering the treatment plant.

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

dynamic disturbances
influent modelling
urban drainage


Follow the money - Assessing the allocation of E-Rate funds Expanding the principles of the universal provision of telecommunications services to encompass elementary and secondary schools and libraries, lawmakers paved the way for the creation of the E-Rate program by passing the Telecommunications Act in 1996. The E-Rate program aims to bridge the digital divide in advanced telecommunications by offering services to eligible schools and libraries for educational purposes at discounted rates. Currently in its sixth cycle, the E-Rate program has provided nearly US$13 billion in discounts to eligible organizations. The program has inspired much controversy and criticism, yet studies provide evidence that the program is effectively helping to enhance the provision of services to traditionally disadvantaged communities. This study challenges these claims and presents empirical evidence that suggests E-Rate resources are not systematically allocated to underprivileged, rural states where funds would most effectively help to bridge the digital gap in access to telecommunications technologies.

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

telecommunications technologies
digital divide

e-rate
universal access
resource allocation
telecommunications act of 1996


Measurements and simulations of the heat transfer on end windings of an induction machine Purpose - For an accurate simulation of the temperature distribution inside an electrical machine a method for deriving the convective heat transfer coefficient numerically would be desirable. The purpose of this paper is to present a reliable simulation setup, which is able to reproduce the measured, convective heat transfer coefficient at certain spots on the end windings of an electric machine. Design/methodology/approach - The heat flux density on certain spots on the end windings of an induction motor have been measured with heat flux sensors, in order to find out the convective heat transfer coefficient. To identify the air mass flow inside a cooling duct of an encapsulated cooling circuit during the operation of the motor, the pressure loss inside the duct has been measured. The measured data for temperature and air mass flow have been used as boundary conditions for the identification of the convective heat transfer coefficient with a commercial software for computational fluid dynamics (CFD). Findings - The measured data for the local convective heat transfer coefficients have been compared to the results of the numerical simulation for various rotational velocities. The quality of the simulated convective heat transfer coefficient depending on the rotational velocity meets the measured values. Owing to the used simplified model, the quantity of the measured values differ strongly around the simulated coefficient for the convective heat transfer. Originality/value - The derivation of the convective heat transfer is a challenging subject in CFD but has become more reliable with the invention of the SST and the SAS-SST turbulence model. In the present work, measurements on the end windings have been compared to simulation results derived with the SAS-SST turbulence model.

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

cooling
fluid dynamics
simulation
heat transfer

electric machines
thermal analysis
thermal variables measurement
traction motors


local redundant polymorphism query elimination Dynamic polymorphism is a powerful yet costly feature of object-oriented programming languages. To improve performance, several techniques have been developed to simplify or remove polymorphism operations when they are not needed. However, these techniques have little effect on sites that are actively polymorphic. In this paper we present an alternate approach to the optimization of operations such as virtual dispatches and type tests. Rather than attempt to eliminate the polymorphism mechanism, we identify situations where resolved type and method information can be shared across multiple polymorphism operations. In short, we perform a partial redundancy elimination transform over the loads and tests that constitute polymorphism queries. We describe the realization of our technique in the Jikes RVM and present its effects on the DACAPO and SPECJVM98 benchmarks. Rigorous measurements show a mean improvement, including several statistically significant results, over a configuration with no dispatch optimization and over one that employs guarded inlining. We underscore the potential of our approach by demonstrating speedups of up to 14\% on a highly polymorphic benchmark. Our results show the approach is both successful and complementary to techniques that focus on degenerate polymorphism.

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


acm international workshop on interactive multimedia on mobile and portable devices (immpd'11) With the mobile and portable devices become ubiquitous for people's daily life, how to design user interfaces of these products that enable natural, intuitive and fun interaction is one of the main challenges the multimedia community is facing. Following several successful events, the ACM International workshop on Interactive Multimedia on Mobile and Portable Devices (IMMPD'11) aims to bring together researchers from both academia and industry in domains including computer vision, audio and speech processing, machine learning, pattern recognition, communications, human-computer interaction, and media technology to share and discuss recent advances in interactive multimedia.

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

human-computer interaction
consumer electronics
pattern recognition.


Decision-making under time pressure with different information sources and performance-based financial incentives - Part 2 In Part 2, we examine the viability of the new symbolic language that we described in Part 1, in a specific setting. Using an abstract classification task that involves decision-making under time pressure, we study multiple measures of subject performance at this task using the new language vis-a-vis written and spoken English. Initial experimental results suggest that, despite its relative novelty, the proposed language is at least as effective as the more traditional communication modes in the specific setting examined, while succinctly conveying what must be conveyed. (C) 2002 Elsevier Science B.V. All rights reserved.

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

decision-making
multimedia systems
mobile computing
ex-ante dss evaluation
induced value theory


Air gap formation by UV-assisted decomposition of CVD material A sacrificial material deposited by CVD is used to demonstrate air gap formation in single damascene structures by UV-assisted decomposition. The material is removed through a porous low-k cap, after completion of the damascene scheme. The porosity of the low-k cap is shown to be critical for efficient air gap formation. Capacitance reduction of ?50% is demonstrated using this technique compared to conventional SiOC(H) interconnects and an effective dielectric constant of 1.7 is extrapolated.

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

sacrificial material
capacitance reduction
cvd
decomposition


Recovering distributed objects Distributed multithreaded applications operating in shared-nothing environments present challenges to classical fault tolerance mechanisms. The piecewise determinism assumption is lost (due to multithreading), and data must be replicated (because of the shared-nothing environment). In this paper, we explore a systematic approach to providing fault tolerance, by considering data-race-free programs that have the benefits of piecewise determinism and yet allow multithreading. We base our logging and recovery algorithm on a logical ring structure that allows the underlying distributed system to migrate threads, migrate and replicate objects, and perform multi-object transactions. (C) 2001 Elsevier Science B.V. All rights reserved.

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

distributed objects
fault tolerance
logging


Bio and health informatics meets cloud : BioVLab as an example The exponential increase of genomic data brought by the advent of the next or the third generation sequencing (NGS) technologies and the dramatic drop in sequencing cost have driven biological and medical sciences to data-driven sciences. This revolutionary paradigm shift comes with challenges in terms of data transfer, storage, computation, and analysis of big bio/medical data. Cloud computing is a service model sharing a pool of configurable resources, which is a suitable workbench to address these challenges. From the medical or biological perspective, providing computing power and storage is the most attractive feature of cloud computing in handling the ever increasing biological data. As data increases in size, many research organizations start to experience the lack of computing power, which becomes a major hurdle in achieving research goals. In this paper, we review the features of publically available bio and health cloud systems in terms of graphical user interface, external data integration, security and extensibility of features. We then discuss about issues and limitations of current cloud systems and conclude with suggestion of a biological cloud environment concept, which can be defined as a total workbench environment assembling computational tools and databases for analyzing bio/medical big data in particular application domains.

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

cloud computing
big data
user interface
data integration
analysis
security


Correlation and the time interval in multiple regression models In this paper we investigate the time interval effect of multiple regression models in which some of the variables are additive and some are multiplicative. The effect on the partial regression and correlation coefficients is influenced by the selected time interval. We find that the partial regression and correlation coefficients between two additive variables approach one-period values as n increases. When one of the variables is multiplicative, they will approach zero in the limit. We also show that the decreasing speed of the n-period correlation coefficients between both multiplicative variables is faster than others, except that a one-period correlation has a higher positive value. The results of this paper can be widely applied in various fields where regression or correlation analyses are employed.

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

correlation coefficient
partial regression coefficient


Linear time-dependent constraints programming with MSVL This paper investigates specifying and solving linear time-dependent constraints with an interval temporal logic programming language MSVL. To this end, linear constraint statements involving linear equality and non-strict inequality are first defined. Further, the time-dependent relations in the constraints are specified by temporal operators, such as . Thus, linear time-dependent constraints can be smoothly incorporated into MSVL. Moreover, to solve the linear constraints within MSVL by means of reduction, the operational semantics for linear constraints is given. In particular, semantic equivalence rules and transition rules within a state are presented, which enable us to reduce linear equations, inequalities and optimization problems in a convenient way. Besides, the operational semantics is proved to be sound. Finally, a production scheduling application is provided to illustrate how our approach works in practice.

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

temporal logic
msvl
operational semantics


From Business Intelligence to semantic data stream management Evolution of Business Intelligence with emergence of Big Data technologies. New technologies and approaches the 3Vs (Volume, Velocity and Variety) of Big data. Stream reasoning over Big Data. Summarizing data streams (semantic and classic data). Semantic data matching in stream context.

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


a roadmap towards sustainable self-aware service systems Self-awareness and self-adaptation have become primary concerns in large-scale systems as they have become too complex to be managed by human administrators alone, but rather require a new blend of coordination mechanisms between people and software services. This paper presents a roadmap to effective and efficient system adaptation through coupling self-awareness of global-level goals with sustainability constraints. Sustainability of large-scale systems challenges self-adaptation approaches by its intrinsic characters of global and long-lasting effects. We introduce five levels of awareness: (i) event-awareness, (ii) situation-awareness, (iii) adaptability awareness, (iv) goal-awareness, and (v) future-awareness. Within each level we introduce applicable principles and subsequently outline necessary models, algorithms, and protocols. The approach puts special focus on the interdependencies of human and service elements.

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

self-awareness
adaptation coordination
service system
context patterns


A method for recognizing overlapping elliptical bubbles in bubble image Direct imaging technology is an effective and convenient method for the estimation of bubble size distribution (BSD). However, overlapping bubble has an influence on BSD when gas holdup is more than 1%. In this paper, we present a new method of overlapping elliptical bubble recognition to determine bubble size. The method mainly includes two steps: contour segmentation and segment grouping. Contour segmentation is on the assumption that the concave points in the dominant point sequence are always the connecting points, and segment grouping is mainly based on the average distance deviation criterion. Both simulated images and real bubble images are used to evaluate this new method. The results show that it is effective in the recognition of overlapping elliptical bubbles and have a potential in other elliptical object recognition. In the last, two methods are used for BSD estimation. It is found that the bubble size (such d10 or d32) estimated by the ignore method is slightly smaller than that estimated by the recognition method.

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

direct imaging
bubble recognition
overlapping
bubble size distribution


Calculation by artificial compressibility method and virtual flux method on GPU In this study, artificial compressibility method and virtual flux method were implemented on GPUs. Because GPUs are recognized as massively parallel computers, DP-LUR was employed as time integration method. In spite of slow convergence characteristics of DP-LUR, calculation by the coupling of DP-LUR and GPU is about 15 times faster in time than that of LU-SGS and single CPU. Virtual flux method, which enables to calculate flow around curved surface on the Cartesian grid is also implemented to artificial compressibility method on GPU program, which was implemented in this study. GPU code of virtual flux method is about 8 times faster than CPU code. (C) 2011 Elsevier Ltd. All rights reserved.

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


A synthetic view of belief revision with uncertain inputs in the framework of possibility theory This paper discusses belief revision under uncertain inputs in the framework of possibility theory. This framework is flexible enough to allow for numerical and ordinal revision procedures. it is emphasized that revision under uncertain inputs can be understood in two different ways, depending on whether the input is viewed as a constraint to be enforced, or as an unreliable piece of information. Two revision rules are proposed to implement these forms of revision. Ir is shown that M. A. Williams's transmutations, originally defined in the setting of Spohn's functions, can be captured in possibility theory, as well as Boutilier's natural revision. The use of conditioning greatly simplifies the description of these belief change operations. Lastly, preliminary results on implementing revision rules at the syntactic level are given. (C) 1997 Elsevier Science Inc.

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


A Regional Approach to Foot and Ankle MRI This chapter presents a regional anatomic approach to MRI applications in the foot and ankle. From a clinical perspective, patients often describe their symptoms in terms of the part of the foot that hurts and when and how it hurts. Clinical questioning and physical diagnosis pursue this line as well, trying to narrow down the diagnostic possibilities. There are conditions that may blur the anatomic distinctions for forefoot, midfoot, rearfoot, and ankle; involve more than one region of the foot simultaneously; or occur in any area of the foot. The chapter also includes a separate section on the presentations of inflammatory arthritides in foot and ankle joints.

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

metatarsalgia
heel pain
tendon injuries
plantar plate
fracture


Profiling the non-users: Examination of life-position indicators, sensation seeking, shyness, and loneliness among users and non-users of social network sites The aim of the current study is to explore if there are differences between users and non-users of social network sites in terms of their sensation seeking, life-position indicators, shyness, and loneliness. Using data from a survey of adults 1976years old, results revealed that compared to an average Facebook user, a non-user is significantly older and scores higher on shyness and loneliness, is less socially active, and less prone to sensation seeking activities. Facebook is not a substitute channel of communication for those who are shy and lonely and lack face-to-face interactions. This study extends our knowledge of digital divide, uses and gratifications theory, and social enhancement hypothesis.

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

facebook
digital divide
sensation seeking


Computing with Coupled Chaotic Neuronal Maps Chaos computing is a new paradigm of an unconventional computing that exploits the extreme non linearity of chaotic systems. We propose a stragey for chaos based computation in one-way coupled chaotic neuronal maps. In the drive-response unit, either the output state of the response system or the synchronization error between drive response systems are used to obtain basic logic operation.

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

chaotic dynamics
control and synchronization


Robust F0 estimation based on complex LPC analysis for IRS filtered noisy speech This paper proposes a novel robust fundamental frequency (F0) estimation algorithm based on complex-valued speech analysis for an analytic speech signal. Since analytic signal provides spectra only over positive frequencies, spectra can be accurately estimated in low frequencies. Consequently, it is considered that F0 estimation using the residual signal extracted by complex valued speech analysis can perform better for F0 estimation than that for the residual signal extracted by conventional real-valued LPC analysis. In this paper, the autocorrelation function weighted by AMDF is adopted for the F0 estimation criterion and four signals; speech signal, analytic speech signal, LPC residual and complex LPC residual, are evaluated for the F0 estimation. Speech signals used in the experiments were an IRS filtered speech corrupted by adding white Gaussian noise or Pink noise whose noise levels are 10, 5, 0, -5 [dB]. The experimental results demonstrate that the proposed algorithm based on complex LPC residual can perform better than other methods in noisy environment.

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

speech analysis
f0 estimation
analytic signal
complex lpc residual
irs filtered speech


Modeling Wikipedia admin elections using multidimensional behavioral social networks Wikipedia admins are editors entrusted with special privileges and duties, responsible for the community management of Wikipedia. They are elected using a special procedure defined by the Wikipedia community, called Request for Adminship (RfA). Because of the growing amount of management work (quality control, coordination, maintenance) on the Wikipedia, the importance of admins is growing. At the same time, there exists evidence that the admin community is growing more slowly than expected. We present an analysis of the RfA procedure in the Polish-language Wikipedia, since the procedures introduction in 2005. With the goal of discovering good candidates for new admins that could be accepted by the community, we model the admin elections using multidimensional behavioral social networks derived from the Wikipedia edit history. We find that we can classify the votes in the RfA procedures using this model with an accuracy level that should be sufficient to recommend candidates. We also propose and verify interpretations of the dimensions of the social network. We find that one of the dimensions, based on discussion on Wikipedia talk pages, can be validly interpreted as acquaintance among editors, and discuss the relevance of this dimension to the admin elections.

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


A computational model for ratbot locomotion based on cyborg intelligence ? Ratbots with electric stimulation in their brains possess not only their own biological sensation, perception, memory, and locomotion control abilities, but also machine visual sensation, memory and computing functionalities. With electrodes implanted in the medial forebrain bundle (MFB), we propose here a hybrid bio-machine locomotion system in the ratbots, processing the machine visual inputs, forming hybrid multiple memory system and outputting locomotion commands for navigation behaviors. To illustrate the enhanced performance of the ratbots theoretically, a computational model is presented to show how the multiple memory system affects the central pattern generator (CPG) generating the gait pattern and running velocity. Compared with the extensive data from behavioral experiments, the results output from the proposed computational model fit the data of the decision accuracy and the relative velocity well, thus shown that the model provides a possible locomotion control mechanism innately in the cyborg systems.

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

cyborg systems
ratbot locomotion
central pattern generator
computational model


Strained InGaAsP multi-quantum-well structures for InP-based wide linewidth and polarization-insensitive semiconductor optical amplifiers We have calculated the band structure of 1.55?m InGaAsP/InGaAsP multi-quantum-well structures using LttingerKohn Hamiltonian taking into account the strain in the quantum wells (QWs) and barriers, and the confinement in the quantum wells. Using the calculated dispersion curves and oscillator strength between the different interband transitions, we have determined the optical gain in TE and TM mode and the spontaneous amplified emission as a function of injected carrier density in devices composed of quantum wells with different thicknesses. We find that an optical gain linewidth larger than 130nm with a TE/TM polarization dependence lower than 1dB can be obtained using a three-quantum-well In0.53Ga0.47As0.96P0.04/InGaAsP active layer with quantum well thicknesses of 10, 14 and 19nm.

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


Buying and selling an asset over the finite time horizon: A non-parametric approach We consider the problem of buying an asset and selling it later in the open market within a limited time-period. In such a situation, it is usually assumed that the market prices are random observations from a known distribution. However, we propose in the paper the rank-based trading strategy that does not require any distributional assumption. We only assume that the agent's utility depends on the actual ranks of the purchase and selling prices of the asset. The non-parametric trading policy, which maximizes the agent's expected utility, can be stated with a sequence of critical ranks; the agent must buy an asset at time j if the relative rank of its purchase price is larger than the pre-specified critical rank at that time. Likewise, the agent must sell the asset at time k if the relative rank of its selling price is less than the pre-specified critical rank at time k. Finally, we conduct a simulation experiment to analyze the effect of the auto-correlation in market prices on the performance of the optimal trading policy.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 programming
sequential decision analysis
optimal stopping rule


a loop accelerator for low power embedded vliw processors The high transistor density afforded by modern VLSI processes have enabled the design of embedded processors that use clustered execution units to deliver high levels of performance. However, delivering data to the execution resources in a timely manner remains a major problem that limits ILP. It is particularly significant for embedded systems where memory and power budgets are limited. A distributed address generation and loop acceleration architecture for VLIW processors is presented. This decentralized on-chip memory architecture uses multiple SRAMs to provide high intra-processor bandwidth. Each SRAM has an associated stream address generator capable of implementing a variety of addressing modes in conjunction with a shared loop accelerator. The architecture is extremely useful for generating application specific embedded processors, particularly for processing input data which is organized as a stream. The idea is evaluated in the context of a fine grain VLIWarchitecture executing complex perception algorithms such as speech and visual feature recognition. Transistor level Spice simulations are used to demonstrate a 159x improvement in the energy delay product when compared to conventional architectures executing the same applications.

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


knowledge propagation in large image databases using neighborhood information The aim of this paper is to reduce to a minimum the level of human intervention in the semantic annotation process of images. Ideally, only one copy of each object of interest would be labeled manually, and the labels would then be propagated automatically to all other occurrences of the objects in the database. To that end, we propose a neighbor-based influence propagation approach KProp which builds a voting model and propagates the knowledge associated to some objects to similar objects. We show that KProp can perform efficiently through matrix computations and achieve better performance with fewer labeled examples per object.

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


A generalized model for scratch detection This paper presents a generalization of Kokaram's model for scratch lines detection on digital film materials. It is based on the assumption that scratch is not purely additive on a given image but shows also a destroying effect. This result allows us to design a more efficacious scratch detector which performs on a hierarchical representation of a degraded image, i.e., on its cross section local extrema. Thanks to Weber's law, the proposed detector even works well on slight scratches resulting completely automatic, except for the scratch color (black or white). The experimental results show that the proposed detector works better in terms of good detection and false alarms rejection with a lower computing time.

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


Robust Wavelet Sliding-Mode Control via Time-Variant Sliding Function In this paper, a new robust wavelet time-variant sliding-mode control (RWTVSMC) for an uncertain nonlinear system is presented. The proposed method is composed of two controllers, based on a time variant sliding equation. For this purpose a neural wavelet controller is designed to approximate an ideal controller based on the wavelet network approximation. Also a robust controller is designed to achieve H(infinity) tracking performance. New terminologies, rejection parameter and rejection regulator, for filtering all un-modeled frequencies are defined. A time-variant sliding equation based on the time-variant rejection parameter to achieve the best tracking performance is then presented. In addition, two theorems and one lemma which facilitate design of robust wavelet sliding-mode control are proved. Also, two simulation examples are presented to illustrate the performance and the advantages of the proposed method.

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

robust control
wavelet networks
time-variant sliding-mode


Localising missing plants in squared-grid patterns of discontinuous crops from remotely sensed imagery The purpose of this work is to localise and characterise missing plants on very high resolution (VHR) aerial images of agricultural parcels, in the case of discontinuous crops like wine and olive tree, which are planted according to a squared-grid pattern. It aims to establish an assisted, image processing system for remote sensed images, allowing the inventory the missing or withering plants, and the monitoring of their evolution during time. The global approach considers the planted parcel as a topological graph of vertices, whose reciprocal location conforms to a set of geometrical rules about orientation and length. The proposed system initiates the graph from the original image; then it adds missing vertices and refines its knowledge of the spatial pattern on an iterative basis. Quality indicators are assigned at each added vertex, and several stopping criteria are estimated for each iteration, permitting an automated use of the algorithm. Test cases have been conducted on two data sets of three parcels each: olive groves and goblet vineyards. The results are compared to validation data. They show an efficient reconstruction of the geometry and satisfactory omission-commission errors; they allow drawing up a typology of the major errors, and propose calibration parameters based on a sensitivity analysis. The main improvements include essentially the preprocessing, filtering step of the initial image. The process is being used for Languedocian vineyards (France), and may be potentially usable for other problematic with the same kind of spatial patterns. (C) 2005 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 B O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

remote sensing
digital image analysis
point pattern
olea europae l.
vitis vinifera l.


Applied analysis for improving rail-network operations Crew-scheduling component is analyzed by a column generation approach. Results show that efficiency of crew schedules can be improved by more than 9%. Additional driver training will increase the improvement to 15%. A detailed reliability analysis is demonstrated. A main causes for delays and unreliability problems is heavy passenger load.

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

crew scheduling
set covering
rail reliability
punctuality
delay


Saccade-related remapping of target representations between topographic maps: a neural network study The goal of this study was to explore how a neural network could solve the updating task associated with the double-saccade paradigm, where two targets are flashed in succession and the subject must make saccades to the remembered locations of both targets. Because of the eye rotation of the saccade to the first target, the remembered retinal position of the second target must be updated if an accurate saccade to that target is to be made. We trained a three-layer, feed-forward neural network to solve this updating task using back-propagation. The networks inputs were the initial retinal position of the second target represented by a hill of activation in a 2D topographic array of units, as well as the initial eye orientation and the motor error of the saccade to the first target, each represented as 3D vectors in brainstem coordinates. The output of the network was the updated retinal position of the second target, also represented in a 2D topographic array of units. The network was trained to perform this updating using the full 3D geometry of eye rotations, and was able to produce the updated second-target position to within a 1 RMS accuracy for a set of test points that included saccades of up to 70. Emergent properties in the network's hidden layer included sigmoidal receptive fields whose orientations formed distinct clusters, and predictive remapping similar to that seen in brain areas associated with saccade generation. Networks with the larger numbers of hidden-layer units developed two distinct types of units with different transformation properties: units that preferentially performed the linear remapping of vector subtraction, and units that performed the nonlinear elements of remapping that arise from initial eye orientation.

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

updating saccade
model
superior colliculus
topographic representation


Ship speed optimization: Concepts, models and combined speed-routing scenarios Clarification of some important issues as regards ship speed optimization at the operational level. Development of models that optimize ship speed for a spectrum of routing scenarios. Clarification of concepts and misconceptions. Incorporation of fundamental parameters that weigh heavily in speed and routing decisions. Identification of properties of optimal solution.

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


Fast and robust extraction of surrogate respiratory signal from intra-operative liver ultrasound images In model-based respiratory motion estimation for the liver or other abdominal organs, the surrogate respiratory signal is usually obtained by using special tracking devices from skin or diaphragm, and subsequently applied to parameterize a 4D motion model for prediction or compensation. However, due to the intrinsic limits and economical costs of these tracking devices, the identification of the respiratory signal directly from intra-operative ultrasound images is a more attractive alternative.

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

ultrasound liver images
similarity metric
adaptive searching


Heuristic constraints enforcement for training of and rule extraction from a fuzzy/neural architecture - Part II: Implementation and application This paper is the second of two companion papers. The foundations of the proposed method of heuristic constraint enforcement on membership functions for knowledge extraction from a fuzzy/neural architecture was given in Part I. Part II develops methods for forming constraint sets using the constraints and techniques for finding acceptable solutions that conform to all available a priori information. Moreover, methods of integration of enforcement methods into the training of the fuzzy-neural architecture are discussed. The proposed technique is illustrated on a fuzzy-AND classification problem and a motor fault detection problem. The results indicate that heuristic constraint enforcement on membership functions leads to extraction of heuristically acceptable membership functions in the input and output spaces. Although the method is described on a specific fuzzy/neural architecture, it is applicable to any realization of a fuzzy inference system, including adaptive and/or static fuzzy inference systems.

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

constraint enforcement
knowledge extraction


j2ee server scalability through ejb replication With the development of Internet-based business, Web applications are becoming increasingly complex. The J2EE specification aims at enabling the design of such web application servers. These servers have to ensure scalability and availability of the supported applications. Scalibility can be achieved using replication techniques or partitionning techniques. The aim of this paper is to compare these approaches. In a J2EE web application server, one important component is the EJB tier. In this context, the JOnAS web application server provides an example of EJB replication system called CMI (Cluster Method Invocation). In a first step, this paper presents a performance evaluation of CMI. It then introduces incrementally an alternative scheme based on partitionning and shows the performance benefits compared to CMI.

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


Development graphs - Proof management for structured specifications Development graphs are a toot for dealing with structured specifications in a formal program development in order to ease the management of change and reusing proofs. In this work, we extend development graphs with hiding (e.g. hidden operations). Hiding is a particularly difficult to realize operation, since it does not admit such a good decomposition of the involved specifications as other structuring operations do. We develop both a semantics and proof rules for development graphs with hiding. The rules are proven to be sound, and also complete relative to an oracle for conservative extensions. We also show that an absolutely complete set of rules cannot exist. The whole framework is developed in a way independent of the underlying logical system (and thus also does not prescribe the nature of the parts of a specification that may be hidden). We also show how various other logic independent specification formalisms can be mapped into development graphs; thus, development graphs can serve as a kernel formalism for management of proofs and of change. (c) 2005 Elsevier Inc. All rights reserved.

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

algebraic specification
proof calculus
institutions


Lattice Boltzmann simulation of water and gas flow in porous gas diffusion layers in fuel cells reconstructed from micro-tomography The porous gas diffusion layers (GDLs) are key components in hydrogen fuel cells. During their operation the cells produce water at the cathode, and to avoid flooding, the water has to be removed out of the cells. How to manage the water is therefore an important issue in fuel cell design. In this paper we investigated water flow in the GDLs using a combination of the lattice Boltzmann method and X-ray computed tomography at the micron scale. Water flow in the GDL depends on waterair surface tension and hydrophobicity. To correctly represent the watergas surface tension, the formations of water droplets in air were simulated, and the watergas surface tension was obtained by fitting the simulated results to the YoungLaplace formula. The hydrophobicity is represented by the watergas-fabric contact angle. For a given watergas surface tension the value of the contact angle was determined by simulating the formations of water droplets on a solid surface with different hydrophobicity. We then applied the model to simulate water intrusion into initially dry GDLs driven by a pressure gradient in attempts to understand the impact of hydrophobicity on water distribution in the GDLs. The structures of the GDL were acquired by X-ray micro-tomography at a resolution of 1.7 microns. The simulated results revealed that with an increase in hydrophobicity, water transport in GDLs changes from piston-flow to channelled flow.

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

gas diffusion layer
two-phase flow
x-ray computed tomography


create interactive web illustrations with google maps The use of Google Maps to display geographic content is commonplace. Google Maps is also useful in displaying high-resolution images on the Web, allowing visitors to move, zoom and pan within the image view window. A digital image is needed, along with a Google account to obtain a Google maps Application Programming Interface (API) key, Web space to load content that can use JavaScript, a computer that can run Java and an html editing application. GMap Image Cutter software may be downloaded from the University College London Centre for Advanced Spatial Analysis (CASA) site. The Image Cutter software divides a hi-resolution image into many small tiles. These tiles enable zooming to levels specified by the user during initial image cutting. An html file and a folder of image tiles are generated, usable on local systems with no further processing, but requiring a Google maps API key when posted to a Web server. Where a fully featured digital imaging library solution is impractical or unavailable, this technique enables interactive display of a high-resolution image with the familiar Google Maps controls. Though the underlying technology is complex, creating a Web illustration this way is easy, platform neutral and produces visually appealing results.

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


path delay analysis for hierarchical building block layout system This paper describes a path delay analysis system which employs an accurate signal delay calculation method for MOS LSIs, taking poly resistance into account. The system takes mask patterns generated by a hierarchical building block layout system as inputs, and verifies timing margins of a large scale random logic LSI in a module-wise bottom up fashion. Path delay analysis using a critical path trace algorithm and an enumerative path trace algorithm in combination is effective in locating critical timing regions in a chip and in analyzing critical paths in the regions in detail.

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

method
analysis
delay
layout
building block
logic
account
timing
algorithm
paper

hierarchic traces systems locatability signaling region large-scale module critic randomization effect combinational pattern


Wind speed-up process on the windward slope of dunes in dune fields Wind speed-up is a key physical factor affecting the transportation of windblown sand on the windward slope of a sand dune. It contributes to the understanding of dune morphology, evolution of dune field and dunes' migration. In this study, a computational model is proposed to calculate the wind speed-up factor on the windward slope of sand dunes in a dune field. This model not only reflects the influence of neighboring dunes, but also incorporates the effect of incoming wind speed, sand diameter and thickness of sand supply which have been little considered by previous studies. The computational complexity of our model is much lower than that of the Jackson-Hunt theory and the Computational Fluid Dynamics. Based on the wind speed-up model, we investigate the probability density function of wind speed-up factor in a dune field, and give an empirical expression of wind speed-up factor, which provides a basis for accurate prediction of wind speed on the windward slope of a sand dune in a real dune field. (c) 2012 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 B I O O O O O O O O O O O O O O O O O O O B I I I I O O B I O O O O O O O O O O O O O O O O O O O B I O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O 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

windward slope of sand dunes
sand supply
dune field
sand diameter


external storage middleware for wireless devices with limited resources This paper introduces an external storage middleware, that offers a set of functions (API - Application Program Interface) to mobile applications and facilitates the transfer of files between a mobile device and external storage servers regardless of the available wireless network. The Middleware selects the best wireless service available. In addition, the files exchanged between the mobile device and the external storage server are encrypted to provide security when traveling through the network. As a use case, it was developed an automatic file swapper service for mobile devices. The service is running on the mobile device optimizing its available storage space. Our middleware was tested with the following wireless services: Wi-Fi, GPRS, MMS.

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


Associativity-Based On-Demand Multi-Path Routing In Mobile Ad Hoc Networks This paper is primarily concerned with multi-path routing in Mobile Ad hoc Networks (MANETs). We propose a novel associativity-based on-demand source routing protocol for MANETs that attempts to establish relatively stable path(s) between the source and the destination. We introduce a new notion for gauging the temporal and spatial stability of nodes, and hence the paths interconnecting them. The proposed protocol is compared with other unipath (DSDV and AODV) and multi-path (AOMDV) routing protocols. We investigate the performance in terms of throughput, normalized routing overhead, packet delivery ratio etc. All on-demand protocols show good performance in mobile environments with less traffic overhead compared to proactive approaches, but they are prone to longer end-to-end delays due to route discovery and maintenance.

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

associativity
multi-path routing
node-disjoint


an approximate truthful mechanism for combinatorial auctions with single parameter agents Mechanism design seeks algorithms whose inputs are provided by selfish agents who would lie if advantageous. Incentive compatible mechanisms compel the agents to tell the truth by making it in their self-interest to do so. Often, as in combinatorial auctions, such mechanisms involve the solution of NP-hard problems. Unfortunately, approximation algorithms typically destroy incentive compatibility. Randomized rounding is a commonly used technique for designing approximation algorithms. We devise a version of randomized rounding that is incentive compatible, giving a truthful mechanism for combinatorial auctions with single parameter agents (e.g., "single minded bidders") that approximately maximizes the social value of the auction. We discuss two orthogonal notions of truthfulness for a randomized mechanism, truthfulness with high probability and in expectation, and give a mechanism that achieves both simultaneously.We consider combinatorial auctions where multiple copies of many different items are on sale, and each bidder i desires a subset S i . Given a set of bids, the problem of finding the allocation of items that maximizes total valuation is the well-known SETPACKING problem. This problem is NP-hard, but for the case of items with many identical copies the optimum can be approximated very well. To turn this approximation algorithm into a truthful auction mechanism we overcome two problems: we show how to make the allocation algorithm monotone , and give a method to compute the appropriate payments efficiently.

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

value
approximation algorithms
method
combinatorial auctions
approximation
auction
probability
case
version
social
algorithm
allocation
incentive compatibility

agent
computation
mechanical design
randomization


ERP modeling: a comprehensive approach We present a generic reverse engineering process, aimed at developing a model that captures the available alternatives at different application levels of an Enterprise Resource Planning (ERP) system. Such a model is needed when ERP systems are aligned with the needs of the enterprise in which they are implemented. In order to support the ERP implementation process, the model should describe the entire scope of the ERP system's functionality and the alternative business processes it supports, as well as the interdependencies among them. We analyze the desired properties a modeling language should satisfy to be applied in constructing an ERP system model. This analysis, which follows the Cooperative Requirements Engineering With Scenarios classification framework in its adapted ERP modeling form, results in a set of criteria for evaluating modeling languages for this purpose. Using these criteria, we evaluate the ObjectProcess modeling Methodology and apply it for generating a detailed ERP system model. The generic process and detailed criteria we develop can serve for comprehensive ERP modeling, as well as for obtaining a model of other process-supportive off-the-shelf systems that are of generic and configurable nature.

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

enterprise resource planning
reverse engineering
modeling languages


Visual Exploration across Biomedical Databases Though biomedical research often draws on knowledge from a wide variety of fields, few visualization methods for biomedical data incorporate meaningful cross-database exploration. A new approach is offered for visualizing and exploring a query-based subset of multiple heterogeneous biomedical databases. Databases are modeled as an entity-relation graph containing nodes (database records) and links (relationships between records). Users specify a keyword search string to retrieve an initial set of nodes, and then explore intra- and interdatabase links. Results are visualized with user-defined semantic substrates to take advantage of the rich set of attributes usually present in biomedical data. Comments from domain experts indicate that this visualization method is potentially advantageous for biomedical knowledge exploration.

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

data exploration and discovery
bioinformatics
information visualization


Design analysis of the propulsion and control system of an underactuated remotely operated vehicle using axiomatic design theory - Part 1 In this paper, the system design issues of the Propulsion and Control System of the ROV 11 are analyzed and addressed. The design concept, some of the upgraded features of the ROV 11 in comparison to ROV I and the unified pilot training and control system developed, will also be briefly discussed in this paper.

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

axiomatic design theory
propulsion and control system


exploring open narrative structures with tangibles The Constructed Narratives Construction Kit is a tangible game interface built on the 802.15.4 wireless protocol designed for supporting players social awareness of others who are also engaged in the collaborative building activity.

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

802.15.4 mesh networks
computer supported collaborative play
public space interfaces
tangible social interface
collaborative design


Bypass Extended Stack Processing for Anti-Thrashing Replacement in Shared Last Level Cache of Chip Multiprocessors Chip Multiprocessors (CMPs) allow different applications to share LLC (Last Level Cache). Since each application has different cache capacity demand, LLC capacity should be partitioned in accordance with the demands. Existing partitioning algorithms estimate the capacity demand of each core by stack processing considering the LRU (Least Recently Used) replacement policy only. However, anti-thrashing replacement algorithms like BIP (Binary Insertion Policy) and BIP-Bypass emerged to overcome the thrashing problem of LRU replacement policy in a working set greater than the available cache size. Since existing stack processing cannot estimate the capacity demand with anti-thrashing replacement policy, partitioning algorithms also cannot partition cache space with anti-thrashing replacement policy. In this letter, we prove that BIP replacement policy is not feasible to stack processing but BIP-bypass is. We modify stack processing to accommodate BIP-Bypass. In addition, we propose the pipelined hardware of modified stack processing. With this hardware, we can get the success function of the various capacities with anti-thrashing replacement policy and assess the cache capacity of shared cache adequate to each core in real time.

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

last level cache
stack processing
replacement policy

anti-thrashing
cache partitioning
chip multi-processors


Singularity analysis of fine-tuning Stewart platform for large radio telescope using genetic algorithm A new singularity analysis method for general six degree-of-freedom (DOF) Stewart platform using genetic algorithm (GA) is proposed in this paper. The Jacobian matrix of Stewart platform is first deduced, then the square of determinant of the Jacobian matrix is selected as the objective function, and the minimal of this objective function is searched in the workspace of Stewart platform by the GA. The singularity of Stewart platform depends on this minimal objective function: if this value is zero, the singularity of Stewart platform will take place, otherwise, the Stewart platform is singularity-free. The effectiveness of this new genetic singularity analysis method is validated by the singularity analysis of a six-DOF fine-tuning Stewart platform for the next generation large radio telescope. The results have shown that the fine-tuning Stewart platform is singularity-free, which has laid a solid base for the requirement of high precision trajectory tracking for the next generation large radio telescope. (C) 2002 Elsevier Science Ltd. All rights reserved.

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

stewart platform
singularity analysis
genetic algorithm
large radio telescope


increasing the number of effective registers in a low-power processor using a windowed register file Low-power embedded processors utilize compact instruction encodings to achieve small code size. Instruction sizes of 8 to 16 bits are common. Such encodings place tight restrictions on the number of bits available to encode operand specifiers, and thus on the number of architected registers. The central problem with this approach is that performance and power are often sacrificed as the burden of operand supply is shifted from the register file to the memory due to the limited number of registers. In this paper, we investigate the use of a windowed register file to address this problem by providing more registers than allowed in the encoding. The registers are organized as a set of identical register windows where at each point in the execution there is a single active window. Special window management instructions are used to change the active window and to transfer values between windows. The goal of this design is to give the appearance of a large register file without compromising the instruction encoding. To support the windowed register file, we designed and implemented a novel graph partitioning based compiler algorithm that partitions virtual registers within a given procedure across multiple windows. On a 16-bit embedded processor with a parameterized register window, an average of 10\% improvement in application performance and 7\% reduction in system power was achieved as an eight-register design was scaled from one to four windows.

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

graph partitioning
register window
instruction encoding
embedded processor


Simple Proofs of Classical Theorems in Discrete Geometry via the Guth-Katz Polynomial Partitioning Technique Recently Guth and Katz (arXiv:1011.4105, 2010) invented, as a step in their nearly complete solution of ErdAs's distinct distances problem, a new method for partitioning finite point sets in R-d , based on the Stone-Tukey polynomial ham-sandwich theorem. We apply this method to obtain new and simple proofs of two well known results: the Szemer,di-Trotter theorem on incidences of points and lines, and the existence of spanning trees with low crossing numbers. Since we consider these proofs particularly suitable for teaching, we aim at self-contained, expository treatment. We also mention some generalizations and extensions, such as the Pach-Sharir bound on the number of incidences with algebraic curves of bounded degree.

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

algebraic techniques
crossing number
spanning tree with low crossing number
polynomial ham-sandwich
partitioning polynomial


frequency domain metamodelling of a feedback queue Schruben and Cogliano [1987] introduced Frequency Domain Experiments as a tool for metamodel identification. To design a frequency domain experiment, the experimenter must choose appropriate values for certain experimental variables such as oscillation frequency, window size, and range of oscillation. In this paper, we demonstrate that these experimental variables affect the outcome of frequency domain experiments and the magnitude of these effects are model dependent.

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

affect values size design identification tool demonstrate feedback model paper

variability dependencies experimentation metamodeling experience windows effect


MATRIX FORMULATION FOR THE CALCULATION OF STRUCTURAL SYSTEMS RELIABILITY Based on matrix algebra and matrix formulations, a new technique for the calculation of structural systems reliability of girder bridges is presented in this paper. This technique guarantees a high degree of accuracy and at the same time allows the calculation to be performed in an automatic and efficient manner. This technique is illustrated by a numerical example and its main advantages are discussed in the conclusions.

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

probability of failure
safety margin
failure path formulation
sequence path formulation
girder bridge


A multi-agent system for acquiring and sharing lessons learned This paper presents a multi-agent system for knowledge management (KM) in research and development (R&D) projects. R&D teams have no time to organize project information, nor to articulate the rationale behind the actions that generated the information. Our aim is to provide a system for helping team members to explicit knowledge, and to allow them to share their experiences, i.e. lessons learned (LL), without asking them too much extra-work. The article focuses on how we intend to help the team members to feed the system with LL, using the operations they perform on desktop computers, and how we intend to exploit the LL by using a case-based reasoning engine. We have been developing a prototype of such a KM system for a cooperative project. (C) 2003 Elsevier B.V. All rights reserved.

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


Knowledge Based Perceptual Anchoring Perceptual anchoring is the process of creating and maintaining a connection between the sensor data corresponding to a physical object and its symbolic description. It is a subset of the symbol grounding problem, introduced by Harnad (Phys. D, Nonlinear Phenom. 42(13):335346, 1990) and investigated over the past years in several disciplines including robotics. This PhD dissertation focuses on a method for grounding sensor data of physical objects to the corresponding semantic descriptions, in the context of cognitive robots where the challenge is to establish the connection between percepts and concepts referring to objects, their relations and properties. We examine how knowledge representation can be used together with an anchoring framework, so as to complement the meaning of percepts while supporting better linguistic interaction with the use of the corresponding concepts. The proposed method addresses the need to represent and process both perceptual and semantic knowledge, often expressed in different abstraction levels, while originating from different modalities. We then focus on the integration of anchoring with a large scale knowledge base system and with perceptual routines. This integration is applied in a number of studies, where in the context of a smart home, several evaluations spanning from spatial and commonsense reasoning to linguistic interaction and concept acquisition.

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

anchoring
knowledge representation
symbol grounding

cognitive perception
common-sense information


Spatio-temporal approximate reasoning over complex objects We discuss the problems of spatio-temporal reasoning in the context of hierarchical information maps and approximate reasoning networks (AR networks). Hierarchical information maps are used for representations of domain knowledge about objects, their parts, and their dynamical changes. AR networks are patterns constructed over sensory measurements and they are discovered from hierarchical information maps and experimental data. They make it possible to approximate domain knowledge, i.e., complex spatio-temporal concepts and reasonings represented in hierarchical information maps. Experiments with classifiers based on AR schemes using a road traffic simulator are also briefly presented.

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

complex objects
information maps
ar schemes
ar networks

concept approximation
spatio-temporal reasoning
pattern
sensor measurement


NQP(C) = co-C=P Adleman, DeMarrais, and Huang introduced the nondeterministic quantum polynomial-time complexity class NQP as an analogue of NP. Fortnow and Rogers implicitly showed that, when the amplitudes are rational numbers, NQP is contained in the complement of C=P. Fenner, Green, Homer, and Pruim improved this result by showing that, when the amplitudes are arbitrary algebraic numbers, NQP coincides with co-C=P. In this paper we prove that, even when the amplitudes are arbitrary complex numbers, NQP still remains identical to co-C=P. As an immediate corollary, BQP differs from NQP when the amplitudes are unrestricted. (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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

computational complexity
theory of computation


Exploring the usability of the ISO reference terminology model for nursing actions in representing oriental nursing actions This study examined the extent to which the ISO reference terminology model for nursing actions represents oriental nursing actions in a computerized nursing documentation system to share data and foster communication between oriental nursing care and conventional nursing care. The narrative nursing notes of 545 patients retrieved from a nursing documentation system in an oriental medicine teaching hospital were analyzed. Among 49,118 entries, 933 were recorded as nursing actions. Each entry was decomposed in a set of single statements. A total of 1209 nursing action statements were derived and mapped to the components of the model. These processes were reviewed and validated by two domain experts and a nursing terminology expert. All of the oriental nursing actions documented contained a word or phrase that described the Action and Target in the model. The Recipient of Care was expressed explicitly in 1.2% of statements. The most frequently used Action terms were administering (19.7%), teaching (16.5%), and explaining (13.6%). The Target terms that indicated unique oriental nursing concepts included Sasang constitution differentiation, removal of acupuncture needles, herb moxibustion, oriental massage, and oriental medication. The findings demonstrate that oriental nursing actions can be represented using the ISO reference terminology model for nursing actions. Further specification of the components of the model will be useful to achieve consistent mapping across different settings. The addition of component qualifiers should also be taken into consideration to describe nursing actions at a more granular level.

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

nursing care
terminology
oriental medicine


Robust weighted LAD regression The least squares linear regression estimator is well-known to be highly sensitive to unusual observations in the data, and as a result many more robust estimators have been proposed as alternatives. One of the earliest proposals was least-sum of absolute deviations (LAD) regression, where the regression coefficients are estimated through minimization of the sum of the absolute values of the residuals. LAD regression has been largely ignored as a robust alternative to least squares, since it can be strongly affected by a single observation (that is, it has a breakdown point of 1/n 1 / n , where n is the sample size). In this paper we show that judicious choice of weights can result in a weighted LAD estimator with much higher breakdown point. We discuss the properties of the weighted LAD estimator, and show via simulation that its performance is competitive with that of high breakdown regression estimators, particularly in the presence of outliers located at leverage points. We also apply the estimator to several data sets.

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

breakdown point
leverage points
outliers


WebBase: a repository of Web pages In this paper, we study the problem of constructing and maintaining a large shared repository of Web pages. We discuss the unique characteristics of such a repository, propose an architecture, and identify its functional modules. We focus on the storage manager module, and illustrate how traditional techniques for storage and indexing can be tailored to meet the requirements of a Web repository. To evaluate design alternatives, we also present experimental results from a prototype repository called WebBase, that is currently being developed at Stanford University.

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


Spider Monkey Optimization algorithm for numerical optimization Swarm intelligence is one of the most promising area for the researchers in the field of numerical optimization. Researchers have developed many algorithms by simulating the swarming behavior of various creatures like ants, honey bees, fish, birds and the findings are very motivating. In this paper, a new approach for numerical optimization is proposed by modeling the foraging behavior of spider monkeys. Spider monkeys have been categorized as fissionfusion social structure based animals. The animals which follow fissionfusion social systems, split themselves from large to smaller groups and vice-versa based on the scarcity or availability of food. The proposed swarm intelligence approach is named as Spider Monkey Optimization (SMO) algorithm and can broadly be classified as an algorithm inspired by intelligent foraging behavior of fissionfusion social structure based animals.

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

swarm intelligence based algorithm
fissionfusion social system
spider monkey optimization