A systems theoretical approach to online knowledge building This article describes the phenomenon of knowledge building in online environments. Knowledge building is a process within a community, which leads to the development of knowledge. In order to analyze this process, we will look into the ways in which individuals interact with the collective as a whole. For this purpose, the psychic and social systems, which are involved here are regarded as meaning-based systems in the sense of Luhmanns systems theoryopen to the environment, but operatively closed. The respective modes of operation of psychic and social systems will be examined, and structural coupling between these systems described. Another characteristic of knowledge-building communities is self-organization, which is described here in the sense of autopoiesis. A pivotal task, which knowledge-building communities have to tackle, is to handle complexity and reach common understanding. These aspects will also be described using conceptualizations of Luhmanns systems theory, illustrated by many examples.

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

communication
computer-mediated communication
self-organization


A technical method using musculoskeletal model to analyse dynamic properties of muscles during human movement An effective way to avoid invading or injuring the subjects is to use the musculoskeletal model when studying the dynamic properties of muscles in vivo. So, we put forward a joint coordinate system-based method, which mainly focuses on the coordinate's transformation of corresponding muscle attachment points, respectively, in the model and the subject in order to reproduce the movement of the subject on the model. As muscle moment arm is usually used to evaluate the dynamic properties of muscles, the moment arms in elbow flexion for each of the major muscles crossing the elbow in 50 healthy subjects (25 males and 25 females), ranging in height from 1.50 to 1.80 m (mean 1.6542 m) are calculated and compared with the measured data obtained from anatomical studies reported in the literature. The trends of the value basically coincide with each other. So, this novel method can be valid.

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

musculoskeletal model
moment arm
elbow flexion


Secretion of Melatonin in Healthy Elderly Subjects: A Longitudinal Study We report on a 10-year longitudinal study on 24-h serum melatonin secretion (AUC) in healthy human subjects. Fifty women and 53 men (aged 42-83 yr) participated in the study initially. Of these, 18 women and 15 men were followed for 6 consecutive years. Results

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


Upper bounds for the condition numbers of the GCD and the reciprocal GCD matrices in spectral norm Let S={x1,,xn} S = { x 1 , , x n } be a set of n n distinct positive integers. The nn n n matrix having the greatest common divisor (xi,xj) ( x i , x j ) of xi x i and xj x j as its i,j i , j -entry is called the greatest common divisor (GCD) matrix defined on S S , denoted by ((xi,xj)) ( ( x i , x j ) ) , or abbreviated as (S) ( S ) . The nn n n matrix (S?1)=(gij) ( S ? 1 ) = ( g i j ) , where g i j = 1 ( x i , x j ) , is called the reciprocal greatest common divisor (GCD) matrix on S S . In this paper, we present upper bounds for the spectral condition numbers of the reciprocal GCD matrix (S?1) ( S ? 1 ) and the GCD matrix (S) ( S ) defined on S={1,2,,n} S = { 1 , 2 , , n } , with n?2 n ? 2 , as a function of Eulers ? ? function and n n .

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

matrix norms
eulers ? ? function ? ? ? ? ?


federate migration in a service oriented hla rti The High Level Architecture provides a general framework for distributed simulation, promoting reusability and interoperability of simulation components (federates). Large scale distributed simulation, in which federates run on many heterogenous computing machines may benefit from migrating federates among these machines for loadbalancing and fault-tolerance. However, the HLA framework does not provide formal support for federate migration currently. We have previously developed a Service Oriented HLA RTI (SOHR) framework, which provides HLA RTI functionalities via the cooperation of a set of Grid services. SOHR is developed with migration support features by using a decoupled federate design. In this paper, a basic federate migration protocol is first proposed to illustrate the process of federate migration in SOHR. Then two optimized protocols are further developed to overlap federate migration with federate execution for the purpose of reducing migration overhead. Experiments show that the migration overhead is reduced considerably in the optimized protocols.

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

rti
hla
federate migration
distributed simulation


robust topology control for indoor wireless sensor networks Topology control can reduce power consumption and channel contention in wireless sensor networks by adjusting the transmission power. However, topology control for wireless sensor networks faces significant challenges, especially in indoor environments where wireless characteristics are extremely complex and dynamic. We first provide insights on the design of robust topology control schemes based on an empirical study in an office building. For example, our analysis shows that Received Signal Strength Indicator and Link Quality Indicator are not always robust indicators of Packet Reception Rate in indoor environments due to significant multi-path effects. We then present Adaptive and Robust Topology control ( ART ), a novel and practical topology control algorithm with several salient features: (1) ART is robust in indoor environments as it does not rely on simplifying assumptions about the wireless properties; (2) ART can adapt to variations in both link quality and contention; (3) ART introduces zero communication overhead for applications which already use acknowledgements. We have implemented ART as a topology layer in TinyOS 2.x. Our topology layer only adds 12 bytes of RAM per neighbor and 1.5 kilobytes of ROM, and requires minimal changes to upper-layer routing protocols. The advantages of ART have been demonstrated through empirical results on a 28-node indoor testbed.

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


Training of Fuzzy Neural Networks via Quantum-Behaved Particle Swarm Optimization and Rival Penalized Competitive Learning There are some difficulties encountered in the application of fuzzy Radial Basis Function (RBF) neural network. One of them is how to determine the number of hidden rule neurons and another difficulty is about interpretability. In order to overcome these difficulties, we have proposed a fuzzy neural network based on RBF network and takagi-sugeno fuzzy system. We have used a new structure of fuzzy RBF neural network, which has been proved that it is better than other structures in term of interpretability. Our model also use a Rival Penalized Competitive Learning (RPCL) and a swarm based algorithm called Quantum-behaved Particle Swarm Optimization (QPSO) to determine design parameters of hidden layer and design parameters of output layer, respectively. RPCL is the best clustering algorithm that is introduced so far. The Particle Swarm Optimization (PSO) is a well-known population-based swarm intelligence algorithm. The QPSO is also proposed by combining the classical CPSO philosophy and quantum mechanics to improve performance of PSO. We have compared the performance of the proposed method with gradient based method. Simulation results of nonlinear function approximation demonstrate the superiority of the proposed method over gradient based method.

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


visualizing dynamic software system information through high-level models Dynamic information collected as a software system executes can help software engineers perform some tasks on a system more effectively. To interpret the sizable amount of data generated from a system's execution, engineers require tool support. We have developed an off-line, flexible approach for visualizing the operation of an object-oriented system at the architectural level. This approach complements and extends existing profiling and visualization approaches available to engineers attempting to utilize dynamic information. In this paper, we describe the technique and discuss preliminary qualitative studies into its usefulness and usability. These studies were undertaken in the context of performance tuning tasks.

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

help
qualitative studies
usability
context
paper
performance
software
visualization
systems
dynamic
data

use
program comprehension
flexibility
software visualization
model
object-oriented
informal
software engineering
software structure
programming environments
execution trace
architecture
tool-support
profiles
performance tuning


A survey of automated techniques for formal software verification The quality and the correctness of software are often the greatest concern in electronic systems. Formal verification tools can provide a guarantee that a design is free of specific flaws. This paper surveys algorithms that perform automatic static analysis of software to detect programming errors or prove their absence. The three techniques considered are static analysis with abstract domains, model checking, and bounded model checking. A short tutorial on these techniques is provided, highlighting their differences when applied to practical problems. This paper also surveys tools implementing these techniques and describes their merits and shortcomings.

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

model checking
software verification
static analysis

bounded model checking (bmc)
predicate abstraction


Thoracic and lumbar posture behaviour in sitting tasks and standing: Progressing the biomechanics from observations to measurements Fifty individuals nave to posture assessment performed three postural conditions: 10-min computer task, sitting in their correct posture, and standing. In the 10-min computer task thoracolumbar and lumbar postures were commonly kyphotic. In correct sitting the thoracolumbar angle was similar to that in standing. Gender differences in sitting posture were localised to the lumbar region.

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


Task-based annotation and retrieval for image information management Continuing advances in digital image capture and storage are resulting in a proliferation of imagery and associated problems of information overload in image domains. In this work we present a framework that supports image management using an interactive approach that captures and reuses task-based contextual information. Our framework models the relationship between images and domain tasks they support by monitoring the interactive manipulation and annotation of task-relevant imagery. During image analysis, interactions are captured and a task context is dynamically constructed so that human expertise, proficiency and knowledge can be leveraged to support other users in carrying out similar domain tasks using case-based reasoning techniques. In this article we present our framework for capturing task context and describe how we have implemented the framework as two image retrieval applications in the geo-spatial and medical domains. We present an evaluation that tests the efficiency of our algorithms for retrieving image context information and the effectiveness of the framework for carrying out goal-directed image tasks.

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

task-based information retrieval
capturing and reusing user context
image manipulation
semantic annotation
case-based reasoning


A group-choose algorithm supporting virtual organization creation for workflow deployment in cloud environment Virtual organization (VO) is a main organizational paradigm for enterprises to collaborate in the rapidly changing environment. However, finding partners for VO creation has great challenges on Internet, because a VO initiator is blinded without enough partners' information. The problem of VO creation in cloud environment is discussed. A VO creating algorithm (called Group-Choose) based on reputation system is presented to help initiator minimize the operating risk on Internet. In the algorithm, a VO initiator aggregates partners' trust evaluations of candidates to select new partners for VO, instead of evaluating candidate's trust only by itself. The third-party assessment and Time Slide Window are used in peer-to-peer trust evaluation to make the model more adaptive in the dynamic environment. The proposed method focuses on the reputation data, without taking other factors into consideration. Compared with PathTrust and PeerTrust, the Group-Choose algorithm for VO creation has better performance in resisting conspiracy attack and periodic attack. Copyright (c) 2013 John Wiley & Sons, Ltd.

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

virtual organization
trust
reputation
workflow deployment
cloud


Portable, Flexible, and Scalable Soft Vector Processors Field-programmable gate arrays (FPGAs) are increasingly used to implement embedded digital systems, however, the hardware design necessary to do so is time-consuming and tedious. The amount of hardware design can be reduced by employing a microprocessor for less-critical computation in the system. Often this microprocessor is implemented using the FPGA reprogrammable fabric as a soft processor which presently have simple architectures and moderate performance. Our goal is to scale the performance of existing soft processors hence expanding their suitability to more critical computation. To this end we propose extending soft processors with vector extensions to exploit the abundant data parallelism found in many embedded kernels. Such a soft vector processor can execute these kernels much faster than a single-core hence reducing the need for hardware implementations. We observe this improved execution speed through experimentation with vector extended soft processor architecture (VESPA) which is designed, implemented, and evaluated on real FPGA hardware. VESPA is shown to effectively scale performance up to 32 lanes, while providing substantial architectural flexibility to create a fine-grained design space. With these characteristics, and portability across FPGA devices, soft vector processors can provide exact-fit architectures which can efficiently and more easily implement data parallel workloads over custom FPGA hardware design.

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

field-programmable gate array (fpga)-based soft-core processors


A comprehensive study for advanced in situ contact dry cleaning An advanced in situ pre-contact dry cleaning process with fluorine species has been comprehensively investigated to effectively remove the native oxide on the top surface of Ni-salicide layer for ensuring lower contact resistance (Rc) without the drawbacks, including the clipping of contact top opening, the formation of by-product re-deposition and severe Ni-salicide loss, of the conventional argon ion bombardment process. In this study, two kinds of in situ dry cleaning approaches, called saturation and low etch rate (LER) modes, have been evaluated to further reduce Rc and prevent the contact to poly short issue as keeping contact size scaling down to 28nm node. The Rc reduction of ?40% at 45nm and no contact to poly short issue at 28nm contact design rules can be simultaneously demonstrated by implementing optimized in situ saturation and LER dry cleaning conditions.

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

in situ contact dry cleaning
contact resistance
contact to poly short

ar pre-clean
ni-salicide
breakdown voltage


Multiple Exposure Fusion for High Dynamic Range Image Acquisition A multiple exposure fusion to enhance the dynamic range of an image is proposed. The construction of high dynamic range images (HDRIs) is performed by combining multiple images taken with different exposures and estimating the irradiance value for each pixel. This is a common process for HDRI acquisition. During this process, displacements of the images caused by object movements often yield motion blur and ghosting artifacts. To address the problem, this paper presents an efficient and accurate multiple exposure fusion technique for the HDRI acquisition. Our method simultaneously estimates displacements and occlusion and saturation regions by using maximum a posteriori estimation and constructs motion-blur-free HDRIs. We also propose a new weighting scheme for the multiple image fusion. We demonstrate that our HDRI acquisition algorithm is accurate, even for images with large motion.

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

high dynamic range image (hdri)
maximum a posteriori (map) estimation


Detecting node replication attacks in mobile sensor networks: theory and approaches A wireless sensor network composed of a number of sensor nodes is often deployed in unattended and harsh environments to perform various monitoring tasks. Due to cost concerns, usually, sensor nodes are not made tamper-resistant, and a captured node may be easily compromised by an adversary. With the revealed secret credentials, the adversary can create many duplicate nodes that are seemingly legitimate, and deploy them into the network to cripple the monitoring applications. Defending against node replication attacks has become an important research topic in sensor network security, but so far, not many solutions have been proposed, most of which adopt a stationary network model where sensor nodes are fixed and immobile. In this work, we address the problem of detecting node replication attacks in a mobile sensor network, where each sensor node freely and randomly roams in the sensing region all the time, and one node meets with another in an occasional and unpredictable manner. For replication attacks where the replicas do not conspire, we employ very lightweight token-based authentication as a detection approach. In case the replicas conspire by communicating with each other in an efficient manner, we harness the random encounters between physical nodes and propose a detection method based on statistics. Compared with existent solutions, our detections have the nice feature that sensor nodes are freed from the fragile assumption that they can correctly obtain their geographic positions, and that even loose time synchronization may be unnecessary. Copyright (c) 2011 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 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 B O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

mobile sensor network
security
detection

patrol robot system
node replication attack


An alternating determination-optimization approach for an additive multi-index model Sufficient dimension reduction techniques are to deal with curse of dimensionality when the underlying model is of a very general semiparametric multi-index structure and to estimate the central subspace spanned by the indices. However, the cost is that they can only identify the central subspace/central mean subspace and its dimension, rather than the indices themselves. In this paper, we investigate estimation for an additive multi-index model (AMM) that is of an additive structure with indices. The problem for AMM involves determining and estimating the nonparametric component functions and estimating the corresponding indices in the model. Different from the classical sufficient dimension reduction techniques in the estimation of the subspace and dimensionality determination, we propose a new penalized method to implement the estimation of component functions and of indices simultaneously. To this end, we suggest an alternating determination-optimization algorithm to alternatively fit best model and estimate the indices. Estimation consistency is provided. Simulation studies are carried out to examine the performance of the new method and a real data example is also analysed for illustration. Crown Copyright (c) 2011 Published by Elsevier B.V. All rights reserved.

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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 information criterion
hierarchical type lasso
projected gradient method
spline approximation


NEW APPROACH TO THE ANALOGUE OF LEBESGUE-RADON-NIKODYM THEOREM WITH RESPECT TO WEIGHTED p-ADIC q-MEASURE ON Zp In this paper we reprove the result in Kim et al 2011 by using Mahler expansion of uniformly differentiable function over C-p. This result is related with Frobenius-Euler numbers.

O O O O O O O O O O O O O O O O O O O O O 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 generic triangle-based data structure of the complete set of higher order Voronoi diagrams for emergency management We introduce a generic Delaunay triangle-based data structure for geoinformation processing in disaster and emergency management. The data structure supports the complete set of higher order Voronoi diagrams (order-k) Voronoi diagrams, ordered order-k Voronoi diagrams, and k -th nearest Voronoi diagrams for all (k) ( k ) . It provides useful and insightful information for what-if nearest queries, what-if neighboring queries, what-if zoning queries, what-if facility locating queries and what-if routing queries to handle various scenarios in the four stages of emergency management (mitigation, preparedness, response and recovery). We also demonstrate how the complete set of higher order Voronoi diagrams can be used for each phase of emergency management in diverse geoinformatics environments.

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

delaunay triangle-based data structure
higher order voronoi diagram
what-if analysis
order-k voronoi diagram
k-th nearest voronoi diagram
ordered order-k voronoi diagram


Fringe analysis of synchronized parallel insertion algorithms in 2-3 Trees Fringe analysis uses the distribution of bottom subtrees or fringe of search trees under the assumption of random insertion of keys, yielding an average case analysis of the fringe. The results in the fringe give upper and lower bounds for several measures for the whole tree. We are interested in the fringe analysis of the synchronized parallel insertion algorithms of Paul, Vishkin, and Wagener (PVW) on 2-3 trees. This algorithm inserts k keys with k processors into a tree of size n with time O(logn + log k). As the direct analysis of this algorithm is very difficult we tackle this problem by introducing a new family of algorithms, denoted by MacroSplit algorithms, and our main theorem proves that two algorithms of this family, denoted MaxMacroSplit and MinMacroSplit, bound the behavior of the fringe in the PVW algorithm. Previous work deals with the fringe analysis of sequential algorithms, but this type of analysis was still an open problem for parallel algorithms on search trees. We extend fringe analysis to parallel algorithms and we get a rich mathematical structure giving new interpretations even in the sequential case. We prove that random insertion of keys generates a binomial distribution, that the synchronized insertion of keys can be modeled by a Markov chain, and that the coefficients of the transition matrix of the Markov chain are related to the expected local behavior of our algorithm. Finally, we show that the coefficients of the power expansion of this matrix over (n+1)(-1) are the binomial transform of the expected local behavior of the algorithm. We finally show that the fringe of the PVW algorithm asymptotically converges to the sequential case. (C) 2002 Elsevier Science B.V. All rights reserved.

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

fringe analysis
parallel algorithms
binomial transform


The impact of task complexity on peoples mental models of MedlinePlus This study explored the impact of task complexity on peoples mental models of MedlinePlus, an information-rich web space providing consumer health information to the general public. Thirty-eight subjects were randomly assigned to two groups, performing either simple or complex search tasks. After the search session, subjects perceptions of MedlinePlus were elicited using a concept listing protocol where subjects listed concepts concerning MedlinePlus in the order each concept occurred to them. The analysis of the concepts suggested that task complexity impacted subjects mental models by influencing the objects in the system that they perceived and represented, the specificity of the representations, their evaluations of and emotions about the objects, and the heuristics that they developed for what works and what does not in the system. The pragmatic aspect of mental models was represented by subjects descriptions of the steps that they would follow to tackle a hypothetical task. The analysis showed that task complexity affected the strategies that subjects perceived themselves using to solve new tasks using the system.

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

mental models
task complexity
medlineplus

task impact
information retrieval
consumer health information systems


replacing legacy web services with restful services In this paper, we describe issues encountered in designing and implementing a set of RESTful services to extend and replace web services that have been in commercial use since 1998. Applicability of REST to the service requirements, suitability of available tools, and interoperability between multiple clients and servers are discussed.

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

digital signatures
cryptography
sealed bidding


considerations on developing mobile applications based on the capuchin project The development of applications for mobile devices is becoming increasingly popular, with manufacturers struggling to support different programming environments and embedding libraries on their devices. In this pursuit for a straight-forward development of mobile applications, Java Micro Edition (JME) is a natural solution. Although JME has innumerous benefits, it offers limited support for user interface (UI) development. On a different path, Adobe's Flash Lite is tailored to develop rich UI for mobile applications. To bring together the advantages of both JME and Flash Lite, Sony Ericsson's Capuchin project permits the creation of interactive mobile applications, using Flash Lite to implement the user interface and JME to implement application core. The use of Flash Lite and JME in a single application has rised design issues that must be dealt by software engineers, such as performance, maintainability and reusability of both Flash Lite and JME programming languages. To guide software engineers design mobile applications, this paper presents a development process for interactive mobile applications based on Capuchin project. To validate it, a mobile application is developed based on this process, and relevant topics of the process are discussed.

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


On the use of the sRGB colour space: the Gamma problem The dependence of the luminous output of computer-controlled CRT monitors on the digital colour values was measured on 11 different monitors. This dependence was called the channel function. Different settings of the monitors (gain/offset, position and size of the test colour patch, screen size) were investigated. It was concluded that the use of the default sRGB channel function instead of the measured channel function can lead to mean chromaticity errors of up to ?u?v?=0.06 and colour differences of up to Changing the graphics card did not influence the channel functions significantly.

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


Asymmetric trajectory generation and impedance control for running of biped robots An online asymmetric trajectory generation method for biped robots is proposed to maintain dynamical postural stability and increase energy autonomy, based on the running stability criterion defined in phases. In a support phase, an asymmetric trajectories for the hip and swing leg of the biped robots is obtained from an approximated running model with two springless legs and a spring-loaded inverted pendulum model so that the zero moment point should exist inside the safety boundary of a supporting foot, and the supporting leg should absorb large reaction forces, take off and fly through the air. The biped robot is under-actuated with six degrees of under-actuation during flight. The trajectory generation strategies for the hip and both legs in a flight phase use the approximated running model and non-holonomic constraints based on the linear and angular momenta at the mass center. Next, we present an impedance control with a force modulation strategy to guarantee a stable landing on the ground and simultaneously track the desired trajectories where the desired impedance at the hip link and both legs is specified. A series of computer simulations for two different types of biped robots show that the proposed running trajectory and impedance control method satisfy the two conditions for running stability and make the biped robot more robust to variations in the desired running speed, gait transitions between walking and running, and parametric modeling errors. We have examined the feasibility of this method with running experiments on a 12-DOF biped robot without arms. The biped robot could run successfully with average forward speed of about 0.3359 [m/s].

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

biped robot
running stability
asymmetric trajectory
impedance control


Fairness in Multiuser Systems With Polymatroid Capacity Region For a wide class of multiuser systems, a subset of capacity region which includes the corner points and the sum-capacity facet has a special structure known as polymatroid. Multiple-access channels with fixed input distributions and multiple-antenna broadcast channels are examples of such systems. Any interior point of the sum-capacity facet can be achieved by time-sharing among corner points or by an alternative method known as rate-splitting. The main purpose of this paper is to find a point on the sum-capacity facet which satisfies a notion of fairness among the active users. This problem is addressed in two cases: i) where the complexity of achieving interior points is not feasible, and ii) where the complexity of achieving interior points is feasible. For the first case, the corner point for which the minimum rate of the active users is maximized is desired. A simple greedy algorithm is introduced to find such an optimum corner point. In addition, it is shown for single-antenna Gaussian multiple-access channels, the resulting corner point is leximin maximal with respect to the set of the corner points. For the second case, the properties of the unique leximin maximal rate vector with respect to the polymatroid are reviewed. It is shown that the problems of deriving the time-sharing coefficients or rate-splitting scheme to attain the leximin maximal vector can be solved by decomposing the problem into some lower dimensional subproblems. In addition, a fast algorithm to compute the time-sharing coefficients to attain a general point on the sum-capacity facet is presented.

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

broadcast channels
fairness
multiuser systems

max-min
multiple-access channels
polymatroid structure
rate-splitting
successive decoding
time-sharing


A parallel multilevel preconditioned iterative pressure Poisson solver for the large-eddy simulation of turbulent flow inside a duct Turbulent Poiseuille flows inside the square duct are simulated by the large-eddy simulation based on the multilevel Schwarz preconditioned conjugate gradient pressure Poisson solver, which was developed on top of the Portable, Extensible Toolkit for Scientific Computation (PESTc). The impact of the five different matrix reordering techniques for an incomplete LU (ILU) decomposition as a subdomain solver on the overall performance of Schwarz-type preconditioners for the solution of the pressure Poisson equation are studied. The numerical results indicate that ILU of two-level fill-ins with the reverse Cuthill-McKee matrix ordering technique produces the best performance. Further investigation on the parallel performance of different multilevel methods was also conducted for two different problem sizes. It was observed that the computational cost saturates at around six-level for both the problem sizes explored. Also, though the one-level method is better for small problem size, for the larger problem size, the six-level method performs best in terms of scalability and compute time; hence, the benefit of a multilevel method is more obviously. (C) 2010 Elsevier Ltd. All rights reserved.

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

large-eddy simulation
duct turbulent flows
multilevel schwarz method
parallel computing
domain decomposition


A unified presentation of some urn models For a sequence of m urns we investigate how the number of urns satisfying a certain condition (e.g., being empty) evolves in time when after each time unit a ball is thrown. We show for a variety of urn models that this process (suitably normalized) converges weakly to a Gaussian process.

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


Algorithms for the constrained longest common subsequence problems Given strings S-1, S-2, and P, the constrained longest common subsequence problem for S-1 and S-2 with respect to P is to find a longest common subsequence lcs of S-1 and S-2 which contains P as a subsequence. We present an algorithm which improves the time complexity of the problem from the previously known 0(rn(2)m(2)) to 0(rnm) where r, n, and m axe the lengths of P, S-1, and S-2, respectively. As a generalization of this, we extend the definition of the problem so that the lcs sought contains a subsequence whose edit distance from P is less than a given parameter d. For the latter problem, we propose an algorithm whose time complexity is O(drnm).

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

longest common subsequence
edit distance

constrained subsequence
dynamic programming


On 3-colorable planar graphs without cycles of four lengths In this article we prove that planar graphs without 4-, 6-, 7-, and 8-cycles are 3-colorable. (C) 2007 Elsevier B.V. All rights reserved.

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


Development of a software sensor for phosphorus in municipal wastewater Different multivariate techniques were applied to data from a wastewater treatment plant in order to develop a software sensor for phosphorus. The predictive power, measured as root mean square error of cross-validation (RMSECV) and root mean square error of prediction (RMSEP), of partial least squares (PLS) models was found to be superior to that of multiple linear regression (MLR) and principal component regression (PCR) models. The result from using a static as well as a finite impulse response (FIR) model structure was also investigated. Good estimates of phosphorus were obtained for both kinds of model structure, but the FIR models were slightly better than the static ones. Out of the two different fractions of phosphorus that were modelled, i.e. total phosphorus and phosphate in solution, the best predictions were obtained for soluble phosphorus. Copyright (C) 2002 John Wiley Sons, Ltd.

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

software sensor
pls
fir model
wastewater treatment
phosphate


Applying forces to elastic network models of large biomolecules using a haptic feedback device Elastic network models of biomolecules have proved to be relatively good at predicting global conformational changes particularly in large systems. Software that facilitates rapid and intuitive exploration of conformational change in elastic network models of large biomolecules in response to externally applied forces would therefore be of considerable use, particularly if the forces mimic those that arise in the interaction with a functional ligand. We have developed software that enables a user to apply forces to individual atoms of an elastic network model of a biomolecule through a haptic feedback device or a mouse. With a haptic feedback device the user feels the response to the applied force whilst seeing the biomolecule deform on the screen. Prior to the interactive session normal mode analysis is performed, or pre-calculated normal mode eigenvalues and eigenvectors are loaded. For large molecules this allows the memory and number of calculations to be reduced by employing the idea of the important subspace, a relatively small space of the first M lowest frequency normal mode eigenvectors within which a large proportion of the total fluctuation occurs. Using this approach it was possible to study GroEL on a standard PC as even though only 2.3% of the total number of eigenvectors could be used, they accounted for 50% of the total fluctuation. User testing has shown that the haptic version allows for much more rapid and intuitive exploration of the molecule than the mouse version.

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


Modeling the effect of node synchronization times in ultra-wideband wireless networks Ultra-wideband wireless (UWB) can provide the physical layer for high-throughput personal area networks. When UWB is used for communication between many nodes, relatively long acquisition times are needed when dropping and re-establishing wireless links between the nodes. This paper describes the development and use of mathematical and simulation models to investigate the impact of dropping and reacquiring links between nodes on average packet delay; we also consider the performance of the alternative strategy of forwarding packets through intermediate nodes without breaking the established wireless links. The work presented here assumes that no specific MAC layer protocol, such as WiMedia UWB MAC, is in operation. The paper describes the models, explains the selection of modeling parameters used, compares the average packet delay for a network of three simple UWB nodes and for a ring of ten UWB nodes and explains the use of these results for network design engineers.

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

ultra-wideband
average delay
servers with vacations


Markov random field-based clustering applied to the segmentation of masses in digital mammograms In this paper we propose a new pixel clustering model applied to the analysis of digital mammograms. The clustering represents here the first step in a more general method and aims at the creation of a concise data-set (clusters) for automatic detection and classification of masses, which are typically among the first symptoms analysed in early diagnosis of breast cancer. For the purpose of this work, a set of mammographic images has been employed, that are 12-bit gray level digital scans and as such, are inherently inhomogeneous and affected by the noise resulting from the film scanning. The image pixels are described only by their intensity (gray level), therefore, the available information is limited to one dimension. We propose a Markov random field (MRF)-based technique that is suitable for performing clustering in an environment which is described by poor or limited data. The proposed method is a statistical classification model, that labels the image pixels based on the description of their statistical and contextual information. Apart from evaluating the pixel statistics, that originate from the definition of the K-means clustering scheme, the model expands the analysis by the description of the spatial dependence between pixels and their labels (context), hence leading to the reduction of the inhomogeneity of the output. Moreover, we define a probabilistic description of the model, that is characterised by a remarkable simplicity, such that its realisation can be easily and efficiently implemented in any high- or low-level programming language, thus allowing it to be run on virtually any kind of platform. Finally, we evaluate the algorithm against the classical K-means clustering routine. We point out similarities between the two methods and, moreover, show the advantages and superiority of the MRF scheme.

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

image analysis
markov random fields
mammography
micro-calcification
ising potential


Learning by doing, learning spillovers and the diffusion of fuel cell vehicles Fuel cell vehicles (FCVs) running on hydrogen do not cause local air pollution. Depending on the energy sources used to produce the hydrogen they may also reduce greenhouse gases in the long term. Besides problems related to the necessary investments into hydrogen infrastructure, there is a general notion that current fuel cell costs are too high to be competitive with conventional engines. But given historical evidence from many other technologies it is highly likely that learning by doing (LBD) would lead to substantial cost reductions. In this study, we implement potential cost reductions from LBD into an existing agent-based model that captures the main dynamics of the introduction of the new technology together with hydrogen infrastructure build-up. Assumptions about the learning rate turn out to have a critical impact on the projected diffusion of the FCVs. Moreover, LBD could imply a substantial first mover advantage. We also address the impact of learning spillovers between producers and find that a government might face a policy trade-off between fostering diffusion by facilitating learning spillovers and protecting the relative advantage of a national technological leader.

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

fuel cell vehicles
hydrogen
learning by doing


mining for misconfigured machines in grid systems Grid systems are proving increasingly useful for managing the batch computing jobs of organizations. One well-known example is Intel, whose internally developed NetBatch system manages tens of thousands of machines. The size, heterogeneity, and complexity of grid systems make them very difficult, however, to configure. This often results in misconfigured machines, which may adversely affect the entire system.We investigate a distributed data mining approach for detection of misconfigured machines. Our Grid Monitoring System (GMS) non-intrusively collects data from all sources (log files, system services, etc.) available throughout the grid system. It converts raw data to semantically meaningful data and stores this data on the machine it was obtained from, limiting incurred overhead and allowing scalability. Afterwards, when analysis is requested, a distributed outliers detection algorithm is employed to identify misconfigured machines. The algorithm itself is implemented as a recursive workflow of grid jobs. It is especially suited to grid systems, in which the machines might be unavailable most of the time and often fail altogether.

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

distributed data mining
grid systems
outliers detection

system monitoring
grid information system


Using a particle swarm method to optimize the weighting in extension theory for the detection of islanding in photovoltaic systems This paper proposes a two-dimensional particle swarm optimization (2D-PSO) method for optimizing the weighting in extension theory for the detection of islanding in photovoltaic (PV) power generation systems. Generally, using extension theory to implement and analyze a system with a correlation function would involve constructing a weighting determined by trial and error to help judge the problems performance. However, the judgment accuracy can be degraded if one uses an inappropriate weighting set. Hence, this paper proposes a weighting determination method for optimizing the performance of the extension method using the 2D-PSO algorithm. Some simulation results are obtained to verify the effectiveness of the proposed islanding detection method. In addition, the simulated results obtained using the proposed 2D-PSO algorithm are also compared with those obtained using genetic algorithm (GA) and evolutionary programming (EP) algorithms in order to reveal the search performance of the proposed method.

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

two-dimensional particle swarm optimization (2d-pso)

photovoltaic (pv) power generation system


Rational quadratic circles are parametrized by chord length We show that the chord length parameter assignment is exact for circle segments in standard rational quadratic form. (C) 2006 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

chord length parametrization
rational quadratics
standard form


evidence of hypertext in the scholarly archive This paper attempts to substantiate recent observations about the development of hypertext rhetoric in scholarly archives by reporting the results of some simple quantitative studies of the use by researchers of a major scholarly archive.

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

web
scholarly and scientific communication
textuality
navigation


Protecting privacy during peer-to-peer exchange of medical documents Privacy is an important aspect of interoperable medical information systems. Governments and health care organizations have established privacy policies to prevent abuse of personal health data. These policies often require organizations to obtain patient consent prior to exchanging personal information with other interoperable systems. The consents are defined in form of so-called disclosure directives. However, policies are often not precise enough to address all possible eventualities and exceptions. Unanticipated priorities and other care contexts may cause conflicts between a patient's disclosure directives and the need to receive treatments from informed caregivers. It is commonly agreed that in these situations patient safety takes precedence over information privacy. Therefore, caregivers are typically given the ability to override the patient's disclosure directives to protect patient safety. These overrides must be logged and are subject to privacy audits to prevent abuse. Centralized "shared health record" (SHR) infrastructures include consent management systems that enact the above functionality. However, consent management mechanisms do not extend to information systems that exchange clinical information on a peer-to-peer basis, e.g., by secure messaging. Our article addresses this gap by presenting a consent management mechanism for peer-to-peer interoperable systems. The mechanism restricts access to sensitive, medical data based on defined consent directives, but also allows overriding the policies when needed. The overriding process is monitored and audited in order to prevent misuse. The mechanism has been implemented in an open source project called CDAShip and has been made available on SourceForge.

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

consent management
disclosure directives

security and privacy
ehealth
peer-to-peer interoperability
cda
access control
auditing
non-repudation


Modelling and performance analysis of an adaptive state-transition approach for power saving in Bluetooth In this paper, an approach is developed to improve the power efficiency of Bluetooth. The better efficiency is achieved by reducing the unnecessary polling operations in the Basic Rate/Enhanced Data Rate (BR/EDR) controllers. An analysis of the current low power modes in the Bluetooth BR/EDR controller indicates that their activation requires a critical and challenging parameter negotiation phase. These parameters have a wide range of choices and as a result the associated low power modes are typically ignored by the Bluetooth application developers. The new approach is based upon multiple polling intervals. It is shown that three different polling intervals: small, medium and large are sufficient for a broad range of data traffic scenarios. As the kernel idea, each controller runs a common algorithm to choose among the three polling intervals and adaptively switches link state between the active data transfer state and idle. The state-transition rules are derived, and a system model is established based on the Hidden Markov Model (HMM), which is used to analyze and design the new Bluetooth link state-transition algorithm. The simulation and analysis demonstrates significant power saving and relatively low average end-to-end packet delay for this state-transition based approach, in comparison to the conventional polling system and the low power sniff mode. Moreover, the state-transition approach enables easier parameter setting that can be further optimized for a specific Bluetooth scenario.

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

bluetooth
power efficiency
hidden markov model
polling intervals
sniff mode


social network analysis on data diffusion in delay tolerant networks Different from existing mobility-assisted data access techniques, we propose to use data diffusion to reduce the query delay in DTNs. We use social network analysis to classify and study four diffusion schemes based on the "homophily" phenomenon in social network. Theoretical models are further developed to analyze the data diffusion process and compare the performance of the four proposed diffusion schemes in terms of diffusion speed and query delay.

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


exploiting manufacturing variations for compensating environment-induced clock drift in time synchronization Time synchronization is an essential service in distributed computing and control systems. It is used to enable tasks such as synchronized data sampling and accurate time-of-flight estimation, which can be used to locate nodes. The deviation in nodes' knowledge of time and inter-node resynchronization rate are affected by three sources of time stamping errors: network wireless communication delays, platform hardware and software delays, and environment-dependent frequency drift characteristics of the clock source. The focus of this work is on the last source of error, the clock source, which becomes a bottleneck when either required time accuracy or available energy budget and bandwidth (and thus feasible resynchronization rate) are too stringent. Traditionally, this has required the use of expensive clock sources (such as temperature compensation using precise sensors and calibration models) that are not cost-effective in low-end wireless sensor nodes. Since the frequency of a crystal is a product of manufacturing and environmental parameters, we describe an approach that exploits the subtle manufacturing variation between a pair of inexpensive oscillators placed in close proximity to algorithmically compensate for the drift produced by the environment. The algorithm effectively uses the oscillators themselves as a sensor that can detect changes in frequency caused by a variety of environmental factors. We analyze the performance of our approach using behavioral models of crystal oscillators in our algorithm simulation. Then we apply the algorithm to an actual temperature dataset collected at the James Wildlife Reserve in Riverside County, California, and test the algorithms on a waveform generator based testbed. The result of our experiments show that the technique can effectively improve the frequency stability of an inexpensive uncompensated crystal 5 times with the potential for even higher gains in future implementations.

O O O O O O O O O B I B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 geometrical area-preserving Volume-of-Fluid advection method A new class of algorithms that preserve mass exactly for incompressible flows on a Cartesian mesh are presented. They amount to piecewise-linear, area-preserving mappings of tessellations of the plane. They are equivalent to Volume-of-Fluid (VOF) advection methods which are decomposed into an Eulerian implicit scheme in one direction followed by a Lagrangian explicit step in the other one. It is demonstrated that mass conservation is exact for incompressible flows and that there are no undershoots or overshoots of the volume fraction which thus always remains constrained between 0 and 1.

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


Efficient algorithms for computing the best subset regression models for large-scale problems ? Several strategies for computing the best subset regression models are proposed. Some of the algorithms are modified versions of existing regression-tree methods, while others are new. The first algorithm selects the best subset models within a given size range. It uses a reduced search space and is found to outperform computationally the existing branch-and-bound algorithm. The properties and computational aspects of the proposed algorithm are discussed in detail. The second new algorithm preorders the variables inside the regression tree. A radius is defined in order to measure the distance of a node from the root of the tree. The algorithm applies the preordering to all nodes which have a smaller distance than a certain radius that is given a priori. An efficient method of preordering the variables is employed. The experimental results indicate that the algorithm performs best when preordering is employed on a radius of between one quarter and one third of the number of variables. The algorithm has been applied with such a radius to tackle large-scale subset-selection problems that are considered to be computationally infeasible by conventional exhaustive-selection methods. A class of new heuristic strategies is also proposed. The most important of these is one that assigns a different tolerance value to each subset model size. This strategy with different kind of tolerances is equivalent to all exhaustive and heuristic subset-selection strategies. In addition the strategy can be used to investigate submodels having noncontiguous size ranges. Its implementation provides a flexible tool for tackling large scale models.

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

best-subset regression
branch-and-bound algorithm


leakage efficient chip-level dual-vdd assignment with time slack allocation for fpga power reduction To reduce power, Vdd programmability has been proposed recently to select Vdd-level for interconnects and to powergate unused interconnects. However, Vdd-level converters used in the Vdd-programmable method consume a large amount of leakage. In this paper, we develop chip-level dual-Vdd assignment algorithms to guarantee that no low-Vdd interconnect switch drives high-Vdd interconnect switches. This removes the need of Vdd-level converters and reduces interconnect leakage and interconnect device area by 91.78\% and 25.48\%, respectively. The assignment algorithms include power sensitivity based heuristics with implicit time slack allocation and a linear programming (LP) based method with explicit time slack allocation. Both first allocate time slack to interconnects with higher transition density and assign low-Vdd to them for more power reduction. Compared to the aforementioned Vdd-programmable method using Vdd-level converters, the LP based algorithm reduces interconnect power by 65.13\% without performance loss for the MCNC benchmark circuits. Compared to the LP based algorithm, the sensitivity based heuristics can obtain slightly smaller power reduction but run 4X faster.

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


Relative negations in non-commutative fuzzy structures In this paper we investigate the properties of the relative negations in non-commutative residuated lattices and their applications. We define the notion of a relative involutive FL-algebra and we generalize to relative negations some results proved for involutive pseudo-BCK algebras. The relative locally finite IFL-algebra is defined and it is proved that an interval algebra of a relative locally finite divisible IFL-algebra is relative involutive. Starting from the observation that in the definition of states, the standard MV-algebra structure of [0, 1] intervenes, there were introduced the states on bounded pseudo-BCK algebras, pseudo-hoops and residuated lattices with values in the same kind of structures and they were studied under the name of generalized states. For the case of commutative residuated lattices the generalized states were studied in the sense of relative negation. We define and study the relative generalized states on non-commutative residuated lattices. One of the main results consists of proving that every order-preserving generalized Bosbach state is a relative generalized Rie?an state. Some conditions are given for a relative generalized Rie?an state to be a generalized Bosbach state. Finally, we develop a concept of states on IFL-algebras.

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

residuated lattice
fl-algebra
ifl-algebra
fl w -algebra
spn property
relative involutive residuated lattice
relative glivenko property
relative generalized rie?an state


nominal rewriting systems We present a generalisation of first-order rewriting which allows us to deal with terms involving binding operations in an elegant and practical way. We use a nominal approach to binding, in which bound entities are explicitly named (rather than using a nameless syntax such as de Bruijn indices), yet we get a rewriting formalism which respects ?-conversion and can be directly implemented. This is achieved by adapting to the rewriting framework the powerful techniques developed by Pitts et al. in the FreshML project.Nominal rewriting can be seen as higher-order rewriting with a first-order syntax and built-in ?-conversion. We show that standard (first-order) rewriting is a particular case of nominal rewriting, and that very expressive higher-order systems such as Klop's Combinatory Reduction Systems can be easily defined as nominal rewriting systems. Finally we study confluence properties of nominal rewriting.

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

binders
&#945
-conversion
first and higher-order rewriting


Performance measurement: roles and challenges Purpose - The purpose of this paper is to identify the past and present practices, and the future roles of performance measurement in the Thai public sector. It is part of a transformation effort initiated by the Office of the Public Sector Development Commission (OPDC) on m-government - more mobile, responsive, and flexible government. The paper also aims to identify possible roadblocks from successfully integrating performance measurement into a management process. Design/methodology/approach - In-depth interviews with 12 executives and top administrators from private firms and public agencies, and document reviews are performed. The analysis on the participants' opinions is based on the applications of the grounded theory. The interview's findings are verified with document reviews. The roadblocks are identified and substantiated by two experts. Findings - For past and present practices, performance measurement is part of management tool and responsibility, a quality management system, and a learning organization. Its future viewpoints include a driver towards good governance, transparency, and accountability, and a success factor of performance audit and organizational competency/capability. Four important roadblocks in implementing performance measurement in an organization relate to staff empowerment, budgeting, external knowledge, and linkage with software usages. Practical implications - The findings provide important information into the OPDC's planning process on its m-government transformation initiative. Originality/value - The paper attempts to blend knowledge on performance measurement from both the private and public sectors. It highlights the greater roles and expectations on performance measurement in an organization.

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

performance measures
thailand
public sector organizations
private sector organizations


Cooperation and opportunistic behaviour in transformational outsourcing Purpose - The aim of this paper is to investigate possible opportunistic behaviour in transformational outsourcing relationship and to indicate possibilities how to avoid it. Design/methodology/approach - On the basis of literature survey authors discuss several important aspects of managing successful outsourcing relationship. Findings - Holistic perception of business processes and expertise on critical success factors in transformational outsourcing become increasingly important. For a collaboration in which the process of transformational outsourcing will prosper participants must be interdependent (and be aware of their interdependence) and have a long-termed strategic interest to cooperate. Originality/value - Introduced insight is important for understanding the long-term outsourcing partnership, and to recognize possible opportunistic behaviour and be able to avoid it.

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


A computational framework to identify patients with poor adherence to blood pressure lowering medication Blood pressure (BP) lowering medications have impressive efficacy in reducing cardiovascular and renal events; but low adherence threatens their effectiveness. Analysis of patterns in electronic prescribing from electronic medical records (EMRs) may have the potential to reveal cohorts of patients with significant adherence problems. We developed a computational framework to identify patient cohorts with poor adherence to long-term medication through analysis of electronic prescribing patterns. A range of quality reporting criteria can be specified (as an XML document). We illustrate the framework by application to the EMRs of a New Zealand general practice with a focus on adherence to angiotensin-converting enzyme inhibitors (ACE-inhibitors) and/or angiotensin II receptor blockers (ARBs) in patients classified with hypertension and diabetes. We analyse medication supply based on Medication Possession Ratio (MPR) and duration of lapse in ACE-inhibitors/ARBs over a 12-month evaluation period. We describe graphical tools to assist visualisation of prescribing patterns and relationship of the analysis outputs to controlled blood pressure. Out of a cohort of 16,504 patient EMRs, 192 patients were found classified with both hypertension and diabetes and under active ACE-inhibitor and/or ARB management. Of these, 107 (56%) patients had an ACE-inhibitor/ARB MPR less than 80% together with a lapse in ACE-inhibitors/ARBs for greater than 30 days. We find non-adherent patients (i.e. MPR 30 days) are three times more likely to have poor BP than adherent patients (odds ratio=3.055; p=0.012). We have developed a generic computational framework that can be used to formulate and query criteria around issues of adherence to long-term medication based on practice EMRs. Within the context of the example we have used, the observed adherence levels indicate that a substantial proportion of patients classified with hypertension and diabetes have poor adherence, associated with poorer rates of blood pressure control, that can be detected through analysis of electronic prescribing. Further work is required to identify effective interventions using the reporting information to reduce non-adherence and improve patient outcomes.

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

ambulatory care information systems
clinical audit
long-term care
patient non-adherence
patient outcome assessment
quality indicators


Endurance, pain and resumption in fully flexed postures In this study effects of low loads in fully flexed postures were investigated. Thirteen men who were unused to the postures participated. Thirteen professional construction workers with long experience of suchlike postures were also studied. Pain reactions during and after loading were observed, as well as endurance time and the recovery process, here by studying the resumption time. Endurance and resumption times differed little from those given by models used for more common postures. Pain from the legs and not from the back limited the working ability in 86% of the endurance tests. Thirdly, the construction workers had significantly longer endurance time and shorter resumption time.

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

endurance
recovery
pain
fully flexed postures


Lack of Mutual Respect in Relationship Violence in a relationship and in a family setting has been an issue of concern to various interest groups and professional organizations. Of particular interest in this article is violence against women in a relationship. While there is an abundance of knowledge on violence against women in general, intimate or partner femicide seems to have received less attention. Unfortunately, the incidence of violence against women, and intimate femicide in particular, has been an issue of concern in the African setting

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

domestic
intimate partner
africa
botswana


TrustSets: using trust to detect deceitful agents in a distributed information collecting system This paper addresses the issue of maintaining information coherence and its robustness in a multi-agent system, that collectively gathers information from distributed sources and where some sources may be defective (deliberately or not). In this context, the collective information gathered by the system is a progressive (non linear) aggregation of information collected individually by each agent. Therefore, each agent has direct information (collected by itself) and indirect information (obtained through communication with other agents). System coherence is defined by compatibility of collected information about the explored environment with actual information of the environment. System resilience is defined by the capability to maintain information coherence, despite the existence and increase of faulty agents within the system. In this context, we propose a new trust-based mechanism to detect defective agents and limit the dissemination of deceitful information in the system, thus reducing its impact on the process of collective information gathering.

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

multi-agents system
self-organizing
trustnet
mapping


Stability of flow past a cylinder: Energy budget of eigenmodes Global linear stability analysis of the flow past a circular cylinder at the onset of primary wake instability is carried out. The real and imaginary parts of the most unstable eigenmode, responsible for vortex shedding, are very similar but associated with a spatial shift in the vortex structures. This shift results in the convection of vortices that are observed in the unsteady flow, which is actually a consequence of global absolute instability. The kinetic energy density, associated with the most unstable eigenmode, is studied. At the onset of the instability the energy density of the disturbance field is found to be stronger in the far wake compared with the near wake. With increase in Re the region where the disturbance is strong moves upstream closer to the cylinder. However, the maximum value of the kinetic energy density of the disturbance lies outside the recirculation zone even for Re upto 100. A linearized mechanical energy equation for the time evolution of the kinetic energy density of the disturbance is utilized to examine the energy budget of the most unstable eigenmode at various Re. It is found that the most significant contribution to the growth rate of the disturbance arises from the transfer of the energy due to the strain rate of the base flow to the perturbation. The stabilizing effect of the viscous dissipation increases with increase in Re, but saturates for Re beyond similar to 70. Copyright (C) 2009 John Wiley & Sons, Ltd.

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

energy budget
linear stability analysis
absolute instability

global instability
flow past cylinder
stabilized finite element method


The disclosure of an Android smartphones digital footprint respecting the Instant Messaging utilizing Skype and MSN As Android Operating System (OS) for mobile computing devices become one of the major trends, the utilization of smartphones set the record for global users and they are taking advantages of the contemporary Instant Messaging (IM) as a convenient tool to communicate with global users in real time because of its competitive rate, high availability, robust reliability, and agile mobility. Undoubtedly, as IM has gradually become one of the channels to commit the cybercrime, the digital evidence collection, analysis, and preservation of the non-volatile data from the Random Access Memory (RAM) of the computing device in terms of cyber trails that were unknowingly left on the crime scene. Hence, this research conducts the design of the experiments to fulfill the essence of contribution of the paper. The Skype Chat and MSN are the popular IM tools, which are widely utilized in contemporary digital era. This paper provides a generic paradigm for the digital forensics specialists and law enforcement agencies to ponder if similar situations are faced.

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

non-volatile memory
msn instant messaging
android smartphone
digital evidence recovery


ON ASSESSING THE DISCLOSURE RISK OF CONTROLLED ADJUSTMENT METHODS FOR STATISTICAL TABULAR DATA Minimum distance controlled tabular adjustment is a recent perturbative approach for statistical disclosure control in tabular data. Given a table to be protected, it looks for the closest safe table, using some particular distance. Controlled adjustment is known to provide high data utility. However, the disclosure risk has only been partially analyzed using theoretical results from optimization. This work extends these previous results, providing both a more detailed theoretical analysis, and an extensive empirical assessment of the disclosure risk of the method. A set of 25 instances from the literature and four different attacker scenarios are considered, with several random replications for each scenario, both for L-1 and L-2 distances. This amounts to the solution of more than 2000 optimization problems. The analysis of the results shows that the approach has low disclosure risk when the attacker has no good information on the bounds of the optimization problem. On the other hand, when the attacker has good estimates of the bounds, and the only uncertainty is in the objective function (which is a very strong assumption), the disclosure risk of controlled adjustment is high and it should be avoided.

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

statistical disclosure control
controlled tabular adjustment
disclosure risk
optimization

linear programming
quadratic programming


Formalizing an engineering approach to cooperating knowledge-based systems A theoretical grounding is provided for a Cooperating Knowledge-Based Systems (CKBS) model which is based upon agents, cooperation blocks, and cooperation block hierarchies. Our model describes the requirements for task decomposition, negotiation, cooperation and coordination, fault tolerance, and recoverability, these requirements in turn defining a holonic system. The behavioral properties of our model are described using state transition diagrams and properties of correctness and termination are proven.

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

cooperation blocks
task decomposition
negotiation
cooperation
coordination
fault tolerance
recoverability

cooperating knowledge based systems (ckbs)


Identifying the binding mode of a molecular scaffold We describe a method for docking of a scaffold-based series and present its advantages over docking of individual ligands, for determining the binding mode of a molecular scaffold in a binding site. The method has been applied to eight different scaffolds of protein kinase inhibitors (PKI). A single analog of each of these eight scaffolds was previously crystallized with different protein kinases. We have used FlexX to dock a set of molecules that share the same scaffold, rather than docking a single molecule. The main mode of binding is determined by the mode of binding of the largest cluster among the docked molecules that share a scaffold. Clustering is based on our 'nearest single neighbor' method [J. Chem. Inf. Comput. Sci., 43 (2003) 208-217]. Additional criteria are applied in those cases in which more than one significant binding mode is found. Using the proposed method, most of the crystallographic binding modes of these scaffolds were reconstructed. Alternative modes, that have not been detected yet by experiments, could also be identified. The method was applied to predict the binding mode of an additional molecular scaffold that was not yet reported and the predicted binding mode has been found to be very similar to experimental results for a closely related scaffold. We suggest that this approach be used as a virtual screening tool for scaffold-based design processes.

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

binding mode
clustering
docking
kinase inhibitors
scaffolds


A guided reactive GRASP for the capacitated multi-source Weber problem ? The capacitated multi-source Weber problem entails finding both the locations of capacitated facilities on a plane and their customer allocations. A framework that uses adaptive learning and functional representation to construct the restricted candidate list (RCL) within a greedy randomized adaptive search procedure (GRASP) is put forward. An implementation of restricted regions that forbids new facilities to be located too close to the previously found facilities is also embedded into the search to build up the RCL more efficiently. The performance of this GRASP based approach is tested on three classes of instances with constant and variable capacities. Very competitive results are obtained when compared to the best known results from the literature.

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

reactive grasp
learning
restricted regions

continuous location
capacitated location


Mechanised wire-wise verification of Handel-C synthesis The compilation of Handel-C programs into net-list descriptions of hardware components has been extensively used in commercial tools but never formally verified. In this paper, we first introduce an extension of the compilation schema that allows the synthesis of the prioritised choice construct. Then we present a variation of the existing semantic model for Handel-C compilation that is amenable to mechanical proof and detailed enough for analysing properties of the hardware generated. We use this model to prove the correctness of the wiring schema used to interconnect the components at the hardware level and propagate control signals among them. Finally, we present the most interesting aspects of the mechanisation of the model and the correctness proofs in the HOL theorem prover.

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

handel-c synthesis
denotational semantics
mechanical verification


fast self-healing gradients We present CRF-Gradient , a self-healing gradient algorithm that provably reconfigures in O(diameter ) time. Self-healing gradients are a frequently used building block for distributed self-healing systems, but previous algorithms either have a healing rate limited by the shortest link in the network or must rebuild invalid regions from scratch. We have verified CRF-Gradient in simulation and on a network of Mica2 motes. Our approach can also be generalized and applied to create other self-healing calculations, such as cumulative probability fields.

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


Fast collision detection based on nose augmentation virtual surgery Collision detection is the key technology in nose augmentation surgery simulation system, which can avoid incorrect intersection between bones and the implant model. In this paper, we present a sphere-tree-based hierarchical collision detection algorithm (STHCD) for surgery simulation. Each model is represented as a clustered hierarchy of sphere tree (CHST). Graphics processing unit (GPU)-based occlusion queries were used for fast collision culling between massive models. Furthermore, we are able to generate these hierarchies and perform collision queries using out-of-core techniques on all triangulated models. Experimental results show that STHCD performs real-time collision detection between massive bones and implant models, consisting of millions of triangles at interactive rates on a commodity PC.

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

clustered hierarchy of sphere tree
nose augmentation
collision detection


the combination limit in multimedia retrieval Combining search results from multimedia sources is crucial for dealing with heterogeneous multimedia data, particularly in multimedia retrieval where a final ranked list of items of interest is returned sorted by confidence or relevance. However, relatively little attention has been given to combination functions, especially their upper bound performance limits. This paper presents a theoretical framework for studying upper bounds for two types of combination functions. A general upper bound and two approximations are proposed for monotonic combination functions. We also studied the upper bounds for linear combination functions using a global optimization technique. Our experimental results show that the choice of combination functions has a considerable influence to retrieval performance.

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

attention
framework
influence
performance
types
global optimization
multimedia
retrieval
data
relevance
general
paper
search

experimentation
multimedia information retrieval
heterogeneity
combinational


Assessment of algorithms for mitosis detection in breast cancer histopathology images We organized a challenge on mitosis detection in breast cancer histopathology images. The challenge dataset consisted of 23 cases with more than 1000 annotated mitoses. Eleven proposed algorithms were evaluated and compared. The top scoring method had a performance comparable to expert observers.

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

whole slide imaging
digital pathology
cancer grading


a qualitative study of the determinants of self-managing team effectiveness in a scrum team There are many evidences in the literature that the use self-managing teams has positive impacts on several dimensions of team effectiveness. Agile methods, supported by the Agile Manifesto, defend the use of self-managing teams in software development in substitution of hierarchically managed, traditional teams. The goal of this research was to study how a self-managing software team works in practice and how the behaviors of the software organization support or hinder the effectiveness of such teams. We performed a single case holistic case study, looking in depth into the actual behavior of a mature Scrum team in industry. Using interviews and participant observation, we collected qualitative data from five team members in several interactions. We extract the behavior of the team and of the software company in terms of the determinants of self-managing team effectiveness defined in a theoretical model from the literature. We found evidence that 17 out of 24 determinants of this model exist in the studied context. We concluded that certain determinants can support or facilitate the adoption of methodologies like Scrum, while the use of Scrum may affect other determinants.

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

software teams
qualitative research
self-management