An efficient algorithm to compute differences between structured documents SGML/XML are having a profound impact on data modeling and processing. This paper presents an efficient algorithm to compute differences between old and new versions of an SGML/XML document. The difference between the two versions can be considered to be an edit script that transforms one document tree into another. The proposed algorithm is based on a hybridization of bottom-up and top-down methods: The matching relationships between nodes in the two versions are produced in a bottom-up manner and then the top-down breadth-first search computes an edit script. Faster matching is achieved because the algorithm does not need to investigate the possible existence of matchings for all nodes. Furthermore, it can detect structurally meaningful changes such as the movement and copy of a subtree as well as simple changes to the node itself like insertion, deletion, and update.

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

change detection
difference computation
edit operation
structured document
sgml
xml


Error estimates on a backward heat equation by a wavelet dual least squares method We apply a wavelet dual least squares method to a backward heat equation. Connecting Shannon wavelet bases with a special project method, the dual least squares method, we can obtain a regularized solution. Meanwhile, a new error estimate between the approximate solution and exact solution is proved.

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

backward heat equation
dual least squares method

ill-posed problems
shannon wavelets
regularization


A repairable system with imperfect coverage and reboot: Bayesian and asymptotic estimation System characteristics of a two-unit repairable system are studied from a Bayesian viewpoint with different types of priors assumed for unknown parameters, in which the coverage factor for an operating unit failure is possibly considered. Time to failure and time to repair of the operating units are assumed to follow exponential distributions. In addition, the recovery time and reboot time of the failed units also follow exponential distributions. When time to failure, time to repair, recovery time and reboot time are with uncertain parameters, a Bayesian approach is adopted to evaluate system characteristics. Monte Carlo simulation is used to derive the posterior distribution for the mean time to system failure and the steady-state availability. Some numerical experiments are performed to illustrate the results derived in this paper. (C) 2008 IMACS. Published by Elsevier B.V. All rights reserved.

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

availability
asymptotic estimation
mean time to system failure
simulation


predicting web searcher satisfaction with existing community-based answers Community-based Question Answering (CQA) sites, such as Yahoo! Answers, Baidu Knows, Naver, and Quora, have been rapidly growing in popularity. The resulting archives of posted answers to questions, in Yahoo! Answers alone, already exceed in size 1 billion, and are aggressively indexed by web search engines. In fact, a large number of search engine users benefit from these archives, by finding existing answers that address their own queries. This scenario poses new challenges and opportunities for both search engines and CQA sites. To this end, we formulate a new problem of predicting the satisfaction of web searchers with CQA answers. We analyze a large number of web searches that result in a visit to a popular CQA site, and identify unique characteristics of searcher satisfaction in this setting, namely, the effects of query clarity, query-to-question match, and answer quality. We then propose and evaluate several approaches to predicting searcher satisfaction that exploit these characteristics. To the best of our knowledge, this is the first attempt to predict and validate the usefulness of CQA archives for external searchers, rather than for the original askers. Our results suggest promising directions for improving and exploiting community question answering services in pursuit of satisfying even more Web search queries.

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

query clarity
searcher satisfaction
answer quality
community question answering


Techniques and Benefits of Energy-Aware Load-Distribution in Multi-domain Translucent Wavelength Switched Optical Networks In this paper, we propose a novel inter-domain connection provisioning mechanism for multi-domain translucent Wavelength Switched Optical Networks. The mechanism can operate in hierarchical and non-hierarchical path computation element-based architectures. It is based on a novel approach to derive the domain abstract topologies jointly with an inter-domain routing algorithm. The overall objective is to perform end-to-end route computations for incoming connections. We do so by taking into account the current load of the physical links and some energy parameters of the optical network devices with the purpose of distributing the load (as much as possible) along the physical links and keeping the energy consumption low. The performance of the whole mechanism is highlighted through extensive and illustrative simulation results that benchmark it against shortest path-based techniques.

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

routing algorithms
pce
energy efficiency
optimization


User-driven modelling: Visualisation and systematic interaction for end-user programming ? ?? This research enables computer literate engineers to model problems in software by minimising code they need to write. Software development is difficult for many engineers as they may have no time, experience, or access to software development tools necessary to model their problems. Using a combination of modelling via use of formulae (equations) and visualisation of the way these formulae interact, it is possible to construct modelling software without requiring code. This technique of user-driven modelling/programming (UDM/P) could be applied to any problem that requires linked equations to be represented and tracked, and results from these calculated. End-user programming could be tackled by many researchers co-operating to create specific solutions to different kinds of end-user programming problems. A stepped ontology based translation process assists with progress towards a generic solution, this is first applied to engineering modelling.

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

visual programming
transformation
meta programming
cost modelling
decision support
design
manufacture
user-driven modelling
semantic web
ontologies
end-user programming


Experimental investigation of MIMO relay channels statistics and capacity based on wideband outdoor measurements at 2.35 GHz Relay, which serves to enhance the performance of future communication networks, is one of the most promising techniques for IMT-Advanced systems. The potential performance improvement of relay is investigated in this work. Our investigation consists of two steps. In the first step, to obtain a better understanding of the fundamental properties of relay channels, we conducted outdoor measurements at 2.35 GHz with 50 MHz bandwidth in a typical urban area of China. Three links constituting the relay transmission, i.e., the link between base station and relay station, the link between relay station and mobile station and the link between base station and mobile station were measured by employing a real-time channel sounder. Two main factors that affect the MIMO channel capacity, i.e., the channel gain and effective degrees of freedom, are investigated. The cross-polarization discrimination was obtained by utilizing space-alternating generalized expectation-maximization algorithm. The channel parameters of the three links are statistically analyzed and compared. In the second step, based on the measured data, the performance of different relaying schemes, i.e., amplify-and-forward and decode-and-forward, is evaluated. The impact of RS antenna configuration on the capacity is also analyzed. The measurement and evaluation results reveal that the relay can significantly improve the system coverage and performance.

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

imt-advanced frequency band
channel characteristics
relay performance evaluation


compiling with code-size constraints Most compilers ignore the problems of limited code space in embedded systems. Designers of embedded software often have no better alternative than to manually reduce the size of the source code or even the compiled code. Besides being tedious and error-prone, such optimization results in obfuscated code which is difficult to maintain and reuse. In this paper, we present a code-size-directed compiler. We phrase register allocation and code generation as an integer linear programming problem where the upper bound on the code size can simply be expressed as an additional constraint. Our experiments show that our compiler, when applied to two commercial microcontroller programs, generates code as compact as carefully crafted code.

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

register allocation
integer linear programming


Some issues on intuitionistic fuzzy aggregation operators based on Archimedean t-conorm and t-norm Archimedean t-conorm and t-norm are generalizations of a lot of other t-conorms and t-norms, such as Algebraic, Einstein, Hamacher and Frank t-conorms and t-norms or others, and some of them have been applied to intuitionistic fuzzy set, which contains three functions: the membership function, the non-membership function and the hesitancy function describing uncertainty and fuzziness more objectively. Recently, Beliakov et al. [3] constructed some operations about intuitionistic fuzzy sets based on Archimedean t-conorm and t-norm, from which an aggregation principle is proposed for intuitionistic fuzzy information. In this paper, we propose some other operations on intuitionistic fuzzy sets, study their properties and relationships, and based on which, we study the properties of the aggregation principle proposed by Beliakov et al. [3], and give some specific intuitionistic fuzzy aggregation operators, which can be considered as the extensions of the known ones. In the end, we develop an approach for multi-criteria decision making under intuitionistic fuzzy environment, and illustrate an example to show the behavior of the proposed operators.

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

multi-criteria decision making
archimedean t-conorm
archimedean t-norm
aggregation operator


SiGe HBTs model converting technique from SGP to VBIC model A new parameter extraction methodology local ratio evaluation is presented which is well suitable for converting one model to another. An example is given for VBIC model extraction by going through SPICE GummelPoon (SGP) model. It is based on the fact that VBIC model is a direct enhancement and extension of SGP model. First, the standard SGP model is extracted in the standard way. Next, SGP model parameters are directly converted to those in VBIC model. Local modifications are subsequently carried out for those parameters that are affected by different equations used in the two models. Finally, new model parameters for enhanced modeling features are introduced by evaluating the difference between measurement and simulation.

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

bipolar transistor modeling
compact model
sige hbt
model conversion


full-system chip multiprocessor power evaluations using fpga-based emulation The design process for chip multiprocessors (CMPs) requires extremely long simulation times to explore performance, power, and thermal issues, particularly when operating system (OS) effects are included. In response, our novel FPGA-based emulation methodology models a full CMP design including applications and an OS. Activity counters programmed into the cores feed per-component microarchitectural power models. These models achieve under 10\% error compared to detailed gate-level simulations. Our method retains software flexibility, but offers up to 35x speedup compared to corresponding full-system software simulations. We present our approach by emulating a 2-core Leon3 cache-coherent multiprocessor running Linux and parallel benchmarks. In an example case study, our emulated system uses activity counts (a proxy for temperature) to guide process migration between the CMP cores. Overall, this paper's methodology makes possible detailed power and thermal studies of CMPs and their operating systems.

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

activity migration
full-system fpga-based emulation


Smoothing Neural Network for Constrained Non-Lipschitz Optimization With Applications In this paper, a smoothing neural network (SNN) is proposed for a class of constrained non-Lipschitz optimization problems, where the objective function is the sum of a nonsmooth, nonconvex function, and a non-Lipschitz function, and the feasible set is a closed convex subset of R-n. Using the smoothing approximate techniques, the proposed neural network is modeled by a differential equation, which can be implemented easily. Under the level bounded condition on the objective function in the feasible set, we prove the global existence and uniform boundedness of the solutions of the SNN with any initial point in the feasible set. The uniqueness of the solution of the SNN is provided under the Lipschitz property of smoothing functions. We show that any accumulation point of the solutions of the SNN is a stationary point of the optimization problem. Numerical results including image restoration, blind source separation, variable selection, and minimizing condition number are presented to illustrate the theoretical results and show the efficiency of the SNN. Comparisons with some existing algorithms show the advantages of the SNN.

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

smoothing neural network
stationary point
variable selection

image and signal restoration
non-lipschitz optimization


An AGENDA for testing relational database applications Database systems play an important role in nearly every modern organization, yet relatively little research effort has focused on how to test them. This paper discusses issues arising in testing database systems, presents an approach to testing database applications, and describes AGENDA, a set of tools to facilitate the use of this approach. In testing such applications, the state of the database before and after the user's operation plays an important role, along with the user's input and the system output. A framework for testing database applications is introduced. A complete tool set, based on this framework, has been prototyped. The components of this system are a parsing tool that gathers relevant information from the database schema and application, a tool that populates the database with meaningful data that satisfy database constraints, a tool that generates test cases for the application, a tool that checks the resulting database state after operations are performed by a database application, and a tool that assists the tester in checking the database application's output. The design and implementation of each component of the system are discussed. The prototype described here is limited to applications consisting of a single SQL query. Copyright (C) 2004 John Wiley Sons, Ltd.

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


route flap damping with assured reachability It is well known that a relatively small percentage of unstable routes exists in the global routing system which contributes an out of proportion number of routing updates. The route flap damping (RFD) was once considered an effective means to curtail such instability. However, both measurement studies and operational observations show that BGP path exploration can trigger false route damping which leads to prolonged periods of lost network reachability. As a result, many networks turned off RFD. In this paper we propose a simple solution, RFD+RG, dubbed RFD with Reachability Guard , to address the reachability problem in the RFD deployment. RFD+RG performs route flap damping without losing reachability, and the +RG enhancement component works independently from specific damping algorithms and can be integrated into any existing RFD scheme. We use collected BGP data to evaluate RFD+RG performance and our results show that RFD+RG can suppress up to 27\% of route instabilities while faithfully preserving reachability.

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


NON-EXCHANGEABLE RANDOM VARIABLES, ARCHIMAX COPULAS AND THEIR FITTING TO REAL DATA The aim of this paper is to open a new way of modelling non-exchangeable random variables with a class of Archimax copulas. We investigate a connection between powers of generators and dependence functions, and propose some construction methods for dependence functions. Application to different hydrological data is given.

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

archimax copula
dependence function
generator


Generalized endpoint-inflated binomial model To model binomial data with large frequencies of both zeros and right-endpoints, Deng and Zhang (in press) recently extended the zero-inflated binomial distribution to an endpoint-inflated binomial (EIB) distribution. Although they proposed the EIB mixed regression model, the major goal of Deng and Zhang (2015) is just to develop score tests for testing whether endpoint-inflation exists. However, the distributional properties of the EIB have not been explored, and other statistical inference methods for parameters of interest were not developed. In this paper, we first construct six different but equivalent stochastic representations for the EIB random variable and then extensively study the important distributional properties. Maximum likelihood estimates of parameters are obtained by both the Fisher scoring and expectationmaximization algorithms in the model without covariates. Bootstrap confidence intervals of parameters are also provided. Generalized and fixed EIB regression models are proposed and the corresponding computational procedures are introduced. A real data set is analyzed and simulations are conducted to evaluate the performance of the proposed methods. All technical details are put in a supplemental document (see Appendix A).

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

endpoint-inflated binomial distribution
expectationmaximization algorithm
multinomial logistic regression model
stochastic representation
zero-inflated binomial distribution


A converse result for the discrete memoryless relay channel with relay-transmitter feedback A converse result is proved for the discrete memoryless relay channel in the presence of relay-transmitter causal feedback. The result subsumes the Cover-El Gamal max-flow min-cut upper bound on the capacity of the one-way relay channel, and it is used to establish the partial feedback capacity of the semideterministic relay channel.

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

discrete memoryless relay channel
partial feedback


Tibetan Medicine and Regeneration An overview of the concept of regeneration in Tibetan medicine is presented with descriptions of detoxification and tonification longevity protocols. The body must be fortified before receiving stronger treatments for regeneration. All disease is brought into balance with understanding of the interplay of the five elements, three humors, and their qualities and locations. The example of multiple sclerosis (MS) is given. The macroscopic three-humor interpretation of MS agrees with the microscopic three-humor description of demyelination, providing a new framework for the understanding and treatment of MS. Treatments for MS and other chronic conditions are based on age, season, time of day, and the individual's three-humor and hot (excess) and cold (deficiency) balance. Treatments to promote regeneration include nutrition, gentle exercise, herbal formulas, accessory therapies such as herbal baths and oils, and meditation. It is built into the theory of Tibetan medicine to have predictions about outcome and distinguish different disease patterns in patients with MS and other disorders. Taking into account daily and seasonal variations coupled with the changing nature of MS, it is critical to frequently evaluate people with MS and other chronic conditions for monitoring and adjustment of treatment for regeneration.

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

tibetan medicine
regeneration
longevity
tonification
detoxification
multiple sclerosis


Intuitionistic (T, S)-fuzzy CI-algebras In this paper, we introduce the notion of intuitionistic (T, S)-fuzzy subalgebras in CI-algebras and study their fundamental properties. We get a fuzzy subalgebra from an intuitionistic (T, S)-fuzzy subalgebra. Also the notion of intuitionistic (T, S)-fuzzy (closed) filters of CI-algebras is introduced. We investigate the relationship between intuitionistic (T. S)-fuzzy subalgebras and intuitionistic (T, S)-fuzzy (closed) filters of CI-algebras. (C) 2011 Elsevier Ltd. All rights reserved.

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

intuitionistic (t, s)-fuzzy (closed) filter


Choosing software metrics for defect prediction: an investigation on feature selection techniques The selection of software metrics for building software quality prediction models is a search-based software engineering problem. An exhaustive search for such metrics is usually not feasible due to limited project resources, especially if the number of available metrics is large. Defect prediction models are necessary in aiding project managers for better utilizing valuable project resources for software quality improvement. The efficacy and usefulness of a fault-proneness prediction model is only as good as the quality of the software measurement data. This study focuses on the problem of attribute selection in the context of software quality estimation. A comparative investigation is presented for evaluating our proposed hybrid attribute selection approach, in which feature ranking is first used to reduce the search space, followed by a feature subset selection. A total of seven different feature ranking techniques are evaluated, while four different feature subset selection approaches are considered. The models are trained using five commonly used classification algorithms. The case study is based on software metrics and defect data collected from multiple releases of a large real-world software system. The results demonstrate that while some feature ranking techniques performed similarly, the automatic hybrid search algorithm performed the best among the feature subset selection methods. Moreover, performances of the defect prediction models either improved or remained unchanged when over 85were eliminated. Copyright 2011 John Wiley & Sons, Ltd.

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

defect prediction
attribute selection
feature ranking
feature subset selection
software quality

software metric
search-based software engineering


On Information Rates of the Fading Wyner Cellular Model via the Thouless Formula for the Strip In this paper, we apply the theory of random Schrodinger operators to the analysis of multiusers communication channels similar to the Wyner model, which are characterized by short-range intercell interference. With H the channel transfer matrix, H H(dagger) is a narrow band matrix, a fact that does not permit the use of classical random matrices theory. On the other hand, H H(dagger) is in many aspects similar to a random Schrodinger operator. We relate the per-cell sum-rate capacity of the channel to the integrated density of states of a random Schrodinger operator; the latter is then related to the top Lyapunov exponent of a random sequence of matrices via a version of the Thouless formula. We also derive several bounds on the limiting per-cell sum-rate capacity, some based on the theory of random Schrodinger operators, and some derived from information theoretical considerations. Finally, we get explicit results in the high-signal-to-noise ratio (SNR) regime for some particular cases.

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

high-signal-to-noise ratio (snr) characterization


Diatomics-in-molecules potentials incorporating ab initio data: Application to ionic, Rydberg-excited, and molecule-doped rare gas clusters Applications of combined diatomics-in-molecules/ab initio approaches to Ne-n(+), Ar-n*, ArnCl2, and ArnNO clusters are discussed. Simple perturbative models within these procedures are suggested to interpret the predicted cluster structures, obtained using a basin-hopping global optimization algorithm. The topological peculiarities of the Ar-NO potential are analyzed in terms of the perturbation of the Ar-N and Ar-O interactions within the complex. The correlation between the solvation of a chromophore species in the cluster and the relative strength of the solvent-solvent and chromophore-solvent interactions is also analyzed. (C) 2002 Elsevier Science B.V. All rights reserved.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 model based on cellular automata for the parallel simulation of 3D unsaturated flow Cellular automata (CA) are discrete dynamic systems that are used for modeling many physical systems. They are often used as an alternative to model and solve large-scale systems where the use of partial differential equations involve complex and computationally expensive simulations. The purpose of this work is to investigate the use of CA based techniques for modeling and parallel simulation of water flux in unsaturated soils. Unsaturated flow processes are an important topic in several branches of hydrology, soil science and agricultural engineering dealing with soilatmosphere interaction, subsurface flow and transport processes. In this paper a CA model for 3D unsaturated flow simulation is proposed using an extension of the original computational paradigm of cellular automata. This model, aimed at simulating large-scale systems, uses a macroscopic CA approach where local laws with a clear physical meaning govern interactions among automata. Its correctness is proved by CAMELot system, which allows the specification, parallel simulation, visualization, steering and analysis of CA models in the same environment, using a friendly interface and providing at the same time considerable flexibility. The model has been validated with reference multidimensional solutions taken from benchmarks in literature, showing a good agreement, even in the cases where non-linearity was very marked. Furthermore, using some of these benchmarks we present a scalability analysis of the model and different quantization techniques aimed at reducing the number of messages exchanged and the execution time when simulations are characterized by scarce mass interactions.

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

cellular automata
quantization techniques

unsaturated flow modeling
parallel simulation environments
performance model


Comparative experiment with colour texture classifiers using the CCR feature space An approach to grey level texture analysis is extended to colour images. Three colour texture classifiers using the CCR feature space are proposed. Textural information is derived from luminance plane by means of coordinated clusters transform along with chrominance features treated separately. The classifiers differ, basically, in the use of RGB and YIQ colour spaces. The main objective of this work is to evaluate the performance of classifiers quantitatively by means of comparative experiment on a set of VisTex and OuTex colour images. The experimental results indicate that the new classifiers are fast and at least as efficient as other texture analysis techniques evaluated on the same set of images.

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

colour texture classification
coordinated clusters representation
performance evaluation
vistex and outex database


CHuMI viewer: Compressive huge mesh interactive viewer The preprocessing of large meshes to provide and optimize interactive visualization implies a complete reorganization that often introduces significant data growth. This is detrimental to storage and network transmission, but in the near future could also affect the efficiency of the visualization process itself, because of the increasing gap between computing times and external access times. In this article, we attempt to reconcile lossless compression and visualization by proposing a data structure that radically reduces the size of the object while supporting a fast interactive navigation based on a viewing distance criterion. In addition to this double capability, this method works out-of-core and can handle meshes containing several hundred million vertices. Furthermore, it presents the advantage of dealing with any n-dimensional simplicial complex, including triangle soups or volumetric meshes, and provides a significant rate-distortion improvement. The performance attained is near state-of-the-art in terms of the compression ratio as well as the visualization frame rates, offering a unique combination that can be useful in numerous applications.

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

lossless compression
interactive visualization
large meshes


ARMA-cepstrum recursion algorithm for the estimation of the MA parameters of 2-D ARMA models This paper considers the problem of estimating the moving average (MA) parameters of a two-dimensional autoregressive moving average (2-D ARMA) model. To solve this problem, a new algorithm that is based on a recursion relating the ARMA parameters and cepstral coefficients of a 2-D ARMA process is proposed. On the basis of this recursion, a recursive equation is derived to estimate the MA parameters from the cepstral coefficients and the autoregressive (AR) parameters of a 2-D ARMA process. The cepstral coefficients are computed benefiting from the 2-D FFT technique. Estimation of the AR parameters is performed by the 2-D modified Yule-Walker (MYW) equation approach. The development presented here includes the formulation for real-valued homogeneous quarter-plane (QP) 2-D ARMA random fields, where data are propagated using only the past values. The proposed algorithm is computationally efficient especially for the higher-order 2-D ARMA models, and has the advantage that it does not require any matrix inversion for the calculation of the MA parameters. The performance of the new algorithm is illustrated by some numerical examples, and is compared with another existing 2-D MA parameter estimation procedure, according to three performance criteria. As a result of these comparisons, it is observed that the MA parameters and the 2-D ARMA power spectra estimated by using the proposed algorithm are converged to the original ones.

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

2-d arma model
quarter-plane region of support
real cepstrum
2-d ma parameter estimation
real-valued homogeneous random fields


an empirical comparison of dynamic impact analysis algorithms Impact analysis determining the potential effects ofchanges on a software system plays an important rolein software engineering tasks such as maintenance, regressiontesting, and debugging. In previous work, two new dynamicimpact analysis techniques, CoverageImpact andPathImpact, were presented. These techniques performimpact analysis based on data gathered about program behaviorrelative to specific inputs, such as inputs gatheredfrom field data, operational profile data, or test-suite executions.Due to various characteristics of the algorithms theyemploy, CoverageImpactand PathImpactare expectedto differ in terms of cost and precision; however, there havebeen no studies to date examining the extent to which suchdifferences may emerge in practice. Since cost-precisiontradeoffs may play an important role in technique selectionand further research, we wished to examine these tradeoffs.We therefore designed and performed an empirical study,comparing the execution and space costs of the techniques,as well as the precisions of the impact analysis results thatthey report. This paper presents the results of this study.

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

role software play research space analysis dynamic maintenance data paper cost debugging

empirical studies
systems
test
algorithm
profiles
practical
comparisons
effect
software engineering
impact analysis


Image retrieval based on micro-level spatial structure features and content analysis using Full Range Gaussian Markov Random Field model ? This paper proposes a novel system, based on Full Range Gaussian Markov Random Field (FRGMRF) model with Bayesian approach for image retrieval. The color image is segmented into various regions according to its structure and nature. The segmented image is modeled to HSV color space, where V attributes to pixel values, and it ranges from 0 to 1. On HSV color space, the texture information and spatial orientation of the pixels are extracted. On each region, the model parameters, autocorrelation coefficient (ACC), and unique texture numbers are computed using the FRGMRF model. The model parameters and ACCs are formed as feature vectors (FVs) of the image. The Mahalanobis distance is applied to measure the distance between the query and target images. Moreover, associated probabilities are computed on the texture numbers on each region, and are used to compute the divergence between the query and target images using cosine function. The obtained results are compared to those of the existing systems. The comparative study reveals that the proposed system outperforms the existing systems.

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

texture number
feature vector
spatial features


Semantic relation based personalized ranking approach for engineering document retrieval Since engineering design is heavily informational, engineers want to retrieve existing engineering documents accurately during the product development process. However, engineers have difficulties searching for documents because of low retrieval accuracy. One of the reasons for this is the limitation of existing document ranking approaches, in which relationships between terms in documents are not considered to assess the relevance of the retrieved documents. Therefore, we propose a new ranking approach that provides more correct evaluation of document relevance to a given query. Our approach exploits domain ontology to consider relationships among terms in the relevance scoring process. Based on domain ontology, the semantics of a document are represented by a graph (called Document Semantic Network) and, then, proposed relation-based weighting schemes are used to evaluate the graph to calculate the document relevance score. In our ranking approach, user interests and searching intent are also considered in order to provide personalized services. The experimental results show that the proposed approach outperforms existing ranking approaches. A precisely represented semantics of a document as a graph and multiple relation-based weighting schemes are important factors underlying the notable improvement.

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

ranking
domain ontology
engineering document


On the choice of test for a unit root when the errors are conditionally heteroskedastic ? It is well known that in the context of the classical regression model with heteroskedastic errors, while ordinary least squares (OLS) is not efficient, the weighted least squares (WLS) and quasi-maximum likelihood (QML) estimators that utilize the information contained in the heteroskedasticity are. In the context of unit root testing with conditional heteroskedasticity, while intuition suggests that a similar result should apply, the relative performance of the tests associated with the OLS, WLS and QML estimators is not well understood. In particular, while QML has been shown to be able to generate more powerful tests than OLS, not much is known regarding the relative performance of the WLS-based test. By providing an in-depth comparison of the tests, the current paper fills this gap in the literature.

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


a complex biological database querying method Many biological information systems rely on relational database management systems (RDBMS) to manage high-throughput biological data. While keeping these data well archived, organized, and integrated in a common repository is still a challenging task, performing complex queries, i.e., explorative and abstract ad hoc user questions in biology, is an even formidable task often substituted by writing complicated software programs. In this work, we propose a "complex query modeling" method to address the challenge of complex querying in biological domains. Query modeling consists of four distinct but interdependent phases of activities: representation of high-level problems, transformation of problems into connected query interfaces, designing database query structures, and translating query plans into high-performing SQL statements. At each stage, we use different notations and query modeling practices. Using gene indexing project as a case study, we show that query modeling enables prototypical development of high-quality SQL solutions to an inherently abstract and vague user query question, which requires GeneChip designers to sift through millions of database records, process data in dozens of steps, and make myriads of intermediate decisions. We believe our "complex query modeling" method is applicable to other bioinformatics domains with needs for complex database queries.

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


On spurious behavior of CFD simulations Spurious behavior in underresolved grids and/or semi-implicit temporal discretizations for four computational fluid dynamics (CFD) simulations are studied. The numerical simulations consist of (a) a 1-D chemically relaxed non-equilibrium flow model, (b) the direct numerical simulation (DNS) of 2D incompressible flow over a backward facing step, (c) a loosely coupled approach for a 2D fluid-structure interaction, and (d) a 3D unsteady compressible flow simulation of vortex breakdown on delta wings. These examples were chosen based on their non-apparent spurious behaviors that were difficult to detect without extensive grid and/or temporal refinement studies and without some knowledge from dynamical systems theory. Studies revealed the various possible dangers of misinterpreting numerical simulation of realistic complex flows that are constrained by available computing power. In large scale computations, underresolved grids, semi-implicit procedures, loosely coupled implicit procedures, and insufficiently long-time integration in DNS are most often unavoidable. Consequently, care must be taken in both computation and in interpretation of the numerical data. The results presented confirm the important role that dynamical systems theory can play in the understanding of the non-linear behavior of numerical algorithms and in aiding the identification of the sources of numerical uncertainties in CFD. Copyright (C) 1999 John Wiley & Sons, Ltd.

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

computational fluid dynamics
numerical simulation
spurious behavior


Evaluating the performance of geographical locations within scientific networks using an aggregationrandomizationre-sampling approach (ARR) Knowledge creation and dissemination in science and technology systems are perceived as prerequisites for socioeconomic development. The efficiency of creating new knowledge is considered to have a geographical component, that is, some regions are more capable in terms of scientific knowledge production than others. This article presents a method of using a network representation of scientific interaction to assess the relative efficiency of regions with diverse boundaries in channeling knowledge through a science system. In a first step, a weighted aggregate of the betweenness centrality is produced from empirical data (aggregation). The subsequent randomization of this empirical network produces the necessary null model for significance testing and normalization (randomization). This step is repeated to provide greater confidence about the results (re-sampling). The results are robust estimates for the relative regional efficiency of brokering knowledge, which is discussed along with cross-sectional and longitudinal empirical examples. The network representation acts as a straightforward metaphor of conceptual ideas from economic geography and neighboring disciplines. However, the procedure is not limited to centrality measures, nor is it limited to geographical aggregates. Therefore, it offers a wide range of applications for scientometrics and beyond.

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


An adaptive sizing BFGS method for unconstrained optimization In this paper, an adaptive sizing BFGS method for unconstrained optimization is proposed, whose scaling factor is automatically chosen by the signature of some terms of the approximate models curvature. The scaling factor is always chosen less than or equal to one as required by the convergence property of the self-scaling BFGS method of Al-Baali (Comput Optim Appl 9:191203, 1998), while the choosing strategy can ensure the sufficient positive definiteness of the updating matrices. Under mild conditions, the global convergence properties of Al-Baali on convex functions are proved. Numerical results on some test problems show the proposed method is competitive with its counterparts provided that the scaling factor is not too small.

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

unconstrained optimization
sizing bfgs method


An approach for constructing parsimonious generalized Gaussian kernel regression models The paper proposes a novel construction algorithm for generalized Gaussian kernel regression models. Each kernel regressor in the generalized Gaussian kernel regression model has an individual diagonal covariance matrix, which is determined by maximizing the correlation between the training data and the regressor using a repeated guided random search based on boosting optimization. The standard orthogonal least squares algorithm is then used to select a sparse generalized kernel regression model from the resulting full regression matrix. Experimental results involving two real data sets demonstrate the effectiveness of the proposed regression modeling approach.

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

regression
orthogonal least squares
correlation
boosting


Integrated production scheduling and distribution planning in dairy supply chain by hybrid modelling In this paper we address the production scheduling and distribution planning problem in a yoghurt production line of the multi-product dairy plants. A mixed integer linear programming model is developed for the considered problem. The objective function aims to maximize the benefit by considering the shelf life dependent pricing component and costs such as processing, setup, storage, overtime, backlogging, and transportation costs. Key features of the model include sequence dependent setup times, minimum and maximum lot sizes, overtime, shelf life requirements, machine speeds, dedicated production lines, typically arising in the dairy industry. The model obtains the optimal production plan for each product type, on each production line, in each period together with the delivery plan.

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

production and distribution planning
milp
hybrid approach


A spill code minimization technique - Application in the Metrowerks StarCore C compiler Graph coloring algorithms have been shown to be an efficient and effective means of performing register allocation. The power of these algorithms lies in their strong coloring heuristics and their ability to abstract away disparate allocation problems such as data-flow constraints, conforming to calling conventions, and target machine restrictions. However, even optimal algorithms cannot color every graph, and often some live ranges must be spilled to memory to make room for others. In this paper, we present a new approach of reducing spill code, which can be used to complement virtually any register allocation algorithm, and provides a good support to implement cheaper spill methods like spilling to another register (from a different class) and rematerialization (reloading the register from a constant or expression). This algorithm was partially implemented into the Metrowerks StarCore C compiler where it has proven its efficiency in terms of both cycle count and code size.

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

register allocation
spill code
rematerialization


An adaptive manipulator controller based on force and parameter estimation Consideration of manipulator dynamics and external disturbances in robot control system design can enhance the stability and performance properties of the whole system. In this paper, we present an approach to solve the control problem when the inertia parameters of robot are unknown, and at the same time robot is subjected to external force disturbances. This approach is based on simultaneous estimation of force signal and inertia parameters and utilizing them in the control law. The update laws and the control law are derived based on a single time-varying Lyapunov function, so that the global convergence of the tracking error is ensured. A theorem with a detailed proof is presented to guarantee the global uniform asymptotic stability of the whole system. Some simulations are made for a number of external forces to illustrate the effectiveness of the proposed approach.

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

adaptive control
force estimation
disturbonce rejection
non-autonomous systems
uniform stability
invariant set


minimizing energy consumption for high-performance processing Power consumption is becoming an increasingly important constraint in the design of microprocessors. This paper examines the use of multiple constrained processors running at lowered voltage and frequency to perform a similar amount of work in less time and lower power than a uniprocessor. The paper also studies the effect of reducing cache and Branch Target Buffer (BTB) sizes for further reducing power consumption while still providing adequate performance. The best configuration requiring four processors reduced energy by 56\%. Reducing cache and BTB provided a further 16\\% savings in energy while still finishing the workload in the same amount of time as the uniprocessor.

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

cache
use
power consumption
energy consumption
workload
performance
design
energy
power
paper
constraint
effect

processor
voltage reduction
btb size
frequency reduction
mpeg-2
high-performance
configurability
parallel processing
process
timing
energy savings
cache size
buffers
low power


Ant colony optimization for image regularization based on a nonstationary Markov modeling Ant colony optimization (ACO) has been proposed as a promising tool for regularization in image classification. The algorithm is applied here in a different way than the classical transposition of the graph color affectation problem. The ants collect information through the image, from one pixel to the others. The choice of the path is a function of the pixel label, favoring paths within the same image segment. We show that this corresponds to an automatic adaptation of the neighborhood to the segment form, and that it outperforms the fixed-form neighborhood used in classical Markov random field regularization techniques. The performance of this new approach is illustrated on a simulated image and on actual remote sensing images.

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


EQUILOAD: a load balancing policy for clustered web servers We present a new strategy for the allocation of requests in clustered web servers, based on the size distribution of the requested documents. This strategy, EQUILOAD, manages to achieve a balanced load to each of the back-end servers, and its parameters are obtained from the analysis of a trace's past data. To study its performance, we use phase-type distribution fittings and solve the resulting models using a new solution method for M/PH/1 queues that only requires solution of linear systems. The results show that EQUILOAD greatly outperforms random allocation, performs comparably or better than the Shortest Remaining Processing Time and Join Shortest Queue policies and maximizes cache hits at the back-end servers, therefore behaving similarly to a "locality-aware" allocation policy, but at a very low implementation cost. (C) 2001 Elsevier Science B.V. All rights reserved.

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

web server
workload allocation
queue policy


Random coverage with guaranteed connectivity: Joint scheduling for wireless sensor networks Sensor scheduling plays a critical role for energy efficiency of wireless sensor networks. Traditional methods for sensor scheduling use either sensing coverage or network connectivity, but rarely both. In this paper, we deal with a challenging task: Without accurate location information, how do we schedule sensor nodes to save energy and meet both constraints of sensing coverage and network connectivity? Our approach utilizes an integrated method that provides statistical sensing coverage and guaranteed network connectivity. We use random scheduling for sensing coverage and then turn on extra sensor nodes, if necessary, for network connectivity. Our method is totally distributed, is able to dynamically adjust sensing coverage with guaranteed network connectivity, and is resilient to time asynchrony. We present analytical results to disclose the relationship among node density, scheduling parameters, coverage quality, detection probability, and detection delay. Analytical and simulation results demonstrate the effectiveness of our joint scheduling method.

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

scheduling algorithms
performance analysis


Binary trees with the largest number of subtrees ? This paper characterizes binary trees with n leaves, which have the greatest number of subtrees. These binary trees coincide with those which were shown by Fischermann et al. [Wiener index versus maximum degree in trees, Discrete Appl. Math. 122(13) (2002) 127137] and Jelen and Triesch [Superdominance order and distance of trees with bounded maximum degree, Discrete Appl. Math. 125 (23) (2003) 225233] to minimize the Wiener index.

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


Load shuffling algorithms for split-platform AS/RS Although automated storage/retrieval Systems (AS/RS) allow random access to any storage cells, often it is advantageous to pre-sort the loads to minimize the retrieval time. In this paper, we address the issue of load shuffling on a new type of AS/RS (i.e., the split-platform AS/RS), which have separate and independent mechanisms for horizontal and vertical movements. We present the shuffling algorithms for such AS/RS, and analyze the required shuffling time and retrieval time. Results from these analysis and numerical experiments show that the shuffling algorithms presented are indeed quite efficient.

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


On the specification of modal systems: A comparison of three frameworks This paper studies the relationships between three notions of behavioural preorder that have been proposed in the literature: refinement over modal transition systems, and the covariant-contravariant simulation and the partial bisimulation preorders over labelled transition systems. It is shown that there are mutual translations between modal transition systems and labelled transition systems that preserve, and reflect, refinement and the covariant-contravariant simulation preorder. The translations are also shown to preserve the modal properties that can be expressed in the logics that characterize those preorders. A translation from labelled transition systems modulo the partial bisimulation preorder into the same model modulo the covariant-contravariant simulation preorder is also offered, together with some evidence that the former model is less expressive than the latter. In order to gain more insight into the relationships between modal transition systems modulo refinement and labelled transition systems modulo the covariant-contravariant simulation preorder, their connections are also phrased and studied in the context of institutions. (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 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 B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O 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

modal transition systems
partial bisimulation

simulation semantics
modal refinement
covariant-contravariant simulation


A posteriori error estimates for finite volume approximations of elliptic equations on general surfaces In this paper, we present a residual-based a posteriori error estimate for the finite volume discretization of steady convectiondiffusionreaction equations defined on surfaces in R3 R 3 , which are often implicitly represented as level sets of smooth functions. Reliability and efficiency of the proposed a posteriori error estimator are rigorously proved. Numerical experiments are also conducted to verify the theoretical results and demonstrate the robustness of the error estimator.

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

finite volume approximation
pdes on surfaces


Doubly periodic traveling waves in cellular neural networks with polynomial reactions In a study (Szekely, 1965) [1] of the locomotion of salamanders, it is observed that a doubly periodic traveling wave solution of a logical neural network can be used to explain a dynamic pattern of movements. We show here that nonlinear and nonlogical artificial neural network can also be built by means of reaction diffusion principles and existence or nonexistence of doubly periodic traveling waves can be guaranteed by adjusting parameters built into these networks. Our derivations for existence are based on implicit function theorems and the invariance properties of our model; while nonexistence is based on boundedness properties of the polynomial reaction term. We also give illustrative examples as well as comments on the differences between present results with those obtained for linear models studied earlier in Cheng and Lin (2009) [2]and[3].

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

cellular neural network
implicit function theorem
reactiondiffusion principle


A Nystrm method for weakly singular integral operators on surfaces We describe a modified Nystrm method for the discretization of the weakly singular boundary integral operators which arise from the formulation of linear elliptic boundary value problems as integral equations. Standard Nystrm and collocation schemes proceed by representing functions via their values at a collection of quadrature nodes. Our method uses appropriately scaled function values in lieu of such representations. This results in a scheme which is mathematically equivalent to Galerkin discretization in that the resulting matrices are related to those obtained by Galerkin methods via conjugation with well-conditioned matrices, but which avoids the evaluation of double integrals. Moreover, we incorporate a new mechanism for approximating the singular integrals which arise from the discretization of weakly singular integral operators which is considerably more efficient than standard methods. We illustrate the performance of our method with numerical experiments.

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

integral operators
elliptic boundary value problems


An overlapping mortar element approach to coupled magneto-mechanical problems This paper presents a finite element approach with moving non-matching overlapping grids to solve coupled magneto-mechanical problems. As an example of application, we consider the team workshop problem 28 for an electrodynamic levitation device. The connection between the background mesh including the two exciting coils and the foreground mesh of the conducting plate is established by using a stable projection operator onto the plate boundary. The aim is to determine the dynamic characteristics of the levitating plate: to this end, a coupled solution of the electromagnetic and mechanical problem is necessary. (C) 2009 IMACS. Published by Elsevier B.V. All rights reserved.

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

nested domains
mortar finite elements
axisymmetric geometries


evaluating cues for resuming interrupted programming tasks Developers, like all modern knowledge workers, are frequently interrupted and blocked in their tasks. In this paper we present a contextual inquiry into developers' current strategies for resuming interrupted tasks and investigate the effect of automated cues on improving task resumption. We surveyed 371 programmers on the nature of their tasks, interruptions, task suspension and resumption strategies and found that they rely heavily on note-taking across several types of media. We then ran a controlled lab study to compare the effects of two different automated cues to note taking when resuming interrupted programming tasks. The two cues differed in (1) whether activities were summarized in aggregate or presented chronologically and (2) whether activities were presented as program symbols or as code snippets. Both cues performed well: developers using either cue completed their tasks with twice the success rate as those using note-taking alone. Despite the similar performance of the cues, developers strongly preferred the cue that presents activities chronologically as code snippets.

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


Unbounded solutions in asymmetric oscillations In this paper, the existence of unbounded solutions for the following nonlinear asymmetric oscillator: x" + alphax(+) - betax(-) = f(t) is discussed, where alpha,beta are positive constants satisfying 1/rootalpha + 1/rootbeta = 2/omega, for some omega is an element of R+/Q, f(t) is 2pi-periodic and bounded, x(+/-) = max{+/-x,0}. (C) 2004 Elsevier Ltd. All rights reserved.

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

unbounded solutions
asymmetric oscillator


Concurrent zero-knowledge Concurrent executions of a zero-knowledge protocol by a single prover (with one or more verifiers) may leak information and may not be zero-knowledge in toto. In this article, we study the problem of maintaining zero-knowledge We introduce the notion of an (alpha, beta) timing constraint: for any two processors P(1) and P(2), if P(1) measures alpha elapsed time on its local clock and P(2) measures elapsed time on its local clock, and P(2) starts after P(1) does, then P(2) will finish after P(1) does. We show that if the adversary is constrained by an (alpha, beta) assumption then there exist four-round almost concurrent zero-knowledge interactive proofs and perfect concurrent zero-knowledge arguments for every language in NP. We also address the more specific problem of Deniable Authentication, for which we propose several particularly efficient solutions. Deniable Authentication is of independent interest, even in the sequential case; our concurrent solutions yield sequential solutions without recourse to timing, that is, in the standard model.

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

algorithms
security
theory
zero knowledge
cryptographic protocols
composition


Situational influences on ethical decision-making in an IT context Processes of ethical decision-making are thought to depend on the issue faced when making the decision. We examined the processes by examining student's reactions to five scenarios involving IT use. Data were collected using a questionnaire following a group discussion. The results showed that ethical decision-making processes did indeed vary by scenario, suggesting that a single-issue approach is inadequate for studying ethical decision-making. Perceived importance of the ethical issue was a factor in the scenarios, but it did not have an all-inclusive influence on the decision-making of the participants. The results were considered in the context of theories and Mason's ethical issues of the information age. We offer advice to managers on how to limit unethical behavior.

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

it ethics
ethical decision-making
ethical behavior
four-component model
moral intensity


An improved method to predict the entropy term with the MM/PBSA approach A method is suggested to calculate improved entropies within the MM/PBSA approach (molecular mechanics combined with Poisson-Boltzmann and surface area calculations) to estimate protein-ligand binding affinities. In the conventional approach, the protein is truncated outside similar to 8 A... from the ligand. This system is freely minimised using a distance-dependent dielectric constant (to simulate the removed protein and solvent). However, this can lead to extensive changes in the molecular geometry, giving rise to a large standard deviation in this term. In our new approach, we introduce a buffer region similar to 4 A... outside the truncated protein (including solvent molecules) and keep it fixed during the minimisation. Thereby, we reduce the standard deviation by a factor of 2-4, ensuring that the entropy term no longer limits the precision of the MM/PBSA predictions. The new method is tested for the binding of seven biotin analogues to avidin, eight amidinobenzyl-indole-carboxamide inhibitors to factor Xa, and two substrates to cytochrome P450 3A4 and 2C9. It is shown that it gives more stable results and often improved predictions of the relative binding affinities.

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

entropy
avidin
factor xa
cytochrome p450


Algebraic Structures of B-series B-series are a fundamental tool in practical and theoretical aspects of numerical integrators for ordinary differential equations. A composition law for B-series permits an elegant derivation of order conditions, and a substitution law gives much insight into modified differential equations of backward error analysis. These two laws give rise to algebraic structures (groups and Hopf algebras of trees) that have recently received much attention also in the non-numerical literature. This article emphasizes these algebraic structures and presents interesting relationships among them.

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

b-series
rooted trees
butcher group
hopf algebra of trees
coproduct
antipode
p-series
s-series


Sifting out the mud: Low level C++ code reuse More and more computers are being incorporated in devices where the available amount of memory is limited. This contrasts with the increasing need for additional functionality and the need for rapid application development. While object-oriented programming languages, providing mechanisms such as inheritance and templates, allow fast development of complex applications, they have a detrimental effect on program size. This paper introduces new techniques to reuse the code of whole procedures at the binary level and a supporting technique for data reuse. These techniques benefit specifically from program properties originating from the use of templates and inheritance. Together with our previous work on code abstraction at lower levels of granularity, they achieve additional code size reductions of up to 38% on already highly optimized and compacted binaries, without sacrificing execution speed. We have incorporated these techniques in SQUEEZE++, a prototype link-time binary rewriter for the Alpha architecture, and extensively evaluate them on a suite of 8 real-life C++ applications. The total code size reductions achieved post link-time (i.e. without requiring any change to the compiler) range from 27 to 70%, averaging at around 43%.

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

experimentation
performance
code compaction
code size reduction


Realizing joined-up government Dynamic capabilities and stage models for transformation Joining up remains a high priority on the e-government agenda and requires extensive transformation. Stage models are predictable patterns which exist in the growth of organizations and unfold as discrete time periods that result in discontinuity and can help e-government development towards joined-up government. Although stage models may be conceptually appealing, these models are often not empirically validated, do not transcend the level of individual organizations, and provide little practical support to policymakers. Furthermore, they do not include the dynamic capabilities needed by organizations to transform from one stage to the next stage. In this paper, a five-stage model is presented that describes the progression from stove-piped situations towards a nationwide, customer-oriented, and joined-up government. The dynamic capabilities needed for realizing each stage are identified. This model is empirically validated and helps government agencies benchmark their position, realize their role in the formation of a joined-up government, develop the necessary capabilities, and adopt centrally developed infrastructural facilities aimed at moving to the next stage. We found that growth stages are useful for providing guidance and can be used by policymakers to stimulate the developments of capabilities needed by organizations to migrate from one stage to another.

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

stage models
dynamic capabilities
transformation

joined-up government
service provisioning
coordination


Agent-Based Modeling and Analysis of Socio-Technical Systems Socio-technical systems are characterized by high structural and behavioral complexities, which impede understanding and modeling of such systems. In particular, reciprocal relations between diverse local system processes that determine global system dynamics are not well understood. In this article we focus on the problem of establishing relations between cognitive processes that determine the social dynamics of an actor in a socio-technical system. To address this problem, a formal, integrated, agent-based modeling approach is proposed. The approach provides rich analysis possibilities of qualitative and quantitative properties, specified at local (agent) and global (system) levels. An application of the approach in the context of a subway evacuation case is described in the article.

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

decision making
emotions
formal agent-based modelling
trust


Classifying cervix tissue patterns with texture analysis This paper presents a generalized statistical texture analysis technique for characterizing and recognizing typical, diagnostically most important, vascular patterns relating to cervical lesions from colposcopic images. The major contributions of this research include the development of a novel generalized statistical texture analysis approach for accurately characterizing cervical textures and the introduction of a set of textural features that capture the specific characteristics of cervical textures as perceived by human. Experimental study demonstrated the feasibility and promising of the proposed approach in discriminating between cervical texture patterns indicative of different stages of cervical lesions.

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

cervix lesion classification
pattern recognition


Construction of Reversible Cellular Automata by Amalgamations and Permutations of States This paper explains the properties of amalgamations and permutations of states in the matrix representation of reversible one-dimensional cellular automata where both evolution rules have neighborhood sire 2 and a Welch index equal to 1. These properties are later used for constructing reversible automata and defining a compact nomenclature to identify them. Some examples are provided.

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

reversibility
definiteness
welch indexes


Modelling of the multiaxial elasto-plastic behaviour of porous metals with internal gas pressure The gas pressure built up within closed cells of porous or cellular metals influences the macroscopic behaviour during deformation. Another important process affected by internal pore pressure is the roll forming of structurally porous metals. During pressing and thermo-mechanical forming, the internal pressure of the pores and the temperature can rise to high levels. In this paper, the influence of the internal gas pressure on the mechanical behaviour of porous metals under different loading conditions is numerically investigated by the finite element method. It has been found that the internal gas pressure significantly influences the initial yielding as well as the macroscopic behaviour if the pressure is clearly less than a half of the yield strength of the base material. This can be found in scientific literature as a limit for a significant influence.

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

internal gas pressure
finite element method

porous material
cellular material
unit-cell model
plasticity


Base and salt 3D forms of Emeraldine II polymers by Car-Parrinello molecular dynamics We have studied structural and electronic properties of the three-dimensional crystalline regions of Emeraldine II polymers, in the base (EB-II) and salt (ES-II) forms, by means of first principle Car-Parrinello molecular dynamics. We compare the geometrical structures of the polymer chains in the primitive cells of EB-II and ES-II, pointing out the structural effects due to the protonation with HCl of the iminic nitrogens in the EB-II chains, and the effect of the counterions between neighboring chains. We also analyze the HOMO electron density distribution, band structure and density of states of the resulting bipolaronic structure of ES-II, which is energetically stable and maintains semiconductor character. (c) 2005 Elsevier B.V. All rights reserved.

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


A novel approach for detection and classification of mammographic microcalcifications using wavelet analysis and extreme learning machine The objective of this paper is to reveal the effectiveness of wavelet based tissue texture analysis for microcalcification detection in digitized mammograms using Extreme Learning Machine (ELM). Microcalcifications are tiny deposits of calcium in the breast tissue which are potential indicators for early detection of breast cancer. The dense nature of the breast tissue and the poor contrast of the mammogram image prohibit the effectiveness in identifying microcalcifications. Hence, a new approach to discriminate the microcalcifications from the normal tissue is done using wavelet features and is compared with different feature vectors extracted using Gray Level Spatial Dependence Matrix (GLSDM) and Gabor filter based techniques. A total of 120 Region of Interests (ROIs) extracted from 55 mammogram images of mini-Mias database, including normal and microcalcification images are used in the current research. The network is trained with the above mentioned features and the results denote that ELM produces relatively better classification accuracy (94%) with a significant reduction in training time than the other artificial neural networks like Bayesnet classifier, Naivebayes classifier, and Support Vector Machine. ELM also avoids problems like local minima, improper learning rate, and over fitting.

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

extreme learning machine
microcalcification
glsdm
gabor filter
wavelet


the trec-like evaluation of music ir systems This poster reports upon the ongoing efforts being made to establish TREC-like and other comprehensive evaluation paradigms within the Music IR (MIR) and Music Digital Library (MDL) research communities. The proposed research tasks are based upon expert opinion garnered from members of the Information Retrieval (IR), MDL and MIR communities with regard to the construction and implementation of scientifically valid evaluation frameworks.

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


Performance analysis of hybrid disk array architectures to meet I/O requirements 1 Disk array is an I/O subsystem incorporating multiple disks to improve the I/O performance. This paper considers general architectural models of hybrid disk array systems which integrate asynchronous and synchronous architectures together. An I/O workload is generally characterized by average request size, average request rate, and mean response time requirement. In this paper, we propose an analytic performance model of hybrid disk array systems for a given I/O workload. With the help of the analytic model, we can determine the three important design parameters of a hybrid disk array system in order to meet the mean I/O response time requirement. These parameters include the minimum number of required disks, the degree of declustering, and the degree of synchronization. Our analytic model is verified by the simulation.

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

declustering
disk array
performance analysis
response time

asynchronous disk
disk striping
hybrid architecture
synchronous disk


The h-bubble Hypes occur in every domain of human behavior, including scientific research. We show in this contribution that journals and authors who studied the h-index benefited in terms of short-term citations. As, moreover, the introduction of the h-index is more a clever find than a first rate intellectual achievement, its rise can be compared to a stock market bubble.

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

information science journals and researchers


The optimal design of two interconnected (bio)chemical reactors revisited This paper deals with the steady-state optimal design of two interconnected Continuous Stirred Tank Biological or Chemical Reactors in which a single reaction occurs. In particular, three new qualitative consequences of results originally proposed by Harmand, Rapaport, and Trofino [Harmand, J., Rapaport, A., & Trofino, A. (2003). Optimal design of two interconnected bioreactors-Some new results. AIChEJournal, 49(6),1433-1450] and Harmand, J., Rapaport, A., and Drame [Harmand, J., Rapaport, A., & Drame, A. K. (2004). Optimal design of two interconnected enzymatic reactors. Journal of Process Control, 14(7),785-794] are presented. First, a unifying graph-based approach (originally adapted by Bischoff [Bischoff, K. B.(1966). Optimal continuous fermentation reactor design. The Canadian Journal of Chemical Engineering, 281-284] from a technique first proposed in the early 1960s by Aris [Aris, R. (1962). On optimal adiabatic reactors of combined types. Canadian Journal of Chemical Engineering, 40, 87-92] for the design of adiabatic reactors) for the optimal design of biological systems is proposed. This approach permits an easy interpretation of the concept of "Steady-State Equivalent Biological Systems" proposed in the above cited papers. Secondly, it is shown that a number of very different design optimization problems, other than those specifically treated in the literature, can be solved using the propositions introduced in these papers. In particular, it is shown that the "Steady-State Equivalent Biological Systems" concept can be extended to catalytic chemical processes, and conditions to optimally design both catalytic and autocatalytic systems in a unifying way are derived. Thirdly, an interesting corollary of the results enables us to show qualitatively that there exists an infinite number of ways for designing (not necessarily optimally) any single-rate biological process, depending on the way the process is configured in terms of input flow rate and recirculation loop. (c) 2005 Elsevier Ltd. All right reserved.

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

steady-state equivalent biological systems


Radiance interpolants for accelerated bounded-error ray tracing Ray tracers, which sample radiance, are usually regarded as offline rendering algorithms that are too slow for interactive use. In this article we present a system that exploits object-space, ray-space, image-space, and temporal coherence to accelerate ray tracing. Our system uses per-surface interpolants to approximate radiance while conservatively bounding error. The techniques introduced in this article should enhance both interactive and batch ray tracers. Our approach explicitly decouples the two primary operations of a ray tracer-shading and visibility determination-and accelerates each of them independently. Shading is accelerated by quadrilinearly interpolating lazily acquired radiance samples. Interpolation error does not exceed a user-specified bound, allowing the user to control performance/quality tradeoffs. Error is bounded by adaptive sampling at discontinuities and radiance nonlinearities. Visibility determination at pixels is accelerated by reprojecting interpolants as the user's viewpoint changes. A fast scan-line algorithm then achieves high performance without sacrificing image quality. For a smoothly varying viewpoint, the combination of lazy interpolants and reprojection substantially accelerates the ray tracer. Additionally, an efficient cache management algorithm keeps the memory footprint of the system small with negligible overhead.

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

data structures
error bounds
4d interpolation
interval arithmetic
radiance approximation
rendering systems


Adaptive variable structure controller of redundant robots with mobile/fixed obstacles avoidance Adaptive controller without knowledge of the dynamical model of the robot. The stability is proved theoretically using the Lyapunov principle. The controller is designed directly in the task space. No inversion of models is required. No collision with moving obstacles is possible.

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

adaptive control
reference model
variable structure system
mobile obstacle avoidance


Key establishment for layered group-based Wireless Sensor Networks Establishing pairwise keys for sensors is crucial to secure communications in Wireless Sensor Networks (WSNs). Several key pre-distribution schemes have been proposed to establish pairwise keys, but they are not scalable and suffer from a dramatic degradation of security when the number of compromised sensor exceeds a threshold. In this paper, we propose a Layered Group-based Key Establishment (LGKE) scheme, in which a logic top layer ensures the scalability through an Exclusion Basic System (EBS) technique while a logic low layer adopts a group-based key preload scheme to ensure the security. The security analysis and quantitative evaluation show the superiority of LGKE with regard to scalability, resilience, robustness and communication overhead.

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

wsns
wireless sensor networks
security
key establishment
scalability


Generics of a Higher Kind With Java 5 and C(#) 2.0, first-order parametric polymorphism was introduced in mainstream object-oriented programming languages under the name of generics. Although the first- order variant of generics is very useful, it also imposes some restrictions: it is possible to abstract over a type, but the resulting type constructor cannot be abstracted over. This can lead to code duplication. We removed this restriction in Scala, by allowing type constructors as type parameters and abstract type members. This paper presents the design and implementation of the resulting type constructor polymorphism. Furthermore, we study how this feature interacts with existing object-oriented constructs, and show how it makes the language more expressive.

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

design
languages
type constructor polymorphism
scala

experimentation
higher-kinded types
higher-order genericity