a routing underlay for overlay networks We argue that designing overlay services to independently probe the Internet--with the goal of making informed application-specific routing decisions--is an untenable strategy. Instead, we propose a shared routing underlay that overlay services query. We posit that this underlay must adhere to two high-level principles. First, it must take cost (in terms of network probes) into account. Second, it must be layered so that specialized routing services can be built from a set of basic primitives. These principles lead to an underlay design where lower layers expose large-scale, coarse-grained static information already collected by the network, and upper layers perform more frequent probes over a narrow set of nodes. This paper proposes a set of primitive operations and three library routing services that can be built on top of them, and describes how such libraries could be useful to overlay services.

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

network
routing
probe
overlay networks
design
overlay
account
paper
libraries
cost
query
posit

sharing applications strategies large-scale operability layer service internet infrastructure informal


A pragmatic approach to area coverage in hybrid wireless sensor networks Success of Wireless Sensor Networks (WSN) largely depends on whether the deployed network can provide desired area coverage with acceptable network lifetime. This paper seeks to address the problem of determining the current coverage achieved by the non-deterministic deployment of static sensor nodes and subsequently enhancing the coverage using mobile sensors. We identify three key elements that are critical for ensuring effective area coverage in Hybrid WSN: (i) determining the boundary of the target region and evaluating the area coverage (ii) locating coverage holes and maneuvering mobile nodes to fill these voids, and (iii) maintaining the desired coverage over the entire operational lifetime of the network. We propose a comprehensive solution that addresses all of the aforementioned aspects of the area coverage, called MAPC (mobility assisted probabilistic coverage). MAPC is a distributed protocol that operates in three distinct phases. The first phase identifies the boundary nodes using the geometric right-hand rule. Next, the static nodes calculate the area coverage and identify coverage holes using a novel probabilistic coverage algorithm (PCA). PCA incorporates realistic sensing coverage model for range-based sensors. The second phase of MAPC is responsible for navigating the mobile nodes to plug the coverage holes. We propose a set of coverage and energy-aware variants of the basic virtual force algorithm (VFA). Finally, the third phase addresses the problem of coverage loss due to faulty and energy depleted nodes. We formulate this problem as an Integer Linear Program (ILP) and propose practical heuristic solutions that achieve similar performance as that of the optimal ILP solution. A guiding principle in our design process has been to ensure that the MAPC can be readily implemented in real-world applications. We implemented the boundary detection and PCA algorithm (i. e., Phase I) of the MAPC protocol on off-the-shelf sensor nodes and results show that the MAPC can successfully identify boundary nodes and accurately determine the area coverage in the presence of real radio irregularities observed during the experiments. Extensive simulations were carried out to evaluate the complete MAPC protocol and the results demonstrate that MAPC can enhance and maintain the area coverage, while reducing the total energy consumption by up to 70% as compared with the basic VFA. Copyright (C) 2010 John Wiley & Sons, Ltd.

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

coverage estimation
coverage maintenance
hybrid wireless sensor network


Pseudo-t-norms and implication operators on a complete Brouwerian lattice In this paper, we introduce and discuss the concept of pseudo-t-norms on a complete Brouwerian lattice L, study the relation between the set of all infinitely boolean OR-distributive pseudo-t-norms and the set of all infinitely boolean AND-distributive implications on L in detail, and point out that three classes fundamental fuzzy implications and Yager's implication on [0, 1] are all infinitely boolean AND-distributive implications that can be induced by infinitely boolean OR-distributive pseudo-t-norms on L when L = [0, 1]. We also give out a method for generating pseudo-t-norms and implications on L. (C) 2002 Elsevier Science B.V. All rights reserved.

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

non-classical logic
t-norm
weak t-norm
pseudo-t-norm
strong negation


On a conjecture of Butler and Graham Motivated by a hat guessing problem proposed by Iwasawa, Butler and Graham made the following conjecture on the existence of a certain way of marking the coordinate lines in [k] (n) : there exists a way to mark one point on each coordinate line in [k] (n) , so that every point in [k] (n) is marked exactly a or b times as long as the parameters (a, b, n, k) satisfies that there are nonnegative integers s and t such that s + t = k (n) and as + bt = nk (n-1). In this paper we prove this conjecture for any prime number k. Moreover, we prove the conjecture for the case when a = 0 for general k.

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

hat guessing games
marking coordinate lines
characteristic function


Sequencing counts: A combined approach for sequencing and selecting costly unreliable off-line inspections We study the case of inspect-all policy, using off-line quality inspections to prevent non-conforming items from reaching the final consumer, in domains where an item is rejected upon first failure classification. Given a set of inspections with known inspection costs and error probabilities of two types (classifying conforming items as non-conforming and vice versa), the goal is to find a sequenced subset of inspections that maximizes the expected overall profit, taking into account the revenue from delivering conforming items, the penalty of delivering non-conforming ones, and the overall cost of the inspections used. Our model allows an additional degree of freedom, in comparison to prior work in this domain, enabling the selection of inspections sequence along the selection of which inspections to use. We present an efficient branch and bound algorithm for finding the optimal solution, and two types of heuristics: greedy-based and preliminary sort-based, differing in their accuracy and calculation time. The optimal and heuristic methods are extensively evaluated, using a factorial experimental design that includes 65610 problem instances. For each instance we compared the methods performance in terms of reaching optimality, deviation from the optimal solution and calculation-time. The results reflect a substantial influence of the sequence over the expected profit. An interesting finding is that the suggested preliminary sort-based heuristics achieve a relatively accurate solution in a reasonable calculation-time and outperform the commonly used greedy-based heuristics. The usefulness of the different methods is illustrated using sample problems from the biometric inspection security domain.

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

off-line inspections
monte-carlo simulation


DISCOV (DImensionless Shunting COlor Vision): A neural model for spatial data analysis The DISCOV (DImensionless Shunting COlor Vision) system models a cascade of primate color vision neurons: retinal ganglion, thalamic single opponent, and cortical double opponent. A unified model derived from psychophysical axioms produces transparent network dynamics and principled parameter settings. DISCOV fits an array of physiological data for each celltype, and makes testable experimental predictions. Binary DISCOV augments an earlier version of the model to achieve stable computations for spatial data analysis. The model is described in terms of RGB R G B images, but inputs may consist of any number of spatially defined components. System dynamics are derived using algebraic computations, and robust parameter ranges that meet experimental data are fully specified. Assuming default values, the only free parameter for the user to specify is the spatial scale. Multi-scale analysis accommodates items of various sizes and perspective. Image inputs are first processed by complement coding, which produces an ON channel stream and an OFF channel stream for each component. Subsequent computations are on-center/off-surround, with the OFF channel replacing the off-center/on-surround fields of other models. Together with an orientation filter, DISCOV provides feature input vectors for an integrated recognition system. The development of DISCOV models is being carried out in the context of a largescale research program that is integrating cognitive and neural systems derived from analyses of vision and recognition to produce both biological models and technological applications.

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

color vision
single opponent
double opponent

opponent processing
spatial analysis
remote sensing


Overcoming organizational challenges to secure knowledge management Incident management systems have the potential to improve security dramatically but often experience problems stemming from organizational, interpersonal and social constraints that limit their effectiveness. These limits may cause underreporting of incidents, leading to erroneous perceptions of the actual safety and security situation of the organization. The true security situation may be better understood and underreporting may be reduced if underlying systemic issues surrounding security incident management are taken into account. A dynamic simulation, based on the parallel experience of industrial incident management systems, illustrates the cumulative effects of rewards, learning, and retributions on the fate of a hypothetical knowledge management system designed to collect information about events and incidents. Simulation studies are part of an ongoing research project to develop sustainable knowledge and knowledge transfer tools that support the development of a security culture.

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

knowledge management
security
simulation
incident management


an accurate gradient-based predictive algorithm for image compression Many prediction algorithms have been proposed and implemented so far for efficient storage and transmission. In this paper, we propose an algorithm for predictive coding. This new algorithm evaluates and uses the values of the known pixels in much more different directions than previous algorithms such as Median Edge Detection (MED) and Gradient Adjusted Prediction (GAP). The proposed algorithm, MED, and GAP algorithms are implemented and tested on different image contents and sizes. The experimental results show that the prediction error of the proposed algorithm is much less than other algorithms. In other words, the quality of obtained predicted images via the proposed method is better than MED and GAP algorithms. Additionally, the accuracy of the proposed technique is independent from the image contents and image sizes.

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

gradient-based predictor
digital image processing


A new approach to measuring scientific production in JCR journals and its application to Spanish public universities Scientific production has been evaluated from very different perspectives, the best known of which are essentially based on the impact factors of the journals included in the Journal Citation Reports (JCR). This has been no impediment to the simultaneous issuing of warnings regarding the dangers of their indiscriminate use when making comparisons. This is because the biases incorporated in the elaboration of these impact factors produce significant distortions, which may invalidate the results obtained. Notable among such biases are those generated by the differences in the propensity to cite of the different areas, journals and/or authors, by variations in the period of materialisation of the impact and by the varying presence of knowledge areas in the sample of reviews contained in the JCR. While the traditional evaluation method consists of standardisation by subject categories, recent studies have criticised this approach and offered new possibilities for making inter-area comparisons. In view of such developments, the present study proposes a novel approach to the measurement of scientific activity, in an attempt to lessen the aforementioned biases. This approach consists of combining the employment of a new impact factor, calculated for each journal, with the grouping of the institutions under evaluation into homogeneous groups. An empirical application is undertaken to evaluate the scientific production of Spanish public universities in the year 2000. This application considers both the articles published in the multidisciplinary databases of the Web of Science (WoS) and the data concerning the journals contained in the Sciences and Social Sciences Editions of the Journal Citation Report (JCR). All this information is provided by the Institute of Scientific Information (ISI), via its Web of Knowledge (WoK).

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

research evaluation
journal impact factor


Solving the structure completion problem in surface crystallography Measured intensities of short-wavelength radiation diffracted from a crystal surface contain a contribution from the known bulk structure and the unknown surface structure. The recovery of the diffracted amplitude from the unknown surface from the experimental intensity measurements and from calculated amplitudes from the known bulk (treated as a reference wave) is closely analogous to holography, or to the structure completion problem in bulk crystallography, We show how an algorithm based on ideas of Bayesian statistics enables the direct recovery of the surface electron density from simulated surface X-ray diffraction data. (C) 2001 Elsevier Science B.V. All rights reserved.

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

structure completion
holography
bayesian statistics
surface crystallography

direct method
maximum entropy
surface x-ray diffraction


Two- and three-dimensional parametric packing We present approximation algorithms for the two- and three-dimensional bin packing problems and the three-dimensional strip packing problem. We consider the special case of these problems in which a parameter in (a positive integer) is given, indicating that each of the dimensions of the items to be packed is at most 1/m of the corresponding dimension of the recipient. We analyze the asymptotic performance of these algorithms and exhibit bounds that, to our knowledge, are the best known for this special case. (c) 2005 Elsevier Ltd. All rights reserved.

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

approximation algorithms
asymptotic performance
packing


Generation of 3-D finite-difference time-domain macromodels for faster simulation Computing time in finite-difference time-domain can be saved by expressing a portion of the grid (macromodel) as an linear time invariant (LTI) system. The output then becomes a convolution of the input with the LTI impulse response. To achieve a constant time for the convolution, the macromodel's response is expressed as a superposition of eigenmodal frequencies. That time is reduced by discarding nonessential eigenmodes. (C) 2007 Wiley Periodicals, Inc.

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

fdtd methods
design automation
reduced order systems
matrix decomposition


Temporal Correlation of Interference in Wireless Networks with Rayleigh Block Fading The temporal correlation of interference is a key performance factor of several technologies and protocols for wireless communications. A comprehensive understanding of interference correlation is especially important in the design of diversity schemes, whose performance can severely degrade in case of highly correlated interference. Taking into account three sources of correlation-node locations, channel, and traffic-and using common modeling assumptions-random homogeneous node positions, Rayleigh block fading, and slotted ALOHA traffic-we derive closed-form expressions and calculation rules for the correlation coefficient of the overall interference power received at a certain point in space. Plots give an intuitive understanding as to how model parameters influence the interference correlation.

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

wireless networks
interference
correlation

rayleigh fading
spatial stochastics
time diversity


A loosely coupled aspect language for SOA applications The aspect-oriented programming (AOP) paradigm offers software developers with powerful modularization abstractions to help them explicitly separate design concerns at the source code level. However, the impact of AOP in the service-oriented architecture (SOA) paradigm has been dwarfed by the fact that existing AOP solutions are tightly coupled to a particular programming language, middleware system or execution platform. Clearly, this not only restricts the implementation choices available to application developers, but it also clashes with the heterogeneous and loosely coupled nature of SOA. This paper presents the Web Service Aspect Language (WSAL) that seamlessly integrates AOP and SOA concepts, thus avoiding the drawbacks of existing solutions. In WSAL, aspects themselves are freely specified, implemented and executed as loosely coupled web services. This characteristic allows WSAL aspects to be easily woven into the message flow exchanged between service consumers and service providers, in a way that is completely independent from any particular implementation technology. This paper also reports on the implementation and preliminary evaluation of a prototype aspect weaver for WSAL, which is based on an existing web intermediary technology.

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

aspect-oriented programming
service-oriented architectures
separation of concerns


Infinite ternary square-free words concatenated from permutations of a single word We answer a question of Harju: An infinite square-free ternary word with an n-stem factorization exists for any n >= 13. We show that there are square-free uniform ternary morphisms of length k for every k >= 23. This resolves almost completely a problem of the author and Rampersad. (C) 2013 Elsevier B.V. All rights reserved.

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

square-free words
combinatorics on words


A phase-change problem for an extended heat conduction model The aim of this paper is the analysis of a free boundary value related to a generalized heat conduction model. The qualitative analysis proposed in this paper is developed also in view of the applications of suitable computational schemes to obtain quantitative results. A basic role is played by the fundamental solution of a third-order operator, explicitly determined in a previous paper. We first discuss a method to obtain the solutions to a moving boundary value problem for a third-order operator. Next, by using the properties of the function K, the free boundary value problem is reduced to a Volterra nonlinear system for which an existence and uniqueness result is given. (C) 2002 Elsevier Science 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 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

extended heat conduction models
free boundary value problems


B B -spline deconvolution for differential target cross-section determination in full-waveform laser scanning data In full-waveform laser scanning, short laser pulses are emitted and travel towards Earth and object surfaces. The sensor samples the waveform of the emitted pulse and its complete backscattered echo as a function of time. This technique allows for the three-dimensional reconstruction of the terrain, natural and man-made objects, and for the derivation of (geo-)physical quantities such as the differential target cross-section. The retrieval of the differential target cross-section requires deconvolution which is an ill-posed problem. In this study, we present a novel technique for the computation of the differential target cross-section using B B -splines. This class of mathematical functions enables a well-posed linear approach for deconvolution. Furthermore, it is not dependent on the symmetry of the temporal profiles of the emitted laser waveform and the received echoes, as approaches previously suggested. In this paper, the algorithm for deconvolution is presented in detail and validated for both synthetic and real-world full-waveform laser scanner data.

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


design methodologies for noise in digital integrated circuits In this paper, we describe the growing problems of noise in digital integrated circuits and the design tools and techniques used to ensure the noise immunity of digital designs.

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

digitize
design tool
integrated circuit
methodology
high-level synthesis, telecommunication


Consistency and stability of active contours with Euclidean and non-Euclidean arc lengths External energies of active contours are often formulated as Euclidean are length integrals. In this paper, we show that such formulations are biased. By this we mean that the minimum of the external energy does not occur at an image edge. In addition, we also show that for certain forms of external energy the active contour is unstable-when initialized at the true edge, the contour drifts away and becomes jagged. Both of these phenomena are due to the use of Euclidean are length integrals. We propose a non-Euclidean are length which eliminates these problems. This requires a reformulation of active contours where a single external energy function is replaced by a sequence of energy functions and the contour evolves as an integral curve of the gradient of these energies. The resulting active contour not only has unbiased external energy, but is also more controllable, Experimental evidence is provided in support of the theoretical claims.

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


Mapping a single assignment programming language to reconfigurable systems This paper presents the high level, machine independent, algorithmic, single-assignment programming language SA-C and its optimizing compiler targeting reconfigurable systems. SA-C is intended for Image Processing applications. Language features are introduced and discussed. The intermediate forms DDCF, DFG and AHA, used in the optimization and code-generation phases, are described. Conventional and reconfigurable system specific optimizations are introduced. The code generation process is described. The performance for these systems is analyzed, using a range of applications from simple Image Processing Library functions to more comprehensive applications, such as the ARAGTAP target acquisition prescreener.

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

reconfigurable computing systems
fpga
high level languages
optimizing compilation


technology tracking of non manhattan vlsi layout Improvements in IC technologies make existing layout libraries obsolete. In order to reuse these layouts, adaptation to the requirements of new technologies have to take place. In this paper a system is presented that automatizes this task using a locally two dimensional compaction algorithm. The system is able to handle arbitrary geometries and arbitrary technologies (including bipolar and mixed ones).

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

requirements place task order reuse technologies layout tracking algorithm paper libraries


Deterministic polynomial time equivalence between factoring and key-recovery attack on Takagi's RSA For RSA, May showed a deterministic polynomial time equivalence of computing d to factoring N(= pq). On the other hand, Takagi showed a variant of RSA such that the decryption algorithm is faster than the standard RSA, where N = p(r)q while ed = 1 mod (p - 1)(q-1). In this paper, we show that a deterministic polynomial time equivalence also holds in this variant. The coefficient matrix T to which LLL algorithm is applied is no longer lower triangular, and hence we develop a new technique to overcome this problem.

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


Migrating legacy scientific applications towards CORBA-based client-server architectures A distributed object is a reusable, self-contained piece of software that cooperates with other objects on the same machine or across a network in a plug-and-play fashion via a well-defined interface. The Numerical Propulsion System Simulation (NPSS) attempts to provide a collaborative aircraft engine design and simulation environment based on this concept. Many scientific applications in aerodynamics and solid mechanics are written in Fortran. Refitting this legacy Fortran code with distributed objects can increase code reusability. In this paper, we focus on the novel use of a remote variable scheme to help programmers migrate the Fortran code towards a client-server architecture. This scheme gives the client the capability of accessing variables at the server site and makes it easier for programmers to couple component engine code. Through the operator overloading features in C++, remote variables can be used in much the same way as traditional variables. The remote variable scheme adopts the lazy update approach and the prefetch method. Preliminary performance evaluation shows that communication overhead can be greatly reduced. Copyright (C) 2001 John Wiley & Sons, Ltd.

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

client-server computing
code wrapping
corba
software reusability


integrating clustering and multi-document summarization to improve document understanding Document understanding techniques such as document clustering and multi-document summarization have been receiving much attention in recent years. Current document clustering methods usually represent documents as a term-document matrix and perform clustering algorithms on it. Although these clustering methods can group the documents satisfactorily, it is still hard for people to capture the meanings of the documents since there is no satisfactory interpretation for each document cluster. In this paper, we propose a new language model to simultaneously cluster and summarize the documents. By utilizing the mutual influence of the document clustering and summarization, our method makes (1) a better document clustering method with more meaningful interpretation and (2) a better document summarization method taking the document context information into consideration.

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


investigating quality in large-scale open source software Open Source Software (OSS) development and use has increased significantly over recent years. Therefore, there is a need to analyze and understand these projects. Software quality is an important characteristic effecting overall system lifecycle cost, performance and useful life. The existing models for software quality are based on empirical analysis of propriety source software (PSS), and need to be verified in OSS. Research on PSS has revealed that software quality declines, as it ages. Part of this decline is associated with the lifecycle maintenance activities that introduce change in the size and complexity of the system, while introducing software errors into modified system. Lifecycle maintenance activities in OSS systems are processed under a very different paradigm. We are interested in investigating the effects of maintenance activities on OSS project outcomes. Linux is one of the most popular and complex OSS project available. In our research, we investigate the characteristics of Linux source code. In this position paper we present some preliminary results of the effects of various types of maintenance activities on quality of Linux software.

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

linux operating system
software maintenance


Immersive structural biology: a new approach to hybrid modeling of macromolecular assemblies Advanced biophysical imaging techniques, such as cryo-electron microscopy or tomography, enable 3D volumetric reconstructions of large macromolecular complexes in a near-native environment. However, pure volumetric data is insufficient for a detailed understanding of the underlying proteinprotein interactions. This obstacle can be overcome by assembling an atomic model of the whole protein complex from known atomic structures, which are available from either X-ray crystallography or homology modeling. Due to many factors such as noise, conformational variability, experimental artifacts, and inexact model structures, existing automatic docking procedures are known to report false positives for a significant number of cases. The present paper focuses on a new technique to combine an offline exhaustive search algorithm with interactive visualization, collision detection, and haptic rendering. The resulting software system is highly immersive and allows the user to efficiently solve even difficult multi-resolution docking problems. Stereoscopic viewing, combined with head tracking and force feedback, generates an ideal virtual environment for true interaction with and solution of hybrid biomolecular modeling problems.

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

structural biology
docking
haptic rendering

multi-resolution modeling
electron microscopy
virtual reality


Stress analyses of high spatial resolution on TSV and BEoL structures Knowledge and control of local stress development in Back-End-of-Line (BEoL) stacks and nearby Through Silicon Vias (TSVs) in advanced 3D integrated devices is a key to their thermo-mechanical reliability. The paper presents a combined simulation/measurement approach to evaluate stresses generated in the result of the TSV and BEoL stack manufacturing and 3D bonding processes. Stress measurement methods of high spatial resolution capability (microRaman and Focused Ion Beam (FIB) based stress release techniques) are used to obtain stress data from real components as manufactured. Finite Element Analysis (FEA) allows a more accurate interpretation of measurements results as well as a subsequent comprehensive analysis of failure behaviour. The paper gives an introduction to the applied local stress measurement on advanced multi-layer systems and 3D integration components referring to the state-of-art capabilities and limitations. The need of experimental stress data generation is illustrated on FEA examples. Illustration is given for FEA applications on 3D IC integration components currently lacking appropriate residual stress input for an assumed initial state.

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

stress
microraman
beol
tsv
finite element analysis


Robustness analysis for decision under uncertainty with rule-based preference model ? We introduce Robust Ordinal Regression to decision under uncertainty. We propose an integrated framework for robustness analysis with the rule-based preference model. We formulate the procedures for deriving a univocal classi fication of acts. We account for different types of indirect preference information. We consider group decision under uncertainty with Dominance-based Rough Set Approach.

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

decision under uncertainty
robustness analysis

classification
dominance-based rough set approach
univocal recommendation
group decision


An improved ordered subsets expectation maximization positron emission computerized tomography reconstruction ? Ordered subsets expectation maximization (OS-EM) reconstruction method is usually used in positron emission tomography (PET). But it has some disadvantage such as long computation time and bad reconstruction quality. Filtered back projection (FBP), that has many advantages such as simple structure and short reconstruction time, is firstly introduced into the initialization stage of the OS-EM to fast the reconstruction process. Then, the smoothness method is applied after the OS-EM algorithm to improve the reconstruction speed and quality. The reconstructed images are compared for both the simulated phantom data and the brain magnetic resonance imaging data. The improved OS-EM is shown to be more feasible than the standard OS-EM within the same iteration steps and in higher signal noise ratio (SNR) condition.

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

maximum likelihood expectation maximization (ml-em)


a fast volume rendering algorithm for time-varying fields using a time-space partitioning (tsp) tree This paper presents a fast volume rendering algorithm for time-varying fields. We propose a new data structure, called Time-Space Partitioning (TSP) tree, that can effectively capture both the spatial and the temporal coherence from a time-varying field. Using the proposed data structure, the rendering speed is substantially improved. In addition, our data structure helps to maintain the memory access locality and to provide the sparse data traversal so that our algorithm becomes suitable for large-scale out-of-core applications. Finally, our algorithm allows flexible error control for both the temporal and the spatial coherence so that a trade-off between image quality and rendering speed is possible. We demonstrate the utility and speed of our algorithm with data from several time-varying CFD simulations. Our rendering algorithm can achieve substantial speedup while the storage space overhead for the TSP tree is kept at a minimum.

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

tree
speedup
applications
quality
volume rendering
temporal
paper
access
control
locality
coherence
spatial
space
rendering
storage
data
demonstrate
image
algorithm
utility

simulation
scalar field visualization
time-varying fields
large-scale
maintainability
data structures
flexibility
timing
temporal coherence
errors
partition
volume visualization
memorialized
core


Thoughts on k-anonymization k-Anonymity is a method for providing privacy protection by ensuring that data cannot be traced to an individual. In a k-anonymous dataset, any identifying information occurs in at least k tuples. To achieve optimal and practical k-anonymity, recently, many different kinds of algorithms with various assumptions and restrictions have been proposed with different metrics to measure quality. This paper evaluates a family of clustering-based algorithms that are more flexible and even attempts to improve precision by ignoring the restrictions of user-defined Domain Generalization Hierarchies. The evaluation of the new approaches with respect to cost metrics shows that metrics may behave differently with different algorithms and may not correlate with some applications accuracy on output data.

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


On joint topology design and load balancing in free-space optical networks Free-space optical networks have emerged as a viable technology for broadband wireless backbone networks of the next generation. In this paper, we investigate the challenging problem of joint topology design and load balancing in FSO networks. We consider FSO link characteristics, cost constraints, traffic characteristics, traffic demand, and QoS requirements in the formulation, along with various objective functions including network-wide average load and delay. We apply the reformulation-linearization technique (RLT) to obtain linear programming (LP) relaxations of the original complex problem, and then incorporate the LP relaxations into a branch-and-bound framework. The proposed algorithm can produce highly competitive solutions with the performance guarantees in the form of bounded optimality gap. For reducing computation complexity, we also develop a fast heuristic algorithm to provide highly competitive solutions. The heuristic algorithm iteratively perturbs the current topology and computes network flows for the new topology, thus progressively improving the configuration and load balancing of the FSO network. The proposed algorithms are complementary to each other, since jointly applying the algorithms can make the FSO network dynamically adaptive to events occurring at both large and small timescales. The proposed algorithms are evaluated with extensive simulations. Our simulation results show that the heuristic algorithm can achieve an optimality gap close to that of the branch-and-bound algorithm, with significantly reduced computation time. (C) 2013 Elsevier B.V. All rights reserved.

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

free-space optics
multipath routing
optimization


Multiband vector quantization based on inner product for wideband speech coding This paper describes a multiband vector quantization (VQ) technique based on inner product for wideband speech coding at 16 kb/s. Our approach consists of splitting the input speech into two separate bands and then applying an independent coding scheme for each band. A code excited linear prediction (CELP) coder is used in the lower band while a transform based coding strategy is applied in the higher band. The spectral components in the higher frequency band are represented by a set of modulated lapped transform (MLT) coefficients. The higher frequency band is divided into three subbands, and the MLT coefficients construct a vector for each subband. Specifically, for the VQ of these vectors, an inner product-based distance measure is proposed as a new strategy. The proposed 16kb/s coder with the inner-product based distortion measure achieves better performance than the 48 kb/s ITU-T G.722 in subjective quality tests.

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

wideband speech coding
vq
celp
mlt
inner product


Dependence Clusters in Source Code A dependence cluster is a set of program statements, all of which are mutually inter-dependent. This article reports a large scale empirical study of dependence clusters in C program source code. The study reveals that large dependence clusters are surprisingly commonplace. Most of the 45 programs studied have clusters of dependence that consume more than 10% of the whole program. Some even have clusters consuming 80% or more. The widespread existence of clusters has implications for source code analyses such as program comprehension, software maintenance, software testing, reverse engineering, reuse, and parallelization.

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

algorithms
languages
measurement
program slicing


an automated test oracle for xml processing programs XML processing programs play an important role in the achievement of XML data querying, manipulation, and construction operations to compose XML data structures for very diverse purposes regarding information representation, storing and exchange on XML-based systems. Testing of XML processing programs is a challenging task since the test input and output data involved in the test executions may be complex and large in volume, which makes it difficult to determine the correctness of the execution results. However, existing approaches on XML-based testing pay scarce attention to the specification and automation of so-called test oracles in charge of judging the execution results from XML processing programs. This paper deals with the definition of an automated test oracle for XML processing programs which operates with differentiated levels of specification. The oracle automation is achieved by transforming these specification levels into program code, and the resulting oracle implementation is evaluated through an experimental study that reveals promising results.

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

software testing
xml queries
xml-based testing


probabilistic validation of aggregated data in vehicular ad-hoc networks Vehicular ad-hoc networks present great opportunity for information exchange and equal opportunity for abuse. Validating traffic information without imposing significant communication overheads is a hard problem. In this paper, we propose a solution for validating aggregated data. The main idea is to use random checks to probabilistically catch the attacker, and thereby discourage attacks in the network. Our solution relies on PKI based authentication and assumes a tamper-proof service in each car to carry out certain secure operations such as signing and timestamping. We try to keep the set of secure operations as small as possible, in accordance with the principle of economy of mechanism . We show that our solution provides security without significant communication overheads.

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

vehicular networks
malicious nodes
aggregation
data validation


Impact of Doppler spread and adaptive modulation on TCP throughput in Rayleigh fading channels A number of wireless systems have recently adopted adaptive modulation (AM) schemes to improve its efficiency. In this letter, our aim is to study the impact Doppler spread and adaptive modulation has on transmission control protocol (TCP) throughput in Rayleigh fading channels. We consider a finite state Markov channel (FSMC) model, which is a useful model for analyzing radio channel with nonindependent fading. Furthermore, we use a Markov model for TCP evolution and evaluate the TCP performance by computer simulations. In our simulations we have compared the TCP Reno scheme with TCP Tahoe scheme. The results indicate that a large Doppler spread leads to lower TCP throughput due to more frequent transitions of channel states and modulation schemes which make it difficult for the TCP congestion control mechanism to accommodate the dynamic link characteristics.

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

tcp
doppler spread
adaptive modulation
throughput


Creation of a new set of dynamic virtual reality faces for the assessment and training of facial emotion recognition ability The ability to recognize facial emotions is target behaviour when treating people with social impairment. When assessing this ability, the most widely used facial stimuli are photographs. Although their use has been shown to be valid, photographs are unable to capture the dynamic aspects of human expressions. This limitation can be overcome by creating virtual agents with feasible expressed emotions. The main objective of the present study was to create a new set of dynamic virtual faces with high realism that could be integrated into a virtual reality (VR) cyberintervention to train people with schizophrenia in the full repertoire of social skills. A set of highly realistic virtual faces was created based on the Facial Action Coding System. Facial movement animation was also included so as to mimic the dynamism of human facial expressions. Consecutive healthy participants (n=98) completed a facial emotion recognition task using both natural faces (photographs) and virtual agents expressing five basic emotions plus a neutral one. Repeated-measures ANOVA revealed no significant difference in participants accuracy of recognition between the two presentation conditions. However, anger was better recognized in the VR images, and disgust was better recognized in photographs. Age, the participants gender and reaction times were also explored. Implications of the use of virtual agents with realistic human expressions in cyberinterventions are discussed.

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

emotion recognition
virtual agents
dynamism
social skills
cyberintervention


a key pre-distribution scheme for secure sensor networks using probability density function of node deployment Pairwise key establishment is a fundamental service provided in secure sensor networks. However, due to resource constraints, establishing pairwise keys is not a trivial task. Recently, a random key pre-distribution scheme and its improvements have been proposed. The scheme proposed by Du et al. uses deployment knowledge to improve the performance and security of sensor networks. However, this scheme assumes group-based deployment in which groups of nodes are deployed from horizontal grid points. This assumption limits applications of the scheme. Therefore, in this paper, we propose an advanced key pre-distribution scheme in which different keys are logically mapped to two-dimensional positions, and the keys that are distributed to a node are determined by positions estimated using a node probability density function. The scheme can be applied to any deployment model provided the node probability density function has already been determined. Furthermore, simulation results show that our scheme achieves higher connectivity than Du et al.'s scheme.

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

key management
probabilistic key sharing


the computational complexity of continued fractions The Knuth-Schnhage algorithm for expanding a quolynomial into a continued fraction is shown to be essentially optimal with respect to the number of multiplications/divisions used, uniformly in the inputs.

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


A Pareto-optimal genetic algorithm for warehouse multi-objective optimization The automated warehouse management requires to fulfill objectives that are usually conflicting with each other. The decisions taken must ensure optimized usage of resources, cost reduction and better customer service. The warehouse replenishment task is a typical example of multi-objective optimization. In this paper, a genetic algorithm with a new crossover operator is developed to solve the replenishment problem. This algorithm is applied to real warehouse data and produces Pareto-optimal permutations of the stored products. A fuzzy rule-base is proposed to increase the diversity of the optimal solutions.

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

genetic algorithms
multi-objective optimization
pareto optimality
constrained placement


Bag-based data models for incomplete information and their closure properties In most practical database applications, incompleteness and duplication of facts should be carefully handled. We propose bag-based data models for incomplete information, called V-bags, CV-bags, GV-bags, and CGV-bags. In V-bags, incompleteness is represented by variables like C-tables by Imielinski and Lipski. GV-bags are a supermodel of V-bags, where global conditions that restrict assignments over variables are attached. CV-bags and CGV-bags are submodels of V-bags and GV-bags, respectively, where the usage of variables for representing the number of duplication of tuples is somewhat restricted. We also investigate the closure properties of forward and inverse algebraic operations (selection, projection, product, union, difference, and unique) on each of the data models under both CWA and OWA. Among these data models, CGV-bags have the most closed operations.

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


Simplifying environmental model reuse The environmental modelling community has developed many models with varying levels of complexity and functionality. Many of these have overlapping problem domains, have very similar science and yet are not compatible with each other. The modelling community recognises the benefits to model exchange and reuse, but often it is perceived to be easier to (re)create a new model than to take an existing one and adapt it to new needs. Many of these third party models have been incorporated into the Agricultural Production Systems Simulator (APSIM), a farming systems modelling framework. Some of the issues encountered during this process were system boundary issues (the functional boundary between models and sub-models), mixed programming languages, differences in data semantics, intellectual property and ownership. This paper looks at these difficulties and how they were overcome. It explores some software development techniques that facilitated the process and discusses some guidelines that can not only make this process simpler but also move models towards framework independence.

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

simulation
component
interoperability
framework independent


approximating relay placement in sensor networks The problem of placing relay nodes in a wireless sensor network is studied in the context of balanced data gathering. Previous work is extended by showing that even the simplest classes of the relay placement problem are hard to approximate. This work also presents a heuristic method for both lower-bounding and upper-bounding the maximum performance of a sensor network over all possible relay locations.

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

wireless sensor networks
energy constraints


Properties of max-* fuzzy relation equations We extend the result of Zhang et al. (J Fuzzy Math 14:53, 2006), who discussed the finite fuzzy relation equations with max-min and max prod composition. In this article, the max-* composition is used for wide family of operations *. In particular, families of solutions of two relation equations are compared.

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

max-* composition
max-* system of equations
solution family
solution invariant matrices
reduced matrix
matrix equivalence class


QoS ROUTING IN DIFFSERV MPLS NETWORKS With the emergence of new network applications and quality of service (QoS) requirements, current Internet technology that supports best-effort service is clearly insufficient. This paper undertakes a detailed study of dynamic quality of service routing in Differentiated Service (DiffServ) Multiprotocol Label Switching (MPLS) networks. A polynomial time, heuristic dynamic routing algorithm, namely TE-QOSPF-Mix, is proposed to provide a better trade-off between hop-count and bandwidth optimization. The algorithm uses well-defined comparative function in path selection with computational complexity equals the original Dijkstra's algorithm. A simulator, UMJaNetSim, is built to simulate and evaluate the proposed algorithm. The simulation results indicate that the proposed QoS routing algorithm exhibits better bandwidth acceptance and lower packet loss ratio.

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


A Hybrid PRAM and STT-RAM Cache Architecture for Extending the Lifetime of PRAM Caches To extend the lifetime of phase change RAM (PRAM) caches, we propose a hybrid cache architecture that integrates a relatively small capacity of spin transfer torque RAM (STT-RAM) write buffer with a PRAM cache. Our hybrid cache improves the endurance limitation of the PRAM cache by judiciously redirecting the write traffic from an upper memory layer to the STT-RAM write buffer. We have demonstrated through simulation that the proposed hybrid cache outperforms existing write-traffic reduction schemes with the same area overhead. Moreover, our approach is orthogonal to the existing schemes, providing an effective way of investing die area for cache lifetime extension by being used in combination with them.

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


automatically creating personalised exercises based on student profiles Course Marker (CM - previously called Course Master), is a CAA system that marks programming code and diagrams and is a reengineered version of the Ceilidh system. It has been used in many higher institutions around the world, including at its developers' base, the School of Computer Science & IT, at the University of Nottingham. CM allows teachers to set exercises, and students to submit their solutions to these exercises. Upon each submission, students obtain immediate marks and detailed feedback from the system [4].The system has been well received and is excellent at marking exercises. However it can be extended in a variety of ways. This paper describes such an enhancement based on customising the questions to individual students by generating a personalised set of questions. Currently, all students are given the same set of exercises.To improve the learning environment, the idea is to use tailored multi-modal questionnaires. Firstly new types of question have been added to CourseMarker functionality. Initially these are the fixed response type of question such as multiple choice and multiple answer. Later more sophisticated types based on the full power of CourseMarker will be added. These are combined with currently available programming exercises and diagram based questions into a multi-modal questionnaire consisting of multiple types of question.Initially the questions in a given questionnaire are fixed by the teacher and pre-selected from a question bank. The next step is to allow the system to choose a set of questions dynamically from the question bank so as to give each student a different questionnaire.A major enhancement to this, and the main thrust of the research, is to tailor each questionnaire individually to each student at an appropriate level of difficulty for that students' ability. That is we will generate personalised exercises for each student, according to some individual student profile.Metadata for the students' profile, such as their background, their current level of knowledge on pre-requisite and current topics and subjects, and their preferred or best learning modes, are to be stored in a user model [2]. All this information can be obtained by interacting with applications such as Knowledge Tree [3] and WHURLE [1] and by using the outcome of earlier questionnaires.This poster presentation will explain the work involved to incorporate these enhancements.

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

user modelling
computer-aided assessment (caa)
adaptive hypermedia


Optimal unification of infinite sets of types In this paper we focus on the properties of infinite sets of types that have finite substitutional images. Since the number of such images may be infinite. we provide the way of its reduction. Having this done, we apply the new methods in the field of learnability of classical categorial grammars.

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


On the relationship between the noise-to-power ratio (NPR) and the effective in-band distortion of WCDMA signals A formulation of the noise-to-power ratio (NPR) using the orthogonalization of the nonlinear model is performed. The analysis (coupled with simulations) is used to study the applicability of the NPR as a measure of in-band nonlinear distortion in wide band code division multiple access (WCDMA) systems. Simulated NPR of WCDMA signals is compared to that of narrow band Gaussian noise (NBGN) where it is shown that NPR using NBGN overestimates in-band distortion of WCDMA signals.

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


toward a more accurate view of when and how people seek help with computer applications Based on 40 interviews and 11 on-site workplace observations of people using computer applications at work, we confirm that use of printed and on-line help is very low and find that providing greater detail of categories solution methods can present a more realistic picture of users' behaviors. Observed study participants encountered a usability problem on average about once every 75 minutes and typically spent about a minute looking for a solution. Participants consumed much more time when they were unaware of a direct way of doing something and instead used less effective methods. Comparison of results from different data-collection methods suggests that interviews, and probably surveys, provide less reliable views of users' problem-solving behaviors than do participatory evaluation and direct observation.

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


Hybrid genetic algorithms for parameter identification of a hysteresis model of magnetostrictive actuators In this paper, we present an improved hysteresis model for magnetostrictive actuators. To obtain optimal parameters of the model, we study two distinct hybrid strategies: namely, employing a gradient algorithm as a local search operation of a genetic algorithm (GA), and taking the best individual of a GA as the initial value of a gradient algorithm. Here, two different gradient algorithms, a well-known LevenbergMarquardt algorithm (LMA) and a novel Trust-Region algorithm (TRA), are investigated. Finally, the proposed four hybrid genetic algorithms (HGAs) are applied to identify parameters of the improved model. The simulation and experimental results show the performances of the HGAs and the improved hysteresis model.

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

hybrid genetic algorithms
hysteresis
parameter identification


Reactive power and voltage control based on general quantum genetic algorithms This paper presents an improved evolutionary algorithm based on quantum computing for optimal steady-state performance of power systems. However, the proposed general quantum genetic algorithm (GQ-GA) can be applied in various combinatorial optimization problems. In this study the GQ-GA determines the optimal settings of control variables, such as generator voltages, transformer taps and shunt VAR compensation devices for optimal reactive power and voltage control of IEEE 30-bus and 118-bus systems. The results of GQ-GA are compared with those given by the state-of-the-art evolutionary computational techniques such as enhanced GA, multi-objective evolutionary algorithm and particle swarm optimization algorithms, as well as the classical primal-dual interior-point optimal power flow algorithm. The comparison demonstrates the ability of the GQ-GA in reaching more optimal solutions.

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

reactive power control
steady-state performance
meta-heuristic techniques
quantum mechanics computation


A modal decomposition and expansion approach for prediction of dynamic responses on a monopile offshore wind turbine using a limited number of vibration sensors A dynamic response prediction method is applied on an offshore wind turbine. The proposed method is fast, easy to implement, reliable and effective. A limited set of acceleration response measurements and a FE model is utilized. Different operational states of the wind turbine have been examined.

O 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

modal expansion
response estimation
structural health monitoring
offshore wind turbines
foundations


A prefetch taxonomy The growing difference between processor and main memory cycle time demands the use of aggressive prefetch algorithms to reduce the effective memory access latency. However, prefetching can significantly increase memory traffic and unsuccessful prefetches may pollute the cache. Metrics such as coverage and accuracy result from a simplistic classification of individual prefetches as "good" or "bad." They do not capture the full effect of each prefetch and, hence, do not accurately reflect the quality of the prefetch algorithm. Gross statistics such as changes in the number of misses, total traffic, and IPC are not attributable to individual prefetches. Such gross metrics are therefore useful only for ranking existing prefetch algorithms; they do not evaluate the effect of individual prefetches so that an algorithm might be tuned. In this paper, we introduce a new, accurate, and complete taxonomy, called the Prefetch Traffic and Miss Taxonomy (PTMT), for classifying each prefetch by precisely accounting for the difference in traffic and misses it generates, either directly or indirectly. We illustrate the use of PTMT by evaluating two data prefetch algorithms.

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


using clouds to address grid limitations This article is a review of the importance of identifying the conceptual components participating in the design of Grid infrastructure, the interfaces presented to other elements and the semantics involved. We will show that the middleware layer still exposes too much detail of the underlying implementation, thus making the application development more complex, difficulting interoperability and scaling. We also discuss Cloud Computing, an emerging technology that has been so far successful in the IT market, also show how Grids and Clouds are related, and to what extent these technologies may provide features that will help accomplish the Grid vision for e-Science applications.

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

cloud computing in grid middleware
grid middleware
virtualization


Character Projection Mask Set Optimization for Enhancing Throughput of MCC Projection Systems Character projection (CP) lithography is utilized for maskless lithography and is a potential for the future photomask manufacture because it can project ICs Much faster than point beam projection or variable-shaped beam (VSB) projection. In this paper, we first present a projection mask set development methodology for multi-column-cell (MCC) systems, in which column-cells can project patterns in parallel with the CP and VSB lithographies. Next, we present an INLP (integer nonlinear programming) model as well as an ILP (integer linear programming) model for optimizing a CP mask set of an MCC projection system so that projection time is reduced. The experimental results show that our optimization has achieved 33.4% less projection time in the best case than a naive CP mask development approach. The experimental results indicate that our CP mask set optimization method has virtually increased cell pattern objects on CP masks and has decreased VSB projection so that it has achieved higher projection throughput than just parallelizing two column-cells with conventional CP masks.

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

maskless lithography
character projection
throughput


type inference for datalog with complex type hierarchies Type inference for Datalog can be understood as the problem of mapping programs to a sublanguage for which containment is decidable. To wit, given a program in Datalog, a schema describing the types of extensional relations, and a user-supplied set of facts about the basic types (stating conditions such as disjointness, implication or equivalence), we aim to infer an over-approximation of the semantics of the program, which should be expressible in a suitable sublanguage of Datalog. We argue that Datalog with monadic extensionals is an appropriate choice for that sublanguage of types, and we present an inference algorithm. The inference algorithm is proved sound, and we also show that it infers the tightest possible over-approximation for a large class of Datalog programs. Furthermore, we present a practical containment check for a large subset of our type language. The crux of that containment check is a novel generalisation of Quine's procedure for computing prime implicants. The type system has been implemented in a state-of-the-art industrial database system, and we report on experiments with this implementation.

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


Quick noise-tolerant learning in a multi-layer memristive neural network In this letter, a multi-layer memristive neural network in which memristors serve as memory factor and impact factor is built for the binary images learning. Unlike the traditional artificial neural networks, the memristive neural network is trained with noise samples for the introduction of image overlay. A similarity recognition based on the impact factor for binary images is employed to exhibit the function of the memristive neural network. The Simulinks and the experiments shows that the proposed memristive neural network has quick learning speed and high noise tolerance.

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

image overlay
binary
noise
impact factor


Reactive scheduling based on actual logistics data by applying simulation-based optimization A reasonable management and monitoring of construction projects requires accurate construction schedules. Accuracy depends highly on availability of reliable actual logistics data. Such data contain information about available material, equipment, personnel, updated delivery dates, and other data on site conditions. However, such data is often associated with different types of uncertainties due to infrequent collections, varying transport times, or manual assessments. Nonetheless, consideration of these uncertainties is important for evaluating actual data regarding their impact on the overall construction progress. Currently, the integration of such data into construction schedules is a time-consuming, manual and, thus, error-prone process. Therefore, in practice schedules are not updated as often as they should be.

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

reactive construction scheduling
schedule adaptation
simulation-based optimization


A study of I/O methods for parallel visualization of large-scale data This paper presents two parallel I/O methods for the visualization of time-varying volume data in a high-performance computing environment. We discuss the interplay between the parallel renderer, I/O strategy, and file system, and show the results of our study on the performance of the I/O strategies with and without MPI parallel I/O support. The targeted application is earthquake modeling using a large 3D unstructured mesh consisting of one hundred millions cells. Our test results on the HP/Compaq AlphaServer operated at the Pittsburgh Supercomputing Center demonstrate that the I/O methods effectively remove the I/O bottlenecks commonly present in time-varying data visualization, and therefore help significantly lower interframe delay. This high-performance visualization solution allows scientists to explore their data in the temporal, spatial, and visualization domains at high resolution. Such new explorability, likely not presently available to most computational science groups, will help lead to many new insights into the modeled physical and chemical processes.

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

high-performance computing
massively parallel supercomputing
scientific visualization
parallel i/o
parallel rendering
time-varying data
volume rendering


Universal decentralized estimation in a bandwidth constrained sensor network Consider a situation where a set of distributed sensors and a fusion center wish to cooperate to estimate an unknown parameter over a bounded interval [-U, U]. Each sensor collects one noise-corrupted sample, performs a local estimation, and transmits a message to the fusion center, while the latter combines,the received messages to produce a final estimate. This correspondence investigates optimal local estimation and final fusion schemes under the constraint that the communication from each sensor to the fusion center must be a one-bit message. Such a binary message constraint is well motivated by the bandwidth limitation of the communication links, fusion center, and by the limited power budget of local sensors. In the absence of bandwidth constraint and assuming the noises are bounded to the interval [-U, U], additive, independent, but otherwise unknown, the classical estimation leory suggests that a total of O (u(2)/is an element of(2)) sensors are necessary and sufficient in order for the sensors and the fusion center to jointly estimate the unknown parameter within e root mean squared error (MSE). It is shown in this correspondence that the same remains true even with the binary message constraint. Furthermore, the optimal decentralized estimation scheme suggests allocating 1/2 of the sensors to estimate the first bit of the unknown parameter, 1/4 of the sensors to estimate the second bit, and so on.

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


Improving Multi-Level NAND Flash Memory Storage Reliability Using Concatenated BCH-TCM Coding By storing more than one bit in each memory cell, multi-level per cell (MLC) NAND flash memories are dominating global flash memory market due to their appealing storage density advantage. However, continuous technology scaling makes MLC NAND flash memories increasingly subject to worse raw storage reliability. This paper presents a memory fault tolerance design solution geared to MLC NAND flash memories. The basic idea is to concatenate trellis coded modulation (TCM) with an outer BCH code, which can greatly improve the error correction performance compared with the current design practice that uses BCH codes only. The key is that TCM can well leverage the multi-level storage characteristic to reduce the memory bit error rate and hence relieve the burden of outer BCH code, at no cost of extra redundant memory cells. The superior performance of such concatenated BCH-TCM coding systems for MLC NAND flash memories has been well demonstrated through computer simulations. A modified TCM demodulation approach is further proposed to improve the tolerance to static memory cell defects. We also address the associated practical implementation issues in case of using either single-page or multi-page programming strategy, and demonstrate the silicon implementation efficiency through application-specific integrated circuit design at 65 nm node.

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

hardware cost
throughput
trellis-coded modulation (tcm)


In the usability and likeability of virtual reality games for education: The case of VR-ENGAGE Educational software games aim at increasing the students' motivation and engagement while they learn. However, if software games are targeted to school classrooms they have to be usable and likeable by all students. Usability of virtual reality games may be a problem because these games tend to have complex user interfaces so that they are more attractive. Moreover, if the games acquire an educational content they may lose the attractiveness and appeal that they have on users who are familiar with commercial games. Consequently, likeability may also be questioned. In this paper, we address the issue of usability and likeability of a virtual reality game that is meant to teach students geography. We describe the evaluation experiments conducted, which involved three categories of students in terms of their level of game-playing expertise: novice, intermediate and expert game players. The evaluation results showed that the game was indeed usable and likeable but there was scope for usability and likeability improvement so that the educational benefits may be maximised for all categories of students. The evaluation studies reported in this paper, revealed important issues about further research on virtual reality educational games. (c) 2006 Elsevier Ltd. All rights reserved.

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

evaluation of cal systems
learning environments
teaching/learning strategies
edutainment


Investigating cooperation and collaboration in near synchronous computer mediated conferences The development and use of computer mediated communications as a tool for teaching and learning has grown considerably in recent years. It has been developed to extend the conventional face-to-face tutorial environment and for distance-learning purposes, actively engaging students in productive learning situations. Here we document the findings of an analysis of near synchronous conferencing where postgraduate distance learners worked in small groups to produce a report that examined media coverage of controversial science. The results suggest that students actively engaged in both cooperative and collaborative learning in preparing and producing these reports, and that tutor interventions were an important factor in influencing peer interaction. Furthermore, we have found evidence of cooperation between learners who passively participate in vicarious learning. We consider the implications of these findings with respect to current definitions of cooperation and collaboration. (c) 2005 Elsevier Ltd. All rights reserved.

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

adult learning
computer mediated communication
cooperative/collaborative learning
distance education and telelearning
media in education


Diffusion of Electric Vehicles and Novel Social Infrastructure from the Viewpoint of Systems Innovation Theory This paper describes diffusion of electric vehicles and novel social infrastructure from the viewpoint of systems innovation theory considering both human society aspects and elemental technological aspects Firstly. fundamentals of the systems innovation theory and the platform theory arc mentioned Secondly. discussion on mobility from the viewpoint of the human-society layer and discussion of electrical vehicles from the viewpoint of the elemental techniques arc carried OM Thirdly, based on those, R & D. measures are argued such as establishment of the ubiquitous noncontact feeding and authentication payment system is Important Finally, it is also insisted that after the establishment of this system the super smart grid with temporal and spatial control Including demand itself with the low social cost will be expected

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

ubiquitous power feeding and authentication payment system


JNCC2: The Java Implementation Of Naive Credal Classifier 2 JNCC2 implements the naive credal classifier 2 (NCC2). This is an extension of naive Bayes to imprecise probabilities that aims at delivering robust classifications also when dealing with small or incomplete data sets. Robustness is achieved by delivering set-valued classifications (that is, returning multiple classes) on the instances for which (i) the learning set is not informative enough to smooth the effect of choice of the prior density or (ii) the uncertainty arising from missing data prevents the reliable indication of a single class. JNCC2 is released under the GNU GPL license.

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

imprecise probabilities
missing data
naive bayes
naive credal classifier 2
java


On the feasibility of collaborative green data center ecosystems The increasing awareness of the impact of the IT sector on the environment, together with economic factors, have fueled many research efforts to reduce the energy expenditure of data centers. Recent work proposes to achieve additional energy savings by exploiting, in concert with customers, service workloads and to reduce data centers carbon footprints by adopting demand-response mechanisms between data centers and their energy providers. In this paper, we debate about the incentives that customers and data centers can have to adopt such measures and propose a new service type and pricing scheme that is economically attractive and technically realizable. Simulation results based on real measurements confirm that our scheme can achieve additional energy savings while preserving service performance and the interests of data centers and customers.

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

energy-efficient computing and networking


Modification of landing conditions at contact via flight Weight-bearing tasks performed by humans consist of a series of phases with multiple objectives. Analysis of the relationship between control and dynamics during successive phases of the tasks is essential for improving performance without sustaining injury. Experimental evidence regarding foot landings suggests that the distribution of momentum among segments at contact influences stability during interaction with the landing surface. In this study, we hypothesized that modification of control in one subsystem, in our case shoulder torque, during the flight phase of an aerial task would enable the performer to maintain behavior of other subsystems (e.g.lower extremity kinematics) and initiate contact with momentum conditions consistent with successful task performance. To test this hypothesis, an experimentally validated multilink dynamic model that incorporated modifications in shoulder torque was used to simulate the flight phase dynamics of overrotated landings. The simulation results indicate that modification in shoulder torque during the flight phase enables gymnasts to maintain lower extremity kinematics and initiate contact with trunk angular velocities consistent with those observed during successful landings. These results suggest that modifications in the control logic of one subsystem may be sufficient for achieving both global and local task objectives of landing.

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

biomechanics
gymnastics landing
human multijoint control
flight dynamics
modeling and simulation


lightweight reference affinity analysis Previous studies have shown that array regrouping and structure splitting significantly improve data locality. The most effective technique relies on profiling every access to every data element. The high overhead impedes its adoption in a general compiler, In this paper, we show that for array regrouping in scientific programs, the overhead is not needed since the same benefit can be obtained by pure program analysis.We present an interprocedural analysis technique for array regrouping. For each global array, the analysis summarizes the access pattern by access-frequency vectors and then groups arrays with similar vectors. The analysis is context sensitive, so it tracks the exact array access. For each loop or function call, it uses two methods to estimate the frequency of the execution. The first is symbolic analysis in the compiler. The second is lightweight profiling of the code. The same interprocedural analysis is used to cumulate the overall execution frequency by considering the calling context. We implemented a prototype of both the compiler and the profiling analysis in the IBM compiler, evaluated array regrouping on the entire set of SPEC CPU2000 FORTRAN benchmarks, and compared different analysis methods. The pure compiler-based array regrouping improves the performance for the majority of programs, leaving little room for improvement by code or data profiling.

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

data regrouping
data interleving
memory optimization


Reducing Buyers' Uncertainty About Taste-Related Product Attributes It is becoming increasingly important for firms to know when to take steps to reduce buyers' uncertainty about products and services. This paper focuses on investments that firms can make to reduce buyers' uncertainty about taste-related product attributes. Using an analytical model, we show that firms should disclose more taste-related information when the customer segment they directly target represents a larger share of the overall market. We further show that there are practical ways by which managers can decide if such disclosure investments are financially beneficial to their firms. Specifically, we show that the variance of consumer reviews can guide such decisions. The paper's main contribution to the extant literature is to show that firms must consider the variance, but not the mean, of buyer reviews, to determine the need to invest in reducing consumer uncertainty about taste-related attributes. The papers's findings are managerially important due to the ubiquity of consumer reviews. They are novel because most of the previous literature views the mean of the review as the key indicator. Finally, they are general in their applicability since they are independent of any assumptions about heuristics that buyers may use to ascertain product quality from the reviews of previous buyers.

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

consumer uncertainty reduction
information dissemination
product ratings
product review variance


A local mesh refinement multigrid method for 3-D convection problems with strongly variable viscosity A numerical method for solving 3-D convection problems with variable viscosity in Cartesian geometry is presented. Equations for conservation of mass, momentum, and energy are solved using a second-order finite-volume discretization in combination with a multigrid method. Viscosity variations of 10 orders of magnitude are considered. Convergence deteriorates with increasing viscosity variations, but modifications of the multigrid algorithm are found to improve the robustness of the numerical method for very large viscosity contrasts. An efficient and Flexible local mesh refinement technique is presented which is applied to various convection problems with variable viscosity. Comparisons with other numerical methods reveal that accurate results are obtained even when viscosity varies strongly. (C) 2000 Academic Press.

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

finite-volume discretization
multigrid methods
local mesh refinements
3-d fluid flow