Computational depth: Concept and applications We introduce Computational Depth, a measure for the amount of "nonrandom" or "useful" information in a string by considering the difference of various Kolmogorov complexity measures. We investigate three instantiations of Computational Depth: center dot Basic Computational Depth, a clean notion capturing the spirit of Bennett's Logical Depth. We show that a Turing machine M runs in time polynomial on average over the time-bounded universal distribution if and only if for all inputs x, M uses time exponential in the basic computational depth of x. center dot Sublinear-time Computational Depth and the resulting concept of Shallow Sets, a generalization of sparse and random sets based on low depth properties of their characteristic sequences. We show that every computable set that is reducible to a shallow set has polynomial-size circuits. center dot Distinguishing Computational Depth, measuring when strings are easier to recognize than to produce. We show that if a Boolean formula has a nonnegligible fraction of its satisfying assignments with low depth, then we can find a satisfying assignment efficiently. (c) 2005 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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

structural complexity and average case complexity


Chinese social media analysis for disease surveillance It is reported that there are hundreds of thousands of deaths caused by seasonal flu all around the world every year. More other diseases such as chickenpox, malaria, etc. are also serious threats to peoples physical and mental health. There are 250,000500,000 deaths every year around the world. Therefore proper techniques for disease surveillance are highly demanded. Recently, social media analysis is regarded as an efficient way to achieve this goal, which is feasible since growing number of people have been posting their health information on social media such as blogs, personal websites, etc. Previous work on social media analysis mainly focused on English materials but hardly considered Chinese materials, which hinders the application of such technique to Chinese people. In this paper, we proposed a new method of Chinese social media analysis for disease surveillance. More specifically, we compared different kinds of methods in the process of classification and then proposed a new way to process Chinese text data. The Chinese Sina micro-blog data collected from September to December 2013 are used to validate the effectiveness of the proposed method. The results show that a high classification precision of 87.49% in average has been obtained. Comparing with the data from the authority, Chinese National Influenza Center, we can predict the outbreak time of flu 5days earlier.

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


What Makes an Autoantigen an Autoantigen? Abstract: Multiple classes of proteins are modified to tailor them for specific physiological roles. The nature of these posttranslational modifications of proteins, as well as the relationships between them including those of the immune system proteins themselves, and immune system responses are reviewed. Aspects of protein posttranslational modification and their relationship to the pathogenesis of several autoimmune diseases and primary biliary cirrhosis are highlighted.

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

posttranslational modification
immune system
primary biliary cirrhosis


Box-Tidwell transformation based partial least squares regression Partial least squares (PLS) is a powerful and frequently applied technique for process modelling and monitoring when the data is highly correlated. In this paper, a Box-Tidwell transformation based PLS (BTPLS) algorithm is proposed to address the modelling of non-linear systems. The BTPLS algorithm provides a family of flexible regression models for data fitting, where linear and quadratic PLS are special cases. BTPLS is shown to out-perform quadratic PLS, for non-linear problems, in terms of modelling ability and prediction accuracy, and neural network based PLS algorithms with respect to computational time and model parsimony in terms of the Bayesian information criterion. Linear PLS, quadratic PLS, neural network PLS and BTPLS are compared using a benchmark data set relating to the analysis of cosmetic data, a mathematical simulation and a highly non-linear pH problem. It is shown that the BTPLS algorithm provides a pragmatic compromize between model simplicity and accuracy, and constitutes a complementary modelling technique to both existing linear and non-linear PLS approaches. (C) 2001 Elsevier Science Ltd. All rights dreserved.

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

partial least squares regression
process modelling


an efficient two-dimensional layout compaction algorithm A new heuristic two-dimensional symbolic layout-compaction approach is developed. After conventional one-dimensional compaction steps, all the components on the critical paths that define the height or width of the given layout are found and rearranged to reduce the layout size. During this process, constraints in both x and y directions are considered and pitch-matching of ports for hierarchical compaction can be achieved to reduce the amount of the design data. This approach generated the smallest area for several examples we have tried when compared with other published results. The expected run time can be bounded by &Ogr;( T 1 ), where T 1 is the run time of a typical one-dimensional compactor.

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

examples size design layout data process algorithm

hierarchic efficiency compact matching direct timing heuristics critic constraint component


Multi-agent event recognition by preservation of spatiotemporal relationships between probabilistic models We present a new method for multi-agent activity analysis and recognition that uses low level motion features and exploits the inherent structure and recurrence of motion present in multi-agent activity scenarios. Our representation is inspired by the need to circumvent the difficult problem of tracking in multi-agent scenarios and the observation that for many visual multi-agent recognition tasks, the spatiotemporal description of events irrespective of agent identity is sufficient for activity classification. We begin by learning generative models describing motion induced by individual actors or groups, which are considered to be agents. These models are Gaussian mixture distributions learned by linking clusters of optical flow to obtain contiguous regions of locally coherent motion. These possibly overlapping regions or segments, known as motion patterns are then used to analyze a scene by estimating their spatial and temporal relationships. The geometric transformations between two patterns are obtained by iteratively warping one pattern onto another, whereas the temporal relationships are obtained from their relative times of occurrence within videos. These motion segments and their spatio-temporal relationships are represented as a graph, where the nodes are the statistical distributions, and the edges have geometric transformations between motion patterns transformed to Lie space, as their attributes. Two activity instances are then compared by estimating the cost of attributed inexact graph matching. We demonstrate the application of our framework in the analysis of American football plays, a typical multi-agent activity. The performance analysis of our method shows that it is feasible and easily generalizable. Published by Elsevier B.V.

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

multi-agent activity modeling and recognition


Acoustic Rendering and Auditory-Visual Cross-Modal Perception and Interaction In recent years research in the three-dimensional sound generation field has been primarily focussed upon new applications of spatialized sound. In the computer graphics community the use of such techniques is most commonly found being applied to virtual, immersive environments. However, the field is more varied and diverse than this and other research tackles the problem in a more complete, and computationally expensive manner. Furthermore, the simulation of light and sound wave propagation is still unachievable at a physically accurate spatio-temporal quality in real time. Although the Human Visual System (HVS) and the Human Auditory System (HAS) are exceptionally sophisticated, they also contain certain perceptional and attentional limitations. Researchers, in fields such as psychology, have been investigating these limitations for several years and have come up with findings which may be exploited in other fields. This paper provides a comprehensive overview of the major techniques for generating spatialized sound and, in addition, discusses perceptual and cross-modal influences to consider. We also describe current limitations and provide an in-depth look at the emerging topics in the field.

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

auralization
cross-modal interaction
attention


Visual object concept discovery: Observations in congenitally blind children, and a computational approach Over the course of the first few months of life, our brains accomplish a remarkable feat. They are able to interpret complex visual images so that instead of being just disconnected collections of colors and textures, they become meaningful sets of distinct objects. Exactly how this is accomplished is poorly understood. We approach this problem from both experimental and computational perspectives. On the experimental side, we have launched a new humanitarian and scientific initiative in India, called Project Prakash. This project involves a systematic study of the development of object-perception skills in children following recovery from congenital blindness. Here, we provide an overview of Project Prakash and also describe a specific study related to the development of face-perception skills following sight recovery. Based in part on the results of these experiments, we then develop a computational framework for addressing the problem of object concept discovery. Our model seeks to find repeated instances of a pattern in multiple training images. The source of complexity lies in the non-normalized nature of the inputs: the pattern is unconstrained in terms of where it can appear in the images, the background is complex and constitutes the overwhelming majority of the image, and the pattern can change significantly from one training instance to another. For the purpose of demonstration, we focus on human faces as the pattern of interest, and describe the sequence of steps through which the model is able to extract a face concept from non-normalized example images. Additionally, we test the model's robustness to degradations in the inputs. This is important to assess the model's congruence with developmental processes in human infancy, or following treatment for extended congenital blindness, when visual acuity is significantly compromised.

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

object concept learning
unsupervised learning
holistic object recognition
recovery from blindness
face detection


A Stochastic framework for rate-distortion optimized video coding over error-prone networks This paper proposes a complete stochastic framework for RD optimal encoder design for video over error-prone networks, which applies to any motion-compensated predictive video codec. The distortion measure has been taken as the mean square error over an ensemble of channels given an estimate of the instantaneous packet loss probability. We show that 1) the optimal motion compensated prediction, in the MSE sense, requires computation of the expected value of the reference frames, and 2) calculation of the MSE (distortion measure) requires computation of the second moment of the reference frames. We propose a recursive procedure for the computation of both the expected value and second moment of the reference frames, which are together called the stochastic frame buffer. Furthermore, we propose a stochastic RD optimization method for selection of the optimal macroblock mode and motion vectors given the instantaneous packet loss probability. If available, channel feedback can also be incorporated into the proposed stochastic framework. However, the proposed framework does not require a feedback channel to exist, and when it exists, it does not have to be lossless. In the absence of any packet losses, the proposed stochastic framework reduces to the well-known deterministic RD optimization procedures. One possible application of the optimal stochastic framework would be for multicast streaming to an ensemble of receivers. Experimental results indicate that the proposed framework outperforms other available error tracking and control schemes.

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

error analysis
error resilience
mean-square
error (mse) methods
rate distortion (rd) theory
stochastic frame buffers


Genetic algorithms for multiple multicast on WDM ring network The optimal multiple multicast problem (OMMP) on wavelength division multiplexing ring networks without wavelength conversion is considered in this paper. When the physical network and the set of multicast requests are given, OMMP is the problem that selects a suitable path or (paths) and wavelength (or wavelengths) among the many possible choices for each multicast request under the constraint that not any paths using the same wavelength pass through the same link such that the number of used wavelengths is minimized. This problem can be proven to be NP-hard. In the paper, a formulation of OMMP is given and several genetic algorithms (GAs) are proposed to solve it. Experimental results indicate that the proposed GAs are robust for this problem. (C) 2004 Elsevier B.V. All rights reserved.

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

genetic algorithm
multiple multicasts
wavelength division multiplexing rings
single-hop
drop and continuous


Delaunay Triangulations in O(sort(n)) Time and More We present several results about Delaunay triangulations (DTs) and convex hulls in transdichotomous and hereditary settings: (i) the DT of a planar point set can be computed in expected time O(sort(n)) on a word RAM, where sort(n) is the time to sort n numbers. We assume that the word RAM supports the shuffle operation in constant time; (ii) if we know the ordering of a planar point set in x-and in y-direction, its DT can be found by a randomized algebraic computation tree of expected linear depth; (iii) given a universe U of points in the plane, we construct a data structure D for Delaunay queries: for any P subset of U, D can find the DT of P in expected time O(vertical bar P vertical bar log log vertical bar U vertical bar); (iv) given a universe U of points in 3-space in general convex position, there is a data structure D for convex hull queries: for any P subset of U, D can find the convex hull of P in expected time O(vertical bar P vertical bar(log log vertical bar U vertical bar)(2)); (v) given a convex polytope in 3-space with n vertices which are colored with chi >= 2 colors, we can split it into the convex hulls of the individual color classes in expected time O(n(log log n)(2)). The results (i)-(iii) generalize to higher dimensions, where the expected running time now also depends on the complexity of the resulting DT. We need a wide range of techniques. Most prominently, we describe a reduction from DTs to nearest-neighbor graphs that relies on a new variant of randomized incremental constructions using dependent sampling.

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

algorithms
theory
delaunay triangulation


Stroke Nav: A wireless data collection and review system to support stroke care delivery Stroke Nav is a novel system to support the care of stroke patients. The system contains purpose-built web-based software to facilitate accurate near-real time data collection by clinicians throughout the complex care settings traversed by patients. Tools are included to facilitate pre-defined and bespoke data review with graphical dashboards showing performance metrics and other aggregate data. The software was designed collaboratively by health care professionals and engineers, and is accessible via the hospital intranet using desktop or laptop computers and wireless mobile devices. Stroke Nav is being routinely used in two hospitals, with over 1400 patients registered, and is now being introduced in other hospitals. The system is delivering benefits in relation to multidisciplinary communication, knowledge management, patient safety, clinical audit and service performance.

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


Area-I/O Flip-Chip Routing for Chip-Package Co-Design Considering Signal Skews The area-input/output (I/O) flip-chip package provides a high chip-density solution to the demand of more I/Os in very large scale integration designs; it can achieve smaller package size, shorter wirelength, and better signal and power integrity. In this paper, we introduce the routing problem for chip and package co-design and present the first work in the literature to handle the multiple re-distribution layer (RDL) routing problem (without RDL vias) for flip-chip designs, considering pin and layer assignment, signal integrity, signal-skew and total wirelength minimization, and chip-package co-design. Our router adopts a two-stage technique of global routing followed by RDL routing. The global routing assigns each block port to a unique bump pad via an I/O pad and decides the RDL routing among I/O pads and bump pads. Based on the minimum-cost maximum-flow algorithm, we can guarantee 100% RDL routing completion after the assignment and the optimal solution with the minimum wirelength. The RDL routing efficiently distributes the routing points between two adjacent bump pads and then generates a 100% routable sequence to complete the routing. Experimental results based on 12 industry designs demonstrate that our router can achieve 100% routability and the optimal routing wirelength under reasonable central processing unit times, while related works cannot.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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-Throughput Soft-Output MIMO Detector Based on Path-Preserving Trellis-Search Algorithm In this paper, we propose a novel path-preserving trellis-search (PPTS) algorithm and its high-speed VLSI architecture for soft-output multiple-input-multiple-output (MIMO) detection. We represent the search space of the MIMO signal with an unconstrained trellis, where each node in stage of the trellis maps to a possible complex-valued symbol transmitted by antenna. Based on the trellis model, we convert the soft-output MIMO detection problem into a multiple shortest paths problem subject to the constraint that every trellis node must be covered in this set of paths. The PPTS detector is guaranteed to have soft information for every possible symbol transmitted on every antenna so that the log-likelihood ratio (LLR) for each transmitted data bit can be more accurately formed. Simulation results show that the PPTS algorithm can achieve near-optimal error performance with a low search complexity. The PPTS algorithm is a hardware-friendly data-parallel algorithm because the search operations are evenly distributed among multiple trellis nodes for parallel processing. As a case study, we have designed and synthesized a fully-parallel systolic-array detector and two folded detectors for a 4 x 4 16-QAM system using a 1.08 V TSMC 65-nm CMOS technology. With a 1.18 mm(2) core area, the folded detector can achieve a throughput of 2.1 Gbps. With a 3.19 mm(2) core area, the fully-parallel systolic-array detector can achieve a throughput of 6.4 Gbps.

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

application-specific integrated circuit (asic)


Simulation of transient gas flow at pipe-to-pipe intersections We numerically investigate a well-established mathematical model for gas flow in pipeline networks. The emphasis is given to the description of coupling conditions at pipe-to-pipe intersections. The accurate prediction of these coupling conditions is essential in order to achieve good performance and reliable numerical simulations of network simulations. Nowadays, a variety of theoretical results for a reduced geometry exists. We conduct a numerical simulation of the two-dimensional representation at a pipe intersection. The results are used for verification and comparison with known theoretical results. High-order and non-oscillatory discretizations are used for solving the governing equations of gas flow. Verifications are conducted for two types of junctions to analyse the most adequate coupling conditions. Copyright (C) 2007 John Wiley & Sons, Ltd.

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

gas flow
coupling conditions
pipeline networks


learning to cluster web search results Organizing Web search results into clusters facilitates users' quick browsing through search results. Traditional clustering techniques are inadequate since they don't generate clusters with highly readable names. In this paper, we reformalize the clustering problem as a salient phrase ranking problem. Given a query and the ranked list of documents (typically a list of titles and snippets) returned by a certain Web search engine, our method first extracts and ranks salient phrases as candidate cluster names, based on a regression model learned from human labeled training data. The documents are assigned to relevant salient phrases to form candidate clusters, and the final clusters are generated by merging these candidate clusters. Experimental results verify our method's feasibility and effectiveness.

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

merging
training
web search
regression
method
users
human
data
learning
model
paper
search
query
ranking
cluster

organization
search result organization
experimentation
extraction
web search engine
document clustering
relevance
browse
documentation
regression analysis
effect


Can computed tomography classifications of chronic obstructive pulmonary disease be identified using Bayesian networks and clinical data? Diagnosis and classification of chronic obstructive pulmonary disease (COPD) may be seen as difficult. Causal reasoning can be used to relate clinical measurements with radiological representation of COPD phenotypes airways disease and emphysema. In this paper a causal probabilistic network was constructed that uses clinically available measurements to classify patients suffering from COPD into the main phenotypes airways disease and emphysema. The network grades the severity of disease and for emphysematous COPD, the type of bullae and its location central or peripheral. In four patient cases the network was shown to reach the same conclusion as was gained from the patients High Resolution Computed Tomography (HRCT) scans. These were: airways disease, emphysema with central small bullae, emphysema with central large bullae, and emphysema with peripheral bullae. The approach may be promising in targeting HRCT in COPD patients, assessing phenotypes of the disease and monitoring its progression using clinical data.

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

airflow limitation
pulmonary gas exchange
biomedical modeling


Spatio-temporal context for robust multitarget tracking In multitarget tracking, the main challenge is to maintain the correct identity of targets even under occlusions or when differences between the targets are small. The paper proposes a new approach to this problem by incorporating the context information. The context of a target in an image sequence has two components: the spatial context including the local background and nearby targets and the temporal context including all appearances of the targets that have been seen previously. The paper considers both aspects. We propose a new model for multitarget tracking based on the classification of each target against its spatial context. The tracker searches a region similar to the target while avoiding nearby targets. The temporal context is included by integrating the entire history of target appearance based on probabilistic principal component analysis (PPCA). We have developed a new incremental scheme that can learn the full set of PPCA parameters accurately online. The experiments show robust tracking performance under the condition of severe clutter, occlusions, and pose changes.

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

context-based tracking
probabilistic pca


Audio signal identification via pattern capture and template matching This research reports on a system able to classify different signals containing auditive information based on capture of small signal segments present in specific types of sound. After using a Haar wavelet transform at the preprocessing stage, a neural network known as the O-algorithm compares segments from candidate audio signals against predefined templates stored in the network. The classification performance is tested with three different applications.

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


enhancing web service selection by qos-based ontology and ws-policy The Service Oriented Architecture enables the development of flexible large scale-applications in open environments by dynamically combining Web services. Nevertheless, current techniques fail to address the problem of selecting adequate services to meet service consumer needs. Service selection must take into account non-functional parameters especially the Quality of Service (QoS). In this work we propose a Web service selection approach based on QoS attributes. We extend the WS-Policy to represent QoS policies. We apply ontological concepts to WS-policy in order to enable semantic matching. Publishing QoS policies is also examined in this work. We propose to extend the UDDI register to handle QoS-based policies.

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


understanding repair as a creative process of everyday design This paper presents the findings from an exploratory study that looks at how creativity plays a role in the repair and reuse of objects in the home. We are interested in a particular form of creativity that manifests in the everyday -- what John Dewey [8] describes as a constant doing and undergoing, as we actively adjust to everyday situations. The goal of this study is to show evidence of repair as not only an act of restoration, but also as an act of creativity that entails the repurposing and resourcing of objects. This study is part of a larger research initiative known as the Everyday Design, where it is believed that everyone is a designer and that design is an ongoing activity that includes the repair, modification, and appropriation of design objects and systems. Furthermore, this study serves as baseline research for future investigations in how to inform the design of technologies whose lifecycle can be extended for various contexts of use through repair.

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

appropriation
reuse
creativity
repair
everyday design


Exploiting the synergy between fractal dimension and lacunarity for improved texture recognition Fractal dimension measures the geometrical complexity of images. Lacunarity being a measure of spatial heterogeneity can be used to differentiate between images that have similar fractal dimensions but different appearances. This paper presents a method to combine fractal dimension (FD) and lacunarity for better texture recognition. For the estimation of the fractal dimension an improved algorithm is presented. This algorithm uses new box-counting measure based on the statistical distribution of the gray levels of the boxes. Also for the lacunarity estimation, new and faster gliding-box method is proposed, which utilizes summed area tables and LevenbergMarquardt method. Methods are tested using Brodatz texture database (complete set), a subset of the Oulu rotation invariant texture database (Brodatz subset), and UIUC texture database (partial). Results from the tests showed that combining fractal dimension and lacunarity can improve recognition of textures.

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

fractal dimension
lacunarity
texture recognition
levenbergmarquardt method


Fast algorithms for computing the tripartition-based distance between phylogenetic networks Consider two phylogenetic networks N and N' of size n. The tripartition-based distance finds the proportion of tripartitions which are not shared by N and N'. This distance is proposed by Moret et al. (2004) and is a generalization of Robinson-Foulds distance, which is orginally used to compare two phylogenetic trees. This paper gives an O(min{kn log n, n log n + hn})-time algorithm to compute this distance, where h is the number of hybrid nodes in N and N' while k is the maximum number of hybrid nodes among all biconnected components in N and N'. Note that k << h << n in a phylogenetic network. In addition, we propose algorithms for comparing galled-trees, which are an important, biological meaningful special case of phylogenetic network. We give an O(n)-time algorithm for comparing two galled-trees. We also give art O(n + kh)-time algorithm for comparing a galled-tree with another general network, where h and k are the number of hybrid nodes in the latter network and its biggest biconnected component respectively.

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


broad expertise retrieval in sparse data environments Expertise retrieval has been largely unexplored on data other than the W3C collection. At the same time, many intranets of universities and other knowledge-intensive organisations offer examples of relatively small but clean multilingual expertise data, covering broad ranges of expertise areas. We first present two main expertise retrieval tasks, along with a set of baseline approaches based on generative language modeling, aimed at finding expertise relations between topics and people. For our experimental evaluation, we introduce (and release) a new test set based on a crawl of a university site. Using this test set, we conduct two series of experiments. The first is aimed at determining the effectiveness of baseline expertise retrieval methods applied to the new test set. The second is aimed at assessing refined models that exploit characteristic features of the new test set, such as the organizational structure of the university, and the hierarchical structure of the topics in the test set. Expertise retrieval models are shown to be robust with respect to environments smaller than the W3C collection, and current techniques appear to be generalizable to other settings.

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

expertise search
intranet search
language models
expert finding


One-reversal counter machines and multihead automata: Revisited We investigate the power of (1-reversal) counter machines (finite automata with multiple counters, where each counter can "reverse" only once, i.e., once a counter decrements, it can no longer increment) and one-way multihead finite automata (finite automata with multiple one-way input heads) as a language acceptor. They can be non-deterministic as well as augmented with a pushdown stack. First, we prove that adding a pushdown stack properly strengthens the deterministic counter machines. Non-deterministic counter machines with a pushdown stack are then compared with multihead finite automata. The proof of their incomparability involves an interesting technique: an assumption that a language be accepted by a non-deterministic counter machine would bring a contradictory algorithm to decide an undecidable language. Furthermore, we will show that over bounded languages, these two kinds of machines have the same power, and neither non-determinism nor a pushdown stack makes them stronger. (C) 2012 Elsevier B.V. All rights reserved.

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

reversal-bounded counter machine
multihead automaton
bounded language
inclusion


abstracting remote object interaction in a peer-2-peer environment Leveraged by the success of applications aiming at the "free" sharing of data in the Internet, the paradigm of peer-to-peer (P2P) computing has been devoted substantial consideration recently.This paper presents an abstraction for remote object interaction in a P2P environment, called borrow/lend (BL). We present the principles underlying our BL abstraction, and its implementation in Java. We contrast our abstraction with established abstractions for distributed programming such as the remote method invocation or the tuple space, illustrating how the BL abstraction, obviously influenced by such predating abstractions, unifies flavors of these, but also how it captures the constraints specific to P2P environments.

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


A randomized approach with geometric constraints to fingerprint verification ? In this paper, a fuzzy bipartite weighted graph model is proposed to solve fingerprint verification problem. A fingerprint image is preprocessed first to form clusters of feature points, which are called feature point clusters. Twenty-four attributes are extracted for each feature point cluster. The attributes are characterized by fuzzy values. Attributes of an input image to be verified are considered as the set of left nodes in a fuzzy bipartite weighted graph, and the attributes of claimed template fingerprint image are considered as the set of right nodes in the graph. The fingerprint verification problem is thus converted into a fuzzy bipartite weighted graph matching problem. A matching algorithm is proposed for the fuzzy bipartite weighted graph model to find an optimal matching with a goodness score. Experimental results reveal the feasibility of the proposed approach in fingerprint verification.

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

fingerprint verification
bipartite weighted graph


A multiscale two-point flux-approximation method A large number of multiscale finite-volume methods have been developed over the past decade to compute conservative approximations to multiphase flow problems in heterogeneous porous media. In particular, several iterative and algebraic multiscale frameworks that seek to reduce the fine-scale residual towards machine precision have been presented. Common for all such methods is that they rely on a compatible primaldual coarse partition, which makes it challenging to extend them to stratigraphic and unstructured grids. Herein, we propose a general idea for how one can formulate multiscale finite-volume methods using only a primal coarse partition. To this end, we use two key ingredients that are computed numerically: (i) elementary functions that correspond to flow solutions used in transmissibility upscaling, and (ii) partition-of-unity functions used to combine elementary functions into basis functions. We exemplify the idea by deriving a multiscale two-point flux-approximation (MsTPFA) method, which is robust with regards to strong heterogeneities in the permeability field and can easily handle general grids with unstructured fine- and coarse-scale connections. The method can easily be adapted to arbitrary levels of coarsening, and can be used both as a standalone solver and as a preconditioner. Several numerical experiments are presented to demonstrate that the MsTPFA method can be used to solve elliptic pressure problems on a wide variety of geological models in a robust and efficient manner.

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

multiscale methods
iterative multiscale methods
prolongation operator
reservoir simulation


Multiperiod shunt capacitor allocation in radial distribution systems The capacitor allocation problem is solved for multi period. The model developed is dynamic in nature. It is beneficial to install capacitors stage wise as compared to single stage.

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


a computer-aided design data base The design and implementation of the data base structures of the Electro-Optical and Data Systems Group's (EDSG) Computer-Aided Design(CAD) system at Hughes Aircraft is introduced and discussed. The design is flexible, yet robust enough to support multiple CAD technologies and to afford easy integration of new capabilities. The current system structure and future plans are presented and discussed.

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

structure
capabilities
systems
technologies
data base
design
implementation
data
support
future
robust

computation flexibility optic group integrability


Design of fuzzy gain-scheduled robust controllers using Kharitonov's extremal gain margin theorem In this paper a novel fuzzy gain-scheduler is applied to linear plants the transfer functions of which consist of interval polynomials. The gain-scheduler performs an incremental tuning of the controller parameters employing a sliding-mode fuzzy control algorithm. The allowed ranges of variation of the controller gains are determined by using Kharitonov's Extremal Gain Margin Theorem. Sufficient conditions for the asymptotic stability of the closed-loop system are given. The validity of the method is verified via simulation tests.

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

fuzzy gain scheduling
sliding-mode fuzzy logic control
kharitonov's extremal gain theorem
lyapunov stability


Visual programming with analogical representations: Inspirations from a semiotic analysis of comics Analogical representations based on pictures of domain objects can be used in visual programming to provide a close mapping between the program and the resulting runtime display, which can make programming easier for children and other users. The use of graphical rewrite rules with before and after pictures is an example of this approach. Graphical rewrite rules have some similarities with comics strips, which also use picture sequences of graphical objects to describe dynamics in a static form. However, the visual language of comics is not used to its full potential in visual programming. We discuss how a semiotic analysis of comics can be used to address some of the limitations of graphical rewrite rules. We use a visual programming system we have designed to illustrate that comic strips can express more general computations and be more intuitive and flexible than traditional graphical rewrites. Our conclusion is that the visual language of comics has a strong potential for increasing the expressiveness and flexibility of visual programming with analogical representations of domain objects, while maintaining a direct mapping between the program representation and the runtime representation.

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

visual programming
comics
graphical rewrite rules
children


Applying ad-hoc global constraints with the case constraint to still-life The Still-Life problem is challenging for CP techniques because the basic constraints of the game of Life are loose and give poor propagation for Still-Life. In this paper, we show how ad hoc global case constraints can be customized to construct various models to provide much stronger propagation with CP solvers. Since we use custom ad hoc constraints of high arity where the number of tuples to define the constraint are large, the actual constraint representation becomes important to avoid excessive space consumption. We demonstrate how to use BDDs to construct good representations for the case constraint which is critical for efficiency. Our results seem comparable to hybrid CP/IP models even though we are only using propagation albeit on ad hoc global constraints. This paper shows an extensive example of how to systematically build models using different kinds of ad hoc constraints. It also demonstrates the solving potential of ad hoc global constraints.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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
binary decision diagram
still-life problem
ad-hoc constraint
non-binary constraint


On a family of interval estimators of effective doses The asymptotic confidence (delta) intervals and intervals based upon the use of Fiellers theorem for effective doses were compared with two new approaches by Huang et al. (J. Statist. Comput. Simulation 72 (2002) 565) in a simulation study for a logistic doseresponse curve. It was shown that these two novel approaches perform well to achieve a compromise between the conservative tendency of the Fieller interval and the liberalism often exhibited by the delta interval. Here attention is focused on the analytic comparison of the Fieller and delta intervals with one of two new methods, termed ? ? -interval, which includes the Fieller and delta intervals as special cases. The properties of this family of interval estimation methods are investigated, an analytical comparison of the various methods is provided and Sitter and Wus (J. Amer. Statist. Assoc. 88 (1993) 1021) analysis for explaining the difference in performance of the delta and Fieller intervals is extended to include the ? ? -interval based on simulation studies.

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


The landscape of research on smartphone medical apps: Coherent taxonomy, motivations, open challenges and recommendations Mapping the research landscape of smartphone medical apps into a coherent taxonomy. Figure out the motivation of using smartphone apps in medicine & healthcare. Highlight the open challenges that hinder the utility of medical apps. Recommendations Lists to improve the acceptance of medical apps in the literature.

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

medical and health apps
mobile health
survey


Paradoxical impact of asymmetric regulation in Taiwan's telecommunications industry: Restriction and rent seeking ? The mobile penetration rate in Taiwan has climbed from 6.86 to 112.15. Mobile phone accounts per 100 capita in the first 6 years of market competition, during this time the state-owned incumbent Chunghua Telecom has been dethroned by a new entrant, Taiwan Cellular Corp. This paper addresses the cause of Taiwan's unprecedented mobile growth, and provides policy solutions for countries that strive to improve their telecommunications sectors in a short time scale. The authors highlight the fundamental role of asymmetric regulation, rather than pure liberalization, in the creation of the deregulated telecommunications industry in Taiwan. The asymmetric regulation in Taiwan is manifested in a twofold framework: the dominant carrier vs. competitors, and the fixed-line carrier vs. mobile companies. Econometric analysis concludes that dualistic asymmetric regulation leads to higher growth for mobile competitors and raises the total mobile penetration rate. However, the authors warn against the paradoxical consequences of dualistic asymmetric regulation. The regulatory benefits which mobile entrants received evolved into rents when they successfully lobbied to end the follow-me call service, the pricing scheme of which contradicts the asymmetric revenue-sharing constraint. The paper calls for a sunset clause for dualistic asymmetric regulation in order to take full advantage of its strengths, while at the same time preventing rent seeking by the firms, which benefit.

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

regulatory asymmetry
revenue-sharing constraint
contractarian approach
regulatory costs


NDNBrowser: An extended web browser for named data networking Supporting browser-based web applications is vital to Named Data Networking. The first practical NDN-enabled Web browser (i.e. NDNBrowser) is presented. NDNbrowser considers backwards compatibility and smooth network evolution. A real NDN-based web application is deployed on a NDN experimental network. NDNBrowser outperforms existing NDN.JS and HTTP/NDN proxy approaches.

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

ccnx
webkit
web application architecture
future internet


DiPCA-Cluster: An optimal alternative to DiPLS-Cluster for unsupervised classification Unsupervised cluster analysis is frequently used to explore the structure of large datasets. This paper introduces a new method, DiPCA_Cluster, which is an optimal alternative to DiPLS_Cluster with two additional refinements. Indeed, DiPLS_Cluster is not optimal as it does not converge to a unique solution (it depends on the algorithm initialization) and moreover, provides dendrograms which are not very meaningful. The method proposed in this paper, DiPCA_Cluster is optimal with regards to the chosen criterion, inertia. Furthermore, at each step of the analysis, the data have to be split into two groups thanks to the values of a 0/1 vector. In our method, unlike DiPLS_Cluster, this split is based on the use of a threshold value which is more in accordance with the general problem, in this goal, two proposals are suggested. Finally, whereas DiPLS_Cluster set up the dendrogram by using the number of iterations, DiPCA_Cluster uses the total variance explained by each principal component within each group which is more justified and which allows to find out dendrograms very close to the ones provided by Ward criterion. (c) 2007 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Peer-to-peer information retrieval using shared-content clustering Peer-to-peer (p2p) networks are used by millions for searching and downloading content. Recently, clustering algorithms were shown to be useful for helping users find content in large networks. Yet, many of these algorithms overlook the fact that p2p networks follow graph models with a power-law node degree distribution. This paper studies the obtained clusters when applying clustering algorithms on power-law graphs and their applicability for finding content. Driven by the observed deficiencies, a simple yet efficient clustering algorithm is proposed, which targets a relaxed optimization of a minimal distance distribution of each cluster with a size balancing scheme. A comparative analysis using a song-similarity graph collected from 1.2 million Gnutella users reveals that commonly used efficiency measures often overlook search and recommendation applicability issues and provide the wrong impression that the resulting clusters are well suited for these tasks. We show that the proposed algorithm performs well on various measures that are well suited for the domain.

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

peer-to-peer
data mining
recommender systems


The LTOPSIS: An alternative to TOPSIS decision-making approach for linguistic variables This paper develops an evaluation approach based on the Technique for Order Performance by Similarity to Ideal Solution (TOPSIS). When the input for a decision process is linguistic, it can be understood that the output should also be linguistic. For that reason, in this paper we propose a modification of the TOPSIS algorithm which develops the above idea and which can also be used as a linguistic classifier. In this new development, modifications to the classic algorithm have been considered which enable linguistic outputs and which can be checked through the inclusion of an applied example to demonstrate the goodness of the new model proposed.

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


Effect of titanium dioxide (TiO2) seed layer on the phase composition of 0.7Pb (Mg1/3Nb2/3)O30.3PbTiO3 film prepared by pulsed laser deposition Leadmagnesium niobatelead titanate (PMNPT) thin films with and without the TiO2 seed layer were deposited on Pt/Ti/SiO2/Si substrates through pulsed laser deposition. The study aimed to characterize the effect of the TiO2 seed layer on the phase composition and properties of PMNPT film. Without the TiO2 seed layer, the pure perovskite phase could be obtained in the thinner PMNPT film while with the TiO2 seed layer, the pure perovskite phase was formed in the thicker PMNPT film. The ferroelectric properties of PMNPT films with the TiO2 seed layer were exhibited. As a result, the maximum amount of remnant polarization reached the amount of 32?C/cm2 for the PMNPT thin film with the TiO2 seed layer.

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

pmnpt film
tio2 seed layer
perovskite phase
remnant polarization


A hybrid self-adaptive bees algorithm for examination timetabling problems Disruptive selection strategy to select the solution from the population to improve the diversity of the population. Self-adaptive strategy for directing the neighbourhood search to enhance the local intensification capability. Modified bees algorithm is combined with late acceptance hill climbing to quickly descend to the optimum solution.

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

bees algorithm
examination timetabling problems
selection strategy

late acceptance hill climbing algorithm
self-adaptive mechanism
simulated annealing algorithm


Evaluation of alternatives for product customization using fuzzy logic Many consumers purchase multi-functional products according to their individual preferences. Consumers are normally aware of their basic needs, but often have no idea of product types, functions, usage and terminology showing important information. This paper presents a method to translate customer needs into applicable alternative combinations for the products of customers desire. In this research, the theory of the analytic hierarchy process is utilized to evaluate the importance of customer needs, which are generally rated and described by qualitative expressions. A fuzzy inference model is employed to establish the relationship between customer needs and alternatives for a multi-functional product. Then a fuzzy synthetic distance method is used to perform optimal searching for possible alternative combinations in the product. Based on the above-mentioned methods and associated algorithms, a consultative interface is setup on the Internet for a case study to demonstrate effectiveness. Although a baby stroller is taken as an example in this study, this method can also be used on other products.

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

customer needs
alternatives
analytic hierarchy process
fuzzy
internet


The concept and impact analysis of a flexible mobility on demand system We introduce an innovative transportation system, FMOD. The modeling framework integrates scheduling, routing and assortment optimization. The trade-off between consumer surplus and operator's profit is considered. The impact of the FMOD system is analyzed with simulation experiments. Assortment optimization and dynamic allocation provide significant benefits.

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

demand responsive transit
flexible transportation services
personalized transportation services
shared-taxi
shared-ride


Finding a form to hold the act of queuing In this paper, we present an initial appliance idea that is to reflect the practice of queuing. This is to enable exploration on how the act of queuing might evolve with new appliances and experiences. Based on the notion that a good appliance is one with limited functionality, we have worked on a limited number of excerpts from the act of queuing. By using interactional features from the field as material for design, these features are formed into the Queuing Display, which reflects issues on queuing as such.

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

interactional features
the act of queuing


A neuro-fuzzy method to learn fuzzy classification rules from data Neuro-fuzzy systems have recently gained a lot of interest in research and application. Neuro-fuzzy models as we understand them are fuzzy systems that use local learning strategies to learn fuzzy sets and fuzzy rules. Neuro-fuzzy techniques have been developed to support the development of e.g. fuzzy controllers and fuzzy classifiers. In this paper we discuss a learning method for fuzzy classification rules. The learning algorithm is a simple heuristics that is able to derive fuzzy rules from a set of training data very quickly, and tunes them by modifying parameters of membership functions. Our approach is based on NEFCLASS, a neuro-fuzzy model for pattern classification. We also discuss some results obtained by our software implementation of NEFCLASS, which is freely available on the Internet. (C) 1997 Elsevier Science B.V.

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


interacting with audio streams for entertainment and communication We present a new model of interactive audio for entertainment and communication. A new device called the DJammer and its associated technologies are described. The DJammer introduces the idea of provisioning mobile users to interact cooperatively with digital audio streams. Users can augment the audio in real time and communicate the result in several ways resulting in a new form of multimedia communication across diverse devices and multiple networks. This paper describes the technologies incorporated into the DJammer, and discusses the actual implementation of the prototype DJammer. Future enhancements are also described.

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

rich media
distributed systems
connectivity
peer-to-peer
network aggregation
mobility
digital content
distributed multimedia communication
context awareness


Easy composition of symbolic computation software using SCSCP: A new Lingua Franca for symbolic computation We present the results of the first four years of the European research project SCIEnce Symbolic Computation Infrastructure in Europe (http://www.symbolic-computing.org), which aims to provide key infrastructure for symbolic computation research. A primary outcome of the project is that we have developed a new way of combining computer algebra systems using the Symbolic Computation Software Composability Protocol (SCSCP), in which both protocol messages and data are encoded in the OpenMath format. We describe the SCSCP middleware and APIs, outline implementations for various Computer Algebra Systems (CAS), and show how SCSCP-compliant components may be combined to solve scientific problems that cannot be solved within a single CAS, or may be organised into a system for distributed parallel computations. Additionally, we present several domain-specific parallel skeletons that capture commonly used symbolic computations. To ease use and to maximise inter-operability, these skeletons themselves are provided as SCSCP services and take SCSCP services as arguments. (C) 2012 Elsevier Ltd. All rights reserved.

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

interface coordination parallelism symgrid-par cash


perspectives of delegation in team-based distributed software development over the geni infrastructure (nier track) Team-based distributed software development (TBDSD) is one of the single biggest challenges facing software companies. The need to manage development efforts and resources in different locations increase the complexity and cost of modern day software development. Current software development environments do not provide suitable support to delegate task among teams with appropriate directives. TBDSD is also limited to the current internet capabilities. One of the resulting problems is the difficulty to delegate and control tasks assigned among remote teams. This paper proposes (1) a new framework for delegation in TBDSD, and (2) perspectives for deploying Process-centered Software Engineering Environments (PSEE) over the Global Environment for Network Innovations (GENI) infrastructure. GENI, the 'future Internet' that is taking shape in prototypes across the US, will allow, in the context of our study, to securely access and share software artifacts, resources, and tools as never before seen over the current Internet.

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

delegation
distributed software development
geni


Multiview 3D reconstruction of the archaeological site at Weymouth from image series Multiview (n-view or multiple view) 3D reconstruction is the computationally complex process by which a full 3D model is derived from a series of overlapping images. It is based on research in the field of computer vision, which in turn relies on older methods from photogrammetry. This report presents a multiview reconstruction tool chain composed from various freely available, open source components and a practical application example in the form of a 3D model of an archaeological site.

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

computer vision
photogrammetry
3d reconstruction
open source
weymouth


List injective coloring of planar graphs with girth 5, 6, 8 ? A vertex coloring of a graph G G is called injective if any two vertices with a common neighbor receive distinct colors. Let ?i(G) ? i ( G ) , ? i l ( G ) be the injective chromatic number and injective choosability number of G G , respectively. Suppose that G G is a planar graph with maximum degree ? ? and girth g g . We show that (1) if g?5 g ? 5 then ? i l ( G ) ? ? + 7 for any ? ? , and ? i l ( G ) ? ? + 4 if ??13 ? ? 13 ; (2) ? i l ( G ) ? ? + 2 if g?6 g ? 6 and ??8 ? ? 8 ; (3) ? i l ( G ) ? ? + 1 if g?8 g ? 8 and ??5 ? ? 5 .

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

planar graphs
girth
list injective coloring


Graph-theoretic formalization of hybridization in DNA sticker complexes Sticker complexes are a formal graph-based data model for a restricted class of DNA complexes, motivated by potential applications to databases. This data model allows for a purely declarative definition of hybridization. We introduce the notion of terminating hybridization, which intuitively means that only a finite number of different products can be generated. We characterize this notion in purely graph-theoretic terms. Under a finite alphabet, each product is shown to be of polynomial size. Yet, terminating hybridization can still produce results of exponential size, in that there may be exponentially many different (nonisomorphic) finished products. We indicate a class of complexes where hybridization is guaranteed to be polynomially bounded.

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


Applying data mining to telecom chum management Taiwan deregulated its wireless telecommunication services in 1997. Fierce competition followed, and chum management becomes a major focus of mobile operators to retain subscribers via satisfying their needs under resource constraints. One of the challenges is chumer prediction. Through empirical evaluation, this study compares various data mining techniques that can assign a 'propensity-to-chum' score periodically to each subscriber of a mobile operator. The results indicate that both decision tree and neural network techniques can deliver accurate chum prediction models by using customer demographics, billing information, contract/service status, call detail records, and service change log. (c) 2005 Elsevier Ltd. All rights reserved.

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

chum management
wireless telecommunication
data mining
decision tree
neural network


Highly discriminative statistical features for email classification This paper reports on email classification and filtering, more specifically on spam versus ham and phishing versus spam classification, based on content features. We test the validity of several novel statistical feature extraction methods. The methods rely on dimensionality reduction in order to retain the most informative and discriminative features. We successfully test our methods under two schemas. The first one is a classic classification scenario using a 10-fold cross-validation technique for several corpora, including four ground truth standard corpora: Ling-Spam, SpamAssassin, PU1, and a subset of the TREC 2007 spam corpus, and one proprietary corpus. In the second schema, we test the anticipatory properties of our extracted features and classification models with two proprietary datasets, formed by phishing and spam emails sorted by date, and with the public TREC 2007 spam corpus. The contributions of our work are an exhaustive comparison of several feature selection and extraction methods in the frame of email classification on different benchmarking corpora, and the evidence that especially the technique of biased discriminant analysis offers better discriminative features for the classification, gives stable classification results notwithstanding the amount of features chosen, and robustly retains their discriminative value over time and data setups. These findings are especially useful in a commercial setting, where short profile rules are built based on a limited number of features for filtering emails.

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

dimensionality reduction
email classification
feature extraction
feature selection


Rough milling optimisation for parts with sculptured surfaces using genetic algorithms in a Stackelberg game In rough milling of sculptured surface parts, decisions on process parameters concern feedrate, spindle speed, cutting speed, width of cut, raster pattern angle and number of machining slices of variable thickness. In this paper three rough milling objectives are considered: minimum machining time, maximum removed material and maximum uniformity of the remaining volume at the end of roughing. Owing to the complexity of the modelled problem and the large number of parameters, typical genetic algorithms cannot achieve global optima without defining case-dependent constraints. Therefore, to achieve generality, a hierarchical game similar to a Stackelberg game is implemented in which a typical Genetic Algorithm functions as the leader and micro-Genetic Algorithms as followers. In this game, one of the leader's parameters is responsible for creating a follower's population and for triggering the optimisation. After properly weighing the three objectives, the follower performs single-objective optimization in steps and feeds the leader back with the objective values as they appear prior to weighing. Micro-Genetic Algorithm (follower) chromosome consists of the distribution of machining slice thickness, while the typical Genetic Algorithm (leader) consists of the milling parameters. The methodology is tested on sculptured surface parts with different properties, and a representative case is presented here.

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

genetic algorithms
microgenetic algorithms
optimisation


Integrated product and process design: a multi-objective modeling framework In this paper we present an analytical multi-objective framework for the concurrent design of product and processes. The objective is to simultaneously consider the tolerance specification on the product or the component dimensions along with the selection of the manufacturing processes. For this purpose we consider three objectives: to minimize unit cost, to minimize quality loss and to minimize manufacturing lead time. We characterize the properties of the non-dominated solutions. These solutions provide flexibility needed in an agile manufacturing environment. The minmax approach is used to obtain trade-off solutions.

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

design for manufacturing system
tolerance design
concurrent engineering
quality engineering
concurrent product and process design


A land-use systems approach to represent land-use dynamics at continental and global scales Most of the current global land cover datasets and global scale land-use models use a classification of land cover based on the dominant land cover type within a distinct region or pixel. Such a classification disregards the diversity and intensity of human influence on land systems. In this paper we propose a novel way of classification and modeling land-use using a classification based on land-use systems (LUSs) that represent specific combinations of human-environment interactions. A cluster analysis was used to identify and map these LUSs. The analysis accounted for population density, accessibility to market places, land-use/cover types and livestock densities. A conceptual framework was developed to model dynamics in LUSs accounting for both land cover and land management changes. LUSs changes were simulated based on changes in both local socio-economic and biophysical conditions and regional-scale changes in demand for agricultural products. The new land-use systems change model was used in the context of the integrated assessment model IMAGE.

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

land-use change
land-use systems
land-use intensification


Using Mobile TLA as a Logic for Dynamic I/O Automata Input/Output (I/O) automata and the Temporal Logic of Actions (TLA) are two well-known techniques for the specification and verification of concurrent systems. Over the past few years, they have been extended to the so-called dynamic I/O automata and, respectively, Mobile TLA (MTLA) in order to be more appropriate for mobile agent systems. Dynamic I/O automata is just a mathematical model, whereas MTLA is a logic with a formally defined language. In this paper, therefore, we investigate how MTLA could be used as a formal language for the specification of dynamic I/O automata. We do this by writing an MTLA specification of a travel agent system which has been specified semi-formally in the literature on that model. in this specification, we deal with always existing agents as well as with an initially unknown number of dynamically created agents, with mobile and non-mobile agents, with I/O-automata-style communication, and with the changing communication capabilities of mobile agents. We have previously written a TLA specification of this system. This paper shows that an MTLA specification of such a system can be more elegant and faithful to the dynamic I/O automata definition because the agent existence and location can be expressed directly by using agent and location names instead of special variables as in TLA. It also shows how the reuse of names for dynamically created and destroyed agents within the dynamic I/O automata framework can be specified in MTLA.

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

dynamic input/output automata
mobile agent system
formal specification
spatio-temporal logic


TECHNOLOGY-ENABLED RETAIL SERVICES AND ONLINE SALES PERFORMANCE Drawing on the past literature on four retail service areas: content management, customer management, multi-channel management, and visitor traffic management, this research offers an empirical analysis of the relationships between these four service areas and the online sales performance of Web retailers. Using data from an independent source on the profiles as well as operational and sales performances of the top-ranked Web retailers, we map the retailers' online features into a unified conceptual framework that incorporates the above four broad areas, and empirically study their direct implications on online sales performance. The results show that the retailers' efforts in content, customer, and multi-channel management features have a significant positive impact on their online sales. However, while retailers expend considerable efforts on attracting visitors to their retail Web sites, our result is inconclusive regarding whether or not the visitor traffic management features have an impact on retailers' sales performance.

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

web retailing
e-services
it-enabled services
e-commerce services
web functionalities
e-tailing best practices


Evaluating biometrics for online banking: The case for usability Rising cyber-crimes have heightened existing concerns about e-banking security. However currently the use of biometric technology in the banking sector is not prevalent. We developed a biometric system for authenticating e-banking and applied the established System Usability Scale (SUS) to evaluate its effectiveness from the perspective of potential users. The case demonstrates that on the whole users are very favourable towards a biometric banking system and ostensibly found the system developed usable. We found that when evaluating the biometric system, its different components needed to be considered namely the biometric technology and the institutional process that supports verification and authentication.

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

e-banking
biometric banking (b-banking)
system usability scale (sus)


POMDPs under probabilistic semantics ? ?? We consider partially observable Markov decision processes (POMDPs) with limit-average payoff, where a reward value in the interval [0,1] [ 0 , 1 ] is associated with every transition, and the payoff of an infinite path is the long-run average of the rewards. We consider two types of path constraints: (i) a quantitative constraint defines the set of paths where the payoff is at least a given threshold ?1?(0,1] ? 1 ? ( 0 , 1 ] ; and (ii) a qualitative constraint which is a special case of the quantitative constraint with ?1=1 ? 1 = 1 . We consider the computation of the almost-sure winning set, where the controller needs to ensure that the path constraint is satisfied with probability 1. Our main results for qualitative path constraints are as follows: (i) the problem of deciding the existence of a finite-memory controller is EXPTIME-complete; and (ii) the problem of deciding the existence of an infinite-memory controller is undecidable. For quantitative path constraints we show that the problem of deciding the existence of a finite-memory controller is undecidable. We also present a prototype implementation of our EXPTIME algorithm and experimental results on several examples.

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

limit-average objectives
almost-sure winning


Open access: the ideal and the real Open access would allow ISPs to use a cable operator's broadband connection under regulated terms and conditions. Advocates stress the desirability of an end-to-end architecture for the Internet and the danger that cable operators will use their control over the last mile to limit consumer choice and stifle innovation. Opponents contend that wholesale price controls and other regulatory burdens under what they term forced access would in fact slow down the deployment of broadband, stifle innovation and harm consumers. The fears of open access advocates seem largely speculative at this point. Evidence from related policies also favors the opponents. Closed cable systems are beating their open DSL competitors in the market place; analogous regulation of cable TV did not serve consumers well; and forced unbundling of local service has been controversial and largely ineffective. In addition, relevant technology stocks declined in price with political and legal victories for open access and increased when it suffered setbacks.

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


a knowledge processing oriented life cycle study from a digital museum system Traditional Digital Museum systems focus on a single function of organizing exhibitions and their design patterns are based on respective exhibiting items. Their life cycles are straight for warding, lacking in feedback and nonreusable. Little attention is paid on manage knowledge processing within a life cycle. Modern Digital Museums must deal with exponentially increasing information and provide integrated functions for digital appreciation, e-learning and relevant research. These needs require the objects in a Digital Museum system to be highly abstract and its life cycle to be iterative and reusable. Systematically integrated knowledge processing procedures become absolutely necessary for handling the information system in the Digital Museum. This article throws light on a new life cycle of modern Digital Museum systems. Knowledge Flow is a highly abstracted object from all information streams throughout a Digital Museum life cycle. Encircling knowledge flow, this particular life cycle presents a multidimensional fountain-like model with defined milestones. Knowledge processing procedures in this life cycle are well divided into hierarchies, with different emphases on each dimension. This article also provides a knowledge-based software engineering approach to integrate the scattered knowledge processing procedures systematically and reusable.

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

knowledge flow
digital museum
life cycle

e-learning
fountain model
knowledge mining
knowledge management


bias-free hypothesis evaluation in multirelational domains In propositional domains, using a separate test set via random sampling or cross validation is generally considered to be an unbiased estimator of true error. In multirelational domains, previous work has already noted that linkage of objects may cause these procedures to be biased, and has proposed corrected sampling procedures. However, as we show in this paper, the existing procedures only address one particular case of bias introduced by linkage. We recall that in the propositional case cross validation measures off-training set (OTS) error and not true error and illustrate the difference with a small experiment. In the multirelational case, we show that the distinction between training and test set needs to be carefully extended based on a graph of potentially linked objects, and on their assumed probabilities of reoccurrence. We demonstrate that the bias due to linkage to known objects varies with the chosen proportion of the training/test split and present an algorithm, generalized subgraph sampling , that is guaranteed to avoid bias in the test set for more generalized cases.

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

multirelational learning
error estimation


REMOTE SCALABLE ENTANGLING OF SYMMETRIC DICKE STATES Symmetric Dicke states are a generalization of W-states that display interesting properties. These properties enable one to generate arbitrarily large symmetric Dicke states using operations on finite (2k) number of qubits. This paper formulates explicitly some basic results needed for this purpose. These results are synthesized into a generic Scalable Entangling Protocol. Examples are provided to illustrate the approach generality. A concomitant graphical representation allows fast comprehension of the protocol inputs, operations and outcomes.

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

scalable protocol
distributed systems
multiparty
ancillary states
ad-hoc networks


Catastrophic senescence of the Pacific salmon without mutation-accumulation We derive catastrophic senescence of the Pacific salmon from an aging model which was recently proposed by Stauffer. The model is based on the postulates of a minimum reproduction age and a maximal genetic lifespan. It allows for self-organization of a typical age of first reproduction and a typical age of death. Our Monte Carlo simulations of the population dynamics show that the model leads to catastrophic senescence for semelparous reproduction as it occurs in the case of salmon, to a more gradually increase of senescence for iteroparous reproduction.

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


On the optimal robot routing problem in wireless sensor networks Given a set of sparsely distributed sensors in the euclidean plane, a mobile robot is required to visit all sensors to download the data and finally return to its base. The effective range of each sensor is specified by a disk, and the robot must at least reach the boundary to start communication. The primary goal of optimization in this scenario is to minimize the traveling distance by the robot. This problem can be regarded as a special case of the Traveling Salesman Problem with Neighborhoods (TSPN), which is known to be NP-hard. In this paper, we present a novel TSPN algorithm for this class of TSPN, which can yield significantly improved results compared to the latest approximation algorithm.

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

global optimization
heuristic algorithms


artificial neural network design for behaviours of reinforced concrete column under axial load and comparison of experimental study Construction (building) sector is one of the sectors which adapt the rapid development of the technology. Especially in frame (skeleton) systems, very serious studies on columns that are vertical conveyors (carriers) are being done. Generally, these studies are implemented by experimentally and computer software is used in these studies as they offer good results. Artificial neural network (ANN) has been used in several engineering application areas including civil engineering. The use of ANN to predict the behaviour of reinforced concrete (R/C) members, using the vast amount of experimental data as a test-bed for learning and verification of results, proved to be available method for carrying out parametric studies. In the present study, columns under the axial load were manufactured from concrete that has been produced without carrying out the standards. Load conveying capacities and tension-unit deformation relationships of columns manufactured with different geometrical and equipment (outfit) properties and same cross-section area have been investigated. At the same time, research has been done via modelling by using ANN that is one of techniques of artificial intelligence and gained importance in recent years. SPSS statistical packet program is used to evaluate the results of this research. After comparisons of results obtained in the experiments, it has been determined that square column samples have the most axial load conveying capacity. It has also been determined that number of displacement is less in samples of columns wrapped (winded) with fret comparing to samples of columns wrapped with stirrup. The same results are obtained after modelling by ANN. As the result of statistical analyses that have been done in \%5 reliability interval between data obtained from experiments and ANN, it has been seen that ANN can be used as reliable method.

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

columns
artificial neural network
displacement
axial load
concrete


Presence, workload and performance effects of synthetic environment design factors There remains a limited understanding of factors in presence and its relation to performance. This research examined a range of synthetic environment (SE) design features (viewpoint, auditory cue type and visual background) suspected to influence presence, and evaluated differences in presence, workload and task performance caused by manipulations of the factors and task difficulty in a virtual-reality-based basketball free-throw task. Thirty-two research participants were also required to perform secondary-monitoring tasks to assess attention allocation to the virtual and (surrounding) real environments, as an indicator of presence. Analysis of variance results demonstrated immersiveness (viewpoint) and auditory cue type to significantly influence the sense of subjective presence and perceptions of workload. Virtual task performance was significantly affected by task difficultly. This study also provided further evidence of significant positive relations between presence and workload, but no evidence of a correlation of objective presence and performance. These results have general applicability for the design of multimodal SE-based interfaces for real-world tasks, such as telerobot control.

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

virtual reality
multimodal display design
secondary-task performance


Optimized design of a digital I/Q demodulator suitable for adaptive pre-distortion of 3rd generation base station PAs This article presents an optimized design of a high-speed digital I/Q demodulator intended for the implementation of the feedback path of an adaptive base band digital pre-distorter (DPD). Indeed, the optimization of the DPD linearization capability, in terms of correction bandwidth and nonlinearity effects minimization, is directly related to the accuracy and speed of the I/Q demodulator. In this work, a digital I/Q demodulator is designed, optimized and implemented in a Xilinx FPGA device. This allowed for high-speed processing of about 200 MHz with a substantial reduction in the FPGA used gates.

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

hpa
i/q demodulator
fractional resampler