Bilateral symmetry aspects in computer-aided Alzheimer's disease diagnosis by single-photon emission-computed tomography imaging This paper explores the importance of the latent symmetry of the brain in computer-aided systems for diagnosing Alzheimer's disease (AD). Symmetry and asymmetry are studied from two points of view: (i) the development of an effective classifier within the scope of machine learning techniques, and (ii) the assessment of its relevance to the AD diagnosis in the early stages of the disease. The proposed methodology is based on eigenimage decomposition of single-photon emission-computed tomography images, using an eigenspace extension to accommodate odd and even eigenvectors separately. This feature extraction technique allows for support-vector-machine classification and image analysis. Identification of AD patterns is improved when the latent symmetry of the brain is considered, with an estimated 92.78% accuracy (92.86% sensitivity, 92.68% specificity) using a linear kernel and a leave-one-out cross validation strategy. Also, asymmetries may be used to define a test for AD that is very specific (90.24% specificity) but not especially sensitive. Two main conclusions are derived from the analysis of the eigenimage spectrum. Firstly, the recognition of AD patterns is improved when considering only the symmetric part of the spectrum. Secondly, asymmetries in the hypo-metabolic patterns, when present, are more pronounced in subjects with AD.

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

principal-component analysis
support-vector-machine
computer-aided diagnosis
alzheimer's disease


Efficient bitmap-based indexing of time-based interval sequences ? In this paper, we discuss similarity searches for time series data represented as interval sequences. For instance, the time series of phone call records can be represented by time-based interval sequences, or T T -interval sequences, which consist of the start and end times of the call records. To support an efficient similarity search for such sequences, we address the desirable semantics for similarity measures for the T T -interval sequences, observe how existing measures fail to address such semantics, and propose a new measure that satisfies all our semantics. We then propose approximate encoding methods for T T -interval sequences. More specifically, we propose two bitmap-based feature extraction methods: (1) a bin-bitmap encoding method that transforms the T T -interval sequences into bitmaps of fixed length, and (2) a segmented feature extraction method that takes the longest bitmap sequences of consecutive 1 elements. Finally, we propose two query processing schemes using these bitmap-based approximate representations. We validate the efficiency and effectiveness of our proposed solutions empirically.

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

indexing and approximate query processing


mobile phones as second screen for tv, enabling inter-audience interaction Despite the ever expanding forms of digital entertainment, there are still TV shows and events that create an audience desire to be part of a mass shared experience. In the past direct inter-audience interaction of such events has been restricted to either a shared location at the time of broadcast or later discussions amongst friends and colleagues often described as 'water cooler moments'. With the advent of online social networks that facilitate status updates these moments can be instantly shared in real-time, creating a second screen for interaction with TV. In this paper we investigate the role of social media as the facilitator of second screen for TV, through the analysis of tweets for weekend primetime UK TV show the X-Factor. The results highlight the rich source of information that can be extracted in real-time and its enormous potential for broadcasters and producers both in terms of reinvigorating live TV viewing and creating new forms of audience interaction.

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

narrative twitter interactive television performance


Mathematical foundation for modeling conceptual design sketches This paper aims to establish a mathematical foundation for modeling free-hand design sketches throughout the conceptual design process. Both experimental and theoretical approaches are used. In using the experimental approach, one case study from a book and one case study from an automobile assembly system manufacturer are used to illustrate the characteristics of design sketches. These characteristics provide the requirements for models of sketch representation. In using the theoretical approach, a mathematical structure of design sketches is established. This mathematical structure can naturally and logically model the evolving sketches generated in the design process, through integrating the strengths of set theory and mereology. In addition to the formal representation of design sketches, the mathematical model provides a logical foundation for formally designing sketch interpretation algorithms. An algorithmic structure of three-dimension reconstruction from two-dimension line drawing is derived using this mathematical model.

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

conceptual design
experimental approach
mathematical model


A Fast-Locking All-Digital Deskew Buffer With Duty-Cycle Correction In this paper, a fast-locking all-digital deskew buffer with duty cycle correction is proposed and implemented. A cyclic time-to-digital converter is introduced to decrease the locking time in conventional register-controlled delay-locked loop to only two input clock cycles in coarse tuning. With the aid of the three half delay lines technique, the mismatch between half delay lines causing the duty cycle distortion can be alleviated by interpolation. A balanced edge combiner to achieve a precise 50% output clock is also presented. A test chip is fabricated in 0.18-m technology to demonstrate the feasibility of the proposed architecture. The circuit can accept the input clock rates from 250 to 625 MHz with the duty cycle variation within 30% and 70% to generate 50% output clocks. It preserves the capability of closed-loop control with a small area and power consumption.

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

delay-locked loop (dll)
duty-cycle correction (dcc)
time-to-digital converter (tdc)


Understanding SaaS adoption from the perspective of organizational users: A tripod readiness model We examine factors that influence how ready organizational users are to adopt SaaS. SaaS adoption depends on technological, organizational and environmental readiness. Survey study in China support the importance of each aspect of SaaS Readiness. Different aspects of SaaS Readiness vary in priorities at decision and use stages.

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


Memory-saving memetic computing for path-following mobile robots In this paper, a recently proposed single-solution memetic computing optimization method, namely three stage optimization memetic exploration (3SOME), is used to implement a self-tuning PID controller on board of a mobile robot. More specifically, the optimal PID parameters minimizing a measure of the following error on a path-following operation are found, in real-time, during the execution of the control loop. The proposed approach separates the control and the optimization tasks, and uses simple operating system primitives to share data. The system is able to react to modifications of the trajectory, thus endowing the robot with intelligent learning and self-configuration capabilities. A popular commercial robotic tool, i.e. the Lego Mindstorms robot, has been used for testing and implementing this system. Tests have been performed both in simulations and in a real Lego robot. Experimental results show that, compared to other online optimization techniques and to empiric PID tuning procedures, 3SOME guarantees a robust and efficient control behaviour, thus representing a valid alternative for self-tuning control systems.

O B I O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 intelligence optimization
real-time optimization
mobile robotics
path-following


protocol-aware, enhanced cognition robot agent design for team work effort in lunar exploration missions This work presents the design and prototyping of a protocol-aware and cognitively enhanced Robot agent. A set of protocols have been defined which support autonomous robot team mission activity. These include a Team Work Effort protocol and ancillary protocols which support situation awareness and assist the robot team in flexibly executing the mission. The Robot agents are engaged in a simulated Lunar-based Scientific Sampling Mission. We utilize the Distributed Control Framework (DCF) robotics software as the platform in which to develop the protocol-aware and cognitively enhanced Robot agent; the DCF platform offers a basic Robot agent construct. Selecting a particular robotics software framework is necessary in order to develop the design and perform prototyping. However, the conceptual approach and protocols may be utilized in other robotics software frameworks, provided they offer the notion of a communicative robot agent. Mission simulations utilizing the protocols and enhanced Robot agents were performed in both software and hardware. The hardware prototyping utilized the Amigo-bot platform.

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


Lossless acceleration of fractal image encoding via the fast Fourier transform In fractal image compression the encoding step is computationally expensive. We present a new technique for reducing the encoding complexity. It is lossless, i.e., it does not sacrifice any image reconstruction quality for the sake of speedup. It is based on a codebook coherence characteristic of fractal image compression and leads to a novel application of the fast Fourier transform-based cross correlation. The proposed method is particularly well suited for use with highly irregular image partitions for which most traditional (lossy) acceleration schemes lose a large part of their efficiency. For large ranges our approach outperforms other currently known lossless acceleration methods.

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

complexity reduction
fft
cross-correlation


On Chebyshev-type integral quasi-interpolation operators Spline quasi-interpolants on the real line arc approximating splines to given functions with optimal approximation orders. They are called integral quasi-interpolants if the coefficients in the spline series are linear combinations of weighted mean values of the function to be approximated. This paper is devoted to the construction of new integral quasi-interpolants with compactly supported piecewise polynomial weights. The basic idea consists of minimizing an expression appearing in an estimate for the quasi-interpolation error. It depends on how well the quasi-interpolation operator approximates the first non-reproduced monomial. Explicit solutions as well as some numerical tests in the B-spline case are given. (C) 2009 IMACS. Published by Elsevier B.V. All rights reserved.

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


Rewriting rules to permeate complex similarity and fuzzy queries within a relational database system In recent years, the availability of complex data repositories ( e. g., multimedia, genomic, semistructured databases) has paved the way to new potentials as to data querying. In this scenario, similarity and fuzzy techniques have proven to be successful principles for effective data retrieval. However, most proposals are domain specific and lack of a general and integrated approach to deal with generalized complex queries, i.e., queries where multiple conditions are expressed, possibly on complex as well as on traditional data. To overcome such limitations, much work has been devoted to the development of middleware systems to support query processing on multiple repositories. On a similar line, in this paper we present a formal framework to permeate complex similarity and fuzzy queries within a relational database system. As an example, we focus on multimedia data, which is represented in an integrated view with common database data. We have designed an application layer that relies on an algebraic query language, extended with MM-tailored operators, and that maps complex similarity and fuzzy queries to standard SQL statements that can be processed by a relational database system, exploiting standard facilities of modern extensible RDBMS. To show the applicability of our proposal, we implemented a prototype that provides the user with rich query capabilities, ranging from traditional database queries to complex queries gathering a mixture of Boolean, similarity, and fuzzy predicates on the data.

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

database design
modeling
management
multimedia databases
relational databases


A low power low area capacitor array based Digital to Analog Converter architecture This paper presents a capacitor based Digital to Analog Converter architecture, which gives comparable performance with the conventional architecture with approximately half the total capacitance. The proposed architecture reduces the area and power dissipation in comparison with the conventional scheme. Further to these advantages, the proposed DAC architecture does not demand an additional reference voltage or an additional switching circuit. Closed form formulas to estimate the standard deviation of INL, DNL and the power consumption are derived. A comparison is also made between the standard architectures and the proposed architecture for the same unit capacitor, in addition to analyzing the capacitor parasitics and mismatches. These analytical comparisons are validated by simulating the proposed architecture and all the other conventional architectures for 10bits with UMC 180nm CMOS technology.

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

digital to analog converter
dnl
inl
parasitics

analog to digital converters
capacitor mismatches
switching schemes
settling time
high-speed data converters


An assumed strain method for the dispersive globallocal modeling of periodic structures A computational method to ascertain the dispersive elastodynamic behavior of periodic materials is presented. The method is based on a two-field HuWashitzu variational formulation in which independent displacement and strain fields are employed. The method of multiple scales is used to recover a globallocal methodology, and an asymptotic analysis provides the characterization of the microstructure. The effectiveness of the methodology is assessed by computing the phase and group velocity spectra for time harmonic plane waves propagating in a laminated medium and a fiber-reinforced composite. Predicted results are compared with exact elasticity results, available experimental data, and other available predictions.

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

elastodynamics
wave propagation
composite materials


Components of dynamic digital maps1 The core of a dynamic digital map (DDM) is a program created to display a digital geologic map and its associated data set as a single integrated package. This DDM program core is authored using a high-level object oriented graphical programming environment, SuperCard, a Macintosh `xTalk' language. Some of the major philosophical underpinnings relevant to the job of creating DDMs in this programming environment include taking advantage of specific object's attributes, how to organize data structure effectively for this job and keeping applicable code as transportable (generalized) as possible between objects. The core components of DDMs are parts of a SuperCard `template' or map display `container' into which the various externally created digital pieces (e.g. CAD produced geologic maps, spread sheet data, digital images, text files, movies) can be inserted for integrated display and digital publication. Components of DDMs consist of windows, cards within these windows, card fields (text and data containers) and a menu structure. The paper discusses each of these major components and how they fit into a DDM and gives examples of each topic in programs whose components demonstrate the concept. These programs are available from Web (see Appendix A); readers can refer to them as they examine these examples.

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

digital geologic maps
desktop publishing


Integrated optimization of safety stock and transportation capacity We study the impact of safety stock on transportation requirements. In an (r, s, q) system backorders increase the variance of the transportation demand. We calculate the probabilities of the transportation demand. We propose integrated inventory and transportation optimization. Results are relevant for multi-level safety stock optimization.

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

vehicle fleet size
excess transportation capacity


towards compromise-resilient localized authentication architecture for wireless mesh networks In this paper, a novel compromise-resilient localized authentication scheme is proposed for metropolitan-area wireless mesh networks (WMNs), which aims to mitigate the impact caused by a compromise event on one or multiple mesh access points (MAPs) before they are identified and removed from the network. As a proactive mechanism based on a "best practice" strategy - Defence in Depth, the proposed scheme can protect critical WMN functionalities, such as user authentication and handoff support, even in presence of compromised MAPs.

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

security
wireless mesh network
bilinear pairing
threshold authentication


The coexistence of engineering meanings of function: Four responses and their methodological implications In this position paper, the ambiguity of functional descriptions in engineering is considered from a methodological point of view. Four responses to this ambiguity are discussed, ranging from defining a single meaning of function and rejecting the different meanings that are currently used in engineering to accepting these meanings as coexisting in engineering and taking function as a family resemblance concept. Rejecting the different meanings is described as the straightforward response to resolving the ambiguity of functional descriptions, yet in engineering research and design methodology it rather seems to be accepted that engineers do use the coexisting meanings side by side. In this paper, explanations are given of why this practice is beneficial to engineering. Then it is explored how the particular meaning that engineers attach to function depends on the tasks for which functional descriptions are used. Finally, the methodological implications of the four responses to the ambiguity of functional descriptions are discussed.

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

conceptual analysis
engineering design methods
functions


on name resolution in peer-to-peer networks An efficient name resolution scheme is the cornerstone of any peer-to-peer network. The name resolution scheme proposed by Plaxton, Rajaraman, and Richa, which we hereafter refer to as the PRR scheme, is a scalable name resolution scheme that also provides provable locality properties. However, since PRR goes to extra lengths to provide these locality properties, it is somewhat complicated. In this paper, we propose a scalable, locality-aware, and fault-tolerant name resolution scheme which can be considered a simplified version of PRR. Although this new scheme does not provide as strong locality guarantees as PRR, it exploits locality heuristically yet effectively.

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

network
version
name resolution
paper
locality
scheme

efficiency
fault tolerance
scalability
exploit
peer-to-peer
peer-to-peer networks


Object segmentation and labeling by learning from examples We propose a system that employs low-level image segmentation followed by color and two-dimensional (2-D) shape matching to automatically group those low-level segments into objects based on their similarity to a set of example object templates presented by the user. A hierarchical content tree data structure is used for each database image to store matching combinations of low-level regions as objects. The system automatically initializes the content tree with only "elementary nodes" representing homogeneous low-level regions. The "learning" phase refers to labeling of combinations of low-level regions that have resulted in successful color and/or 2-D shape matches with the example template(s). These combinations are labeled as "object nodes" in the hierarchical content tree. Once learning is performed, the speed of second-time retrieval of learned objects in the database increases significantly. The learning step can be performed off-line provided that example objects are given in the form of user interest profiles. Experimental results are presented to demonstrate the effectiveness of the proposed system with hierarchical content tree representation and learning by color and 2-D shape matching on collections of car and face images.

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

color matching
object annotation
semantic object segmentation


A genetic aggregate stereo algorithm for 3-D classification of occluded shapes In computer vision, various stereo algorithms have been developed to determine the shape depth from a pair of images for that shape. To find the depth traditionally, one has to solve the point-to-point correspondence problem. By nature, this problem is complicated and time consuming. In this paper, a genetic algorithm has been exploited to obtain a depth estimation for the underlying shape without using any point-to-point correspondence. Instead, correspondence of the outer contours as a whole is required. Consequently, the three-dimensional (3-D) moments as well as a chain code, could be computed and relied upon as shape invariant features. Such features are used as input to a next stage that consists of a neural network classifier. Combining the robustness of neural network classifiers with the robustness of genetic algorithms has led to a fairly robust pattern recognition system that can tolerate high degrees of noise and occlusion levels. Eventually, a dynamic alignment procedure is attached to the classifier outputs to make the proposed shape representation independent of the starting point.

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

genetic algorithm
aggregate stereo
depth estimation
neural network classifier
dynamic alignment

genetic aggregate stereo
stereo disparity
partial occlusion
counter-propagation
3-d moments


Embodied Conversational Agent-Based Kiosk for Automated Interviewing We have created an automated kiosk that uses embodied intelligent agents to interview individuals and detect changes in arousal, behavior, and cognitive effort by using psychophysiological information systems. In this paper, we describe the system and propose a unique class of intelligent agents, which are described as Special Purpose Embodied Conversational Intelligence with Environmental Sensors (SPECIES). SPECIES agents use heterogeneous sensors to detect human physiology and behavior during interactions, and they affect their environment by influencing human behavior using various embodied states (i.e., gender and demeanor), messages, and recommendations. Based on the SPECIES paradigm, we present three studies that evaluate different portions of the model, and these studies are used as foundational research for the development of the automated kiosk. The first study evaluates human computer interaction and how SPECIES agents can change perceptions of information systems by varying appearance and demeanor. Instantiations that had the agents embodied as males were perceived as more powerful, while female embodied agents were perceived as more likable. Similarly, smiling agents were perceived as more likable than neutral demeanor agents. The second study demonstrated that a single sensor measuring vocal pitch provides SPECIES with environmental awareness of human stress and deception. The final study ties the first two studies together and demonstrates an avatar-based kiosk that asks questions and measures the responses using vocalic measurements.

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

avatars
deception detection
embodied conversational agents
neurois


GGobi: evolving from XGobi into an extensible framework for interactive data visualization GGobi is a direct descendent of a data visualization system called XGobi that has been around since the early 1990s. GGobi's new features include multiple plotting windows, a color lookup table manager, and an Extensible Markup Language file format for data. Perhaps the biggest advance is that GGobi can be easily extended, either by being embedded in other software or by the addition of plugins; either way, it can be controlled using an Application Programming Interface. An illustration of its extensibility is that it can be embedded in R. The result is a full marriage between GGobi's direct manipulation graphical environment and R's familiar extensible environment for statistical data analysis.

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

statistical graphics
interoperability
xml
api


Robustness of the estimators of transition rates for size-classified matrix models Matrix models are often used to model the dynamics of age-structured or size-structured populations. The Usher model is an important particular case that relies on the following hypothesis: between time steps t t and t+1 t + 1 , individuals either remain in the same class, move up to the following class, or die. There are then two ways of handling data that do not meet this condition: either remove them prior to data analysis or rectify them. These two ways correspond to two estimators of transition parameters. The former, which corresponds to the classical estimator, is obtained from the latter by a data trimming. The two estimators of transition parameters are compared on the basis of their robustness in order to obtain a criterion of choice between the two estimators. The influence curve of both estimators is first computed, then their gross sensitivity and their asymptotic variance. The untrimmed estimator is more robust than the classical one. Its asymptotic variance can be lower or greater than that of the classical estimator depending on the boundaries used for data trimming. The results are applied to a tropical rain forest in French Guiana, with a discussion on the role of the class width.

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


A theoretical investigation of the characteristics of hydrogen/halogen bonding interactions in dibromo-nitroaniline In this work, computations of density functional theory (DFT) were carried out to investigate the nature of interactions in solid 2,6-dibromo-4-nitroaniline (DBNA). This system was selected to mimic the hydrogen/halogen bonding found within crystal structures as well as within biological molecules. DFT (M06-2X/6-311++G**) calculations indicated that the binding energies for different of interactions lie in the range between -1.66 and -9.77 kcal mol(-1). The quantum theory of atoms in molecules (QTAIM) was applied to provide more insight into the nature of these interactions. Symmetry-adapted perturbation theory (SAPT) analysis indicated that stability of the Br center dot center dot center dot Br halogen bonds is predicted to be attributable mainly to dispersion, while electrostatic forces, which have been widely believed to be responsible for these types of interactions, play a smaller role. Our results indicate that, for those nuclei participating in hydrogen/halogen bonding interactions, nuclear quadrupole resonance parameters exhibit considerable changes on going from the isolated molecule model to crystalline DBNA.

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

halogen bond
sigma-hole
hydrogen bond
m06-2x
nqr


limitations on design principles for public key protocols Recent papers have taken a new look at cryptographic protocols from the perspective of proposing design principles. For years the main approach to cryptographic protocols has been logical, and a number of papers have examined the limitations of those logics. This paper takes a similar cautionary look at the design principal approach. Limitations and exceptions are offered on some of the previously given basic design principals. The focus is primarily on public key protocols, especially on the order of signature and encryption. But, other principles are discussed as well. Apparently secure protocols that fail to meet principles are presented. Also presented are new attacks on protocols as well as previously claimed attacks which are not.

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

order signature paper public encryption design

exception
logic
cryptographic protocol
attack
secure protocol
design principle


Free-form contour packing based on material grid approximation and lowest-gravity-center methods The packing algorithm does not need to calculate NFP. The discretized packing points are used as a priority order. The packing contours are collided along four directions. The packing time is reduced and the material utilization rate is improved.

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

free-form boundaries
lowest-gravity-center principle


Characteristic vibration patterns of odor compounds from bread-baking volatiles upon protein binding: density functional and ONIOM study and principal component analysis As the mechanism underlying the sense of smell is unclear, different models have been used to rationalize structure-odor relationships. To gain insight into odorant molecules from bread baking, binding energies and vibration spectra in the gas phase and in the protein environment [7-transmembrane helices (7TMHs) of rhodopsin] were calculated using density functional theory [B3LYP/6-311++G(d,p)] and ONIOM [B3LYP/6-311++G(d,p):PM3] methods. It was found that acetaldehyde ("acid" category) binds strongly in the large cavity inside the receptor, whereas 2-ethyl-3-methylpyrazine ("roasted") binds weakly. Lys296, Tyr268, Thr118 and Ala117 were identified as key residues in the binding site. More emphasis was placed on how vibrational frequencies are shifted and intensities modified in the receptor protein environment. Principal component analysis (PCA) suggested that the frequency shifts of C-C stretching, CH3 umbrella, C = O stretching and CH3 stretching modes have a significant effect on odor quality. In fact, the frequency shifts of the C-C stretching and C = O stretching modes, as well as CH3 umbrella and CH3 symmetric stretching modes, exhibit different behaviors in the PCA loadings plot. A large frequency shift in the CH3 symmetric stretching mode is associated with the sweet-roasted odor category and separates this from the acid odor category. A large frequency shift of the C-C stretching mode describes the roasted and oily-popcorn odor categories, and separates these from the buttery and acid odor categories.

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

odorant category
quantum chemical calculation
molecular vibration
binding energy


selecting appropriate agent responses based on non-content features This paper describes work-in-progress on a study to create models of responses of virtual agents that are selected only based on non-content features, such as prosody and facial expressions. From a corpus of human-human interactions, in which one person was playing the part of an agent and the second person a user, we extracted the turns of the user and gave these to annotators. The annotators had to select utterances from a list of phrases in the repertoire of our agent that would be a good response to the user utterance. The corpus is used to train response selection models based on automatically extracted features and on human annotations of the user-turns.

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


Learning extended tree augmented naive structures ? New Bayesian network structure learning approach to extend the Tree Augmented Naive (TAN) classifier. Efficient implementation of TAN and Extended-TAN using the Edmonds algorithm for directed weighted spanning trees. Alternative approach to well-known classifiers such as TAN and AODE. Missing data can be treated without the need of data imputation. Easy-to-install Weka plugin.

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

bayesian networks
classification
tree augmented naive bayes
edmonds' algorithm


Constant-sign periodic and almost periodic solutions of a system of difference equations We consider the following system of difference equations, u(i) (k) = Sigma(e is an element of Z) gi (k, l) f (l u(1) (l), u(2) (l),...,u(2) (l)), k is an element of I, 1 <= i <= n, where I is a subset of Z. Our aim is to establish criteria such that the above system has a constant-sign periodic and almost periodic solution (u(1), u(2),...,u(n).). The above problem is also extended to that on u(1) (k) = Sigma(e is an element of Z) g(i) (k, l) fi (l, u(1) (l), u(2) (l),..., u(n), k is an element of Z, 1 <= i <= n. (c) 2005 Elsevier Ltd. All rights reserved.

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

system of difference equations
periodic solutions

constant-sign solutions
almost periodic solutions


Heartbeat of a Nest: Using Imagers as Biological Sensors We present a scalable end-to-end system for vision-based monitoring of natural environments, and illustrate its use for the analysis of avian nesting cycles. Our system enables automated analysis of thousands of images, where manual processing would be infeasible. We automate the analysis of raw imaging data using statistics that are tailored to the task of interest. These "features" are a representation to be fed to classifiers that exploit spatial and temporal consistencies. Our testbed can detect the presence or absence of a bird with an accuracy of 82%, count eggs with an accuracy of 84%, and detect the inception of the nesting stage within a day. Our results demonstrate the challenges and potential benefits of using imagers as biological sensors. An exploration of system performance under varying image resolution and frame rate suggest that an in situ adaptive vision system is technically feasible.

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

algorithms
design
experimentation
human factors
reliability
image network
computer vision
system deployment
sensor network


(alpha, beta)-fuzzy ideals of hemirings We give a characterization of different types of (alpha, beta)-fuzzy ideals of hemirings, where alpha, beta is an element of {is an element of, q, is an element of boolean OR q, is an element of boolean AND q} and alpha not equal is an element of boolean AND q. Special attention is paid to (is an element of, is an element of boolean OR q)-fuzzy prime and semiprime ideals. (c) 2009 Published by Elsevier Ltd

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

fuzzy set
hemiring
k-ideal
fuzzyideal
fuzzy prime ideal
(alpha, beta)-fuzzy ideal


The Modified Local CrankNicolson method for one- and two-dimensional Burgers equations ? The Modified Local CrankNicolson method is applied to solve one- and two-dimensional Burgers equations. New difference schemes that are explicit, unconditionally stable, and easy to compute are obtained. Numerical solutions obtained by the present method are compared with exact solutions, and it is seen that they are in excellent agreement.

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

burgers equation
linearization approach
explicit scheme
stability analysis


Approximation quality for sorting rules ? A method is presented for the approximation quality for sorting rules, which is based on Rough Set Data Analysis. Several types of rules are discussed: The nominal ? nominal case (NN) (the classical Rough Set approach), nominal ? ordinal (NO) rules, and ordinal?ordinal (OO) rules, and its generalisation to (nominal, ordinal) ? ordinal rules (NO-O). We provide a significance test for the overall approximation quality, and a test for partial influence of attributes based on the bootstrap technology. For the bivariate case, the relationship of -statistics and the proposed approximation quality measure is discussed. It can be shown that in this case a simple linear transformation of the Kendall tau correlation forms an upper bound for the approximation quality of sorting rules. A competing model is also studied. Whereas this method is a promising tool in case of searching for global consistency, we demonstrate that in case of local perturbations in the data set the method may offer questionable results, and that it is dissociated from the theory it claims to support. In the final Section, an example illustrates the introduced concepts and procedures.

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

decision support systems
ordinal prediction


Global optimization based on a statistical model and simplicial partitioning A statistical model for global optimization is constructed generalizing some properties of the Wiener process to the multidimensional case. An approach to the construction of global optimization algorithms is developed using the proposed statistical model. The convergence of an algorithm based on the constructed statistical model and simplicial partitioning is proved. Several versions of the algorithm are implemented and investigated. (C) 2002 Elsevier Science Ltd. All rights reserved.

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

global optimization
partitioning
convergence


expected current distributions for cmos circuits The analysis of CMOS VLSI circuit switching current has become an increasingly important and difficult task from both a VLSI design and simulation software perspective. This paper presents a new static switching current estimation algorithm based on the idea of "Expected Current Distributions" (ECDs). Unlike previous "expected waveform" approaches, ECDs model not only the expected value of switching current waveforms over all time, but also the variances and covariances of all waveform segments as well. This extra information allows a switching current wave form to be modeled by a random process with both first and second order ensemble statistics. This specification provides the power spectral density of the switching current and allows the use of traditional frequency domain noise analysis to simulate the behavior of the switching current in the electrical supply network. An ECD simulation procedure is described and results are presented for the ISCAS85 combinational benchmark circuits. Estimated quantities include total average and RMS VDD current, the autocorrelation function of the total VDD current waveform and per-gate average and RMS VDD currents. The results show speedups of up to 100x and good agreement with respect to figures obtained using dynamic logic simulation and statistical mean estimation.

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

power spectral density
mean estimation
expected waveform
cmos
autocorrelation
switching current

static analysis
random processes
statistical analysis


Determination of alpha-resolution in lattice-valued first-order logic LF(X) Key issues for resolution-based automated reasoning in lattice-valued first-order logic LF(X) are investigated with truth-values in a lattice-valued logical algebraic structure lattice implication algebra (LIA). The determination of resolution at a certain truth-value level (called alpha-resolution) in LF(X) is proved to be equivalently transformed into the determination of alpha-resolution in lattice-valued propositional logic LP(X) based on LIA. The determination of alpha-resolution of any quasi-regular generalized literals and constants under various cases in LP(X) is further analyzed, specified, and subsequently verified. Hence the determination of alpha-resolution in LF(X) can be accordingly solved to a very broad extent. which not only lays a foundation for the practical implementation of automated reasoning algorithms in LF(X). but also provides a key support for alpha-resolution-based automated reasoning approaches and algorithms in LIA based linguistic truth-valued logics. Crown Copyright (C) 2010 Published by Elsevier Inc. All rights reserved.

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

automated reasoning
lattice implication algebra

incomparability
many-valued logic
lattice-valued logic
alpha-resolution


Mathematical model for dispersion and diffusion of chemically reactive pollutants from various sources into a boundary layer with dry deposition Purpose - The purpose of this paper is to propose a mathematical model for dispersion and diffusion of chemically reactive primary pollutants emitted from an elevated line sources into a stable atmospheric boundary layer with generalized wind velocity of quadratic function of vertical heights. Design/methodology/approach - The governing partial differential equations are converted into the two-dimensional time dependent partial differential equation by suitable choice of meteorological parameters and non-dimensional variables, which is solved by the multiple inverse Laplace transform through Green's Function technique. Findings - The three different types' sources, viz, continuous, an instantaneous and step-function type sources are studied. The pollutants considered are chemically reactive primary pollutants emitted from the above sources. In many previous works, solutions are obtained through numerical technique or numerical inversion of the Laplace transform; but here, an analytical method is carried out to find the exact solution through multiple inversion of Laplace transform, which yields an effective and accurate solution. Originality/value - The paper describes how the authors obtained exact solutions for the elevated line sources into a stable atmospheric boundary layer arising in the chemically reactive primary pollutants model by inverse Laplace transform through Green's Function technique. The graphical results show that this method is very accurate. The gaseous pollutants converted into particulate matter and settled on surface terrain are also considered in this theoretical model.

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

atmosphere
winds
mathematical modelling
settling velocity
stable boundary layer
instantaneous line source
continuous line source
step-function type source
chemically reactive pollutants
quadratic diffusion coefficient
generalized parabolic wind profile


social practices and mobile phone use of young migrant workers To explore opportunities for technology adoption in emerging markets, we conducted ethnographic studies to understand the social practices and technology use of young migrant workers in China. In total twenty-six young migrant workers, aged 19-28, were interviewed and/or shadowed in three cities (Beijing, Hangzhou, and Xi'an). We found that social practices play a significant role in the life of the research participants, who live in stressful and "unfriendly" urban environments and have a lower social status than urban residents. Moreover, we found that these social practices act as a primary driver for mobile phones adoption and use. Personal mobile phones were quickly adopted and frequently used to initiate, maintain and enhance social connections, as well as the quality of social practices. Based on the research findings, we discuss several design directions for making mobile phones play a greater role in social practices.

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

mobile phone
young migrant workers
emerging markets
social practices


Improving the Lavallee and Hidiroglou algorithm for stratification of skewed populations Initial boundaries for the Lavallee and Hidiroglou algorithm for stratifying skewed populations are proposed, which improve the rate of convergence to the optimal solution and often result in smaller sample sizes.

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


Characterization of Luminal and Peritubular Membrane K+ Selectivity in Proximal Tubular Cells of Frog Kidney Abstract: The functional significance of/KCNQ1/KCNE1 K+ secretory fluxes and the effects of 3 ?mol/L Cd2+ on the peritubular cell membrane potential and its potassium selectivity were investigated in proximal tubular cells of the frog kidney. Perfusing the lumen with l-phenylalanine plus/minus chromanol 293B, a specific blocker of KCNQ1, did not modify rapid depolarization and rate of slow repolarization of the peritubular cell membrane. Peritubular exposure to Cd2+ led to a sustained, reversible hyperpolarization of the peritubular membrane, paralleled by an increase in fractional K+ conductance. Peritubular barium blunted hyperpolarization of the peritubular cell membrane to Cd2+. Thus, the KCNQ1/KCNE1 K+ secretory fluxes are absent in proximal tubule of frog kidney, while Cd2+ increases K+ selectivity of the peritubular cell membrane.

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

cell membrane potential
chromanol 293b
frog kidney


A p-center grid-positioning aggregation procedure We present an algorithm for aggregating p-center demand points such that the resulting aggregate set imposes a grid structure on the plane consisting of identical "diamonds" of user-specified dimensions. The grid is positioned so that a well-defined upper bound on the objective function error is smallest.

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


Permanent magnet disk generator with coreless windings Purpose - This article seeks to present the simple and easy to manufacture design of a permanent magnet generator based on coreless windings. An example is shown of basic calculations based on an equivalent magnetic circuit. Finally, a description of a 20 kW prototype of PMSG is presented based on rectangular magnets which contains mechanical design and experimental results. Design/methodology/approach - The analysis presents flux dependence using several parameters such as: magnet's grade and size in comparison with coil and air-gap dimensions. The second part of the article concentrates on simulation results of Finite Element Method analysis (FEM) that clearly shows the flux distribution for different magnet shapes - trapezoidal and rectangular. Findings The presented topology of the machine has several advantages, e.g. there is no starting and cogging torque which is very important especially for wind power systems because of the start up point of the turbine. Moreover, it is cheap and easy to manufacture because of ironless technology in stator. The generator can be produced in the range of single watts up to hundreds of kilo watts of power in multi disk operation. Research limitations/implications - The ironless technology applied to the stator, results in the need for using stronger magnets in comparison with a classic iron-core permanent magnet machine. Practical implications - This axial-flux machine seems to be very interesting for low speed power generation systems such as wind and water turbines. Cost effective permanent magnet generator can be used for local power generation (e.g. heating). The generator can also be connected to the main grid through a special grid-tie-inverter. Originality/value - The article presents the simple and rarely presented topology and describes a few methods of optimisation of the parameters to achieve maximum power.

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

permanent magnet
disk generator
coreless
ironless
pmsg
windings


a role-based xacml administration and delegation profile and its enforcement architecture The OASIS technical committee published the XACML v3.0 administration and delegation profile (XACML-Admin) working draft on 16 April 2009 [3] in order to provide policy administration and dynamic delegation services to the XACML runtime. We enhance this profile by adding role-based delegation by amalgamating the proposed profile with the XACML-ARBAC profile proposed in [19]. By doing so, we improve the scalability of the delegation mechanism. Second, we show how XACML-ARBAC enforcement mechanism proposed in [19] can be enhanced to enforce the proposed role-based administration and delegation XACML profile (XACML-ADRBAC), therefore providing a method to enforce the XACML-Admin profile proposed in [3].

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

arbac
authorization
access control
rbac
web service security


Multi-component high-K gate dielectrics for the silicon industry The exponential growth of the silicon industry can be attributed to that fact that silicon has a native oxide that is silicon dioxide. With SiO2 soon approaching its fundamental limit, we must find an alternate to SiO2 or a new switch to replace MOSFETs. In this paper we focus on the leading alternate gate dielectrics. We first discuss the selection criteria for alternate gate dielectrics and why it is important to have an amorphous gate dielectric. SiO2 and aluminum oxide remain amorphous at very high temperatures. For dielectrics with K>15 and gate power <100 mW/cm2, it may be necessary to stabilize the amorphous phase of metal oxides by adding Al or Si to the oxide, thus forming multi-component dielectrics such as aluminates. We then benchmark aluminates with aluminum oxide and silicon dioxide.

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

scaling
high-k dielectrics
aluminum oxide and aluminates


Analytic models for the latency and steady-state throughput of TCP Tahoe, Reno, and SACK Continuing the process of improvements made to TCP through the addition of new algorithms in Tahoe and Reno, TCP SACK aims to provide robustness to TCP in the presence of multiple losses from the same window. In this paper we present analytic models to estimate the latency and steady-state throughput of TCP Tahoe, Reno, and SACK and validate our models using both simulations and TCP traces collected from the Internet. In addition to being the first models for the latency of finite Tahoe and SACK flows, our model for the latency of TCP Reno gives a more accurate estimation of the transfer times than existing models. The improved accuracy is partly due to a more accurate modeling of the timeouts, evolution of cwnd during slow start and the delayed ACK timer. Our models also show that, under the losses introduced by the droptail queues which dominate most routers in the Internet, current implementations of SACK can fail to provide adequate protection against timeouts; and a loss of roughly more than half the packets in a round will lead to timeouts. We also show that with independent losses SACK performs better than Tahoe and Reno and, as losses become correlated, Tahoe can outperform both Reno and SACK.

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

performance evaluation
retransmission timeouts


A Trust Region Method for the Solution of the Surrogate Dual in Integer Programming We propose an algorithm for solving the surrogate dual of a mixed integer program. The algorithm uses a trust region method based on a piecewise affine model of the dual surrogate value function. A new and much more flexible way of updating bounds on the surrogate duals value is proposed, in which numerical experiments prove to be advantageous. A proof of convergence is given and numerical tests show that the method performance is better than a state of the art subgradient solver. Incorporation of the surrogate dual value as a cut added to the integer program is shown to greatly reduce solution times of a standard commercial solver on a specific class of problems.

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

trust regions methods
nonsmooth optimization
primary 90c11
90c25
secondary 90c08


Using traits of web macro scripts to predict reuse To help people find a code that they might want to reuse, repositories of end-user code typically sort scripts by number of downloads, ratings, or other information based on prior uses of the code. However, this information is unavailable when the code is new or when it has not yet been reused. Addressing this problem requires identifying reusable code based solely on information that exists when a script is created. To provide such a model for web macro scripts, we identified script traits that might plausibly predict reuse, then used IBM CoScripter repository logs to statistically test how well each corresponded to actual reuse. These tests confirmed that the traits generally did correspond to higher levels of reuse as anticipated. We then developed a machine learning model that uses these traits as features to predict reuse of macros. Evaluating this model on repository logs showed that its accuracy is comparable to that of existing machine learning models for predicting reuse-but with a much simpler structure. Sensitivity analysis revealed that our model is quite robust; its quality is greatly reduced only when parameters are set to such extreme values that the model becomes inordinately selective. Testing the model with individual traits revealed those that provided the best predictions on their own. Based on these results, we outline opportunities for using our model to improve repositories of end-user code. (C) 2010 Elsevier Ltd. All rights reserved.

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

end-user programming
end-user software engineering
web macros


OR in developing countries: A review The relevance of Operational Research (OR) in developing countries has increasingly engaged the attention of operational researchers in both the industrialised and less developed countries over the last 50years. With this, there has been a considerable amount of interest in the potential for using OR in developing countries. One sign of this is the emergence of a number of initiatives to promote OR in developing countries and the number of new societies for OR that have emerged from the developing world. This paper is an attempt at providing an overall picture of the state of OR in the developing countries. In particular, it will look at the coverage in terms of countries and methods. It will also highlight the contribution OR is making towards the theme of poverty, the reduction of which is regarded as the key focus of development policy interventions as reflected in the Millennium Development Goals (MDGs).

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

operational research
or in developing countries
millennium development goals


Crease detection from fingerprint images and its applications in elderly people ? Conventional algorithms for fingerprint recognition are mainly based on minutiae information. But it is difficult to extract minutiae accurately and robustly for elderly people, and one of the main reasons is that there are many creases on the fingertips of elderly people. In this paper, we study on the detection of creases from fingerprint images, in which we treat the creases as a special kind of texture and design an optimal filter to extract them. We also study the applications of crease detection results to improve the performance of fingerprint recognition in elderly people, which include two aspects. First, it is used to remove the falsely detected minutiae. Second, the creases can be treated as a novel feature for elderly people's fingerprints, which is combined with minutiae feature to improve the performance. Experimental results illustrate the effectiveness of proposed methods.

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

fingerprint recognition
crease detection


Three-dimensional anisotropic mesh adaptation for phase change problems A three-dimensional adaptive strategy for the finite element simulation of phase change problems is presented, discussed and validated. A semi-phase-field formulation is used for the solution of the Stefan problem. The adaptive method is based on the definition of edge length using a solution dependent metric and produces strongly anisotropic meshes. Numerical results illustrating the performance and accuracy of the proposed method are presented.

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

three-dimensional anisotropic mesh adaptation


Compensating for speaker or lexical variabilities in speech for emotion recognition An exhaustive analysis of various acoustic features to identify their dependencies on lexical, speaker and emotional aspects. A novel trajectory-based normalization scheme to compensate for speaker or lexical variabilities. Classification experiments that validate the proposed normalization approach on the IEMOCAP database.

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

factor analysis
feature normalization
speaker variability


a pattern to design crosscutting frameworks A pattern that can be used to design Aspect-Oriented Frameworks that require data from a base code is presented. The framework design is explicitly separated into two parts when this pattern is used: one dealing with the composition mechanisms and another dealing with the functional variabilities. Regarding the composition part, there are several com alternatives facilitating the coupling to an existing base code as well as increasing the reuse levels. The functional part can be designed using classical object oriented patterns. The reuse process of the framework is also facilitated because the application and domain engineer can deal with both composition and functional parts separately.

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

aspect-oriented frameworks
design of aspect-oriented frameworks
architecture


Topology optimization of geometrically nonlinear structures based on an additive hyperelasticity technique This paper presents a simple but effective additive hyperelasticity technique to circumvent numerical difficulties in solving the material density-based topology optimization of elastic structures undergoing large displacements. By adding a special hyperelastic material to the design domain, excessive distortion and numerical instability occurred in the low-density or intermediate-density elements are thus effectively alleviated during the optimization process. The properties of the additional hyperelastic material are established based on a new interpolation scheme, which allows the nonlinear mechanical behaviour of the remodelled structure to achieve an acceptable approximation to the original structure. In conjunction with the adjoint variable scheme for sensitivity analysis, the topology optimization problem is solved by a gradient-based mathematical programming algorithm. Numerical examples are given to demonstrate the effectiveness of the proposed method.

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

topology optimization
hyperelastic material
sensitivity analysis


Participatory land use modelling, pathways to an integrated approach A fully integrated participatory land use modelling approach is presented in which stakeholders both parametrise and evaluate the model. The approach presented is supported by a case study of an integrated analytical/discursive land use model for a well-known natural protected area. Calibration of land use models is considered as a process integrating analytical and discursive domains. Results from participatory workshops are shown to improve the model and to support results from statistical map comparison techniques. A pathway is defined in which analytical/discursive model development tasks are integrated.

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

calibration
land use modelling
stakeholders


Performance analysis for buffer-aided communication over block Rayleigh fading channels: queue length distribution, overflow probability, and epsilon-overflow rate In this paper, we consider information transmission over a block Rayleigh fading channel, where a finite size buffer is employed to match the source traffic with the channel service capability. Given the buffer size, the transmission capability of a block fading Rayleigh channel is characterized from two aspects: (i) the buffer behavior when the input traffic rate is constant; and (ii) the traffic rate that can be supported by the channel for a given overflow probability constraint. For the first problem, the stationary distribution of the queue length in the buffer is derived by discretizing the queue length using a uniform quantization strategy. It is also shown that the overflow probability of the finite size buffer decreases exponentially with buffer size. An explicit upper bound on the overflow probability is also given. For the second one, a new concept of epsilon-overflow rate is proposed to measure the transmission capability of a block fading channel under overflow probability constraints. It will be shown that the epsilon-overflow rate is larger than the epsilon-outage capacity under the same outage constraint and will meet the great gap between outage capacity and ergodic capacity as the overflow probability constraint varies. Copyright (C) 2012 John Wiley & Sons, Ltd.

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

stationary distribution, overflow probability


Uniform energy estimates for a semilinear evolution equation of the Mindlin-Timoshenko beam with memory In this paper, we investigate a mathematical model for viscoelastic beams, based on the Mindlin-Timoshenko assumptions. The resulting constitutive equations are derived in the framework of well-established theory of linear viscoelasticity, and according to the approximation procedure due to Lagnese for the Kirchhoff viscoelastic beams and plates. Assuming a nonlinear body force acting on the beam, we show that this model generates a strongly continuous semigroup which acts on the appropriate phase space. Uniform energy estimates are then given. The existence of an absorbing set for the solution of the problem is also studied. Furthermore, we remark the necessary conditions to extend this approach to the study of the longtime behavior of the Mindlin-Timoshenko plates. (C) 2004 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 B O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

mindlin-timoshenko beam
dissipative system


Hopf Bifurcation of a Modified Leslie-Gower Predator-Prey System In this paper, Hopf bifurcation is studied for a modified Leslie--Gower predator--prey system with harvesting. Our modified system is a biological economic cognitive system. An important feature of the biological economic cognitive system is that the harvest effort on the predator--prey system is investigated from an economic perspective. By using the local parameterization method and Hopf bifurcation theory, we obtain some new criteria for the Hopf bifurcation. Lastly, a numerical example is provided to demonstrate the effectiveness of our results.

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


A grid implementation of the SLUTH algorithm for visualising the depth and structural index of magnetic sources The SLUTH method requires first-order derivatives at two or more different heights above the ground and can estimate the location and depth of source bodies from magnetic data. Results of this method are independent of a specific model type and can be used to estimate the most appropriate model (structural index). This paper presents a grid implementation of the SLUTH method to visualise both depth and structural index from magnetic anomaly data. The implementation uses the Geosoft GX programming language. The method has been tested using theoretical magnetic gridded data and two methods have been used for estimating depth; the estimate from the width of the imaged feature gives an underestimate and the estimate from the rate of fall off of the field with height gives an overestimate. The practical utility of the algorithm is demonstrated using field data from the Saskatoon area of Canada.

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

automatic interpretation image basement structure


A new efficient indexing algorithm for one-dimensional real scaled patterns Given a pattern string P and a text string T. the one-dimensional real-scale pattern matching problem is to ask for all matched positions in T at which P occurs for some real scales >= 1. The real-scale indexing problem, which is derived from the real-scale matching problem, aims to preprocess T, so that all positions of scaled P in T can be answered efficiently. In this paper, we propose an improved algorithm for the real-scale indexing problem. For constant-sized alphabets, our preprocessing takes O(vertical bar T vertical bar(2)) time and space, achieving the answering time O(vertical bar P vertical bar + w), where U-r denotes the number of matched positions and w <= U-r. For the case of large-sized alphabets, our preprocessing can still be implemented with O(vertical bar T vertical bar(2)) time and space, while the answering time is slightly increased to O(vertical bar P vertical bar + w + log vertical bar T vertical bar). Compared to Wang's preprocessing algorithm with O(vertical bar T vertical bar(3)) time, our new indexing algorithm is a significant improvement. (C) 2011 Elsevier Inc. All rights reserved.

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


Shape-constrained flock animation We propose a novel shape-constrained flock animation system for interactively controlling flock navigation in virtual environments. This system is capable of making the spatial distribution of a flock meet static or deforming shape constraints While performing flock simulation. Such a capability can find many applications in the entertainment industry. Given a 3D constraining shape, our system first draws a set of uniform sample points through a 3D surface mosaicing process or a stratified point sampling strategy. Once correspondences between flock members and sample points have been established, points on the target shape are used as homing destinations to guide flock migration. Under a global path control scheme, an effective fuzzy control logic, Which dynamically adjusts steering forces and control forces, has been developed to create visually pleasing shape-constrained flock animations. Copyright (C) 2008 John Wiley & Sons, Ltd.

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

flock animation
fuzzy control
global path control


Secure identity-based signcryption in the standard model Signcryption is a cryptographic primitive that fulfills both the functions of digital signature and public key encryption simultaneously, at a cost significantly lower than that required by the traditional signature-then-encryption approach. Signcryption has been shown to be useful in many applications, such as electronic commerce, mobile communications and smart cards. In 2009, Yu et al. [12] proposed an identity-based signcryption (IBSC) scheme in the standard model. In 2010, Zhang [17] pointed out that Yu et al.'s scheme does not have the indistinguishability against adaptive chosen ciphertext attacks (IND-CCA2) and proposed an improved IBSC scheme. He proved that the improved scheme has the IND-CCA2 property and existential unforgeability against adaptive chosen messages attacks (EUF-CMA). However, in this paper, an attack is proposed to show that Zhang's scheme does not have the IND-CCA2 property (not even chosen plaintext attacks (IND-CPA)). We present a fully secure IBSC scheme in the standard model. We prove that our scheme has the IND-CCA2 property under the decisional bilinear Diffie-Hellman assumption and has the EUF-CMA property under the computational Diffie-Hellman assumption. (C) 2011 Elsevier Ltd. All rights reserved.

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

information security
identity-based cryptography


On the design of low-voltage, low-power CMOS analog multipliers for RF applications Novel low-voltage, low-power techniques in the design of portable wireless communication systems are required. Two system examples of low-power analog multipliers operating from a 1.2 V supply are presented. These proposed structures achieve the required multiplication function by using current processing. The circuits were fabricated using standard double-poly CMOS processes for a 900 MHz application. Measurement results of the prototypes are comparable to other higher voltage designs.

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

analog multiplier
cmos rf
low power
low voltage


Improving the quality of online presence through interactivity Online interactivity is becoming a valuable way of improving the communication quality of business web sites. As a result, it is important that web site designers understand the concept and how it affects the quality of web site design. This study empirically validated Ha and James five interactivity dimensions (playfulness, connectedness, reciprocal communication, information collection, and choice) and their relationship to design quality. The findings suggested that the playfulness, connectedness, and reciprocal communication dimensions are important predictors of web site quality. While information collection tools are powerful for web engineering and user tracking, the companies surveyed here had not fully used the promising potential of such tools. The choice dimension, although it offered flexibility and customizability to users, was not significant in predicting web site quality. The results underscored the viability of interactivity dimensions in the online environment.

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

interactivity
playfulness
reciprocal communication


Data mining on time series: an illustration using fast-food restaurant franchise data Given the widespread use of modern information technology, a large number of time series may be collected during normal business operations. We use a fast-food restaurant franchise as a case to illustrate how data mining can be applied to such time series, and help the franchise reap the benefits of such an effort. Time series data mining at both the store level and corporate level are discussed. BoxJenkins seasonal ARIMA models are employed to analyze and forecast the time series. Instead of a traditional manual approach of BoxJenkins modeling, an automatic time series modeling procedure is employed to analyze a large number of highly periodic time series. In addition, an automatic outlier detection and adjustment procedure is used for both model estimation and forecasting. The improvement in forecast performance due to outlier adjustment is demonstrated. Adjustment of forecasts based on stored historical estimates of like-events is also discussed. Outlier detection also leads to information that can be used not only for better inventory management and planning, but also to identify potential sales opportunities. To illustrate the feasibility and simplicity of the above automatic procedures for time series data mining, the SCA Statistical System is employed to perform the related analysis.

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

automatic time series modeling
automatic outlier detection
forecasting

outliers
expert system
knowledge discovery


Large deflections of laminated beams with interlayer slips - Part 1: model development Purpose - This paper aims to present development of a layer-wise (LW) beam model for geometric nonlinear finite element analysis of laminated beams with partial layer interaction. Design/methodology/approach - The model is built assuming first order shear deformation theory (FSDT) at layer level and moderate interlayer slips. LW kinematic, strain and stress fields are established in view of co-rotational finite element formulation. Laminated beam equilibrium relations are developed in strong, weak and matrix form. A notion of interface shear stress is used to define layer interactions. Findings - Through suitable choice of kinematic model the co-rotational approach is shown to provide means of obtaining robust finite element formulation for geometric nonlinear analysis of laminated structures with interlayer slips. Research limitations/implications - The proposed model is dedicated to geometric nonlinear finite element analysis of laminated beams undergoing large planar displacements, subject to small strains and moderate interlayer slips. Originality/value - Novelty of the proposed approach is based on encompassing shear deformations in geometric nonlinear analysis of laminated beams with interlayer slips. Arbitrary number of layers is 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 B I I O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

shear strength
kinematics
geometric planes and solids


Conjugate Problems of Transport Phenomena under Quasi-steady Microaccelerations in Realistic Spaceflight A new model for spatial convective transport processes conjugated with the measured or calculated realistic quasi-steady microaccelerations is presented. Rotation around the mass center, including accelerated rotation, gravity gradient, and aerodynamical drag are taken into account. New results of the effect on mixing and concentration inhomogeneities of the elementary convective processes are presented. The mixing problem in spacecraft enclosures, concentration inhomogeneities due to convection induced by body forces in realistic spaceflight, and the coupling of this kind of convection with thermocapillary convection on the basis of this model are discussed.

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

mathematical modeling
realistic microgravity environment
heat and mass transfer
stratification


Complexity measure and complexity rate information based detection of ventricular tachycardia and fibrillation On the basis of non-linear dynamics, the paper uses a Lempel-Ziv complexity measure and presents a new definition of the information complexity rate: cc(n). Using such a definition, relative properties are obtained to help identify chaotic process accurately. Applying complexity analysis to abnormal ECGs recorded from patients with an implantable cardioverter defibrillator, the reasonableness of this information complexity and complexity rate approach are confirmed by means of biological experiments and computer simulations. Finally, objective analysis and explanations of the mechanisms of VT and VF are reported The results indicate that, with the help of the complexity measure and complexity rate, recognition of ventricular tachycardia (VT) and ventricular fibrillation (VF) signals can be achieved with accuracy up to 100% (VT: 100%; VF:98.7%).

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

ventricular tachycardia
ventricular fibrillation
complexity measure
complexity rate


taking vanet to the clouds The past decade has witnessed a growing interest in vehicular networking and its myriad potential applications. The initial view of practitioners and researchers was that radio-equipped vehicles could keep the drivers informed about potential safety risks and increase their awareness of road conditions. The view then expanded to include access to the Internet and associated services. More recently, the availability of bandwidth has seen vehicular peer-to-peer networking and multimedia content delivery. This paper puts forth a novel vision, namely that advances in vehicular networks, embedded devices, and cloud computing can be used to form what we may call Vehicular Cloud Computing, VC2 for short. In VC2, the underutilized vehicles resources such as computing power, Internet connectivity and storage can be shared between drivers or rented over the Internet to various customers, very much like usual cloud resources are.

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

dsrc
ad hoc networks
data management
resource management
wireless communications
resource provisioning


A STUDY OF CITY TRAFFIC IN AFTERNOON RUSH HOURS The traffic of vehicles from downtown to suburban areas is investigated numerically. We propose a cellular automaton to simulate the traffic of vehicles within a city regulated by traffic lights. Both traffic flow and travel time are presented and we discuss some strategies to optimize these quantities.

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


Orientation-Guided Geodesic Weighting for PatchMatch-based Stereo Matching We propose an orientation-guided geodesic weighting (OGGW) strategy for local stereo matching. We propose a method of cost volume filtering combining a multipoint LPA method with our OGGW strategy. We propose a PatchMatch filter with curved surface fitting (PMF-CS) to obtain a disparity map with sub-pixel accuracy.

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

3d/stereo scene analysis
patchmatch-based filter
orientation-guided geodesic weighting


Sequence alignment from the perspective of stochastic optimization: a survey DNA and protein are the fundamental biological sequences. DNA is a fundamental molecule that plays a vital role in the processes of life. Proteins synthesized by DNA in a cell are the building blocks of every living organism. There is a variety of reasons behind the alignment of biological sequences. Biological sequence alignment helps to discover functional and structural similarity of sequences. Biologists work with these aligned sequences to construct phylogenetic trees, characterize protein families, and predict protein structure. Sequence alignment is an extremely promising field of research that is characterized by very high computational complexity. Stochastic optimization is needed for sequence alignment, as it generates efficient solutions to the problem. The objective of this study is to survey recent trends in stochastic optimization for sequence alignment as means of a guide for researchers who are interested in the sequence alignment problem.

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

sequence alignment
stochastic optimization

simulated annealing
genetic algorithms
particle swarm optimization
ant colony optimization


Adaptive meshing for finite element analysis of heterogeneous materials ? An adaptive meshing scheme for versatile heterogeneous materials. A mesh adaptation algorithm based on centroidal Voronoi tessellation. A specific density function aiming to equalize the material variation over mesh elements. An adaptive sampling technique for calculating material variations.

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

heterogeneous object modeling
adaptive mesh generation
computational efficiency


Sequential Specification of Time-Aware Stream Processing Applications Automatic parallelization of Nested Loop Programs (NLPs) is an attractive method to create embedded real-time stream processing applications for multi-core systems. However, the description and parallelization of applications with a time dependent functional behavior has not been considered in NLPs. In such a description, semantic information about time dependent behavior must be made available for the compiler, such that an optimized time independent implementation can be generated automatically. This article introduces language constructs with temporal semantics to NLPs. Using these language constructs, time dependent applications can be specified and a corresponding data-driven implementation can be generated for use on a multi-core system. Despite that these time-aware language constructs can be data-dependent, the application remains functionally deterministic. Pipelining is exploited to increase the throughput of an application. The media access control (MAC) protocol of an IEEE 802.11p WLAN transceiver is used to illustrate the relevance and applicability of the introduced concepts.

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

languages design multi-core real-time time-aware


On the event distance of Poisson processes with applications to sensors We derive a closed formula for the expected distance between Poisson events of two i.i.d. Poisson processes with arrival rate ? ? and respective arrival times X1,X2, X 1 , X 2 , and Y1,Y2, Y 1 , Y 2 , Namely, for any integers r?0,k?1 r ? 0 , k ? 1 , the following identity holds:

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

arrival time
gamma distribution
matchings
transportation cost


Pricing caps with HJM models: The benefits of humped volatility In this paper we compare different multifactor HJM models with humped volatility structures, to each other and to models with strictly decreasing volatility. All the models are estimated on Euribor and swap rates panel data maximizing the quasi-likelihood function obtained from the Kalman filter. We develop the analysis in two steps: first we study the in-sample properties of the estimated models, then we test the pricing performance on caps. We find the humped volatility specification to greatly improve the model estimation and to provide sufficiently accurate cap prices, although the models has been calibrated on interest rates data and not on cap prices. Moreover, we find the two-factor humped volatility model to outperform the three-factor models in pricing caps.

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

interest rates
humped volatility
kalman filter