Fully localised energy-efficient multicast in large-scale wireless ad hoc networks Most proposed distributed energy-efficient multicasting algorithms utilise local search technology to refine a multicast tree iteratively. They use MST or SPT as the initial solution and improve the total power consumption by switching certain tree nodes from their respective parent nodes to new corresponding parent nodes. These algorithms are not scalable because the refinement operations require heavy message exchange flows. In this paper, we propose the algorithm Localised Energy-efficient Multicast with Grouping (LEMG) features to perform a local search in a fully localised fashion. The mechanism Grouping exploits a novel idea to evaluate the power consumption cost of every node and to limit message exchange within an adjustable constant hop. Our simulation shows LEMG is comparable in energy efficiency with DMEM, while the refinement can be performed with limited hops of message passing regardless of the network size and the number of destinations.

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

routing protocols
wireless ad hoc network
localised algorithm


Improving scalability of Bag-of-Tasks applications running on master-slave platforms Bag-of-Tasks applications are parallel applications composed of independent tasks. Examples of Bag-of-Tasks (BoT) applications include Monte Carlo simulations, massive searches (such as key breaking), image manipulation applications and data mining algorithms. This paper analyzes the scalability of Bag-of-Tasks applications running on master-slave platforms and proposes a scalability-related measure dubbed input file affinity. In this work, we also illustrate how the input file affinity, which is a characteristic of an application, can be used to improve the scalability of Bag-of-Tasks applications running on master-slave platforms. The input file affinity was considered in a new scheduling algorithm dubbed Dynamic Clustering, which is oblivious to task execution times. We compare the scalability of the Dynamic Clustering algorithm to several other algorithms, oblivious and non-oblivious to task execution times, proposed in the literature. We show in this paper that, in several situations, the oblivious algorithm Dynamic Clustering has scalability performance comparable to non-oblivious algorithms, which is remarkable considering that our oblivious algorithm uses much less information to schedule tasks. (C) 2008 Elsevier B.V. All rights reserved.

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

master-slave platforms
scalability analysis
bag-of-tasks applications


REX: A reconfigurable experimental system for evaluating parallel computer systems REX is a reconfigurable experimental system for evaluating and developing parallel computer systems. It consists of large-scale FPGAs, and enables the systems to be reconfigured from their processors to the network topology in order to support their evaluation and development. We evaluated REX using several implementations of parallel computer systems, and showed that it had enough scalability of gates, memory throughput and network throughput. We also showed that REX was an effective tool because of its emulation speed and reconfigurability to develop systems.

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

emulation
parallel computer
reconfigurable


Economic Dispatch of Energy and Reserve in Competitive Markets Using Meta-heuristic Algorithms This paper proposes a methodology for the economic dispatch of energy and reserve, in which the reserve requirement is obtained endogenously in the optimization process of the energy dispatch. The formulation assumes that the reserve can be offered both by generation units and flexible demands, which is optimized together with the active power dispatch. To solve this problem, we propose the use of an innovative hybrid methodology that integrates traditional linear programming to calculate the optimal power flow nested within a meta-heuristic algorithm, whose control variable is the reserve vector (reserve assigned to each unit). Thus, faults and congestion of the transmission system are taken into account by providing an optimal location of the reserve. In addition, this paper compares two meta-heuristic models: An evolutionary model widely used in various optimization problems, Evolutionary Particle Swarm Optimization (EPSO) and a novel model known as Mean-Variance Mapping Optimization (MVMO).

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

meta-heuristic algorithms
energy not supplied (ens)
reliability


CompareSVM: supervised, Support Vector Machine (SVM) inference of gene regularity networks Predication of gene regularity network (GRN) from expression data is a challenging task. There are many methods that have been developed to address this challenge ranging from supervised to unsupervised methods. Most promising methods are based on support vector machine (SVM). There is a need for comprehensive analysis on prediction accuracy of supervised method SVM using different kernels on different biological experimental conditions and network size.

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

machine running
gene regulatory networks
supervised learning
unsupervised learning
clr (context likelihood to relatedness)


Dissimilarity-based algorithms for selecting structurally diverse sets of compounds This paper commences with a brief introduction to modern techniques for the computational analysis of molecular diversity and the design of combinatorial libraries. It then reviews dissimilarity-based algorithms for the selection of structurally diverse sets of compounds in chemical databases. Procedures are described for selecting a diverse subset of an entire database, and for selecting diverse combinatorial libraries using both reagent-based and product-based selection.

O 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

combinatorial chemistry
dissimilarity-based compound selection
library design


Soft computing and cooperative strategies for optimization In the last years, metaheuristics have emerged as powerful algorithmic approaches which have been applied with great success to difficult combinatorial optimization problems. However, this does not mean that metaheuristics can be applied blindly to any new problem. In this contribution we showed how the most basic ingredients of Soft Computing, namely fuzzy sets and fuzzy rules, are used in the context of a simple metaheuristic and a cooperative strategy based on it, to obtain successful results for the p-median problem.

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

fuzzy sets and systems
parallel optimization
p-median problem


The structural and electronical factors that contribute affinity for the time-dependent inhibition of PGHS-1 by indomethacin, diclofenac and fenamates PGHS-1 and PGHS-2 are the targets of nonsteroidal anti-inflammatory drugs (NSAIDs). It appears that the high degree of selectivity for inhibition of PGHS-2 shown by certain compounds is the result of two mechanisms (time-dependent and time-independent inhibition), by which they interact with each isoform. The fenamic acids can be divided into competitive inhibitors of substrate binding and competitive inhibitors that cause time-dependent losses of cyclooxygenase activity. The cyclooxygenase activity was measured by oxygen consumption following preincubation of the enzyme and the inhibitor for increasing periods of time. The rate constants associated with binding inhibition kinetics and structure-activity relationships were calculated for a large number of fenamates, diclofenac and indomethacin. The K-I* values are similar but the individual rate constants are markedly different: k(1) is two-fold lower, and k(2) is six-fold slower for diclofenac than for indomethacin. All the active time-dependent compounds show MEPs with a negative conical surface, with their vertex on the minimum of the carboxyl group, which extends around the first aromatic ring to the central region. The conical surface keeps an open angle of 61 degrees or larger, and a close contact surface with the residues Ala(527), Ileu(523), Val(349), and Ser(530), in the zones surrounding the bridging amino group and the chlorine atoms for meclofenamate and diclofenac, or in the region around the carbonyl group for indomethacin. The K-I* and IC50 values indicate that the interactions that promote the slow binding kinetics must be examined in relation to the reaction energies of formation (Delta H-r) of an ionic bond between the deprotonated carboxylic acid group of acid NSAIDs with the monocationic guanidinum group of Arg(120), the free energies of solvation in aqueous solution, and the molecular volumes measured. Presumably indomethacin, diclofenac and meclofenamate cause the enzyme to undergo a subtle conformational change to a form that binds compounds even more tightly, with some slight structural changes confined to reorientations of the Arg(277) and Gln(358) side chains. These results show that the model has reliably chosen regions of biological significance consistent with both the X-ray crystallographic and kinetic results.

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

anti-inflammatory agents
cyclooxygenase inhibitors
pghs-1
qsar modeling


A model of perceptual task effort for bar charts and its role in recognizing intention This paper presents a model of perceptual task effort for use in hypothesizing the message that a bar chart is intended to convey. It presents our rules, based on research by cognitive psychologists, for estimating perceptual task effort, and discusses the results of an eye tracking experiment that demonstrates the validity of our model. These rules comprise a model that captures the relative difficulty that a viewer would have performing one perceptual task versus another on a specific bar chart. The paper outlines the role of our model of relative perceptual task effort in recognizing the intended message of an information graphic. Potential applications of this work include using this message to provide (1) a more complete representation of the content of the document to be used for searching and indexing in digital libraries, and (2) alternative access to the information graphic for visually impaired users or users of low-bandwidth environments.

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

perceptual effort
cognitive modeling
diagrams
plan recognition


Lattice Boltzmann modelling of droplets on chemically heterogeneous surfaces We use a three-dimensional lattice Boltzmann model to investigate the spreading of mesoscopic droplets on homogeneous and heterogeneous surfaces. On a homogeneous substrate the base radius of the droplet grows with time as t0.28 for a range of viscosities and surface tensions. The time evolutions collapse onto a single curve as a function of a dimensionless time. On a surface comprising of alternate lyophobic and lyophilic stripes the wetting velocity is anisotropic and the equilibrium shape of the droplet reflects the wetting properties of the underlying substrate.

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


Quality adaptive least squares trained filters for video compression artifacts removal using a no-reference block visibility metric Compression artifacts removal is a challenging problem because videos can be compressed at different qualities. In this paper, a least squares approach that is self-adaptive to the visual quality of the input sequence is proposed. For compression artifacts, the visual quality of an image is measured by a no-reference block visibility metric. According to the blockiness visibility of an input image, an appropriate set of filter coefficients that are trained beforehand is selected for optimally removing coding artifacts and reconstructing object details. The performance of the proposed algorithm is evaluated on a variety of sequences compressed at different qualities in comparison to several other de-blocking techniques. The proposed method outperforms the others significantly both objectively and subjectively.

O O O O O O O O B I I O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 filtering
least squares filter
no-reference quality metric
noise reduction
image enhancement
blocking artifact reduction
picture quality improvement


Resource allocation and revenue optimization for cloud service providers We help content and storage service providers balance their investments in service infrastructure and ads rendering technology. We show how queueing disciplines can help providers better control service quality. We optimize service versioning for customers self-select into suitable offerings. We explain why over-investment in service quality may not attract a desirable customer mix. We derive conditions under which offering free service or inducements could be preferred over charging subscriptions.

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

cloud service provider
priority queues
advertising
personalization


Power distribution-analysis of VLSI interconnects using model order reduction The analysis and simulation of effects induced by interconnects become increasingly important as the scale of process technologies steadily shrinks. While most analyses focus on the timing aspects of interconnects, power consumption is also important. In this paper, the power distribution analysis of interconnects is studied using a reduced-order model. The relation between power consumption and the poles and residues of a transfer function (either exact or approximated) is derived, and a simple yet accurate driver model is developed, allowing power consumption to be computed efficiently. Application of the proposed method to RC networks is demonstrated using a prototype tool.

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


AMTRAC: An administrative model for temporal role-based access control An administrative model for temporal role based access control is introduced. The proposed model includes relations to administer the role enabling base. A set of commands for authorization enforcement is presented.

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

temporal rbac
role enabling base assignment
administrative command
role hierarchy


RPE query processing and optimization techniques for XML databases An extent join to compute path expressions containing parent-children and ancestor-descendent operations and two path expression optimization rules, path-shortening and path-complementing, are presented in this paper. Path-shortening reduces the number of joins by shortening the path while path-complementing optimizes the path execution by using an equivalent complementary path expression to compute the original one. Experimental results show that the algorithms proposed are more efficient than traditional algorithms.

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


A modified LAMSTAR neural network and its applications This paper describes a modi. cation of the LArge Memory STorage And Retrieval (LAMSTAR) neural network. The purpose of the modi. cation is to allow rare events a larger role in decision-making when they are strongly biased towards a particular decision. As a by-product, the modification also permits the introduction of a confidence measure. This measure allows comparison across different network inputs so that the user may choose the "best" solution. The authors have applied the modified LAMSTAR network to a financial forecasting problem.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 systems
neural networks
pattern classification
signal processing


Factors of Adoption of Mobile Information Technology by Homecare Nurses A Technology Acceptance Model 2 Approach Pervasive healthcare support through mobile information technology solutions is playing an increasing role in the attempt to improve healthcare and reduce costs. Despite the apparent attractiveness, many mobile applications have failed or have not been implemented as predicted. Among factors possibly leading to such outcomes, technology adoption is a key problem. This must be investigated early in the development process because healthcare is a particularly sensitive area with vital social implications. Moreover, it is important to investigate technology acceptance using the support of scientific tools validated for relevant information systems research. This article presents an empirical study based on the Technology Acceptance Model 2 in mobile homecare nursing. The study elicited the perceptions of 91 Canadian nurses who used personal digital assistants for 1 month in their daily activities. A partial least squares modeling data analysis revealed that nurse's perception of usefulness is the main factor in the adoption of mobile technology, having subjective norm and image within the organization as significant antecedents. Overall, this study was the first attempt at investigating scientifically, through a pertinent information systems research model, user adoption of mobile systems by homecare nursing personnel.

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

homecare nursing
mobile information technology
partial least squares modeling
personal digital assistants
technology acceptance model


Application of the bifurcation method to the Whitham-Broer-Kaup-Like equations In this paper, we investigate the Whitham-Broer-Kaup-Like equations. Some explicit expressions of solutions for the equation are obtained by using the bifurcation method and qualitative theory of dynamical systems. These solutions contain kink-shaped solutions, blow-up solutions, periodic blow-up solutions and solitary wave solutions. Some previous results are extended. (C) 2011 Elsevier Ltd. All rights reserved.

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

whitham-broer-kaup-like equations
exact solutions


making defect-finding tools work for you Given the high costs of software testing and fixing bugs after release, early detection of bugs using static analysis can result in significant savings. However, despite their many benefits, recent availability of many such tools, and evidence of a positive return-on-investment, static-analysis tools are not used widely because of various usability and usefulness problems. The usability inhibitors include the lack of features, such as capabilities to merge reports from multiple tools and view warning deltas between two builds of a system. The usefulness problems are related primarily to the accuracy of the tools: identification of false positives (or, spurious bugs) and uninteresting bugs among the true positives. In this paper, we present the details of an online portal, developed at IBM Research, to address these problems and promote the adoption of static-analysis tools. We report our experience with the deployment of the portal within the IBM developer community. We also highlight the problems that we have learned are important to address, and present our approach toward solving some of those problems.

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

defect views
static analysis portal
defect merging
defect prioritization
defect differencing


Scientific collaboration dynamics in a national scientific system This paper examines the collaboration structures and dynamics of the co-authorship network of all Slovenian researchers. Its goal is to identify the key factors driving collaboration and the main differences in collaboration behavior across scientific fields and disciplines. Two approaches to modelling network dynamics are combined in this paper: the small-world model and the mechanism of preferential attachment, also known as the process of cumulative advantage. Stochastic-actor-based modelling of co-authorship network dynamics uses data for the complete longitudinal co-authorship networks for the entire Slovenian scientific community from 1996 to 2010. We confirmed the presence of clustering in all fields and disciplines. Preferential attachment is far more complex than a single global mechanism. There were two clear distinctions regarding collaboration within scientific fields and disciplines. One was that some fields had an internal national saturation inhibiting further collaboration. The second concerned the differential impact of collaboration with scientists from abroad on domestic collaboration. In the natural, technical, medical, and biotechnical sciences, this promotes collaboration within the Slovenian scientific community while in the social sciences and humanities this inhibits internal collaboration.

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

scientific collaboration
network dynamics
preferential attachment

co-authorship networks
bibliometry
small world
stochastic-actor-based model
siena
cluster analysis


On the decidability and complexity of integrating ontologies and rules We define the formal framework of r-hybrid knowledge bases (KBs) integrating ontologies and rules. A r-hybrid KB has a structural component (ontology) and a rule component. Such a framework is very general, in the sense that: (i) the construction is parametric with respect to the logic used to specify the structural component; (ii) the rule component is very expressive, since it consists of a Datalog? Datalog ? program, i.e., a Datalog program with negation as failure and disjunction, (iii) the rule component is constrained in its interaction with the structural component according to a safeness condition: such a safe interaction between rules and structural KB captures (and is a generalization of) several previous proposals. As a consequence, we are able to show that such a framework of r-hybrid KBs comprises many systems proposed for combining rules and Description Logics. Then, we study reasoning in r-hybrid KBs. We provide a general algorithm for reasoning in r-hybrid KBs, and prove that, under very general conditions, decidability of reasoning is preserved when we add safe Datalog? Datalog ? rules to a KB: in other words, if reasoning in the logic L used to specify the structural component T is decidable, then reasoning in the extension of T with safe Datalog? Datalog ? rules is still decidable. We also show that an analogous property holds for the complexity of reasoning in r-hybrid KBs. Our decidability and complexity results generalize in a broad sense previous results obtained in recent research on this topic. In particular, we prove that reasoning in r-hybrid KBs whose structural component is specified in the Web Ontology Language OWL-DL is decidable.

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


Effects of Unintentional Denial of Service (DOS) Due to Push-to-Talk (PTT) Delays on Performance of CSMA/CA Based Adhoc Land Mobile Radio (LMR) Networks Unintentional Denial of Service (DOS) problems occur in wireless networks such as Wi-Fi due to factors such as signal capture, interference and have been studied extensively in the literature. A similar problem manifests amongst nodes within a LMR network due to different PIT delay characteristics. We first present the typical PTT delay values and distributions followed by an analytical model to estimate the denial of service problem. The results obtained using the model and simulations show that the LMR nodes experience DOS due to collisions resulting from PTT delays. The results also show that there exists an asymmetry in the performance of individual nodes and the extent of this asymmetry is a function of total number of nodes in the system and the density of nodes with similar PTT delay profiles. These observations have implications in both performance and capacity planning of an adhoc LMR network.

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

denial of service
ptt delays
adhoc
land mobile radio


On security against the server in designated tester public key encryption with keyword search The security of dPEKS against KG attacks is redefined with the attacker being the server. The IND-KGA-SERVER security model is proposed to describe security against the server. A dPEKS scheme secure against the server's KG attacks is proposed. The solution can be seen as a bootstrap from IND-KGA security to IND-KGA-SERVER security.

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

searchable encryption
keyword guessing attacks
cryptography


Projection and partitioned solution for two-phase flow problems Multiphase flow through porous media is a highly nonlinear process that can be solved nurnerically with the aid of finite elements (FE) in space and finite differences (FD) in time. For an accurate solution much refined FE grids are generally required with the major computational effort consisting of the resolution to the nonlinearity frequently obtained with the classical Picard linearization approach. The efficiency of the repeated solution to the linear systems within each individual time step represents the key to improve the performance of a multiphase flow simulator. The present paper discusses the performance of the projection solvers (GMRES with restart, TFQMR, and BiCGSTAB) for two global schemes based on a different nodal ordering of the unknowns (ORD1 and ORD2) and a scheme (SPLIT) based on the straightforward inversion of the lumped mass matrix which allows for the preliminary elimination and substitution of the unknown saturations. It is shown that SPLIT is between two and three time faster than ORD1 and ORD2, irrespective of the solver used. Copyright (c) 2005 John Wiley & Sons, Ltd.

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

two-phase flow in porous media
projection methods
partitioned procedure
direct solvers


A hybrid micro vibration energy harvester with power management circuit A hybrid micro vibration energy harvester with power management circuit is developed and tested. A mathematical model is established to calculate output power from the hybrid energy harvester. The output power of hybrid energy harvester is improved by using a damping matching method. The output voltage of piezoelectric transducer is increased by using MEMS PZT cantilever arrays architecture. A complete solution of self-powered micro vibration power supply for wireless sensor node is proposed.

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

hybrid energy harvester
piezoelectric
power management circuit
wireless sensor node


Modeling of 2D and 3D Assemblies Taking Into Account Form Errors of Plane Surfaces The tolerancing process links the virtual and the real worlds. From the former, tolerances define a variational geometrical language (geometric parameters). From the latter, there are values limiting those parameters. The beginning of a tolerancing process is in this duality. As high precision assemblies cannot be analyzed with the assumption that form errors are negligible, we propose to apply this process to assemblies with form errors through a new way of allowing to parameterize forms and solve their assemblies. The assembly process is calculated through a method of allowing to solve the 3D assemblies of pairs of surfaces having form errors using a static equilibrium. We have built a geometrical model based on the modal shapes of the ideal surface. We compute for the completely deterministic contact points between this pair of shapes according to a given assembly process. The solution gives an accurate evaluation of the assembly performance. Then we compare the results with or without taking into account the form errors. When we analyze a batch of assemblies, the problem is to compute for the nonconformity rate of a pilot production according to the functional requirements. We input probable errors of surfaces (position, orientation, and form) in our calculus and we evaluate the quality of the results compared with the functional requirements. The pilot production then can or cannot be validated. [DOI: 10.1115/1.3249575]

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

3d assembly
modal analysis
positioning force
statistical analysis


Robust model predictive control under chance constraints We propose a robust control strategy, model predictive control under chance constraints, to deal with multivariable constrained control problems. Both model and disturbance uncertainties are considered and assumed to be correlated multivariate stochastic variables. The output constraints are to be held with a predefined probability in respect of the entire horizon. The problem formulated is a stochastic program under joint probabilistic constraints. Using an efficient sampling method this problem is relaxed to a nonlinear programming problem which can be solved by SQP. Simulation results of a distillation column control show the performances of the proposed strategy. (C) 2000 Elsevier Science Ltd. All rights reserved.

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

robust model
predictive control
chance constraints


Multi-domain Lambda Grid data portal for collaborative Grid applications This paper presents the iGrid2005 demonstration of the multi-domain Lambda Grid data portal to enable collaborative Grid applications to retrieve gigabyte-size scientific datasets on demand over a wide-area Lambda Grid test-bed spanning across the United States and Europe. The data portal allows collaborative users to register and discover distributed datasets across a multi-domain Lambda Grid through a web-service based dataset registry and search engine, and to deliver the discovered datasets through dynamic established lightpaths to specified computing cluster locations for dataset manipulation. The data portal employs the novel Secure Photonic Inter-domain Negotiator (SPIN) as a secure multi-domain control plane to set up dynamic lightpaths between the source and destination clusters for respective storage and manipulation of the discovered datasets over a multi-domain Lambda Grid. The data portal employs lambda-aware middleware and transport protocol to optimize transfer of the discovered datasets over the dynamic established lightpaths. Implementation details and observed performance results from the demonstrations of the SPIN-based Lambda Grid data portal are reported.

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

collaborative grid application
inter-domain control plane
optical wide-area network


synthesis of first-order dynamic programming algorithms To solve a problem with a dynamic programming algorithm, one must reformulate the problem such that its solution can be formed from solutions to overlapping subproblems. Because overlapping subproblems may not be apparent in the specification, it is desirable to obtain the algorithm directly from the specification. We describe a semi-automatic synthesizer of linear-time dynamic programming algorithms. The programmer supplies a declarative specification of the problem and the operators that might appear in the solution. The synthesizer obtains the algorithm by searching a space of candidate algorithms; internally, the search is implemented with constraint solving. The space of candidate algorithms is defined with a program template reusable across all linear-time dynamic programming algorithms, which we characterize as first-order recurrences. This paper focuses on how to write the template so that the constraint solving process scales to real-world linear-time dynamic programming algorithms. We show how to reduce the space with (i)~symmetry reduction and (ii)~domain knowledge of dynamic programming algorithms. We have synthesized algorithms for variants of maximal substring matching, an assembly-line optimization, and the extended Euclid algorithm. We have also synthesized a problem outside the class of first-order recurrences, by composing three instances of the algorithm template.

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


Chemoinformatics-An Introduction for Computer Scientists Chemoinformatics is an interface science aimed primarily at discovering novel chemical entities that will ultimately result in the development of novel treatments for unmet medical needs, although these same methods are also applied in other fields that ultimately design new molecules. The field combines expertise from, among others, chemistry, biology, physics, biochemistry, statistics, mathematics, and computer science. In this general review of chemoinformatics the emphasis is placed on describing the general methods that are routinely applied in molecular discovery and in a context that provides for an easily accessible article for computer scientists as well as scientists from other numerate disciplines.

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

algorithms
experimentation
measurement
theory
chemometrics
docking
drug discovery
molecular modeling
qsar


Clusterer ensemble Ensemble methods that train multiple learners and then combine their predictions have been shown to be very effective in supervised learning. This paper explores ensemble methods for unsupervised learning. Here, an ensemble comprises multiple clusterers, each of which is trained by k-means algorithm with different initial points. The clusters discovered by different clusterers are aligned, i.e. similar clusters are assigned with the same label, by counting their overlapped data items. Then, four methods are developed to combine the aligned clusterers. Experiments show that clustering performance could be significantly improved by ensemble methods, where utilizing mutual information to select a subset of clusterers for weighted voting is a nice choice. Since the proposed methods work by analyzing the clustering results instead of the internal mechanisms of the component clusterers, they are applicable to diverse kinds of clustering algorithms.

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

machine learning
ensemble learning
selective ensemble


Species abundance patterns in an ecosystem simulation studied through Fisher's logseries We have developed an individual-based evolving predator-prey ecosystem simulation that integrates, for the first time, a complex individual behaviour model, an evolutionary mechanism and a speciation process, at an acceptable computational cost. In this article, we analyse the species abundance patterns observed in the communities generated by our simulation, based on Fisher's logseries. We propose a rigorous methodology for testing abundance data against the logseries. We show that our simulation produces coherent results, in terms of relative species abundance, when compared to classical ecological patterns. Some preliminary results are also provided about how our simulation is supporting ecological field results. (C) 2009 Elsevier B.V. All rights reserved.

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

species abundance distribution
fisher's logseries
fisher's alpha
individual-based model
fuzzy cognitive map


Risky business or sharing the load? - Social flow in collaborative mobile learning Mobile learning has been built upon the premise that we can transform traditional classroom or computer-based learning activities into a more ubiquitous and connected form of learning. Tentative outcomes from this assertion have been witnessed in many collaborative learning activities, but few analytic observations on what triggers this collaboration have so far been made. However Social Flow, a concept framework that extends Csikszentmihalyi's flow theory, may help us to partially explain the triggering mechanism of collaborative mobile learning. Our case study in this article, where learners together explore a built environment as part of a simulated security guard training programme, describes how the concept of social flow in a collaborative learning space might sketch out what triggers an optimal learning experience in collaboration and what can be additionally achieved in a collaborative learning experience. In this learning context, collaborative mobile learning might be seen to prompt more knowledge generation and extra learning tasks by fostering greater motivation than other learning environments. (C) 2011 Elsevier Ltd. All rights reserved.

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


Dynamic journeying under uncertainty We introduce a journey planning problem in multi-modal transportation networks under uncertainty. The goal is to find a journey, possibly involving transfers between different transport services, from a given origin to a given destination within a specified time horizon. Due to uncertainty in travel times, the arrival times of transport services at public transport stops are modeled as random variables. If a transfer between two services is rendered unsuccessful, the commuter has to reconsider the remaining path to the destination. The problem is modeled as a Markov decision process in which states are defined as paths in the transport network. The main contribution is a backward induction method that generates an optimal policy for traversing the public transport network in terms of maximizing the probability of reaching the destination in time. By assuming history independence and independence of successful transfers between services we obtain approximate methods for the same problem. Analysis and numerical experiments suggest that while solving the path dependent model requires the enumeration of all paths from the origin to the destination, the proposed approximations may be useful for practical purposes due to their computational simplicity. In addition to on-time arrival probability, we show how travel and overdue costs can be taken into account, making the model applicable to freight transportation problems.

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

stochastic processes
stochastic shortest path problem
itinerary planning problem
markov decision processes


Modeling the mechanisms of Uhthoff's phenomenon in MS patients with internuclear ophthalmoparesis Internuclear ophthalmoparesis (INO) is the most common saccadic eye movement disorder observed in patients with multiple sclerosis (MS). It is characterized by slowing of the adducting eye during horizontal saccades, and most commonly results from a demyelinating lesion in the medial longitudinal fasciculus (MLF) within the midline tegmentum of the pons (ventral to the fourth ventricle) or midbrain (ventral to the cerebral aqueduct). Recent research has demonstrated that adduction velocity in MS-related INO, as measured by infrared eye movement recording techniques, is further reduced by a systematic increase in core body temperature (utilizing tube-lined water infusion suits in conjunction with an ingestible temperature probe and transabdominal telemetry) and reversed to baseline with active cooling. These results suggest that INO may represent a model syndrome by which we can carefully study the Uhthoff's phenomenon and objectively test therapeutic agents for its prevention.

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

demyelination
heat sensitivity
optic neuritis


Experiences building a communication-oriented JavaOS Mobile code makes it easier to maintain, debug, update, and customize a system. Active networks are one of the more interesting applications of mobile code: code Is injected into the nodes of a network to customize the network's functionality, such as routing, and to add new features, such as special-purpose congestion control and filtering algorithms. The challenge is to develop a communication-oriented platform for such systems, We refer to mobile code targeted at low-level, communication-oriented systems like active networks as liquid software, the key distinction being that liquid software is focused on the efficient transfer of data, not high-performance computation. To this end, we have designed and implemented Joust, which consists of a complete re-implementation of the Java virtual machine (including both the runtime system and a just-in-time compiler), running on the Scout operating system (a configurable, communication-oriented OS). The result is a configurable, high-performance platform for running liquid software. We present the results of implementing two different applications of liquid software on Joust, including a prototype architecture for active networks. Copyright (C) 2000 John Wiley & Sons, Ltd.

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

mobile code
joust
scout
java
operating system


parallel gmres implementation for solving sparse linear systems on gpu clusters In this paper, we propose an efficient parallel implementation of the GMRES method for GPU clusters. This implementation requires us to parallelize the GMRES algorithm between the CPUs of the cluster. Hence, all parallel and intensive computations on local data are performed on GPUs and reduction operations to compute global results are carried out by CPUs. The performances of our parallel GMRES solver are evaluated on test matrices of sizes exceeding 10 7 rows. They show that solving large and sparse linear systems on a GPU cluster is faster than those performed on its CPU counterpart. It is noticed that a cluster of 12 GPUs is about 8 times faster than a cluster of 12 CPUs and about 5 times faster than a cluster of 24 CPUs.

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


Fault masking by multiple timing faults in timed EFSM models ? Detection of multiple timing faults is a challenging task because these faults, although may be detectable individually, can mask each others faulty behavior, making a faulty implementation under test (IUT) indistinguishable from a non-faulty one during testing. This phenomenon, called fault masking, is formally defined in this paper. It is proven that graph augmentation algorithms proposed for timed Extended Finite State Machines (EFSMs) with multiple timers can detect pairwise occurrences of classes of timing faults in an IUT and, hence, detects fault masking.

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

multiple timers
fault masking
timed efsm

conformance testing
fault modeling
finite state machine (fsm)
extended finite state machine (efsm)


Knowledge-Based Global Operation of Mineral Processing Under Uncertainty In this paper, a novel knowledge-based global operation approach is proposed to minimize the effect on the production performance caused by unexpected variations in the operation of a mineral processing plant subjected to uncertainties. For this purpose, a feedback compensation and adaptation signal discovered from process operational data is employed to construct a closed-loop dynamic operation strategy. It uses the signal to regulate the outputs of the existing open-loop and steady-state based system so as to compensate the uncertainty in the steady-state operation at the plant-wide level. The utilization mechanism of operational data through constructing increment association rules is firstly described. Then, a rough set based rule extraction approach is developed to generate the compensation rules. This includes two steps, namely the determination of the variables to be compensated based on the significance of attributes in the rough set theory and the extraction of the compensation rules from process data. Based upon the operational data of the mineral processing plant, relevant rules are obtained. Both simulation and industrial experiments are carried out for the proposed global operation, where the effectiveness of the proposed approach has been clearly justified.

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

dynamic operation
global operation
mineral processing
rough set
uncertainty


Propositions as Sessions Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions of classical linear logic correspond to session types. Continuing a line of work by Honda (1993), by Honda, Kubo, and Vasconcelos (1998), and by Gay and Vasconcelos (2010), among others, this paper presents GV, a linear functional language with session types, and presents a translation from GV into CP. The translation formalises for the first time a connection between a standard presentation of session types and linear logic, and shows how a modification to the standard presentation yield a language free from deadlock, where deadlock freedom follows from the correspondence to linear logic.

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


Local information-based congestion control scheme for space delay/disruption tolerant networks The storage resources and communication opportunities in space delay/disruption tolerant networks (DTN) are usually very limited. Moreover, as the links in space DTN are often subject to long delay, intermittent connectivity and asymmetric bandwidth, end-to-end continuous path may not be guaranteed and messages may stay at intermediate nodes for a long time. Thus, congestion in space DTN, which takes the form of persistent storage exhaustion, is inevitable. Due to the intrinsic features of space DTN, congestion control should be performed with local information before congestion occurs and limited storage and communication resources should be allocated to messages that have the highest probability to be delivered to destination. Based on these principles, a local information-based congestion control (LCC) scheme for space DTN is proposed in this paper. Firstly, LCC attempts to relieve the storage pressure by using alternative paths i.e. non-best paths when the network is about to congest. Secondly, LCC adopts a utility function based on the reciprocal of hop counts to destination to assist forwarding decision and queue management. Simulation results show that with the combination of LCC typical space DTN routing algorithm can achieve higher message delivery ratio and more uniform traffic distribution.

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

congestion control
local information
utility function

space delay/disruption tolerant network
alternative path


Inclusion filters: A class of self-dual connected operators In this paper, we define a connected operator that either fills or retains the holes of the connected sets depending on application-specific criteria that are increasing in the set theoretic sense. We refer to this class of connected operators as inclusion filters, which are shown to be increasing, idempotent, and self dual (gray-level inversion invariance). We demonstrate self duality for 8-adjacency on a discrete Cartesian grid. Inclusion filters are defined first for binary-valued images, and then the definition is extended to grayscale imagery. It is also shown that inclusion filters are levelings, a larger class of connected operators. Several important applications of inclusion filters are demonstrated-automatic segmentation of the lung cavities from magnetic resonance imagery, user interactive shape delineation in content-based image retrieval, registration of intravital microscopic video sequences, and detection and tracking of cells from these sequences. The numerical performance measures on 100-cell tracking experiments show that the use of inclusion filter improves the total number of frames successfully tracked by five times and provides a threefold reduction in the overall position error.

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


Structure of Msj-1 Gene: A Comparative Analysis Abstract: Msj-1 gene encodes a DnaJ protein highly expressed in spermatids and spermatozoa of both rodents and amphibians. We isolated and characterized the msj-1 gene in mice. A bioinformatic approach was then used to predict the putative promoter region, chromosomal localization, and its presence in the human genome. The analysis of msj-1 genomic sequence revealed that msj-1 is an intronless gene. Interestingly, two regions (A and B, separated by 10,682 bp) on human chromosome 2 having respectively 78% and 77% nucleotide identity with the murine msj-1 coding region were identified. This suggests the existence of an msj-1-like gene also in humans.

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


Pathologic

deltoid

activation

in

rotator

cuff

tear

patients:

normalization

after

cuff

repair?

Rotator

cuff

(RC)

tears

have

a

high

prevalence,

and

RC

repair

surgery

is

frequently

performed.

Evaluation

of

deltoid

activation

has

been

reported

as

an

easy

to

measure

proxy

for

RC

functionality.

Our

goal

was

to

test

the

success

of

RC

repair

in

restoring

muscle

function,

by

assessing

deltoid

activation

with

varying

arm

abduction

moment

loading

tasks

in

controls

and

in

RC

tear

patients

before

and

after

RC

repair.

Averaged

rectified

electromyography

recordings

(rEMG)

of

the

deltoid

during

isometric

arm

abduction

tasks

were

assessed

in

controls

and

patients

before

and

after

RC

repair.

Changes

in

deltoid

activation

as

a

response

to

increased

arm

abduction

moment

loading

(large

vs.

small

moment),

without

changing

task

force

magnitude,

were

expressed

as:

R=(rEMGLarge?rEMGSmall)/(rEMGLarge+rEMGSmall),

where

indicates

an

increase

in

muscle

activation

with

larger

moment

loading.

In

controls,

a

significant

increase

in

deltoid

activation

was

observed

with

large

abduction

moment

loading:

CI

In

patients,

R

was

larger:

CI

preoperatively

and

CI

postoperatively.

Increased

compensatory

deltoid

activation

was

found

in

pre-operative

RC

tear

patients.

The

post-operative

decrease

in

compensatory

deltoid

activation,

although

not

significant,

could

indicate

(partially)

restored

RC

function

in

at

least

some

patients.

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


A novel semi-supervised learning for face recognition We points out the shortcoming of LE in learning the local structure. Our approach characterizes both the diversity and similarity of data. Our approach helps encode the local discriminating information of data.

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

semi-supervised learning
discriminant analysis
dimension reduction


Mining a multilingual association dictionary from Wikipedia for cross-language information retrieval Wikipedia is characterized by its dense link structure and a large number of articles in different languages, which make it a notable Web corpus for knowledge extraction and mining, in particular for mining the multilingual associations. In this paper, motivated by a psychological theory of word meaning, we propose a graph-based approach to constructing a cross-language association dictionary (CLAD) from Wikipedia, which can be used in a variety of cross-language accessing and processing applications. In order to evaluate the quality of the mined CLAD, and to demonstrate how the mined CLAD can be used in practice, we explore two different applications of the mined CLAD to cross-language information retrieval (CLIR). First, we use the mined CLAD to conduct cross-language query expansion; and, second, we use it to filter out translation candidates with low translation probabilities. Experimental results on a variety of standard CLIR test collections show that the CLIR retrieval performance can be substantially improved with the above two applications of CLAD, which indicates that the mined CLAD is of sound quality.

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


Implementing the Main Functionalities Required by Semantic Search in Decision-Support Systems This paper exploits different semantic web technologies and builds a prototype of semantic web mashup functionality based on an architecture proposed by us. The main scope is to improve decision-making processes. In this paper, we are focusing on querying different ontologies in order to improve decision-making semantic search. As a conclusion, we demonstrate that in order to improve decision-making semantic search there is a need of special constructions that a query language must support.

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

decision-making semantic search
ontology
sparql
sqwrl
rdf
owl


Learning Linear Ranking Functions for Beam Search with Application to Planning Beam search is commonly used to help maintain tractability in large search spaces at the expense of completeness and optimality. Here we study supervised learning of linear ranking functions for controlling beam search. The goal is to learn ranking functions that allow for beam search to perform nearly as well as unconstrained search, and hence gain computational efficiency without seriously sacrificing optimality. In this paper, we develop theoretical aspects of this learning problem and investigate the application of this framework to learning in the context of automated planning. We first study the computational complexity of the learning problem, showing that even for exponentially large search spaces the general consistency problem is in NP. We also identify tractable and intractable subclasses of the learning problem, giving insight into the problem structure. Next, we analyze the convergence of recently proposed and modified online learning algorithms, where we introduce several notions of problem margin that imply convergence for the various algorithms. Finally, we present empirical results in automated planning, where ranking functions are learned to guide beam search in a number of benchmark planning domains. The results show that our approach is often able to outperform an existing state-of-the-art planning heuristic as well as a recent approach to learning such heuristics.

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

speedup learning
structured classification


Numerical investigation on the stability of singular driven cavity flow By applying the singularity subtraction technique to the unsteady driven cavity problem, the stability of the impulsively started flow is investigated, without smoothing the corner singularity. A second-order spectral projection method allows localization of the critical Reynolds number for the first Hopf bifurcation in the interval [8017.6, 801 8.8). (C) 2002 Elsevier Science (USA).

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

critical reynolds number
hopf bifurcation

stability of incompressible viscous flows


Affective interaction: How emotional agents affect users Embodied agents have received large amounts of interest in recent years. They are often equipped with the ability to express emotion, but without understanding the impact this can have on the user. Given the amount of research studies that are utilising agent technology with affective capabilities, now is an important time to review the influence of synthetic agent emotion on user attitudes, perceptions and behaviour. We therefore present a structured overview of the research into emotional simulation in agents, providing a summary of the main studies, re-formulating appropriate results in terms of the emotional effects demonstrated, and an in-depth analysis illustrating the similarities and inconsistencies between different experiments across a variety of different domains. We highlight important lessons, future areas for research, and provide a set of guidelines for conducting further research.

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


On the autocorrelation distributions of Sidel'nikov sequences For a prime p and positive integers M and n such that Mp\p(n) - 1, Sidel 'nikov introduced M-ary sequences (called Sidel'nikov sequences) of period p(n) - 1, the out-of-phase autocorrelation magnitude of which is upper bounded by 4. In this correspondence, we derived the antocorrellation distributions, i.e., the values and the number of occurrences of each value of the autocorrellation function of Sidel'nikov sequences. The frequency of each autocorrelation value of an M-ary Sidel'nikov sequence is expressed in terms of the cyclotomic numbers of order M. It is also pointed out that the total number of distinct autocorrelation values is dependent not only on M but also on the period of the sequence, but always less than or equal to ((M)(2)) + 1.

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

autocorrelation distribution
m-ary sequences
sidel'nikov sequences


Estimation of current-induced pile groups scour using a rule-based method Scour phenomenon around piles could endanger the stability of the structures placed on them. Therefore, an accurate estimation of the scour depth around piles is very important for engineers. Due to the complexity of the interaction between the current, seabed and pile group; prediction of the scour depth is a difficult task and the available empirical formulas have limited accuracy. Recently, soft computing methods such as artificial neural networks (ANN) and adaptive neuro-fuzzy inference system (ANFIS) have been used for the prediction of the scour depth. However, these methods do not give enough insight into the generated models and are not as easy to use as the empirical formulas. In this study, new formulas are given that are compact, accurate and physically sound. In comparison with the other soft computing methods, this approach is more transparent and robust. Comparison between the developed formulas and previous empirical formulas showed the superiority of the developed ones in terms of accuracy. In addition, the given formulas can be easily used by engineers to estimate the scour depth around pile groups. Moreover, in this study, design factors are given for different levels of acceptable risks, which can be useful for design purposes.

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


Understanding consumer acceptance of mobile payment services: An empirical analysis Mobile technology has become increasingly common in today's everyday life. However, mobile payment is surprisingly not among the frequently used mobile services, although technologically advanced solutions exist. Apparently, there is still a lack of acceptance of mobile payment services among consumers. The conceptual model developed and tested in this research thus focuses on factors determining consumers' acceptance of mobile payment services. The empirical results show particularly strong support for the effects of compatibility, individual mobility, and subjective norm. Our study offers several implications for managers in regards to marketing mobile payment solutions to increase consumers' intention to use these services. (C) 2009 Elsevier B. V. All rights reserved.

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

mobile payment
intention to use
subjective norm

consumer mobility
technology acceptance model (tam)
perceived usefulness
perceived ease of use
perceived risk
structural equation modeling
eqs


A new approach to intrusion detection based on an evolutionary soft computing model using neuro-fuzzy classifiers An intrusion detection system's main goal is to classify activities of a system into two major categories: normal and suspicious (intrusive) activities. Intrusion detection systems usually specify the type of attack or classify activities in some specific groups. The objective of this paper is to incorporate several soft computing techniques into the classifying system to detect and classify intrusions from normal behaviors based on the attack type in a computer network. Among the several soft computing paradigms, neuro-fuzzy networks, fuzzy inference approach and genetic algorithms are investigated in this work. A set of parallel neuro-fuzzy classifiers are used to do an initial classification. The fuzzy inference system would then be based on the outputs of neuro-fuzzy classifiers, making final decision of whether the current activity is normal or intrusive. Finally, in order to attain the best result, genetic algorithm optimizes the structure of our fuzzy decision engine. The experiments and evaluations of the proposed method were performed with the KDD Cup 99 intrusion detection dataset. (c) 2007 Elsevier B.V. All rights reserved.

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

intrusion detection
soft computing
fuzzy
genetic algorithm
kdd cup 99


Extension of first order predictive functional controllers to handle higher order internal models Predictive Functional Control (PFC), belonging to the family of predictive control techniques, has been demonstrated as a powerful algorithm for controlling process plants. The input/output PFC formulation has been a particularly attractive paradigm for industrial processes, with a combination of simplicity and effectiveness. Though its use of a lag plus delay ARX/ARMAX model is justified in many applications, there exists a range of process types which may present difficulties, leading to chattering and/or instability. In this paper, instability of first order PFC is addressed, and solutions to handle higher order and difficult systems are proposed. The input/output PFC formulation is extended to cover the cases of internal models with zero and/or higher order pole dynamics in an ARX/ARMAX form, via a parallel and cascaded model decomposition. Finally, a generic form of PFC, based on elementary outputs, is proposed to handle a wider range of higher order oscillatory and non-minimum phase systems. The range of solutions presented are supported by appropriate examples.

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

model predictive control
non-minimum phase systems
oscillatory systems


Functional organization within a neural network trained to update target representations across 3-D saccades The goal of this study was to understand how neural networks solve the 3-D aspects of updating in the double-saccade task, where subjects make sequential saccades to the remembered locations of two targets. We trained a 3-layer, feed-forward neural network, using back-propagation, to calculate the 3-D motor error the second saccade. Network inputs were a 2-D topographic map of the direction of the second target in retinal coordinates, and 3-D vector representations of initial eye orientation and motor error of the first saccade in head-fixed coordinates. The network learned to account for all 3-D aspects of updating. Hidden-layer units (HLUs) showed retinal-coordinate visual receptive fields that were remapped across the first saccade. Two classes of HLUs emerged from the training, one class primarily implementing the linear aspects of updating using vector subtraction, the second class implementing the eye-orientation-dependent, non-linear aspects of updating. These mechanisms interacted at the unit level through gain-field-like input summations, and through the parallel tweaking of optimally-tuned HLU contributions to the output that shifted the overall population output vector to the correct second-saccade motor error. These observations may provide clues for the biological implementation of updating.

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

saccades
updating
neural networks
topographic


bringing usability to industrial control systems I want to examine how domain-specific HCI design patterns can be introduced into an existing software development process for industrial test systems. This paper describes the first findings of a contextual inquiry in the domain of test automation systems. Based on these results, I will collect a set of patterns that are relevant to the field. In the future, these patterns will be applied in a real development process. The final aim is to investigate how the patterns can help the developers and product managers to make design decisions for the user interfaces of the developed software.

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

industrial control software
usability guidelines
style guides


Surface micromachined RF MEMS variable capacitor We used simple microelectromechanical systems (MEMS) technology to fabricate low-voltage-controlled variable capacitors with high-quality factor. The surface profile of the variable capacitor at different values of applied voltage is measured using WYKO NT1100 optical surface profiler. The pull-in voltage of the variable capacitor was below 15V. The capacitance and quality factor at 1GHz are 0.792 and 51.6pF. The pull-in voltage is 13.5V, the tuning ratio of the capacitor is more than 1.31:1.

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

variable capacitor
rf mems
quality factor


An approach based on self-organizing map and fuzzy membership for decomposition of mixed pixels in hyperspectral imagery Spectral unmixing, which decomposes the mixed pixel into typical ground signatures (endmembers) and their fractional proportions (abundances) is a meaningful job for high-accuracy ground object recognition and quantitative remote sensing analysis. In this paper, a method for decomposition of mixed pixels which combines competitive neural network and fuzzy clustering, termed self-organizing map and fuzzy membership (SOM&FM) is proposed. The proposed method only demands some data samples as prior knowledge to train the SOM neural network in a supervised way. And the unmixing is based on the fuzzy model, which satisfies the abundances non-negative constraint (ANC) and the abundances summed-to-one constraint (ASC) automatically. Experimental results on synthetic and real hyperspectral data demonstrate that the proposed method can be used for both linear and nonlinear spectral mixture situations, and has good unmixing performances.

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

mixed pixel
spectral unmixing
fuzzy membership

endmember
abundance
self-organizing map neural network


Identifying thresholds for object-oriented software metrics Despite the importance of software metrics and the large number of proposed metrics, they have not been widely applied in industry yet. One reason might be that, for most metrics, the range of expected values, i.e., reference values are not known. This paper presents results of a study on the structure of a large collection of open-source programs developed in Java, of varying sizes and from different application domains. The aim of this work is the definition of thresholds for a set of object-oriented software metrics, namely: LCOM, DIT, coupling factor, afferent couplings, number of public methods, and number of public fields. We carried out an experiment to evaluate the practical use of the proposed thresholds. The results of this evaluation indicate that the proposed thresholds can support the identification of classes which violate design principles, as well as the identification of well-designed classes. The method used in this study to derive software metrics thresholds can be applied to other software metrics in order to find their reference values.

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

software metric thresholds
open-source software
object-oriented software


Analysis of functionally graded plates by meshless method: A purely analytical formulation Functionally graded plates under static and dynamic loads are investigated by the local integral equation method (LIEM) in this paper. Plate bending problem is described by the Reissner moderate thick plate theory. The governing equations for the functionally graded material with respect to the neutral plane are presented in the Laplace transform domain and therefore the in-plane and bending problems are uncoupled. Both isotropic and orthotropic material properties are considered. The local integral equation method is developed with the locally supported radial basis function (RBF) interpolation. As the closed forms of the local boundary integrals are obtained, there are no domain or boundary integrals to be calculated numerically in this approach. The solutions of the nodal values for the entire plate are obtained by solving a set of linear algebraic equation system with certain boundary conditions. Details of numerical procedures are presented and the accuracy and convergence characteristics of the method are examined. Several examples are presented for the functionally graded plates under static and dynamic loads and the accuracy for proposed method has been observed compared with 3D analytical solutions.

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

meshless method
radial basis function
static and dynamic loads

functionally graded materials
kirchhoff and reissner plates
laplace transform method


A Built-In Repair Analyzer With Optimal Repair Rate for Word-Oriented Memories This paper presents a built-in self repair analyzer with the optimal repair rate for memory arrays with redundancy. The proposed method requires only a single test, even in the worst case. By performing the must-repair analysis on the fly during the test, it selectively stores fault addresses, and the final analysis to find a solution is performed on the stored fault addresses. To enumerate all possible solutions, existing techniques use depth first search using a stack and a finite-state machine. Instead, we propose a new algorithm and its combinational circuit implementation. Since our formulation for the circuit allows us to use the parallel prefix algorithm, it can be configured in various ways to meet area and test time requirements. The total area of our infrastructure is dominated by the number of content addressable memory entries to store the fault addresses, and it only grows quadratically with respect to the number of repair elements. The infrastructure is also extended to support various types of word-oriented memories.

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

built-in self repair (bisr)
memory test
redundancy allocation
repair analysis
spare allocation


Efficient Broadcasting Using Network Coding and Directional Antennas in MANETs In this paper, we consider the issue of efficient broadcasting in mobile ad hoc networks (MANETs) using network coding and directional antennas. Network coding-based broadcasting focuses on reducing the number of transmissions each forwarding node performs in the multiple source/multiple message broadcast application, where each forwarding node combines some of the received messages for transmission. With the help of network coding, the total number of transmissions can be reduced compared to broadcasting using the same forwarding nodes without coding. We exploit the usage of directional antennas to network coding-based broadcasting to further reduce energy consumption. A node equipped with directional antennas can divide the omnidirectional transmission range into several sectors and turn some of them on for transmission. In the proposed scheme using a directional antenna, forwarding nodes selected locally only need to transmit broadcast messages, original or coded, to restricted sectors. We also study two extensions. The first extension applies network coding to both dynamic and static forwarding node selection approaches. In the second extension, we design two approaches for the single source/single message issue in the network coding-based broadcast application. Performance analysis via simulations on the proposed algorithms using a custom simulator and ns2 is presented.

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

broadcasting
directional antennas
network coding
simulations


Assessment of two approximation methods for computing posterior model probabilities Model selection is an important problem in statistical applications. Bayesian model averaging provides an alternative to classical model selection procedures and allows researchers to consider several models from which to draw inferences. In the multiple linear regression case, it is difficult to compute exact posterior model probabilities required for Bayesian model averaging. To reduce the computational burden the Laplace approximation and an approximation based on the Bayesian information criterion (BIC) have been proposed. The BIC approximation is the easiest to calculate and is being used widely in application. In this paper we conduct a simulation study to determine which approximation performs better. We give an example of where the methods differ, study the performance of these methods on randomly generated models and explore some of the features of the approximations. Our simulation study suggests that the Laplace approximation performs better on average than the BIC approximation.

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

laplace approximation
bayesian model averaging
model selection

schwarz bayesian information criterion
variable assessment


making sensor networks ipv6 ready With emerging IPv6-based standards such as 6LowPAN and ISA100a, full IPv6 sensor networks are the next major step. With millions of deployed embedded IPv6 devices, interoperability is of major importance, both within the sensor networks and between the sensors and the Internet hosts. We present uIPv6, the first IPv6 stack for memory-constrained devices that passes all Phase-1 IPv6 Ready certification tests. This is an important step for end-to-end interoperability between IPv6 sensors and any IPv6 capable device. To allow widespread community adoption, we release uIPv6 under a permissive open source license that allows both commercial and non-commercial use.

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


Determinants of firm exit in Slovenian manufacturing Purpose - This paper sets out to present the determinants of firm exit at the micro firm-level of Slovenian manufacturing derived from the results of pooled and panel probit models. Design/methodology/approach - Empirical research is conducted on the basis of the Slovenian firm registry data which include virtually all the firms in manufacturing. This data set is complemented with sector level trade data to investigate import competition. A representative panel data set of Slovenian manufacturing firms is used to estimate pooled and panel probit models focusing on the effect of firm specific characteristics, domestic sector and import competition, and financial variables on firm exit. The results of the analysis are compared with research for other countries. Findings - The econometric results show a consistently positive, highly significant effect of import competition offsetting the impact of domestic competition on firm exit. Firm's export orientation, capital intensity, innovation expenditures, firm profitability and sector's real sales growth reduce exit, while private ownership and lower firm cost efficiency increase it. Originality/value - The uniqueness of this paper is twofold. It is one of the first empirical studies to conduct an in-depth analysis of market dynamics and the determinants of firm exit at the firm level for transition countries, and the first one for Slovenia. The study applies a comprehensive research model to virtually all the Slovenian manufacturing firms and provides valuable insights into the relationship between firm exit and firm specific characteristics, competition and finance.

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


Combining

Coarse-Grained

Software

Pipelining

with

DVS

for

Scheduling

Real-Time

Periodic

Dependent

Tasks

on

Multi-Core

Embedded

Systems

In

this

paper,

we

combine

coarse-grained

software

pipelining

with

DVS

(Dynamic

Voltage/Frequency

Scaling)

for

optimizing

energy

consumption

of

stream-based

multimedia

applications

on

multi-core

embedded

systems.

By

exploiting

the

potential

of

multi-core

architecture

and

the

characteristic

of

streaming

applications,

we

propose

a

two-phase

approach

to

solve

the

energy

minimization

problem

for

periodic

dependent

tasks

on

multi-core

processors

with

discrete

voltage

levels.

With

our

approach,

in

the

first

phase,

we

propose

a

coarse-grained

task-level

software

pipelining

algorithm

called

RDAG

to

transform

the

periodic

dependent

tasks

into

a

set

of

independent

tasks

based

on

the

retiming

technique

(Leiserson

and

Saxe,

Algorithmica

In

the

second

phase,

we

propose

two

DVS

scheduling

algorithms

for

energy

minimization.

For

single-core

processors,

we

propose

a

pseudo-polynomial

algorithm

based

on

dynamic

programming

that

can

achieve

optimal

solution.

For

multi-core

processors,

we

propose

a

novel

scheduling

algorithm

called

SpringS

which

works

like

a

spring

and

can

effectively

reduce

energy

consumption

by

iteratively

adjusting

task

scheduling

and

voltage

selection.

We

conduct

experiments

with

a

set

of

benchmarks

from

(Dick

and

TGFF

based

on

the

power

model

of

the

AMD

Mobile

DVS

processor.

The

experimental

results

show

that

our

technique

can

achieve

energy

saving

compared

with

the

algorithms

in

Zhang

et

al.

on

average.

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

scheduling
multimedia
software pipelining
retiming
periodic dependent tasks

dynamic voltage scaling (dvs)
multi-core
real-time


Robust H-infinity Fuzzy Output-Feedback Control With Multiple Probabilistic Delays and Multiple Missing Measurements In this paper, the robust H-infinity-control problem is investigated for a class of uncertain discrete-time fuzzy systems with both multiple probabilistic delays and multiple missing measurements. A sequence of random variables, all of which are mutually independent but obey the Bernoulli distribution, is introduced to account for the probabilistic communication delays. The measurement-missing phenomenon occurs in a random way. The missing probability for each sensor satisfies a certain probabilistic distribution in the interval [0 1]. Here, the attention is focused on the analysis and design of H-infinity fuzzy output-feedback controllers such that the closed-loop Takagi-Sugeno (T-S) fuzzy-control system is exponentially stable in the mean square. The disturbance-rejection attenuation is constrained to a given level by means of the H-infinity-performance index. Intensive analysis is carried out to obtain sufficient conditions for the existence of admissible output feedback controllers, which ensures the exponential stability as well as the prescribed H-infinity performance. The cone-complementarity-linearization procedure is employed to cast the controller-design problem into a sequential minimization one that is solved by the semi-definite program method. Simulation results are utilized to demonstrate the effectiveness of the proposed design technique in this paper.

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

discrete-time fuzzy systems
fuzzy control
multiple probabilistic time delays
networked-control systems (ncss)
robust h-infinity control
stochastic systems


Parametric mesh regularization for interpolatory shape design and isogeometric analysis over a mesh of arbitrary topology Present a method for parametric mesh regularization. Mainly for interpolatory shape design and isogeometric analysis. Also good for approximating schemes using other basis functions. Applicable to meshes of arbitrary topology using mapped basis functions. Produces arbitrarily high order continuity, including at extraordinary positions.

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

isogeometric analysis
mapped basis functions
parametric mesh regularization

interpolatory basis functions
irregular mesh
gravity center method


towards a framework for collaborative and coordinated product configuration In system-family approaches, product configuration is the activity of selecting the features desired for a software product. Although this process is typically collaborative this aspect has long been neglected. On the other hand, enabling collaborative product configuration brings new and challenging problems such as the proper coordination of configuration decisions. This paper introduces a framework for collaborative configuration that addresses the major issues that arise in this context. Some aspects of the framework can be customized to accommodate specific collaboration goals.

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


Resolution enhancement based on learning the sparse association of image patches Example-based image super-resolution techniques model the co-occurrence patterns between the middle and high frequency layers of example images to estimate the missing high frequency component for low resolution input. However, many existing approaches seek to estimate the optimal solution within a small set of candidates by using empirical criteria. Hence their representational performance is limited by the quality of the candidate set, and the generated super-resolution image is unstable, with noticeable artifacts. In this paper, we propose a novel image super-resolution method based on learning the sparse association between input image patches and the example image patches. We improve an existing sparse-coding algorithm to find sparse association between image patches. We also propose an iterative training strategy to learn a redundancy reduced basis set to speed up the super-resolution process. Comparing to existing example-based approaches, the proposed method significantly improves image quality, and the produced super-resolution images are sharp and natural, with no obvious artifact.

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

image super-resolution
image representation
sparse-coding