An efficient Dynamic Addressing based routing protocol for Underwater Wireless Sensor Networks Underwater Wireless Sensor Networks (UWSNs) are different in many aspects as compared to terrestrial sensor networks. Other than long propagation delays and high error probability, continuous node movement makes it hard to manage the location information of sensor nodes. Determining the location of every node is a major issue as nodes can move continuously with the water currents. In order to handle the problem of large propagation delays and unreliable link quality, many algorithms have been proposed and some of them provide good solutions for these issues, but continuous node movements still need attention. In order to handle the problem of node mobility, we proposed a Hop-by-Flop Dynamic Addressing Based (H2-DAB) routing protocol, where every node in the network will be assigned a routable address in a quick and efficient way without requiring an explicit configuration or any dimensional location information. It helps to provide an option where nodes can communicate without any centralized infrastructure, also a mechanism is available where nodes can come and leave the network without having any serious effect on the rest of the network. Simulation results show that H2-DAB can manage easily during the quick routing changes where node movements are very frequent yet require little or no overhead in order to complete its tasks. (C) 2011 Elsevier B.V. All rights reserved.

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

courier nodes
s-hopid
c-hopid
underwater sensor networks (usns)


EFFICIENT ABSTRACTION SELECTION IN REINFORCEMENT LEARNING This article addresses reinforcement learning problems based on factored Markov decision processes (MDPs) in which the agent must choose among a set of candidate abstractions, each build up from a different combination of state components. We present and evaluate a new approach that can perform effective abstraction selection that is more resource-efficient and/or more general than existing approaches. The core of the approach is to make selection of an abstraction part of the learning agent's decision-making process by augmenting the agent's action space with internal actions that select the abstraction it uses. We prove that under certain conditions this approach results in a derived MDP whose solution yields both the optimal abstraction for the original MDP and the optimal policy under that abstraction. We examine our approach in three domains of increasing complexity: contextual bandit problems, episodic MDPs, and general MDPs with context-specific structure. 2013 Wiley Periodicals, Inc.

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

reinforcement learning
abstraction selection


Potential error factors in 1D beam FE modeling for the early stage vehicle design Systematic study of the error factors in 1D beam concept modeling for the vehicle structure. Research on beam spot welds, flanges and discontinuities, cross-section geometry and deformations. Introduction of a novel cross-section deformation measure. Derivation of guidelines on good modeling practices to improve the concept stage. Successful application of the methodology to a couple of industrial case-studies.

O O O O B I O O O O O O O O O O O O O O O B I O O O O B I O O O O O O O O O O O O O O O O O O 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 study on traffic signal control at signalized intersections in vehicular ad hoc networks The Seoul metropolitan government has been operating a traffic signal control system with the name of COSMOS (Cycle, Offset, Split MOdel for Seoul) since 2001. COSMOS analyzes the degrees of saturation and congestion which are calculated by installing loop detectors. At present, subterranean inductive loop detectors are generally used for detecting vehicles but their maintenance is inconvenient and costly. In addition, the estimated queue length might be influenced by errors in measuring speed, because the detectors only consider the speed of passing vehicles. Instead, we proposed a traffic signal control algorithm which enables smooth traffic flow at intersections. The proposed algorithm assigns vehicles to the group of each lane and calculates traffic volume and congestion degree using the traffic information of each group through inter-vehicle communication in Vehicular Ad-hoc Networks (VANETs). This does not require the installation of additional devices such as cameras, sensors or image processing units. In this paper, the algorithm we suggest is verified for AJWT (Average Junction Waiting Time) and TQL (Total Queue Length) under a single intersection model based on the GLD (Green Light District) simulator. The results are better than random control method and best-first control method. For a generalization of the real-time control method with VANETs, this research suggests that the technology of traffic control in signalized intersections using wireless communication will be highly useful.

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

vanets
signalized intersections
queue length


EM-simulation of planar inductor performance for epitaxial silicon processes We used a 2.5D EM-simulator to study planar inductor performance in a submicron CMOS technology. We found good agreement between simulations and measurements using only the nominal process parameters for the layer thicknesses, permittivities, and conductivities. By sweeping the thickness and conductivity of the epitaxial layer we show how these parameters affect inductor performance. The presence of a highly conductive substrate layer is shown to have a detrimental effect on inductor performance whereas the thickness and conductivity of the epitaxial layer is less important.

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

electro-magnetic simulation
quality factor


A new transform coder for gray scale images using 44 4 4 MRT The demand for high-speed transmission of best quality images over the internet has led to a strong need for the development of better algorithm for coding images. The transform coders are highly popular in encoding images. M-dimensional real transform (MRT) gives an alternate representation of a signal in the frequency domain which involves only real addition. In this paper a new transform coder based on 44 4 4 MRT is proposed and its performance is analyzed for all types of grayscale images.

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


Assistive robot application based on an RFID control architecture and a wireless EOG interface This paper describes an assistive robot application that combines a portable wireless interface based on electrooculography (EOG) and Radiofrequency Identification (RFID) technology. This assistive application is aimed at handicapped users who suffer from a severe motor disability. To that end, a realistic application has been designed. It consists of an environment in which users can bring a glass and a water bottle closer with only the help of their eye movement using a real robot arm. RFID will be used as a support to the EOG interface in a shared control architecture by storing information of the objects in tags placed on the scene. Five volunteers tested the assistive robot application. The results obtained show that all of them were able to finish the tests in a suitable time and the results improved with practice and training. This proves that the assistive robot application can be a feasible way to help handicapped users.

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

rfid
wireless
electrooculography
shared control
robot arm


Making fuzzy description logic more general A version of fuzzy description logic based on the basic (continuous t-norm based) fuzzy predicate logic BL is presented. Problems of satisfiability, validity and subsumption of concepts are discussed and reduced to problems of fuzzy propositionial logic known to be decidable for any continuous t-norm. For Lukasiewicz t-norm some stronger results are obtained. (c) 2005 Elsevier B.V. All rights reserved.

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


An Adaptive Correspondence Algorithm for Modeling Scenes with Strong Interreflections Modeling real-world scenes, beyond diffuse objects, plays an important role in computer graphics, virtual reality, and other commercial applications. One active approach is projecting binary patterns in order to obtain correspondence and reconstruct a densely sampled 3D model. In such structured-light systems, determining whether a pixel is directly illuminated by the projector is essential to decoding the patterns. When a scene has abundant indirect light, this process is especially difficult. In this paper, we present a robust pixel classification algorithm for this purpose. Our method correctly establishes the lower and upper bounds of the possible intensity values of an illuminated pixel and of a nonilluminated pixel. Based on the two intervals, our method classifies a pixel by determining whether its intensity is within one interval but not in the other. Our method performs better than standard method due to the fact that it avoids gross errors during decoding process caused by strong interreflections. For the remaining uncertain pixels, we apply an iterative algorithm to reduce the interreflection within the scene. Thus, more points can be decoded and reconstructed after each iteration. Moreover, the iterative algorithm is carried out in an adaptive fashion for fast convergence.

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

three-dimensional graphics and realism
digitization and image capture
geometric modeling


In situ characterization of Cu CMP slurry and defect reduction using IR thermal camera In order to choose appropriate property of Cu chemicalmechanical polishing (CMP) slurry, we used IR thermal camera to distinguish this slurry that belonged to Preston or non-Preston. The adoption of the IR thermal camera is to choose suitable non-Preston Cu CMP slurry in situ and find out optimal changing timing of step endpoint. Additionally supplementing robust CMP machine, appropriate Cu film quality and pre-treatment, we could obtain a total defect number is less than 101 order and achieve excellent Cu CMP performance. Such Cu CMP technology resulting in Cu damascene process work and make sure 0.13 ?m and beyond 100 nm Cu process to be reliable and practical.

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

cu cmp
ir thermal camera
defect reduction


Selection of Concept Detectors for Video Search by Ontology-Enriched Semantic Spaces This paper describes the construction and utilization of two novel semantic spaces, namely Ontology-enriched Semantic Space (OSS) and Ontology-enriched Orthogonal Semantic Space (OS2), to facilitate the selection of concept detectors for video search. These two semantic spaces are enriched with ontology knowledge, while emphasizing consistent and uniform comparison of ontological relatedness among concepts for query-to-concept mapping. OS2, in addition to being a linear space like OSS, also guarantees orthogonality of the semantic space. Compared with other ontology reasoning measures, both spaces are capable of providing platforms that offer a global view of concept inter-relatedness, by allowing evaluation of concept similarity in metric spaces. We simulate OSS and OS2 by using LSCOM concepts and experiment search effectiveness with VIREO-374 concept detectors. Empirical observations indicate that the proposed semantic spaces enable more effective selection of concept detectors than eight other existing ontology measures. OS2, in particular, is better in providing a viable and reasonable solution for fusion of multiple concept detectors.

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

concept-based video search
semantic detectors


On the Hardness of Reoptimization with Multiple Given Solutions In reoptimization, we consider the following scenario: Given an instance of a hard optimization problem together with an optimal solution for it, we want to solve a locally modified instance of the problem. It has recently been shown for several hard optimization problems that their corresponding reoptimization variants remain NP-hard or even hard to approximate whereas they often admit improved approximation ratios. In this paper, we investigate a generalization of the reoptimization concept where we are given not only one optimal solution but multiple optimal solutions for an instance. We prove, for some variants of the Steiner tree problem and the traveling salesman problem, that the known reoptimization hardness results carry over to this generalized setting. Moreover, we consider the performance of local search strategies on reoptimization problems. We show that local search does not work for solving TSP reoptimization, even in the presence of multiple solutions.

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


Progress in the development of polymer cholesteric liquid crystal flakes for display applications Polymer cholesteric liquid crystal (PCLC) flake technology is being developed as an alternative display technology for flexible, reflective particle displays. The motion of PCLC flakes suspended in a host fluid can be controlled with an electric field, creating a way to electrically control the flakes' ability to brightly reflect light that is circularly polarized. The PCLC flake/host fluid dispersion has been successfully microencapsulated both in a polymer matrix and in gelatin micro-capsules. Microencapsulation will not only expand the applications scope of the technology, but also may aid in addressing some potential problem areas that are inherent to many forms of particle display technology. A second important development in PCLC flake technology involves the manufacture of shaped flakes based on soft lithography techniques. The size and shape of a flake impact its reorientation, and uniformly shaped flakes respond in a similar manner. The unique reflective properties of PCLC flakes also provide possible applications in areas such as optics and photonics, switchable smart windows or conformal coatings, and information displays such as electronic paper.

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

microencapsulation
information displays
cholesteric liquid crystal
particle display


Communication metrics for software development We present empirical evidence that metrics on communication artifacts generated by groupware tools can be used to gain significant insight into the development process that produced them. We describe a test-bed for developing and testing communication metrics, a senior level software engineering project course at Carnegie Mellon University, in which we conducted several studies and experiments from 1991-1996 with more than 400 participants. Such a test-bed is an ideal environment for empirical software engineering, providing sufficient realism while allowing for controlled observation of important project parameters. We describe three proof-of-concept experiments to illustrate the value of communication metrics in software development projects. Finally, we propose a statistical framework based on structural equations for validating these communication metrics.

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

empirical software engineering
communication
structural equations


deblurring with rank-structured inverse approximations In this presentation, the restoration of images blurred by atmospheric turbulence is examined. The proposal uses a new class of approximations to blurring operators representing Gaussian blur. The Toeplitz matrix representing the blur is transformed into a Cauchy-like (CL) matrix using the FFT. In addition to the CL structure, the transformed matrix has a rank structure. In particular, the off-diagonal blocks have low rank. This class of matrices can be approximated quickly, and the structure can be exploited for fast image restoration.

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

structured matrices
rank-structured matrices
toeplitz matrices
superfast algorithm


A multivariate model of fuzzy integrated logical forecasting method (M-FILF) and multiplicative time series clustering: A model of time-varying volatility for dry cargo freight market The aim of this paper is to improve the fuzzy logical forecasting model (FILF) by utilizing multivariate inference and the partitioning problem for an exponentially distributed time series by using a multiplicative clustering approach. Fuzzy time series (FTS) is a growing study field in computer science and its superiority is indicated frequently. Since the conventional time series analysis requires various preconditions, the FTS framework is very useful and convenient for many problems in business practice. This paper particularly investigates pricing problems in the shipping business and price-volatility relationship is the theoretical point of the proposed approach. Both FT'S and conventional time series results are comparatively presented in the final section and superiority of the proposed method is explicitly noted. (C) 2011 Elsevier Ltd. All rights reserved.

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

heuristics modeling
time-varying volatility
dry cargo shipping


A testbed for coverage control using mixed wireless sensor networks Wireless sensor networks (WSNs) is a relatively new technology that has been proposed for several applications including wide area monitoring. Such applications may include stationary or mobile sensor platforms or they may include several stationary and some mobile-robotic sensor nodes that can move in the area in order to achieve certain objectives, e.g., monitor areas that are not adequately covered or assist in the transfer of data to prevent the energy depletion of certain critical nodes. Such networks that consist of both stationary and mobile nodes are referred to as mixed WSNs. This paper presents the development of an experimental testbed for mixed WSNs consisting of stationary and mobile sensor nodes that collaborate to improve the sensing coverage and event detection of the network in a given deployment area. The paper describes the hardware and infrastructure of the testbed as well as a case study for coverage control that was investigated using the testbed. We point out that the developed testbed can be used for the evaluation and validation of different algorithms for coverage control that involve collaboration between stationary and mobile sensors to improve the WSN's monitoring capabilities. In addition, it can also be used to investigate other objectives as well as other concepts (e.g., network control). (C) 2011 Elsevier Ltd. All rights reserved.

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

mixed wsn testbed
distributed path-planning


A construction of resilient functions with high nonlinearity We provide a construction technique for multiple-output resilient functions F: F-2(n) --> F-2(m) with high nonlinearity. The construction leads to the problem of finding a set of linear codes with a fixed minimum distance, having the property that the intersection between any two codes is the all-zero codeword only. This problem is considered, and existence results are provided. Moreover, the constructed functions obtain a nonlinearity superior to previous construction methods.

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

boolean functions
correlation immunity
resiliency
stream ciphers


Solving Navier-Stokes equation for flow past cylinders using single-block structured and overset grids Many complex fluid motions are driven by physical processes of instability, transition and turbulence dependent upon nonlinear mechanisms. Here, we solve the flow past cylinder(s) using single-block structured and overset grids by computing Navier-Stokes equation in two-dimensions. The suitability of a compact scheme in discretizing convection and diffusion terms are investigated first by looking at relevant numerical properties. Also, for the overset grid method, one of the methods is identified that shows the best results in minimizing interpolation error at sub-domain boundaries for an analytical test function. We provide extensive comparisons with experimental and other computational results for flow past a single cylinder, utilizing both single-block structured and Chimera or overset grids. Apart from showing instability of this flow calculated by these methods, we also compare the computed vorticity and velocity data using these two grids by employing the proper orthogonal decomposition (POD). We have analyzed and developed an overset grid method with compact scheme that does not need any filtering to control error. This has been ascertained by performing POD analysis. To show that the developed method is capable of handling complex geometries, we have computed flow past two cylinders in side-by-side arrangement. Results obtained capture the known flow characteristics for this arrangement well using relatively fewer number of grid points. (C) 2009 Elsevier Inc. All rights reserved.

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

overset grid method
proper orthogonal decomposition

circular cylinder
navier-stokes equation
chimera grid method
interpolation technique


Kernel regression for image processing and reconstruction In this paper, we make contact with the field of nonparametric statistics and present a development and generalization of tools and results for use in image processing and reconstruction. In particular, we adapt and expand kernel regression ideas for use in image denoising, upscaling, interpolation, fusion, and more. Furthermore, we establish key relationships with some popular existing methods and show how several of these algorithms, including the recently popularized bilateral filter, are special cases of the proposed framework. The resulting algorithms and analyses are amply illustrated with practical examples.

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

bilateral filter
denoising
fusion
interpolation
kernel regression
nonparametric

irregularly sampled data
kernel function
local polynomial
nonlinear filter
scaling
spatially adaptive
super-resolution


An empirical test of patterns for nonmonotonic inference Human inference can be used to test the inference patterns a reliable nonmonotonic consequence should satisfy, because it appears to be nonmonotonic, it is adaptive and it generally achieves efficiency. In this study, an experiment is conducted to investigate whether human inference tends to be consistent with rationality postulates (System P plus Rational Monotony), especially when it no longer satisfies the Monotony property. The experimental protocol uses a possibilistic semantics for plausible rules. Our results appear to be consistent with all the studied properties. Exceptions are the Cut property (with one hind of content out of two) and Left Logical Equivalence which could not be tested. Moreover, when Monotony was not satisfied by participants' inferences, Cut, Cautious Monotony and And properties were corroborated (Rational Monotony was only plausibly supported and the other properties were not tested). Our results emphasize the psychological plausibility of rationality postulates and support the working hypothesis in Artificial Intelligence that System P plus Rational Monotony offer a plausible basic set of properties for nonmonotonic logics.

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

nonmonotonic inference
system p
human inference


Measuring the Strength of Information Flows in Programs Dynamic information flow analysis (DIFA) was devised to enable the flow of information among variables in an executing program to be monitored and possibly regulated. It is related to techniques like dynamic slicing and dynamic impact analysis. To better understand the basis for DIFA, we conducted an empirical study in which we measured the strength of information flows identified by DIFA, using information theoretic and correlation-based methods. The results indicate that in most cases the occurrence of a chain of dynamic program dependences between two variables does not indicate a measurable information flow between them. We also explored the relationship between the strength of an information flow and the length of the corresponding dependence chain, and we obtained results indicating that no consistent relationship exists between the length of an information flow and its strength. Finally, we investigated whether data dependence and control dependence makes equal or unequal contributions to flow strength. The results indicate that flows due to data dependences alone are stronger, on average, than flows due to control dependences alone. We present the details of our study and consider the implications of the results for applications of DIFA and related techniques.

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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 information flow analysis
dynamic slicing

security
experimentation
measurement
information flow strength
information flow length
information leakage
program dependence
entropy
correlation


Fusion of aroma, FT-IR and UV sensor data based on the Bayesian inference. Application to the discrimination of white grape varieties The objective of this study is to present a fusion method based on the Bayesian inference to combine the outputs of various sensors. The sensors studied here are aroma sensors, FT-IR and UV spectrometers. The application deals with classifying musts of white grapes according to their variety. The fusion procedure is not based on the combination of the signals, but of the class assignments provided individually by each sensor. Two methods have been developed based on the Bayesian inference: the Bayesian minimum error fusion rule and the minimum risk rule. The latter involves both experimental knowledge, in computing error probability values, and expert knowledge, through the level of error costs. The paper presents the mathematical theory concerning the Bayesian approach and the results obtained on white grape classification. This effective fusion method leads to a significant improvement in the grape variety discrimination: the final misclassification error is 4.7%, whereas the best individual sensor (FT-IR) gave a misclassification error twice as high, i.e. 9.6%. Bayesian fusion proved to be very well suited to the combination of all kinds of analytical measurements or sensors (curves or single value outputs), as long as they provide individual classification outputs. Furthermore, Bayesian fusion is able to cope with sensors providing large, noisy and redundant data as well as sensors showing very dissimilar efficiency levels. (C) 2002 Elsevier Science B.V. All rights. reserved.

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

bayesian inference
classification
grape variety

sensor fusion
aroma sensor
ft-ir spectrometry
uv spectrometry


Nonlinear time history analysis of a pre-stressed concrete containment vessel model under Japan's March 11 earthquake To evaluate the behavior of the advanced unbonded pre-stressed concrete containment vessel (UPCCV) for one typical China nuclear power plant under Japan's March 11 earthquake, five nonlinear time history analysis and a nonlinear static analysis of a 1:10 scale UPCCV structure have been carried out with MSC. MARC finite element program. Comparisons between the analytical and experimental results demonstrated that the developed finite element model can predict the earthquake behavior of the UPCCV with fair accuracy. The responses of the 1:10 scale UPCCV subjected to the 11 March 2011 Japan earthquakes recorded at the MYG003 station with the peak ground acceleration (PGA) of 781 gal and at the MYG013 station with the PGA of 982 gal were predicted by the dynamic analysis. Finally, a static analysis was performed to seek the ultimate load carrying capacity for the 1:10 scale UPCCV.

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

earthquake
concrete containment vessel
nonlinear time history

unbounded tendon
finite element analysis


Single-electron tunneling depressing synapse for cellular neural networks In this paper, a cellular neural network with depressing synapses for contrast-invariant pattern classification and synchrony detection is presented, starting from the impulse model of the single-electron tunneling junction. The results of the impulse model and the network are simulated using simulation program with integrated circuit emphasis (SPICE). It is demonstrated that depressing synapses should be an important candidate of robust systems since they exhibit a rapid depression of excitatory postsynaptic potentials for successive presynaptic spikes.

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

depressing synapses
tunneling junction
spice

cellular non-linear networks (cnn)
single-electron tunneling (set)


Examining the role of collaboration in studies of health information technologies in biomedical informatics: A systematic review of 25 years of research We reviewed studies of collaboration in biomedical informatics from 19902015. Studying collaboration is complex as it is often intertwined with other concepts. Studies can be examined based on technology, context, processes, and outcomes. The collaboration space model is an approach to integrate these characteristics. We also need to evaluate whether HIT features explicitly support collaboration.

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


The convergence of a family of parallel zero-finding methods One of the crucial problems in solving polynomial equations is to state some kind of quantitative conditions that provide both safe and fast convergence. In the spirit of Smale's point estimation theory introduced in 1981, we construct in this paper computationally verifiable initial conditions which guarantee the convergence of the recently proposed one parameter family of methods of the fourth order for the simultaneous finding polynomial zeros. These conditions are computationally verifiable since they depend only on initial approximations, polynomial coefficients, and polynomial degree, which is of significant practical importance. (C) 2004 Elsevier Ltd. All rights reserved.

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

zeros of polynomials
simultaneous methods
guaranteed convergence


Formal architectural description language based on symbolic transition systems and modal logic Component Based Software Engineering has now emerged as a discipline for system development. After years of battle between component platforms, the need for means to abstract away from specific implementation details is now recognized. This paves the way for model driven approaches (such as MDE) but also for the more older Architectural Description Language (ADL) paradigm. In this paper we present KADL, an ADL based on the Korrigan formal language which supports the following features: integration of fully formal behaviours and data types, expressive component composition mechanisms through the use of modal logic, specification readability through graphical notations, and dedicated architectural analysis techniques.

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

architectural description language
component based software engineering
symbolic transition systems
graphical notations

mixed formal specifications
abstract data types
modal logic glue
verification


Private and secure service discovery via progressive and Probabilistic exposure The involvement of only the necessary users and service providers for service discovery in pervasive computing environments is challenging. Without prudence, users' and service providers' requests or service information, their identities, and their presence information may be sacrificed. We identify that the problem may be as difficult as a chicken- and- egg problem, in which both users and service providers want the other parties to expose sensitive information first. In this paper, we propose a progressive and probabilistic approach to solve the problem. Users and service providers expose partial information in turn and avoid unnecessary exposure if there is any mismatch. Although 1 or 2 bits of information are exchanged in each message, we prove that the process converges and that the false- positive overhead decreases quickly. Experiments and hypothesis tests show that security properties hold. We implemented the approach and the performance measurements show that the approach runs efficiently on PDAs.

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

pervasive computing
probabilistic
security


Adaptive thresholding of tomograms by projection distance minimization Segmentation is an important step to obtain quantitative information from tomographic data sets. However, it is usually not possible to obtain an accurate segmentation based on a single, global threshold. Instead, local thresholding schemes can be applied that use a varying threshold. Selecting the best local thresholds is not a straightforward task, as local image features often do not provide sufficient information for choosing a proper threshold. Recently, the concept of projection distance was proposed by the authors as a new criterion for evaluating the quality of a tomogram segmentation [K.J. Batenburg, J. Sijbers, Automatic threshold selection for tomogram segmentation by reprojection of the reconstructed image, in: Computer Analysis of Images and Patterns, in: Lecture Notes in Computer Science, vol. 4673, Springer, Berlin/Heidelberg, 2007, pp. 563570.]. In this paper, we describe how projection distance minimization (PDM) can be used to select local thresholds, based on the available projection data from which the tomogram was initially computed. The results of several experiments are presented in which our local thresholding approach is compared with alternative thresholding methods. These results demonstrate that the local thresholding approach yields segmentations that are significantly more accurate compared to previously published methods, in particular when the initial reconstruction contains artifacts.

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

local thresholding
adaptive thresholding
pdm
segmentation


A solution method of nonlinear convective stability problems in finite domains A Chebyshev pseudospectral method is generalized to solve the linear and nonlinear hydrodynamic stability problems of thermal convection in a two-dimensional rectangular box with rigid sidewalls, where there may exist a heal source or a magnetic field to enhance or suppress the convection. The incompressibility condition is imposed rigorously on all boundaries. The effects of box aspect ratio, heal source, and magnetic field on the critical Rayleigh number and convection cell size are examined and compared with the results of other investigators. We have extended the present technique to nonlinear stability analysis and derived the Landau equation that describes the temporal evolution of the strength of convection in the rectangular box with rigid sidewalls. The results of nonlinear stability analysis are compared with the exact results obtained by the numerical solution of the Boussinesq equation, The present technique solves linear and nonlinear convective stability problems accurately and can be employed to solve other hydrodynamic stability problems in finite domains. (C) 2001 Academic Press.

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


An iterative algorithm learning the maximal margin classifier A simple learning algorithm for maximal margin classifiers (also support vector machines with quadratic cost function) is proposed. We build our iterative algorithm on top of the SchlesingerKozinec algorithm (SK-algorithm) from 1981 which finds a maximal margin hyperplane with a given precision for separable data. We suggest a generalization of the SK-algorithm (i) to the non-linear case using kernel functions and (ii) for non-separable data. The requirement in memory storage is linear to the data. This property allows the proposed algorithm to be used for large training problems. The resulting algorithm is simple to implement and as the experiments showed competitive to the state-of-the-art algorithms. The implementation of the algorithm in Matlab is available. We tested the algorithm on the problem aiming at recognition poor quality numerals.

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

support vector machines
kernel functions

pattern recognition
linear classifier
supervised learning


Development and implementation of a polydispersed multiphase flow model in OpenFOAM The two-phase flow solver implemented in the open-source OpenFOAM code was extended to a multiphase flow formulation (n dispersed and one continuous phases) and then coupled to the population balance equation (PBE) solution by the Direct Quadrature Method of Moments (DQMOM), originating a polydispersed multiphase flow solver. Although each dispersed phase has its own velocity field, the present implementation considers only the interfacial momentum exchange between the continuous and the dispersed phases. The multiphase flow formulation was described and the details of the PBE-CFD coupling algorithms in OpenFOAM were provided. The implementation of the multiphase flow code was verified and evaluated against the original OpenFOAM two-phase flow solver for flow through a 2D backward facing step, using simplified breakage and aggregation kernels. The computational cost of both codes were compared for serial and parallel simulations. (C) 2011 Elsevier Ltd. All rights reserved.

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

population balance
multiphase flow
dqmom
openfoam


an integrated model for visualizing biclusters from gene expression data and ppi networks We provide a model to integrate the visualization of biclusters extracted from gene expresion data and the underlying PPI networks. Such an integration conveys the biologically relevant interconnection between these two structures inferred from biological experiments. We model the reliabilities of the structures using directed graphs with vertex and edge weights. The resulting graphs are drawn using appropriate weighted modifications of the algorithms necessary for the layered drawings of directed graphs. We provide applications of the proposed visualization model on the S. cerevisiae dataset.

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


query optimization using restructured views We study optimization of relational queries using materialized views, where views may be regular or restructured . In a restructured view, some data from the base table(s) are represented as metadata - that is, schema information, such as table and attribute names - or vice versa.Using restructured views in query optimization opens up a new spectrum of views that were not previously available, and can result in significant additional savings in query-evaluation costs. These savings can be obtained due to a significantly larger set of views to choose from, and may involve reduced table sizes, elimination of self-joins, clustering produced by restructuring, and horizontal partitioning.In this paper we propose a general query-optimization framework that treats regular and restructured views in a uniform manner and is applicable to SQL select-project-join queries and views with or without aggregation. Within the framework we provide (1) algorithms to determine when a view (regular or restructured) is usable in answering a query, and (2) algorithms to rewrite a query using usable views.Semantic information, such as knowledge of the key of a view, can be used to further optimize a rewritten query. Within our general query-optimization framework, we develop techniques for determining the key of a (regular or restructured) view, and show how this information can be used to further optimize a rewritten query. It is straightforward to integrate all our algorithms and techniques into standard query-optimization algorithms.

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

restructured views
materialized views
query optimization


L-p approximation capabilities of sum-of-product and sigma-pi-sigma neural networks This paper studies the L-p approximation capabilities of sum-of-product (SOPNN) and sigma-pi-sigma (SPSNN) neural networks. It is proved that the set of functions that are generated by the SOPNN with its activation function in L-loc(p)(R) is dense in L-p(K) for any compact set K subset of R-N, if and only if the activation function is not a polynomial almost everywhere. It is also shown that if the activation function of the SPSNN is in L-loc(infinity)(R), then the functions generated by the SPSNN are dense in L-p(K) if and only if the activation function is not a constant (a.e.).

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

approximation capability
sum-of-product neural networks
sigma-pi-sigma neural networks
density


GAME based dynamic resource scheduling in QoS aware radio access networks Radio resource management and QoS are finally inseparable in wideband CDMA networks. In this paper, we propose a novel wireless resource scheduler, called GAME-C, that integrates our genetic algorithm for mobiles equilibrium (GAME) with the standard CDMA transmitter closed loop power control (CLPC). GAME assigns optimally both transmitting power and bit rate to every mobile station. Optimal allocation is in the sense that every user gets only enough resources necessary for meeting or exceeding its QoS requirements while minimizing interference to other users. Having done that, we gain further benefits as well. In addition to QoS provisioning, lower transmitting power extends a mobile station battery life. Moreover, the base station coverage efficiency is improved by decreasing the probability of blocking new connections or dropping current ones. In short, GAME-C expands the number of QoS-satisfied mobile stations in a cell. Various simulations show improvements achieved over the established (CLPC) basic scheme.

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

resource scheduling
genetic algorithm
wideband cdma
power control


Valuation of Participation in Social Gaming This study examines the value of the time that a user spends to participate in a social game. We focus on how a massive multiplayer online role-playing game (MMORPG) vendor can establish prices to encourage participation and retain its players. We estimate value through an application of the hedonic pricing model and analyze a data set for an MMORPG in Korea. The results permit us to estimate the value of game-playing time in monetary terms. Based on our empirical results, we propose an economic model and conduct numerical simulation to show how a game vendor can apply differential pricing in this context. This enables us to design a pricing scheme to maximize a game vendor's profit. Our study affirms the long-standing finding that building network effects associated with other game players' participation is a critical source of benefits for the vendor. Going beyond this, we also find it is appropriate to use differential pricing, by subsidizing a participant's game play initially and then charging more aggressively to extract the available consumer surplus over the player's life cycle in the game, in order to reinforce a vendor's ability to maintain a healthy number of game participants.

O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 valuation
econometrics
field study
hedonic value
mmorpgs
online games
role-playing games


Baseline wander removal for bioelectrical signals by quadratic variation reduction A novel approach to baseline wander removal for bioelectrical signals is proposed. The approach is based on the notion of quadratic variation reduction. Baseline wander is estimated solving a constrained convex optimization problem. The algorithm has linear complexity and admits a simple implementation. Results on ECG, EEG and EMG recordings highlight the effectiveness of the approach.

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

baseline wander
quadratic variation reduction
ecg
eeg
emg


learning video preferences from video content Viewers of video now have more choices than ever. As the number of choices increases, the task of searching through these choices to locate video of interest is becoming more difficult. Current methods for learning a viewer's preferences in order to automate the search process rely either on video having content descriptions or on having been rated by other viewers identified as being similar. However, much video exists that does not meet these requirements. To address this need, we use hidden Markov models to learn the preferences of a viewer by combining visual features and closed captions. Results are provided from some initial experiments using this approach.

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


Journal impact and proximity: An assessment using bibliographic features Journals in the Information Science & Library Science category of Journal Citation Reports (JCR) were compared using both bibliometric and bibliographic features. Data collected covered journal impact factor (JIF), number of issues per year, number of authors per article, longevity, editorial board membership, frequency of publication, number of databases indexing the journal, number of aggregators providing full-text access, country of publication, JCR categories, Dewey decimal classification, and journal statement of scope. Three features significantly correlated with JIF: number of editorial board members and number of JCR categories in which a journal is listed correlated positively; journal longevity correlated negatively with JIF. Coword analysis of journal descriptions provided a proximity clustering of journals, which differed considerably from the clusters based on editorial board membership. Finally, a multiple linear regression model was built to predict the JIF based on all the collected bibliographic features.

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


Automatic Moderation of Online Discussion Sites Online discussion sites are plagued with various types of unwanted content, such as spam and obscene or malicious messages. Prevention and detection-based techniques have been proposed to filter inappropriate content from online discussion sites. But, even though prevention techniques have been widely adopted, detection of inappropriate content remains mostly a manual task. Existing detection techniques, which are divided into rule-based and statistical techniques, suffer from various limitations. Rule-based techniques usually consist of manually crafted rules or blacklists of key words. Both are time-consuming to create and tend to generate many false-positives and false-negatives. Statistical techniques typically use corpora of labeled examples to train a classifier to tell "good" and "bad" messages apart. Although statistical techniques are generally more robust than rule-based techniques, they are difficult to deploy because of the prohibitive cost of manually labeling examples. In this paper we describe a novel classification technique to train a classifier from a partially labeled corpus and use it to moderate inappropriate content on online discussion sites. Partially labeled corpora are much easier to produce than completely labeled corpora, as they are made up only with unlabeled examples and examples labeled with a single class (e.g., "bad"). We implemented and tested this technique on a corpus of messages posted on a stock message board and compared it with two baseline techniques. Results show that our method outperforms the two baselines and that it can be used to significantly reduce the number of messages that need to be reviewed by human moderators.

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

automatic moderation
online discussion sites
partially labeled corpora


Study of the divided wall column controllability: influence of design and operation The main objective of this work is to study the influence of design and operating conditions on the divided wall column (DWC) controllability. Firstly, two designs for which the total distillation cost is minimised are compared. For each design, different optimal reflux to minimum reflux ratio is assumed. Secondly, three non-optimal designs are compared with an optimal one. Adding trays to different column sections, the distribution of the distillation effort is changed. The effect of this change on the controllability is studied. The DWC has extra operation degrees of freedom and the operation that minimises the boilup is searched. The influence of the operating conditions over the controllability is studied comparing optimal and non-optimal nominal operations. (C) 2000 Elsevier Science Ltd. All rights reserved.

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

multicomponent distillation
design and controllability


Sequential behavior prediction based on hybrid similarity and cross-user activity transfer Linear algebraic modeling of human behavior with mobile devices. Improving behavior prediction by transferring knowledge from different users. A hybrid similarity measure based on PCA and longest/daily common behavior.

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

mobile data
behavior similarity
common behavior analysis
transfer learning
principal component analysis
sequential prediction


visual summaries of popular landmarks from community photo collections We present a novel data-driven algorithm that leverages online image repositories such as Flickr for automatically generating tourist maps. Our hypothesis is that, given a large enough dataset of images with geo-based metadata, clusters of matching images from that dataset tend to provide reliable cues as to what the popular tourist spots may be. Our algorithm takes the geographical area of interest as input and retrieves geotagged photos from online photo collections. By clustering the photos based on their locations and identifying the popular tags for each cluster, our algorithm generates a set of points of interest (POIs) for the area. After retrieving additional photos based on these discovered POI tags, we use image matching to find the most representative landmark view for each POI. Finally, we remove clutter from the representative image and apply tooning to generate a map icon for each landmark.

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

tourist maps
points of interest
geotagged photos


A modified GaussSeidel algorithm of three-phase power flow analysis in distribution networks This paper introduces a novel approach to solve the three-phase power flow problem for large-scale distribution systems. This method is based on the optimal ordering scheme and triangular factorization of Y-bus matrix, which not only takes advantage of the sparsity of system equations but also is insensitive to network topology. By applying the idea of modified GaussSeidel algorithm to the implicit Z-bus Gauss method, a three-phase distribution network can be separated into three single-phase distribution networks and can be solved phase by phase. Comparing to the conventional methods, the memory space requirement is lower and the CPU execution time can be reduced. Test results show that the proposed method has great potential for real-time uses.

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

implicit z-bus method
gaussseidel method
newtonraphson method


mining user session data to facilitate user interaction with a customer service knowledge base in rightnow web RightNow Web is an integrated software package for web-based customer service that has, at its core, a database of answers to frequently asked questions (FAQs). One major design goal is to facilitate end-user interaction with this dynamic document collection, i.e. make it as easy and efficient as possible for users to browse the collection and locate desired information. To this end, we perform several types of analysis on the session tracking database that records user navigation histories. First, using both explicit and implicit measures of user satisfaction, we infer a "solved count" representing the average utility of an FAQ. Second, using the user navigation patterns we construct a link matrix representing connections between FAQs. The technique of building up the link matrix and using it to advise users on related information amounts to a form of the "swarm intelligence" method of finding optimal paths. Both solved count and the link matrix are continuously updated as users interact with the site; furthermore, they are periodically "aged" to emphasize recent activity. The synergistic combination of these techniques allows users to learn from the database in a more effective manner, as evidenced by usage statistics.

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

self-help
multi-agent system
collaborative filtering
user data
clustering


Autonomous system for oil pipelines inspection Maintenance of oil pipelines is an issue of great concern for oil companies. Any possibility of leakage must be detected before the leakage occurs and a preventive action should be taken in order to avoid losses of oil and ecological disasters. One of the main causes of oil pipelines leakage is the corrosion of the bottom part of the pipeline due to accumulation of water and other corrosive substances. One of the methods used to check the conditions of the oil pipelines is the running of a data acquisition device through all the length of the pipeline (that can be km) to gather information about the corrosion and its position inside the pipeline. This device is commonly referred to as pig. The Brazilian oil company, PETROBRAS, wanting to have the technology of such device to detect corrosion in their oil pipelines proposed to the Department of Mechanical Engineering of the Escola Politecnica da Universidade de Sao Paulo a joint project to the development of a pig that could run uninterruptedly in long oil pipelines gathering corrosion data for the preventive maintenance of their ail pipelines. The result of the project was the development of an ultrasonic pig with 16 ultrasonic transducers with on-board energy system and acquisition and storage systems. Also, comprised in the presented solution was the development of a software to analyze the collected data and give the position of the corrosion spots along the pipeline. This paper presents in detail the implementation and design issues related to the development of the ultrasonic pig. Also, some experimental data will be shown as confirmation of the effectiveness of the developed system. (C) 1999 Elsevier Science Ltd. All rights reserved.

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

autonomous system
ultrasonic transducers

automated inspection
oil pipeline corrosion


Finding major patterns of aging process by data synchronization We developed a method for extracting feature patterns from multivariate data using a network of coupled phase oscillators subject to an analogue of the Kuramoto model for collective synchronization. Our method may be called data synchronization. We applied data synchronization to the care-needs-certification data, provided by Otsu City as a historical old city near Kyoto City, in the Japanese public long-term care insurance program to find the trend of the major patterns of the aging process for elderly people needing nursing care.

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

data mining
health information technology
care needs certification


On A search with stopover areas Today's map navigation software offers more and more functionality. For example, it cannot only route from a start to a destination address, but the user can also specify a number of via destinations that are to be visited along the route. What is not commonly found in the software is the handling of so-called stopover areas. Here the user specifies a sequence of geographic areas and wants the route to lead into or through each of these areas (but he does not actually care where exactly). A modification of the well-known A algorithm that considers convex stopover areas is presented. Algorithmic variants and implementation issues are discussed. Example results on a real-world data set are presented for the case of axis parallel rectangular stopover areas.

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


Identifying plausible adverse drug reactions using knowledge extracted from the literature We evaluate PSI-based identification of relationships between drugs and ADRs. PSI can incorporate relations and concepts and infer reasoning pathways. PSI is more predictive than a co-occurrence based model. Reasoning pathways suggest supporting evidence from literature for review.

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

pharmacovigilance
distributional semantics
literature-based discovery
predication-based semantic indexing
reflective random indexing


Scalable data replication in content-centric networking based on alias names Content-Centric Networking (CCN) is a clean-slate proposal to redesign the current Internet by focusing on the content itself, instead of the classical computer-to-computer communication. In this paper we address scalability issues of the Forwarding Information Base (FIB) in CCN. Our solution proposes both the use of hierarchical names assigned by access providers and a novel alias name architecture. With the former, we allow the aggregation of entries at the routing tables of CCN content routers, while the latter reduces the processing load at those routers when replicas exist in different parts of the network. With some minor changes to the original proposal, we provide a scalable solution for data replication in CCN, which inherently supports content mobility at the same time. We validate our scheme by (1) comparing the scalability of CCN against our proposal and by (2) implementing and testing a proof-of-concept software based on CCNx, to prove the viability of this approach.

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


Integration of equipment planning and project scheduling It is common to schedule project activities first, then the utilization of equipment and its operating crew is planned based on such schedule. Real world experiences indicate that activity scheduling can be heavily impacted by the resources needed. In particular, if a project requires highly specialized and expensive equipment type, then one needs to take into account the schedule and cost of such resources in developing the project schedule. In this paper, we consider the impact of using expensive and specialized equipment on the project schedule and its cost. The integration of project scheduling with equipment planning introduces new trade-offs that would lead to more realistic and cost-effective project schedules. Such trade-offs include the costs of: activity crashing, equipment setup, transition, idle time, and operators overtime as well as the project worth; rewards for early completion and penalty for delayed completion. An efficient mixed integer linear program is developed to capture the real world considerations of the integrated problem. The solution of the program yields the optimal schedules for the activities, equipment, and operators. These schedules involve crashing of critical and non-critical activities. An efficient heuristic is also developed and used to schedule large size projects. Optimal schedules are analyzed and computational experiences are provided.

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

crashing activities
mixed integer programming
transition cost
heuristics
enhanced forward loading
binary switching operation


A pairing-free certificate-based proxy re-encryption scheme for secure data sharing in public clouds This paper proposes a pairing-free certificate-based proxy re-encryption scheme. The scheme is proven secure under the classic CDH assumption. The scheme is particularly suitable for the computation-limited devices.

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

public cloud
certificate-based proxy re-encryption
bilinear pairing
chosen-ciphertext security
random oracle model


Generalization of proxy signature-based on discrete logarithms In the past few years, many excellent studies on proxy signature schemes have been published. Yet, traditional proxy signature schemes are mainly aimed at dealing with one or two separate proxy conditions each. In this article, the authors shall present a generalized version of the (t(1)/n(1) - t(2)/n(2)) proxy signature scheme based on the discrete Logarithms that can be applied to every proxy situation. The (t(1)/n(1) - t(2)/n(2)) proxy signature scheme allows the original group of original signers to delegate their signing capability to a designated proxy group. The proxy group of proxy signers can cooperatively generate the proxy signature on behalf of the original group. Any verifier can verify the proxy signature on the message with the knowledge of the identities of the actual original signers and the actual proxy signers. Furthermore, some possible attacks have been considered, and our security analysis shows that none of them can successfully break the proposed scheme.

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

digital signature
threshold proxy signature
proxy multi-signature scheme


Simultaneous tracking and action recognition for single actor human actions This paper presents an approach to simultaneously tracking the pose and recognizing human actions in a video. This is achieved by combining a Dynamic Bayesian Action Network (DBAN) with 2D body part models. Existing DBAN implementation relies on fairly weak observation features, which affects the recognition accuracy. In this work, we use a 2D body part model for accurate pose alignment, which in turn improves both pose estimate and action recognition accuracy. To compensate for the additional time required for alignment, we use an action entropy-based scheme to determine the minimum number of states to be maintained in each frame while avoiding sample impoverishment. In addition, we also present an approach to automation of the keypose selection task for learning 3D action models from a few annotations. We demonstrate our approach on a hand gesture dataset with 500 action sequences, and we show that compared to DBAN our algorithm achieves 6% improvement in accuracy.

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

human action recognition
dynamic bayesian network
pictorial structure


experimenting with the use of persona in a focus group discussion with older adults in malaysia Eliciting user-requirements from older adults -- especially amongst non-users -- can be challenging. This is due to the fact that older adults are varied in term of their functional abilities and experience with technology. The common User-centered design (UCD) techniques such as focus group and interviews were found to be less effective with older adults. Inspired by the benefits of persona in enhancing designer's attention through narrative and storytelling, the study reported in this paper tested persona as a communication tool in a focus group discussion with older adults in Malaysia. The study was carried out to gather Malaysian older adults' needs and requirements for the development of a prototype email application. Findings and feedbacks from the study shows that persona can be a potential technique to be applied in working with older adults. The use of persona in a focus group discussion does not only benefit the researchers and designers but also the participants -- particularly in building interest among non-users to embrace computers.

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


Responding to the challenges of instrumental orchestration through physical and virtual robotics It has been recognised that the general lack of enjoyment of institutional mathematics learning at the secondary level is one of the basic reasons behind the bad reputation of mathematics in society. Increasing students' motivation to learn mathematics through enjoyment and playing, especially in their free time, might therefore be a relevant research focus. This paper considers robot-based investigation spaces for students at the secondary level and the transition from secondary to tertiary level education (or from compulsory to non-compulsory mathematics education) which allow them to explore the facility of real and virtual environments to create behaviours which are both meaningful to them and which naturally motivate a greater use of mathematical language to describe and predict these behaviours more precisely. The value of these environments is assessed from the perspective of the challenges of instrumental orchestration. (C) 2011 Elsevier Ltd. All rights reserved.

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

computer-based instrumentation instrumentalisation technology-based


Output-sensitive modular algorithms for polynomial matrix normal forms We give modular algorithms to compute row-reduced forms, weak Popov forms, and Popov forms of polynomial matrices, as well as the corresponding unimodular transformation matrices. Our algorithms improve on existing fraction-firee algorithms. In each case, we define lucky homomorphisms, determine the appropriate normalization, as well as bound the number of homomorphic images required. The algorithms have the advantage that they are output-sensitive; that is, the number of homomorphic images required depends on the size of the output. Furthermore, there is no need to verify the result by trial division or multiplication. Our algorithms can be used to compute normalized one-sided greatest common divisors and least common multiples of polynomial matrices, along with irreducible matrix-fraction descriptions of matrix rational functions. When our algorithm is used to compute polynomial greatest common divisors, we obtain a new output-sensitive modular algorithm. (c) 2007 Elsevier Ltd. All rights reserved.

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

row-reduced form
weak popov form
popov form


Hybrid stochastic simulations of intracellular reaction-diffusion systems With the observation that stochasticity is important in biological systems, chemical kinetics have begun to receive wider interest. While the use of Monte Carlo discrete event simulations most accurately capture the variability of molecular species, they become computationally costly for complex reaction-diffusion systems with large populations of molecules. On the other hand, continuous time models are computationally efficient but they fail to capture any variability in the molecular species. In this study a hybrid stochastic approach is introduced for simulating reaction-diffusion systems. We developed an adaptive partitioning strategy in which processes with high frequency are simulated with deterministic rate-based equations, and those with low frequency using the exact stochastic algorithm of Gillespie. Therefore the stochastic behavior of cellular pathways is preserved while being able to apply it to large populations of molecules. We describe our method and demonstrate its accuracy and efficiency compared with the Gillespie algorithm for two different systems. First, a model of intracellular viral kinetics with two steady states and second, a compartmental model of the postsynaptic spine head for studying the dynamics of Ca+2 and NMDA receptors. (C) 2009 Elsevier Ltd. All rights reserved.

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

biochemical networks
stochastic simulation
hybrid algorithm
chemical master equation
calcium dynamics


High energy solutions of systems of Kirchhoff-type equations on RN R N ? The main purpose of this paper is to unify and improve Theorems 3.13.3 in Wu (2012) [8] as well as some results in other literature such as Theorems 14 in Wu (2011) [9]. We present a new proof technique to conclude the existence of high energy solutions for the Kirchhoff-type system under some assumptions that are weaker than those in Wu (2012) [8].

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

kirchhoff-type
mountain pass theorem
semi-trivial solutions


effects of machine translation on collaborative work Even though multilingual communities that use machine translation to overcome language barriers are increasing, we still lack a complete understanding of how machine translation affects communication. In this study, eight pairs from three different language communities--China, Korea, and Japan--worked on referential tasks in their shared second language (English) and in their native languages using a machine translation embedded chat system. Drawing upon prior research, we predicted differences in conversational efficiency and content, and in the shortening of referring expressions over trials. Quantitative results combined with interview data show that lexical entrainment was disrupted in machine translation-mediated communication because echoing is disrupted by asymmetries in machine translations. In addition, the process of shortening referring expressions is also disrupted because the translations do not translate the same terms consistently throughout the conversation. To support natural referring behavior in machine translation-mediated communication, we need to resolve asymmetries and inconsistencies caused by machine translations.

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

reference
distributed work
computer-mediated communication
multilingual groups


Longitudinal analysis of pain in patients with metastatic prostate cancer using natural language processing of medical record text Objectives To test the feasibility of using text mining to depict meaningfully the experience of pain in patients with metastatic prostate cancer, to identify novel pain phenotypes, and to propose methods for longitudinal visualization of pain status. Materials and methods Text from 4409 clinical encounters for 33 men enrolled in a 15-year longitudinal clinical/molecular autopsy study of metastatic prostate cancer (Project to ELIminate lethal CANcer) was subjected to natural language processing (NLP) using Unified Medical Language System-based terms. A four-tiered pain scale was developed, and logistic regression analysis identified factors that correlated with experience of severe pain during each month. Results NLP identified 6387 pain and 13827 drug mentions in the text. Graphical displays revealed the pain landscape' described in the textual records and confirmed dramatically increasing levels of pain in the last years of life in all but two patients, all of whom died from metastatic cancer. Severe pain was associated with receipt of opioids (OR=6.6, p<0.0001) and palliative radiation (OR=3.4, p=0.0002). Surprisingly, no severe or controlled pain was detected in two of 33 subjects' clinical records. Additionally, the NLP algorithm proved generalizable in an evaluation using a separate data source (889 Informatics for Integrating Biology and the Bedside (i2b2) discharge summaries). Discussion Patterns in the pain experience, undetectable without the use of NLP to mine the longitudinal clinical record, were consistent with clinical expectations, suggesting that meaningful NLP-based pain status monitoring is feasible. Findings in this initial cohort suggest that outlier' pain phenotypes useful for probing the molecular basis of cancer pain may exist. Limitations The results are limited by a small cohort size and use of proprietary NLP software. Conclusions We have established the feasibility of tracking longitudinal patterns of pain by text mining of free text clinical records. These methods may be useful for monitoring pain management and identifying novel cancer phenotypes.

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

natural language processing
pain management
metastatic prostate cancer
cancer pain

personalized medicine
individualized medicine


the anti-forensics challenge Computer and Network Forensics has emerged as a new field in IT that is aimed at acquiring and analyzing digital evidence for the purpose of solving cases that involve the use, or more accurately misuse, of computer systems. Many scientific techniques, procedures, and technological tools have been evolved and effectively applied in this field. On the opposite side, Anti-Forensics has recently surfaced as a field that aims at circumventing the efforts and objectives of the field of computer and network forensics. The purpose of this paper is to highlight the challenges introduced by Anti-Forensics, explore the various Anti-Forensics mechanisms, tools and techniques, provide a coherent classification for them, and discuss thoroughly their effectiveness. Moreover, this paper will highlight the challenges seen in implementing effective countermeasures against these techniques. Finally, a set of recommendations are presented with further seen research opportunities.

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

data hiding
computer anti-forensics (caf)
computer forensics (cf)


Artificial neural network and liquefaction susceptibility assessment: a case study using the 2001 Bhuj earthquake data, Gujarat, India This study pertains to prediction of liquefaction susceptibility of unconsolidated sediments using artificial neural network (ANN) as a prediction model. The backpropagation neural network was trained, tested, and validated with 23 datasets comprising parameters such as cyclic resistance ratio (CRR), cyclic stress ratio (CSR), liquefaction severity index (LSI), and liquefaction sensitivity index (LSeI). The network was also trained to predict the CRR values from LSI, LSeI, and CSR values. The predicted results were comparable with the field data on CRR and liquefaction severity. Thus, this study indicates the potentiality of the ANN technique in mapping the liquefaction susceptibility of the area.

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

liquefaction susceptibility
neural network
bhuj


visualizing threads, transactions and tasks Modern systems, particularly servers, involve multiple threads dealing with multiple incoming transactions using either implicit or explicit internal tasks. Understanding the inherently complex behavior of such systems can be quite difficult. We present a framework that offers a visualization of this behavior in system-specific terms in real time. The framework is unique in that it uses a combination of program analyses to minimize the work the user needs to do to construct the visualization.

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

reactive systems
software visualization
program understanding
event handling


A simple approach to the control of locomotion in self-reconfigurable robots In this paper we present role-based control which is a general bottom-up approach to the control of locomotion in self-reconfigurable robots. We use role-based control to implement a caterpillar, a sidewinder, and a rolling track gait in the CONRO self-reconfigurable robot consisting of eight modules. Based on our experiments and discussion we conclude that control systems based on role-based control are minimal, robust to communication errors, and robust to reconfiguration. (C) 2003 Elsevier Science B.V. 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 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

self-reconfigurable robots
role-based control


Sensitivity Analysis for Biomedical Models This article discusses the application of sensitivity analysis (SA) in biomedical models. Sensitivity analysis is widely applied in physics, chemistry, economics, social sciences and other areas where models are developed. By assigning a prior probability distribution to each model variable, the SA framework appeals to the posterior probabilities of the model to evaluate the relative importance of these variables on the output distribution based on the principle of general variance decomposition. Within this framework, the SA paradigm serves as an objective platform to quantify the contributions of each model factor relative to their empirical range. We present statistical derivations of variance-based SA in this context and discuss its detailed properties through some practical examples. Our emphasis is on the application of SA in the biomedical field. As we show, it may provide a useful tool for model quality assessment, model reduction and factor prioritization, and improve our understanding of the model structure and underlying mechanisms. When usual approaches for calculating sensitivity index involve the employment of Monte Carlo analysis, which is computationally expensive in the large-sampling paradigm, we develop two effective numerical approximate methods for quick SA evaluations based on the unscented transformation (UT) that utilize a deterministic sampling approach in place of random sampling to calculate posterior statistics. We show that these methods achieve an excellent compromise between computational burden and calculation precision. In addition, a clear guideline is absent to evaluate the importance of variable for model reduction, we also present an objective statistical criterion to quantitatively decide whether or not a descriptive parameter is nominal and may be discarded in ensuing model-based analysis without significant loss of information on model behavior.

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

probability distribution
sensitivity analysis

biomedical model
monte carlo simulation
unscented transform (ut)


Risk-adjusted probability measures in portfolio optimization with coherent measures of risk We consider the problem of optimizing a portfolio of n assets, whose returns are described by a joint discrete distribution. We formulate the meanrisk model, using as risk functionals the semideviation, deviation from quantile, and spectral risk measures. Using the modern theory of measures of risk, we derive an equivalent representation of the portfolio problem as a zero-sum matrix game, and we provide ways to solve it by convex optimization techniques. In this way, we reconstruct new probability measures which constitute part of the saddle point of the game. These risk-adjusted measures always exist, irrespective of the completeness of the market. We provide an illustrative example, in which we derive these measures in a universe of 200 assets and we use them to evaluate the market portfolio and optimal risk-averse portfolios.

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


An algorithm using length-r paths to approximate subgraph isomorphism The LeRP algorithm approximates subgraph isomorphism for attributed graphs based on counts of length-r paths. The algorithm provides a good approximation to the maximal isomorphic subgraph. The basic approach of the LeRP algorithm differs fundamentally from other methods. When comparing structural similarity LeRP uses a neighborhood of nodes that varies in size dynamically. This approach provides sufficient evidence of similarity to permit LeRP to form a node-to-node mapping and can be computed with polynomial effort in the worst-case. Results from over 32,000 simulated cases are reported. We demonstrate that LeRP does not need a high dynamic range of node and edge coloring to perform well. For example, LeRP can input 50-node and 100-node graphs that contain a common 50-node subgraph, and then compute a matching subgraph having 49.740.46 nodes (mean one standard deviation). This takes from 0.4 to 0.5 s. In this example, 100 trials were evaluated and graphs had discrete coloring for nodes and edges with a dynamic range of four. Test conditions are varied and include strongly regular graphs as well as Model A.

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

approximate graph matching
attributed relational graphs


Thermo-mechanical behavior and microstructural evolution of electrochemically deposited low-alloyed Cu(Ag) thin films The stress evolution in electrochemically deposited coppersilver alloy thin films during thermal cycling from RT up to 500 C is presented. Stresstemperature behavior was studied by laser-optical substrate curvature measurements, and the results are compared with the behavior of pure copper films. It will be shown that Cu(Ag) reacts elastically to thermal stress loading up to 180 C. The influence of the substrate on the ?(T) curves will be discussed. Furthermore, microstructure (e.g., grain size, single grain orientation) developing during thermal treatment has been investigated. It is shown that the microstructure of Cu(Ag) films is thermally stable after the first cycle.

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

cuag thin films
thermal cycling
microstructure