An adaptive routing algorithm for WK-recursive topologies This paper presents an easy and straightforward routing algorithm for WK-recursive topologies. The algorithm, based on adaptive routing, takes advantage of the geometric properties of such topologies. Once a source node S and destination node D have been determined for a message communication, they characterize, at some level I, two virtual nodes hl-vn(S-D) and hl-vn(D-S) that respectively contain S but not D and D but not S. Such virtual nodes characterize other N-d-2 (where N-d is the node degree for a fixed topology) virtual nodes hl-vn(I-SD) of the same level that contain neither S nor D. Consequently, it is possible to locate N-d-2 triangles whose vertices are these virtual nodes with property to share the same path, called the self-routing path, directly connecting hl-vn(S-D) to hl-vn(D-S). When the self-routing path is unavailable to transmit a message from S to D because of deadlock, fault, and congestion conditions, the routing strategy can follow what we call the triangle rule to deliver it. The proposed communication scheme has the advantage that 1) it is the same for all three conditions; 2) each node of a WK-recursive network, to transmit messages, does not require any information about their presence or location. Furthermore, this routing algorithm is able to tolerate up to [N-d(N-d-3)/2 + 1]N-d(l)-1/N-d-1 faulty links.

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

interconnection network topology
scalability
deadlock freedom
communication overhead
fault tolerancy


Linking business and requirements engineering: is solution planning a missing activity in software product companies? A strong link between strategy and product development is important, since companies need to select requirements for forthcoming releases. However, in practice, connecting requirements engineering (RE) and business planning is far from trivial. This paper describes the lessons learned from four software product companies that have recognized the need for more business-oriented long-term planning. The study was conducted using the action research approach. We identified five practices that seem to strengthen the link between business decisions and RE. These are (1) explicating the planning levels and time horizons; (2) separating the planning of products business goals from R&D resource allocation; (3) planning open-endedly with a pre-defined rhythm; (4) emphasizing whole-product thinking; and (5) making solution planning visible. To support whole-product thinking and solution planning, we suggest that companies create solution concepts. The purpose of the solution concept is to provide a big picture of the solution and guide RE activities.

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

market-driven requirements engineering
roadmapping
long-term product planning


Polygon interpolation for serial cross sections In this paper, a new technique for contour interpolation between slices is presented. We assumed that contour interpolation is equivalent to the interpolation of a polygon that approximates the object shape. The location of each polygon vertex is characterized by a set of parameters. Polygon interpolation can be performed on these parameters. These interpolated parameters are then used to reconstruct the vertices of the new polygon. Finally, the contour is approximated from this polygon using a cubic spline interpolation. This new technique takes into account the shape, the translation, the size, and the orientation of the object's contours. A comparison with regular shape-based interpolation is made on several object contours. The preliminary results show that this new method yields a better contour and is computationally more efficient than shape-based interpolation. This technique can be applied to gray-level images too. The interpolation result of an MR image does not show artifact of intermediate substance commonly seen in a typical linear gray-level interpolation.

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

image interpolation
polygon approximation
shape-based interpolation


WKC-OWA, A NEW NEAT-OWA OPERATOR TO AGGREGATE INFORMATION IN DEMOCRATIC DECISION PROBLEMS In all decision making processes, the use of aggregation operators is necessary. Democratic decision problems cannot be considered a usual decision task due to the subjectivity of human' opinions and the complexity of social environments. To model these processes, the concept of work committee is used, where every citizen's opinion is represented in heterogeneous groups and aggregated to obtain a representative final opinion for the problem. In these environments, traditional operators don't represent the concept of discussion groups used in social models producing inadequate aggregations for these types of problems. The purpose of this paper is to present a new OWA operator where the weights are a function of the aggregate values in order to model the work committee and aggregate the citizens' opinions in democratic decision problems.

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

aggregation information
neat-owa
group decision making
participative democracy
e-democracy


Finding the Maximum Eigenvalue of Essentially Nonnegative Symmetric Tensors via Sum of Squares Programming Finding the maximum eigenvalue of a tensor is an important topic in tensor computation and multilinear algebra. Recently, for a tensor with nonnegative entries (which we refer it as a nonnegative tensor), efficient numerical schemes have been proposed to calculate its maximum eigenvalue based on a PerronFrobenius-type theorem. In this paper, we consider a new class of tensors called essentially nonnegative tensors, which extends the concept of nonnegative tensors, and examine the maximum eigenvalue of an essentially nonnegative tensor using the polynomial optimization techniques. We first establish that finding the maximum eigenvalue of an essentially nonnegative symmetric tensor is equivalent to solving a sum of squares of polynomials (SOS) optimization problem, which, in its turn, can be equivalently rewritten as a semi-definite programming problem. Then, using this sum of squares programming problem, we also provide upper and lower estimates for the maximum eigenvalue of general symmetric tensors. These upper and lower estimates can be calculated in terms of the entries of the tensor. Numerical examples are also presented to illustrate the significance of the results.

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

symmetric tensors
maximum eigenvalue
sum of squares of polynomials


Ausgewhlte technologische Entwicklungen in der Hochspannungstechnik Die Wende in der Energiepolitik stellt die Hochspannungstechnik als Schlsseltechnologie fr eine nachhaltige, ausfallsichere, umweltfreundlichere und effiziente Energieversorgung vor neue Herausforderungen. Dieser Artikel beleuchtet ausgewhlte technologische Entwicklungen der Hochspannungstechnik. Besondere Bedeutung kommt dabei der Entwicklung in der Isolierstofftechnik, z. B. neue, umweltfreundliche Gase oder Gasgemische, biologische oder synthetische Isolierflssigkeiten sowie neuen Systemen von Feststoffisolierungen zu. Einfluss auf diese Entwicklungen nimmt auch die Nanotechnologie im Bereich der Nanodielectrics bzw. der Nanofluids. Zu diesen Entwicklungen kommen auch die neuen Mglichkeiten in der Messtechnik und der Diagnostik, die wesentlich fr die Qualitt der Systeme sind, wie etwa die Teilentladungsdiagnostik oder die Messung der elektrischen Leitfhigkeit der verschiedenen Isolierstoffe.

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


A real world object modeling method for creating simulation environment of real-time systems Most real-time embedded control software feature complex interactions with asynchronous inputs and environment objects, and a meaningful simulation of a real-time control software specification requires realistic simulation of its environment. Two problems that need to be addressed in the simulation of a target software system and its environment: First, integration and simulation of the specifications of a target software system and its artificial environment are often performed too late in the lifecycle to provide any significant value. Second, real world objects in the environment usually have spatial characteristics (form) such as shape, motion, etc. that must be specified for simulation, and there is no method to express these spatial characteristics at various levels of abstraction that are adequate for the required simulation fidelity. To address these problems, we have developed a method that supports incremental specification and simulation of both the target software system and its environmental objects. The method includes: (1) a specification method for behavior, function, and form integrated objects; (2) form specification primitives that abstract common spatial characteristics of real world objects, their typical spatial relations, and spatial interactions; and (3) a methodology that refines, verifies, and validates behavior, function, and form specification of both the real-time embedded control software and its environment in a systematic and incremental manner. The proposed specification, verification, and validation method has been applied to a robot control system example to demonstrate its effectiveness and usefulness.

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

real-time control software
requirement specification


Subtle facial expression recognition using motion magnification This paper proposes a novel method for subtle facial expression recognition that uses motion magnification to transform subtle expressions into corresponding exaggerated ones. Motion magnification consists of four steps: First, active appearance model (AAM) fitting extracts 70 facial feature points in the face image sequence. Second, the face image sequence is aligned using the three feature points (two eyes and nose tip). Third, the motion vectors of 27 feature points are estimated using the feature point tracking method. Finally, exaggerated facial expressions are obtained by magnifying the motion vectors of the 27 feature points. After motion magnification, the exaggerated facial expressions are recognized as follows: first, the shape and appearance features are obtained by projecting the exaggerated facial expression image to the AAM shape and appearance model. Second, support vector machines (SVM) are used to classify shape and appearance features. Experimental results show that proposed subtle facial recognition rate is 88.125% for the 80 facial expression images in the SFED2007 database.

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

subtle facial expression recognition
motion magnification
feature point tracking

motion estimation
active appearance models


Cooperative scheduling mechanism for large-scale peer-to-peer computing systems Over recent years, peer-to-peer (P2P) systems have become an important part of Internet. Millions of users have been attracted to their structures and services. P2P computing is a distributed computing paradigm that uses Internet to connect thousands, or even millions, of users into a single large virtual computer based on the sharing of computational resources. One of the most critical aspects to the design of P2P computing systems is the development of scheduling techniques to manage the computational resources efficiently and in a scalable way. This paper proposes a cooperative scheduling mechanism with a two-level topology designed to work on large-scale distributed computing P2P systems. Our main contribution is proposing three criteria that only use local information to schedule tasks thus providing scalability to the overall scheduling system. By setting up these three criteria, the system can be easily adapted to work efficiently with very different kinds of distributed applications. The extensive experimentation carried out justifies the importance of good scheduling in such heterogeneous systems, but also emphasizes the importance of having a scheduling algorithm capable of being adapted to the requirements of different kinds of application.

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

super-peer
overlays
distributed and centralized scheduling


Position control of shape memory alloy actuator based on the generalized Prandtl-Ishlinskii inverse model Hysteresis and significant nonlinearities in the behavior of Shape Memory Alloy (SMA) actuators encumber effective utilization of these actuator. Due to these effects, the position control of SMA actuators has been a great challenge in recent years. Literature review of the research conducted in this area shows that using the inverse of the phenomenological hysteresis models can compensate the hysteresis of these actuators effectively. But, inverting some of these models, such as Preisach model, is numerically a complex task. However, the generalized Prandtl-Ishlinskii model is analytically invertible, and therefore can be implemented conveniently as a feedforward controller for compensating hysteresis nonlinearities effects in SMA actuators. In this paper a feedforward-feedback controller is used to control the tip deflection of a large deflected flexible beam actuated by an SMA actuator wire. The feedforward part of the control system is based on the generalized Prandtl-Ishlinskii inverse model while a conventional proportional-integral feedback controller is added to the feedforward controller to increase the accuracy together with eliminating the steady state error in position control process. Experimental results show that the proposed controller performs well in terms of achieving small overshoot and undershoot for square wave tracking as well as small tracking errors for sinusoidal trajectory. It has also great capability for tracking hysteresis minor loops. (C) 2012 Elsevier Ltd. All rights reserved.

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

position control
shape memory alloy actuator
inverse model


Conjunction and disjunction operations for digital fuzzy hardware Fuzzy systems have been explored in diverse application fields which require reaching fuzzy inferences at high computer rates. To accomplish this task, fuzzy hardware is the best choice. At inference engine, conjunction and disjunction operations play a very important role for decision making. Common operations in existing fuzzy hardware are minimum, maximum, algebraic product and probabilistic sum. In order to extend the applicability of existing fuzzy hardware, it is necessary to consider a wider range of operations. It is even desirable to have configurable circuits which take advantage of hardware resources. This work presents the hardware implementation of configurable circuits for the realization of diverse fuzzy t-norm and t-conorm operations. Resultant circuits are low hardware resource consumers which makes them efficient to be used as add-in modules for existing fuzzy hardware in FPGA or ASIC. Comparative results are presented showing the advantages of these circuits.

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

fuzzy system
digital hardware
t-norm
t-conorm


The branching problem in generalized power solutions to differential equations Generalized power asymptotic expansions of solutions to differential equations that depend on parameters are investigated. The changing nature of these expansions as the parameters of the model cross critical values is discussed. An algorithm to identify these critical values and generate the generalized power series for distinct families of solutions is presented, and as an application the singular behavior of a cosmological model with a nonlinear dissipative fluid is obtained. This algorithm has been implemented in the computer algebra system Maple. (C) 2004 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 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

nonlinear ordinary differential equations


The Role of Evaluation-Driven Rejection in the Successful Exploration of a Conceptual Space of Stories Evaluation processes are a basic component of creativity. They guide not only the pure judgement about a new artefact but also the generation itself, as creators constantly evaluate their own work. This paper proposes a model for automatic story generation based on the evaluation of stories. A model of how quality in stories is evaluated is presented, and two possible implementations of the generation guided by this evaluation are shown: exhaustive space exploration and constrained exploration. A theoretical model and its implementation are explained and validation of the evaluation function through comparison with human criteria is described.

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

reader model
conceptual space exploration


Inelastic behavior modelling of concrete in low and high strain rate dynamics This work deals with response modeling of concrete for dynamic loading. As in statics one has to account for substantial difference of inelastic response in tension and compression, the anisotropy of the response induced by complex cracking patterns and the need of irreversible deformation due to frictional sliding or non-closing cracks. On the top of that, in dynamics, we also have to handle the hardening or softening phenomena which explain a particular hysteretic response for a given cyclic loading as well as the strain rate effects. The latter should further be addressed separately for high as opposed to low strain rates. The main goal of this work is to develop the concrete constitutive model capable of reproducing the salient features experimentally observed. We present one theoretical development for the constitutive model of concrete at low strain rates. The same kind of developments are then carried out for high strain dynamic behavior. Both chosen models belong to the class of coupled plasticity damage models briefly presented.

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


A geometric construction of iterative functions of order three to solve nonlinear equations In this paper we consider a geometric construction of iteration functions of order three to develop cubically convergent iterative methods for solving nonlinear equations. This construction can be applied to any iteration function of order two to develop an iteration function of order three. Some examples are given of deriving several third-order iteration methods, and several numerical results follow to illustrate the performance of the derived methods.

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

iterative methods
iteration function
nonlinear equations

newtons method
order of convergence
root-finding


A template-based baseball video scene classification using efficient playfield segmentation In this paper, we present an effective and efficient framework for baseball video scene classification. The results of scene classification can be able to provide the ground for baseball video abstraction and high-level event extraction. In general, most conventional approaches are shot-based, which shot change detection and key-frame extraction are necessary prerequisite procedures. On the contrary, we propose a frame-based approach. In our scene classification framework, an efficient playfield segmentation technique is proposed, and then the reduced field maps are utilized as scene templates. Because the shot change detection and the key-frame extraction are not required in proposed method, the new framework is very simple and efficient. The experimental results have demonstrated that the effectiveness of our proposed framework for baseball videos scene classification, and it can be easily extended the template-based approach to other kinds of sports videos.

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

scene classification
baseball video
playfield segmentation


A STUDY ON THE SUDDEN DEATH AND SUDDEN BIRTH OF ENTANGLEMENT IN AN OPEN SYSTEM In this paper, we consider the entanglement dynamics of two cavities interacting with independent reservoirs. When the cavity entanglement suddenly disappeared, the reservoir entanglement suddenly and necessarily appears. We study the effect of purity of initial entangled state of two cavities on the entanglement evolution, and acquire that the purity of initial entangled state of two cavities can control the apparition time of the entanglement sudden death and the entanglement sudden birth. Also, we find that the conditions on the apparition of the entanglement sudden death and the entanglement sudden birth can be generalized when the initial entangled state of cavities is not pure, which is a complement to the result in the paper [Phys. Rev. Lett. 101 (2008) 080503] for the pure case.

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


Rapid development of scalable scientific software using a process oriented approach Scientific applications are often not written with multiprocessing, cluster computing or grid computing in mind. This paper suggests using Python and PyCSP to structure scientific software through Communicating Sequential Processes. Three scientific applications are used to demonstrate the features of PyCSP and how networks of processes may easily be mapped into a visual representation for better understanding of the process workflow. We show that for many sequential solutions, the difficulty in implementing a parallel application is removed. The use of standard multi-threading mechanisms such as locks, conditions and monitors is completely hidden in the PyCSP library. We show the three scientific applications: kNN, stochastic minimum search and McStas to scale well on multi-processing, cluster computing and grid computing platforms using PyCSP.

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

communicating sequential processes
grid computing
python


Supervised automatic evaluation for summarization with voted regression model The high quality evaluation of generated summaries is needed if we are to improve automatic summarization systems. Although human evaluation provides better results than automatic evaluation methods, its cost is huge and it is difficult to reproduce the results. Therefore, we need an automatic method that simulates human evaluation if we are to improve our summarization system efficiently. Although automatic evaluation methods have been proposed, they are unreliable when used for individual summaries. To solve this problem, we propose a supervised automatic evaluation method based on a new regression model called the voted regression model (VRM). VRM has two characteristics: (1) model selection based on corrected AIC to avoid multicollinearity, (2) voting by the selected models to alleviate the problem of overfitting. Evaluation results obtained for TSC3 and DUC2004 show that our method achieved error reductions of about 1751% compared with conventional automatic evaluation methods. Moreover, our method obtained the highest correlation coefficients in several different experiments.

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

automatic summarization
automatic evaluation
regression model

text summarization challenge
document understanding conference


an analytical model for evaluating utilization of tcp reno This paper presents an analytical model for TCP Reno. For this model an algorithm is derived to calculate the utilization and packet drop rate. The accuracy of the model is verified by comparing the calculated results versus simulation results. These results show that the TCP Reno is superior to another version(Tahoe) by having higher percentage of utilization and lower percentage of packet dropping rate.

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

fast recovery
congestion control
markovian model


Fast payment schemes for truthful mechanisms with verification In this paper we study optimization problems with verifiable one-parameter selfish agents introduced by Auletta et al. [V. Auletta, R. De Prisco, P. Perma, P. Persiano, The power of verification for one-parameter agents, in: Proceedings of the 31st International Colloquium on Automata, Languages and Programming, ICALP, in: LNCS, vol. 3142,2004, pp. 171-182]. Our goal is to allocate load among the agents, provided that the secret data of each agent is a single positive real number: the cost they incur per unit load. In such a setting the payment is given after the load completion, therefore if a positive load is assigned to an agent, we are able to verify if the agent declared to be faster than she actually is. We design truthful mechanisms when the agents' type sets are upper-bounded by a finite value. We provide a truthful mechanism that is c . (1 + epsilon)-approximate if the underlying algorithm is c-approximate and weakly-monotone. Moreover, if type sets are also discrete, we provide a truthful mechanism preserving the approximation ratio of its algorithmic part. Our results improve the existing ones which provide truthful mechanisms dealing only with finite type sets and do not preserve the approximation ratio of the underlying algorithm. Finally, we give applications for our payment schemes. Firstly, we give a full characterization of the Q parallel to C-max problem by using our techniques. Even if our payment schemes need upper-bounded type sets, every instance of Q parallel to C-max can be "mapped" into an instance with upper-bounded type sets preserving the approximation ratio. In conclusion, we turn our attention to binary demand games. In particular, we show that the Minimum Radius Spanning Tree admits an exact truthful mechanism with verification achieving time (and space) complexity of the fastest centralized algorithm for it. This contrasts with a recent truthful mechanism for the same problem [G. Proietti, P. Widmayer, A truthful mechanism for the non-utilitarian minimum radius spanning tree problem, in: Proceedings of the 17th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA, ACM Press, 2005, pp. 195-202] which pays a linear factor with respect to the complexity of the fastest centralized algorithm. Such a result is extended to several binary demand games studied in literature. (C) 2008 Elsevier B.V. All rights reserved.

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

algorithmic mechanism design
one-parameter agents


A novel approach for decreasing CVT transients in distance protection using artificial neural network This paper presents the design of a novel method for improvement of the operation of distance relays during capacitive voltage transformer transients using artificial neural network. The proposed module uses voltage and current signals to learn the hidden relationship existing in the input patterns. Simulation studies are preformed and the influence of changing system parameters, such as fault resistance and source impedance is studied. Details of the design procedure and the results of performance studies with the proposed relay are given in the paper. Performance studies results show that the proposed algorithm decreases the effects of CVT transients and is fast and accurate.

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


Reversal effect of low-intensity ultrasound on adriamycin-resistant human hepatoma cells in vitro and in vivo The aim of this study was to determine whether the ultrasound, with a dosage that did not lead to acute and delayed inhibition, could potentiate the cytotoxicity of adriamycin to human hepatoma resistant cell line HepG2 both in vitro and in vivo. In order to determine whether low-intensity ultrasound could reverse resistance in adriamycin-resistant human hepatoma cell line HepG2/ADM in vitro, cells were subjected to a variable level of ultrasound. The results showed that survival rates were decreased in groups in which ultrasound and adriamycin were exerted. The same effect of low-intensity ultrasound was also observed in the xenograft tumor experiment. Furthermore, transmission electron microscope revealed the cavitation effects play the determining role in accelerating transmembrane transportation, suggesting that low-intensity ultrasound altered the cell membrane thus resulting in change in adriamycin uptake into HepG2/ADM cells. Further investigation of the underlying mechanisms showed that the reversal effect of low-intensity ultrasound on adriamycin-resistant human hepatoma cells was attributed to the downregulation of the multidrug resistant genes, MDR1 and MRP1, in both mRNA and protein expression. In addition, downregulation of MDR1 and MRP1 was detected in HepG2/ADM xenograft tumor treated with adriamycin and ultrasound. These observations suggest the use of ultrasound could increase cytotoxicity attributable to adriamycin in chemoresistant human hepatoma cancer cells. Ultrasound is a promising therapeutic modality for refractory hepatoma patients.

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


ROBUST PCA METHODS FOR COMPLETE AND MISSING DATA In this paper, we consider and introduce methods for robust principal component analysis (P CA), including also cases where there are missing values in the data. PCA is a widely applied standard statistical method for data preprocessing, compression, and analysis. It is based on the second-order statistics of the data and is optimal for Gaussian data, but it is often applied to data sets having unknown or other types of probability distributions. PCA can be derived from minimization of the mean-square representation error or maximization of variances under orthonormality constraints. However, these quadratic criteria are sensitive to outliers in the data and long-tailed distributions, which may considerably degrade the results given by PCA. We introduce robust methods for estimation of both the PCA eigenvectors directly or the PCA subspace spanned by them. Experimental results show that our methods provide often better results than standard PCA when outliers are present in the data. Furthermore, we extend our methods to incomplete data with missing values. The problems arising in such cases have several features typical for nonlinear models.

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

principal component analysis
missing values

robustness
gradient algorithms
imputation method
and nearest neighbor method


New Approximation Bounds for LPT Scheduling We provide new bounds for the worst case approximation ratio of the classic Longest Processing Time (LPT) heuristic for related machine scheduling (Q parallel to C(max)). For different machine speeds, LPT was first considered by Gonzalez et al. (SIAM J. Comput. 6(1): 155-166, 1977). The best previously known bounds originate from more than 20 years back: Dobson (SIAM J. Comput. 13(4): 705-716, 1984), and independently Friesen (SIAM J. Comput. 16(3): 554-560, 1987) showed that the worst case ratio of LPT is in the interval (1.512, 1.583), and in (1.52, 1.67), respectively. We tighten the upper bound to 1+ root 3/3 approximate to 1.5773, and the lower bound to 1.54. Although this improvement might seem minor, we consider the structure of potential lower bound instances more systematically than former works. We present a scheme for a job-exchanging process, which, repeated any number of times, gradually increases the lower bound. For the new upper bound, this systematic method together with a new idea of introducing fractional jobs, facilitated a proof that is surprisingly simple, relative to the result. We present the upper-bound proof in parameterized terms, which leaves room for further improvements.

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


Genetically identical irises have texture similarity that is not detected by iris biometrics ? As the standard iris biometric algorithm sees them, the left and right irises of the same person are as different as irises of unrelated people. Similarly, in terms of iris biometric matching, the eyes of identical twins are as different as irises of unrelated people. The left and right eyes of an individual or the eyes of identical twins are examples of genetically identical irises. In experiments with human observers viewing pairs of iris images acquired using an iris biometric system, we have found that there is recognizable similarity in the left and right irises of an individual and in the irises of identical twins. This result suggests that iris texture analysis different from that performed in the standard iris biometric algorithm may be able to answer questions that iris biometrics cannot answer.

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

genetically identical irises
texture analysis

ocular biometrics
iris recognition
periocular recognition
monozygotic twins


Learning Horn definitions: Theory and an application to planning A Horn definition is a set of Horn clauses with the same predicate in all head literals. In this paper, we consider learning non-recursive, first-order Horn definitions from entailment. We show that this class is exactly learnable from equivalence and membership queries. It follows then that this class is PAC learnable using examples and membership queries. Finally, we apply our results to learning control knowledge for efficient planning in the form of goal-decomposition rules.

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

horn definition
planning
control knowledge
queries

horn program
horn sentence
horn clause
learning from entailment
pac-learning


Advancing projections of phytoplankton responses to climate change through ensemble modelling ? We examined the performance of multiple lake and reservoir ecosystem models. The mean of all models was the best predictor of phytoplankton in a temperate lake relative to any individual model. Future climate warming scenarios predict increases in total phytoplankton biomass. Climate warming will facilitate higher yields of cyanobacteria relative to nutrient levels.

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


Variational data assimilation using targetted random walks The variational approach to data assimilation is a widely used methodology for both online prediction and for reanalysis. In either of these scenarios, it can be important to assess uncertainties in the assimilated state. Ideally, it is desirable to have complete information concerning the Bayesian posterior distribution for unknown state given data. We show that complete computational probing of this posterior distribution is now within the reach in the offline situation. We introduce a Markov chainMonte Carlo (MCMC) method which enables us to directly sample from the Bayesian posterior distribution on the unknown functions of interest given observations. Since we are aware that these methods are currently too computationally expensive to consider using in an online filtering scenario, we frame this in the context of offline reanalysis. Using a simple random walk-type MCMC method, we are able to characterize the posterior distribution using only evaluations of the forward model of the problem, and of the model and data mismatch. No adjoint model is required for the method we use; however, more sophisticated MCMC methods are available which exploit derivative information. For simplicity of exposition, we consider the problem of assimilating data, either Eulerian or Lagrangian, into a low Reynolds number flow in a two-dimensional periodic geometry. We will show that in many cases it is possible to recover the initial condition and model error (which we describe as unknown forcing to the model) from data, and that with increasing amounts of informative data, the uncertainty in our estimations reduces. Copyright (C) 2011 John Wiley & Sons, Ltd.

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

uncertainty quantification
probabilistic methods
stochastic problems
transport
incompressible flow
partial differential equations


Exploring organizational expansion modes and their associated communication system requirements: consolidation and complementation The expectation of firms following aggressive growth strategies is that firms expanding geographically will acquire extensive economic advantages unavailable to more conservative competitors. Growth-minded firms also believe that by integrating info-communication technology (ICT) within their regional infrastructures, distribution channels, and marketing approaches, they can achieve lower costs or enhanced differentiation within a broad scope of operations. Empirical evidence shows that many organizational expansions have been implemented utilizing two major expansion modes, consolidation and complementation. This research examines the modal properties of these approaches in terms of their configurational characteristics, economic rationales and managerial requirements. Viewed from a top-down perspective the modal properties further suggest the organization's management support system requirements. This study also identifies and explores the corresponding communication system requirements, especially for key dispersion-related communication configurations and systems. The desired practical effect of this research would be an increased awareness of and an incentive for commercial and industrial enterprises to include communication system requirements in their adopted expansion mode deliberations.

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

consolidation
complementation
communication system requirements


Generalized spatio-chromatic diffusion In this paper, a framework for diffusion of color images is presented. The method is based on the theory of thermodynamics of irreversible transformations which provides a suitable basis for designing correlations between the different color channels. More precisely, we derive an equation for color evolution which comprises a purely spatial diffusive term and a nonlinear term that depends on the interactions among color channels over space. We apply the proposed equation to images represented in several color spaces, such as RGB, CIELAB, Opponent colors, and IHS.

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


Multistage group-blind adaptive multiuser detector for reverse link in direct-sequence CDMA systems We develop a novel multistage group-blind multiuser detection technique for reverse link in multi-cell direct sequence (DS) code-division multiple access (CDMA) systems. This approach fully utilizes all known users' information, performs interference cancellation (IC) to suppress the interferers within the cell, and exploits blind adaptive decision-directed (DD) MMSE detector to suppress the inter-cell interference. This process can be made iterative and in the multistage process, the tentative decision bits from DD-MMSE detectors can be fed back to the IC part to make interference regeneration more accurate. A simplified RLS (SRLS) algorithm is derived particularly for DD-MMSE detectors and steady-state SIR performance of the SRLS algorithm is analyzed. It is shown that the proposed detector with SRLS algorithm is sufficient to perform accurate multiuser detection and has significant performance gain over that of the pure blind detectors and the non-blind detectors for the given scenario. Moreover, compared with the conventional RLS algorithm, the SRLS algorithm has lower computational complexity and the convergence speed is faster. We also develop two group-blind channel estimation methods to estimate the effective signature waveforms in multipath fading channel. It is seen that the group-blind channel estimation methods using updated received signal correlation matrix can effectively combat the mismatch problem faced by pure blind detectors.

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

code-division multiple access
direct sequence spread spectrum
interference suppression
blind detector


Emergent rough set data analysis Purpose - The rough set concept is a new mathematical approach to imprecision, vagueness and uncertainty. This paper introduces the emergent computational paradigm and discusses its applicability and potential in rough set theory. Design/methodology/approach - A conceptual discussion and approach are taken. Findings - For accepting a system is displaying an emergent behavior, the system should be constructed by describing local elementary interactions between components in different ways of describing global behavior and properties of the running system over a period of time. The proposals of an emergent computation structure for implementing basic rough sets theory operators are also given in this paper. Originality/value - The results will have an important impact on the development of new methods for knowledge discovery in databases, in particular for development of algorithmic methods for pattern extraction from data.

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


Enhancement of DFT-calculations at petascale: Nuclear Magnetic Resonance, Hybrid Density Functional Theory and Car-Parrinello calculations One of the most promising techniques used for studying the electronic properties of materials is based on Density Functional. Theory (OFF) approach and its extensions. DFT has been widely applied in traditional solid state physics problems where periodicity and symmetry play a crucial role in reducing the computational workload. With growing compute power capability and the development of improved OFT methods, the range of potential applications is now including other scientific areas such as Chemistry and Biology. However, cross disciplinary combinations of traditional Solid-State Physics, Chemistry and Biology drastically improve the system complexity while reducing the degree of periodicity and symmetry. Large simulation cells containing of hundreds or even thousands of atoms are needed to model these kind of physical systems. The treatment of those systems still remains a computational challenge even with modern supercomputers. In this paper we describe our work to improve the scalability of Quantum ESPRESSO (Giannozzi et al., 2009 [3]) for treating very large cells and huge numbers of electrons. To this end we have introduced an extra level of parallelism, over electronic bands, in three kernels for solving computationally expensive problems: the Sternheimer equation solver (Nuclear Magnetic Resonance, package QE-GIPAW), the Fock operator builder (electronic ground-state, package PWscf) and most of the Car-Parrinello routines (Car-Parrinello dynamics, package CP). Final benchmarks show our success in computing the Nuclear Magnetic Response (NMR) chemical shift of a large biological assembly, the electronic structure of defected amorphous silica with hybrid exchange-correlation functionals and the equilibrium atomic structure of height Porphyrins anchored to a Carbon Nanotube, on many thousands of CPU cores. (C) 2013 Elsevier B.V. All rights reserved.

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

parallelization
k-points
plane waves dft
car-parrinello
exact exchange


Characteristics of an envelope model for laser-plasma accelerator simulation Simulation of laser-plasma accelerator (LPA) experiments is computationally intensive due to the disparate length scales involved. Current experiments extend hundreds of laser wavelengths transversely and many thousands in the propagation direction, making explicit PIC simulations enormously expensive and requiring massively parallel execution in 3D. Simulating the next generation of LPA experiments is expected to increase the computational requirements yet further, by a factor of 1000. We can substantially improve the performance of LPA simulations by modeling the envelope evolution of the laser field rather than the field itself. This allows for much coarser grids, since we need only resolve the plasma wavelength and not the laser wavelength, and therefore larger timesteps can be used. Thus an envelope model can result in savings of several orders of magnitude in computational resources. By propagating the laser envelope in a Galilean frame moving at the speed of light, dispersive errors can be avoided and simulations over long distances become possible. The primary limitation to this envelope model is when the laser pulse develops large frequency shifts, and thus the slowly-varying envelope assumption is no longer valid. Here we describe the model and its implementation, and show rigorous benchmarks for the algorithm, establishing second-order convergence and correct laser group velocity. We also demonstrate simulations of LPA phenomena such as self-focusing and meter-scale acceleration stages using the model. (C) 2010 Elsevier Inc. All rights reserved.

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

plasma accelerator
laser-plasma acceleration
laser wakefield acceleration


Multiple asset replacement analysis under variable utilization and stochastic demand The economic life of an asset is dependent on a variety of factors, including deterioration and obsolescence. While obsolescence is generally a result of changes external to the asset, such as technological change, deterioration is generally a result of how the asset is utilized over its lifetime. If multiple assets are available to meet demand and the assets must not continually operate at maximum capacity, then a decision-maker may have some control over asset utilization patterns by allocating workload. These utilization patterns directly impact operating costs and salvage values and thus have a strong influence on the optimal replacement time of the assets. In this paper, we examine asset replacement decisions, based on age and cumulative utilization, under variable periodic utilization with multiple, parallel assets under various cost and demand assumptions. We provide an efficient optimal solution procedure through the use of stochastic dynamic programming, illustrate a threshold optimal policy under common cost assumptions and provide a method to easily examine solutions for the two-asset case. Extensions to the n-asset case 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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O


Flexible-routing anonymous networks using optimal length of ciphertext We present an efficient Hybrid Mix scheme that provides both routing flexibility and the optimal length of ciphertext. Although it is rather easy to embed routing information in the ciphertext, and a scheme that provides the optimal length of ciphertext is already known, it is not a trivial task to achieve both properties all at the same time. A critical obstacle for providing the optimal length of ciphertext is the session-key encapsulation header in a ciphertext that carries the encrypted session-key to each router, which linearly increases according to the number of intermediate routers. We solve this problem by improving the previously reported Hybrid Mix scheme such that the resulting scheme benefits from routing flexibility with a constant length of such headers. Our basic scheme is only secure against honest, but curious intermediate routers. Therefore, we further address the robustness issue to prevent malicious behavior by incorporating and improving an existing efficient approach based on the Message Authentication Code.

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


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

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

semantic web
description logics
web ontology language
ontology debugging


Shared cache architectures for decision support systems In this paper we evaluate two shared-cache architectures for small-scale multiprocessors. We vary shared cache sizes from 8MB to 1GB, under various block sizes, cache organizations and sizes, and strategies for IO transactions. We use 12 bus trace samples obtained during the execution of a 100GB TPC-H on an eight-way multiprocessor. To deal with the cold-start misses at the beginning of each sample, we identify the sure misses which are known to be misses in the full trace. The difference between the total number of misses and the number of sure misses is the zone of uncertainty, which may be hits or misses in the full trace. It turns out that the zone of uncertainty is small enough in most cases that useful conclusions can be drawn. Our conclusions are that a single-cluster configuration with a shared cacheeven a very small onecan be very effective for TPC-H. We also show that the coherence traffic between shared caches in a multiple cluster system is very high in the context of TPC-H.

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

cache memory
trace-driven simulation
cold-start bias
tpc-h
io strategy


First-order system least squares and the energetic variational approach for two-phase flow This paper develops a first-order system least-squares (FOSLS) formulation for equations of two-phase flow. The main goal is to show that this discretization, along with numerical techniques such as nested iteration, algebraic multigrid, and adaptive local refinement, can be used to solve these types of complex fluid flow problems. In addition, from an energetic variational approach, it can be shown that an important quantity to preserve in a given simulation is the energy law. We discuss the energy law and inherent structure for two-phase flow using the AllenCahn interface model and indicate how it is related to other complex fluid models, such as magnetohydrodynamics. Finally, we show that, using the FOSLS framework, one can still satisfy the appropriate energy law globally while using well-known numerical techniques.

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

energetic variational approach
algebraic multigrid
nested iteration

multiphase flow
first-order system least squares


Task Pool Teams: a hybrid programming environment for irregular algorithms on SMP clusters Clusters of symmetric multiprocessors (SMPs) are popular platforms for parallel programming since they provide large computational power for a reasonable price. For irregular application programs with dynamically changing computation and data access behavior, a flexible programming model is needed to achieve efficiency. In this paper we propose Task Pool Teams as, a hybrid parallel programming environment to realize irregular algorithms on clusters of SMPs. Task Pool Teams combine task pools on single cluster nodes by an explicit message passing layer. They offer load balance together with multi-threaded, asynchronous communication. Appropriate communication protocols and task pool implementations are provided and accessible by an easy-to-use application programmer interface. As application examples we present a branch and bound algorithm and the hierarchical radiosity algorithm. Copyright (c) 2006 John Wiley & Sons, Ltd.

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

irregular algorithms
hybrid programming
smp clusters


New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures A secret-sharing scheme is a protocol by which a dealer distributes shares of a secret key among a set of n participants in such a way that only qualified subsets of participants can reconstruct the secret key from the shares they received, while unqualified subsets have no information about the secret key. The collection of all qualified subsets is called the access structure of this scheme. The information rate (resp. average information rate) of a secret-sharing scheme is the ratio between the size of the secret key and the maximum size (resp. average size) of the shares. In a weighted threshold scheme, each participant has his or her own weight. A subset is qualified if and only if the sum of the weights of participants in the subset is not less than the given threshold. Morillo et al. [19] considered the schemes for weighted threshold access structure that can be represented by graphs called k-weighted graphs. They characterized this kind of access structures and derived a result on the information rate. In this paper, we deal with the average information rate of the secret-sharing schemes for these structures. Two sophisticated constructions are presented, each of which has its own advantages and both of them perform very well when n/k is large.

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

secret-sharing scheme
optimal information rate
optimal average information rate
weighted threshold access structure
complete multipartite covering


implicitly-multithreaded processors This paper proposes the Implicitly-MultiThreaded (IMT) architecture to execute compiler-specified speculative threads on to a modified Simultaneous Multithreading pipeline. IMT reduces hardware complexity by relying on the compiler to select suitable thread spawning points and orchestrate inter-thread register communication. To enhance IMT's effectiveness, this paper proposes three novel microarchitectural mechanisms: (1) resource- and dependence-based fetch policy to fetch and execute suitable instructions, (2) context multiplexing to improve utilization and map as many threads to a single context as allowed by availability of resources, and (3) early threadinvocation to hide thread start-up overhead by overlapping one thread's invocation with other threads' execution.We use SPEC2K benchmarks and cycle-accurate simulation to show that an microarchitecture-optimized IMT improves performance on average by 24\% and at best by 69\% over an aggressive superscalar. We also compare IMT to two prior proposals, TME and DMT, for speculative threading on an SMT using hardware-extracted threads. Our best IMT design outperforms a comparable TME and DMT on average by 26\% and 38\% respectively.

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

communication
policy
use
simulation
design
performance
pipeline
context
simultaneous multithreading
paper
select
thread
availability
architecture
multiplexing
complexity
hardware
resource

point benchmark microarchitecture processor dependencies speculating instruction compilation multithreading effect


A better Beta for the H measure of classification performance ? We propose a modified standard distribution for the H measure in the case of unbalanced datasets. We emphasize the importance of the H measure as a coherent alternative to the AUC. We introduce severity ratios to facilitate problem-specific application of the H measure.

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

supervised classification
classifier performance
roc curve


Indoor Inter-Robot Distance Measurement in Collaborative Systems This paper focuses on the problem of autonomous distance calculation between multiple mobile robots in collaborative systems. We propose and discuss two distinct methods, specifically developed under important design and functional constraints, such as the speed of operation, accuracy, energy and cost efficiency. Moreover, the methods are designed to be applied to indoor robotic systems and are independent of fixed landmarks. The measurement results, performed on the CORE-TX case study, show that the proposed solutions meet the design requirements previously specified.

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

collaborative system
indoor communication
sonar


Testing whether a digraph contains H-free k-induced subgraphs A subgraph induced by k vertices is called a k-induced subgraph. We prove that determining if a digraph G contains H-free k-induced subgraphs is Omega(N-2)-evasive. Then we construct an is an element of-tester to test this property. (An E-tester fora property Pi is guaranteed to distinguish, with probability at least 2/3, between the case of G satisfying Pi and the case of G being is an element of-far from satisfying Pi.)The query complexity of the E-tester is independent of the size of the input digraph. An (E,)is an element of-tester fora property Pi is an E-tester for Pi that is furthermore guaranteed to accept with probability at least 2/3 any input that is delta-close to satisfying Pi. This paper presents an (is an element of, delta)-tester for whether a digraph contains H-free k-induced subgraphs. (C) 2008 Elsevier B.V. All rights reserved.

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

directed graphs
property testing
randomized algorithm


Brain fingerprinting: a comprehensive tutorial review of detection of concealed information with event-related brain potentials Brain fingerprinting (BF) detects concealed information stored in the brain by measuring brainwaves. A specific EEG event-related potential, a P300-MERMER, is elicited by stimuli that are significant in the present context. BF detects P300-MERMER responses to words/pictures relevant to a crime scene, terrorist training, bomb-making knowledge, etc. BF detects information by measuring cognitive information processing. BF does not detect lies, stress, or emotion. BF computes a determination of information present or information absent and a statistical confidence for each individual determination. Laboratory and field tests at the FBI, CIA, US Navy and elsewhere have resulted in 0% errors: no false positives and no false negatives. 100% of determinations made were correct. 3% of results have been indeterminate. BF has been applied in criminal cases and ruled admissible in court. Scientific standards for BF tests are discussed. Meeting the BF scientific standards is necessary for accuracy and validity. Alternative techniques that failed to meet the BF scientific standards produced low accuracy and susceptibility to countermeasures. BF is highly resistant to countermeasures. No one has beaten a BF test with countermeasures, despite a $100,000 reward for doing so. Principles of applying BF in the laboratory and the field are discussed.

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

brain fingerprinting
detection of concealed information


Unsupervised image segmentation evaluation and refinement using a multi-scale approach In this study, a multi-scale approach is used to improve the segmentation of a high spatial resolution (30cm) color infrared image of a residential area. First, a series of 25image segmentations are performed in Definiens Professional 5 using different scale parameters. The optimal image segmentation is identified using an unsupervised evaluation method of segmentation quality that takes into account global intra-segment and inter-segment heterogeneity measures (weighted variance and Morans I, respectively). Once the optimal segmentation is determined, under-segmented and over-segmented regions in this segmentation are identified using local heterogeneity measures (variance and Local Morans I). The under- and over-segmented regions are refined by (1) further segmenting under-segmented regions at finer scales, and (2) merging over-segmented regions with spectrally similar neighbors. This process leads to the creation of several segmentations consisting of segments generated at three different segmentation scales. Comparison of single- and multi-scale segmentations shows that identifying and refining under- and over-segmented regions using local statistics can improve global segmentation results.

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

object-based image analysis
multi-scale segmentation
under-segmentation
over-segmentation


Thermal annealing effect on electrical properties of metal nitride gate electrodes with hafnium oxide gate dielectrics in nano-metric MOS devices Electrical properties of hafnium oxide (HfO2) gate dielectric with various metal nitride gate electrodes, i.e., tantalum nitride (TaN), molybdenum nitride (MoN), and tungsten nitride (WN), were studied over a range of HfO2 thicknesses, e.g., 2.510nm, and post-metal annealing (PMA) temperatures, e.g., 600C to 800C. The work function of the nitride gate electrode was dependent on the material and the post-metal annealing (PMA) temperature. The scanning transmission electron microscopy technique is used to observe the effect of PMA on the interfacial gate dielectric thickness. After high-temperature annealing, the metal nitride gates were suitable for NMOS. At the same PMA temperature, the oxide-trapped charges increased and the interface state densities decreased with the increase of the HfO2 thickness for TaN and WN gate electrodes. However, for MoN gate electrode the interface state density is almost independent of film thickness. Therefore, dielectric properties of the HfO2 high-k film depend not only on the metal nitride gate electrode material but also the post-metal annealing condition as well as the film thickness. During constant voltage stress of the MOS capacitors, an increase in the time-dependent gate leakage current is also observed.

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

nano-electronic device applications
high dielectrics materials


the prime factor non-binary discrete fourier transform and use of crystal_router as a general purpose communication routine We have implemented one of the Fast Fourier Transform algorithms, the Prime Factor algorithm (PFA), on the hypercube. On sequential computers, the PFA and other discrete Fourier transforms (DFT) such as the Winograd algorithm (WFA) are known to be very efficient. However, both algorithms require full data shuffling and are thus challenging to any distributed memory parallel computers. We use a concurrent communication algorithm, called the Crystal_Router for communicating shuffled data. We will show that the speed gained in reduced arithmetic compared to binary FFT is sufficient to overcome the extra communication requirement up to a certain number of processors. Beyond this point the standard Cooley-Tukey FFT algorithm has the best performance. We comment briefly on the application of the DFT to signal processing in synthetic aperture radar (SAR).

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

communication
point
use
factor
performance
data
general
algorithm
hypercube
distributed
signal processing

processor
requirements
applications
efficiency
computation
concurrency
standardization
memorialized
parallel computation
transformation


investigating and exploiting the bias of the weighted hypervolume to articulate user preferences Optimizing the hypervolume indicator within evolutionary multiobjective optimizers has become popular in the last years. Recently, the indicator has been generalized to the weighted case to incorporate various user preferences into hypervolume-based search algorithms. There are two main open questions in this context: (i) how does the specified weight influence the distribution of a fixed number of points that maximize the weighted hypervolume indicator? (ii) how can the user articulate her preferences easily without specifying a certain weight distribution function? In this paper, we tackle both questions. First, we theoretically investigate optimal distributions of ? points that maximize the weighted hypervolume indicator. Second, based on the obtained theoretical results, we propose a new approach to articulate user preferences within biobjective hypervolume-based optimization in terms of specifying a desired density of points on a predefined (imaginary) Pareto front. Within this approach, a new exact algorithm based on dynamic programming is proposed which selects the set of ? points that maximizes the (weighted) hypervolume indicator. Experiments on various test functions show the usefulness of this new preference articulation approach and the agreement between theory and practice.

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

hypervolume indicator
preference articulation


Exploring overlapping clusters using dynamic re-scaling and sampling Until recently, the aim of most text-mining work has been to understand major topics and clusters. Minor topics and clusters have been relatively neglected even though they may represent important information on rare events. We present a novel method for exploring overlapping clusters of heterogeneous sizes, which is based on vector space modeling, covariance matrix analysis, random sampling, and dynamic re-weighting of document vectors in massive databases. Our system addresses a combination of difficult issues in database analysis, such as synonymy and polysemy, identification of minor clusters, accommodation of cluster overlap, automatic labeling of clusters based on their document contents, and the user-controlled trade-off between speed of computation and quality of results. We conducted implementation studies with new articles from the Reuters and LA Times TREC data sets and artificially generated data with a known cluster structure to demonstrate the effectiveness of our 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 B I I B I I B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

covariance matrix analysis
random sampling
vector space modeling

clustering
text mining
dimensional reduction
latent semantic indexing (lsi)
principal component analysis (pca)


Median-pump wavelength assignment scheme for optical networks with parametric wavelength conversion This paper proposes a wavelength assignment scheme for optical networks with parametric wavelength conversion to minimize the number of wavelength converters when the number of wavelengths is given. Wavelength conversion is needed to reduce the number of wavelengths required in the network, since the number of wavelengths is limited. A parametric wavelength converter (PWC) can be used to reduce the number of wavelength converters because of its multiple wavelengths conversion function. PWC uses the pump wavelength to define original and converted wavelengths. The setting of the pump wavelength affects the converted wavelengths. Thus, the number of transmission wavelengths depends on the position of the pump wavelength. The proposed scheme is a heuristic scheme that considers the position of pump wavelength. An output wavelength that sets the pump wavelength near to the middle of the transmission wavelength band is selected. The proposed scheme designs each PWC to maximize the number of wavelength conversions supported. Numerical results with our examined networks indicate up to 37% reduction in the total number of converters required, compared to a scheme that the position of pump wavelength is not considered. Moreover, the reduction is 42% reduction compared to an optical network with single channel wavelength converters.

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

wavelength assignment
wavelength conversion


computable values can be classical In programming languages of universal power, the computational integers must be distinguished from the classical integers because of the divergent integer. Even the equational theory corresponding to evaluation of integer expressions is distinct from the theory of classical integers, and classical reasoning about computational integers yields inconsistencies. We show that there exist programming languages, actually extensions of the polymorphic lambda calculus, that have tremendous computing power and yet whose computational integers, or any other algebraically specified abstract data type, coincide with their classical counterpart. In particular, the equational theory of the programming language is a conservative extension of the theory of the underlying base types as given by algebraic data type specifications.

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

reasoning
abstract data type
values
language
types
polymorphic
data
theory
lambda calculus
power
evaluation

computation
express
extensibility
programming language


Finite volume methods for unidirectional dispersive wave models We extend the framework of the finite volume method to dispersive unidirectional water wave propagation in one space dimension. In particular, we consider a KdVBBM-type equation. Explicit and implicitexplicit RungeKutta-type methods are used for time discretizations. The fully discrete schemes are validated by direct comparisons to analytic solutions. Invariants' conservation properties are also studied. Main applications include important nonlinear phenomena such as dispersive shock wave formation, solitary waves, and their various interactions. Copyright (C) 2012 John Wiley & Sons, Ltd.

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

nonlinear dispersive waves
unidirectional propagation
water waves


Information technology and the transformation of industries: three research perspectives It is often claimed that information technology has the potential to transform entire industries. However, we find that very little IS research has been conducted at the industry level. Moreover, the small amount of research that has been conducted on IT and industries has been based largely on just one perspective of industries. Given the scale and potential impact of the changes that are happening at an industry level, we believe a concerted effort is needed to study this phenomenon. We propose a research agenda for studying IT and industries. We suggest three research perspectives for studying IT and industries: an economic perspective, an institutional perspective, and a socio-cultural perspective. Just as IS research that addresses these aspects at the organizational level has grown in recent years and contributed to our understanding of IS, so in this paper we argue that a similar broadening, as well as more studies, are needed at the industry level of analysis. We provide an example from the real estate industry to illustrate the usefulness of the three research perspectives.

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

information technology
economic perspective
institutional perspective
real estate industry

industry transformation
social/cultural perspective


Information-theoretic comparisons of cellular multiple-access systems with bandwidth-dependent fading considerations The coding performances of generic DS-CDMA, FDMA and hybrid F/TDMA systems with equivalent operating conditions are analysed and compared based on two information-theoretic performance measures, namely, channel capacity and probability of codeword decoding error. Statistical signal models for the different systems are developed, which, among other practical considerations, incorporate the effects of multicell operation, raised-cosine bandlimiting and multipath fading statistics which vary with the signalling bandwidth used. The results obtained provide insights into some fundamental mechanisms which contribute to the relative spectral efficiency among different multiple-access systems.

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

cellular mobile radio
multiple access
information theory


Multilevel Monte Carlo method for parabolic stochastic partial differential equations We analyze the convergence and complexity of multilevel Monte Carlo discretizations of a class of abstract stochastic, parabolic equations driven by square integrable martingales. We show under low regularity assumptions on the solution that the judicious combination of low order Galerkin discretizations in space and an EulerMaruyama discretization in time yields mean square convergence of order one in space and of order1/2 in time to the expected value of the mild solution. The complexity of the multilevel estimator is shown to scale log-linearly with respect to the corresponding work to generate a single path of the solution on the finest mesh, resp. of the corresponding deterministic parabolic problem on the finest mesh.

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


Multi-spectral image analysis and classification of melanoma using fuzzy membership based partitions The sensitivity and specificity of melanoma diagnosis can be improved by adding the lesion depth and structure information obtained from the multi-spectral, trans-illumination images to the surface characteristic information obtained from the epi-illumination images. Wavelet transform based bi-modal channel energy features obtained from the images are used in the analysis. Methods using both crisp and fuzzy membership based partitioning of the feature space are evaluated. For this purpose, the ADWAT classification method that uses crisp partitioning is extended to handle multi-spectral image data. Also, multi-dimensional fuzzy membership functions with Gaussian and Bell profiles are proposed for classification. Results show that the fuzzy membership functions with Bell profile are more effective than the extended ADWAT method in discriminating melanoma from dysplastic nevus.

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

nevoscope
tree-structured wavelet transform
fuzzy membership function


The use of explicit filters in large eddy simulation Explicit filtering is considered as a means of controlling the numerical errors that result when finite-difference methods are used in large eddy simulation (LES). The notion that the finite-difference expressions themselves act as an effective filter is shown to be false for three-dimensional simulations performed on nonuniform meshes. For consistency, the nonlinear terms in the Navier-Stokes equations should be filtered explicitly at each time step in order to insure that the spectral content of the solution remains fixed at the desired filter level. The explicit filtering operation allows a separation between the filter size and the mesh spacing and can be used to control the impact of the numerical errors. Numerical tests of the explicit filtering approach in turbulent channel flow are used to investigate the effectiveness of the explicit filtering approach and to assess its associated cost. Explicit filtering is shown to improve the computed results, but this improvement comes at a rather high computational cost. The explicitly-filtered approach is also compared with straightforward mesh refinement as an alternative means of improving the computed results. Mesh refinement is also seen to increase the accuracy of the simulation but some traces of numerical error appear to persist in the solution. (C) 2003 Elsevier Ltd. All rights reserved.

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

subgrid-scale modelling
turbulence
numerical simulation


Criminalising hacking tools Making the sale, possession and distribution of the tools of hacking a criminal offence has obvious attractions. But many such tools are dual use and new laws run the risk of significantly inhibiting the activities of investigators, incident responders, penetration testers and academics. Recent UK attempts at framing such a law are discussed in order to show the broader problems of policy and wording.

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

legislation
cybercrime treaty
system administration
computer misuse act


Counter machines In this paper we study the computational power of counters. Two different notions of a counter occur in the literature. One, which we call a two-way counter, is common in automata theory and is provided with the following operations: increment and decrement by 1 and test for zero. Another notion was used in schematology and logics of programs. The corresponding set of operations comes from the simplest algebraic structure of positive integers with increment by 1, reset to 0 and comparison of two counter values. There is no decrementation, therefore we call it a one-way counter. It is known that two two-way counters are enough to simulate a Turing machine. We present the same result for the one-way model: two one-way counters can simulate each Turing machine. We also discuss some consequences of this result for the hierarchy of program schemes. O 1999 Published by Elsevier Science B.V. All rights reserved.

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

theory of computation
counter machine
program scheme
program equivalence


optimal channel rate allocation for multimedia communication over fading wireless channels We consider the coding specifics of wireless broadcast terminals in hybrid multimedia communication systems, those consisting of a set of wireless and wired clients. In particular, we propose an information theoretically motivated framework for optimal multi-rate communication of multimedia contents, generically coded for a packet switched network, over fading wireless channels. The results in this paper however, extent themselves to any other wireless digital broadcast system as well. Under idealized conditions, for both fast and slow fading scenarios, the optimal rate allocations can be found by solving a convex optimization problem. We then devise a systematic way to find a near optimal solution for non-ideal, practical scenarios. Finally, we demonstrate the validity of our approach through simulations of an image streaming system that uses rate compatible convolutional codes to transmit multiple-description coded packets at the wireless access point.

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


Asymptotic analysis of pollution filtration through thin random fissures between two porous media We describe the asymptotic behaviour of a filtration problem from a contaminated porous medium to a non-contaminated porous medium through thin vertical fissures of fixed height h > 0, of random thinness of order epsilon and which are epsilon-periodically distributed. We compute the limit velocity of the flow and the limit flux of pollutant at the interfaces between the two porous media and the intermediate one. (C) 2009 Elsevier Ltd. All rights reserved.

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

porous medium
fissures
asymptotic analysis

pollution filtration problem
darcy's law
gamma-convergence


Lastmanagement in Stromnetzen Die zunehmende Verbreitung dezentral eingespeister erneuerbarer Energien fhrt zu Stabilittsproblemen in Stromnetzen. Im Gegensatz zu steuerbaren und somit gut planbaren konventionellen Kraftwerken ist die Energieerzeugung aus Windkraft und Photovoltaikanlagen aufgrund von wetterbedingten Fluktuationen nur deutlich kurzfristiger und ungenauer zu prognostizieren. Grundstzlich knnen sowohl Stromerzeuger als auch -verbraucher helfen, die Stabilittsproblematik zu verringern. Zu diesem Zweck werden Beitrge zu einem Entscheidungsuntersttzungssystem mit Steuerungsstrategien zur Beeinflussung des Verhaltens von Stromerzeugern und -verbrauchern vorgeschlagen. Auf der Erzeugerseite dienen dezentrale, kleinere Blockheizkraftwerke im Verbund als virtuelles Kraftwerk zum Lastausgleich. Basierend auf Prognosen bietet der Betreiber des virtuellen Kraftwerks einen Lastgang an. Auf Abweichungen kann spter durch geeignete Steuerung der Blockheizkraftwerke reagiert werden. Auf der Verbraucherseite kommt eine anreizbasierte Steuerung ber Preissignale zum Einsatz. Intelligente Gerte reagieren auf die bermittelten Strompreise dadurch, dass sie ihre Ausfhrungszeit, wenn mglich, auf einen Zeitraum gnstiger Strompreise verlegen. Zur Vorbereitung eines Feldversuchs ist es zunchst notwendig, die intelligenten Gerte zu simulieren. Das Ergebnis der Simulation wird dazu verwendet, ein knstliches neuronales Netz zu trainieren, mit dem sich fr gewnschte Lastverschiebungen geeignete Preissignale ermitteln lassen.

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

virtuelle kraftwerke
management komplexer stromnetze
knstliche neuronale netze
smart devices
load shifting
virtual power plant
management of complex energy systems
artificial neural networks


a topologically based non-minimum distance routing algorithm In this paper, a unique topologically based non-minimum distance routing algorithm is presented. It offers both maximal completion rates and minimal via usage. The algorithm is based on a topological transformation of a significant subset of the PC routing problem: A broad channel encompassing a full row of DIPs and all routes within it. This transformation eliminates the need to consider detailed path shapes during routing. The routing problem is transformed into a permutation of nets. It is coupled with a backtrack search to produce a powerful routing algorithm. The search is conducted in a planar environment.

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

distance routing algorithm paper permutation search minimal

shape
environments
routing algorithm
completeness