Bayesian characterization of uncertainty in intra-subject non-rigid registration In settings where high-level inferences are made based on registered image data, the registration uncertainty can contain important information. In this article, we propose a Bayesian non-rigid registration framework where conventional dissimilarity and regularization energies can be included in the likelihood and the prior distribution on deformations respectively through the use of Boltzmanns distribution. The posterior distribution is characterized using Markov Chain Monte Carlo (MCMC) methods with the effect of the Boltzmann temperature hyper-parameters marginalized under broad uninformative hyper-prior distributions. The MCMC chain permits estimation of the most likely deformation as well as the associated uncertainty. On synthetic examples, we demonstrate the ability of the method to identify the maximum a posteriori estimate and the associated posterior uncertainty, and demonstrate that the posterior distribution can be non-Gaussian. Additionally, results from registering clinical data acquired during neurosurgery for resection of brain tumor are provided; we compare the method to single transformation results from a deterministic optimizer and introduce methods that summarize the high-dimensional uncertainty. At the site of resection, the registration uncertainty increases and the marginal distribution on deformations is shown to be multi-modal.

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


Granule-oriented programming A program will become obsolete or less effective in solving domain problems due to many reasons. One of the main reasons can be the fact that the program does not fit its context. The context of a program is defined as a collection of functionalities that support the program to solve domain problems, e.g., runtime environmental supports, meta-strategies, architectural supports, etc. Unfitness phenomena exist in many software systems, which lead the systems prematurely end their life cycles, or decrease their performance and accuracy in solving problems. In existing programming systems, from the perspective of language expressivity, little attention has been paid to this unfitness problem. Granule-oriented programming is an evolutionary metaphor in which programs are ground into code granules in order to localize their unfitness parts as explicitly as possible, and then the code granules are compounded into the target program, in which a code granulation space, one to express program in a well-formed and multi-layered framework, is formed. In this paper, we propose and briefly describe the notion of granule-oriented programming.

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

languages
design
reflection
granule-oriented programming
program grinding
code granule
context distribution
object-oriented programming


performance evaluation of multi-guard channel schemes in broadband mobile networks In this paper, we proposed two Multi-Guard Channel Schemes (MGCS) for multi-threshold and multirate services. The purpose of MGCS is proposed to guarantee the quality of service for multimedia wireless cellular networks. Another contribution of this paper is to develop two generalized analytical models, two-dimensional Markov chain model, to investigate the performance of two proposed scheme and compared them with each other. The analytical results show that MGCS 2 achieves better results on the handoff dropping probability and new call blocking probability.

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

broadband mobile networks
multirate services

multi-guard channel
priority based cac schemes


measuring process flexibility and agility In their attempt to improve their systems and architectures, organizations need to be aware of the types of flexibility and agility and the current level of each type of flexibility and agility. Flexibility is the general ability to react to changes, whilst agility is the speed in responding to variety and changes Both flexibility and agility are diverse concepts that are hard to grasp. In this paper the types of flexibility and agility of business processes is discussed on a foundation level and an approach to measure the level of flexibility and agility is proposed. A case study of the flexibility and agility measurement is used to demonstrate the approach. The illustration is used to discuss the difficulties and limitations of the measurement approach. There is no uniform definition of or view on flexibility and agility. This makes it hard to develop a measurement approach. Furthermore, as business processes can be different, this might result in different metrics for measuring the level of flexibility and agility. There is no single measure and for each type of business process and flexibility and agility should always measure by a combination of metrics. In addition, both qualitative and quantitative metrics should be used to measure the level of flexibility and agility.

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


An alternative domain/boundary element technique for analyzing plates on two-parameter elastic foundations This paper presents an alternative domain/boundary element technique for analyzing plates on two-parameter elastic foundations, in which the fundamental solution for the linear plate theory is used in the formulation. The main advantages of using this technique are that the kernels of the boundary integral equations are conveniently established and can be used for solving plate problems with various boundary conditions as well as mixed boundary conditions. The surface integration of the kernels for the foundation pressure is evaluated using a numerical procedure presented herein instead of the conventional GaussLegendre method, resulting in the reduction of computing time. The application of higher-order elements, i.e. cubic elements, for improving the solution is adopted. Numerical results of several problems with various boundary conditions are given to demonstrate the accuracy and validity of the method.

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

boundary element method
two-parameter elastic foundations
domain integrals


Network utility maximization over partially observable Markovian channels We study throughput utility maximization in a multi-user network with partially observable Markovian channels. Here, instantaneous channel states are unavailable and all controls are based on partial channel information provided by ACK/NACK feedback from past transmissions. Equivalently, we formulate a restless multi-armed bandit problem in which we seek to maximize concave functions of the time average reward vector. Such problems are generally intractable and in our problem the set of all achievable throughput vectors is unknown. We use an achievable region approach by optimizing the utility functions over a non-trivial reduced throughput region, constructed by randomizing well-designed round robin policies. Using a new ratio MaxWeight rule, we design admission control and channel scheduling policies that stabilize the network with throughput utility that is near-optimal within the reduced throughput region. The ratio MaxWeight rule generalizes existing MaxWeight-type policies for the optimization of frame-based control systems with policy-dependent frame sizes. Our results are applicable to limited channel probing in wireless networks, dynamic spectrum access in cognitive radio networks, and target tracking of unmanned aerial vehicles.

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

markovian channels
cognitive radio
achievable region approach

lyapunov drift analysis
ratio max-weight policy
stochastic network optimization
restless multi-armed bandit
opportunistic spectrum access


Tailoring transport and dielectric properties by surface passivation of silicon nanowires with Polyacrylic acid/TiO2 nanoparticles composite Silicon nanowires (SiNWs) based composite devices were fabricated. Effect of surface capping on SiNWs was investigated. Transport and dielectric properties were observed. Space charge limited conduction is dominant conduction mechanism.

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

silicon nanowires
composite devices
dielectric properties


towards event detection in an audio-based sensor network In this paper, we describe an experiment where we gathered audio information from a series of conventional wired microphones installed in a typical university setting. We also obtained visual information from cameras located in the same area. We set out to see if audio analysis could be used to assist our existing visual event detection system, and to note any improvements. We were not concerned with identifying or classifying what was detected in the audio. Our aim was to keep audio processing to a minimum, as this would enable wireless sensor networks to be used in the future. We present the results of analysis of audio information based on the mean of the volume, the zero-crossing rate, and the frequency. We found that detecting events based on their volume returned satisfactory results.

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


The forest vegetation simulator: A review of its structure, content, and applications The Forest Vegetation Simulator (FVS) is a distance-independent, individual-tree forest growth model widely used in the United States to support management decisionmaking. Stands are the basic projection unit, but the spatial scope can be many thousands of stands. The temporal scope is several hundred years at a resolution of 510 years. Projections start with a summary of current conditions evident in the input inventory data. FVS contains a self-calibration feature that uses measured growth rates to modify predictions for local conditions. Component models predict the growth and mortality of individual trees, and extensions to the base model represent disturbance agents including insects, pathogens, and fire. The component models differ depending on the geographic region represented by regionally specific model variants. The differences are due to data availability and the applicability of existing models. The model supports specification of management rules in the input, such as thinning if density is too high. The rules can be extended to represent other factors. For example, the effect of climate change on stand development by entering rules that specify how growth and mortality will change in response to changing climate. Applications range from development of silvicultural prescription for single stands to landscape and large regional assessments. Key issues addressed with FVS include forest development, wildlife habitat, pest outbreaks, and fuels management. The predictions are used to gain insights into how forested environments will respond to alternative management actions. Broad-scale forest management policies have been studied with FVS. For the 30 years since the model was initially introduced, the development team has anticipated and provided needed enhancements and maintained a commitment to working with and training users. The existence of an adequate user interface and the continued use of the original programming language are often overlooked factors for the success of this model. Future work will focus on improving FVS by adopting recent biometric techniques and including new information linking geomorphology to mortality and growth. Extending the model to more closely represent biophysical processes and adapting the model so that it is more relevant to management questions related to predicted climate change are also foci. Providing ways to dynamically link FVS to other models is our current strategy for providing major new capabilities.

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

forest growth and yield
forest planning
forest succession
forest disturbances
decision support
prognosis model


Experimental study of intelligent controllers under uncertainty using type-1 and type-2 fuzzy logic Uncertainty is an inherent part in control systems used in real world applications. The use of new methods for handling incomplete information is of fundamental importance. Type-1 fuzzy sets used in conventional fuzzy systems cannot fully handle the uncertainties present in control systems. Type-2 fuzzy sets that are used in type-2 fuzzy systems can handle such uncertainties in a better way because they provide us with more parameters and more design degrees of freedom. This paper deals with the design of control systems using type-2 fuzzy logic for minimizing the effects of uncertainty produced by the instrumentation elements, environmental noise, etc. The experimental results are divided in two classes, in the first class, simulations of a feedback control system for a non-linear plant using type-1 and type-2 fuzzy logic controllers are presented; a comparative analysis of the systems response in both cases was performed, with and without the presence of uncertainty. For the second class, a non-linear identification problem for time-series prediction is presented. Based on the experimental results the conclusion is that the best results are obtained using type-2 fuzzy systems.

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

interval type-2 fuzzy sets
fuzzy control
type-2 fuzzy logic systems
system identification


Discovering models of behavior for concurrent workflows Understanding the dynamic behavior of a workflow is crucial for being able to modify, maintain, and improve it. A particularly difficult aspect of some behavior is concurrency. Automated techniques which seek to mine workflow data logs to discover information about the workflows must be able to handle the concurrency that manifests itself in the workflow executions. This paper presents techniques to discover patterns of concurrent behavior from traces of workflow events. The techniques are based on a probabilistic analysis of the event traces. Using metrics for the number, frequency, and regularity of event occurrences, a determination is made of the likely concurrent behavior being manifested by the system. Discovering this behavior can help a workflow designer better understand and improve the work processes they are managing. (C) 2003 Elsevier B.V. All rights reserved.

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

dynamic analysis
workflow data analysis
behavior inference
concurrency analysis
workflow model discovery


Toward cognitive support for OWL justifications ? Justifications are the dominant form of explanation for entailments of OWL ontologies, with popular OWL ontology editors, such as Protg 4, providing justification-based explanation facilities. A justification is a minimal subset of an ontology which is sufficient for an entailment to hold; they correspond to the premises of a proof. Unlike proofs, however, justifications do not articulate how their axioms support the entailment. We frequently observe that ontology developers find certain justifications difficult to work with; and while in some cases the sources of difficulty are obvious (such as a large number of axioms), we do not have a good general understanding of what makes justifications easy or difficult for ontology users. In this paper, we present an approach to determining the cognitive complexity of justifications for entailments of OWL ontologies. We describe an exploratory study which forms the basis for a cognitive complexity model that predicts the complexity of OWL justifications, and present the results of validating that model via experiments involving OWL users. This is concluded by an investigation into strategies OWL users apply to support them in understanding justifications. Our contributions include an evaluation of the cognitive complexity model, new insights into the complexity of justifications for entailments of OWL ontologies, a significant corpus with novel analyses of justifications suitable for experimentation, and an experimental protocol suitable for model validation and refinement.

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

semantic web
description logics
web ontology language
ontology debugging


A systematic analysis of duplicate records in Scopus We perform a systematic analysis of the problem of duplicate records in Scopus. In the seven journals included in the analysis, 12.4% of the records are duplicates. Most duplicate records are due to orthographic differences in journal titles. Journal name changes and title variations also play a role.

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


Numerical modeling of two-phase hysteresis combined with an interface condition for heterogeneous porous media This paper presents a numerical implementation of two-phase capillary hysteresis and its combination with a capillary interface condition for the treatment of heterogeneities. The hysteresis concepts chosen in this work are first implemented in a node-centered FV discretization scheme and subsequently combined with the interface condition that predicts sharp saturation discontinuities at material interfaces, based on a pressure equilibrium concept. This approach allows for the approximation of history-dependent, and at the same time discontinuous, saturations at material interfaces. The resulting model provides a well-defined evolution of the hysteretic capillary pressure-saturation relationships at material interfaces that is independent of the grid spacing. As demonstrated with a simple 1-D example, this concept therefore offers the advantage that the solution of a two-phase flow problem involving hysteresis does not relate to the grid resolution at the material interfaces.

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

hysteresis
numerical modeling
heterogeneous
interface condition


DS2: A DHT-based substrate for distributed services DHT (Distributed Hash Table) algorithms are very efficient for distributed data management. As one kind of P2P overlay, DHT overlay also has the advantages of high reliability, high scalability and low cost. Because of these advantages, DHT has been proposed to form server farms such as DHT-based NoSQL databases, SIP server farms, IMS server farms, OpenFlow controller farms, etc. This paper presents DS2, a DHT-based substrate designed for the application server farms providing distributed services. DS2 facilitates the deployment of DHT-based distributed services in three aspects. First, DS2 offers a powerful data model to manage complex data. Second, DS2 provides application message routing function and workload migration function, which help application server farm to achieve load balance, failover and service continuity. Third, DS2 allows deploying application server farms across data centers. DS2 deploying across data centers is optimized to provide better performance and service continuity. We have implemented a DS2 prototype and used it in ZTEs P2P CSCFprototype and service routing prototype to enable IMS services and service routing services successfully.

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


Corticosterone in Chicken Eggs Abstract: Birds are discussed as models for prenatal stress. In this study, several experiments were conducted to gain basic knowledge of if, how, and when maternal adrenocortical activity is reflected by corticosterone concentrations in the egg. Radiolabeled corticosterone was administered to 10 laying hens to investigate the uptake into as well as the distribution within the eggs. The yolk was dissected in concentric layers and analyzed. Less than 1% of the administered radioactivity entered the egg but was, however, not evenly distributed. On the day after injection, highest radioactivity (Bq/g) was detected in the albumen and the outmost layer, whereas concentration peaked 7 days later in the inner layers. In two other experiments, increased plasma levels of corticosterone were induced by injection of adrenocorticotropic hormone (ACTH) or feeding of corticosterone. Again, yolk disks were cut in layers and analyzed with a corticosterone enzyme immunoassay. No effect of the ACTH administration was detected, whereas feeding of corticosterone resulted in increased immunoreactive corticosterone concentrations in the yolk. Straight-phase high-performance liquid chromatographic (HPLC) separations were also performed to characterize immunoreactive steroids in the yolk. Two close-eluting peaks at the approximate elution position of corticosterone could be observed after the feeding experiment, whereas in untreated control eggs they were absent. It was concluded that transfer from plasma to egg is low for corticosterone and that further investigations concerning the transport mechanisms and the exact nature of yolk steroids are necessary.

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


Integrating hierarchical balanced scorecard with fuzzy linguistic for evaluating operating room performance in hospitals Health care organizations are operating in a complex environment. The competitive and dynamic health care sector has spurred hospitals into delivering greater flexibility and quality of services. An efficient performance evaluation system is essential for controlling, monitoring and improving service quality in health care organizations. The performance evaluation of operating room (OR) is a useful work for managers to control the operational process of OR team so as to promote the performance. This paper explores the use of a management tool: balanced scorecard (BSC), which facilitates managers to meet multiple strategic goals, and fuzzy linguistic method for evaluating OR performance. BSC is a strategic planning and management system that is used extensively in business and industry, government and nonprofit organizations. First, a model is developed for measuring the acceptable performance of OR based on the interaction financial, customers, internal business process and learning and growth perspective. After that, BSC structure integrated with fuzzy linguistic is proposed for measuring and improving the service. The aim of this study was to build a performance evaluation system for OR and use a fuzzy linguistic to convert the subjective cognition of managers into an information entity and confirmation of improvement. This research results are able to help the organisation to evaluate and revise its strategy and generally to adopt modern management approaches in every day practise.

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

operating room
performance evaluation
balanced scorecard


An empirical exploration of the distributions of the chidamber and Kemerer object-oriented metrics suite The object-oriented metrics suite proposed by Chidamber and Kemerer (CK) is a measurement approach towards improved object-oriented design and development practices. However, existing studies evidence traces of collinearity between some of the metrics and low ranges of other metrics, two facts which may endanger the validity of models based on the CK suite. As high correlation may be an indicator of collinearity, in this paper, we empirically determine to what extent high correlations and low ranges might be expected among CK metrics. To draw as much general conclusions as possible, we extract the CK metrics from a large data set (200 public domain projects) and we apply statistical meta-analysis techniques to strengthen the validity of our results. Homogeneously through the projects, we found a moderate (similar to0.50) to high correlation (>0.80) between some of the metrics and low ranges of other metrics. Results of this empirical analysis supply researchers and practitioners with three main advises: a) to avoid the use in prediction systems of CK metrics that have correlation more than 0.80 b) to test for collinearity those metrics that present moderate correlations (between 0.50 and 0.60) c) to avoid the use as response in continuous parametric regression analysis of the metrics presenting low variance. This might therefore suggest that a prediction system may not be based on the whole CK metrics suite, but only on a subset consisting of those metrics that do not present either high correlation or low ranges.

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

object-orientation
software metrics
meta-analysis


anycast-aware transport for content delivery networks Anycast-based content delivery networks (CDNs) have many properties that make them ideal for the large scale distribution of content on the Internet. However, because routing changes can result in a change of the endpoint that terminates the TCP session, TCP session disruption remains a concern for anycast CDNs, especially for large file downloads. In this paper we demonstrate that this problem does not require any complex solutions. In particular, we present the design of a simple, yet efficient, mechanism to handle session disruptions due to endpoint changes. With our mechanism, a client can continue the download of the content from the point at which it was before the endpoint change. Furthermore, CDN servers purge the TCP connection state quickly to handle frequent switching with low system overhead. We demonstrate experimentally the effectiveness of our proposed mechanism and show that more complex mechanisms are not required. Specifically, we find that our mechanism maintains high download throughput even with a reasonably high rate of endpoint switching, which is attractive for load balancing scenarios. Moreover, our results show that edge servers can purge TCP connection state after a single timeout-triggered retransmission without any tangible impact on ongoing connections. Besides improving server performance, this behavior improves the resiliency of the CDN to certain denial of service attacks.

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


Geometry of decomposition dependent evolutions of mixed states We examine evolutions where each component of a given decomposition of a mixed quantal state evolves independently in a unitary fashion. The geometric phase and parallel transport conditions for this type of decomposition dependent evolution are delineated. We compare this geometric phase with those previously defined for unitarily evolving mixed states, and mixed state evolutions governed by completely positive maps.

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


Genetic watermarking based on transform-domain techniques An innovative watermarking scheme based on genetic algorithms (GA) in the transform domain is proposed. It is robust against watermarking attacks, which are commonly employed in the literature. In addition, the watermarked image quality is also considered. In this paper, we employ GA for optimizing both the fundamentally conflicting requirements. Watermarking with GA is easy for implementation. We also examine the effectiveness of our scheme by checking the fitness function in GA, which includes both factors related to robustness and invisibility. Simulation results also show both the robustness under attacks, and the improvement in watermarked image quality with GA.

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

digital watermarking
genetic algorithm (ga)
discrete cosine transform (dct)
peak signal-to-noise ratio (psnr)
normalized cross correlation (nc)


Log-based rollback recovery without checkpoints of shared memory in software DSM A common approach to fault-tolerant software DSM is to take checkpoints with message logging. Our remote logging has low overhead because each node saves the coherence-related data into the memory of a remote node through a high-speed system area network. For more lightweight fault-tolerant DSM, in this paper, we mainly focused on eliminating shared memory checkpointing during failure-free execution. Each node independently takes the checkpoints of execution states and non-shared data only. When a node fails, it regenerates its pages from the remote copies in live nodes. In order to efficiently reconstruct pages, we also introduced a XOR-diffing technique. The diff logs, which have been created by XOR operations during failure-free execution, can be applicable to any version of remote copies either backward or forward for recovery. Our scheme reduces the checkpointing overhead and also alleviates the imbalance in execution times among nodes due to independent checkpointing.

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

fault tolerance
software distributed shared memory
cluster computing


Trigonometrically fitted fifth-order Runge-Kutta methods for the numerical solution of the Schrodinger equation Two trigonometrically fitted methods based on a classical Runge-Kutta method of Kutta-Nystrom are being constructed. The new methods maintain the fifth algebraic order of the classical one but also have some other significant properties. The most important one is that in the local truncation error of the new methods the powers of the energy are lower and that keeps the error at lower values, especially at high values of energy. The error analysis justifies the actual results when integrating the radial Schrodinger equation, where the high efficiency of the new methods is shown. (c) 2005 Elsevier Ltd. All rights reserved.

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

explicit runge-kutta methods
exponential fitting
trigonometrical fitting
resonance problem


Integration testing of object-oriented components using finite state machines In object-oriented terms, one of the goals of integration testing is to ensure that messages from objects in one class or component are sent and received in the proper order and have the intended effect on the state of the objects that receive the messages. This research extends an existing single-class testing technique to integration testing of multiple classes. The single-class technique models the behaviour of a single class as a finite state machine, transforms the representation into a data flow graph that explicitly identifies the definitions and uses of each state variable of the class, and then applies conventional data flow testing to produce test case specifications that can be used to test the class. This paper extends those ideas to inter-class testing by developing flow graphs, finding paths between pairs of definitions and uses, detecting some infeasible paths and automatically generating tests for an arbitrary number of classes and components. It introduces flexible representations for message sending and receiving among objects and allows concurrency among any or all classes and components. Data flow graphs are stored in a relational database and database queries are used to gather def-use information. This approach is conceptually simple, mathematically precise, quite powerful and general enough to be used for traditional data flow analysis. This testing approach relies on finite state machines, database modelling and processing techniques and algorithms for analysis and traversal of directed graphs. The paper presents empirical results of the approach applied to an automotive system. This work was prepared by U.S. Government employees as part of their official duties and is, therefore, a work of the U.S. Government and not subject to copyright. Published in 2006 by John Wiley & Sons, Ltd.

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

software integration testing
data modelling
object-oriented


topology-aware tile mapping for clusters of smps We propose a technique to optimize the performance of applications using distributed dense arrays and characterized by a nearest-neighbor communication profile by exploiting the topology of SMP clusters. The topological information is used to map array tiles to processors to reduce network communication and improve utilization of shared memory for inter-process communication. The potential benefits of using the SMP-aware mapping are demonstrated through a simulation, as well as a real application solving a wind-driven ocean circulation model on an IBM SP. On 256 processors, the execution time was reduced by almost 30 percent without any changes to the original application source code. The proposed mapping approach is applicable to multiple programming models and distributed array management systems.

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

topology awareness
communication optimization
data layout optimization


Optical modes of chiral photonic composites We report on the eigenmodes of photonic crystals consisting of submicron homogeneous chiral spheres in a nonchiral isotropic medium, by means of full electrodynamic calculations using the layer-multiple-scattering method. It is shown that resonant modes of the individual spheres give rise to narrow bands that hybridize with the extended bands of the appropriate symmetry associated with light propagation in an underlying effective chiral medium. The resulting photonic dispersion diagram exhibits remarkable features, such as strong band bending away from the Bragg points with consequent negative-slope dispersion inside the first Brillouin zone and sizable frequency gaps specific to each polarization mode. We present a rigorous group-theory analysis to explain features of the calculated photonic band structure, peculiar to a system which possesses time-reversal but not space-inversion symmetry, and discuss some interesting aspects of the underlying physics.

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


Hardness results for the center and median string problems under the weighted and unweighted edit distances Given a finite set of strings, the Median String problem consists in finding a string that minimizes the sum of the edit distances to the strings in the set. Approximations of the median string are used in a very broad range of applications where one needs a representative string that summarizes common information to the strings of the set. It is the case in classification, in speech and pattern recognition, and in computational biology. In the latter, Median String is related to the key problem of multiple alignment. In the recent literature, one finds a theorem stating the NP-completeness of the Median String for unbounded alphabets. However, in the above mentioned areas, the alphabet is often finite. Thus, it remains a crucial question whether the Median String problem is NP-complete for bounded and even binary alphabets. In this work, we provide an answer to this question and also give the complexity of the related Center String problem. Moreover, we study the parameterized complexity of both problems with respect to the number of input strings. In addition, we provide an algorithm to compute an optimal center under a weighted edit distance in polynomial time when the number of input strings is fixed.

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

multiple alignment
parameterized complexity

concensus string
tree alignment
np-complete
lcs


The influence of prototype fidelity and aesthetics of design in usability tests: Effects on user behaviour, subjective evaluation and emotion An empirical study examined the impact of prototype fidelity on user behaviour, subjective user evaluation and emotion. The independent factors of prototype fidelity (paper prototype, computer prototype, fully operational appliance) and aesthetics of design (high vs. moderate) were varied in a between-subjects design. The 60 participants of the experiment were asked to complete two typical tasks of mobile phone usage: sending a text message and suppressing a phone number. Both performance data and a number of subjective measures were recorded. The results suggested that task completion time may be overestimated when a computer prototype is being used. Furthermore, users appeared to compensate for deficiencies in aesthetic design by overrating the aesthetic qualities of reduced fidelity prototypes. Finally, user emotions were more positively affected by the operation of the more attractive mobile phone than by the less appealing one.

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

prototype fidelity
aesthetics
mobile phone


Computer use in older adults: Determinants and the relationship with cognitive change over a 6year episode Cognitively challenging activities may support the mental abilities of older adults. The use of computers and the Internet provides divergent cognitive challenges to older persons, and in previous studies, positive effects of computer and Internet use on the quality of life have been demonstrated. The present study addresses two research aims regarding predictors of computer use and the relationship between computer use and changes in cognitive abilities over a 6-year period in both younger (2449years) and older adults (older than 50years). Data were obtained from an ongoing study into cognitive aging: the Maastricht Aging Study, involving 1823 normal aging adults who were followed for 9years. The results showed age-related differences in predictors of computer use: the only predictor in younger participants was level of education, while in older participants computer use was also predicted by age, sex and feelings of loneliness. Protective effects of computer use were found for measures of selective attention and memory, in both older and younger participants. Effect sizes were small, which suggests that promotion of computer activities in older adults to prevent cognitive decline may not be an efficient strategy.

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


Target tracking using Monte Carlo simulation This paper proposes and studies an implementation of the bootstrap stochastic simulation approach for estimating a hybrid system - the bootstrap multiple model (BMM) algorithm. The BMM filter is applied to tracking maneuvering target. The tracking capabilities of the filter are demonstrated by computer simulation. (C) 1998 IMACS/Elsevier Science B.V.

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

multiple model estimation
bootstrap algorithm


on ranking the effectiveness of searches There is a growing interest in estimating the effectiveness of search. Two approaches are typically considered: examining the search queries and examining the retrieved document sets. In this paper, we take the latter approach. We use four measures to characterize the retrieved document sets and estimate the quality of search. These measures are (i) the clustering tendency as measured by the Cox-Lewis statistic, (ii) the sensitivity to document perturbation, (iii) the sensitivity to query perturbation and (iv) the local intrinsic dimensionality. We present experimental results for the task of ranking 200 queries according to the search effectiveness over the TREC (discs 4 and 5) dataset. Our ranking of queries is compared with the ranking based on the average precision using the Kendall t statistic. The best individual estimator is the sensitivity to document perturbation and yields Kendall t of 0.521. When combined with the clustering tendency based on the Cox-Lewis statistic and the query perturbation measure, it results in Kendall t of 0.562 which to our knowledge is the highest correlation with the average precision reported to date.

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

task quality use correlation queries knowledge paper search query ranking

precise
measurement
sensitive
statistics
estimates
experimentation
documentation
effect
locality
query performance prediction
cluster


A secure Boolean-based multi-secret image sharing scheme Present a random image generating function to generate a random image from secret images or shared images. Raise the sharing capacity to n/n. The shared images are more random than previous work. The sharing time is nearly the recovering time and both of them are under 1s.

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


Electronic structure study using density functional theory in organic dendrimers The electronic and structural properties of pyrrolic ring derivatives were studied using density functional theory (DFT) in terms of their application as organic semiconductor materials in photovoltaic devices. The B3LYP hybrid functional in combination with Pople type 6-31G(d) basis set with a polarization function was used in order to determine the optimized geometries and the electronic properties of the ground state, while transition energies and excited state properties were obtained from time-dependent (TD)-DFT with B3LYP/6-31G(d) calculation. The investigation of pyrrolic derivatives formed by the arrangement of several monomeric units revealed that three-dimensional (3D) conjugated architectures in which the combination of a triphenylamine (TPA) core with pi-conjugated rings attached to the core, present the best geometric and electronic characteristics for use as an organic semiconductor material. The highest occupied molecular orbital (HOMO) - lowest unoccupied molecular orbital (LUMO) energy gap was decreased in 3D-structures that extend the absorption spectrum toward longer wavelengths, revealing a feasible intramolecular charge transfer process in these systems. All calculations in this work were performed using the Gaussian 03 W software package.

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

organic photovoltaics
dendrimers and semiconductors


Game-theoretic surveillance over arbitrary floor plan using a video camera network Coordinated multi-resolution tracking over arbitrary floor plan is addressed using a game-theoretic approach. An enhanced radial sweep algorithm is devised to find the polygon of visibility at any point on or inside a polygon that contains vision-obstructing polygonal entities. By sampling the edges of a polygon and edges of any polygonal hole inside that polygon, a two-pass 01 programming process is formulated to find a near-optimal set of camera samples that can dynamically cover, at a high probability, area under surveillance in the presence of camera handoffs. Radius Multiplier is introduced to handle partial visibility and is set to 1 by default to avoid insolvability of 01 programming problems. As a remedy to excessive redundancy triggered by camera clustering, we set camera redundancy to a fixed value of 3 for any block with concave Valid Area. Branch-and-cut algorithm is employed to solve 01 programming problems. Assigning a fixed value to Camera Redundancy of blocks with concave Valid Area, setting Radius Multiplier to a nonzero value, and utilizing secondary utility yielded better simulation results for various types of floor plans. Raising Camera Redundancy of blocks with non-concave Valid Area contributed to performance boost and in the meantime, increased the number of cameras needed.

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

game theory
nash equilibrium
camera placement
multi-resolution tracking


particle swarm clustering ensemble Extracting natural groups of the unlabeled data is known as clustering. To improve the stability and robustness of the clustering outputs, clustering ensembles have emerged recently. In this paper, an ensemble of particle swarm clustering algorithms is proposed. That is, the members of the ensemble are based on the cooperative swarms clustering approaches. The performance of the proposed particle swarm clustering ensemble is evaluated using dierent data sets and is compared to that of other clustering techniques.

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

particle swarm optimization
multiple cooperative swarms
data clustering


Active overload prevention based adaptive MAP selection in HMIPv6 networks Multi-level mobile anchor points (MAP) architecture is deployed in large-scale wireless/mobile networks using HMIPv6 to achieve better mobility service, while selecting the most suitable serving MAP for the mobile nodes (MNs) to enhance the whole network performance has been a critical issue. An adaptive MAP selection based on active overload prevention (MAP-AOP) hence is proposed. The MAP periodically evaluates the load status by using dynamic weighted load evaluation algorithm, and then sends the load information to the covered access routers (AR) by using the expanded routing advertisement message in a dynamic manner. Taking achieving the load balancing among the available MAPs, the current serving AR executes the active overload prevention to select MAP candidates for the MN pending a handover, and then adaptively selects an optimal one from the candidates by comprehensively considering the system cost and the average handover latency caused by each candidate. The simulation conducted on the NS-2 platform indicates that MAP-AOP outperforms the comparative MAP selection schemes with the optimized system cost and average handover latency, and better load balancing.

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

hmipv6
map
dynamic weighted load evaluation
active overload prevention


Method for stakeholder identification in interorganizational environments Stakeholders are the first emerging challenge in any software project. Their identification is a critical task for success. Nevertheless, many authors consider them as a default product of a non-explained identification process. Several aspects must be considered when the project is carried out in environments where multiple organizations interact. These complex contexts demand extremely hard efforts. Stakeholders must be identified taking into account their attributes (types, roles), which must be extended and defined for these environments. In general, there are no methodologies that allow performing this task in a systematic way for the development of interorganizational information systems. The paper proposes a method for carrying out stakeholder identification considering the diverse dimensions involved in interorganizational environments: organizational, interorganizational and external. It allows the systematic specification of all the people, groups and organizations whose interests and needs can affect or are affected by the interorganizational system. Also diverse stakeholders attributes such as types, roles, influence and interest are defined, analyzed, and included in the method. They are all important in later stages of any software project.

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

stakeholders
interorganizational information systems


using industry based data sets in software engineering research This paper describes the use of software project development data obtained from industry based projects. It argues the importance of carrying out a preliminary data analysis procedure for software development cost estimation. The paper also presents the limitations of using these industrial data (ISBSG R9 and Bank63 Data) based on the above research. Current state of the research and further work is discussed.

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


an erlang-like law for gprs/edge engineering and its first validation on live traffic This paper is a contribution to the generic problem of having a simple and accurate analytical model to dimension GSM/(E)GPRS radio cells where voice and data traffic are mixed. Radio resources are assumed to be shared according to the so-called Partial Partitioning scheme where some channels are dedicated to voice, others to data, and the remaining are shared by voice and data. Voice has a total preemption priority over data on the shared part. This work shows how to calibrate an Erlang-like law based on Markovian modeling for this complex sharing resource situation and to validate it against real data. We present a complete validation framework on a live network for a simple and efficient GSM/(E)GPRS analytical tool.

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

measurement
edge
markov chain
erlang
performance evaluation
gprs


web 2.0 geospatial visual analytics for improved urban flooding situational awareness and assessment Situational awareness of urban flooding during storm events is important for disaster and emergency management. However, no general purpose tools yet exist for rendering rainfall accumulations in real-time at the resolution of hydrologic units used for modeling. This demonstration will exhibit a novel web 2.0 visual analytical approach for understanding and adaptively managing urban flooding issues. The approach generates a geospatial-temporal map of rainfall within urban hydrologic units (sewer-sheds) in real-time. The polygon-averaged rainfall data is generated using virtual sensors which provide customized real-time data products derived from National Weather Service weather radar data using NCSA's workflow tools. Time-series KML (Keyhole Markup Language) layers are generated, where each KML layer represents a particular slice of the geospatial color-coded sewershed map. Such time-aware KML can be replayed as a movie in the web-based Google Earth environment. This geospatial visual analytic approach can provide decision markers and communities a powerful resource for assessment of neighborhood flooding issues. We will demonstrate our technology using historical and real-time rainfall data in the metropolitan Chicago area to show the effectiveness of such approach. Future work by combining additional ground-truth flooding data will allow us move towards real-time improved decision support for flooding and stormwater management.

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

keyhole markup language
rainfall
workflow
geospatial visual analytics


Effective location based services with dynamic data management in mobile environments With the proliferation of mobile computing technologies, location based services have been identified as one of the most promising target application. We classify mobile information service domains based on feature characteristics of the information sources and different patterns of mobile information access. By carefully examining the service requirements, we identify the dynamic data management problem that must be addressed for effective location based services in mobile environments. We then devise a general architecture and cost model for servicing both location independent and location dependent data. Based on the architecture and cost model, we propose a set of dynamic data management strategies that employs judicious caching, proactive server pushing and neighborhood replication to reduce service cost and improve response time under changing user mobility and access patterns. Detail behavior analysis helps us in precisely capturing when and how to apply these strategies. Simulation results suggest that different strategies are effective for different types of data in response to different patterns of movement and information access.

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

location based services
dynamic data management

mobile information service model
cost analysis


program page reference patterns This paper describes a set of measurements of the memory reference patterns of some programs. The technique used to obtain these measurements is unusually efficient. The data is presented in graphical form to allow the reader to "see" how the program uses memory. Constant use of a page and sequential access of memory are easily observed. An attempt is made to classify the programs based on their referencing behavior. From this analysis it is hoped that the reader will gain some insights as to the effectiveness of various memory management policies.

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

program use analysis behavior data paper access management

measurement paging policy efficiency memorialized graphics effect pattern


FASE: A framework for scalable performance prediction of HPC systems and applications As systems of computers become more complex in terms of their architecture, interconnect and heterogeneity, the optimum configuration and utilization of these machines becomes a major challenge. To reduce the penalties caused by poorly configured systems, simulation is often used to predict the performance of key applications to be executed on the new systems. Simulation provides the capability to observe component and system characteristics (e.g. performance and power) in order to make vital design decisions. However, simulating high-fidelity models can be very time consuming and even prohibitive when evaluating large-scale systems. The Fast and Accurate Simulation Environment (FASE) framework seeks to support large-scale system simulation by using high-fidelity models to capture the behavior of only the performance-critical components while employing abstraction techniques to capture the effects of those components with little impact on the system. In order to achieve this balance of accuracy and simulation speed, FASE provides a methodology and associated toolset to evaluate numerous architectural options. This approach allows users to make system design decisions based on quantifiable demands of their key applications rather than using manual analysis which can be error prone and impractical for large systems. The framework accomplishes this evaluation through a novel approach of combining discrete-event simulation with an application characterization scheme in order to remove unnecessary details while focusing on components critical to the performance of the application. In this paper, we present the methodology and techniques behind FASE and include several case studies validating systems constructed using various applications and interconnects.

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

performance prediction
application characterization

high-performance computing
discrete-event simulation


Optimization of magnetic sensor arrays for current measurement based on swarm intelligence and D-optimality Purpose - The purpose of this paper is to improve the accuracy of innovative current transducers based on magnetic sensor arrays. Design/methodology/approach - The positions and the orientations of the magnetic sensors are optimized. The objective function is defined according to D-optimality theory and the optimization problem solved using particle swarm optimization (PSO). Findings - PSO is shown to be efficient for the optimization problem and that, following the D-optimality approach, a significant improvement in the measurement accuracy is obtained in terms of the errors typically used to classify current transducers. Research limitations/implications - The paper does not take into account the effects of external magnetic fields. Practical implications - A criterion and a methodology are suggested in order to design more accurate current transducers based on magnetic sensors. Originality/value - A new methodology to optimize magnetic sensor arrays for current measurement.

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


evaluation of heuristic techniques for test vector ordering Vector reordering is an essential task in testing VLSI systems because it affects this process from two perspectives: power consumption and correlation among data. The former feature is crucial and if not properly controlled during testing, may result in permanent failure of the device-under-test (DUT). The atter feature is a so important because correlation is captured by coding schemes to efficiently compress test data and ease memory requirements of Automatic-Test-Equipment (ATE),while reducing the volume of data and lowering the test application time. Reordering however is NP-complete. This paper presents an evaluation of different heuristic techniques for vector reordering using ISCAS85 and ISCAS89 benchmark circuits in terms of time and quality. For this application, it is shown that the best heuristic technique is not the famous Christofides or Lin-Kernighan, but the Multi-Fragment technique.

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

test vector ordering
test data
power consumption


a revaluation of frame difference in fast and robust motion detection In this paper we propose a robust approach to detect moving objects for video surveillance applications. We demonstrate that a jointly use of frame by frame difference with a background subtraction algorithm allows us to have a strong and fast pixel foreground classification without the need of previous background learning. The Joint Difference algorithm uses frame difference information to correct pixels classification made by a background subtraction algorithm while selectively updating the background model according to such classification. In this way we should perform motion segmentation also in presence of environmental changes such as illumination variations or "waking persons". The algorithm is capable of 15 fps tracking of moving people on 640-480 unsampled color images; results on both VSSN06 and Wallflower [8] benchmark videos are presented.

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


A MULTIVARIABLE MULTIOBJECTIVE PREDICTIVE CONTROLLER Predictive control of MIMO processes is a challenging problem which requires the specification of a large number of tuning parameters (the prediction horizon, the control horizon and the cost weighting factor). In this context, the present paper compares two strategies to design a supervisor of the Multivariable Generalized Predictive Controller (MGPC), based on multiobjective optimization. Thus, the purpose of this work is the automatic adjustment of the MGPC synthesis by simultaneously minimizing a set of closed loop performances (the overshoot and the settling time for each output of the MIMO system). First, we adopt the Weighted Sum Method (WSM), which is an aggregative method combined with a Genetic Algorithm (GA) used to minimize a single criterion generated by the WSM. Second, we use the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) as a Pareto method and we compare the results of both the methods. The performance of the two strategies in the adjustment of multivariable predictive control is illustrated by a simulation example. The simulation results confirm that a multiobjective, Pareto-based GA search yields a better performance than a single objective GA.

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

multiobjective optimization
weighted sum method

closed loop performance
coupled multivariable system
generalized predictive control
nsga-ii


filtering xml documents using xpath expressions and aspect-oriented programming In this paper, we present the design and implementation of a filtering approach for XML documents which is based on XPath expressions and Aspect-Oriented Programming (AOP). The class of XPath expressions used allows for branching, wildcards and descendant relationships between nodes. For the embedding of simple paths into XPath expressions, a dynamic programming approach is proposed. The AOP paradigm, which provides a means for encapsulating crosscutting concerns in software, is introduced to integrate the filtering approach in the broader context of event-based parsing of XML documents using SAX.

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


Exponential type orbitals with generalized hyperbolic cosine functions for atomic systems Radial basis functions, constructed from Slater type rn??1e??r r n ? ? 1 e ? ? r and generalized exponential type rn??1e??r? r n ? ? 1 e ? ? r ? functions with the generalized hyperbolic cosine type functions coshpq(?r) cosh p q ( ? r ) and coshpq(?r?) cosh p q ( ? r ? ) , where p p and q q are arbitrary parameters, are proposed and applied to HartreeFockRoothaan calculations of atomic systems. The performance of new basis functions within the minimal basis sets framework has been compared to numerical HartreeFock results and previous results presented by similar basis functions in the literature. The results obtained by the new basis sets surpass the accuracy of existing basis sets of similar hyperbolic cosine type functions.

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

generalized hyperbolic cosine function
exponential type orbital
hartreefockroothaan calculation
noninteger principal quantum number


The Critical Role of Velocity Storage in Production of Motion Sickness We propose that motion sickness is mediated through the orientation properties of velocity storage in the vestibular system that tend to align eye velocity produced by the angular vestibulo-ocular reflex (aVOR) with gravito-inertial acceleration (GIA). (GIA is the sum of the linear accelerations acting on the head. In the absence of translational accelerations, gravity is the GIA.) We further postulate that motion sickness produced by cross-coupled vestibular stimulation can be characterized by a metric composed of the disparity between the axis of eye rotation and the GIA, the strength of the response to angular motion, and the response duration, as determined by the central vestibular time constant, that is, by the time constant of velocity storage. The nodulus and uvula of the vestibulocerebellum are likely to be the central sites where the disparity is sensed, where the vestibular time constants are habituated, and where links are made to the autonomic system to produce the symptoms and signs.

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

vestibular nodulus uvula vestibulocerebellum

head movements
nystagmus
vertigo
roll while rotating


A comment to the papers by Opthof and Leydesdorff, Scientometrics, 88, 1011-1016, 2011 and Waltman et al., Scientometrics, 88, 1017-1022, 2011 In this comment, we re-evaluate an example using a "thermodynamic" paradigm to show how bibliometrics can incorporate normalization into the evaluative process. The motivation for this is the recent exchange in the pages of this journal from two groups that have taken different positions on how normalization should be done.

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

performance indicators quality quantity quasity energy exergy p-index h-index


a cmos elliptic low-pass switched capacitor ladder filter for video communication using bilinear implementation This paper presents an approach to design of a high frequency switched capacitor filters for video communication networks. In the case of low OSR, using common methods reduces the SNDR and accuracy of the filter. Bilinear implementation techniques are applied to an untried fifth-order elliptic SC filter, and are simulated in a 0.35mm CMOS technology. Cutoff frequency of the filter is 3.6MHz and with bilinear implementation, we achieve 72dB SFDR, 62dB THD and stop band attenuation greater than -30dB. All the capacitors are scaled down in order to reduce the settling time of the amplifiers. The circuit operates with +3V supply and typically dissipates 15 mw when sampled at 18MHz and has full swing about 1.8V.

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

bilinear integrator
switched capacitor filter
video communication filter


Completely induced L-fuzzy topological spaces The first aim of this paper is to introduce and to study the concepts of complete Scott continuity' and 'completely induced L-fuzzy topological space'. The second is to discuss the connections between some separation, countability and covering properties of an ordinary topological space and its corresponding completely induced L-fuzzy topological space. (C) 1999 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

completely induced l-fuzzy topological space


Observer-controller design for three dimensional overhead cranes using time-scaling In this paper we address the design of an observer-controller for a three degrees of freedom overhead crane. We consider a linear model of the crane where the length of the suspending rope is a time-varying parameter. The set of models given by frozen values of the rope length can be reduced to a single time-invariant reference model using suitable time-scalings. We construct a controller and an observer for the reference model assigning the desired closed loop eigenvalues for both system and estimation error. The time-scaling relations can be used to derive a control law for the time-varying system that implements an implicit gain-scheduling [6]. A second gain-scheduling is used to choose suitable closed-loop eigenvalues for different values of the load and lifting/lowering operations. Using a Lyapunov-like theorem, it is also possible to rnd relative upper bounds for the rate of change of the varying parameter that ensure the stability of the time-varying system.

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

gain scheduling
linear time-varying systems
pole placement


Virtual prototype and experimental research on gear multi-fault diagnosis using wavelet-autoregressive model and principal component analysis method Gear systems are an essential element widely used in a variety of industrial applications. Since approximately 80% of the breakdowns in transmission machinery are caused by gear failure, the efficiency of early fault detection and accurate fault diagnosis are therefore critical to normal machinery operations. Reviewed literature indicates that only limited research has considered the gear multi-fault diagnosis, especially for single, coupled distributed and localized faults. Through virtual prototype simulation analysis and experimental study, a novel method for gear multi-fault diagnosis has been presented in this paper. This new method was developed based on the integration of Wavelet transform (WT) technique, Autoregressive (AR) model and Principal Component Analysis (PCA) for fault detection. The WT method was used in the study as the de-noising technique for processing raw vibration signals. Compared with the noise removing method based on the time synchronous average (TSA), the WT technique can be performed directly on the raw vibration signals without the need to calculate any ensemble average of the tested gear vibration signals. More importantly, the WT can deal with coupled faults of a gear pair in one operation while the TSA must be carried out several times for multiple fault detection. The analysis results of the virtual prototype simulation prove that the proposed method is a more time efficient and effective way to detect coupled fault than TSA, and the fault classification rate is superior to the TSA based approaches. In the experimental tests, the proposed method was compared with the Mahalanobis distance approach. However, the latter turns out to be inefficient for the gear multi-fault diagnosis. Its defect detection rate is below 60%, which is much less than that of the proposed method. Furthermore, the ability of the AR model to cope with localized as well as distributed gear faults is verified by both the virtual prototype simulation and experimental studies.

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


Bounded Partial-Order Reduction Eliminating concurrency errors is increasingly important as systems rely more on parallelism for performance. Exhaustively exploring the state-space of a program's thread interleavings finds concurrency errors and provides coverage guarantees, but suffers from exponential state-space explosion. Two prior approaches alleviate state-space explosion. (1) Dynamic partial-order reduction (DPOR) provides full coverage and explores only one interleaving of independent transitions. (2) Bounded search provides bounded coverage by enumerating interleavings that do not exceed a bound. In particular, we focus on preemption-bounding. Combining partial-order reduction with preemption-bounding had remained an open problem. We show that preemption-bounded search explores the same partial orders repeatedly and consequently explores more executions than unbounded DPOR, even for small bounds. We further show that if DPOR simply uses the preemption bound to prune the state space as it explores new partial orders, it misses parts of the state space reachable in the bound and is therefore unsound. The bound essentially induces dependences between otherwise independent transitions in the DPOR state space. We introduce Bounded Partial Order Reduction (BPOR), a modification of DPOR that compensates for bound dependences. We identify properties that determine how well bounds combine with partial-order reduction. We prove sound coverage and empirically evaluate BPOR with preemption and fairness bounds. We show that by eliminating redundancies, BPOR significantly reduces testing time compared to bounded search. BPOR's faster incremental guarantees will help testers verify larger concurrent programs.

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

algoirthms
verification
bounded partial-order reduction
dynamic partial-order reduction
liveness
model checking
shared-memory programs
software testing


Effect of gelation and ball milling on the optical absorption and emission of macrilon yellow dye molecules trapped in silica prepared by the solgel method Organic dye molecules (macrilon yellow) were embedded into silicon dioxide matrix by the solgel method. Optical measurements at room temperature of absorption and emission were performed at different steps of the gelation process, starting when the suspension was liquid and finishing when it got the solid state. Optical absorption spectra show the dependence with gelation process and with the milling process. The intensity of the absorption band at 420 nm increases with the viscosity of the suspension. This effect is more important for the milled suspension, working with the same pigment concentration. The gelation and the milling processes also affect the emission spectra. The emission spectra has two bands centered at about 520 and 560 nm. During gelation the relative intensity of the band at about 560 nm increases respect the band at about 520 nm. The emission band of the sample made with milled suspension is three times more intense than that of the not milled suspension.

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


Learning in games using the imprecise Dirichlet model We propose a new learning model for finite strategic-form two-player games based on fictitious play and Walley's imprecise Dirichlet model [P. Walley, Inferences from multinomial data: learning about a bag of marbles, J. Roy. Statist. Soc. B 58 (1996) 3-57]. This model allows the initial beliefs of the players about their opponent's strategy choice to be near-vacuous or imprecise instead of being precisely defined. A similar generalization can be made as the one proposed by Fudenberg and Kreps [D. Fudenberg, D.M. Kreps, Learning mixed equilibria, Games Econ. Behav. 5 (1993) 320-367] for fictitious play, where assumptions about immediate behavior are replaced with assumptions about asymptotic behavior. We also obtain similar convergence results for this generalization: if there is convergence, it will be to an equilibrium. (C) 2008 Elsevier Inc. All rights reserved.

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

learning
fictitious play
imprecise dirichlet model

imprecise probability models
two-player games
decision making


Determining the automorphism group of the linear ordering polytope In this paper, we explore the combinatorial automorphism group of the linear ordering polytope for each n>1. We establish that this group is isomorphic to if n>2 (and to if n=2). In doing so, we provide a simple and unified interpretation of all the automorphisms.

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

linear ordering polytope
automorphism group


On the core, the Weber set and convexity in games with a priori unions This paper deals with the concepts of core and Weber set with a priori unions la Owen. As far as we know, the Owen approach to games with a priori unions has never been studied from the coalitional stability point of view. Thus we introduce the coalitional core and coalitional Weber set and characterize the class of convex games with a priori unions by means of the relationships between both solution concepts.

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

a priori unions
coalitional core
coalitional weber set
convexity


Skolem Machines The Skolem machine is a Turing-complete machine model where the instructions are first-order formulas of a specific form. We introduce Skolem machines and prove their logical correctness and completeness. Skolem machines compute queries for the Geolog language, a rich fragment of first-order logic. The concepts of Geolog trees and complete Geolog trees are defined, and these tree concepts are used to show logical correctness and completeness of Skolem machine computations. The universality of Skolem machine computations is demonstrated. Lastly, the paper outlines implementation design issues using an abstract machine model approach.

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

skolem machines
geolog language
geolog trees
correctness
completeness
universality


Cell signaling This review explores advances in our understanding of dynamicism in cellular signaling. Areas highlighted include the role of stochasticity in producing diversity in analogous signaling circumstances; population desynchronization's effect in masking newly appreciated repetitive bursts in protein phosphorylation and messenger RNA production; double-positive feedback interactions and their ability to synchronize multiple signal transduction pathways; scaffolding proteins control over signaling feedback; and frequency-responsive transcriptional regulation as an example of dynamicism in signaling.

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

gene transcription
oscillations
tnf
nf-kappab
jnk
p38
erk
temporal


Refactoring of Timing Graphs and Its Use in Capturing Topological Correlation in SSTA Reconvergent paths in circuits have been a nuisance in various computer-aided design (CAD) algorithms, but no elegant solution to deal with them has been found yet. In statistical static timing analysis (SSTA), they cause difficulty in capturing topological correlation. This paper presents a technique that in arbitrary block-based SSTA reduces the error caused by ignoring topological correlation. We interpret a timing graph as an algebraic expression made up of addition and maximum operators. We define the division operation on the expression and propose algorithms that modify factors in the expression without expansion. As a result, the algorithms produce an expression to derive the latest arrival time with better accuracy in SSTA. Existing techniques handling reconvergent fanouts usually use dependency lists, requiring quadratic space complexity. Instead, the proposed technique has linear space complexity by using a new directed acyclic graph search algorithm. Our results show that it outperforms an existing technique in speed and memory usage with comparable accuracy. More important, the proposed technique is not limited to SSTA and is potentially applicable to various issues due to reconvergent paths in timing-related CAD algorithms.

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

reconvergent paths
static timing analysis


Second order symmetric duality in nondifferentiable multiobjective fractional programming with cone convex functions In the present paper, we consider Mond-Weir type nondifferentiable second order fractional symmetric dual programs over arbitrary cones and derive duality results under second order K?F-convexity/K?F-pseudoconvexity assumptions. Our results generalize several known results in the literature.

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

second order symmetric duality
multiobjective fractional programming


on some properties of covering based approximations of classifications of sets Approximations of classifications, introduced and studied by Grzymala Busse [4] is a notion different from the notion of approximations of sets (Pawlak [9]). In fact the equivalence classes of approximate classifications cannot be arbitrary sets. Busse [4] had established properties of approximations of classifications which were recently extended to necessary and sufficient type theorems by Tripathy et. al ([12]). Four types of covering based rough sets have been obtained as generalization of basic rough sets. Also another covering rough set from a topological point of view has been obtained (14, 15, 16, 17, 18, 19]. Attempts have been made in [13] to extend the above results to covering based rough sets. In this paper we carry out this study further by deriving results for all the five types of covering based rough sets. These results can be used to derive rules for information systems with domains of attributes values being covers instead of partitions.

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


is complexity really the enemy of software security? Software complexity is often hypothesized to be the enemy of software security. We performed statistical analysis on nine code complexity metrics from the JavaScript Engine in the Mozilla application framework to investigate if this hypothesis is true. Our initial results show that the nine complexity measures have weak correlation (?=0.30 at best) with security problems for Mozilla JavaScript Engine. The study should be replicated on more products with design and code-level metrics. It may be necessary to create new complexity metrics to embody the type of complexity that leads to security problems.

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

fault prediction
software metrics
security metrics
vulnerability prediction
reliability


Study of the ultrasonic compaction process of composite laminates - part I: process modeling Recent advances in out-of-autoclave manufacturing processes for composite materials may require the compaction of the pre-preg plies just after placing them. Ultrasonic compactors are a good solution for this task. The quality of the compaction will depend on the frequency and amplitude of the ultrasonic vibration, which produces a viscous heating in the resin. The increase in temperature liquefies the resin, thus helping the air bubbles to escape. The study of how this heat is generated and distributed is fundamental to better understand and optimize the compaction process. In this work, the formulation of a thermomechanical model for the viscous heating of an uncured laminate of pre-preg plies due to ultrasonic vibrations is presented. In addition, a thermal model for the heat transfers to obtain the temperature distribution during the compaction process of composite layers will be shown.

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


Slip-adaptive walk of quadruped robot In this paper, we investigated the effects of the friction condition on walking pattern and energy efficiency, and based on the results, we proposed two new slip-adaptive strategies for generating a slip-adaptive walk. The first strategy for a slip-adaptive walk uses a slip reflex via a Central Pattern Generator (CPG) to change the walking pattern. The second strategy for a walk uses a force control to immediately compensate a slip. Using these strategies, a walk, which is adaptive to varying friction conditions and slips, becomes possible. The validity of the proposed method is confirmed through simulation and experimentation.

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


On range and response: Dimensions of process flexibility There are two dimensions to process flexibility: range versus response. Range is the extent to which a system can adapt, while response is the rate at which the system can adapt. Although both dimensions are important, the existing literature does not analytically examine the response dimension vis-a-vis the range dimension. In this paper, we model the response dimension in terms of uniformity of production cost. We distinguish between primary and secondary production where the latter is more expensive. We examine how the range and response dimension interact to affect the performance of the process flexible structure. We provide analytical lower bounds to show that under all scenarios on response flexibility, moderate form of range flexibility (via chaining structure) still manages to accrue non-negligible benefits vis-a-vis the fully flexible structure (the bound is 29.29% when demand is normally distributed). We show further that given limited resources, upgrading system response dimension outperforms upgrading system range dimension in most cases. This confirms what most managers believe in intuitively. We observe also that improving system response can provide even more benefits when coupled with initiatives to reduce demand variability. This is in direct contrast with range flexibility, which is more valuable when the system has higher variability.

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

probability: renewal processes
production: process flexibility
facility planning: design