Partially linear transformation cure models for interval-censored data There has been considerable progress in the development of semiparametric transformation models for regression analysis of time-to-event data. However, most of the current work focuses on right-censored data. Significantly less work has been done for interval-censored data, especially when the population contains a nonignorable cured subgroup. A broad and flexible class of semiparametric transformation cure models is proposed for analyzing interval-censored data in the presence of a cure fraction. The proposed modeling approach combines a logistic regression formulation for the probability of cure with a partially linear transformation model for event times of susceptible subjects. The estimation is achieved by using a spline-based sieve maximum likelihood method, which is computationally efficient and leads to estimators with appealing properties such as consistency, asymptotic normality and semiparametric efficiency. Furthermore, a goodness-of-fit test can be constructed for the proposed models based on the sieve likelihood ratio. Simulations and a real data analysis are provided for illustration of the methodology.

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

cure rate
interval censoring
sieve likelihood ratio test
sieve maximum likelihood estimator


A conservative lattice Boltzmann model for the volume-averaged NavierStokes equations based on a novel collision operator The volume-averaged NavierStokes (VANS) equations are at the basis of numerous models used to investigate flows in porous media or systems containing multiple phases, one of which is made of solid particles. Although they are traditionally solved using the finite volume, finite difference or finite element method, the lattice Boltzmann method is an interesting alternative solver for these equations since it is explicit and highly parallelizable. In this work, we first show that the most common implementation of the VANS equations in the LBM, based on a redefined collision operator, is not valid in the case of spatially varying void fractions. This is illustrated through five test cases designed using the so-called method of manufactured solutions. We then present an LBM scheme for these equations based on a novel collision operator. Using the ChapmanEnskog expansion and the same five test cases, we show that this scheme is second-order accurate, explicit and stable for large void fraction gradients.

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

lattice boltzmann method
method of manufactured solutions
porous media

computational fluid dynamics
volume-averaged navierstokes equations
multiphase flows


ion channel modeling with analog circuit evolution We propose that analog electrical circuits are a natural representation for modeling the dynamical systems that arise in neuroscience. Here we use analog circuit evolution, a reverse engineering technique designed to search through analog circuit space, to automatically design circuit models of ion channel behavior. Results comparing several different multiobjective and coevolutionary techniques demonstrate the importance of evaluating the fitness of evolved circuits under multiple behavioral conditions.

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

ion channel
circuit evolution
dynamical systems
analog circuit
neuroscience

hodgkin and huxley
physiology
evolutionary algorithms


A probabilistic non-dominated sorting GA for optimization under uncertainty Purpose - A probabilistic non-dominated sorting genetic algorithm (P-NSGA) for multi-objective optimization under uncertainty is presented. The purpose of this algorithm is to create a tight coupling between the optimization and uncertainty procedures, use all of the possible probabilistic information to drive the optimizer, and leverage high-performance parallel computing. Design/methodology/approach - This algorithm is a generalization of a classical genetic algorithm for multi-objective optimization (NSGA-II) by Deb et al The proposed algorithm relies on the use of all possible information in the probabilistic domain summarized by the cumulative distribution functions (CDFs) of the objective functions. Several analytic test functions are used to benchmark this algorithm, but only the results of the Fonseca-Fleming test function are shown. An industrial application is presented to show that P-NSGA can be used for multi-objective shape optimization of a Formula 1 tire brake duct, taking into account the geometrical uncertainties associated with the rotating rubber tire and uncertain inflow conditions. Findings - This algorithm is shown to have deterministic consistency (i.e. it turns back to the original NSGA-II) when the objective functions are deterministic. When the quality of the CDF is increased (either using more points or higher fidelity resolution), the convergence behavior improves. Since all the information regarding uncertainty quantification is preserved, all the different types of Pareto fronts that exist in the probabilistic framework (e.g. mean value Pareto, mean value penalty Pareto, etc.) are shown to be generated a posteriori. An adaptive sampling approach and parallel computing (in both the uncertainty and optimization algorithms) are shown to have several fold speed-up in selecting optimal solutions under uncertainty. Originality/value - There are no existing algorithms that use the full probabilistic distribution to guide the optimizer. The method presented herein bases its sorting on real function evaluations, not merely measures (i.e. mean of the probabilistic distribution) that potentially do not exist

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

uncertainty quantification
cdf
formula 1


Evolving digital circuits using hybrid particle swarm optimization and differential evolution This paper presents the evolution of combinational logic circuits by a new hybrid algorithm known as the Differential Evolution Particle Swarm Optimization (DEPSO), formulated from the concepts of a modified particle swarm and differential evolution. The particle swarm in the hybrid algorithm is represented by a discrete 3-integer approach. A hybrid multi-objective fitness function is coined to achieve two goals for the evolution of circuits. The first goal is to evolve combinational logic circuits with 100% functionality., called the feasible circuits. The second goal is to minimize the number of logic gates needed to realize the feasible circuits. In addition, the paper presents modifications to enhance performance and robustness of particle swarm and evolutionary techniques for discrete optimization problems. Comparison of the performance of the hybrid algorithm to the conventional Karnaugh map and evolvable hardware techniques such as genetic algorithm, modified particle swarm, and differential evolution are presented on a number of case studies. Results show that feasible circuits are always achieved by the DEPSO algorithm unlike with other algorithms and the percentage of best solutions (minimal logic gates) is higher.

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

combinational logic circuits
differential evolution
evolvable hardware
particle swarm optimization


the multiple views of inter-organizational authoring Collaborative authoring is a common workplace task. Yet, despite improvements in word processors, communication software, and file sharing, many problems continue to plague co-authors. We conducted a qualitative study in a setting where participants are loosely connected, physically separated, and work together over a period of 4-9 months to author a complex technical document-a clinical trial protocol. Our study differs from most prior work in that the collaboration is longer-lived, and that the collaborators do not share equivalent status, background, nor domains of expertise. Our data demonstrates that the participants do not share the same view or representation of the authoring process, even though it has a long organizational history. Nonetheless, the participants can still coordinate their activity while maintaining only partially consistent representations of what they are doing. We contend that partial consistency in the participants' concept of the collaborative process is a feature for their asynchronous collaboration at a distance. Based on our findings we suggest a number of improvements for both tools and tool usage that have direct impact on support for collaborative authoring.

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

medical informatics
clinical trials
field study


REMOTE PREPARATION OF A TWO-PARTICLE ENTANGLED STATE In this paper, we propose a scheme for probabilistic remote preparation of a two-particle nonmaximally entangled state. In this scheme, two pairs of the two-particle partially entangled state are used as quantum channel. Alice performs the single-particle measurement three times and sends the information to the receiver. In accordance with the information, the receiver can construct the original state. By this method, the total probability of successful preparation is enhanced.

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

remote state preparation
single-particle measurement
unitary transformation


Support vector-based algorithms with weighted dynamic time warping kernel function for time series classification In this paper, we propose support vector-based supervised learning algorithms, called multiclass support vector data description with weighted dynamic time warping kernel function (MSVDD-WDTWK) and multiclass support vector machines with weighted dynamic time warping kernel function (MSVM-WDTWK), which provides a flexible and robust kernel function for time series classification between non-aligned time series data resulting in improved accuracy. The proposed WDTW kernel function provides an optimal match between two time series data by not only allowing a non-linear mapping between two data sequences, but also considering relative significance depending on the phase difference between points on time series data. We validate the proposed approaches using extensive numerical experiments on a number of multiclass UCR time series data mining archive, and demonstrate that our proposed methods provide lower classification error rates compared with existing techniques.

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


Nonmigratory multiprocessor scheduling for response time and energy Energy usage has been an important concern in recent research on online job scheduling, where processors are allowed to vary the speed dynamically so as to save energy whenever possible. Providing good quality of service such as response time (flowtime) and conserving energy are conflicting objectives. An interesting problem for scheduling is how to optimize an economic trade-off of flowtime and energy. To this end, the past two years have witnessed significant progress in the single-processor setting, and online algorithms with performance close to optimal have been obtained. In this paper, we extend the study of optimizing the trade-off between flowtime and energy to the multiprocessor setting. We devise and analyze a simple nonmigratory online algorithm that makes use of the classified round-robin (CRR) strategy to dispatch jobs. Even in the worst case, its performance is within O(log P) times of the optimal migratory offline algorithm, where P is the ratio of the maximum job size to the minimum job size. Technically speaking, this online result stems from a nontrivial solution to an offline problem of eliminating migration, which is also interesting by itself.

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

analysis of algorithms and problem complexity


Design tool for estimation of buffer requirement for enhanced reductive dechlorination of chlorinated solvents in groundwater To assist in the design of enhanced reductive dechlorination systems for in situ remediation of chlorinated solvent source zones, the software BUCHLORAC (BUffering of deCHLORination ACidity) was developed to predict the amount of buffer required to maintain the groundwater pH in a DNAPL treatment zone within the optimal range for dechlorinating bacteria. Reductive dechlorination is an acid-forming process with hydrochloric acid and organic acids typically building up in the treatment zone. Remediation of source zones is associated with such extensive localized dechlorination that it may be common for the soils' natural buffering capacity to be exceeded. As groundwater acidification may inhibit the activity of dechlorinating microorganisms and thus slow or stall the remediation process, sufficient alkalinity must be present to maintain a near-neutral pH. BUCHLORAC is a Windows Graphical Interface based on an abiotic geochemical model that is implemented through the program PHREEQC. BUCHLORAC allows users to estimate the buffer requirements for their specific operating and design conditions including, for example, site water chemistry, mineralogy, amount of chlorinated solvent to be degraded, design inhibition pH, and type of organic substrate and buffering additive.

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

alkalinity dechlorination phreeqc buchlorac remediation dnapl

bicarbonate
dehalogenation
tce
pce
contaminated aquifer


A Fast Algorithm for Searching All Multi-State Minimal Cuts Evaluating network reliability is an important topic in planning, designing, and control of systems. Many real-world systems are limited-flow (multi-state) networks composed of multi-state components, and their reliabilities can be computed in terms of minimal cut (Me) vectors to level d (named d-MC). A straightforward exact algorithm is presented here. The idea is to find all d-MC prior to calculating the limited-flow network reliability between the source, and the sink nodes (i.e. the one-to-one reliability), under the condition that all MC are known in advance. The proposed method is more efficient and effective compared to the existing algorithms in deleting the duplicate d-MC, verifying d-MC candidates, and finding the lower bounds of edge capacities in d-MC. The concepts of the proposed algorithm are novel, and first developed, followed by the analysis of associated computational complexities. Further, an example is provided to illustrate the generation of all d-MC, and verify that the obtained d-MC are not duplicated.

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

d-mc/mc
limited-flow (multi-state) network
perfect node
unreliable node


How organizational climate and structure affect knowledge managementThe social interaction perspective The main purpose of this study is to examine the effects of organizational climate and structure on knowledge management from the social interaction perspective. Regression analysis was used to test the hypotheses in a sample of 146 cases. The findings suggest that innovative and cooperative climate is positively related to social interaction; that when the organizational structure is less formalized, more decentralized and integrated, social interaction is more favorable; and that social interaction is positively related to knowledge management. These empirical evidences support the process-oriented view and indicate that social interaction plays the mediating role between organizational climate, organizational structure, and knowledge management.

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

knowledge management
social interaction
organizational climate
organizational structure


Quality of service provisioning through traffic engineering with applicability to IP-based production networks Production networks require the transport of high-quality multimedia traffic between outside broadcast vans and the main studio. This is typically done through dedicated terrestrial or satellite links, with bandwidth purchased from third party network providers, which is expensive and lacks flexibility. Given the emergence of IP networks and the Internet as the multi-service network of choice, it is plausible to consider their use for transporting production network traffic with high bandwidth and low delay and packet loss requirements. Emerging technologies for quality of service such as Differentiated Services and MPLS can be used for premium quality traffic. In this paper we try to use the emerging IP technologies to support services like production network traffic. We present a Traffic Engineering and Control System that starts from agreed services with customers and provisions the network according to the expected traffic demand so as to meet the requirements of contracted services while optimising the use of network resources. We devise a non-linear programming formulation of the problem and show through extensive simulations that we can achieve the objectives and meet the requirements of demanding production network traffic. Our solution is generic enough and not only tuned to production networks, so it can be used in other contexts for supporting services with stringent quality of service requirements. (C) 2002 Elsevier Science B.V. All rights reserved.

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

quality of service
traffic engineering
differentiated services
production networks


An analytic model for quantized discrete transform error Almost every method currently used in the technology of multimedia compression is based on and operates by some type of quantized discrete transform. Due to quantization, there is a difference between the data before and after such a transform usage that can be calculated simply as the (R)MSE (root-mean-square-error) of one to another. In this work, we model any such (R)MSE estimate as a function of the transform itself, which is assumed to be given by its square matrix, of the quantization given by an array of divisors and, finally, of the source data statistics, which are given by the data means and covariances. The model has been designed for one- and two-dimensional transforms and can be applied to any of them, including DCT (discrete cosine transform), DWT (discrete Walsh transform), DFT (discrete Fourier transform), and wavelets. Trial calculations performed for the DCT II, DCT I, biorthogonal DCT I, Haar and Walsh transforms show that the results are very close to those predicted by the model.

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

quantization error
quantization noise
roundoff error
roundoff noise


A variant of the particle swarm optimization for the improvement of fault diagnosis in industrial systems via faults estimation This paper proposes an approach for Fault Diagnosis and Isolation (FDI) on industrial systems via faults estimation. FDI is presented as an optimization problem and it is solved with Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO) algorithms. Also, is presented a study of the influence of some parameters from PSO and ACO in the desirable characteristics of FDI, i.e. robustness and sensitivity. As a consequence, the Particle Swarm Optimization with Memory (PSO-M) algorithm, a new variant of PSO was developed. PSO-M has the objective of reducing the number of iterations/generations that PSO needs to execute in order to provide a reasonable quality diagnosis. The proposed approach is tested using simulated data from a DC Motor benchmark. The results and analysis indicate the suitability of the approach as well as the PSO-M algorithm.

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

ant colony optimization
fault diagnosis
industrial systems
particle swarm optimization


A distributed spatial index for error-prone wireless data broadcast Information is valuable to users when it is available not only at the right time but also at the right place. To support efficient location-based data access in wireless data broadcast systems, a distributed spatial index (called DSI) is presented in this paper. DSI is highly efficient because it has a linear yet fully distributed structure that naturally shares links in different search paths. DSI is very resilient to the error-prone wireless communication environment because interrupted search operations based on DSI can be resumed easily. It supports search algorithms for classical location-based queries such as window queries and kNN queries in both of the snapshot and continuous query modes. In-depth analysis and simulation-based evaluation have been conducted. The results show that DSI significantly out-performs a variant of R-trees tailored for wireless data broadcast environments.

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

mobile computing
location-based query
wireless broadcast
error resilience


The evaluation of intelligent agent performance An example of B2C e-commerce negotiation Increasing demand for sophisticated software capable to collaborate, control, and organize all distributed activities has encouraged researchers in various disciplines to utilize and implement Intelligent Agent (IA). This paper develops a methodology to appraise performance of the IA and demonstrate the use in the B2C e-commerce negotiation process. An experiment was conducted to acquire empirical data and a survey was implemented to confirm advantage of the use of the IA. The computational results indicate that the proposed approach successfully evaluates IA performance and significantly distinguishes groups of using (vs. not using) the negotiation mechanism in B2C e-commerce.

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


the whips prototype for data warehouse creation and maintenance A data warehouse is a repository of integrated information from distributed, autonomous, and possibly heterogeneous, sources. In effect, the warehouse stores one or more materialized views of the source data. The data is then readily available to user applications for querying and analysis. Figure 1 shows the basic architecture of a warehouse: data is collected from each source, integrated with data from other sources, and stored at the warehouse. Users then access the data directly from the warehouse. As suggested by Figure 1, there are two major components in a warehouse system: the integration component , responsible for collecting and maintaining the materialized views, and the query and analysis component , responsible for fulfilling the information needs of specific end users. Note that the two components are not independent. For example, which views the integration component materializes depends on the expected needs of end users. Most current commercial warehousing systems (e.g., Redbrick, Sybase, Arbor) focus on the query and analysis component, providing specialized index structures at the warehouse and extensive querying facilities for the end user. In the WHIPS (WareHousing Information Project at Stanford) project, on the other hand, we focus on the integration component. In particular, we have developed an architecture and implemented a prototype for identifying data changes at heterogeneous sources, transforming them and summarizing them in accordance to warehouse specifications, and incrementally integrating them into the warehouse. We propose to demonstrate our prototype at SIGMOD, illustrating the main features of our architecture. Our architecture is modular and we designed it specifically to fulfill several important and interrelated goals: data sources and warehouse views can be added and removed dynamically; it is scalable by adding more internal modules; changes at the sources are detected automatically; the warehouse may be updated continuously as the sources change, without requiring down time; and the warehouse is always kept consistent with the source data by the integration algorithms. More details on these goals and how we achieve them are provided in [WGL + 96].

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

applications goals analysis project modular access user change component views systems users prototype maintenance architecture data demonstrate distributed effect query

examples
scalability
intern
collect
end-user
heterogeneity
informal
autonomic
indexing
information need
queries
data warehouse
consistency
algorithm
feature
repositories
integrability


Fast algorithm for multiplicative noise removal In this work, we consider a variational restoration model for multiplicative noise removal problem. By using a maximum a posteriori estimator, we propose a strictly convex objective functional whose minimizer corresponds to the denoised image we want to recover. We incorporate the anisotropic total variation regularization in the objective functional in order to preserve the edges well. A fast alternating minimization algorithm is established to find the minimizer of the objective functional efficiently. We also give the convergence of this minimization algorithm. A broad range of numerical results are given to prove the effectiveness of our proposed model. Crown Copyright (C) 2011 Published by Elsevier Inc. All rights reserved.

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

multiplicative noise
anisotropic total variation
maximum a posteriori
alternating minimization algorithm

convex function
proximal operator
gamma distribution
newton method


Curvilinear detailed routing with simultaneous wire-spreading and wire-fattening This paper describes an algorithm for curvilinear detailed routing. We significantly improved the average time performance of Gao's algorithm by resolving its bottleneck related to generation of fan-shaped forbidden regions along a wire. We also describe a method for simultaneous wire-spreading and wire-fattening, which consists of enlarging forbidden regions generated by the detailed routing algorithm as long as there remains any space through which wires can pass, From the experiments me obtained the result that the average CPU time of the detailed routing algorithm is almost linear to the length of a wire. Since the curvilinear detailed routing is efficient in terms of space usage, the proposed algorithm is important especially for densely mired printed circuit boards such as pin grid array packages, ball grid array packages, and multichip modules. We can also expect improvements on the electrical characteristics and the production yield by applying wire-spreading and mire-fattening to them.

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


Vertical alignment in monkeys with unilateral IV section: effects of prolonged monocular patching and trigeminal deafferentation We investigated monocular viewing and trigeminal (V) deafferentation on the vertical deviation (VD) in monkeys following intracranial IV section. Two monkeys wore a patch for four to six weeks, one over the paretic eye and the other over the normal eye following IV section. Two other monkeys had combined IV and V section with the paretic eye patched postlesion. In monkeys with IV section alone, the VD lessened within the first week postlesion but then increased gradually with the same eye still patched. Thus binocular viewing was unnecessary for the later VD increase. With combined IV and V section, the VD also transiently lessened postlesion. We have proposed that the decrease in VD after IV section is adaptive, driven by an error signal using ocular proprioception and efference copy. Since V section did not eliminate the early decrease in VD, we suggest some orbital afference is transmitted centrally via other cranial nerves. However, the later increase in VD suggests either that the proprioceptive effect cannot be sustained or that mechanical changes supervene to increase the VD.

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


Design for responsibility: safeguarding moral perception via a partnership architecture Advanced warfare technologies (AWT) create unprecedented capabilities to control the delivery of military force up to the point, some argue, that we are loosing humanity. But dependence on them generates difficult moral challenges impacting the decision-making process, which are only beginning to be addressed. In order to arrive at an informed opinion about the impact of AWT on decision-making, we need to know more about what AWTs are and how they operate. We provide a short overview of the different types of AWTs and discuss the key principles that underlie Humanitarian Law. We also discuss the impact of physical distance and increased levels of autonomy on AWT and discuss the challenges posed to moral perception. Before such systems can be deployed, we need to rest assured that their usage enhances, rather than undermines, human decision-making capacities. There are important choices to be made, and sound design is design for responsibility. As a solution, we therefore propose the partnership architecture that embeds concurrent views of the world and working agreements, ensuring that operators use appropriate information in the decision-making process.

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

moral perception
responsibility
working agreements

sensemaking
drones
unmanned systems
partnerships
humanmachine teamwork


a structural approach to quasi-static schedulability analysis of communicating concurrent programs We describe a system as a set of communicating concurrent programs. Quasi-static scheduling compiles the concurrent programs into a sequential one. It uses a Petri net as an intermediate model of the system. However, Petri nets generated from many interesting applications are not schedulable. In this paper, we show the underlying mechanism which causes unschedulability in terms of the structure of a Petri net. We introduce a Petri net structural property and prove unschedulability if the property holds. We propose a linear programming based algorithm to check the property, and prove the algorithm is valid. Our approach prove unschedulability typically within a second for Petri nets generated from industrial JPEG and MPEG codecs, while the scheduler fails to terminate within 24 hours.

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

quasi-static scheduling
structural analysis


Rigorous Hitting Times for Binary Mutations In the binary evolutionary optimization framework, two mutation operators are theoretically investigated. For both the standard mutation, in which all bits are flipped independently with the same probability, and the 1-bit-flip mutation, which flips exactly one bit per bitstring, the statistical distribution of the first hitting times of the target are thoroughly computed (expectation and variance) up to terms of order l (the size of the bitstrings) in two distinct situations: without any selection, or with the deterministic (1+1)-ES selection on the OneMax problem. In both cases, the 1-bit-flip mutation convergence time is smaller by a constant (in terms of l) multiplicative factor. These results extend to the case of multiple independent optimizers.

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

evolutionary algorithms
stochastic analysis
markov chains


Block transportation scheduling under delivery restriction in shipyard using meta-heuristic algorithms We consider a scheduling problem of block transportation under delivery restriction. We derive a mathematical model to minimize the penalty times that can cause delays in the overall block production schedule. We propose two meta-heuristic algorithms based on genetic algorithm (GA) and self-evolution algorithm (SEA). We evaluate the performances of the GA and SEA using several randomly generated examples.

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


MAC-aware routing metrics for the internet of things The development of the internet of things (IoT) has significantly affected the concept of wireless networking. As the number of wireless devices is rising, new medium access control (MAC) and routing protocols have been developed to guarantee end-to-end network performance. When existing layered solutions are stacked together, there might be detrimental effects on the overall network performance. In this paper, an analysis of MAC and routing protocols for IoT is provided with focus on the IEEE 802.15.4 MAC and the IETF RPL standards. It is shown that existing routing metrics do not account for the complex interactions between MAC and routing, and thus novel metrics are proposed. This enables a protocol selection mechanism for selecting the routing option and adapting the MAC parameters, given specific performance constraints. Extensive analytical and experimental results show that the behavior of the MAC protocol can hurt the performance of the routing protocol and vice versa, unless these two are carefully optimized together by the proposed method.

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


An Efficient Routing Mechanism in Network Simulation Simulation is widely recognized as an essential tool for analyzing large-scale networks. Routing is a key factor which impacts the simulation scale and efficiency. This paper presents a new approach to routing calculation, storage and lookup, named MTree_Nix routing. It maintains a variable number of spanning trees as the base routing table, and uses Nix-Vector routing to compute on demand the routing states that cannot be covered by any of the spanning trees. Theoretically, we obtain the constraint condition on the optimized trade-off between space and time in MTree_Nix routing. Integrated with the advantages of the current routing mechanisms, MTree_Nix comes to a better trade-off between the storage space for the routing tables and the CPU time for routing lookup. Experimental results show that, with a storage space of only about 1% more than Nix-Vector, MTree_Nix can reduce the simulation time to about 85% of that using Nix-Vector.

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


Imposing Constraints from the Source Tree on ITG Constraints for SMT In the current statistical machine translation (SMT), erroneous word reordering is one of the most serious problems. To resolve this problem, many word-reordering constraint techniques have been proposed. Inversion transduction grammar (ITG) is one of these constraints. In ITG constraints, target-side word order is obtained by rotating nodes of the source-side binary tree. In these node rotations, the source binary tree instance is not considered. Therefore, stronger constraints for word reordering can be obtained by imposing further constraints derived from the source tree on the ITG constraints. For example, for the source word sequence {a b c d}, ITG constraints allow a total of twenty-two target word orderings. However, when the source binary tree instance ((a b) (c d)) is given, our proposed "imposing source tree on ITG" (IST-ITG) constraints allow only eight word orderings. The reduction in the number of word-order permutations by our proposed stronger constraints efficiently suppresses erroneous word orderings. In our experiments with IST-ITG using the NIST MT08 English-to-Chinese translation track's data, the proposed method resulted in a 1.8-points improvement in character BLEU-4 (35.2 to 37.0) and a 6.2% lower CER (74.1 to 67.9%) compared with our baseline condition.

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

statistical machine translation
word reordering
itg constraints


an instruction-level functionally-based energy estimation model for 32-bits microprocessors The paper presents a novel strategy aimed at modeling the instruction energy consumption of 32-bits microprocessors. The proposed instruction-level pow er model is founded on a functional decomposition of the activities accomplished by a generic microprocessor and exhibits significant generalization capabilities. It allo ws estimation of the pow er figures of the en tire instruction-set starting from the analysis of a subset, as w ell as to po w er characterize new processors using the model obtained by considering other microprocessors.

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

decomposition
capabilities
energy consumption
microprocessor
analysis
energy
instruction
model
paper
generic

processor activation estimates strategies general


Preference disaggregation and statistical learning for multicriteria decision support: A review Disaggregation methods have become popular in multicriteria decision aiding (MCDA) for eliciting preferential information and constructing decision models from decision examples. From a statistical point of view, data mining and machine learning are also involved with similar problems, mainly with regard to identifying patterns and extracting knowledge from data. Recent research has also focused on the introduction of specific domain knowledge in machine learning algorithms. Thus, the connections between disaggregation methods in MCDA and traditional machine learning tools are becoming stronger. In this paper the relationships between the two fields are explored. The differences and similarities between the two approaches are identified, and a review is given regarding the integration of the two fields.

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

multiple criteria analysis
disaggregation analysis
preference learning


Evolving Static Representations for Task Transfer An important goal for machine learning is to transfer knowledge between tasks. For example, learning to play RoboCup Keepaway should contribute to learning the full game of RoboCup soccer. Previous approaches to transfer in Keepaway have focused on transforming the original representation to fit the new task. In contrast, this paper explores the idea that transfer is most effective if the representation is designed to be the same even across different tasks. To demonstrate this point, a bird's eye view (BEV) representation is introduced that can represent different tasks on the same two-dimensional map. For example, both the 3 vs. 2 and 4 vs. 3 Keepaway tasks can be represented on the same BEV. Yet the problem is that a raw two-dimensional map is high-dimensional and unstructured. This paper shows how this problem is addressed naturally by an idea from evolutionary computation called indirect encoding, which compresses the representation by exploiting its geometry. The result is that the BEV learns a Keepaway policy that transfers without further learning or manipulation. It also facilitates transferring knowledge learned in a different domain, Knight Joust, into Keepaway. Finally, the indirect encoding of the BEV means that its geometry can be changed without altering the solution. Thus static representations facilitate several kinds of transfer.

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

task transfer
evolutionary computation
indirect encoding


Bifurcation analysis of thin-walled plain channel compression members This paper presents a bifurcation analysis of thin-walled members subjected to uniform compression. The analysis uses an elastic non-linear finite strip buckling method to determine the flexural and torsional tangent rigidities of a section undergoing local buckling. The overall flexural and flexuraltorsional bifurcation loads are calculated using these tangent rigidities. The bifurcation analysis is applied to thin-walled plain channel columns having different cross-sectional dimensions. The boundary conditions of the columns are fixed at each end, where both minor and major axis rotations, as well as twist rotations and warping, are restrained. Bifurcation curves of the plain channel columns are presented in the paper. The failure modes of the columns include local buckling, overall flexural buckling and overall flexuraltorsional buckling. It is found that for some of the channel sections undergoing local buckling, the columns failed in flexural buckling, even though the critical buckling mode is flexuraltorsional according to the classical theory of thin-walled members for undistorted cross-sections. The elastic local buckling loads are also determined using a rational buckling analysis.

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

bifurcation analysis
local buckling
tangent rigidities

finite strip buckling analysis
steel structures
thin-walled structures


Interface simulation distances ? The classical (boolean) notion of refinement for behavioral interfaces of system components is the alternating refinement preorder. In this paper, we define a distance for interfaces, called interface simulation distance. It makes the alternating refinement preorder quantitative by, intuitively, tolerating errors (while counting them) in the alternating simulation game. We show that the interface simulation distance satisfies the triangle inequality, that the distance between two interfaces does not increase under parallel composition with a third interface, that the distance between two interfaces can be bounded from above and below by distances between abstractions of the two interfaces, and how to synthesize an interface from incompatible requirements. We illustrate the framework, and the properties of the distances under composition of interfaces, with two case studies.

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


An approach to multicore parallelism using functional programming: A case study based on Presburger Arithmetic Propose the use of Directed Acyclic Graph (DAG) model for multicore parallelism. Obtain good speedups for Cooper's algorithm and the Omega Test. The parallelization process is generic enough to apply to other tree algorithms. Similar results for parallelization of FourierMotzkin elimination would suffice.

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

multicore
parallelism
functional programming
presburger arithmetic


Video streaming applications in wireless camera networks: A change detection based approach targeted to 6LoWPAN Video streaming applications in wireless camera networks composed by low-end devices are attractive for enabling new pervasive high value services. When complying with the 6LoWPAN standard, the reduced amount of available bandwidth imposes the transmission of low resolution images. In this paper we present a low-complexity algorithm based on background subtraction and error resilience techniques aimed at reducing the transmission bandwidth of a video stream of uncompressed images thus permitting a higher frame rate. By means of realistic simulation studies, the performance of the presented algorithm is analyzed against state-of-the-art solutions like JPEG. These results can be considered for designing a next generation of smart cameras suited for 6LoWPAN.

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

wireless camera networks
6lowpan
jpeg
background subtraction

video surveillance
multimedia streaming
low-complexity
inter-frame compression
concealment


Iterative solutions to matrix equations of the form AiXBi=Fi A i X B i = F i ? This paper is concerned with the numerical solutions to the linear matrix equations A1XB1=F1 A 1 X B 1 = F 1 and A2XB2=F2 A 2 X B 2 = F 2 ; two iterative algorithms are presented to obtain the solutions. For any initial value, it is proved that the iterative solutions obtained by the proposed algorithms converge to their true values. Finally, simulation examples are given to verify the proposed convergence theorems.

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


Chemosensitizing acridones: In vitro calmodulin dependent cAMP phosphodiesterase inhibition, docking, pharmacophore modeling and 3D QSAR studies Calmodulin inhibitors have proved to play a significant role in sensitizing MDR cancer cells by interfering with cellular drug accumulation. The present investigation focuses on the evaluation of in vitro inhibitory efficacy of chloro acridones against calmodulin dependent cAMP phosphodiesterase (PDE1c). Moreover, molecular docking of acridones was performed with PDE1c in order to identify the possible protein ligand interactions and results thus obtained were compared with in vitro data. In addition an efficient pharmacophore model was developed from a set of 38 chemosensitizing acridones effective against doxorubicin resistant (HL-60/DX) cancer cell lines. Pharmacophoric features such as one hydrogen bond acceptor, one hydrophobic region, a positive ion group and three aromatic rings i.e., AHPRRR have been identified. Ligand based 3D-QSAR was also performed by employing partial least square regression analysis.

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


Theory and methodology for estimation and control of errors due to modeling, approximation, and uncertainty The reliability of computer predictions of physical events depends on several factors: the mathematical model of the event, the numerical approximation of the model, and the random nature of data characterizing the model. This paper addresses the mathematical theories, algorithms, and results aimed at estimating and controlling modeling error, numerical approximation error, and error due to randomness in material coefficients and loads. A posteriori error estimates are derived and applications to problems in solid mechanics 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

stochastic partial differential equations


Intermediate representations for design automation of multiprocessor DSP systems Self-timed scheduling is an attractive implementation style for multiprocessor DSP systems due to its ability to exploit predictability in application behavior, its avoidance of over-constrained synchronization, and its simplified clocking requirements. However, analysis and optimization of self-timed systems under real-time constraints is challenging due to the complex, irregular dynamics of self-timed operation. In this paper, we review a number of high-level intermediate representations for compiling dataflow programs onto self-timed DSP platforms, including representations for modeling the placement of interprocessor communication (IPC) operations; separating synchronization from data transfer during IPC; modeling and optimizing linear orderings of communication operations; performing accurate design space exploration under communication resource contention; and exploring alternative processor assignments during the synthesis process. We review the structure of these representations, and discuss efficient techniques that operate on them to streamline scheduling, communication synthesis, and power management of multiprocessor DSP implementations.

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

dataflow graphs
embedded systems
digital signal processing
self-timed scheduling


Multi-purpose process simulators The first part of this paper describes a multi-purpose dynamic simulator for the Heidrun oil production plant. The simulator integrates a commercial dynamic simulation model with the actual process control system to enable dynamic simulation, control system verification and operator training within the same framework and based on the same models and configuration data. The control system configuration can be imported directly into the simulator. This simplifies simulator maintenance and ensure consistency between the simulator and the real plant. The entire system runs on standard Unix work stations. The simulator has so far been used for initial operator training, control system verification and controller tuning. The last part of the paper describes how the simulator architecture can be generalized and some aspects of how new developments in product modelling will influence the use of dynamic simulation in the future.

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


An information processing perspective on divergence and convergence in collaborative learning This paper presents a model of collaborative learning that takes an information processing perspective of learning by social interaction. The collaborative information processing model provides a theoretical basis for understanding learning principles associated with social interaction and explains why peer-to-peer discussion is potentially more effective than instructor-student discussion. The model explains information divergence as a key process for collaborative learning and information convergence as a key group process for addressing specific learning outcomes.

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

learning
information processing
divergence
convergence
social interaction

collaboration
cscl
collaborative learning
cooperative learning
online discussion
group learning
learning theory


Codoping studies of physical vapor phase deposition of SrS : Cu A series of charge compensation investigations on SrS:Cu grown by physical vapor phase are reported. In this study, the trivalent ion, Y, was codoped during SrS growth to substitute on the Sr-site. Although similar Fl, performance to high temperature annealed sputtered samples was obtained using an annealing temperature of 650 degrees C, our results indicated that the thermal quenching in this material could only be reduced by charge compensation codoping. Preliminary results show that at 300 K the brightness of SrS:Cu, Y was only 15% less than at 10 K. From temperature dependent FL, and high resolution PLE, the physical properties of the defect and the defect reduction mechanisms are determined. (C) 2000 Elsevier Science B.V. All rights reserved.

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


Structure from motion with wide circular field of view cameras This paper presents a method for fully automatic and robust estimation of two-view geometry, autocalibration, and 3D metric reconstruction from point correspondences in images taken by cameras with wide circular field of view. We focus on cameras which have more than 180 degrees field of view and for which the standard perspective camera model is not sufficient, e. g., the cameras equipped with circular fish-eye lenses Nikon FC-E8 (183 degrees), Sigma 8mm-f4-EX (180 degrees), or with curved conical mirrors. We assume a circular field of view and axially symmetric image projection to autocalibrate the cameras. Many wide field of view cameras can still be modeled by the central projection followed by a nonlinear image mapping. Examples are the above-mentioned fish-eye lenses and properly assembled catadioptric cameras with conical mirrors. We show that epipolar geometry of these cameras can be estimated from a small number of correspondences by solving a polynomial eigenvalue problem. This allows the use of efficient RANSAC robust estimation to find the image projection model, the epipolar geometry, and the selection of true point correspondences from tentative correspondences contaminated by mismatches. Real catadioptric cameras are often slightly noncentral. We show that the proposed autocalibration with approximate central models is usually good enough to get correct point correspondences which can be used with accurate noncentral models in a bundle adjustment to obtain accurate 3D scene reconstruction. Noncentral camera models are dealt with and results are shown for catadioptric cameras with parabolic and spherical mirrors.

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

omnidirectional vision
fish-eye lens
catadioptric camera


Tracking and Predicting Barge Locations on Inland Waterways In efforts to improve efficiency, safety, and security, several groups involved in inland waterway navigation have an interest in improving tracking of barges moving on waterways. Automated tracking devices have inherent limitations, and there is a need to predict locations over the next several hours. This paper presents a nonlinear, probabilistic prediction model developed and implemented to track spatial location and other navigation characteristics of a barge traveling on the inland waterway system. A prefilter to check the validity of the measurements, a nonlinear speed estimation process, and a Kalman filter to predict the navigation solution of the barge are developed in this work. Due to the complex dynamics involved in the barge navigation system, a nonlinear stochastic model was developed in state space to represent the process and measurement processes. The algorithm was verified using actual measurements obtained from multiple barges on multiple rivers acquired from different sensors. The results show a reliable and robust prediction algorithm for tracking inland waterway barges. DOI: 10.1061/(ASCE)CP.1943-5487.0000191. (C) 2013 American Society of Civil Engineers.

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

marine navigation
predicting and tracking barges
kalman filtering
locally weighted polynomials
inverse distance function
transportation systems modeling


Modeling of hydraulic turbine systems based on a Bayesian-Gaussian neural network driven by sliding window data In this paper, a novel Bayesian-Gaussian neural network (BGNN) is proposed and applied to on-line modeling of a hydraulic turbine system (HTS). The new BGNN takes account of the complex nonlinear characteristics of HTS. Two redefined training procedures of the BGNN include the off-line training of the threshold matrix parameters, optimized by swarm optimization algorithms, and the on-line BGNN predictive application driven by the sliding window data method. The characteristics models of an HTS are identified using the new BGNN method and simulation results are presented which show the effectiveness of the BGNN in addressing modeling problems of HTS.

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

hydraulic turbine
modeling
sliding window data


Understanding aspects of pilgrimage using social networks derived from smartphones The Hajj pilgrimage to Makkah and Madinah is one of the biggest annual events in the world, where millions of people congregate for religious rituals over several days. The main challenge for organizers and participants is to ensure a smooth flow through the activities and a safe, healthy and spiritual journey during the pilgrimage. A deep knowledge of how the pilgrims behave during this event is a precondition for improving these issues. One approach to understand the behaviors of pilgrims is a social network analysis based on spatial proximity information. In this work we use a proximity system to identify pilgrims social networks and apply social network analysis to (i) estimate the experience level of the pilgrims and differentiate leaders from followers, (ii) observe how groups of pilgrims are created around prayers and (iii) identify density peaks and recognize changes in group formation over time. The suggested proximity system is created by merging ANT+ and Bluetooth, two inhomogeneous peer-to-peer systems. Merging is facilitated by using (i) social rules of pilgrims, (ii) existing wearable devices and (iii) GPS location information. Proposed methods are applied on data collected from 41 participants during their 8 day pilgrimage.

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

social network analysis
smartphones
pilgrimage
proximity
bluetooth


An adaptive delay and synchronization control scheme for Wi-Fi based audio/video conferencing The prevalence of the IEEE 802.11b technology has made Wi-Fi based Audio/Video (AV) conferencing applications a viable service. However, due to the "best-effort" transport service and other unpredictable factors such as user mobility, location and background traffic, the transport channel behavior often fluctuates drastically. It thus becomes rather difficult to configure an appropriate de-jitter buffer to maintain the temporal fidelity of the AV presentation. We propose in this paper an adaptive delay and synchronization control scheme for AV conferencing applications over campus-wide WLANs. Making use of a distributed timing mechanism, the scheme monitors the synchronization errors and estimates the delay jitters among adjacent Media Data Units (MDUs) in real-time. It piece-wisely controls the equalization delay to compensate for the delay jitters experienced by MDUs in a closed-loop manner. We investigate the performance of the proposed scheme through trace-driven simulations. We collected network traces from a production campus-wide IEEE 802.11b WLAN by emulating real conferencing sessions. Simulation results show that the scheme is capable of dynamically balancing between synchronization requirements and latency requirements in all scenarios. Small synchronization phase distortions, low MDU loss percentages and low average end-to-end delay can be achieved simultaneously. In particular, compared with solutions using a static setting, the proposed scheme is able to achieve a reduction of around 100ms in end-to-end delay with the same amount of MDU losses under some media-unfriendly situations.

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

av conferencing
adaptive delay
synchronization control


mobile robot for personal exercise training in ubiquitous healthcare environment This paper proposes a personalized fitness system using mobile robot technology. The fitness robot plays a role of personal health trainer, monitoring and guiding personal exercise with its health knowledge and communication ability. We expect that the interactive and familiarity features of the robot motivate and increase efficiency of personal exercise programs in u-health environment.

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

ubiquitous healthcare
mobile robot
exercise training


Explaining the inhibition of cyclin-dependent kinase 5 by peptides derived from p25 with molecular dynamics simulations and MM-PBSA A cyclin-dependent kinase (CDK) 5 inhibitory peptide (CIP) from p25 was recently reported to inhibit CDK5/p25 activity in vitro but had no effect on endogenous cdc2 kinase activity. This may lead to a specific CDK5 inhibition strategy in the treatment of neurodegeneration. However, the mechanism of the inhibition remains unclear. In this work, molecular dynamics simulations and energy decomposition calculation models were set up to investigate the deregulation mechanisms of CIP on CDK5 activity. The results show that truncation of the N, and C terminals of p25 introduces important conformational changes into a hydrophobic pocket that is crucial for accommodating Ile153 on the activation loop of CDK5. In addition, such truncations lead to distortion and displacement of the activation loop and consequently affect binding of the substrate peptide. New inhibition sites for selectively inhibiting the activity of CDK5 are also suggested.

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

molecular dynamics simulations
inhibition
energy decomposition


Using Decision Tree Classifiers in Source Code Analysis to Recognize Algorithms: An Experiment with Sorting Algorithms We discuss algorithm recognition (AR) and present a method for recognizing algorithms automatically from Java source code. The method consists of two phases. In the first phase, the recognizable algorithms are converted into the vectors of characteristics, which are computed based on static analysis of program code, including various statistics of language constructs and analysis of Roles of Variables in the target program. In the second phase, the algorithms are classified based on these vectors using the C4.5 decision tree classifier. We demonstrate the performance of the method by applying it to sorting algorithms. Using leave-one-out cross-validation technique, we have conducted an experimental evaluation of the classification performance showing that the average classification accuracy is 98.1% (the data set consisted of five different types of sorting algorithms). The results show the applicability and usefulness of roles of variables in AR, and illustrate that the C4.5 algorithm is a suitable decision tree classifier for our purpose. The limitations of the method are also discussed.

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

algorithm recognition
decision tree classifier
roles of variables


Matrix-based robust joint fingerprinting and decryption method for multicast distribution of multimedia A new joint fingerprinting and decryption method has been proposed. The method uses a matrix-based cipher for fingerprinting on the receiver side. Imperceptibility of embedded fingerprints has been achieved. Embedded fingerprints have been tested against collusion attacks and compression. The proposed fingerprinting method has high robustness against collusion attacks.

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

multimedia distribution
joint fingerprinting and decryption
collusion attack
traitor tracing


The marketplace of high-performance computing In this paper we analyze the major trends and changes in the High-Performance Computing (HPC) market place since the beginning of the journal `Parallel Computing'. The initial success of vector computers in the 1970s was driven by raw performance. The introduction of this type of computer systems started the area of `Supercomputing'. In the 1980s the availability of standard development environments and of application software packages became more important. Next to performance these factors determined the success of MP vector systems, especially at industrial customers. MPPs became successful in the early 1990s due to their better price/performance ratios, which was made possible by the attack of the `killer-micros'. In the lower and medium market segments the MPPs were replaced by microprocessor based symmetrical multiprocessor (SMP) systems in the middle of the 1990s. There success formed the basis for the use of new cluster concepts for very high-end systems. In the last few years only the companies which have entered the emerging markets for massive parallel database servers and financial applications attract enough business volume to be able to support the hardware development for the numerical high-end computing market as well. Success in the traditional floating point intensive engineering applications seems to be no longer sufficient for survival in the market.

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

high-performance computing
supercomputer market
hpc technology
supercomputer technology


PHYSALIS: a new method for particle flow simulation. Part III: convergence analysis of two-dimensional flows In this paper, we study the convergence property of PHYSALIS when it is applied to incompressible particle flows in two-dimensional space. PHYSALIS is a recently proposed iterative method which computes the solution without imposing the boundary conditions on the particle surfaces directly. Instead, a consistency equation based on the local (near particle) representation of the solution is used as the boundary conditions. One of the important issues needs to be addressed is the convergence properties of the iterative procedure. In this paper, we present the convergence analysis using Laplace and biharmonic equations as two model problems. It is shown that convergence of the method can be achieved but the rate of convergence depends on the relative locations of the cages. The results are directly related to potential and Stokes flows. However, they are also relevant to NavierStokes flows, heat conduction in composite media, and other problems.

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


On some classes of almost automorphic functions and applications to fractional differential equations We study in this paper the properties of C(n) C ( n ) -almost automorphic and asymptoticallyC(n) C ( n ) -almost automorphic functions (a new concept) with values in a Banach space. We then give a new result related to the existence and uniqueness of an asymptotically almost automorphic solution of a semilinear fractional differential equation of the form D?x(t)=Ax(t)+F(t,x(t),Bx(t)) D ? x ( t ) = A x ( t ) + F ( t , x ( t ) , B x ( t ) ) with t?R,0<?<1 t ? R , 0 < ? < 1 , where A A generates a family of ? ? -resolvent family S?(t) S ? ( t ) and f f satisfies some Lipschitz conditions.

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

c(n) c ( n ) -almost automorphic functions c(n) c ( n ) c(n) c ( n ) c ( n )

asymptotically almost automorphic functions


Fuzzy controllers as gain scheduling approximators Nonlinear systems can be linearized according to Lyapunov's linearization method and then approximated by Takagi/Sugeno (TS) fuzzy models. The paper shows that the corresponding control strategy with TS controllers is closely related to traditional gain scheduling. Generally speaking, gain scheduling deals with the connection of different linear controllers acting as a global nonlinear control law. TS control defines a linear controller for each linearized region, as well as smooth control transitions between those regions. In this connection slowly varying operating conditions are assumed. For the design of the linear controllers the LPR design method has been used which guarantees optimal control of a linearized system with respect to an integral criterion. However, since TS control is an approximation method, solutions are bound to be suboptimal, and stability is hence a concern. The method is compared with a continuous change of control parameters, based on the continuous (on-line) LQR design for each point in state space. Additional control rule weights have been introduced to promote optimization. The above method is illustrated by a simple one-link manipulator arm.

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


On implementing symmetry detection Automatic symmetry detection has received a significant amount of interest, which has resulted in a large number of proposed methods. This paper reports on our experiences while implementing the approach of Puget (CP2005, LNCS, vol. 3709, pp. 475-489. Springer, 2005). In particular, it proposes a modification to the approach to deal with general expressions, discusses the insights gained, and gives the results of an experimental evaluation of the accuracy and efficiency of the approach.

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


A perceptual macroblock layer power control for energy scalable video encoder based on just noticeable distortion principle In most mobile video encoding systems, long battery life and high performance video encoding are competing design goals. This paper proposed a Macroblock (MB) level perceptual energy scalable video encoding method noted as PMP-ESVE, in which just noticeable distortion (JND) model is introduced as the perceptual cue. PMP-ESVE includes three parts, first, PMP-ESVE can dynamic adapt the variable energy resource budget in MB level, second, PMP-ESVE jointly consider the available energy resource and the perceptual feature in order to provide a MB level scalable video encoding method under variable energy consumption budget. Third, JND model, which refers to the maximum distortion that human visual system cannot perceive, is extended from spatial domain to temporal domain so as to determine perceptual cue in unit of MB. This provides the guideline of resource allocation in MB's. Finally, both objective and subjective quality evaluations are given to evaluate the proposed method. These experimental results demonstrate the efficiency of the proposed approach. (C) 2010 Elsevier Ltd. All rights reserved.

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

power control
just noticeable distortion


On free vibration analysis of thin-walled beams with nonsymmetrical open cross-sections This work relates to the analysis of triply coupled vibrations of thin-walled beams having nonsymmetrical open cross-sections. The governing differential equations for coupled bending and torsional vibrations are derived and solved exactly. A recent study on the same subject is criticized and discussed in theoretical and numerical aspects.

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


Discover binding pathways using the sliding binding-box docking approach: application to binding pathways of oseltamivir to avian influenza H5N1 neuraminidase Drug binding and unbinding are transient processes which are hardly observed by experiment and difficult to analyze by computational techniques. In this paper, we employed a cost-effective method called "pathway docking" in which molecular docking was used to screen ligand-receptor binding free energy surface to reveal possible paths of ligand approaching protein binding pocket. A case study was applied on oseltamivir, the key drug against influenza a virus. The equilibrium pathways identified by this method are found to be similar to those identified in prior studies using highly expensive computational approaches.

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

influenza h5n1 neuraminidase docking oseltamivir


Interactive visual analysis of contrast-enhanced ultrasound data based on small neighborhood statistics Contrast-enhanced ultrasound (CEUS) has recently become an important technology for lesion detection and characterization in cancer diagnosis. CEUS is used to investigate the perfusion kinetics in tissue over time, which relates to tissue vascularization. In this paper we present a pipeline that enables interactive visual exploration and semi-automatic segmentation and classification of CEUS data. For the visual analysis of this challenging data, with characteristic noise patterns and residual movements, we propose a robust method to derive expressive enhancement measures from small spatio-temporal neighborhoods. We use this information in a staged visual analysis pipeline that leads from a more local investigation to global results such as the delineation of anatomic regions according to their perfusion properties. To make the visual exploration interactive, we have developed an accelerated framework based on the OpenCL library, that exploits modern many-cores hardware. Using our application, we were able to analyze datasets from CEUS liver examinations, being able to identify several focal liver lesions, segment and analyze them quickly and precisely, and eventually characterize them.

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

medical visualization
contrast-enhanced ultrasound


node autonomy in distributed systems The goal of this paper is to explore the notion of node autonomy in distributed computer systems. Some motivations for autonomy are exposed. Different facets of autonomy as well as relationships among them are discussed. Finally, we look into how autonomy affects other aspects of distributed computing, including timeliness, correctness, load sharing, data sharing, and data replication.

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

sharing
relationships
autonomy
systems
correctness
paper
distributed
data replication

data sharing
aspect
affect
motivation
computation
distributed computation
distributed systems
exploration


exploring multimedia in a keyword space We address the problem of searching multimedia by semantic similarity in a keyword space. In contrast to previous research we represent multimedia content by a vector of keywords instead of a vector of low-level features. This vector of keywords can be obtained through user manual annotations or computed by an automatic annotation algorithm. In this setting, we studied the influence of two aspects of the search by semantic similarity process: (1) accuracy of user keywords versus automatic keywords and (2) functions to compute semantic similarity between keyword vectors of two multimedia documents. We consider these two aspects to be crucial in the design of a keyword space that can exploit social-media information and can enrich applications such as Flickr and YouTube. Experiments were performed on an image and a video dataset with a large number of keywords, with different similarity functions and with two annotation methods. Surprisingly, we found that multimedia semantic similarity with automatic keywords performs as good as or better than 95\% accurate user keywords.

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

applications video flickr design youtube user research search multimedia influence accuracy space exploit annotation process image similarity algorithm

automatic keyword annotations
computation
addressing
experience
informal
social media
exploration
contention
aspect
method
vectorization
keyword spaces
user keyword annotations
feature
documentation
semantic-similarity


Spatial microsimulation modelling for retail market analysis at the small-area level The purpose of this study is to construct a spatial microsimulation model known as the spatial microsimulation approach for retail market analysis (SMARMA) in order to analyse the retail market at the small-area level in Kusatsu City, Shiga Prefecture, Japan. In this study, we focus on examining the following issues. First, we attempt to create synthetic household microdata from a consumer questionnaire survey using both reweighting and imputation approaches. Second, we present the manner in which the results of the spatial microsimulation model are used for market analysis with regard to grocery stores. Market shares, turnover ranking and detailed consumer characteristics for selected stores are examined. In particular, the spatial distributions of households and their shopping behaviour are discussed in order to identify variations in consumer characteristics. As a result, this study shows that a spatial microsimulation model can generate detailed and reliable synthetic microdata from a consumer questionnaire survey. Besides, it is confirmed that this model is a highly relevant approach for implementing market analysis at the small-area level.

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

spatial microsimulation
retail market analysis
synthetic household microdata
kusatsu city

iterative proportional fitting
simulated annealing


Genetics of Healthy Aging in Europe The aim of the 5-year European Union (EU)-Integrated Project GEnetics of Healthy Aging (GEHA), constituted by 25 partners (24 from Europe plus the Beijing Genomics Institute from China), is to identify genes involved in healthy aging and longevity, which allow individuals to survive to advanced old age in good cognitive and physical function and in the absence of major age-related diseases. To achieve this aim a coherent, tightly integrated program of research that unites demographers, geriatricians, geneticists, genetic epidemiologists, molecular biologists, bioinfomaticians, and statisticians has been set up. The working plan is t

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


Lukasiewicz transform and its application to compression and reconstruction of digital images We define the Lukasiewicz transform as a residuated map and a homomorphism between semimodules over the sem-ring reducts of an MV-algebra. Then we describe the "Lukasiewicz Transform Based" (LTB) algorithm for image processing, demonstrating its applicability. (c) 2006 Elsevier Inc. 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

mv-algebras
many valued logic
fuzzy relation equations
residuated maps


breach of internet privacy through the use of cookies This paper describes the issue of invasion of privacy on the Internet using the techniques of cookies, as subtle means to commit such a crime. The issue of data privacy and information of millions of internet users becomes increasingly critical in terms of maintaining social order, for large corporations that dominate the World Wide Web is one of the main beneficiaries of these illegal practices that are happening daily.

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


Incremental Satisfiability and Implication for UTVPI Constraints Unit two-variable-per-inequality (UTVPI) constraints form one of the largest class of integer constraints that are polynomial time solvable (unless P = NP). There is considerable interest in their use for constraint solving, abstract interpretation, spatial database algorithms, and theorem proving. In this paper we develop new incremental algorithms for UTVPI constraint satisfaction and implication checking that require @(m + n log n + p) time and @(n + m + p) space to incrementally check satisfiability of m UTVPI constraints on n variables, and we check the implication of p UTVPI constraints. The algorithms can be straightforwardly extended to create nonincremental implication checking and generation of all (nonredundant) implied constraints, as well as generate minimal unsatisfiable subsets and minimal implicants.

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


A modified mountain clustering algorithm In this paper, we modify the mountain method and then create a modified mountain clustering algorithm. The proposed algorithm can automatically estimate the parameters in the modified mountain function in accordance with the structure of the data set based on the correlation self-comparison method. This algorithm can also estimate the number of clusters based on the proposed validity index. As a clustering tool to a grouped data set, the modified mountain algorithm becomes a new unsupervised approximate clustering method. Some examples are presented to demonstrate this algorithms simplicity and effectiveness and the computational complexity is also analyzed.

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

mountain method
modified mountain algorithm
validity index

parameter estimation
unsupervised clustering


The e-commerce value matrix and use case model: A goal-driven methodology for eliciting B2C application requirements We developed a goal-driven methodology for eliciting and modeling the requirements of a business-to-consumer application. It has two phases: e-commerce strategy formulation and eliciting system requirements. In the first phase, an EC value matrix is used to develop a strategy and value-adding services for a business and then necessary customized requirements are identified. In the second phase, a goal-driven approach is used to specify the system requirements based on the strategy. This methodology enables business managers and system developers to develop high-level strategies that improve value activities and obtain competitive advantage, and thereby determine the specifications of the core e-services. To illustrate the methodology, we use a B2C application of an online bookstore. Finally, implications and conclusions are discussed.

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

electronic commerce
application development
goal-driven methodology


Generalization of Bullen-Simpson's 3/8 inequality Generalization of Bullen-Simpson's 3/8 inequality for (2r)-convex functions is given, by using some Euler-type identities. A number of inequalities, for functions whose derivatives are either functions of bounded variation or Lipschitzian functions or functions in L-p-spaces, are proved. (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 B I I I O B I O O O O O O O O O O O O O

functions of bounded variation
lipschitzian functions

bullen-simpson's 3/8 inequality
quadrature formulae


EVALUATION MEASURES FOR COMPUTER-BASED INFORMATION-SYSTEMS In this paper, we present a possible benchmark for assessing the validity of information system (IS) evaluation techniques. Drawing exhaustively from the IS evaluation literature, we have consolidated a short-form measure of implementation success. This has been tested in the field. The arguments that we present will be of considerable interest to IS evaluation researchers and project managers who have to cope with the lack of standard and structured practices in measuring implementation success.

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

systems development life-cycle
performance evaluation
management


An adaptive parallel route construction heuristic for the vehicle routing problem with time windows constraints Vehicle routing problem with time windows (VRPTW) is a generalisation of the classical vehicle routing problem, where a group of customers with given capacity demand are required to be serviced, and the servicing of the customer demands has to be started within a restricted available time window at the customer locations. This class of routing problems can be used to solve many practical problems such as container truck routing, delivery service scheduling and many logistics system problems. In this paper, we present a route construction heuristic with an adaptive parallel scheme. The result from extensive computation experiments shows the proposed parallel route construction heuristic is efficient and effective for routes construction, which is particularly useful for generation of the initial solutions for many metaheuristic approaches with improved solution quality and convergence of the solution process. (C) 2011 Elsevier Ltd. All rights reserved.

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

vehicle routing
route construction
time windows