Reduced Power Transition Fault Test Sets for Circuits With Independent Scan Chain Modes This brief considers circuits with multiple scan chains where each scan chain can operate in shift, functional, or hold mode independently of the other scan chains. For circuits where the hardware overhead of controlling the scan chains independently is acceptable, this brief describes a procedure whose goal is to generate a test set that achieves the same transition fault coverage as a test set that consists of both broadside and skewed-load tests, but where the shift mode is used as few times as possible during the first patterns of the tests. This allows the circuit to operate closer to its functional operation conditions, and reduces the power dissipation during the second patterns of the tests, which are applied at-speed.

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

design-for-testability
full-scan circuits
switching activity
transition faults
two-pattern tests


Models and methods for plan diagnosis We consider a model-based diagnosis approach to the diagnosis of plans. Here, a plan performed by some agent(s) is considered as a system to be diagnosed. We introduce a simple formal model of plans and plan execution where it is assumed that the execution of a plan can be monitored by making partial observations of plan states. These observed states are used to compare them with states predicted based on (normal) plan execution. Deviations between observed and predicted states can be explained by qualifying some plan steps in the plan as behaving abnormally. A diagnosis is a subset of plan steps qualified as abnormal that can be used to restore the compatibility between the predicted and the observed partial state. Besides minimum and subset minimal diagnoses, we argue that in plan-based diagnosis maximum informative diagnoses should be considered as preferred diagnoses, too. The latter ones are diagnoses that make the strongest predictions with respect to partial states to be observed in the future. We show that in contrast to minimum diagnoses, finding a (subset minimal) maximum informative diagnosis can be achieved in polynomial time. Finally, we show how these diagnoses can be found efficiently if the plan is distributed over a number of agents.

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


A novel hybrid prediction algorithm to network traffic Network traffic describes the characteristics and users behaviors of communication networks. It is a crucial input parameter of network management and network traffic engineering. This paper proposes a new prediction algorithm to network traffic in the large-scale communication network. First, we use signal analysis theory to transform network traffic from time domain to time-frequency domain. In the time-frequency domain, the network traffic signal is decomposed into the low-frequency and high-frequency components. Second, the gray model is exploited to model the low-frequency component of network traffic. The white Gaussian noise model is utilized to describe its high-frequency component. This is reasonable because the low-frequency and high-frequency components, respectively, represent the trend and fluctuation properties of network traffic, while the gray model and white Gaussian noise model can well capture the characteristics. Third, the prediction models of low-frequency and high-frequency components are built. The hybrid prediction algorithm is proposed to overcome the problem of network traffic prediction in the communication network. Finally, network traffic data from the real network is used to validate our approach. Simulation results indicate that our algorithm holds much lower prediction error than previous methods.

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

traffic prediction
traffic modeling
time-frequency analysis


On the Complexity of Equivalence of Specifications of Infinite Objects We study the complexity of deciding the equality of infinite objects specified by systems of equations, and of infinite objects specified by lambda-terms. For equational specifications there are several natural notions of equality: equality in all models, equality of the sets of solutions, and equality of normal forms for productive specifications. For lambda-terms we investigate Bohm-tree equality and various notions of observational equality. We pinpoint the complexity of each of these notions in the arithmetical or analytical hierarchy. We show that the complexity of deciding equality in all models subsumes the entire analytical hierarchy. This holds already for the most simple infinite objects, viz. streams over {0, 1}, and stands in sharp contrast to the low arithmetical Pi(0)(2)-completeness of equality of equationally specified streams derived in [17] employing a different notion of equality.

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

infinite objects
equational specifications
equality
complexity


Object interaction detection using hand posture cues in an office setting Activity recognition plays a key role in providing information for context-aware applications. When attempting to model activities, some researchers have looked towards Activity Theory, which theorizes that activities have objectives and are accomplished through interactions with tools and objects. The goal of this paper is to determine if hand posture can be used as a cue to determine the types of interactions a user has with objects in a desk/office environment. Furthermore, we wish to determine if hand posture is user-independent across all users when interacting with the same objects in a natural manner. Our experiments indicate that (a) hand posture can be used to determine object interaction, with accuracy rates around 97%, and (b) hand posture is dependent upon the individual user when users are allowed to interact with objects as they would naturally.

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

glove-based interaction
haptics
cyberglove
context-aware
hand gesture


Approximating survivable networks with ?-metric costs The Survivable Network Design (SND) problem seeks a minimum-cost subgraph that satisfies prescribed node-connectivity requirements. We consider SND on both directed and undirected complete graphs with ?-metric costs when c(xz)??[c(xy)+c(yz)] c ( x z ) ? ? [ c ( x y ) + c ( y z ) ] for all x,y,z?V x , y , z ? V , which varies from uniform costs (?=1/2 ? = 1 / 2 ) to metric costs (?=1 ? = 1 ). For the k-Connected Subgraph (k-CS) problem our ratios are: 1 + 2 ? k ( 1 ? ? ) ? 1 2 k ? 1 for undirected graphs, and 1 + 4 ? 3 k ( 1 ? 3 ? 2 ) ? 1 2 k ? 1 for directed graphs and 1 2 ? ? < 1 3 . For undirected graphs this improves the ratios ? 1 ? ? of Bckenhauer et al. (2008) [3] and 2 + ? k n of Kortsarz and Nutov (2003) [11] for all k?4 k ? 4 and 1 2 + 3 k ? 2 2 ( 4 k 2 ? 7 k + 2 ) ? ? ? k 2 ( k + 1 ) 2 ? 2 . We also show that SND admits the ratios 2 ? 1 ? ? for undirected graphs, and 4 ? 3 1 ? 3 ? 2 for directed graphs with 1 / 2 ? ? < 1 / 3 . For two important particular cases of SND, so-called Subsetk-CS and Rooted SND, our ratios are 2 ? 3 1 ? 3 ? 2 for directed graphs and ? 1 ? ? for subsetk-CS on undirected graphs.

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

graph connectivity
approximation algorithms


A DempsterShafer Based Tit-for-Tat Strategy to Regulate the Cooperation in VANET Using QoS-OLSR Protocol In this paper, we address the problem of cooperation among vehicles in VANET using QoS-OLSR protocol in the presence of selfish nodes. QoS-OLSR is a proactive protocol that considers the Quality of Service (QoS) of the nodes while electing the cluster-heads and selecting the Multi-Point Relay (MPRs) nodes. Cluster-heads and MPRs might misbehave on the roads by over-speeding or under-speeding. Classical and generous Tit-for-Tats are proposed to analyze the interaction among vehicles. However, both strategies are not able to enforce the cooperation due the fact that they (1) count on individual watchdogs monitoring, (2) rely on the node-to-node cooperation decision, (3) and ignore the high mobility and packet collisions. Therefore, we propose a DempsterShafer based Tit-for-Tat strategy that is able to improve the decision and regulate the cooperation in the vehicular network. This is done by (1) launching a cooperative watchdogs monitoring, (2) correlating the observations of the different watchdogs using DempsterShafer theory, and (3) propagating the decisions among clusters. Thereafter, we compare the DempsterShafer based strategy with several strategies derived from the original Tit-for-Tat. Simulation results prove that the DempsterShafer based strategy is able to maintain the survivability of the vehicular network in the presence of high mobility and packet collisions with minimal time and overhead.

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

vehicular ad hoc network (vanet)
qos-olsr
packet collision
tit-for-tat
game theory
information dissemination


Automated finite element model updating of full-scale structures with PARameter Identification System (PARIS) Automated FE model updating for structural health monitoring. Development of FE model updating framework called PARIS. Customizable research software utilizing API of existing commercial software. Solution of parameter estimation problems distributed between different software platforms. Demonstration of FE model updating for full-scale structures with damage scenarios.

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

finite element model updating
parameter estimation

inverse problems
full-scale structures
application programming interface (api)
parameter identification system (paris)


The optimal level of fuzz: case studies in a methodology for psychological research Cognitive science research is hard to conduct, because researchers must take phenomena from the world and turn them into laboratory tasks for which a reasonable level of experimental control can be achieved. Consequently, research necessarily makes tradeoffs between internal validity (experimental control) and external validity (the degree to which a task represents behaviour outside of the lab). Researchers are thus seeking the best possible trade-off between these constraints, which we refer to as the optimal level of fuzz. We present two principles for finding the optimal level of fuzz, in research, and then illustrate these principles using research from motivation, individual differences and cognitive neuroscience.

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


The information security digital divide between information security managers and users Empirical findings from surveys and in-depth interviews with information security managers and users indicate that a digital divide exists between these groups in terms of their views on and experience of information security practices. Information security professionals mainly regard users as an information security threat, whereas users believe themselves that they are an untapped resource for security work. The limited interaction between users and information security managers results in a lack of understanding for the other's point of view. These divergent views on and interpretations of information security mean that managers tend to base their practical method on unrealistic assumptions, resulting in management approaches that are poorly aligned with the dynamics of the users' working day.

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

information security
digital divide
users

information security managers
qualitative research
risk perception


An adaptive fuzzy hybrid state observer for bioprocesses In order to monitor and control bioprocesses, online measurements of certain biological variables, like biomass concentration, are normally required. Unfortunately, there is a lack of highly reliable and low cost instruments for online measuring these important variables. These limitations have motivated the use of observers. This paper describes a state observer for bioprocesses based on a hybrid fuzzy model. The model combines the mass balances and a fuzzy inference system for approximating the uncertain dynamic of the kinetic reactions. The convergence, stability, and robustness of the observer are analyzed. The main features of this observer are illustrated by considering a lactic fermentation.

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

adaptive observers
bioprocessors
fuzzy systems
nonlinear systems


natural interaction sensitivetable The SensitiveTable is a large multi-touch display that detects and tracks hands and objects in contact with it at 60 frames per second with a resolution of about 1.5 millimeters. A software application framework allows the creation of custom natural experiences. The table is equipped with array microphones and RFID antennas on its edges. The table runs a speaker independent speech recognition engine, based on a very small vocabulary, that is invoked only in specific circumstances. RFID tagged objects are used to populate the interface with contents, activate functions and authenticate users. Due to its analytical nature (high resolution and multi-point gestures), the table in the public space is used mostly as a form of digital mediation between two or more persons (e.g. consultant and customer): the expert can lead the novice through the more complex and less intuitive dynamics of interaction. We provide the SensitiveTable as an example of analytical natural interaction.

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


Iterative design of a semi-autonomous social telepresence robot research platform: a chronology Our research focuses on how a telepresence robot operator, the people with the robot, and the robot itself collaborate so that the operator reaches his/her intended destination. Our research requires higher levels of autonomous navigation so that the robot can, for example, go to a specified destination and follow a person. However, commercial telepresence robots are primarily teleoperated, and only a few provide assisted navigation around obstacles. Our system must include sensors and processing to enable these capabilities. We present the chronology of our iterative design for augmenting two VGo Communications VGo robots, Hugo and Margo, over a period of 3years. We detail the requirements and design constraints encountered while developing our telepresence robot platforms.

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

humanrobot interaction
remote presence
embodied video conferencing


Youth appropriation of social media for collaborative and facilitated design-based learning ? Youth participated in an afterschool design-based STEM program. Social networking forums (SNFs) were integrated as tools for design-based learning. SNF posts were analyzed using the theoretical framework of connected learning. Youth used SNFs to collaborate with others on designs and articulate knowledge. Facilitators played a role in encouraging youth to persist in the design process.

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

collaborative learning
design thinking
facilitation strategies
integrative stem education
middle school-age youth


document clustering with cluster refinement and model selection capabilities In this paper, we propose a document clustering method that strives to achieve: (1) a high accuracy of document clustering, and (2) the capability of estimating the number of clusters in the document corpus (i.e. the model selection capability). To accurately cluster the given document corpus, we employ a richer feature set to represent each document, and use the Gaussian Mixture Model (GMM) together with the Expectation-Maximization (EM) algorithm to conduct an initial document clustering. From this initial result, we identify a set of discriminative featuresfor each cluster, and refine the initially obtained document clusters by voting on the cluster label of each document using this discriminative feature set. This self-refinement process of discriminative feature identification and cluster label voting is iteratively applied until the convergence of document clusters. On the other hand, the model selection capability is achieved by introducing randomness in the cluster initialization stage, and then discovering a value C for the number of clusters N by which running the document clustering process for a fixed number of times yields sufficiently similar results. Performance evaluations exhibit clear superiority of the proposed method with its improved document clustering and model selection accuracies. The evaluations also demonstrate how each feature as well as the cluster refinement process contribute to the document clustering accuracy.

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

value
use
initialization
document clustering
paper
voting
convergence
label
method
accuracy
capabilities
identification
process
demonstrate
algorithm
refine
feature
model selection
cluster

estimates
gaussian mixtures model
performance evaluation
randomization
evaluation
expectation - maximization
documentation
em algorithm


Decision procedure for temporal logic of belief and actions A temporal logic of belief and actions (TLBA) is considered. The TLBA allows us to express informational and dynamic properties of computational agents. The considered fragment of TLBA allows one: (1) to present a deduction-based structured decision procedure; (2) to separate a decision procedure for so-called induction-free formulas and (3) to use only logical axioms for such formulas. The main new technical tool of the presented decision procedure is separation rules which incorporate traditional rules for the temporal operator "next", belief modalities and action constants.

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

rational agent
modal
and dynamic logics
agent-based logic
deduction-based decision procedure
sequent calculus


associative caches in formal software timing analysis Precise cache analysis is crucial to formally determine program running time. As cache simulation is unsafe with respect to the conservative running time bounds for real-time systems, current cache analysis techniques combine basic block level cache modeling with explicit or implicit program path analysis. We present an approach that extends instruction and data cache modeling from the granularity of basic blocks to program segments thereby increasing the overall running time analysis precision. Data flow analysis and local simulation of program segments are combined to safely predict cache line contents for associative caches in software running time analysis. The experiments show significant improvements in analysis precision over previous approaches on a typical embedded processor.

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


Cooperative Encoding for Secrecy in Interference Channels This paper investigates the fundamental performance limits of the two-user interference channel in the presence of an external eavesdropper. In this setting, we construct an inner bound, to the secrecy capacity region, based on the idea of cooperative encoding in which the two users cooperatively design their randomized codebooks and jointly optimize their channel prefixing distributions. Our achievability scheme also utilizes message-splitting in order to allow for partial decoding of the interference at the non-intended receiver. Outer bounds are then derived and used to establish the optimality of the proposed scheme in certain cases. In the Gaussian case, the previously proposed cooperative jamming and noise-forwarding techniques are shown to be special cases of our proposed approach. Overall, our results provide structural insights on how the interference can be exploited to increase the secrecy capacity of wireless networks.

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

cooperative encoding
interference channel


Usage of class dependency based feature selection and fuzzy weighted pre-processing methods on classification of macular disease In this paper, we propose a new feature selection method called class dependency based feature selection for dimensionality reduction of the macular disease dataset from pattern electroretinography (PERG) signals. In order to diagnosis of macular disease, we have used class dependency based feature selection as feature selection process, fuzzy weighted pre-processing as weighted process and decision tree classifier as decision making. The proposed system consists of three parts. First, we have reduced to 9 features number of features of macular disease dataset that has 63 features using class dependency based feature selection, which is first developed by ours. Second, the macular disease dataset that has 9 features is weighted by using fuzzy weighted pre-processing. And finally, decision tree classifier was applied to PERG signals to distinguish between healthy eye and diseased eye (macula diseases). The employed class dependency based feature selection, fuzzy weighted pre-processing and decision tree classifier have reached to 96.22%, 96.27% and 96.30% classification accuracies using 51015-fold cross-validation, respectively. The results confirmed that the medical decision making system based on the class dependency based feature selection, fuzzy weighted pre-processing and decision tree classifier has potential in detecting the macular disease. The stated results show that the proposed method could point out the ability of design of a new intelligent assistance diagnosis system.

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


A 2k kernel for the cluster editing problem The CLUSTER EDITING problem is a decision problem that, for a graph G and a parameter k, determines if one can apply at most k edge insertion/deletion operations on G so that the resulting graph becomes a union of disjoint cliques. The problem has attracted much attention because of its applications in a variety of areas. In this paper, we present a polynomial-time kernelization algorithm for the problem that produces a kernel of size bounded by 2k. More precisely, we develop an O(mn)-time algorithm that, on a graph G of n vertices and m edges and a parameter k, produces a graph G' and a parameter k' such that k' <= k, that G' has at most 2k' vertices, and that (G, k) is a yes-instance if and only if (G', k') is a yes-instance of the CLUSTER EDITING problem. This improves the previously best kernel of size 4k for the problem. (C) 2011 Elsevier Inc. All rights reserved.

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

np-hard problem
parameterized computation
critical clique


Routine automated synthesis of five patented analog circuits using genetic programming This article reports on a project in which we browsed patents issued after January 1, 2000 to commercial enterprises or university research institutions for analog electrical circuits. We then employed genetic programming to automatically design (synthesize) entities that duplicated the functionality of five post-2000 issued patents. The automated method works from a high-level statement of the circuit's intended function. The article addresses the question of what is actually delivered by the operation of the artificial problem-solving method in relation to the amount of intelligence that is supplied by the humans employing the method (something we refer to as the yield of an automated method). The article also addresses the question of the routineness of the artificial problem-solving method - that is, the amount of effort required to make the transition from problem to problem within a particular domain. The conclusion is that the artificial method routinely delivers high-yield, human-competitive (i.e., previously patented) results.

O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 circuit synthesis
evolvable hardware
automated design
artificial intelligence


Dynamic degradation observer for bearing fault by MTSSOM system Rolling element bearings are used in a wide variety of rotating machinery from small hand-held devices to heavy duty industrial systems. Bearing fault or even failure is one of the foremost causes of breakdown in such rotating machines, resulting in costly system downtime. This paper presents a dynamic degradation observer for the identification and assessment of bearing degradation based on MahalanobisTaguchi system (MTS) and self-organization mapping (SOM) network called MTSSOM system. It helps to differentiate especially the incipient fault stage and track the dynamic degradation trend of the running bearing by real-time vibration observations. The feature parameters from multifractal aspects are calculated first and further optimized by the MTS statistical method. Mappings of different degradation levels are then presented by SOM with optimal multifractal features, which help to differentiate each degradation stage and describe a degradation trajectory of the in-service bearing. The found results are validated by experiment, and a comparative study is carried out to verify the effectiveness of the proposed method. The contribution of the method considering both current and predictive perspectives on the fault degradation behavior is also showed for the elaborate maintenance management.

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

dynamic degradation observer
mts
multifractal
som
degradation trend


Improvements towards a reliable fabrication process for cMUT This paper reports the fabrication process for capacitive micromachined ultrasonic transducers (cMUT) using surface micromachining techniques. We describe the processing steps that allow control with high repeatability of the transducer geometrical features (membrane radius, membrane thickness, vertical distance between electrodes) and of the mechanical properties of the structural materials (stress in the silicon nitride layer). The transducers are fabricated with the fixed electrode patterned on top of the silicon wafer, which works as a support for the device, thus reducing parasitic capacitances. Tests of cMUTs with 0.5-?m-thick silicon nitride membranes suspended on 0.4-?m-thick cavities were performed showing resonance frequency at 5.5 MHz.

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

capacitive transducer
sealed cavities
operation in liquid


Bayesian knowledge base tuning For a knowledge-based system that fails to provide the correct answer, it is important to be able to tune the system while minimizing overall change in the knowledge-base. There are a variety of reasons why the answer is incorrect ranging from incorrect knowledge to information vagueness to incompleteness. Still, in all these situations, it is typically the case that most of the knowledge in the system is likely to be correct as specified by the expert(s) and/or knowledge engineer(s). In this paper, we propose a method to identify the possible changes by understanding the contribution of parameters on the outputs of concern. Our approach is based on Bayesian Knowledge Bases for modeling uncertainties. We start with, single parameter changes and then extend to multiple parameters. In order to identify the optimal solution that can minimize the change to the model as specified by the domain experts, we define and evaluate the sensitivity values of the results with respect to the parameters. We discuss the computational complexities of determining the solution and show that the problem of multiple parameters changes can be transformed into Linear Programming problems, and thus, efficiently solvable. Our work can also be applied towards validating the knowledge base such that the updated model can satisfy all test-cases collected from the domain experts. (C) 2013 Elsevier Inc. 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Point-of-care testing (POCT) diagnostic systems using microfluidic lab-on-a-chip technologies Introduction on POCT diagnostic systems and their requirements in general. Review on demonstrated and commercially available POCT diagnostic systems. Discussion on current limitations and future prospects of POCT diagnostic systems.

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

point-of-care testing (poct)
microfluidic lab-on-a-chip technologies
sample-to-answer


Design of a hyperspectral nitrogen sensing system for orange leaves The orange (Citrus sinensis) is one of the most important agricultural crops in Florida. Heavy reliance on agricultural chemicals and low fertilizer use efficiencies in citrus production have raised environmental and economic concerns. In this study, a nitrogen sensor was developed to predict nitrogen concentrations in orange leaves. Four design criteria were chosen to maximize the sensing efficiency and reliability. They were: (1) coverage of the spectral N sensing range, (2) no moving parts, (3) single leaf detection, and (4) diffuse reflectance measurement. Based on chlorophyll and protein spectral absorption bands, the sensor's wavelength ranges were chosen to be 620950nm and 14002500nm. A reflectance housing was designed to block environmental noise and to ensure single leaf measurement. A halogen light source, two detector arrays, two linear variable filters, and data acquisition cards with 16-bit analog-to-digital converters were used to collect data. The designed N sensor had a spectral resolution less than 30nm. Test results showed that the nitrogen sensor had good linearity (r>0.99) and stability. With averaged signal-to-noise ratio (SNR) of 299, the system was able to predict N content with a root mean square difference (RMSD) of l.69gkg?1 for the validation data set. Using the N sensor, unknown leaf samples could be classified into low, medium and high N levels with 70% accuracy.

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

hyperspectral
nitrogen
orange citrus
reflectance
sensor


server selection on the world wide web Significant efforts are being made to digitize rare and valuable library materials, with the goal of providing patrons and historians digital facsimiles that capture the "look and feel" of the original materials. This is often done by digitally photographing the materials and making high resolution 2D images available. The underlying assumption is that the objects are flat. However, older materials may not be flat in practice, being warped and crinkled due to decay, neglect, accident and the passing of time. In such cases, 2D imaging is insufficient to capture the "look and feel" of the original. For these materials, 3D acquisition is necessary to create a realistic facsimile. This paper outlines a technique for capturing an accurate 3D representation of library materials which can be integrated directly into current digitization setups. This will allow digitization efforts to provide patrons with more realistic digital facsimile of library materials.

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

digitize
world wide web
3d
imaging
representation
paper
server

select
distributed information retrieval
object
material
timing
libraries
practical
effectiveness evaluation
server selection
integrability


Java access protection through typing We propose an integration of field access rights into the Java type system such that those access permission checks which are now performed dynamically (at run time), can instead be done statically, i.e. checked by the Java compiler and rechecked (at link time) by the bytecode verifier. We explain how this can be extended to remove all dynamic checks of field read access rights, completely eliminating the overhead of get methods for reading the value of a field. Improvements include using fast static lookup instead of dynamic dispatch for field access (without requiring a sophisticated inlining analysis), the space required by get methods is avoided, and denial-of-service attacks on field access is prevented. We sketch a formalization of adding field access to the bytecode verifier which will make it possible to prove that the change is safe and backwards compatible. Copyright (C) 2001 John Wiley & Sons, Ltd.

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

java virtual machine
java bytecode verification
read-only field access


On Causal Estimation From Bandlimited Stationary Sequences This paper considers the problem of estimating a stationary sequence from the observation of a stationary correlated sequence x by means of a causal linear filter. Thereby, it is assumed that the spectral density Phi(x) of x vanishes on a subset of the unit circle of positive Lebesgue measure such that the classical derivation of the estimation filter, based on the spectral factorization of Phi(x), can not be applied. The paper derives the transfer function of such an estimation filter, discusses its stability behavior, and applies the result to the causal reconstruction of deterministic signals from its samples.

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

causality
frames
linear filtering
sampling


Some continuous programming problems in numerical analysis Many problems in the design and implementation of computational schemes may be studied using the theory and methods of mathematical programming. One seeks to minimize bounds for the errors in the calculated results obtained from a given set of input data, exploiting analytical relations. We describe optimal quadrature rules and give an application to the evaluation of the sums of power series, belonging to an important class. We present results which are based on the theory of linear and semi-infinite programming. We also study the associated complexity issues and obtain simple qualitative results for the computational work required.

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

semi-infinite programming
linear functional
numerical quadrature
convergence acceleration


capturing and supporting contexts for scientific data sharing via the biological sciences collaboratory Scientific collaboration is largely focused on the sharing and joint analysis of scientific data and results. Today, a movement is afoot within the scientific computing community to shift "collaboratory" development from traditional tool-centric approaches to more data-centric ones. Yet, to effectively support data sharing means more than providing a common repository for storing and retrieving shared data sets. In order to reasonably comprehend and apply another researcher's data set, the scientist must grasp the various contexts of the data as it relates to the overall data space, applications, experiments, projects, and the scientific community. Under development at the Pacific Northwest National Laboratory, the Biological Sciences Collaboratory (BSC) enables the sharing of biological data and analyses through diverse capabilities such as metadata capture, electronic laboratory notebooks, data organization views, data provenance tracking, analysis notes, task management, and scientific workflow management. Overall, BSC strives to identify and capture the various social and scientific contexts in which data sharing collaborations in biology take place and to provide collaboration tools and capabilities that can effectively support and facilitate these important data sharing contexts.

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

scientific workflow
data sharing contexts
data sharing
data provenance
collaboratory
metadata

data-centric collaboration
tool-centric collaboration


Capacity of Channels With Action-Dependent States We consider channels with action-dependent states: Given the message to be communicated, the transmitter chooses an action sequence that affects the formation of the channel states, and then creates the channel input sequence based on the state sequence. We characterize the capacity of such a channel both for the case where the channel inputs are allowed to depend noncausally on the state sequence and the case where they are restricted to causal dependence. Our setting covers previously considered scenarios involving transmission over channels with states known at the encoder, as well as various new coding scenarios for channels with a "rewrite" option that may arise naturally in storage for computer memories with defects or in magnetic recoding. A few examples are worked out in detail.

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

actions
channel with a rewrite option
channel with states
cost constraints
dirty paper coding
gel'fand-pinsker channel
shannon channel


Fluorescent Cargo Proteins in Peptidergic Endocrine Cells Fluorescent fusion proteins are an important tool for the study of vesicle trafficking and exocytosis, especially when combined with newer types of microscopy. We previously reported that the design of a vesicle-targeted fluorescent fusion construct strongly influences the kinetics of fluorescence change at exocytosis. In the present study we demonstrate that the cell in which a construct is expressed also affects the kinetics of fluorescence change at exocytosis. We fused enhanced green fluorescent protein to the carboxy terminus of the vesicular cargo protein rodent islet amyloid polypeptide. The two proteins were separated by a linker sequence of 18 amino acids. We then compared kinetics of fluorescence change at exocytosis for this fluorescent cargo protein expressed in three different types of peptidergic endocrine cell: pancreatic alpha cell, pancreatic beta cell, and adrenal chromaffin cell. In resting cells of all three types, fluorescent spots of similar size and membrane-proximal density appeared near the plasma membrane as expected if the probe is stored in large dense-core secretory vesicles. Upon stimulation, the fluorescent spots displayed sudden changes in fluorescence intensity that were consistent with exocytosis. In beta and alpha cells the fluorescent spots consistently brightened and persisted, whereas in chromaffin cells the fluorescent spots always dispersed rapidly. Thus, for fluorescent cargo proteins in peptidergic endocrine cells, cell type influences the kinetics of fluorescence change at exocytosis. Together with our previous findings, this observation strongly highlights the fact that the behavior of vesicle-targeted fluorescent cargo may be unrelated to that of native cargo, and it emphasizes the need for caution in interpreting fluorescence kinetics in terms of an exocytosis mechanism.

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

peptide hormones
islets of langerhans
insulin
insulin-secreting cells
glucagon-secreting cells
green fluorescent proteins
chromaffin granules
membrane fusion


cross-media manifold learning for image retrieval & annotation Fusion of visual content with textual information is an effective way for both content-based and keyword-based image retrieval. However, the performance of visual & textual fusion is affected greatly by the data noise and redundancy in both text (such as surrounding text in HTML pages) and visual (such as intra-class diversity) aspects. This paper presents a manifold-based cross-media optimization scheme to achieve visual & textual fusion within a unified framework. Cross-Media manifold co-training mechanism between Keyword-based Metric Space and Vision-Based Metric Space is proposed creatively to infer a best dual-space fusion by minimizing manifold-based visual & textual energy criterion. We present the Isomorphic Manifold Learning to map the annotation affection in image visual space onto keyword semantic space by manifold shrinkage. We also demonstrate its correctness and convergence from mathematical perspective. The retrieval can be performed using both keyword or sample images respectively on Keyword-Based Metric Space and Vision-Based Metric Space, while the simple distance classifiers will satisfy. Two groups of experiments are conducted: The first group is carried on Corel 5000 image database to validate our effectiveness by comparing with state-of-the-art Generalized Manifold Ranking Based Image Retrieval and SVM. The second group is done over real-world Flickr dataset with over 6,000 images to testify our effectiveness in real-world application. The promising results show that our model attains a significant improvement over state-of-the-art algorithms.

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

content-based image retrieval
web image search
automatic image annotation
co-training


visualizing casual effects in 4d space-time vector fields In this paper, we present a method to juxtapose 4D space-time vector fields in which one contains a "source" variable and the other the "response" field. The technique helps highlight the topological relationship between the two in an effort to understand the causal connection. These concepts are applied to ongoing research in evolving fluid dynamical problems.

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

research method response paper connection

variability visualization vectorization relationships space concept timing effect


Conceptualising and structuring semantics in cooperative enterprise information systems models Enterprise performance is, now more than ever, one of the key points for reaching the market success. In order to increase it, economics paradigms focus on how to better manage knowledge acquiring, sharing and update. Knowledge management can be approached with the possibility offered by the sustainability goals trying to optimise different enterprise strategic domains. The modern architecture of information systems (ISs) is based on distributed networks with a grand challenge of representing and sharing knowledge managed by ISs and consequently, to remove semantics interoperability barriers. First, this paper analyses interoperability issues between cooperative enterprise information systems (CEIS). Based on this analysis, the authors propose a conceptualisation approach for semantics discovery and management in enterprise information systems models, based on applying fact-oriented transformation rules. The input of the transformation process is a conceptualised UML class model, reverse-engineered from an implemented model, and transformed into a fact-oriented model (FOM), which makes explicit the finest-grained semantics. Semantics aggregates are then computed for structuring the whole semantics embedded in enterprise applications. They define independent set of concepts with their own minimal mandatory semantics. Finally a case study is proposed to validate the practicability of our approach in a real scaled scenario involving an enterprise resource planning (ERP) and a manufacturing execution system (MES). (C) 2012 Elsevier B.V. All rights reserved.

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

enterprise information systems
transformation rules

conceptual modelling
semantic interoperability
fact-oriented model


A faceted approach to conceptualizing tasks in information seeking The nature of the task that leads a person to engage in information interaction, as well as of information seeking and searching tasks, have been shown to influence individuals information behavior. Classifying tasks in a domain has been viewed as a departure point of studies on the relationship between tasks and human information behavior. However, previous task classification schemes either classify tasks with respect to the requirements of specific studies or merely classify a certain category of task. Such approaches do not lead to a holistic picture of task since a task involves different aspects. Therefore, the present study aims to develop a faceted classification of task, which can incorporate work tasks and information search tasks into the same classification scheme and characterize tasks in such a way as to help people make predictions of information behavior. For this purpose, previous task classification schemes and their underlying facets are reviewed and discussed. Analysis identifies essential facets and categorizes them into Generic facets of task and Common attributes of task. Generic facets of task include Source of task, Task doer, Time, Action, Product, and Goal. Common attributes of task includes Task characteristics and Users perception of task. Corresponding sub-facets and values are identified as well. In this fashion, a faceted classification of task is established which could be used to describe users work tasks and information search tasks. This faceted classification provides a framework to further explore the relationships among work tasks, search tasks, and interactive information retrieval and advance adaptive IR systems design.

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

work task
search task
information-seeking behavior
information search behavior


a multiprocessing approach to accelerate retargetable and portable dynamic-compiled instruction-set simulation Traditionally, instruction-set simulators (ISS's) are sequential programs running on individual processors. Besides the advances of simulation techniques, ISS's have been mainly driven by the continuously improving performance of single processors. However, since the focus of processor manufacturers is shifting from frequency scaling to multiprocessing, ISS developers need to seize this opportunity for further performance growth. This paper proposes a multiprocessing approach to accelerate one class of dynamic-compiled ISS's. At the heart of the approach is a simulation engine capable of mixed interpretative and compiled simulation. The engine selects frequently executed target code blocks and translates them into dynamically loaded libraries (DLLs), which are then linked to the engine at run time. While the engine performs simulation on one processor, the translation tasks are distributed among several assistant processors. Our experiment results using SPEC CINT2000 benchmarks show that this approach achieves on average 197 million instructions per second (MIPS) for the MIPS32 ISA and 133 MIPS for the ARM V4ISA. Compared with the uniprocessing configuration under the same general approach, multiprocessing offers higher performance and improved speed consistency. In addition, our approach is highly retargetable, portable and capable of simulating self-modifying code. To our best knowledge, this is the first reported approach that uses multiprocessing to accelerate functional simulation.

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


The design and implementation of an application program interface for securing XML documents The encryption and signature standards proposed by W3C specifying the format for encrypted XML documents are important advances towards XML security [Eastlake, Donald, Reagle, Joseph, Imamura, Takeshi, Dillaway, Blair, Simon, Ed, 2002. XML Encryption Syntax and Processing. W3C Recommendation 10 December 2002 , Eastlake, Donald, Reagle, Joseph, Solo, David, Bartel, Mark, Boyer, John, Fox, Barb, LaMacchia, Brian, Simon, Ed, 2002. XML-Signature Syntax and Processing W3C Recommendation, 12 February 2002. ]. Related works include the proposal of a specification language that allows a programmer to describe the security details of XML documents [Hwang, Gwan-Hwan, Chang, Tao-Ku, 2004. An operational model and language support for securing XML documents. Computers & Security 23(6), 498-529, Hwang, Gwan-Hwan, Chang, Tao-Ku, 2001. Document security language (DSL) and an efficient automatic securing too] for XML documents. International Conference on Internet Computing, Las Vegas, Nevada, USA, 24-28 June 2001, pp. 393-399]. Despite the success of these works, we consider them to be insufficient from the viewpoint of software engineering. In this paper, we employ some real examples to demonstrate that it is necessary to design an appropriate API for the securing system of subtree encryption for XML documents. The goal is to increase productivity and reduce the cost of maintaining this kind of software, for which we propose a document security language (DSL) API. We describe the implementation of the DSL API, and use experimental results to demonstrate its practicality. (C) 2006 Elsevier Inc. All rights reserved.

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

decryption
digital signature
document security language


In-line analysis of a fluid bed pellet coating process using a combination of near infrared and Raman spectroscopy Near infrared (NIR) and Raman spectroscopic analyzers applied through an immersion Lighthouse Probe (LHP) were used for simultaneous in-line monitoring of a fluid bed pellet coating process. Multivariate curve resolution analysis of data, collected from four pilot-scale batches, has shown that the two techniques deliver complementary information about the process and their combination may be synergistic. This data analysis enabled a much better understanding of some of the process observations and also gave some interesting insights into the best way to use the techniques themselves. PLS regression analysis of the product moisture and the quantity of coating material sprayed was performed using NIR and Raman data blocks both separately and in combination. The performance of method combination compared to individual techniques is analyzed and discussed. Copyright (C) 2010 John Wiley & Sons, Ltd.

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

pellet coating
raman spectroscopy
multivariate curve resolution
lighthouse probe

acryl-eze
opadry red
near infrared spectroscopy
moisture monitoring
simplisma
data augmentation
process analytical technology


Study on mobile mechanism of a climbing robot for stair cleaning: a translational locomotion mechanism and turning motion In human living environments, it is often the case that the cleaning area is three-dimensional space such as a high-rise building. An autonomous cleaning robot is proposed so as to move on all floors including stairs in a building. When a robot cleans in three-dimensional space, it needs to turn for direction in addition to climb down stairs. The proposed robot selects movement using legs or wheels depending on stairs or flat surfaces. In this paper, a mobile mechanism and a control method are described for translational locomotion. The translational mechanism is based on using two-wheel-drive type omni-directional mobile mechanism. To recognize a stair using the position-sensitive detector, the robot shifts from translational locomotion to climbing down motion or edge-following motion. It is shown that the proposed robot turns to face a stair with the accuracy of 5.

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


An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups In this paper we show that the hidden subgroup problem in nil-2 groups, that is in groups of nilpotency class at most 2, can be solved efficiently by a quantum procedure. The algorithm is an extension of our earlier method for extraspecial groups in Ivanyos et al. (Proceedings of the 24th Symposium on Theoretical Aspects of Computer Science (STACS), vol. 4393, pp. 586-597, 2007), but it has several additional features. It contains a powerful classical reduction for the hidden subgroup problem in nilpotent groups of constant nilpotency class to the specific case where the group is a p-group of exponent p and the subgroup is either trivial or cyclic. This reduction might also be useful for dealing with groups of higher nilpotency class. The quantum part of the algorithm uses well chosen group actions based on some automorphisms of nil-2 groups. The right choice of the actions requires the solution of a system of quadratic and linear equations. The existence of a solution is guaranteed by the Chevalley-Warning theorem, and we prove that it can also be found efficiently.

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

quantum computing
efficient algorithm
nilpotent group


Inhabitants' Environmental Perceptions in the City of Rome within the Framework for Urban Biosphere Reserves of the UNESCO Programme on Man and Biospherea The article presents the main tenets of the UNESCO Programme on Man and Biosphere (MAB), launched by the United Nations at the beginning of the 1970s. The program aimed at supporting applied research and scientific knowledge for managing natural resources in a rational and sustainable way. The implication of the full ecological perspective, typical of the MAB, for promoting multidisciplinary and integrated approaches in the study of environmental issues is briefly outlined. In particular, we point out the role of the MAB, through the biosphere reserve concept, in supporting the collaboration between natural-biological and social-behavioral sciences when dealing with biodiversity conservation problems and with urban ecosystems. Then, the specific UNESCO-MAB Project on the city of Rome, launched at the end of the 1980s, is briefly presented, together with the recent project of the Department of the Environment of the Rome Municipality to propose Rome's urban and periurban green areas as a new UNESCO-MAB Biosphere Reserve. The results of the main research activities conducted therein are summarized. In particular, the specific research lines of the environmental psychology research group, involved in the MAB-Rome Project for approximately two decades, are presented. These research lines dealt with various aspects of residents' environmental perceptions and behaviors in the city of Rome. The practical implications of these results are also briefly discussed.

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

urban biosphere reserves
biodiversity
environmental psychology

unesco-mab programme
ecosystem approach
sustainability
environmental perception
environmental awareness
residential satisfaction
environmental evaluation
environmental concern
environmental education


A new approach for EEG signal classification of schizophrenic and control participants This paper is concerned with a two stage procedure for analysis and classification of electroencephalogram (EEG) signals for twenty schizophrenic patients and twenty age-matched control participants. For each case, 20 channels of EEG are recorded. First, the more informative channels are selected using the mutual information techniques. Then, genetic programming is employed to select the best features from the selected channels. Several features including autoregressive model parameters, band power and fractal dimension are used for the purpose of classification. Both linear discriminant analysis (LDA) and adaptive boosting (Adaboost) are trained using tenfold cross validation to classify the reduced feature set and a classification accuracy of 85.90% and 91.94% is obtained by LDA and Adaboost, respectively. Another interesting observation from the channel selection procedure is that most of the selected channels are located in the prefrontal and temporal lobes confirming neuropsychological and neuroanatomical findings. The results obtained by the proposed approach are compared with a one stage procedure, the principal component analysis (PCA)-based feature selection, utilizing only 100 features selected from all channels. It is illustrated that the two stage procedure consisting of channel selection followed by feature reduction gives a more enhanced results in an efficient computation time.

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


New architecture for MPEG video streaming system with backward playback support MPEG digital video is becoming ubiquitous for video storage and communications. It is often desirable to perform various video cassette recording (VCR) functions such as backward playback in MPEG videos. However, the predictive processing techniques employed in MPEG severely complicate the backward-play operation. A straightforward implementation of backward playback is to transmit and decode the whole group-of-picture (GOP), store all the decoded frames in the decoder buffer, and play the decoded frames in reverse order. This approach requires a significant buffer in the decoder, which depends on the GOP size, to store the decoded frames. This approach could not be possible in a severely constrained memory requirement. Another alternative is to decode the GOP up to the current frame to be displayed, and then go back to decode the GOP again up to the next frame to be displayed. This approach does not need the huge buffer, but requires much higher bandwidth of the network and complexity of the decoder. In this paper, we propose a macroblock-based algorithm for an efficient implementation of the MPEG video streaming system to provide backward playback over a network with the minimal requirements on the network bandwidth and the decoder complexity. The proposed algorithm classifies macroblocks in the requested frame into backward macroblocks (BMBs) and forward/backward macroblocks (FBMBs). Two macroblock-based techniques are used to manipulate different types of macroblocks in the compressed domain and the server then sends the processed macroblocks to the client machine. For BMBs, a VLC-domain technique is adopted to reduce the number of macroblocks that need to be decoded by the decoder and the number of bits that need to be sent over the network in the backward-play operation. We then propose a newly mixed VLC/DCT-domain technique to handle FBMBs in order to further reduce the computational complexity of the decoder. With these compressed-domain techniques, the proposed architecture only manipulates macroblocks either in the VLC domain or the quantized DCT domain resulting in low server complexity. Experimental results show that, as compared to the conventional system, the new streaming system reduces the required network bandwidth and the decoder complexity significantly.

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

compressed-domain processing
digital video cassette recording
streaming video


Alternative emitter substrates for Ionic Liquid Ion Source implementation in focused ion beams Ionic Liquid Ion Sources (ILIS) are novel high-brightness sources for FIB. Traditional W emitters used in ILIS are oxidized to allow better wetting. The currentvoltage characteristics of the oxide emitters are obtained. Oxide ILIS emission is similar to the usual ionic emission from ILIS. The sources can operate for hundreds of hours with adequate short-term stability.

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

focused ion beam
source lifetime
reactive ions


The metabolic algorithm for P systems: Principles and applications Metabolic P systems, shortly MP systems, are a special class of P systems, introduced for expressing biological metabolism. An MP system evolution is given by a metabolic algorithm, a deterministic strategy, where the classical viewpoint on metabolic dynamics, in terms of ordinary differential equations. is replaced by suitable generalizations of chemical principles. The basic principles of MP systems are given and their main aspects are explained by means of examples of biological modeling. A new kind of regulation mechanism is outlined, which could be the basis for a more efficient construction of computational models from experimental data of specific metabolic processes. (C) 2008 Elsevier B.V. All rights reserved.

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

metabolism
biological modeling
p systems
mp systems


4th international workshop on adoption-centric software engineering The ACSE series of events aims to advance the adoptionof software engineering tools and techniques by bringingtogether researchers and practitioners who investigatenovel approaches to fostering the transition betweenlimited-use research prototypes and broadly applicablepractical solutions. One proven technique to aidadoption is to leverage existing commercial platformsand infrastructure. The key objective of ACSE 2004 is toexplore innovative approaches to the adoption of proof-of-concept systems by embedding them in extensions of Commercial Off-The-Shelf (COTS) products and/or using middleware technologies to integrate the prototypes into existing toolsets.

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

software engineering
tools
middleware
cots


A SVM controller for the stable walking of biped robots based on small sample sizes A SVM gait controller is proposed for the stable walking of biped robots. The SVM controller is equipped with a mixed kernel function for the gait learning. The SVM controller is trained based on small sample sizes. The proposed method can satisfy the ZMP criterion well.

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

biped robots
gait
small sample sizes
svm


Robust estimation of power quality disturbances using unscented H? filter Derivative free adaptive filtering based on unscented transformation. State space model using state variables and generation of sigma points for power quality estimation. Better tracking of power quality disturbances as compared to unscented Kalman filter (UKF). Minimum MSE as compared to RLS, EKF and UKF during estimation of harmonics and other power quality disturbances.

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

unscented transform
h? filter
additive white gaussian noise


LEFT-HANDNESS IN A FOUR-LEVEL ATOMIC SYSTEM A scheme is proposed for realizing simultaneous negative permittivity and negative permeability based on quantum coherence in a four-level dense atomic system here. Under some parametric conditions the system shows that simultaneous negative permittivity and negative permeability (i.e. Left-handness) can be achieved in a wider frequency band because of quantum coherence. And the novelty properties of gain and dispersion near the resonance frequency may have some potential applications.

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


A data mining approach for retailing bank customer attrition analysis Deregulation within the financial service industries and the widespread acceptance of new technologies is increasing competition in the finance marketplace. Central to the business strategy of every financial service company is the ability to retain existing customers and reach new prospective customers. Data mining is adopted to play an important role in these efforts. In this paper, we present a data mining approach for analyzing retailing bank customer attrition. We discuss the challenging issues such as highly skewed data, time series data unrolling, leaker field detection etc, and the procedure of a data mining project for the attrition analysis for retailing bank customers. We use lift as a proper measure for attrition analysis and compare the lift of data mining models of decision tree, boosted naive Bayesian network, selective Bayesian network, neural network and the ensemble of classifiers of the above methods. Some interesting findings are reported. Our research work demonstrates the effectiveness and efficiency of data mining in attrition analysis for retailing bank.

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


Disambiguation via default rules under answering complex question We develop the default logic for pragmatic analysis of natural language queries. Ambiguous sentences are considered so that each set of meanings is assigned an extension of default system. The approach is applied to natural language question answering, where even a correct semantic representation needs to be modified in accordance to the set of default rules to better match a knowledge domain.

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


Markov chain Monte Carlo estimation of normal ogive IRT models in MATLAB Modeling the interaction between persons and items at the item level for binary response data, item response theory (IRT) models have been found useful in a wide variety of applications in various fields. This paper provides the requisite information and description of software that implements the Gibbs sampling procedures for the one-, two- and three-parameter normal ogive models. The software developed is written in the MATLAB package IRTuno. The package is flexible enough to allow a use the choice to simulate binary response data, set the number of total or burn-in iterations, specify starting values or prior distributions for model parameters, check convergence of the Markov chain, and obtain Bayesian fit statistics. Illustrative examples are provided to demonstrate and validate the use of the software package. The m-file v25i08. m is also provided as a guide for the use of the MCMC algorithms with the three dichotomous IRT models.

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

item response theory
mcmc
gibbs sampling
matlab

unidimensional normal ogive models
gelman-rubin r
bayesian dic


An approach to improve LOINC mapping through augmentation of local test names Mapping medical test names into a standardized vocabulary is a prerequisite to sharing test-related data between health care entities. One major barrier in this process is the inability to describe tests in sufficient detail to assign the appropriate name in Logical Observation Identifiers, Names, and Codes (LOINC). Approaches to address mapping of test names with incomplete information have not been well described. We developed a process of enhancing local test names by incorporating information required for LOINC mapping into the test names themselves. When using the Regenstrief LOINC Mapping Assistant (RELMA) we found that 73/198 (37%) of enhanced test names were successfully mapped to LOINC, compared to 41/191 (21%) of original names (p=0.001). Our approach led to a significantly higher proportion of test names with successful mapping to LOINC, but further efforts are required to achieve more satisfactory results.

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


empirical evaluation of openccm for java-based distributed, real-time, and embedded systems Component technology can overcome many limitations of conventional Object Request Brokers (ORBs) in developing distributed, real-time, and embedded (DRE) applications. Component technology has particular advantages for building large-scale DRE systems. The CORBA Component Model (CCM) enables the composition and reuse of software components and the configuration of key non-functional aspects of DRE systems such as timing, fault-tolerance, and security. However, the CCM can introduce additional overhead to the runtime performance and code size of middleware. Hence, the overhead for using the CCM needs to be evaluated to determine if the CCM can be effectively employed in the design of high-reliability DRE applications. In this paper, we empirically evaluated the performance of OpenCCM, a Java-based implementation of the CCM standard, when configured with two Java ORBs: with ZEN, a real-time Java ORB, and with OpenORB, a desktop Java ORB. We measured throughput, latency, and jitter of method invocations for both ORBs configured with and without OpenCCM. We also measured the additional memory requirement introduced by the CCM implementation. We concluded that OpenCCM adds some overhead to both Java ORBs, affecting OpenORB's performance more than ZEN's. More development of the CCM may be necessary to bring its advantages to high-performance DRE systems.

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


A Helpfulness Modeling Framework for Electronic Word-of-Mouth on Consumer Opinion Platforms Electronic Word-of-Mouth (eWOM) is growing exponentially with the rapid development of electronic commerce. As a result, consumers are increasingly crowded by a huge amount of eWOM contents and therefore there is a need to automatically recommend eWOM contents that are helpful to them. Existing helpfulness assessment approaches that deterministically estimate the helpfulness of eWOM contents lack a generative formulation and are limited to the training set that has been voted by many readers. This article presents a rigorous probabilistic framework for inferring the "helpfulness" of eWOM contents which can build a "helpfulness" model from a low number of votes on eWOM contents. Furthermore, we introduce a measurement, "helpfulness" bias, as the benchmark for the "helpfulness" of eWOM documents. We also propose a model that exploits the graphical model and expectation maximization algorithm, under this probabilistic framework, to demonstrate the versatility of our framework. Our algorithm is compared experimentally to other existing helpfulness discovering algorithms and the experimental results show that our framework can effectively model the helpfulness of eWOM contents better than other approaches, and therefore indicate the capability of our framework to recommend helpful eWOMs to potential consumers.

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

ranking
recommender systems
online product reviews


A Phase-Based Approach for On-Chip Bus Architecture Optimization As the integration scale of a chip increases, on-chip interconnects suffer from the increased area occupied by a large number of bus signals. To reduce the overhead for communication, this paper formulates a new concept of an on-chip communication approach, called phase-based interconnection, with an example protocol, system-on-chip network protocol (SNP). In the phase-based communication, a small number of signals called phase signals are used to distinguish the types of signals transmitted through the main communication channel. To identify transactions transmitted through the channel, the SNP protocol defines the allowed sequence of phases for each transaction. A theoretical framework provides conditions for a phase-based protocol to allow immediate decoding of transactions. Simulation results show that the bandwidth of SNP is greater than that of a de facto standard bus protocol although SNP has wires only about three-fifths of the standard bus protocol. Although the signal-toggling rate is increased because of the multiplexed transmission of various signals through a single communication channel, simulation results show that the increase is not significant for multimedia applications that frequently transmit burst transfers. The phase omission of SNP helps to reduce the transaction failure rate to 65% while the hardware implementation cost for the support of phase omission is negligible.

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

on-chip bus
bus matrix
phase-based protocol
soc


designing intelligent and dynamic interfaces for communicating mathematics Current approaches to presentation of mathematics (on paper or in electronic format) have usability drawbacks that make learning and appreciation of mathematics challenging and often frustrating. We propose a development of a software user toolkit aimed to facilitate the creation of highly usable and effective presentations of mathematical ideas. In this paper we identify three problems which readers of math documents usually experience, and give a vision of how we might address those problems by designing a more interactive and intelligent interface

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

dynamic user interface
math visualization


Canonical STATIS: Biplot analysis of multi-table group structured data based on STATIS-ACT methodology Frequently multivariate experimental data taken over multiple occasions is found to produce a multivariate multi-table experiment. Neither the separate analysis of each occasion, using MANOVA or canonical variate analysis, nor the joint analysis using the STATIS-ACT methodology for multiple tables, are adequate to capture the real structure of the data matrices, since the first account for group structure but not time evolution and the second confuses the between and within group variabilities. A method baptized Canonical STATIS, based on STATIS-ACT methodology, is proposed. The method permits to account for data group structure as well as time evolution on the various occasions by obtaining common or stable canonical variates across multiple occasions or data sets. A simultaneous representation of groups, variables and occasions (biplot) is obtained, thereby widening the capabilities of classical methods.

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

biplot
canonical variate analysis
manova


precise interprocedural dataflow analysis via graph reachability The paper shows how a large class of interprocedural dataflow-analysis problems can be solved precisely in polynomial time by transforming them into a special kind of graph-reachability problem. The only restrictions are that the set of dataflow facts must be a finite set, and that the dataflow functions must distribute over the confluence operator (either union or intersection). This class of probable problems includesbut is not limited tothe classical separable problems (also known as gen/kill or bit-vector problems) e.g. , reaching definitions, available expressions, and live variables. In addition, the class of problems that our techniques handle includes many non-separable problems, including truly-live variables, copy constant propagation, and possibly-uninitialized variables. Results are reported from a preliminary experimental study of C programs (for the problem of finding possibly-uninitialized variables).

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

precise intersection live polynomial graph paper dataflow reachability class propagation

program
variability
vectorization
experimentation
definition
express
operability
timing
dataflow analysis


Abstract combinatorial programs and efficient property testers Property testing is a relaxation of classical decision problems which aims at distinguishing between functions having a predetermined property and functions being far from any function having the property. In this paper we present a novel framework for analyzing property testing algorithms. Our framework is based on a connection of property testing and a new class of problems which we call abstract combinatorial programs. We show that if the problem of testing a property can be reduced to an abstract combinatorial program of small dimension, then the property has an efficient tester. We apply our framework to a variety of problems. We present efficient property testing algorithms for geometric clustering problems, for the reversal distance problem, and for graph and hypergraph coloring problems. We also prove that, informally, any hereditary graph property can be efficiently tested if and only if it can be reduced to an abstract combinatorial program of small size. Our framework allows us to analyze all our testers in a unified way, and the obtained complexity bounds either match or improve the previously known bounds. Furthermore, even if the asymptotic complexity of the testers is not improved, the obtained proofs are significantly simpler than the previous ones. We believe that our framework will help to understand the structure of efficiently testable properties.

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

property testing
clustering problems
coloring

randomized algorithms
approximation algorithms
hereditary graph properties


Competitive carbon emission yields the possibility of global self-control Despite many international climate meetings such as Copenhagen 2009, it is still unclear how annual global emissions can be reduced without requiring governments to micro-manage the emitting companies within their individual jurisdictions. Here we examine a simple, yet highly non-trivial, computer model of carbon emission which is consistent with recent activity in the European carbon markets. Our simulation results show that the ongoing daily competition to emit CO2 within a population of emitters, can lead to a form of collective self-control over the aggregated emissions. We identify regimes in which such a population spontaneously hits its emissions target with minimal fluctuations. We then focus on the emission dynamics induced by a governing body which chooses to actively manage the capping level. Finally we lay some formal stepping stones toward a complete analytic theory for carbon emissions fluctuations within this model framework in so doing, we also connect this problem to more familiar theoretical terrain within computer science.

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


Nearly tight approximation bounds for vertex cover on dense k-uniform k-partite hypergraphs We establish almost tight upper and lower approximation bounds for the Vertex Cover problem on dense k-uniform k-partite hypergraphs.

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

approximation algorithms
approximation hardness
set cover
dense hypergraphs
k-partite k-uniform hypergraphs


matching with couples revisited It is well known that a stable matching in a many-to-one matching market with couples need not exist. We introduce a new matching algorithm for such markets and show that for large random markets the algorithm will find a stable matching with high probability. In our model we allow the number of couples to grow at a near-linear rate. Furthermore, truth-telling is an approximated equilibrium in the game induced by the new matching algorithm. Our results are tight: for markets in which the number of couples grows at a linear rate, we show that with constant probability no stable matching exists.

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


Multiobjective process controllability analysis A new approach for process controllability analysis by using multiobjective optimisation techniques is proposed. Within the approach, a set of performance specifications, such as minimum control error and input effort with closed-loop pole placement are represented as a set of linear matrix inequalities (LMI). The solution to the LMI conditions can be identified as feasible or infeasible. If the solution is feasible there is at least one controller that can make the closed-loop system satisfy all performance specifications simultaneously. Therefore, for the process plant, these performance specifications are achievable. Otherwise, they are unachievable. There is a Pareto-optimal set or a trade-off curve in the performance space to separate these two areas. The paper shows that such trade-off curves can be used for process controllability analysis, and therefore, can be applied to control structure selection problems. (C) 2003 Elsevier Ltd. All rights reserved.

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

process controllability
multiobjective optimisation


A molecular modeling and QSAR study of suppressors of the growth of Trypanosoma cruzi epimastigotes In this work, we have used molecular modeling and QSAR tools to study 18 dithiocarbamate suppressors of the growth of Trypanosoma cruzi epimastigotes, which have been reported in the literature as superoxide dismutase (SOD) inhibitors. The principal component analysis (PCA) showed that the descriptors superficial area, heat of formation, logarithm of the partition coefficient, charge of the nitrogen atom from the dithiocarbamate group and Charges of the two carbon atoms adjacent to that nitrogen are responsible for the classification between the higher and lower trypanomicid activity. Using multiple linear regression (MLR) and docking methods it was possible to identify the probable bioactive isomers that suppress of the growth of T. cruzi epimastigotes. Our best partial least square (PLS) model obtained with these six descriptors yields a good correlation between experimental and predicted biological activities and compares two different SODs as possible target for interaction with the dithiocarbamates.

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


growth control and disease mechanisms in computational embryogeny This paper presents novel approach to applying growth control and diseases mechanisms in computational embryogeny. Our method, which mimics fundamental processes from biology, enables individuals to reach maturity in a controlled process through a stochastic environment. Three different mechanisms were implemented; disease mechanisms, gene suppression, and thermodynamic balancing. This approach was integrated as part of a structural evolutionary model. The model evolved continuum3-D structures which support an external load. By using these mechanisms we were able to evolve individuals that reached a fixed size limit through the growth process. The growth process was an integral part of the complete development process. The size of the individuals was determined purely by the evolutionary process where different individuals matured to different sizes. Individuals which evolved with these characteristics have been found to be very robust for supporting a wide range of external loads.

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

stresses
finite element
genetic algorithm
indirect encoding
artificial cell