Traffic Aware Cross-Site Virtual Machine Migration in Future Mobile Cloud Computing By moving Virtual Machines(VMs) to the sites closest to their users, cross-site VM migration is promising to improve users experience. However, when multiple VMs are required to be migrated, an arbitrary migration sequence will possibly congest the inter-site links. To avoid such congestion and also maximize the number of successful migrations, in this paper, we formulate VM migration sequence planning problem as a Mixed Integer Linear Programming(MILP) problem, which considers both inter-VM communication traffic and migration traffic. Due to the high computational complexity to get the optimal results, we further propose a heuristic algorithm referred as MinUti-O to approximate the optimal results with low complexity. The extensive simulation results show that the success ratio achieved by MinUti-O is close to the optimal results with less than 5 % gap under different topology with variation of migration requests and network conditions.

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

vm migration
mobile cloud computing
sequence planning


Efficient and accurate numerical methods for the Klein-Gordon-Schrodinger equations In this paper, we present efficient, unconditionally stable and accurate numerical methods for approximations of the Klein-Gordon-Schrodinger (KGS) equations with/without damping terms. The key features of our methods are based on: (i) the application of a time-splitting spectral discretization for a Schrodinger-type equation in KGS, (ii) the utilization of Fourier pseudospectral discretization for spatial derivatives in the Klein-Gordon equation in KGS, (iii) the adoption of solving the ordinary differential equations (ODEs) in phase space analytically under appropriate chosen transmission conditions between different time intervals or applying Crank-Nicolson/leap-frog for linear/nonlinear terms for time derivatives. The numerical methods are either explicit or implicit but can be solved explicitly, unconditionally stable, and of spectral accuracy in space and second-order accuracy in time. Moreover, they are time reversible and time transverse invariant when there is no damping terms in KGS, conserve (or keep the same decay rate of) the wave energy as that in KGS without (or with a linear) damping term, keep the same dynamics of the mean value of the meson field, and give exact results for the plane-wave solution. Extensive numerical tests are presented to confirm the above properties of our numerical methods for KGS. Finally, the methods are applied to study solitary-wave collisions in one dimension (ID), as well as dynamics of a 2D problem in KGS. (c) 2007 Elsevier Inc. All rights reserved.

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

klein-gordon-schrodinger equations
nonlinear schrodinger equation
klein-gordon equation
time splitting
plane wave
solitary wave
schrodinger-yukawa equations


OpenMP versus MPI for PDE solvers based on regular sparse numerical operators ? Two parallel programming models represented by OpenMP and MPI are compared for PDE solvers based on regular sparse numerical operators. As a typical representative of such an operator, a finite difference approximation of the Euler equations for fluid flow is considered. The comparison of programming models is made with regard to uniform memory access (UMA), non-uniform memory access (NUMA), and self-optimizing NUMA (NUMA-opt) computer architectures. By NUMA-opt, we mean NUMA systems extended with self-optimization algorithms, in order to reduce the non-uniformity of the memory access time. The main conclusions of the study are: (1) that OpenMP is a viable alternative to MPI on UMA and NUMA-opt architectures; (2) that OpenMP is not competitive on NUMA platforms, unless special care is taken to get an initial data placement that matches the algorithm; (3) that for OpenMP to be competitive in the NUMA-opt case, it is not necessary to extend the OpenMP model with additional data distribution directives, nor to include user-level access to the page migration library.

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


sentiment analysis of movie reviews on discussion boards using a linguistic approach We propose a linguistic approach for sentiment analysis of message posts on discussion boards. A sentence often contains independent clauses which can represent different opinions on the multiple aspects of a target object. Therefore, the proposed system provides clause-level sentiment analysis of opinionated texts. For each sentence in a message post, it generates a dependency tree, and splits the sentence into clauses. Then it determines the contextual sentiment score for each clause utilizing grammatical dependencies of words and the prior sentiment scores of the words derived from SentiWordNet and domain specific lexicons. Negation is also delicately handled in this study, for instance, the term "not superb" is assigned a lower negative sentiment score than the term "not good" . We have experimented with a dataset of movie review sentences, and the experimental results show the effectiveness of the proposed approach.

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

dependency tree
sentiment analysis
movie reviews


Design guidelines for the integration of Geiger-mode avalanche diodes in standard CMOS technologies The goal of this paper is to provide some useful design guidelines at the device level regarding the main challenges to be typically faced in the design and integration of Geiger-mode avalanche diodes in a standard CMOS process. Different techniques are found in literature in order to avoid premature edge breakdown with the aim of limiting the electric field at the edges to be weaker than in the multiplication region. In this article, the use of such techniques, the conditions where they can effectively work and above all their limitations are studied by means of TCAD simulations for various diode architectures. Additionally, the noise performance is discussed by focusing on the band-to-band tunneling and shallow trench isolation enhanced dark count rates. Geiger-mode bias techniques as well as a synthesis on the pros and cons of the various avalanche diode architectures are finally presented aiming at facilitating future design choices.

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

avalanche diode
premature edge breakdown

dark count rate
geiger-mode
peb
band-to-band tunneling
guard-ring
deep sub-micrometer technology


Dummy Fill Aware Buffer Insertion after Layer Assignment Based on an Effective Estimation Model This paper studies the impact of dummy fill for chemical mechanical polishing (CMP)-induced capacitance variation on buffer insertion based on a virtual CMP fill estimation model. Compared with existing methods, our algorithm is more feasible by performing buffer insertion not in post-process but during early physical design. Our contributions are threefold. First, we introduce an improved fast dummy fill amount estimation algorithm based on [4], and use some speedup techniques (tile merging, fill factor and amount assigning) for early estimation. Second, based on some reasonable assumptions, we present an optimum virtual dummy fill method to estimate dummy position and the effect on the interconnect capacitance. Then the dummy fill estimation model was verified by Our experiments. Third, we use this model in early buffer insertion after layer assignment considering the effects of dummy fill. Experimental results verified the necessity of early dummy fill estimation and the validity of our algorithm. Buffer insertion considering dummy fill during early physical design is necessary and our algorithm is promising.

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

buffer insertion
physical design
dummy fill


Reconsidering assessment in online/hybrid courses: Knowing versus learning This study explores the influence of assessment on students' online written discussions. A two-by-two design was used to understand students' expression of knowledge and of learning in the contexts of "regular" online discussions versus "final test" online discussions. Findings suggested that assessment had an impact on how students interacted online and in their use of rhetorical moves; and that knowing and learning are related but distinct constructs, correlated within each writing context, dissociated across contexts, and performing differentially as a function of students' perceptions of academic demands. We discuss the limitations of traditional assessment, offer an alternative approach, and conclude with practical suggestions for online/hybrid course instructors. (C) 2013 Elsevier Ltd. All rights reserved.

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

online course
discourse analysis
social learning
asynchronous written discussion


Energy flow prediction in built-up structures through a hybrid finite element/wave and finite element approach Numerical tool for the energy flow evaluation in a periodic substructure from the near-field to the far-field domain. The near-field part is then modeled by Finite Element Method (FEM). The periodic structure and the far-field part are regarded as waveguides and modeled by an enhanced Wave Finite Element Method (WFEM) where a modal reduction technique is employed to accelerate the calculation.. A multi-scale strategy is used such that the final matrices dimensions of the built-up structure are largely reduced disorders. An application is presented, a structural dynamical system coupled with periodic resistive piezoelectric shunts is discussed.

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

multi-scale modeling
wave and finite element method
forced response
periodic waveguide


Structural Optimization of 3D Masonry Buildings In the design of buildings, structural analysis is traditionally performed after the aesthetic design has been determined and has little influence on the overall form. In contrast, this paper presents an approach to guide the form towards a shape that is more structurally sound. Our work is centered on the study of how variations of the geometry might improve structural stability. We define a new measure of structural soundness for masonry buildings as well as cables, and derive its closed-form derivative with respect to the displacement of all the vertices describing the geometry. We start with a gradient descent tool which displaces each vertex along the gradient. We then introduce displacement operators, imposing constraints such as the preservation of orientation or thickness; or setting additional objectives such as volume minimization.

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 I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 neuro-dynamic programming-based optimal controller for tomato seedling growth in greenhouse systems This work proposes a neuro-dynamic programming-based optimal controller to guide the growth of tomato seedling crops by manipulating its environmental conditions in a greenhouse. The neurocontroller manages the growth development of the crop, while minimizing a predefined cost function that considers the operative costs and the final state errors under physical constraints on process variables and actuator signals. The aim is to guide the growth of tomato seedlings by controlling the microclimate of the greenhouse. The design process of the neurocontroller considers the nonlinear dynamic behavior of the crop-greenhouse system model and the real climate data. Simulations of the proposed approach allow for contrasting its performance against those of other strategies for tomato seedling crop development subject to various climatic conditions.

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

greenhouse control systems
intelligent agriculture
neuro-dynamic programming
neurocontrollers
optimal control


on the capacity of bicm with qam constellations In this tutorial paper we analyze the capacity of bit-interleaved coded modulation (BICM) with quadrature amplitude modulation (QAM) constellations, and we pay special attention to different bit-to-symbol labeling strategies. The relation between the BICM capacity and the capacity of other CM schemes such as trellis coded modulation (TCM) and multilevel codes (MLC) is analyzed. Motivated by the fact that for BICM with some particular labelings, the same E b / N 0 maps to more than one BICM capacity value, we study the relation between the capacity and E b / N 0 . In particular, we present some analytical results on this relation, and we also give an intuitive explanation for the somehow contradictory behavior of these curves.

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

mlc
quadrature amplitude modulation
tcm
bicm
coded modulation

channel capacity
gray code
binary labeling


sparse communication networks and efficient routing in the plane (extended abstract) Traditional approaches to network design separate the issues of designing the network itself and designing its management and control subsystems. This paper proposes an approach termed routing-oriented network design , which is based on designing the network topology and its routing scheme together, attempting to optimize some of the relevant parameters of both simultaneously. This approach is explored by considering the design of communication networks supporting efficient routing in the special case of points located in the Euclidean plane. The desirable network parameters considered include low degree and small number of communication links. The desirable routing parameters considered include small routing tables, small number of hops and low routing stretch. Two rather different schemes are presented, one based on direct navigation in the plane and the other based on efficient hierarchical tree covers. On a collection of n sites with diameter D , these methods yield networks with maximum degree O (log D ) (hence a total of O ( n log D ) communication links), coupled with routing schemes with constant routing stretch, O (log n log D ) memory bits per vertex and routes with at most log n or log D hops.

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

network communication tree log design tables direct links case paper navigation control management yield routing scheme

point
efficiency
collect
relevance
network design
hierarchic
method
abstraction
locatability
optimality
communication networks
memorialized
network topologies


Evolutionary repair of faulty software Testing and fault localization are very expensive software engineering tasks that have been tried to be automated. Although many successful techniques have been designed, the actual change of the code for fixing the discovered faults is still a human-only task. Even in the ideal case in which automated tools could tell us exactly where the location of a fault is, it is not always trivial how to fix the code. In this paper we analyse the possibility of automating the complex task of fixing faults. We propose to model this task as a search problem, and hence to use for example evolutionary algorithms to solve it. We then discuss the potential of this approach and how its current limitations can be addressed in the future. This task is extremely challenging and mainly unexplored in the literature. Hence, this paper only covers an initial investigation and gives directions for future work. A research prototype called JAFF and a case study are presented to give first validation of this approach.

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

automated debugging
genetic programming
search based software engineering
coevolution


Fuzzy unidirectional force control of constrained robotic manipulators The end effector of a robotic arm is required to keep a contact on the contour of the constraint surface in tasks such as deburring and grinding. Being different from contacts resulted from general mechanical pairs, such a contact is unidirectional, or equivalently, the contact force can only act along the outward normal of the constraint surface at the contact point. How to achieve this specification was not addressed explicitly in many position/force control schemes developed so far, instead it was assumed in the development of controllers. In this paper, the unidirectionality of the contact force is explicitly included in modeling and control of constrained robot system. A fuzzy tuning mechanism is developed to generate the impedance model resulted from the continuous contact made by the end effector of the robotic manipulator on the constraint surface while it is in motion. A controller is then developed based on the fuzzy rule bases and the nonlinear feedback technique. The simulation is carried out to verify the effectiveness of the approach. (C) 2002 Elsevier Science B.V. All rights reserved.

O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 quadratic construction for Zielonka automata with acyclic communication structure ? Asynchronous automata are parallel compositions of finite-state processes synchronizing over shared variables. A deep theorem due to Zielonka says that every regular trace language can be recognized by a deterministic asynchronous automaton. The construction is rather involved and the most efficient variant produces automata which are exponential in the number of processes and polynomial in the size of the DFA. In this paper we show a simple, quadratic construction in the case where the synchronization actions are binary and define an acyclic communication graph.

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


Palmprint verification based on 2D Gabor wavelet and pulse-coupled neural network To alleviate the limitation that the recent texture based algorithms for palmprint recognition yield unsatisfactory robustness to the variations of orientation, position and illumination in capturing palmprint images, this paper describes a novel texture based algorithm for palmprint recognition combining 2D Gabor wavelets and pulse coupled neural network (PCNN). In the proposed algorithm, palmprint images are decomposed by 2D Gabor wavelets, and then PCNN is employed to imitate the creatural vision perceptive process and decompose each Gabor subband into a series of binary images. Entropies for these binary images are calculated and regarded as features. A support vector machine-based classifier is employed to implement classification. Experimental results show that the proposed approach yields a better performance in terms of the correct classification percentages and relatively high robustness to the variations of orientation, position and illumination compared with the recent texture based approaches.

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

pulse-coupled neural network
support vector machine (svm)
entropy


A distributed activity scheduling algorithm for wireless sensor networks with partial coverage One of the most important design objectives in wireless sensor networks (WSN) is minimizing the energy consumption since these networks are expected to operate in harsh conditions where the recharging of batteries is impractical, if not impossible. The sleep scheduling mechanism allows sensors to sleep intermittently in order to reduce energy consumption and extend network lifetime. In applications where 100% coverage of the network field is not crucial, allowing the coverage to drop below full coverage while keeping above a predetermined threshold, i.e., partial coverage, can further increase the network lifetime. In this paper, we develop the distributed adaptive sleep scheduling algorithm (DASSA) for WSNs with partial coverage. DASSA does not require location information of sensors while maintaining connectivity and satisfying a user defined coverage target. In DASSA, nodes use the residual energy levels and feedback from the sink for scheduling the activity of their neighbors. This feedback mechanism reduces the randomness in scheduling that would otherwise occur due to the absence of location information. The performance of DASSA is compared with an integer linear programming (ILP) based centralized sleep scheduling algorithm (CSSA), which is devised to find the maximum number of rounds the network can survive assuming that the location information of all sensors is available. DASSA is also compared with the decentralized DGT algorithm. DASSA attains network lifetimes up to 92% of the centralized solution and it achieves significantly longer lifetimes compared with the DGT algorithm.

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

wireless sensor networks
partial coverage

energy efficiency
sleep/activity scheduling


The enhanced quality function deployment for developing virtual items in massive multiplayer online role playing games Because of the huge potential profit, the development of virtual items in massive multiplayer online role playing games (MMORPGs) has lately begun receiving attention. As a successful means for developing new products, the quality function deployment (QFD) has been widely used in devising virtual items. In traditional QFD, information about the customers, needs and their priorities can be gained through some marketing methods. However, these approaches heavily rely on the subjective results and cannot identify the demands of each customer because of bewildering amount of information. Thus, we adopt the genetic chaotic neural network (GCNN) technique to identify each customer's needs and their priorities and propose the enhanced qualify function deployment (EQFD). However, in most of the existing literature, the equations to describe chaos dynamics are fixed and rigid corresponding to different nonlinear dynamic systems. In fact, for many chaotic systems in applications, it is often difficult to obtain accurate and faithful mathematical models, regarding their physically complex structures and hidden parameters. Therefore, GCNN is proposed in this paper, where GA is embedded into the chaotic neural network to generate and refine the equations of chaotic systems. By experimenting our methods with several benchmark methods, the proposed GCNN is found to demonstrate a clear advantage over other identifying methods, and EQFD is proven to be a feasible technique for developing the virtual items in MMORPGs. (c) 2007 Elsevier Ltd. All rights reserved.

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


An agent-based approach to the two-dimensional guillotine bin packing problem The two-dimensional guillotine bin packing problem consists of packing, without overlap, small rectangular items into the smallest number of large rectangular bins where items are obtained via guillotine cuts. This problem is solved using a new guillotine bottom left (GBL) constructive heuristic and its agent-based (AB) implementation. GBL, which is sequential, successively packs items into a bin and creates a new bin every time it can no longer fit any unpacked item into the current one. AB, which is pseudo-parallel, uses the simplest system of artificial life. This system consists of active agents dynamically interacting in real time to jointly fill the bins while each agent is driven by its own parameters, decision process, and fitness assessment. AB is particularly fast and yields near-optimal solutions. Its modularity makes it easily adaptable to knapsack related 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

heuristics
cutting and packing
two-dimensional bin packing
agent-based systems
artificial intelligence


Identification and Characterization of Thymosin ?-4 in Chicken Macrophages Using Whole Cell MALDI-TOF The aim of the study was to determine chicken monocyte- and granulocyte-associated peptides and proteins using whole cell matrix-assisted laser desorption/ionization-timeofflight mass spectrometry (MALDI-TOF MS) and to characterize the peptides based on their abundance. The mass spectra showed a prominent peak at m/z 4963 in monocytes/macrophages but not in the granulocytes. Subsequent purification and characterization of the m/z 4963 peptide from an avian macrophage cell line HTC, revealed it to be thymosin ?-4 (T?-4), an actin-modulating peptide. HTC cells when treated with bacterial lipopolysaccharide and peptidoglycan to determine the modulation of T?-4 gene expression or its secretion, showed no changes

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


Explaining and predicting the adoption intention of mobile data services: A value-based approach This study comes to examine the adoption intention of Mobile Data Services (MDS) in Jordan. This study develops a value-based approach where value is used as a multidimensional construct. Our results show that utilitarian value is according to previous studies an important adoption factor. Our results show that economic factor is also significant as cost of using the mobile service comes into play. In the context of this study, hedonic, uniqueness, and epistemic value dimensions are not as important for the use of MDS.

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

adoption intention
mobile data services
value dimensions
mds
jordan


A Bridge Across the Bosphorus Returned Migrants, their Internet and Media Use and Social Capital Relatively few studies have focused on migrants who returned to the country of their origin or their parents' origin. Still fewer have examined the communication patterns of call center workers who live in one country but conduct all of their business in the language and culture of another country. Drawing on work by Portes and Bourdieu, this study treats the use of traditional media and the Internet and its relation to the bridging and bonding behavior of a group of Turks who returned to Istanbul from the Netherlands and who are now employed by a Dutch call center company. Based on a survey and three focus groups of employee participants, this research finds that more recent and younger returnees primarily bond with family and friends in Holland through use of Dutch media and Internet use, whereas longer term returnees connect more with Turkish media. Some bridging was occurring through interpersonal communication with Turks by the younger and more recent arrivals.

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


Extracting user web browsing patterns from non-content network traces: The online advertising case study Online advertising is a rapidly growing industry currently dominated by the search engine 'giant' Google. In an attempt to tap into this huge market, Internet Service Providers (ISPs) started deploying deep packet inspection techniques to track and collect user browsing behavior. However, these providers have the fear that such techniques violate wiretap laws that explicitly prevent intercepting the contents of communication without gaining consent from consumers. In this paper, we explore how it is possible for ISPs to extract user browsing patterns without inspecting contents of communication. Our contributions are threefold. First, we develop a methodology and implement a system that is capable of extracting web browsing features from stored non-content based network traces, which could be legally shared. When such browsing features are correlated with information collected by independently crawling the Web, it becomes possible to recover the actual web pages accessed by clients. Second, we evaluate our system on the Internet and check that it can successfully recover user browsing patterns with high accuracy. (C) 2011 Elsevier B.V. All rights reserved.

O O O O O O O O O O B I O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 enabled fractal based ECG compression in wireless body sensor networks We proposed a cloud efficient compression technique suitable for a wireless body sensor network. The compression ratio achieved is 40 with Percentage Residual Difference (PRD) of less than 1%. The decompression technique is designed to support partial retrieval of ECG data which make it suitable for cloud solutions. Better compression ratios compared with other available compression techniques.

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


Temporal reasoning and Bayesian networks This work examines important issues in probabilistic temporal representation and reasoning using Bayesian networks (also known as belief networks). The representation proposed here utilizes temporal (or dynamic) probabilities to represent facts, events, and the effects of events. The architecture of a belief network may change with time to indicate a different causal context. Probability variations with time capture temporal properties such as persistence and causation. They also capture event interaction, and when the interaction between events follows known models such as the competing risks model, the additive model, or the dominating event model, the net effect of many interacting events on the temporal probabilities can be calculated efficiently. This representation of reasoning also exploits the notion of temporal degeneration of relevance due to information obsolescence to improve the efficiency.

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

uncertain reasoning
bayesian (belief) networks
models of interaction


Vertex-Transitive Cubic Graphs of Square-Free Order A classification of connected vertex-transitive cubic graphs of square-free order is provided. It is shown that such graphs are well-characterized metacirculants (including dihedrants, generalized Petersen graphs, Mbius bands), or Tutte's 8-cage, or graphs arisen from simple groups PSL(2, p).

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

vertex-transitive graph
arc-transitive graph
metacirculant
tutte's 8-cage
coset graph


The

Two-Weighted

Inequalities

for

Sublinear

Operators

Generated

by

B

Singular

Integrals

in

Weighted

Lebesgue

Spaces

In

this

paper,

the

authors

establish

several

general

theorems

for

the

boundedness

of

sublinear

operators

(B

sublinear

operators)

satisfies

the

condition

generated

by

B

singular

integrals

on

a

weighted

Lebesgue

spaces

\(L_{p,\omega,\gamma}(\mathbb{R}_{k,+}^{n})\),

where

\frac{\gamma_{i}}{x_{i}}\frac{\partial}{\partial

The

condition

are

satisfied

by

many

important

operators

in

analysis,

including

B

maximal

operator

and

B

singular

integral

operators.

Sufficient

conditions

on

weighted

functions

and

are

given

so

that

B

sublinear

operators

satisfies

the

condition

are

bounded

from

to

\(L_{p,\omega_{1},\gamma}(\mathbb{R}_{k,+}^{n})\).

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


the union of congruent cubes in three dimensions A {\em dihedral (trihedral) wedge} is the intersection of two (resp. t hree) half-spaces in $\reals^3$. It is called {\em $\alpha$-fat} if the angle (resp., solid angle) determined by these half-spaces is at least $\alpha>0$. If, in addition, the sum of the three face angles of a trihedral wedge is at least $\gamma >4\pi/3$, then it is called {\em $(\gamma,\alpha)$-substantially fat}. We prove that, for any fixed $\gamma>4\pi/3, \alpha>0$, the combinatorial complexity of the union of $n$ (a) $\alpha$-fat dihedral wedges, (b) $(\gamma,\alpha)$-substantially fat trihedral wedges is at most $O(n^{2+\eps})$, for any $\eps>0$, where the constants of proportionality depend on $\eps$, $\alpha$ (and $\gamma$). We obtain as a corollary that the same upper bound holds for the combinatorial complexity of the union of $n$ (nearly) congruent cubes in $\reals^3$. These bounds are not far from being optimal.

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


read, write, and present for acm siguccs conferences The Association of Computing Machinery Special Interest Group in University and College Computing Services (ACM SIGUCCS) is made up of professionals who support and manage of information technology services at higher education institutions. SIGUCCS sponsors an annual conference that is drawn together by volunteers. The conference program takes the form of paper authors presenting their findings in 30 minute talks, as part of a panel, or in a poster session. Papers are presented on a variety of tracks such as management, technology, customer support, documentation and training, or instructional technology. The track titles can change over time. Attending and contributing to the SIGUCCS conference program is an opportunity for professional development. This paper seeks to demystify the process of contributing to the SIGUCCS conference program as a reader, author, and presenter and thus make the opportunity to obtain professional development through contributing to the SIGUCCS conference program easier.

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


web-based information content and its application to concept-based video retrieval Semantic similarity between words or phrases is frequently used to find matching correlations between search queries and documents when straightforward matching of terms fails. This is particularly important for searching in visual databases, where pictures or video clips have been automatically tagged with a small set of semantic concepts based on analysis and classification of the visual content. Here, the textual description of documents is very limited, and semantic similarity based on WordNet's cognitive synonym structure, along with information content derived from term frequencies, can help to bridge the gap between an arbitrary textual query and a limited vocabulary of visual concepts. This approach, termed concept-based retrieval, has received significant attention over the last few years, and its success is highly dependent on the quality of the similarity measure used to map textual query terms to visual concepts. In this paper, we consider some issues of semantic similarity measures based on Information Content (IC), and propose a way to improve them. In particular, we note that most IC-based similarity measures are derived from a small and relatively outdated corpus (the Brown corpus), which does not adequately capture the usage pattern of many contemporary terms: for example, out of more than 150,000 WordNet terms, only about 36,000 are represented. This shortcoming reflects very negatively on the coverage of typical search query terms. We therefore suggest using alternative IC corpora that are larger and better aligned with the usage of modern vocabulary. We experimentally derive two such corpora using the WWW Google search engine, and show that they provide better coverage of vocabulary, while showing comparable frequencies for Brown corpus terms. Finally, we evaluate the two proposed IC corpora in the context of a concept-based video retrieval application using the TRECVID 2005, 2006, and 2007 datasets, and we show that they increase average precision results by up to 200\%.

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

semantic similarity
wordnet
brown corpus
trecvid
information content


Comparison between two muscle models under dynamic conditions One fundamental problem when trying to calculate the force developed by one muscle during a motor task is the muscle model. Usually, one control signal is juxtaposed to one musclotendon unit. The question is how is this signal connected to the activation of the motor units (MUs) that compose the muscle and fire differently. The aim of the paper is to compare a Hill-type muscle model to a model composed of MUs. A fast elbow flexion performed by only one muscle is considered. The activation necessary for performing the motion and the corresponding frequencies are calculated for cases of fast and slow muscles using Hill-type model. Then the muscle is modelled as a mixture of with uniformly distributed twitch parameters. Using MotCo software the moments of impulsation of all MUs and their mechanical responses are predicted. The activation characteristics obtained by the two muscle models are compared. It is concluded that there are two essential parameters for proper muscle modelling: the lead-time and the MUs composition.

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

motor control
hill-model
muscle forces
genetic algorithm
neural control


Local joint entropy based non-rigid multimodality image registration We present a new variational model for image registration. The local joint entropy is used to measure the similarity of the images to be aligned. The weighted Horn-type regularization term is used to protect displacement fields from over-smoothing. The proposed model has the advantage of aligning local edges of images well. A fast iteration algorithm is designed to solve our model.

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

non-rigid
weighted horn regularization
variational differential
alternative minimization
aos algorithm


Survey of Experimental Evaluation Studies for Wireless Mesh Network Deployments in Urban Areas Towards Ubiquitous Internet Establishing wireless networks in urban areas that can provide ubiquitous Internet access to end-users is a central part of the efforts towards defining the Internet of the future. In recent years, Wireless Mesh Network (WMN) backbone infrastructures are proposed as a cost effective technology to provide city-wide Internet access. Studies that evaluate the performance of city-wide mesh network deployments via experiments provide essential information on various challenges of building them. In this survey, we particularly focus on such studies and provide brief conclusions on the problems, benefits, and future research directions of city-wide WMNs.

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

deployment
city-wide wireless mesh networks


Extremal sizes of subspace partitions A subspace partition I of V = V(n, q) is a collection of subspaces of V such that each 1-dimensional subspace of V is in exactly one subspace of I . The size of I is the number of its subspaces. Let sigma (q) (n, t) denote the minimum size of a subspace partition of V in which the largest subspace has dimension t, and let rho (q) (n, t) denote the maximum size of a subspace partition of V in which the smallest subspace has dimension t. In this article, we determine the values of sigma (q) (n, t) and rho (q) (n, t) for all positive integers n and t. Furthermore, we prove that if n a parts per thousand yen 2t, then the minimum size of a maximal partial t-spread in V(n + t -1, q) is sigma (q) (n, t).

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

vector space partitions
partial t-spreads


Visual Trustworthy Monitoring System (v-TMS) for Behavior of Trusted Computing As the platform mobility increases, it becomes increasingly susceptible to theft Stolen data is often regarded as being more valuable than the notebook hardware itself Thus, the need to protect user data and secrets is underscored in a mobile computing environment The Trusted Platform Module (TPM) is defined as a hardware instantiation which has been proposed by the TCG (Trusted Computing Group) for trust computing TPM offers facilities for the secure generation of cryptographic keys, and limitations on their use, in addition to a hardware pseudo-random number generator It also includes capabilities such as remote attestation and sealed storage A TPM can be used to authenticate hardware devices Since each TPM chip has a unique and secret RSA key burned in during production, It is capable of performing platform authentication The TPB (Trusted Platform Board) is an expansion of the TPM for enhancing the efficiency and usability of the TPM chip In addition to the TPB functions supporting high-standard trust environments within the hardware standard of the system in this paper, we develop the v-TMS (Visual Trustworthy Monitoring System) that provides visualization of real-time monitoring for the behavior of system resources (process, memory, network, users, etc) with TPB and system software for hardening of OS and applications Moreover, v-TMS is not only a web-based computing environment for system resources but also a real-time monitoring system for a trust computing environment

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

trusted computing
trusted platform module

trusted computing group
trustworthiness monitoring


A homotopy-based approach for computing defocus blur and affine transform simultaneously This paper presents a homotopy-based algorithm for a simultaneous recovery of defocus blur and the affine parameters of apparent shifts between planar patches of two pictures. These parameters are recovered from two images of the same scene acquired by a camera evolving in time and/or space and for which the intrinsic parameters are known. Using limited Taylor's expansion one of the images (and its partial derivatives) is expressed as a function of the partial derivatives of the two images, the blur difference, the affine parameters and a continuous parameter derived from homotopy methods. All of these unknowns can thus be directly computed by resolving a system of equations at a single scale. The proposed algorithm is tested using synthetic and real images. The results confirm that dense and accurate estimation of the previously mentioned parameters can be obtained.

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

computer vision
unified model
affine matching
homotopy method
generalized moment expansion


Architectures for functional imagination Imagination can be defined broadly as the manipulation of information that is not directly available to an agent's sensors. However, the topic of imagination raises representational, physiological, and phenomenological issues that cannot be tackled easily without using the body as a reference point. Within this framework, we define functional imagination as the mechanism that allows an embodied agent to simulate its own actions and their sensory consequences internally, and to extract behavioural benefits from doing so. In this paper, we present five necessary and sufficient requirements for the implementation of functional imagination, as well as a minimal architecture that meets all these criteria. We also present a taxonomy for categorising possible architectures according to their main attributes. Finally, we describe experiments with some simple architectures designed using these principles and implemented on simulated and real robots, including an extremely complex anthropomimetic humanoid.

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

cognitive architectures
antropomorphic robots
internal models


Quantifying patterns of agentenvironment interaction This article explores the assumption that a deeper (quantitative) understanding of the information-theoretic implications of sensorymotor coordination can help endow robots not only with better sensory morphologies, but also with better exploration strategies. Specifically, we investigate by means of statistical and information-theoretic measures to what extent sensorymotor coordinated activity can generate and structure information in the sensory channels of a simulated agent interacting with its surrounding environment. The results show how the usage of correlation, entropy, and mutual information can be employed (a) to segment an observed behavior into distinct behavioral states; (b) to analyze the informational relationship between the different components of the sensorymotor apparatus; and (c) to identify patterns (or fingerprints) in the sensorymotor interaction between the agent and its local environment.

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


An inventory model for deteriorating items with stock-dependent consumption rate and shortages under inflation and time discounting This paper derives an inventory model for deteriorating items with stock-dependent consumption rate and shortages under inflation and time discounting over a finite planning horizon. We show that the total cost function is convex. With the convexity, a simple solution algorithm is presented to determine the optimal order quantity and the optimal interval of the total cost function. The results are discussed with a numerical example and particular cases of the model are discussed in brief. A sensitivity analysis of the optimal solution with respect to the parameters of the system is carried out.

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

inventory deteriorating inflation shortages


Significance of Q Fever Serologic Diagnosis in Clinically Suspect Patients Q fever is caused by C. burnetii, an intracellular obligate bacterium. For clinical confirmation of Q fever, diagnosis of interstitial pneumonia is of significance. The acute disease varies in severity from minor to fatal, with the possibility of serious complications. Chronic endocarditis is a well-known outcome. Symptoms of Q fever can vary; fixing diagnosis is done by serology with the phase I and the phase II antibody. We tested 44 sera of 31 clinically suspect patients. From these, 22 patients were taken to the infection clinic, 8 to the pulmonary clinic, and one to the general hospital. From the 31 patients, 21 patients had one serum, 7 patients, 2 sera, and 3 patients, 3 sera. Blood samples were collected by vein puncture, and serum samples were kept at ?20C until testing. All sera were processed by indirect imunofluorescent assay (IFA) Q fever IgM and IgG. Of 44 processed sera, 21 were seropositive. Specific IgM antibody was found in sera of 6 patients (19.4%), and specific IgG antibody in sera of 16 patients (51.2%). In sera of 15 clinically suspect patients (48.3%), no specific anticoxiella antibody was found. From these results we can confirm the importance of serology in laboratory diagnosis and clinical affirmation of suspect Q fever. Indirect imunofluorescent assay (IFA) is reliable and appropriate for daily, routine diagnosis of human Q fever.

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

sarajevo
coxiella burnetii
serology diagnosis


Residual stress estimation in damascene copper interconnects using embedded sensors Mechanical stress in damascene copper/low-k interconnects has been studied by means of micro-rotating sensors embedded in chips and directly integrated in CMOS process flow. A new hinge sensor design has been elaborated and a new analytical model of the mechanical equilibrium of sensors is validated. These sensors allow the study of the average residual stress as a function of the line width in a range from few hundred nanometers to several microns. It was found that the residual stress increases from 290 to 850MPa in, respectively, 2 and 0.25?m wide lines. This trend shows a yield stress increase with the line width reduction. Copper grains microstructure change between large and narrow lines is probably one of the reasons for yield stress and so residual stress increase. This microstructure change has been observed by means of Transmission Electron Microscopy (TEM) observations.

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


visually localizing design problems with disharmony maps Assessing the quality of software design is difficult, as "design" is expressed through guidelines and heuristics, not rigorous rules. One successful approach to assess design quality is based on detection strategies, which are metrics-based composed logical conditions, by which design fragments with specific properties are detected in the source code. Such detection strategies, when executed on large software systems usually return large sets of artifacts, which potentially exhibit one or more "design disharmonies", which are then inspected manually, a cumbersome activity. In this article we present disharmony maps, a visualization-based approach to locate such flawed software artifacts in large systems. We display the whole system using a 3D visualization technique based on a city metaphor. We enrich such visualizations with the results returned by a number of detection strategies, and thus render both the static structure and the design problems that affect a subject system. We evaluate our approach on a number of open-source Java systems and report on our findings.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 visualization
software design anomalies


Optimal database search: Waves and catalysis Grover's database search algorithm, although discovered in the context of quantum computation, can be implemented using any system that allows superposition of states. A physical realization of this algorithm is described using coupled simple harmonic oscillators, which can be exactly solved in both classical and quantum domains. Classical wave algorithms are far more stable against decoherence compared to their quantum counterparts. In addition to providing convenient demonstration models, they may have a role in practical situations, such as catalysis.

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


On numerical methods for highly oscillatory problems in circuit simulation Purpose - The purpose of this paper is to analyse a novel technique for an efficient numerical approximation of systems of highly oscillatory ordinary differential equations (ODEs) that arise in electronic systems subject to modulated signals. Design/methodology/approach - The paper combines a Filon-type method with waveform relaxation techniques for nonlinear systems of ODEs. Findings - The analysis includes numerical examples to compare with traditional methods such as the trapezoidal rule and Runge-Kutta methods. This comparison shows that the proposed approach can be very effective when dealing with systems of highly oscillatory differential equations. Research limitations/implications - The present paper constitutes a preliminary study of Filon-type methods applied to highly oscillatory ODEs in the context of electronic systems, and it is a starting point for future research that will address more general cases. Originality/value - The proposed method makes use of novel and recent techniques in the area of highly oscillatory problems, and it proves to be particularly useful in cases where standard methods become expensive to implement.

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

electronic engineering
oscillators
circuits


type inference and semi-unification The Milner Calculus is the typed &lgr;-calculus underlying the type system for the programming language ML [Har86] and several other strongly typed polymorphic functional languages such as Miranda [Tur86] and SPS [Wan84]. Mycroft [Myc84] extended the problematical typing rule for recursive definitions and proved that the resulting calculus, termed Milner-Mycroft Calculus here, is sound with respect to Milner's [Mil78] semantics and that it preserves the principal typing property [DM82] of the Milner Calculus. The extension is of practical significance in typed logic programming languages [MO84] and, more generally, in any language with (mutually) recursive definitions. Mycroft didn't solve the decidability problem for typings in this calculus, though. This was an open problem independently raised also by Meertens [Mee83]. The decidability question was answered in the affirmative just recently by Kfoury et al. in [KTU88]. We show that the type inference problems in the Milner and the Milner-Mycroft Calculi can be reduced to solving equations and inequations between first-order terms, a problem we have termed semi-unification . We show that semi-unification problems have most general solutions in analogy to unification problems which translates into principal typing properties for the underlying calculi. In contrast to the (essentially) nonconstructive methods of [KTU88] we present functional specifications, which we prove partially correct, for computing the most general solution of semi-unification problems, and we devise a concrete nondeterministic algorithm on a graph-theoretic representation for computing these most general solutions. Finally, we point out some erroneous statements about the efficiency of polymorphic type checking that have persisted throughout the literature including an incorrect claim, submitted by ourselves, of polynomial time type checking in the Milner-Mycroft Calculus.

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

unification
ml
point
efficiency
polynomial
decidability
general
representation
practical
type system
sound
language
type inference
functional
polymorphic
algorithm

order
recursion
definition
computation
extensibility
timing
analog
method
semantic
logic program
graph
functional languages
programming language


SRTM resample with short distance-low nugget kriging The shuttle radar topography mission (SRTM), was flow on the space shuttle Endeavour in February 2000, with the objective of acquiring a digital elevation model of all land between 60 degrees north latitude and 56 degrees south latitude, using interferometric synthetic aperture radar (InSAR) techniques. The SRTM data are distributed at horizontal resolution of 1 arc-second (similar to 30m) for areas within the USA and at 3 arc-second (similar to 90m) resolution for the rest of the world. A resolution of 90m can be considered suitable for the small or medium-scale analysis, but it is too coarse for more detailed purposes. One alternative is to interpolate the SRTM data at a finer resolution; it will not increase the level of detail of the original digital elevation model (DEM), but it will lead to a surface where there is the coherence of angular properties (i.e. slope, aspect) between neighbouring pixels, which is an important characteristic when dealing with terrain analysis. This work intents to show how the proper adjustment of variogram and kriging parameters, namely the nugget effect and the maximum distance within which values are used in interpolation, can be set to achieve quality results on resampling SRTM data from 3" to 1". We present for a test area in western USA, which includes different adjustment schemes (changes in nugget effect value and in the interpolation radius) and comparisons with the original 1" model of the area, with the national elevation dataset (NED) DEMs, and with other interpolation methods (splines and inverse distance weighted (IDW)). The basic concepts for using kriging to resample terrain data are: (i) working only with the immediate neighbourhood of the predicted point, due to the high spatial correlation of the topographic surface and omnidirectional behaviour of variogram in short distances; (ii) adding a very small random variation to the coordinates of the points prior to interpolation, to avoid punctual artifacts generated by predicted points with the same location than original data points and; (iii) using a small value of nugget effect, to avoid smoothing that can obliterate terrain features. Drainages derived from the surfaces interpolated by kriging and by splines have a good agreement with streams derived from the 1" NED, with correct identification of watersheds, even though a few differences occur in the positions of some rivers in flat areas. Although the 1" surfaces resampled by kriging and splines are very similar, we consider the results produced by kriging as superior, since the spline-interpolated surface still presented some noise and linear artifacts, which were removed by kriging.

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


One set of pliers for more tasks in installation work: the effects on (dis)comfort and productivity In installation work, the physical workload is high. Awkward postures, heavy lifting and repetitive movements are often seen. To improve aspects of the work situation, frequently used pliers were redesigned to make them suitable for more cutting tasks. In this study these multitask pliers are evaluated in comparison to the originally used pliers in a field study and a laboratory study. For the field study 26 subjects participated divided into two groups according to their type of work. Ten subjects participated in the laboratory study. The multitask plier appeared to result in more comfort during working, more relaxed working and more satisfaction. No differences in productivity were found. In conclusion, the multitask pliers can replace the originally used pliers and are suitable for more tasks than the original pliers. The installation workers have to carry less pliers by using the multitask pliers.

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


Simulated unbound structures for benchmarking of protein docking in the Dockground resource Proteins play an important role in biological processes in living organisms. Many protein functions are based on interaction with other proteins. The structural information is important for adequate description of these interactions. Sets of protein structures determined in both bound and unbound states are essential for benchmarking of the docking procedures. However, the number of such proteins in PDB is relatively small. A radical expansion of such sets is possible if the unbound structures are computationally simulated.

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

protein interactions
molecular recognition
conformational analysis


Threshold-based admission control for a multimedia Grid: analysis and performance evaluation In a Grid-based services system facing a large number of requests with different services and profits significance, there is always a trade-off between the system profits and the Quality of Service (QoS). In such systems, admission control plays an important role: the system has to employ a proper strategy to make admission control decisions and reserve resources for the coming requests thus to achieve greater profits without violating the QoS of the requests already admitted. In this paper, we introduce three essential admission control strategies with threshold on resource reservation and a newly proposed strategy with layered threshold. Through comprehensive theoretical analyses and extensive simulations, we demonstrate that the strategy with layered threshold is more efficient and flexible than the existing strategies for Grid-based multimedia services systems. Copyright (c) 2006 John Wiley & Sons, Ltd.

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

multimedia grid
admission control
threshold


Diffusion kernels on statistical manifolds A family of kernels for statistical learning is introduced that exploits the geometric structure of statistical models. The kernels are based on the heat equation on the Riemannian manifold defined by the Fisher information metric associated with a statistical family, and generalize the Gaussian kernel of Euclidean space. As an important special case, kernels based on the geometry of multinomial families are derived, leading to kernel-based learning algorithms that apply naturally to discrete data. Bounds on covering numbers and Rademacher averages for the kernels are proved using bounds on the eigenvalues of the Laplacian on Riemannian manifolds. Experimental results are presented for document classification, for which the use of multinomial geometry is natural and well motivated, and improvements are obtained over the standard use of Gaussian or linear kernels, which have been the standard for text classification.

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

kernels
heat equation
diffusion
text classification


self-monitoring for sensor networks Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry out monitoring operations. Such an assumption, however, is often difficult for a large scale sensor network. In this work, we focus on designing an efficient scheme integrated with good self-monitoring capability as well as providing an infrastructure for various security protocols using local monitoring. To the best of our knowledge, we are the first to present the formal study on finding optimized self-monitoring topology for WSNs. We show the problem is NP-complete even under the unit disk graph (UDG) model, and give the upper bound on the approximation ratio. We further propose two distributed polynomial algorithms with provable approximation ratio to address this issue. Through comprehensive simulations, we evaluate the effectiveness of this design.

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

wireless sensor network
np-complete
self-monitoring


HCI and business practices in a collaborative method for augmented reality systems Every interactive system is composed of a functional core and a user interface. However, the software engineering (SE) and humancomputer interaction (HCI) communities do not share the same methods, models or tools. This usually induces a large work overhead when specialists from the two domains try to connect their applicative studies, especially when developing augmented reality systems that feature complex interaction cores. We present in this paper the essential activities and concepts of a development method integrating the SE and HCI development practices, from the specifications down to the design, as well as their application on a case study. The efficiency of the method was tested in a qualitative study involving four pairs of SE and HCI experts in the design of an application for which an augmented reality interaction would provide better user performance than a classic interactive system. The effectivity of the method was evaluated in a qualitative study comparing the quality of three implementations of the same application fragment (based on the same analysis model), using software engineering metrics. The first evaluation confirmed the ease of use of our method and the relevance of our tools for guiding the design process, but raised concerns on the handling of conflicting collaborative activities. The second evaluation gave indications that the structure of the analysis model facilitates the implementation of quality software (in terms of coupling, stability and complexity). It is concluded that our method enables design teams with different backgrounds in application development to collaborate for integrating augmented reality applications with information systems. Areas of improvement are also described.

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

information systems
software engineering
humancomputer interaction
augmented reality


Dimensions of Emotion in Expressive Musical Performance Abstract: This paper explores the dimensions of emotion conveyed by music. Participants rated emotion terms after seeing and/or hearing recordings of clarinet performances that varied in expressive content. A factor analysis revealed four independent dimensions of emotion. Changes to the clarinetists' expressive intentions did not significantly affect emotions conveyed by sound. It was largely through the visual modality that expressive intentions influenced the experience for observers.

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


Study of a plane-free jet exhausting from a channel by vortex-in-cell method A two-dimensional simulation of a plane jet exhausting from a channel has been performed using the vortex in cell algorithm in the Reynolds number range of 100-900. The vorticity is generated on the wall of the entrance channel whose length has been fixed in order to obtain a fully developed velocity profile at the entry of the jet. The transient behaviour of the velocity field starting from rest has been observed until reaching a quasi steady regime. The mean value of the velocity field is compared with the results of a finite volume computation on the same mesh. The velocity fluctuations obtained using this method are analysed. Their effect on the mean flow is estimated to be smaller than the viscous effect. Copyright (c) 2006 John Wiley & Sons, Ltd.

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

vortex method
numerical simulation
vortex flow
lagrangian method


An improved relaxed complex scheme for receptor flexibility in computer-aided drug design The interactions among associating (macro)molecules are dynamic, which adds to the complexity of molecular recognition. While ligand flexibility is well accounted for in computational drug design, the effective inclusion of receptor flexibility remains an important challenge. The relaxed complex scheme (RCS) is a promising computational methodology that combines the advantages of docking algorithms with dynamic structural information provided by molecular dynamics (MD) simulations, therefore explicitly accounting for the flexibility of both the receptor and the docked ligands. Here, we briefly review the RCS and discuss new extensions and improvements of this methodology in the context of ligand binding to two example targets: kinetoplastid RNA editing ligase 1 and the W191G cavity mutant of cytochrome c peroxidase. The RCS improvements include its extension to virtual screening, more rigorous characterization of local and global binding effects, and methods to improve its computational efficiency by reducing the receptor ensemble to a representative set of configurations. The choice of receptor ensemble, its influence on the predictive power of RCS, and the current limitations for an accurate treatment of the solvent contributions are also briefly discussed. Finally, we outline potential methodological improvements that we anticipate will assist future development.

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

docking
kinetoplastid rna editing ligase 1
molecular dynamics
virtual screening

clustering
ensemble-based docking
non-redundant ensemble
protein-ligand binding
relaxed complex method
representative ensemble
w191g cytochrome c peroxidase


Twin support vector machine with Universum data The Universum, which is defined as the sample not belonging to either class of the classification problem of interest, has been proved to be helpful in supervised learning. In this work, we designed a new Twin Support Vector Machine with Universum (called U U -TSVM), which can utilize Universum data to improve the classification performance of TSVM. Unlike U U -SVM, in U U -TSVM, Universum data are located in a nonparallel insensitive loss tube by using two Hinge Loss functions, which can exploit these prior knowledge embedded in Universum data more flexible. Empirical experiments demonstrate that U U -TSVM can directly improve the classification accuracy of standard TSVM that use the labeled data alone and is superior to U U -SVM in most cases.

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

classification
twin support vector machine
universum


compiler analysis of irregular memory accesses Irregular array accesses are array accesses whose array subscripts do not have closed-form expressions in terms of loop indices. Traditional array analysis and loop transformation techniques cannot handle irregular array accesses. In this paper, we study two kinds of simple and common cases of irregular array accesses: single-indexed access and indirect array access. We present techniques to analyze these two cases at compile-time, and we provide experimental results showing the effectiveness of these techniques in finding more implicit loop parallelism at compile-time and improved speedups.

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

arrays memorialized speedup compilation timing experimentation effect parallel express


relying on time synchronization for security in ad hoc networks Mobile Ad hoc networks are networks composed of mobile computing devices with wireless connections and no fixed infrastructure. The unique attributes of these networks cause new security problems. Some security protocols, such as the Timed, Efcient, Streaming, Loss-tolerant Authentication Protocol, TESLA [2], rely on loose time synchronization for security. These protocols have not fully analyzed the implications of relying on time synchronization in this environment. This paper looks into some of the difficulties in time synchronization and points out further areas for research.

O O O O O O O B I O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 Execution: An Approach based on extending Domain-Specific Modeling with Action Reports In this paper, we present an approach to development and application of domain-specific modeling (DSM) tools in the model-based management of business processes. The level of Model-to-Text (M2T) transformations in the standard architecture for domain-specific modeling solutions is extended with action reports, which allow synchronization between models, generated code, and target interpreters. The basic idea behind the approach is to use M2T transformation languages to construct submodels, client application components, and operations on target interpreters. In this manner, M2T transformations may be employed to support not only generation of target platform code from domain-specific graphical language (DSGL) models but also straightforward use of models and appropriate DSM tools as client applications. The applicability of action reports is demonstrated by examples from document engineering, and measurement and control systems.

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

domain-specific modeling
model-driven development
model transformations
modeling tools


Fast and scalable parallel processing of scalar multiplication in elliptic curve cryptosystems To secure parallel systems in communication networks, in this paper, we propose a fast and scalable parallel scalar multiplication method over generic elliptic curves for elliptic curve cryptosystems, by means of our proposed scalar folding and unfolding techniques. In contrast to previous parallel scalar multiplication methods, our method can be implemented into scalable parallel computers. The optimal time complexity is k point doublings (D) plus log k point additions (A), denoted as kD+(logk)A, where k is the bit length of the scalar. If our method is applied to Koblitz curves, the optimal time complexity can be reduced to (logk)A. Furthermore, previous simple side-channel-protected scalar multiplication methods can be integrated into our method for resisting against simple side-channel attacks. Copyright (c) 2011 John Wiley & Sons, Ltd.

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

scalar multiplication
elliptic curve cryptosystems


Construction of dual OVSF codes with lower correlations In wide-band code division multiple access (WCDMA), orthogonal variable spreading factors (OVSF) codes are assigned to different users to preserve the orthogonality between users' physical channels. In this letter, we present the dual OVSF code, which can transmit the variable data rates by suing two different modulated signals without loss of the orthogonality. The bit error rate (BER) performance under a multi-user environment suffering the additive white Gaussian noise (AWGN) channel and correlations of those codes are evaluated. The results demonstrate that the proposed dual OVSF scheme could provide flexible rates and lower correlation values with a slight increase in complexity.

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


layout optimization of cmos functional cells An optimal non-exhaustive method of minimizing the layout area of complementary series-parallel CMOS functional cells in the standard-cell style is presented. This generalizes earlier work of Uehara and van Cleemput which is heuristic and nonoptimal. A complete graph-theoretical framework for CMOS cell layout is developed and illustrated. The approach demonstrates a new class of graph-based algebras which characterize this layout problem.

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

layout framework method class functional

graph
heuristics
standard cell
algebra
optimality
parallel
completeness


some theoretical aspects of algorithmic routing In this paper we describe a router which has the capabilities of automatic rip-up and rerouting. The system employs a look-ahead feature for determining if as yet unrouted nets are unroutable. Backtrack programming is used to implement an implicit enumeration scheme which sequentially produces alternative paths for a given net. The relationship between this type of router and the problem of ordering nets is discussed. By varying parameters in our router which deal with back tracking and path-length deviations, we can obtain a hierarchy of routing systems. One extreme case corresponds to a classical Lee-type router; another to a perfect router which guarantees finding a solution if one exists.

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

capabilities systems router routing case tracking paper feature scheme

program order aspect relationships hierarchies


Classifier Subset Selection to construct multi-classifiers by means of estimation of distribution algorithms This paper proposes a novel approach to select the individual classifiers to take part in a Multiple-Classifier System. Individual classifier selection is a key step in the development of multi-classifiers. Several works have shown the benefits of fusing complementary classifiers. Nevertheless, the selection of the base classifiers to be used is still an open question, and different approaches have been proposed in the literature. This work is based on the selection of the appropriate single classifiers by means of an evolutionary algorithm. Different base classifiers, which have been chosen from different classifier families, are used as candidates in order to obtain variability in the classifications given. Experimental results carried out with 20 databases from the UCI Repository show how adequate the proposed approach is; Stacked Generalization multi-classifier has been selected to perform the experimental comparisons.

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

machine learning
multiple-classifier systems
evolutionary computation


Energy cost evaluation of parallel algorithms for multiprocessor systems With the continuous development of hardware and software, Graphics Processor Units (GPUs) have been used in the general-purpose computation field. They have emerged as a computational accelerator that dramatically reduces the application execution time with CPUs. To achieve high computing performance, a GPU typically includes hundreds of computing units. The high density of computing resource on a chip brings in high power consumption. Therefore power consumption has become one of the most important problems for the development of GPUs. This paper analyzes the energy consumption of parallel algorithms executed in GPUs and provides a method to evaluate the energy scalability for parallel algorithms. Then the parallel prefix sum is analyzed to illustrate the method for the energy conservation, and the energy scalability is experimentally evaluated using Sparse Matrix-Vector Multiply (SpMV). The results show that the optimal number of blocks, memory choice and task scheduling are the important keys to balance the performance and the energy consumption of GPUs.

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

gpus
parallel algorithms
energy scalability
energy conservation
performance


Large-scale multi-task image labeling with adaptive relevance discovery and feature hashing This paper proposes a novel multi-label classification approach. It seamlessly incorporates the idea of multi-task feature hashing learning. It can capture the task relationships at task-level as well as feature-level.

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


Global change and the evolution of phenotypic plasticity in plants Global change drivers create new environmental scenarios and selective pressures, affecting plant species in various interacting ways. Plants respond with changes in phenology, physiology, and reproduction, with consequences for biotic interactions and community composition. We review information on phenotypic plasticity, a primary means by which plants cope with global change scenarios, recommending promising approaches for investigating the evolution of plasticity and describing constraints to its evolution. We discuss the important but largely ignored role of phenotypic plasticity in range shifts and review the extensive literature on invasive species as models of evolutionary change in novel environments. Plasticity can play a role both in the short-term response of plant populations to global change as well as in their long-term fate through the maintenance of genetic variation. In new environmental conditions, plasticity of certain functional traits may be beneficial (i.e., the plastic response is accompanied by a fitness advantage) and thus selected for. Plasticity can also be relevant in the establishment and persistence of plants in novel environments that are crucial for populations at the colonizing edge in range shifts induced by climate change. Experimental studies show taxonomically widespread plastic responses to global change drivers in many functional traits, though there is a lack of empirical support for many theoretical models on the evolution of phenotypic plasticity. Future studies should assess the adaptive value and evolutionary potential of plasticity under complex, realistic global change scenarios. Promising tools include resurrection protocols and artificial selection experiments.

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

global change
phenotypic plasticity
adaptive
constraints

natural selection
invasive plants
novel environment


A computer aided cost estimation system for BGA/DCA technology The last decade has seen an increasing demand for smaller and more densely populated printed circuit boards (PCBs). This is partly due to the market driven need within the electronics industry of reducing the size of products while concurrently enhancing their capabilities. Consequently, the electronics packaging industry is relying upon area array technologies such as Ball Grid Array (BGA) and Direct Chip Attach (DCA) as possible replacements for the traditional peripherally leaded surface mount packaging formats. However, since these technologies are still in their nascent stage, the cost benefits obtained from them need to be quantified in an effort to aid in justifying their use. This paper describes a Computer Aided Cost Estimation (CAGE) system which has been developed to justify the use of BGA/DCA devices.

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

direct chip attach
computer aided cost estimation

electronics manufacturing
ball grid arrays
software integration


a new model for health care e-insurance using credit points and service oriented architecture (soa) Nowadays the concept of e-insurance is about how to apply online for insurance services (e.g. policy plan, claim). In this study we tried to develop a new model which is not based on insurance company plans. This new model is based on credits, points and rewards for health care insurance. With using this new model, clients will be able to choose their own created health care insurance plan. On the other hand small business groups involved a few number of clinics or hospitals can create their own health and care insurance. The new model is more appropriate for short term insurance and small town or areas. As the insurance risk is higher than available insurance plans, in this model the insurance price and investing the premiums are more than normal insurer company's policies. Moreover it can cover all who wants to be insured and also it is more flexible in terms of clients' needs. Finally researcher used Service Oriented Architecture (SOA) to connect all clinics and hospitals which are involved in the plan behind an e-insurance website. Therefore insured party just needs to connect e-insurance website in order to make an appointment for receiving medical care and etc.

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

service oriented architecture (soa)
insurance risks
e-insurance


Eulerian rotations of deformed nuclei for TDDFT calculations We discuss three practical methods for performing Eulerian rotations of Slater determinants in a three-dimensional Cartesian geometry. In addition to the straightforward application of the active form of the quantum mechanical rotation operator, we introduce two methods using a passive position-space rotation followed by an active spin-space rotation, one after variation and the other before variation. These methods can be used to initialize reactions involving deformed nuclei where a particular alignment of the deformed nuclei with respect to the collision axis is desired. We show that doing the rotation before the variation is the most efficient way of generating such initial states.

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