Conditioning on MV-algebras and additive measures .1. We present a lattice-ordered semigroup approach for the foundation of conditional events which covers the special situations where the underlying (unconditional) events are Boolean or fuzzy, respectively. Our proposal is quite different from other, ring theoretical, approaches. The problem of extending additivity of uncertainty measures from unconditional to conditional events will be discussed. (C) 1997 Elsevier Science B.V.

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

conditional events
uncertainty measures
additive measures

lattice ordered semigroups
mv-algebras
boolean algebras
connectives
fuzzy sets


Monotonic solutions of Urysohn integral equation on unbounded interval In this paper, we investigate a nonlinear Urysohn integral equation on unbounded interval. We show that under some assumptions that the equation has monotonic solutions belonging to the space of functions being Lebesgue integrable on unbounded interval. The main tool used in our study is the technique associated with measures of weak noncompactness and measures of noncompactness in strong sense. (C) 2004 Elsevier Ltd. All rights reserved.

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

measure of noncompactness
compactness in measure
weak sequential continuity


A new adaptive filtering subband algorithm for two-channel acoustic noise reduction and speech enhancement ? We propose a new subband implementation of the Forward BSS algorithm. We propose a new two-channel criterion combination adapted to the proposed FBSS algorithm. The proposed FBSS algorithm is used to separate speech form noise and therefore enhance the speech signal intelligibility. The proposed algorithm improves the convergence speed of the cross adaptive filters which are used by the FBSS algorithm.

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

subband structure
snr factor
mismatch criterion
optimal mse
cepstral distortion


acm workshop on mobile cloud media computing Smart mobile devices such as camera phones typically will be carried by people all the time. These devices are true "multimedia" devices that acquire, process, transmit and present text, image, video and audio data. However, due to the limitations in hardware and networking, multimedia applications and systems have not been adequately supported on mobile devices. With the recent developments mobile hardware, wireless network, and cloud computing, it is now the prime time for us to realize intelligent mobile device centered multimedia applications with the support of a cloud computing platform. The focus of this workshop is on exploring challenges and opportunities of intelligent multimedia technologies, applications and systems on mobile devices, especially when a media cloud computing platform can be appropriately leveraged.

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


Contract analysis: A performance measures and profit evaluation within two-echelon supply chains Coordination is regarded as key in managing dependencies between distinctive members of a supply chain through the benefits of coordination mechanisms. Such coordination mechanisms are contracts, implemented to increase total supply chain profit, reduce costs and share risk among supply chain members. However, by contract implementation the retailer is constrained in his purchase by bearing the entire risk of holding the inventory (wholesale price contract) or by limited risk allocated to the supplier (buyback, revenue sharing and quantity flexibility contracts). By implementing an advanced purchase system the risk of inventory is fairly divided between the supplier and the retailer. In order to observe inventory implications on the supply chain bottom line, this article is directed towards the evaluation of performance measures and supply chain profit behavior under buyback, revenue sharing, quantity flexibility and advanced purchase discount contracts versus no coordination and wholesale price systems. (C) 2012 Elsevier Ltd. All rights reserved.

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

supply chain coordination
to-level supply chain


A Simple Universal Turing Machine for the Game of Life Turing Machine A universal Turing Machine for Conway's Game of Life is presented. The use of the open source program Golly in the process of building and programing this machine is described.

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


Systems usability framework for evaluating tools in safetycritical work This paper presents a methodology with which evaluation of control rooms in safetycritical industry has been carried out. The results of two cases of evaluation in nuclear power plants (NPP) are presented to elaborate the method thoroughly. The evaluation methodology draws from conventions of human factors and usability evaluation methods but adds an activity theoretical viewpoint by considering different control room functions in a purposeful activity system. A control room has three functions in an activity: instrument, psychological tool, and a communicative tool. The introduced evaluation approach allows understanding of quality of the control room on the level of outcomes it produces, work practices that it consolidates, and the user experience it creates. The evaluation approach is demonstrated by presenting baseline evaluations of two hybrid NPP control rooms that were carried out before major upgrade projects were implemented. Hybrid control room refers to a state in which modern and original hardwired technological solutions are in use simultaneously.

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

activity theory
contextual approach
process control


Chance discovery and learning minority classes Chances are viewed in chance discovery as events/situations with significant impact on human decision making. In this research context we are particularly interested in a subset of chances that are unexpected or contradictory with human common knowledge, and the human role that we consider as an essential factor in finding such chances. We first introduce the method LUPC that can learn minority classes from large unbalanced datasets. With its visualization tools as well its exclusive and inclusive constraints, LUPC allows the user to actively participate in and to incorporate background knowledge in the chance discovery process. We then present case studies in which LUPC is used to support the user in discovering significant unexpected chances from stomach cancer and hepatitis databases.

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

learning minority class
domain knowledge
medical data


Multiresolution gray-scale and rotation invariant texture classification with local binary patterns This paper presents a theoretically very simple, yet efficient, multiresolution approach to gray-scale and rotation invariant texture classification based on local binary patterns and nonparametric discrimination of sample and prototype distributions. The method is based on recognizing that certain local binary patterns, termed "uniform," are fundamental properties of local image texture and their occurrence histogram is proven to be a very powerful texture feature. We derive a generalized gray-scale and rotation invariant operator presentation that allows for detecting the "uniform" patterns for any quantization of the angular space and for any spatial resolution and presents a method for combining multiple operators for multiresolution analysis. The proposed approach is very robust in terms of gray-scale variations since the operator is, by definition, invariant against any monotonic transformation of the gray scale. Another advantage is computational simplicity as the operator can be realized with a few operations in a small neighborhood and a lookup table. Excellent experimental results obtained in true problems of rotation invariance, where the classifier is trained at one particular rotation angle and tested with samples from other rotation angles, demonstrate that good discrimination can be achieved with the occurrence statistics of simple rotation invariant local binary patterns. These operators characterize the spatial configuration of local image texture and the performance can be further improved by combining them with rotation invariant variance measures that characterize the contrast of local image texture. The joint distributions of these orthogonal measures are shown to be very powerful tools for rotation invariant texture analysis.

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

nonparametric
texture analysis
histogram
contrast


An asymptotic theory for nonlinear functional differential equations The Hartman-Wintner theorem on asymptotic integration is established for a certain class of functional differential equations with nonlinear perturbations, by looking them as abstract ordinary differential equations. Results for delay differential equations are included in this study. Consequences and applications are also shown. (C) 2002 Elsevier Science Ltd. All rights reserved.

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

hartman-wintner's theorem
hartman-wintner's trichotomy


a performance guaranteed distributed multicast algorithm for long-lived directional communications in wanets We consider the lifetime optimization problem for multicasting inwireless ad hoc networks, in which each node is equipped with a directional antennaand has limited energy supplies. In this paper, we propose a new distributedalgorithm, whose performance in terms of providing long-lived multicasttree is guaranteed by our theoretical analysis. We prove that its approximationratio is bounded by a finite number. In particular, the derived upper bound in aclosed form shows that the algorithm can achieve global optimal in some cases.The real performance of this new proposed algorithm is also evaluated usingsimulation studies and the experimental results show that it outperforms otherdistributed algorithms.

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

wireless ad hoc network
approximation algorithm
energy efficiency
directional antenna


Multiple choices and reputation in multiagent interactions Coevolutionary learning provides a framework for modeling more realistic iterated prisoner's dilemma (IPD) interactions and to study conditions of how and why certain behaviors (e.g., cooperation) in a complex environment can be learned through an adaptation process guided by strategic interactions. The coevolutionary learning of cooperative behaviors can be attributed to the mechanism of direct reciprocity (e.g., repeated encounters). However, for the more complex IPD game with more choices, it is unknown precisely why the mechanism of direct reciprocity is less effective in promoting the learning of cooperative behaviors. Here, our study suggests that the evolution of defection may be a result of strategies effectively having more opportunities to exploit others when there are more choices. We note that strategies are less able to resolve the intention of an intermediate choice, e.g., whether it is a signal to engender further cooperation or a subtle exploitation. A likely consequence is strategies adapting to lower cooperation plays that offer higher payoffs in the short-term view when they cannot resolve the intention of opponents. However, cooperation in complex human interactions may also involve indirect interactions rather than direct interactions only. Following this, we study the coevolutionary learning of IPD with more choices and reputation. Here, current behavioral interactions depend not only on choices made in previous moves (direct interactions), but also choices made in past interactions that are reflected by their reputation scores (indirect interactions). The coevolutionary learning of cooperative behaviors is possible in the IPD with more choices when strategies use reputation as a mechanism to estimate behaviors of future partners and to elicit mutual cooperation play right from the start of interactions. In addition, we study the impact of the accuracy of reputation estimation in reflecting strategy behaviors of different implementations and why it is important for the evolution of cooperation. We show that the accuracy is related to how memory of games from previous generations is incorporated to calculate reputation scores and how frequently reputation scores are updated.

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

evolutionary computation
evolutionary games
iterated prisoner's dilemma (ipd)


Short-recurrence Krylov subspace methods for the overlap Dirac operator at nonzero chemical potential The overlap operator in lattice QCD requires the computation of the sign function of a matrix, which is non-Hermitian in the presence of a quark chemical potential. In previous work we introduced an Arnoldi-based Krylov subspace approximation, which uses long recurrences. Even after the deflation of critical eigenvalues, the low efficiency of the method restricts its application to small lattices. Here we propose new short-recurrence methods which strongly enhance the efficiency of the computational method. Using rational approximations to the sign function we introduce two variants, based on the restarted Arnoldi process and on the two-sided Lanczos method, respectively, which become very efficient when combined with multishift solvers. Alternatively, in the variant based on the two-sided Lanczos method the sign function can be evaluated directly. We present numerical results which compare the efficiencies of a restarted Arnoldi-based method and the direct two-sided Lanczos approximation for various lattice sizes. We also show that our new methods gain substantially when combined with deflation. (C) 2010 Elsevier B.V. All rights reserved.

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

overlap dirac operator
quark chemical potential
sign function


Freeway service patrol deployment planning for incident management and congestion mitigation This paper investigates the problem of deploying freeway service patrols to detect, respond to and clear traffic incidents in two settings, deterministic and stochastic. The deterministic setting assumes that there is only one scenario of incident occurrence and, in the stochastic counterpart, there are many scenarios, each of which occurs with a probability. The main objective of both problems is to minimize the total incident response time. Rather than minimizing the expected total response time, the stochastic model minimizes the expected total response time over the high-consequence scenarios instead. In both settings, the deployment problem can be formulated as a mixed-integer nonlinear optimization problem, a hard class of problem to solve. To obtain solutions in a reasonable amount of time, three heuristic algorithms are proposed. In particular, one makes use of the dual information, another employs a neighborhood search technique and the third uses simulated annealing, a meta-heuristic algorithm. Numerical experiments based on data from Sioux Falls demonstrate that all three algorithms provide solutions with a significant reduction in total response time without using an excessive amount of CPU time.

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

freeway service patrol
incident management
congestion mitigation
deployment planning


The role of "leads" in the dynamic OLS estimation of cointegrating regression models In this paper, we consider the role of "leads" of the first difference of integrated variables in the dynamic OLS estimation of cointegrating regression models. Specifically, we investigate Stock and Watson's [J.H. Stock, M.W. Watson's, A simple estimator of cointegrating vectors in higher order integrated systems, Econometrica 61 (1993) 783-820] claim that the role of leads is related to the concept of Granger causality by a Monte Carlo simulation. From the simulation results, we find that the dynamic OLS estimator without leads substantially outperforms that with leads and lags; we therefore recommend testing for Granger non-causality before estimating models. (C) 2008 IMACS. Published by Elsevier B.V. All rights reserved.

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

dynamic ordinary least squares estimator


An approach to the piano mover's problem using hierarchic reinforcement learning We attempt to achieve corporative behavior of autonomous decentralized agents constructed via Q-Learning, which is a type of reinforcement learning. As such, in the present paper, we examine the piano mover's problem including a find-path problem. We propose a multi-agent architecture that has an external agent and internal agents. Internal agents are homogenous and can communicate with each other. The movement of the external agent depends on the composition of the actions of the internal agents. By learning how to move through the internal agents, avoidance of obstacles by the object is expected. We simulate the proposed method in a two-dimensional continuous world. Results obtained in the present investigation reveal the effectiveness of the proposed method.

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

piano mover's problem
heterogeneous
multi-agent
find-path problem
obstacle avoidance


Parameter reconstruction of materials with off-diagonal anisotropy using the state transition matrix method An effective non-iterative method is developed for determination electromagnetic parameters of complex materials with anisotropy. Unlike the existing methods, the proposed method can extract the electromagnetic tensor parameters of materials with off-diagonal anisotropy using co- and cross-polarized reflection and transmission without using iterative procedures. Useful analytical expressions are derived for extracting the medium parameters of materials with off-diagonal anisotropy. The advantage of the method is that it uses state transition matrix and its properties in order to avoid nonlinearity and complexity of the problem. The method can work very well for dispersive materials since it is based on frequency-by-frequency extraction. The proposed method is validated by extraction of the complex permittivity and permeability tensors of two typical anisotropic materials.

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

parameter reconstruction
state transition matrix method


On k-gons and k-holes in point sets ? We consider a variation of the classical Erd?sSzekeres problems on the existence and number of convex k-gons and k-holes (empty k-gons) in a set of n points in the plane. Allowing the k-gons to be non-convex, we show bounds and structural results on maximizing and minimizing their numbers. Most noteworthy, for any k and sufficiently large n, we give a quadratic lower bound for the number of k-holes, and show that this number is maximized by sets in convex position.

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

erd?sszekeres type problems
k-gons
k-holes
empty k-gons


Do Rules and Patterns Affect Design Maintainability? At the present time, best rules and patterns have reached a zenith in popularity and diffusion, thanks to the software community's efforts to discover, classify and spread knowledge concerning all types of rules and patterns. Rules and patterns are useful elements, but many features remain to be studied if we wish to apply them in a rational manner. The improvement in quality that rules and patterns can inject into design is a key issue to be analyzed, so a complete body of empirical knowledge dealing with this is therefore necessary. This paper tackles the question of whether design rules and patterns can help to improve the extent to which designs are easy to understand and modify. An empirical study, composed of one experiment and a replica, was conducted with the aim of validating our conjecture. The results suggest that the use of rules and patterns affect the understandability and modifiability of the design, as the diagrams with rules and patterns are more difficult to understand than non-rule/pattern versions and more effort is required to carry out modifications to designs with rules and patterns.

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

design patterns and rules
software quality
object-oriented design


SACTA: A Self-Adjusting Clock Tree Architecture for Adapting to Thermal-Induced Delay Variation Aggressive technology scaling down and low-power design techniques lead to uneven distributed power density, which translates into heat flow in the chips, causing significant temperature variations in both spatial and temporal terms. In order to mitigate the negative impacts of temperature variations on circuit timing, we propose SACTA, a self-adjusting clock tree architecture, which performs temperature-dependent dynamic clock skew scheduling to prevent timing violations in a pipelined circuit. The dynamic and adaptive features of SACTA are enabled by our proposed automatic temperature-adjustable skew buffers and temperature-insensitive skew buffers. These special delay elements are carefully tuned to ensure resilience of the entire circuit against temperature variation. To determine their configurations, we proposed an efficient and general clock tree design and optimization framework. Furthermore, we show that SACTA is applicable across a wide spectrum of circuits, including multi-V(dd)/V(th), designs. Experimental results show that a pipeline supported by SACTA is able to prevent thermal-induced timing violations within a significantly larger range of operating temperatures (on average, the violation-free range can be enhanced by over 15 degrees C).

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

design automation
self-adjusting
variation-tolerance


Scalable and efficient end-to-end network topology inference To construct an efficient overlay network, the information of underlay is important. We consider using end-to-end measurement tools such as traceroute to infer the underlay topology among a group of hosts. Previously, Max-Delta has been proposed to infer a highly accurate topology with a low number of traceroutes. However, Max- Delta relies on a central server to collect traceroute results and to select paths for hosts to traceroute. It is not scalable to large groups. In this paper, we investigate a distributed inference scheme to support scalable inference. In our scheme, each host joins an overlay tree before conducting traceroute. A host then independently selects paths for tracerouting and exchanges traceroute results with others through the overlay tree. As a result, each host can maintain a partially discovered topology. We have studied the key issue in the scheme, that is, how a low-diameter overlay tree can be constructed. Furthermore, we propose several techniques to reduce the measurement cost for topology inference. They include 1) integrating the Doubletree algorithm into our scheme to reduce measurement redundancy, 2) setting up a lookup table for routers to reduce traceroute size, and 3) conducting topology abstraction and reducing the computational frequency to reduce the computational overhead. As compared to the naive Max- Delta, our scheme is fully distributed and scalable. The computational loads for target selection are distributed to all the hosts instead of a single server. In addition, each host only communicates with a few other hosts. The consumption of edge bandwidth at a host is hence limited. We have done simulations on Internet-like topologies and conducted measurements on PlanetLab. The results show that the constructed tree has a low diameter and can support quick data exchange between hosts. Furthermore, the proposed improvements can efficiently reduce measurement redundancy, bandwidth consumption, and computational overhead.

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

topology discovery
end-to-end measurement


Extracting knowledge of customers preferences in massively multiplayer online role playing games Due to fierce competition in game markets, to identify customers true needs is one of the crucial factors in online game industry. Traditionally, game producers heavily rely on game testers, who are primarily responsible for analyzing computer games, finding software defects and being a part of quality control process, to achieve this goal. But, it is not often reliable. To ensure the investment can be returned, game producers need an effective approach to discover frequently shifted customer preferences in time. Recently, Kano model and data mining techniques have been successfully applied to recognize customers preferences and implement customer relationship management tasks, respectively. However, in traditional Kano analysis, only basically statistical analysis techniques are used, and they are insufficient to provide advanced knowledge to enterprisers. Therefore, in order to discover the relationship between/among quality elements in Kano model and to extract knowledge related to customer preferences, this study proposes a knowledge acquisition scheme that integrates several data mining techniques including association rule discovery, decision tree, and self-organizing map neural network, into traditional Kano model. An actual case of customer satisfaction survey regarding massively multiplayer online role playing game has been provided to demonstrate the effectiveness of our proposed scheme.

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

massively multiplayer online role playing game (mmorpg)


Optimization of cooperative spectrum sensing with sensing user selection in cognitive radio networks Cooperative spectrum sensing (CSS) can improve the spectrum sensing performance by introducing spatial diversity in cognitive radio networks (CRNs). However, such cooperation also introduces the delay for reporting sensing data. Conventional cooperation scheme assumes that the cooperative secondary users (SUs) report their local sensing data to the fusion center sequentially. This causes the reporting delay to increase with the number of the cooperative SUs, and ultimately affects the performance of CSS. In this article, we consider the reporting delay and formulate the optimization problem of CSS with sensing user selection to maximize the average throughput of the CRN in both the additive white Gaussian noise (AWGN) environment and the Rayleigh fading environment. It is shown that selecting all the SUs within the CRN to cooperate might not achieve the maximal average throughput. In particular, for the AWGN environment, the sensing user selection scheme is equivalent to selecting the optimal number of cooperative SUs due to all the SUs having the same instantaneous detection signal-to-noise ratio (SNR). For the Rayleigh fading environment, the maximal average throughput is achieved by selecting a certain number of cooperative SUs with the highest instantaneous detection SNRs to cooperate. Finally, computer simulations are presented to demonstrate that the average throughput of the CRN can be maximized through the optimization.

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

cooperative spectrum sensing
cognitive radio
reporting delay
optimization
sensing user selection


Scheduling on Unrelated Machines under Tree-Like Precedence Constraints We present polylogarithmic approximations for the R vertical bar prec vertical bar C(max) and R vertical bar prec vertical bar Sigma(j) w(j)C(j) problems, when the precedence constraints are "treelike"-i.e., when the undirected graph underlying the precedences is a forest. These are the first non-trivial generalizations of the job shop scheduling problem to scheduling with precedence constraints that are not just chains. These are also the first non-trivial results for the weighted completion time objective on unrelated machines with precedence constraints of any kind. We obtain improved bounds for the weighted completion time and flow time for the case of chains with restricted assignment-this generalizes the job shop problem to these objective functions. We use the same lower bound of "congestion + dilation", as in other job shop scheduling approaches (e.g. Shmoys, Stein and Wein, SIAM J. Comput. 23, 617-632, 1994). The first step in our algorithm for the R vertical bar prec vertical bar C(max) problem with treelike precedences involves using the algorithm of Lenstra, Shmoys and Tardos to obtain a processor assignment with the congestion + dilation value within a constant factor of the optimal. We then show how to generalize the random-delays technique of Leighton, Maggs and Rao to the case of trees. For the special case of chains, we show a dependent rounding technique which leads to a bicriteria approximation algorithm for minimizing the flow time, a notoriously hard objective function.

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

precedence-constrained scheduling
job-shop scheduling
approximation algorithms
randomized algorithms


Financial and financial engineering considerations in supply chain and product development pipeline management Enterprise-wide decision problems are receiving increasing attention in the process systems engineering literature. In particular. the supply chain and product development pipeline management components of this general class of problems have been subjects of intensive research in both their deterministic and their stochastic forms. The supply chain management (SCM) problem has seen work largely focused on the process operations and logistics components while for the product development pipeline management (PDPM) problem much of the attention has been on MILP formulations addressing the consequences of product failure during its development. In their full realization, both are recognized as challenging stochastic multi-stage decision problems. In this paper we discuss three important aspects of these problems that require further research the realistic representation of the financial components and appropriate criteria for this class of problems, strategic management of supplier and customer relationships through inventory management and option contracts, and innovative approaches to suitably value and integrate a broader range of decisions available to management We highlight and extend relevant contributions and case examples drawn from the recent literature that are emerging on these topics and use this work to point out further challenges. (C) 2009 Elsevier Ltd. All rights reserved.

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

supply chain management
inventory management

product portfolio management
supplier-customer relationships
corporate value
risk management
flexibility


Effects of chemical reaction and space porosity on MHD mixed convective flow in a vertical asymmetric channel with peristalsis This work is aimed at describing MHD mixed convective heat and mass transfer peristaltic flow through a vertical porous space in the presence of a chemical reaction. The flow is examined in a wave frame of reference moving with the velocity of the wave. The channel asymmetry is produced by choosing the peristaltic wave train on the walls to have different amplitude and phase. The momentum, energy and concentration equation have been linearized under long-wavelength approximation. Expressions for dimensionless stream function, temperature and concentration field are constructed. The features of the fluid flow, heat and mass transfer characteristics are analyzed by plotting graphs and discussed in detail. (C) 2011 Elsevier Ltd. All rights reserved.

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

hartmann number
chemical reaction parameter
schmidt number


A cheapest nonconforming rectangular finite element for the stationary Stokes problem We introduce a least degrees of freedom nonconforming finite element pair to approximate the Stokes equations based on quadrilateral meshes. The finite element space for the velocity field is composed of the P1 P 1 -nonconforming quadrilateral element plus only one additional global DSSY (DouglasSantosSheenYe) or RT (RannacherTurek) type of bubble function. The pressure field is approximated by the piecewise constant function. We show that the discrete problem is nonsingular and the element pair satisfies a weak discrete infsup condition. Several numerical examples are shown to confirm the efficiency and reliability of the proposed method.

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

stokes equations
nonconforming finite element
bubble function


Beyond the visuals: tactile augmentation and sensory enhancement in an arthroscopy simulator This paper considers tactile augmentation, the addition of a physical object within a virtual environment (VE) to provide haptic feedback. The resulting mixed reality environment is limited in terms of the ease with which changes can be made to the haptic properties of objects within it. Therefore sensory enhancements or illusions that make use of visual cues to alter the perceived hardness of a physical object allowing variation in haptic properties are considered. Experimental work demonstrates that a single physical surface can be made to feel both softer and harder than it is in reality by the accompanying visual information presented. The strong impact visual cues have on the overall perception of object hardness, indicates haptic accuracy may not be essential for a realistic virtual experience. The experimental results are related specifically to the development of a VE for surgical training; however, the conclusions drawn are broadly applicable to the simulation of touch and the understanding of haptic perception within VEs.

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

tactile augmentation
sensory enhancement
mixed reality


Hybrid email spam detection model with negative selection algorithm and differential evolution Email spam is an increasing problem that not only affects normal users of internet but also causes a major problem for companies and organizations. Earlier techniques have been impaired by the adaptive nature of unsolicited email spam. Inspired by adaptive algorithm, this paper introduces a modified machine learning technique of the human immune system called negative selection algorithm (NSA). A local selection differential evolution (DE) generates detectors at the random detector generation phase of NSA; code named NSADE. Local outlier factor (LOF) is implemented as fitness function to maximize the distance of generated spam detectors from the non-spam space. The problem of overlapping detectors is also solved by calculating the minimum and maximum distance of two overlapped detectors in the spam space. From the experiments, the results show that the detection accuracy of NSADE is 83.06% while the standard negative selection algorithm is 68.86% at 7000 generated detectors.

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

negative selection algorithm
differential evolution
email
spam
detector generation


A compressible flow model with capillary effects A quasi-conservative formulation for compressible flows with interfaces including both capillary and viscous effects is developed. The model involves: (i) acoustic and convective transport; (ii) surface tension effects introduced as an extension of the CSF method (Brackbill et al.) to compressible flows; (iii) viscous effects. The interfaces are considered as diffused zones. Every point of the flow is correctly described thanks to a mixture equation of state based on energy conservation and pressure equilibrium. The model is thus valid in each pure fluid as well as at interfaces. A Godunov type method, that enables interface capturing, is developed and used whatever the mesh point. Numerical tests are performed over a wide range of physical situations involving surface tension, compressibility, gravity, viscosity and large density ratios. Tests involving break-up and coalescence are considered to show the ability of the method to deal with dynamic appearance and disappearance of interfaces in an Eulerian framework.

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

interface capturing
surface tension
viscosity
compressibility
coalescence

two-phase flows
conservative formulation
mixture thermodynamics
break-up


towards an integrated system model for testing and verification of automation machines Models and documents created during the development of automation machines typically can be categorized into mechanics, electronics, and software. The functionality of an automation machine is, however, realized by the interaction of all three of these domains. So no single model covering only one development category will be able to describe the behavior of the machine thoroughly. For early planning of machine design, virtual prototypes, and especially for the formal verification of requirements an integrated functional model of the machine is required. This paper introduces a technique which can be used to model automation machines on an abstract level, including coarse-grained descriptions of mechanics, electronics and software aspects with special focus on modeling domain-specific issues such as material flow and collision response. The resulting models are detailed enough to be simulated or verified but still suitably abstract to allow fast creation and efficient simulation.

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


Pattern-based automatic taxonomy learning from the Web The construction of taxonomies is considered as the first step for structuring domain knowledge. Many methodologies have been developed in the past for building taxonomies from classical information repositories such as dictionaries, databases or domain text. However, in the last years, scientists have started to consider the Web as valuable repository of knowledge. In this paper we present a novel approach, especially adapted to the Web environment, for composing taxonomies in an automatic and unsupervised way. It uses a combination of different types of linguistic patterns for hyponymy extraction and carefully designed statistical measures to infer information relevance. The learning performance of the different linguistic patterns and statistical scores considered is carefully studied and evaluated in order to design a method that maximizes the quality of the results. Our proposal is also evaluated for several well distinguished domains, offering, in all cases, reliable taxonomies considering precision and recall.

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

ontologies
web mining
knowledge acquisition


Robust controller design for linear polytopic systems The paper addresses the problem of the robust output feedback controller design with a guaranteed cost and parameter dependent Lyapunov function for linear continuous time polytopic systems. Two design methods based on improved robust stability conditions are proposed. Numerical examples are given to illustrate the effectiveness of the proposed methods. The obtained results are compared with other three design procedures.

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

linear polytopic systems
output feedback


Building open government On his first full day in office, President Obama issued a Memorandum on Transparency and Open Government calling on his administration to develop recommendations that would establish a system of transparency, public participation, and collaboration. Together, the recommendations would be used to create an Open Government Directive instructing agencies to transform themselves to become more transparent, collaborative, and participatory. The President also issued a Memorandum on the Freedom of Information Act (FOIA). These statements did not spring ex nihilo from President Obama and his aides (or even from the army of organizations and individuals who advised them or submitted recommendations during the transition). They have a basis in extant law and regulation, and it this basis at which this article looks.

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


A Characterization of Entanglement-Assisted Quantum Low-Density Parity-Check Codes As in classical coding theory, quantum analogs of low-density parity-check (LDPC) codes have offered good error correction performance and low decoding complexity by employing the Calderbank-Shor-Steane construction. However, special requirements in the quantum setting severely limit the structures such quantum codes can have. While the entanglement-assisted stabilizer formalism overcomes this limitation by exploiting maximally entangled states (ebits), excessive reliance on ebits is a substantial obstacle to implementation. This paper gives necessary and sufficient conditions for the existence of quantum LDPC codes which are obtainable from pairs of identical LDPC codes and consume only one ebit, and studies the spectrum of attainable code parameters.

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

entanglement-assisted quantum error correction


Steady-state back-off calculation: Use of piecewise lineal approximation The operating point of a chemical process is usually computed by optimizing a steady-state objective function, e.g., the profit, subject to some characteristics of the plant. However, the resulting point typically lies in the boundary of the operating region. The presence of disturbances can easily cause constraint violations. Thus, it is necessary to move the operating point away from the active constraints into the feasible region (back-off). The magnitude of this back-off has direct economical meaning. The purpose of this paper is to use a Canonical Piecewise Lineal approximation to compute the back-off.

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

optimizing control
optimization
back-off
piecewise approximation


real-time 3d talking head from a synthetic viseme dataset In this paper, we describe a simple and fast way to build a 3D talking head which can be used in many applications requiring audiovisual speech animation system. The talking head is constructed from a synthetic 3D viseme dataset, which is realistic enough and can be generated with 3D modeling software. To build the talking head, at first the viseme dataset is analyzed statistically to obtain the optimal linear parameters to control the movements of the lips and jaw of the 3D head model. These parameters correspond to some of the low-level MPEG-4 FAPs, hence our method can be used to extract the speech-relevant MPEG-4 FAPs from a dataset of phonemes/visemes. The parameterized head model is eventually combined with a Text-to-Speech (TTS) system to synthesize audiovisual speech from a given text. To make the talking head looks more realistic, eye-blink and movements are also animated during the speech. We implemented this work in an interactive text-to-audio-visual speech system.

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

principal component analysis
mpeg-4 faps
visual speech synthesis
face animation


Logical fusion rules for merging structured news reports Structured text is a general concept that is implicit in a variety of approaches in handling information. Syntactically, an item of structured text is a number of grammatically simple phrases together with a semantic label for each phrase. Items of structured text may be nested within larger items of structured text. Much information is potentially available as structured text including tagged text in XML, text in relational and object-oriented databases, and the output from information extraction systems in the form of instantiated templates. In previous papers, we have presented a logic-based framework for merging items of potentially inconsistent structured text [Data Knowledge Eng. 34 (2000) 305332, Data Knowledge Eng. 2002 (in press)]. In this paper, we present fusion rules as a way of implementing logic-based fusion. Fusion rules are a form of scripting language that define how structured news reports should be merged. The antecedent of a fusion rule is a call to investigate the information in the structured news reports and the background knowledge, and the consequent of a fusion rule is a formula specifying an action to be undertaken to form a merged report. It is expected that a set of fusion rules is defined for any given application. We give the syntax and mode of execution for fusion rules, and explain how the resulting actions give a merged report. We illustrate the presentation with examples of fusion rules for an application for merging weather reports.

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

merging information
semi-structured text
logic-based inconsistency management
logic-based fusion
heterogenous information
inconsistency handling
conflict resolution


Structural and electrical properties of NixMn3?xO4 system ceramics for infrared sensors Nickel manganite NixMn3?xO4 ceramics for the application of IR sensors NixMn3?xO4 systems were prepared by using a mixed-oxide method. The X-ray diffraction patterns confirmed the spinel cubic polycrystalline structure. The temperature coefficient of resistance, all specimens showed values ?4%/C above. The typical NTCR (negative temperature coefficient of resistance) properties

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


Introduction: Configuring anthropology The authors present examples of how anthropologists are presently using computers to advance ethnographic research in new directions while building on what has come before. All the methods, protocols, and tools created by the authors are free, open source, and available on the Internet. The contributions are the authors' attempts to address greater complexity through greater control over the data and structures within which anthropologists work. These methods are suitable to a large number of problems, basic and applied, across the range of anthropology from its humanities axis to its science axis. Anthropology is what anthropologists make of it, and each author is attempting to make a little bit more of anthropology and to configure anthropology for addressing old problems in new ways and positioning anthropology to address new problems and new opportunities to influence others through anthropology.

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

kinship
agent-based modeling
high fidelity
mathematical anthropology


Development strategy of the alternative format materials for disabled people in Korea Purpose - Disabled people have the same information needs as non-disabled people. Nevertheless, only 5 per cent of the world's publishing output is made accessible in alternative formats for people who cannot access and use printed materials. This paper aims to suggest the strategy for a national development plan, role models for production and distribution of the alternative format materials for the equitable library service for Koreans with print disabilities. Design/methodology/approach - The paper is based on a series of pre-research studies and discusses arguments for and principles of an alternative format materials development plan in terms of protecting access to information, eliminating the knowledge and information gap, the role of libraries and their social responsibilities, the inadequacy of materials currently available, production plans at the national level, and the advent of an era of digital distribution. Findings - This research presents a strategic development plan as well as a role division model concerning the production of alternative format materials based on the mid- to long-term plan and a nation-wide cooperative network centring on the National Library Support Center for Disabled People in Korea. Originality/value - The strategic development plan and a role division model concerning the production of alternative format materials presented in this study will improve consciousness about the gap in information.

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

disabled people
print disabilities
alternative format materials

public libraries
information services
disabilities
south korea


on the numerical approximation of drug diffusion in complex cell geometry The mathematical modeling of a mammalian cell is a very tedious work due to its very complex geometry. Especially, taking into account the spatial distribution and the inclusion of lipophilic toxic compounds greatly increases its complexity. The non-homogeneity and the different cellular architecture of the cell certainly affect the diffusion of these compounds. The complexity of the whole system can be reduced by a homogenization technique. To see the effect of these compounds on different cell architectures, we have implemented a mathematical model. The work has been done in 2-dimensional space. The simulation results have been qualitatively verified using compartmental modeling approach. This work can be extended with a more complex reaction-diffusion system and to 3-dimensional space as well.

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

reaction-diffusion system
metabolism in biological cells
approximation of complex geometry


Investigation of manufacturing variations of planar InP/InGaAs avalanche photodiodes for optical receivers Planar InP/InGaAs avalanche photodiodes are widely used for high-speed optical receivers in optical fiber communication systems. Even though these avalanche photodiodes offer the excellent characteristics in high-speed operation, the performance metrics are affected by manufacturing parameter variations considerably. In this paper, the effects of manufacturing variations on the device performance are investigated. In order to build a photodiode model, the test structures were fabricated and the measured currentvoltage characteristics were compared with the simulated data to verify the model. After the model verification, the variations of the breakdown voltage and punch-through voltage according to the different manufacturing parameters such as multiplication layer width and charge sheet density are examined. Based on the results, the manufacturability of the avalanche photodiodes can be improved by analyzing the manufacturing variations.

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

avalanche photodiode
modeling
manufacturing variation
optical receiver


Network algebra in Java Network algebra descriptions are translated uniformly to Java yielding a component based simulation model. The model is used to reflect the characteristics of real-world systems. (C) 2004 Elsevier Inc. All rights reserved.

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


Complete solution sets of inf- -> interval-valued fuzzy relation equations Fuzzy relation equations play an important role in fuzzy set theory. Interval-valued fuzzy set theory is an extension of fuzzy theory in which a closed subinterval of the unit interval is assigned with membership degree. Therefore, it is very significant to study interval-valued fuzzy relation equations from both the theoretical and practical viewpoints. In this paper, the solution sets of interval-valued fuzzy relation equations with inf- -> composition is investigated, where -> is interval-valued R-, S- or QL-implication. Necessary and sufficient conditions such that there exist solutions for these equations are first shown. Some sufficient conditions for existence of maximal solutions for these equations are represented, and then it is shown that the complete solution sets of inf- -> interval-valued fuzzy relation equations can be determined by their maximal solutions. Finally, the solution sets of linear interval-valued fuzzy relation equations are described by a method similar to that in linear algebra. Crown Copyright (C) 2012 Published by 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 O O O O O O O O O O O O O O O O O O O


Kontextualisierung der Medienwahl mit Hilfe von Kommunikationsgenres Wertschpfung wird zunehmend virtualisiert organisiert, was den effektiven Einsatz von Kommunikationsmedien erfordern. Obwohl die Medienwahl als Entscheidungsproblem in der angelschsisch geprgten Forschung seit langem thematisiert wird, weisen traditionelle Medienwahltheorien zahlreiche Schwchen mit Blick auf die Gestaltungsfrage auf. Sie sind, ihrem Generalisierungsanspruch geschuldet, zu abstrakt formuliert und hinsichtlich der Anwendung unterspezifiziert. Vor diesem Hintergrund wird in diesem Beitrag ein Ansatz zur Kontextualisierung der Medienwahl mit Hilfe der Genre-Analyse vorgestellt. Deren Ziel ist die Identifikation von Kommunikationsmustern (Genres) in sozialen Gemeinschaften (z.B. Teams) im Sinne eines strukturierten berblicks der existierenden Teamkommunikation. Durch eine Gegenberstellung von Genre-Anforderungen und Medien-Charakteristika kann somit eine Verbesserung des Medieneinsatzes vorgeschlagen werden. Das Vorgehen wird anhand eines Fallbeispiels illustriert.

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

genre-analyse
kommunikationsanalyse
virtualisierung
teamarbeit
virtuelle teams
media choice
genre analysis
communication analysis
virtualization
teamwork
virtual teams


A simple procedure for calculating the mean and maximum bed stress under wave and current conditions for rough turbulent flow based on Soulsby and Clarke's (2005) method In the marine environment, particularly on continental shelves, the processes of wave dissipation and sediment transport depend crucially on the bed shear stress. When waves and currents are superimposed the bed shear stress exhibits non-linear behaviour such that it is insufficient to simply sum vectorially the wave-alone and current-alone stress components. Soulsby and Clarke (2005) [Bed shear-stresses under combined waves and currents on smooth and rough beds. Report TR 137. HR Wallingford, Wallingford, UK, 22 pp.] developed a simple analytical, non-iterative method for calculating the mean and maximum bed shear stress in combined wave and current flows. For rough turbulent flow their method produces non-linearities in the mean and maximum bed stress that are consistent with those measured, while it under-predicts the non-linearities in the bed stresses in comparison with model predictions. Here their method is generalised such that it may be used to predict non-linearities in the bed stresses that are consistent with either the measurements or the models, for the case of rough turbulent flow. Also the Soulsby and Clarke method relies on the fact that the depth-averaged current is already known. However, in the field it is often the case that the current at a particular height above the bed is measured, so here their method is reposed in terms of a current measured at a particular height. A MATLAB script is provided for this modified Soulsby and Clarke method, such that either strong or weak non-linearity can be included in the wavecurrent interaction and the current can be input at a particular height or as a depth average.

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

wavecurrent interaction model
rough-turbulent flow


it collaboration across institutions Rapidly increasing demand for technology support services, and often shrinking budgetary and staff resources, create enormous challenges for information technology (IT) departments in public sector higher education. To address these difficult circumstances, the author helped develop a network of IT professionals from schools in a community college system and a research university in the same geographic region into a community of practice (CoP) that spanned the boundaries of their organizations. This collaboration allowed members from participating institutions to share knowledge and ideas relating to shared technical problems. The author also collected data about the extent to which the community developed the factors that contributed to its development and the perceived value that the other leaders and participants attributed to the endeavor. The results indicated that the group did coalesce into a CoP. The author also identified two crucial roles that aided this development: community coordinator and technology steward. Furthermore, the IT professionals who participated and the leaders from their organizations reported that developing the community was a worthwhile venture. They also reported that while the technical collaboration component was very valuable, the non-technical topics and interactions were also very beneficial. Finally, indicators also suggest that the community made progress toward self-sustainability and is likely to continue. These findings suggest that other higher education IT organizations faced with similar circumstances may be able to follow this model and achieve positive results.

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


a replicated assessment and comparison of common software cost modeling techniques Delivering a software product on time, within budget, and to an agreed level of quality is a critical concern for many software organizations. Underestimating software costs can have detrimental effects on the quality of the delivered software and thus on a company's business reputation and competitiveness. On the other hand, overestimation of software cost can result in missed opportunities to funds in other projects. In response to industry demand, a myriad of estimation techniques has been proposed during the last three decades. In order to assess the suitability of a technique from a diverse selection, its performance and relative merits must be compared. The current study replicates a comprehensive comparison of common estimation techniques within different organizational contexts, using data from the European Space Agency. Our study is motivated by the challenge to assess the feasibility of using multi-organization data to build cost models and the benefits gained from company-specific data collection. Using the European Space Agency data set, we investigated a yet unexplored application domain, including military and space projects. The results showed that traditional techniques, namely, ordinary least-squares regression and analysis of variance outperformed Analogy-based estimation and regression trees. Consistent with the results of the replicated study no significant difference was found in accuracy between estimates derived from company-specific data and estimates derived from multi-organizational data.

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

ordinary least-squares regression
analogy
cost estimation
replication
classification and regression trees


Elastic DVS management in processors with discrete voltage/frequency modes Applying classical dynamic voltage scaling (DVS) techniques to real-time systems running on processors with discrete voltage/frequency modes causes a waste of computational resources. In fact, whenever the ideal speed level computed by the DVS algorithm is not available in the system, to guarantee the feasibility of the task set, the processor speed must be set to the nearest level greater than the optimal one, thus underutilizing the system. Whenever the task set allows a certain degree of flexibility in specifying timing constraints, rate adaptation techniques can be adopted to balance performance (which is a function of task rates) versus energy consumption (which is a function of the processor speed). In this paper, we propose a new method that combines discrete DVS management with elastic scheduling to fully exploit the available computational resources. Depending on the application requirements, the algorithm can be set to improve performance or reduce energy consumption, so enhancing the flexibility of the system. A reclaiming mechanism is also used to take advantage of early completions. To make the proposed approach usable in real-world applications, the task model is enhanced to consider some of the real CPU characteristics, such as discrete voltage/frequency levels, switching overhead, task execution times nonlinear with the frequency, and tasks with different power consumption. Implementation issues and experimental results for the proposed algorithm are also discussed.

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

dynamic voltage scaling (dvs)
energy-aware scheduling
real-time computing


multimedia security technologies for movie protection In this industrial exhibit, Technicolor will showcase various technologies developed to protect digital audio-visual material all along the media value chain, from production to distribution, including forensics services in case pirated content is detected. The exhibit will be organized around Technicolor's proprietary technologies in video fingerprinting and audio/video watermarking.

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

content fingerprinting
digital watermarking


Secure interconnection protocol for integrated Internet and ad hoc networks Integration of ad hoc networks with the Internet provides global Internet connectivity for ad hoc hosts through the coordination of mobile IP and ad hoc protocols. In a pure ad hoc network, it is difficult to establish trust relationship between two ad hoc hosts due to lack of infrastructure or centralized administration. In this paper, an infrastructure-supported and distributed authentication protocol is proposed to enhance trust relationships amongst ad hoc hosts. In addition, an effective secure routing protocol (SRP) is discussed to protect the multi-hop route for Internet and ad hoc communication. In the integrated ad hoc networks with Internet accessibility, the ad hoc routing security deployed with the help of infrastructure has a fundamental impact on ad hoc hosts in term of Internet access, integrity, and authentication. Both analysis and simulation results demonstrate the effectiveness of the proposed security protocol. Copyright (C) 2007 John Wiley & Sons, Ltd.

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

mobile ip
ad hoc networks
internet connectivity
routing security


Gas phase acidities of N-substituted amine-boranes Complexation energies and acidities of 19 primary, secondary and tertiary amine-boranes were investigated using MP2/6-311+G(d,p) and B3LYP/6-311+G(d,p) methods. Gas phase acidities for free amines were also calculated. Acidity values for studied complexes range from 327.3 to 349.1 kcal mol(-1) and the most acidic are the ones with direct connection between deprotonation center and a pi-system. Results obtained by both computational methods are in good agreement with each other and with known experimental data. Addition of BH3 increases the acidity of amines by 30 to 50 kcal mol(-1). This enhancement effect was compared to the respective effect witnessed in phosphine-boranes and traced back to changes of charge delocalization on nitrogen. A question about the structural stability of several deprotonated amine-borane anions in the gas phase was also raised.

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


THE COMPLEXITY OF SYMMETRIC BOOLEAN PARITY HOLANT PROBLEMS For certain subclasses of NP, circle plus P, or #P characterized by local constraints, it is known that if there exist any problems within that subclass that are not polynomial time computable, then all the problems in the subclass are NP-complete, circle plus P-complete, or #P-complete. Such dichotomy results have been proved for characterizations such as constraint satisfaction problems and directed and undirected graph homomorphism problems, often with additional restrictions. Here we give a dichotomy result for the more expressive framework of Holant problems. For example, these additionally allow for the expression of matching problems, which have had pivotal roles in the development of complexity theory. As our main result we prove the dichotomy theorem that, for the class circle plus P, every set of symmetric Holant signatures of any arities that is not polynomial time computable is circle plus P-complete. The result exploits some special properties of the class circle plus P and characterizes four distinct tractable subclasses within circle plus P. It leaves open the corresponding questions for NP, #P, and #P-k for k not equal 2.

O B O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 uniform solution to SAT using membrane creation In living cells, new membranes are produced basically through two processes: mitosis and autopoiesis. These two processes have inspired two variants of cell-like membrane systems, namely P systems with active membranes and P systems with membrane creation. In this paper, we provide the first uniform, efficient solution to the SAT problem in the framework of recogniser P systems with membrane creation using dissolution rules. Recently the authors have proved that if the dissolution rules are not allowed to be used, then the polynomial complexity class associated with this variant of P systems is the standard complexity class P. This result, together with the main result of this paper, shows the surprising role of the apparently "innocent" operation of membrane dissolution. The use of this type of rule establishes the difference between efficiency and non-efficiency for P systems with membrane creation, and provides a barrier between P and NP (assuming P not equal NP). (c) 2006 Elsevier B.V. All rights reserved.

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

natural computing
membrane computing
cellular complexity classes


Preaching about the converted: how meiotic gene conversion influences genomic diversity Meiotic crossover (CO) recombination involves a reciprocal exchange between homologous chromosomes. COs are often associated with gene conversion at the exchange site where genetic information is unidirectionally transferred from one chromosome to the other. COs and independent assortment of homologous chromosomes contribute significantly to the promotion of genomic diversity. What has not been appreciated is the contribution of another product of meiotic recombination, noncrossovers (NCOs), which result in gene conversion without exchange of flanking markers. Here, we review our comprehensive analysis of recombination at a highly polymorphic mouse hotspot. We found that NCOs make up ?90% of recombination events. Preferential recombination initiation on one chromosome allowed us to estimate the contribution of CO and NCO gene conversion to transmission distortion, a deviation from Mendelian inheritance in the population. While NCO gene conversion tracts are shorter, and thus have a more punctate effect, their higher frequency translates into an approximately two-fold greater contribution than COs to gene conversionbased allelic shuffling and transmission distortion. We discuss the potential impact of mammalian NCO characteristics on evolution and genomic diversity.

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


Stochastic geometry modeling and analysis of cognitive heterogeneous cellular networks In this paper, we present a cognitive radio (CR)-based statistical framework for a two-tier heterogeneous cellular network (femto-macro network) to model the outage probability at any arbitrary secondary (femto) and primary (macro) user. A system model based on stochastic geometry (utilizing the spatial Poisson point process (PPP) theory) is applied to model the random locations and network topology of both secondary and primary users. A considerable performance improvement can be generally achieved by mitigating interference in result of applying the CR idea over the above model. Novel closed-form expressions are derived for the downlink outage probability of any typical femto and macro user considering the Rayleigh fading for the desired and interfering links. We also study some important design factors which their role and importance in the determination of outage and interference cannot be ignored. We conduct simulations to validate our analytical results and evaluate the proposed schemes in terms of outage probability for different values of signal-to-interference-plus-noise ratio (SINR) target.

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

heterogeneous cellular network
cognitive radio
outage probability


Evolutionary fuzzy discriminant analysis feature projection technique in myoelectric control The controller of a multifunction prosthetic hand usually employs a pattern recognition scheme to discriminate between the myoelectric signals (MES) from different classes of the forearm movements. The MES is recorded using a multichannel approach that makes the feature vector size very large. Hence a dimensionality reduction technique is needed to identify an informative moderate size feature set. This paper proposes a novel feature projection technique based on a combination of fisher linear discriminant analysis (LDA), fuzzy logic (FL), and differential evolution (DE) optimization technique. The new technique, DEFLDA, assigns different membership degrees to the data points in order to reduce the effect of overlapping points in the discrimination process. Furthermore, an optimized weighting scheme is presented in which certain weights are assigned to the features according to their contribution in the discrimination process. The proposed DEFLDA is tested on different datasets and compared with other projection techniques to prove its functionality.

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

fuzzy discriminant analysis
differential evolution
myoelectric control


Physics from computer science: A position statement In this statement we provide some examples of transdisciplinary journeys, from one field to another, and back. In particular, the quantum informatic endeavor is not just a matter of feeding physical theory into the general field of natural Computation, but also one of using high-level methods developed in Computer Science to improve oil the quantum physical formalism itself, and the understanding thereof. We highlight a seemingly contradictory phenomenon: passing to an abstract, categorical quantum informatic formalism leads directly to a simple and elegant graphical formulation of quantum theory itself, which for example makes the design. of some important quantum informatic protocols completely transparent. It turns out that essentially all of the quantum informatic machinery call be recovered from this graphical Calculus. But ill turn, this graphical formalism provides a bridge between methods of logic and computer science, and some of the most exciting developments in the mathematics of the past two decades: namely those arising from the Jones polynomial invariant of knots and links, the Temperley-Lieb Algebra and related structures.

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

quantum computing
semantics
category theory


towards virtual videography (poster session) Videographers have developed an art of conveying events in video. Through choices made in cinematography, editing, and post-processing, effective video presentations can be created from events recorded with little or no intrusion. In this paper, we explore systems that bring videography to situations where cost or time issues preclude application of the art. Our goal is to develop virtual videography , that is, systems that can help automate the process of creating an effective video presentation from given footage. In this paper, we discuss how virtual videography systems can be constructed by combining image-based rendering to synthetically generate shots with image understanding to help choose what should be shown to the viewer. To this, visual effects can be added to enhance the presentation, lessening the degradation caused by the medium.

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

help video systems videography process image art paper cost

situated
understandability
present
applications
visualization
event
edit
educational technology
timing
virtualization
automation
effect
automatic presentation
combinational
exploration
image-based rendering


Informing the public of transportationland use connections The lack of relevant information is a significant barrier when policy makers try to motivate local communities in regional transportationland use planning. This article demonstrates a workable approach to overcoming this information gap. Large data sets and research results are preprocessed to provide the information on regional transportationland use connections. Web-based open source geo-spatial technologies are employed to reduce the cost of information dissemination while maintaining a high level of accessibility. Maps and graphs are dynamically generated to ensure that relevant information is delivered in easy-to-understand formats. Two illustrative examples are presented in this article to show how local planners can possibly benefit from this approach when developing stories of community growth, accessibility, mobility, and transportationland use connections in a regional context.

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

transportationland use planning
information gap
open source


simple on-line algorithms for the maximum disjoint paths problem In this paper we study the problem of finding disjoint paths in graphs. Whereas for specific graphs many (almost) matching upper and lower bounds are known for the competitiveness of on-line path selection algorithms, much less is known about how well on-line algorithms can perform in the general setting. In several papers the expansion has been used to measure the performance of off-line and on-line algorithms in this field. We study a class of simple deterministic on-line algorithms and show that they achieve a competitive ratio that is asymptotically equal to the best possible competitive ratio that can be achieved by any deterministic on-line algorithm. For this we use a parameter caled routing number which allows more precise results than the expansion. Interestingly, our upper bound on the competitive ratio is even better than the best approximation ratio known for off-line algorithms. Furthermore, we show that a refined variant of the routing number allows to construct on-line algorithms with a competitive ratio that is for many graphs significantly below the best possible upper bound for deterministic on-line algorithms if only the routing number or expansion of a graph is known. We also show that our algorithms can be transformed into efficient algorithms for the related unsplittable flow problem.

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

precise use approximation performance matching flow routing graph general algorithm paper class

select
measurement
lower bound
efficiency
competition


Small Variance Estimators for Rare Event Probabilities Improving Importance Sampling estimators for rare event probabilities requires sharp approximations of conditional densities. This is achieved for events defined through large exceedances of the empirical mean of summands of a random walk, in the domain of large or moderate deviations. The approximation of conditional density of the trajectory of the random walk is handled on long runs. The length of those runs which is compatible with a given accuracy is discussed; simulated results are presented, which enlight the gain of the present approach over classical Importance Sampling schemes. Detailed algorithms are proposed.

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


New approach using ant colony optimization with ant set partition for fuzzy control design applied to the ball and beam system In this paper we describe the design of a fuzzy logic controller for the ball and beam system using a modified Ant Colony Optimization (ACO) method for optimizing the type of membership functions, the parameters of the membership functions and the fuzzy rules. This is achieved by applying a systematic and hierarchical optimization approach modifying the conventional ACO algorithm using an ant set partition strategy. The simulation results show that the proposed algorithm achieves better results than the classical ACO algorithm for the design of the fuzzy controller.

O O O B I 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 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 O O O O O O O O O O O O O O O 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
fuzzy logic
fuzzy control design


dempster-shafer theory for image restoration This work proposes a new filter based on progressive decision using Dempster-Shafer theory, to suppress the impulse noise to preserve details of image and to restore image corrupted by random valued impulse noise. The new filter mechanism is composed of an efficient D-S impulse detector and a noise filter. The D-S evidence theory provides a way to deal with uncertainty in the evidence. The pixel detection and noise filtering are applied progressively through several iteration. If a pixel is noisy then the proposed filter will replace it with the central noise free ordered mean value otherwise is kept unchanged. The final image is further refined by using median filter which improves the image quality. Simulation results reveal that proposed algorithm outperforms other existing median filters for random noise.

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

evidence theory
uncertainty
impulse noise
median filter
filtering


traffic engineering for multiple spanning tree protocol in large data centers The size of the capacity of data centers have been growing significantly during the last years. Most data centers rely on switched Ethernet networks. A drawback of the Ethernet technology is that it relies on the spanning tree protocol (or variants of it) to select the links that are used to forward packets inside the data center. In this paper we propose a Constrained-Based Local Search optimization scheme that is able to efficiently compute the optimum spanning tree in large data center networks. Our technique exploits the division of the data center network in VLANs. We evaluate its performance based on traffic matrices collected in data center networks and show good improvements compared to the standard spanning tree protocol with up to 16 VLANs.

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

local search
multiple spanning tree protocol
traffic engineering

data center traffic
combinatorial optimization


Quantum Maximum Entropy Principle and Quantum Statistics in Extended Thermodynamics By using a functional of the reduced density matrix, a formulation of quantum maximum entropy principle (QMEP) for the fractional exclusion statistics (FES) is proposed. In this way, compatibly with the uncertainty principle, we include a nonlocal description for the anyonic systems satisfying FES. By considering the Wigner formalism, we present a general scheme to develop a closed quantum hydrodynamic models in the framework of Extended Thermodynamics. Accordingly, the QMEP including FES is here asserted as the most advanced formulation of the fundamental principle of quantum statistical mechanics.

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

quantum maximum entropy principle
extended thermodynamics


Subspace method for efficient face recognition using a combination of radon transform and KL expansion This paper describes an efficient face recognition method using a combination of the Radon transform and the KL expansion. In this paper, each facial image is transformed into many sets of line integrals resulting from the Radon transform in 2D space. Based on this transformation, a new face-recognition method is proposed by using many subspaces generated from the vector spaces of the Radon transform. The efficiencies of the proposed method are proved by the classification rate of 100% in the experimental results, and the reduction to O(n(4)) instead of O(n(6)) of the operation complexity in KL(Karhunen-Loeve) expansion, where n is the size of sample images.

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

kl transform
eigenvectors
classification confidence


Three-phase unbalance of distribution systems: Complementary analysis and experimental case study Three-phase unbalance is a familiar issue for power system researchers and engineers. This can introduce additional power losses in distribution network in steady states due to both negative and zero sequence components. It could also limit the loading capability of distribution transformers, well below their nominal ratings. There are many voltage and current unbalance definitions (e.g., IEEE and NEMA) for three-phase three-wire systems, assuming zero sequence currents to be of negligible practical value, for they cannot flow in three-wire systems. However, the zero sequence unbalance has significant current magnitude in three-phase with four-wire distribution networks, particularly in developing countries. Hence, this paper concentrates on the distribution unbalance, completing the available definitions in order to maintain tangible relationships between the level of unbalance and the cited consequences in distribution networks. Furthermore, practical works were performed on 11 selected 20kV/0.4kV substations within Tehran North-West Distribution System (TNWDS), where data loggers have been installed for 7days to measure and record operating conditions of substations. Then, detailed analysis and assessment are suggested on empirical data to substantiate the presented complementary definitions and relationships.

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

unbalance
distribution systems
substations
power losses