Interactive Modeler for Construction Equipment Operation Using Augmented Reality To ensure an efficient and safe construction operation, efforts have been made to develop a planning tool that focuses on equipment utilization. With the development of augmented reality (AR) technology came an opportunity for collaborative and interactive scenario modelling of construction equipment operation. This paper presents a system for identifying the optimum scenario for equipment operation by intuitively operating the equipment in an AR environment. Augmented reality was coupled with transmission control protocol/internet protocol (TCP/IP) socket programming to form an interactive interface for multiple users. In this system, users can develop a construction scenario involving equipment operation and site conditions such as project progress and share the idea with other users in distant locations. The interactive modeler can test various situations to find the particular scenario that works the best under the surrounding spatial constraints. A case study involving construction of a real cable-stayed bridge shows that the system has strong potential for significant improvement in construction planning processes. DOI: 10.1061/(ASCE)CP.1943-5487.0000137. (C) 2012 American Society of Civil Engineers.

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

augmented reality
construction planning
equipment operation
interactive modeler


Achieving communication efficiency through push-pull partitioning of semantic spaces to disseminate dynamic information Many database applications that need to disseminate dynamic information from a server to various clients can suffer from heavy communication costs. Data caching at a client can help mitigate these costs, particularly when individual PUSH-PULL decisions are made for the different semantic regions in the data space. The server is responsible for notifying the client about updates in the PUSH regions. The client needs to contact the server for queries that ask for data in the PULL regions. We call the idea of partitioning the data space into PUSH-PULL regions to minimize communication cost data gerrymandering. In this paper, we present solutions to technical challenges in adopting this simple but powerful idea. We give a provably optimal-cost dynamic programming algorithm for gerrymandering on a single query attribute. We propose a family of efficient heuristics for gerrymandering on multiple query attributes. We handle the dynamic case in which the workloads of queries and updates evolve over time. We validate our methods through extensive experiments on real and synthetic data sets.

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


Systems biology via redescription and ontologies (I): finding phase changes with applications to malaria temporal data Biological systems are complex and often composed of many subtly interacting components. Furthermore, such systems evolve through time and, as the underlying biology executes its genetic program, the relationships between components change and undergo dynamic reorganization. Characterizing these relationships precisely is a challenging task, but one that must be undertaken if we are to understand these systems in sufficient detail. One set of tools that may prove useful are the formal principles of model building and checking, which could allow the biologist to frame these inherently temporal questions in a sufficiently rigorous framework. In response to these challenges, GOALIE (Gene ontology algorithmic logic and information extractor) was developed and has been successfully employed in the analysis of high throughput biological data (e.g. time-course gene-expression microarray data and neural spike train recordings). The method has applications to a wide variety of temporal data, indeed any data for which there exist ontological descriptions. This paper describes the algorithms behind GOALIE and its use in the study of the Intraerythrocytic Developmental Cycle (IDC) of Plasmodium falciparum, the parasite responsible for a deadly form of chloroquine resistant malaria. We focus in particular on the problem of finding phase changes, times of reorganization of transcriptional control.

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

information theory
model checking
timecourse data


System of Systems Collaborative Formation The formation of a system of systems from a collection of interdependent systems does so in response to a collaborative mechanism. The nature of the constituent systems that compose the system of systems is a paradox by which they maintain an autonomous behavior and yet join the collective in collaboration. A social function can describe the system of systems mechanism that considers the value of collaborative relationships, and stresses preferences for action rather than an independent action of the individual systems. The constituent systems of the system of systems balance the risk of belonging with that of autonomy. This decision dichotomy is an example of typical decision makers that must balance cost and risk against achieving goals in a satisficing environment. A process beginning with a global goal serves to construct a Multicriteria Decision process creating the set of alternatives representing choices forming a collective social function that binds the system of systems. A case study demonstrates a simple application of independent autonomous systems collaborating to affect a holistic response with positive results.

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

analytical hierarchy process
multiple criteria decision analysis


Structural and radiometric asymmetry in brain images This paper presents a general framework for analyzing structural and radiometric asymmetry in brain images. In a healthy brain, the left and right hemispheres are largely symmetric across the mid-sagittal plane. Brain tumors may belong to one or both of the following categories: mass-effect, in which the diseased tissue displaces healthy tissue; and infiltrating, in which healthy tissue has become diseased. Mass-effect brain tumors cause structural asymmetry by displacing healthy tissue, and may cause radiometric asymmetry in adjacent normal structures due to edema. Infiltrating tumors have a different radiometric response from healthy tissue. Thus, structural and radiometric asymmetries across the mid-sagittal plane in brain images provide important cues that tumors may be present. We have developed a framework that registers images with their reflections across the mid-sagittal plane. The registration process accounts for tissue displacement through large deformation image warping. Radiometric differences are taken into account through an additive intensity field. We present an efficient multi-scale algorithm for the joint estimation of structural and radiometric asymmetry. Results for nine MR images of patients with tumors and four normal control subjects are presented.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 symmetry analysis
plane of symmetry estimation
deformable image mapping
medical image analysis


Third age usability and safety - an ergonomics contribution to design Commercial pressures are placing demands on the designer to provide solutions which are fit for purpose for all user groups. The needs of these groups can vary significantly yet inclusive design of mainstream products and work equipment remains a top priority. This paper is not an academic review of current theories of inclusive design methodologies. Rather, it explores the ergonomics contribution to the design process, the pitfalls to be avoided and suggests ways of avoiding them. Specifically, the needs of the Third Age are considered with their increasingly important requirements within the workplace and beyond. The authors contest that a user-centred approach is at the heart of achieving inclusive design; expecting the designer to apply ergonomics data without understanding user needs is unlikely to yield fit-for-purpose products. (C) 2001 Academic Press.

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


movie script markup language This paper introduces the Movie Script Markup Language (MSML), a document specification for the structural representation of screenplay narratives for television and feature film drama production. Its definition was motivated by a lack of available structured and open formats that describe dramatic narrative but also support IT-based production methods of audiovisual drama. The MSML specification fully supports contemporary screenplay templates in a structured fashion, and adds provisions for drama manufacturing methods that allow drama crew to define how narrative can be translated to audiovisual material. A timing model based on timed petri nets is included to enable fine-grained event synchronization. Finally, MSML comprises an animation module through which narrative events can drive production elements like 3-D previsualization, content repurposing or studio automation. MSML is currently serialized into XML documents and is formally described by a complement of an XML Schema and ISO Schematron schema. The specification has been developed in close collaboration with actual drama production crew and has been implemented in a number of proof-of-concept demonstrators.

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

xml
drama production
screenplay
narratives


Modeling the initial stage of a file sharing process on a BitTorrent network In this paper, we model the number of seeders during the initial stage of a file sharing process on BitTorrent networks. The initial stage is crucial for successfully identifying the initial seeder, who provided the source of the files on the Internet. Most existing BT models focus on different parameters in the steady state, which occurs at a later stage of a file sharing process. None of them are able to characterize the initial stage. In this study, we propose the first model on capturing the characteristics on the growth of the number of seeders during the initial stage on a BT network. Also, we derive a lower bound for the appearing time of the second seeder and the length of the stationary period. Our model suggests that the number of seeders remain stationary during the starting period of a file sharing process. When it enters the rapid-rising period, it increases more speedily as an increasing number of seeders are available for supplying the rarest pieces. The observed demarcation of the stationary period and the rapid-rising period is significant in identifying the initial seeder on a BT network. If the investigative work can be commenced within the stationary period, the chance of identifying the initial seeder is much higher. On the other hand, if the file distribution has entered the rapid-rising period, one can no longer determine which of the existing seeders is, indeed, the initial seeder.

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

bittorrent model
initial seeders
forensic investigation
internet piracy


Class invariants as abstract interpretation of trace semantics We present a generic framework for the automatic and modular inference of sound class invariants for class-based object-oriented languages. We define a trace-based semantics for classes which considers all possible orderings, with all possible arguments, of invocations of all the methods of a class. We prove a correspondence theorem between such a semantics and a generic, trace-based, semantics for complete object-oriented programs. We express state-based class invariants in a fixpoint form by considering an abstraction of the class semantics, and we show how class invariants can be automatically inferred exploiting a static analysis of the methods. Furthermore, we address the problem of inferring a subclass invariant without accessing to the parent code, but just to its invariant.

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

abstract interpretation
static analysis
trace semantics

class invariant
object-oriented programming
optimization
verification


the rpc calculus Several recent language designs have offered a unified language for programming a distributed system, with explicit notation of locations; we call these "location-aware" languages. These languages provide constructs allowing the programmer to control the location (the choice of host, for example) where a piece of code should run, which can be useful for security or performance reasons. On the other hand, a central mantra of WWW system engineering prescribes that web servers should be "stateless": that no "session state" should be maintained on behalf of individual clients---that is, no state that pertains to the particular point of the interaction at which a client program resides. Many implementations of location-aware languages are not at home on the web: they hold some kind of client-specific state on the server. We show how to implement a symmetrical location-aware language on top of a stateless server.

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

continuation-passing style
web programming
programming languages
location-aware language
trampolined style
defunctionalization


Numerical approximation of nonlinear fractional differential equations with subdiffusion and superdiffusion ? In this paper, we study the timespace fractional order (fractional for simplicity) nonlinear subdiffusion and superdiffusion equations, which can relate the matter flux vector to concentration gradient in the general sense, describing, for example, the phenomena of anomalous diffusion, fractional Brownian motion, and so on. The semi-discrete and fully discrete numerical approximations are both analyzed, where the Galerkin finite element method for the space RiemannLiouville fractional derivative with order 1+??[1,2] 1 + ? ? [ 1 , 2 ] and the finite difference scheme for the time Caputo derivative with order ??(0,1) ? ? ( 0 , 1 ) (for subdiffusion) and (1,2) ( 1 , 2 ) (for superdiffusion) are analyzed, respectively. Results on the existence and uniqueness of the weak solutions, the numerical stability, and the error estimates are presented. Numerical examples are included to confirm the theoretical analysis. During our simulations, an interesting diffusion phenomenon of particles is observed, that is, on average, the diffusion velocity for 0<?<1 0 < ? < 1 is slower than that for ?=1 ? = 1 , but the diffusion velocity for 1<?<2 1 < ? < 2 is faster than that for ?=1 ? = 1 . For the spatial diffusion, we have a similar observation.

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

subdiffusion
superdiffusion
caputo derivative
finite element method

timespace fractional diffusion equation
riemannliouville derivative
difference method


Unsupervised colour image segmentation by low-level perceptual grouping This paper proposes a new unsupervised approach for colour image segmentation. A hierarchy of image partitions is created on the basis of a function that merges spatially connected regions according to primary perceptual criteria. Likewise, a global function that measures the goodness of each defined partition is used to choose the best low-level perceptual grouping in the hierarchy. Contributions also include a comparative study with five unsupervised colour image segmentation techniques. These techniques have been frequently used as a reference in other comparisons. The results obtained by each method have been systematically evaluated using four well-known unsupervised measures for judging the segmentation quality. Our methodology has globally shown the best performance, obtaining better results in three out of four of these segmentation quality measures. Experiments will also show that our proposal finds low-level perceptual solutions that are highly correlated with the ones provided by humans.

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

low-level perception
unsupervised segmentation


MULTIASSET PORTFOLIO SELECTION PROBLEM WITH TRANSACTION COSTS This paper considers the optimal consumption and investment policy for an investor who has available one bank account paying a fixed interest rate r and n risky assets whose prices ace log-normal diffusions. We suppose that transactions between the assets incur a cost proportional to the size of the transaction. The problem is to maximize the total utility of consumption. Dynamic Programming leads to a Variational Inequality for the value function which is solved by using a numerical algorithm based on policies iterations and multigrid methods. Numerical results are displayed for n = 1 and n = 2.

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

portfolio selection
transaction costs
variational inequality
multigrid methods


Evaluating measures of nonclassical correlation in a multipartite quantum system We introduce and evaluate measures of nonclassical correlation defined on the basis of a paradigm claiming that a multipartite system represented by a density matrix having no product eigenbasis possesses nonclassical correlation.

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


making concepts and phenomena visual in machine and assembly language programming Some courses in computer organization and assembly language programming have evolved away from ones emphasizing proficiency with a particular machine. Instead, these courses attempt to build understanding for the way in which abstract concepts are ultimately realized through machine level programming. The advent of small computers offers an opportunity to further personalize this form of instruction and to improve its delivery and availability. This paper discusses a package of software for use on personal computers which supports the teaching of courses in computer organization and assembly language programming. The software permits visualization of various abstractions, concepts, and phenomena. Examples of its use in teaching are examined, and related directions in teaching courses of this type are examined.

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

availability software organization use visualization examples language instruction teaching paper

program
understandability
abstraction
personal computer
personality
packaging
computation
concept
direct
assemblers


Using stack reconstruction on RTL orthogonal scan chain design In this paper, we propose an orthogonal scan chain embedded into the RTL design described by Verilog. We first construct the data path graph from the embedded scan chains and then find all the orthogonal scan paths with the minimum weighted cost. These paths share with original data paths as possible. Finally, we create a stack form to reconstruct all the orthogonal scan paths to manage the I/Os and reduce the length and width of stack form as well as decrease the overheads of area and timing. Experimental results show our RTL orthogonal scan chain approach can save up to 13.8% and 5.1% in area overhead than that of the gate-level scan and functional order RTL scan, respectively.

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

rtl scan
orthogonal scan chain
area overhead


Portable wireless-networking protocol evaluation Multi-hop wireless networks, such as sensor-, ad hoc- and mesh-nets, can be differentiated in terms of participating devices and usage scenarios. However they share strong characteristics and requirements, such as node cooperation to enable multi-hop forwarding and dynamic routing protocols to deliver packets. As a result of these similarities, protocols designed for all these wireless networks revolve around a common core of functionality, for example coping with link and node dynamics. They differ only in additional network-specific functionality, such as tree routing structures in sensornets, and parameterization, for example buffer sizes. This convergence of functionality and design goals, as well as the sheer number of proposed protocols in each network class, motivates the idea of applying protocols to more than just their one original class. However, network-layer protocols are usually developed for and tested in only one class of wireless network due to the lack of a platform that allows testing of protocols across different classes of networks. As a result, we unnecessarily constrain the range of settings and scenarios in which we test network protocols. In this article, we propose a platform for protocol testing and evaluation in multiple, heterogeneous networks and discuss the requirements and challenges of such a solution. As a first step and case study, we present the detailed architecture of TinyWifi, a platform for executing native sensornet protocols on Linux-driven wireless devices as found in wireless mesh and mobile ad-hoc networks (MANETs). TinyWifi builds on nesC code base that abstracts from TinyOS and enables the execution of nesC-based protocols in Linux. Using this abstraction, we expand the applicability and means of protocol execution from one class of wireless network to another without re-implementation. We demonstrate the generality of TinyWifi by evaluating four well-established protocols on IEEE 802.11 and 802.15.4 based testbeds using a single implementation. Based on the experience of building TinyWifi and the presented evaluation, we deduce the feasibility of a cross-network evaluation platform and sketch the requirements for inclusion of further network classes.

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

multihop wireless networks
tinyos
sensornets
meshnets
manets
protocol evaluation


Two-agent single-machine scheduling problem with just-in-time jobs We consider two scheduling problems on a single machine with two agents. The objective is to optimize the performance measure for agent 1 while maintaining the weighted number of just-in-time jobs for agent 2 at or above a given threshold. The performance measures for agent 1 are the total weighted completion times and the weighted number of tardy jobs. We analyze how the complexities of the two problems change, depending on the conditions of processing times and weights.

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

competing agents
just-in-time job
complexity


using dynamic markov compression to detect vandalism in the wikipedia We apply the Dynamic Markov Compression model to detect spam edits in the Wikipedia. The method appears to outperform previous efforts based on compression models, providing performance comparable to methods based on manually constructed rules.

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


Integrating cluster and sequential analysis to explore learners flow and behavioral patterns in a simulation game with situated-learning context for science courses: A video-based process exploration Explored learners flow and behavior patterns in a science simulation game. Integrated cluster and sequential analysis to analyze videotaped behaviors. Explored three clusters of learners with different patterns of learning processes. Learners with higher flow levels attain a more complete reflective process.

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

interactive learning environments
flow state
game-based learning
learning process


Mouse Mutants for the Study of Corticotropin-Releasing Hormone Receptor Function: Development of Novel Treatment Strategies for Mood Disorders In today's psychiatry there is a great deal of interest in the development of compounds with a novel mechanism of action that diverge from the classical catecholaminergic neurotransmitter system targets. Within the last few years, it has become increasingly evident that the neuroendocrine and behavioral phenotypes of mood and anxiety disorders are at least in part mediated by modulation of corticotropin-releasing hormone (CRH) neurocircuitries and that normalization of an altered neurotransmission after treatment may lead to restoration of disease-related changes. Although this concept was originally derived from peripheral hypothalamic-pituitary-adrenocortical (HPA) assessments in depressed patients, central CRH neuropeptidergic circuits other than those driving the peripherally accessible HPA system may be overactive and could be therapeutic targets of antagonist actions. Genetically engineered mice provide a novel and useful tool to study the endogenous mechanisms underlying aberrant behavior and CRH neurocircuitry regulation. The results obtained from conventional and conditional mutant mice indicate that CRH type 1 receptors may be the primary target to which to direct selective nonpeptide compounds. Moreover, beyond the encouraging preclinical studies, the first clinical open trial supports the notion that CRH type 1 receptors can be safely and effectively antagonized.

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


A fast algorithm for kernel 1-norm support vector machines This paper proposes a Column Generation Newton (CGN) algorithm for finding solution of the kernel 1-norm SVM. CGN is combining the Column Generation and the Newton Linear Programming SVM method. CGN is fast when solving the kernel 1-norm SVM.

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

1-norm svm
newton algorithm
kernel function


Image sharpening in the JPEG domain We present a new technique for sharpening compressed images in the discrete-cosine-transform domain. For images compressed using the JPEG standard, image sharpening is achieved by suitably scaling each element of the encoding quantization table to enhance the high-frequency characteristics of the image. The modified version of the encoding table is then transmitted in lieu of the original. Experimental results with scanned images show improved text and image quality with no additional computation cost and without affecting compressibility.

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


Limited memory BFGS method with backtracking for symmetric nonlinear equations A limited memory BFGS algorithm is presented for solving symmetric nonlinear equations. The global convergence of the given method is established under mild conditions. Numerical results show that the limited memory BFGS method is more interesting than the normal BFGS method for the given problems. (C) 2011 Elsevier Ltd. All rights reserved.

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

limited memory bfgs method
symmetric nonlinear equations
global convergence


Information practices of urban newcomers: An analysis of habits and wandering This paper reviews information practices used by transnational migrants to become familiar with new urban surroundings. Drawing on interviews with 26 participants, all of whom had moved to New York City in the past 2 years, I analyze the interrelatedness of people, city space, and technology. By rooting my analysis in the experiences of transnational newcomers to New York, my investigation is directed both at library and information science (LIS) scholarship in transnational experience and urban informatics as an area of study. The findings section first addresses participants' practices for becoming familiar with their surroundings as embedded in everyday routines using Bergson's (1911) construct of habits as a means of organizing stimulus. I then develop an analysis of wandering, which emerged as an information practice used by participants to become familiar with their neighborhoods. Building on these themes, I suggest implications for human information behavior theory, arguing that LIS scholars should articulate more clearly and across a wider range of disciplines the concepts of mobile and ubiquitous technologies.

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


Linking heterogeneous biodiversity information systems on the GRID: The GRAB prototype In the field of biodiversity informatics a wide range of diverse databases and tools already exists. The challenge is to integrate such resources in order to support scientists wishing to explore complex problems of relevance to biodiversity, and to create new resources where necessary. In this paper we outline the relevance of biodiversity informatics requirements to the future development of the GRID, identifying the main issues that need to be addressed in this area. We present GRAB (GRid And Biodiversity), which is a prototype demonstrator illustrating how one particular biodiversity-related task, namely bioclimatic modelling, can be supported in a Globus-based environment. We also describe a much larger-scale GRID application project that is just commencing (BiodiversityWorld) in which a flexible problem-solving environment is to be built for full-scale investigations by scientists working in a number of biodiversity research areas.

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

heterogeneous databases
data integration
collaborative working
globus


Information transmittal, principle of relativity and mass-energy relation Relativistic transformations and their application to electrodynamics of a weakly accelerated electron considered in [A. Einstein, Zur Elektrodynamik der bewegter Korper, Anna len der Physik, 17 (1905) 891-921] are further analyzed in their relation to the principle of relativity, the concept of mass, and the mass energy equation. Alternative consideration in dynamics of weakly accelerated electrons demonstrates that the factors in longitudinal mu beta(3) and transverse mu beta(2) masses of an electron with the mass mu at rest naturally appear in observed accelerations as a result of relativistic transformations, without any deviation from the principle of relativity and the second Newton's law of motion. As concerns the special relativity in accelerated motion, this allows us to retain the concept of mass as scalar characteristic of an accelerated body. It is argued that "the principle of equivalence of the mass and energy of rest" (Einstein) depends on the speed of the information transmitting signal by which the observation (measurement) is made (synchronization of clocks is achieved), so that relativistic equation E = mc(2) appears as an image phenomenon which essentially depends on the propagation of light as a measuring signal and on its speed V = c as the critical parameter of Einstein's relativistic transformations. It is demonstrated that the spherical waves considered by Einstein are distorted in real time, and the fundamental Lorentz invariant is not crisp, but presents a soft interval whose diameter is in the range of 30,000 km for time delays of 0.1 s in transmission of information. The results open new avenues for further research in the theory of relativity and its applications. (C) 2009 Elsevier Ltd. All rights reserved.

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


Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness Consider a single machine and a set of n jobs that are available for processing at time 0. Job j has a processing time pj, a due date dj and a weight wj. We consider bi-criteria scheduling problems involving the maximum weighted tardiness and the number of tardy jobs. We give NP-hardness proofs for the scheduling problems when either one of the two criteria is the primary criterion and the other one is the secondary criterion. These results answer two open questions posed by Lee and Vairaktarakis in 1993. We consider complexity relationships between the various problems, give polynomial-time algorithms for some special cases, and propose fast heuristics for the general case. The effectiveness of the heuristics is measured by empirical study. Our results show that one heuristic performs extremely well compared to optimal solutions.

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

scheduling
number of tardy jobs
maximum weighted tardiness
heuristics


Coordinated motion and force control of multi-limbed robotic systems This analytic and experimental study proposes a control algorithm for coordinated position and force control for autonomous multi-limbed mobile robotic systems. The technique is called Coordinated Jacobian Transpose Control (CJTC). Such position/force control algorithms will be required if future robotic systems are to operate effectively in unstructured environments. Generalized Control Variables (GCVs), express in a consistent and co-ordinated manner the desired behavior of the forces exerted by the multi-limbed robot on the environment and a system's motions. The effectiveness of this algorithm is demonstrated in simulation and laboratory experiments on a climbing 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 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


Extended difference-of-Gaussians model incorporating cortical feedback for relay cells in the lateral geniculate nucleus of cat A striking feature of the organization of the early visual pathway is the significant feedback from primary visual cortex to cells in the dorsal lateral geniculate nucleus (LGN). Despite numerous experimental and modeling studies, the functional role for this feedback remains elusive. We present a new firing-rate-based model for LGN relay cells in cat, explicitly accounting for thalamocortical loop effects. The established DOG model, here assumed to account for the spatial aspects of the feedforward processing of visual stimuli, is extended to incorporate the influence of thalamocortical loops including a full set of orientation-selective cortical cell populations. Assuming a phase-reversed push-pull arrangement of ON and OFF cortical feedback as seen experimentally, this extended DOG (eDOG) model exhibits linear firing properties despite non-linear firing characteristics of the corticothalamic cells. The spatiotemporal receptive field of the eDOG model has a simple algebraic structure in Fourier space, while the real-space receptive field, as well as responses to visual stimuli, are found by evaluation of an integral. As an example application we use the eDOG model to study effects of cortical feedback on responses to flashing circular spots and patch-grating stimuli and find that the eDOG model can qualitatively account for experimental findings.

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


MONTGOMERY AND RNS FOR RSA HARDWARE IMPLEMENTATION There arc many architectures for RSA hardware implementation which improve its performance Two main methods for this purpose are Montgomery and RNS These are fast methods to convert plaintext to ciphertext in RSA algorithm with hardware implementation RNS is faster than Montgomery but it uses more axed, The goal of this paper is to compare these two methods based on the speed and on the used area For this purpose the architecture has a better performance for each method is selected, and some modification is done to enhance their performance This comparison can be used to select the proper method for hardware implementation in both FPGA and ASIC design

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


Capacity and error probability analysis for orthogonal space-time block codes over correlated Rayleigh and Rician fading channels In this paper, the capacity and error probability of orthogonal space-time block codes (STBCs) are presented for PAM/PSK/QAM modulation in correlated flat fading channels. We consider an equivalent scalar AWGN (additive white Gaussian noise) channel with a channel gain proportional to the Frobenius norm of the matrix channel. A unified approach to the error probability analysis for correlated Rayleigh and Rician fading channels is presented. Closed form error probability expressions are derived for Rayleigh fading channels. We also determine the capacity and probability of error for a multiuser direct sequence code division multiple access (DS-CDMA) system employing a STBC over correlated fading channels.

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


A non-coherent SAC-OCDMA system using extended quadratic congruence codes for two-code keying scheme in passive optical networks In this paper, we propose a family of extended quadratic congruence codes for two-code keying (TCK) with the corresponding encoding/decoding architecture for passive optical networks (PONs) in spectral amplitude coding optical code division multiple access (OCDMA) systems. The proposed system can simultaneously eliminate multi-user interference (MUI) and further suppress phase-induced intensity noise (PIIN). We reduce the complexity of the encoding/decoding architecture of the optical line terminal reduced by exploiting arrayed waveguide gratings (AWGs) and the properties of the extended quadratic congruence codes (EQC codes). Moreover, we also design a deployment method to increase the number of simultaneous users. Our numerical results demonstrate that the proposed system outperforms the improved quadratic congruence codes (improved QC codes).

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

extended improved quadratic congruence (eqc) codes


Statistical and computational intelligence tools for the analyses of warp tension in different back-rest oscillations In this paper, experimental, computational intelligence based and statistical investigations of warp tensions in different back-rest oscillations are presented. Firstly, in the experimental stage, springs having different stiffnesses are used to obtain different back-rest oscillations. For each spring, fabrics are woven in different weft densities and the warp tensions are measured and saved during weaving process. Secondly, in the statistical investigation, the experimental data are analyzed by using linear multiple and quadratic multiple-regression models. Later, in the computational intelligence based investigation, the data obtained from the experimental study are analyzed by using artificial neural networks that are universal approximators which provide a massively parallel processing and decentralized computing. Specially, radial basis function neural network structure is chosen. In this structure, cross-validation technique is used in order to determine the number of radial basis functions. Finally, the results of regression analysis, the computational intelligence based analysis and experimental measurements are compared by using the coefficient of determination. From the results, it is shown that the computational intelligence based analysis indicates a better agreement with the experimental measurement than the statistical analysis.

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

neural networks
radial basis function
warp tension

cross-validation
data regression
back-rest oscillation
weft density


Free-Space Optoelectronic Switching Cores With MPLS for SANs Over WDM Ring Networks With increasing demands on storage devices in the modern communication environment, the storage area network (SAN) has evolved to provide a direct connection allowing these storage devices to be accessed efficiently. To optimize the performance of a SAN, a three-stage hybrid electronic/optical switching node architecture based on the concept of a MPLS label switching mechanism, aimed at serving as a multi-protocol label switching (MPLS) ingress label edge router (LER) for a SAN-enabled application, has been designed. New shutter-based free-space multi-channel optical switching cores are employed as the core switch fabric to solve the packet contention and switching path conflict problems. The system-level node architecture design constraints are evaluated through self-similar traffic sourced from real gigabit Ethernet network traces and storage systems. The extension performance of a SAN over a proposed WDM ring network, aimed at serving as an MPLS-enabled transport network, is also presented and demonstrated.

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

free-space optical switch
multi-protocol label switching (mpls)
storage area networks (sans)


Timing-driven partitioning and timing optimization of mixed static-domino implementations Domino logic is a circuit family that is well-suited to implementing high-speed circuits. Synthesis of domino circuits is more complex than static logic synthesis due to the noninverting nature of the logic and the complex timing relationships associated with the clock scheme, In this paper, we address several problems along a domino synthesis flow. We mainly consider the problem of partitioning a circuit into static and domino regions under timing constraints. The algorithm is extended to develop a method for partitioning domino logic into two phases, with inverters permitted between the two phases, and then to a flow for general two-phase static-domino partitioning. We also address a timing verification and sizing optimization tool for circuits containing mixed domino and static logic.

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

domino logic
partitioning
sizing
static logic
timing

logic duplication
technology mapping
vlsi


Evaluating the performance of architectures in MASCOT Several design methods for software/system architectures have been developed since the origins of Software Engineering. MASCOT remains as one of such preferred design methods in the European defence arena. There are even tools that support MASCOT diagram and textual software/system designs and also their automatic code generation. However, less attention has been paid to nonfunctional aspects of these designs, e.g. performance evaluation. MASCOTime is a tool prototype for MASCOT, that uses the discrete-event simulation to help analysts to select among several software/system architectures. In order to provide the performance constraints of system designs, MASCOT has been annotated in a transparent way for software engineers. MASCOTime will assist software/system developers to decide which architecture matches the performance and functional requirements on early steps of design. (c) 2004 Elsevier B.V. All rights reserved.

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

mascot architecture evaluation performance simulation


The event matching language for querying temporal data Querying object evolution in temporal databases is interesting, but neither SQL-like algebraic languages nor general purpose languages take evolution into account. This paper presents a language, called the Event Matching Language, that is specifically designed for querying object evolution. The language is a pattern matching language based on the concept of cursor borrowed from SNOBOL4.

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

temporal databases
pattern matching
snobol4

temporal query languages
events
time cursor


composing letters with a simulated listening typewriter Speech recognition is not yet advanced enough to provide people with a reliable listening typewriter with which they could compose documents. The aim of this experiment was to determine if an imperfect listening typewriter would be useful for highly experienced dictators. Participants dictated either in isolated words or in continuous speech, and used a simulated listening typewriter which recognized a limited vocabulary as well as one which recognized an unlimited one. Results suggest that reducing the rate at which people dictate, either through limitations in vocabulary size or through speaking in isolated words, led to reductions in people's performance. For these first-time users, no version of the listening typewriter was better than traditional dictating methods.

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

experience
speech recognition
method
author
simulation
handwriting
reliability
participant


fast and adaptive tracing strategies for 3-secure fingerprint watermarking codes Fingerprinting codes are mechanisms to increase the security of transaction watermarking. Digital transaction watermarking is an accepted mechanism to discourage illegal distribution of multimedia. Here copies of the same content are distributed with individual markings. Simple but effective attacks on transaction watermarking are collusion attacks where multiple individualized copies of the work are compared in order to detect and attack the watermark positions and thus create a counterfeited watermark. One common countermeasure is given by fingerprinting codes. The main challenge is to provide codes which are highly secure, reliable and, at the same time, provide a sufficiently compact code length according to the payload limitations of current watermarking algorithms. Applying such codes in practice, the codes have to face additional challenges: Most operators arrogate small amounts of time for the code generation and embedding process and for the detection and accusation process. In this article, we describe a new fast but fair fingerprinting code to detect a collusion of up to three colluders. The code is very flexible and consciously kept simple to be adaptive and fast in order to stay applicable for all demands of potential appliers. Using accusation sums we are able to make a decision about which kind of attack strategy the colluders may have used. Accordingly the algorithm is split into two different tracing strategies. Both are based on discarding as many fingerprints as possible and only consider the most suspicious.

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


Experimental efficiency of programmed mutagenesis Mismatched DNA annealing followed by strand replication can cause the programmed evolution of DNA sequences. We have reported that this process is theoretically equivalent in computational power to a desktop computer by demonstrating a constructive way to encode arbitrary computations as DNA molecules within the framework of programmed mutagenesis, a system that consists solely of cycles of DNA annealing, polymerization, and ligation.(1,2)) Thus, programmed mutagenesis is theoretically universal and we report here the experimental efficiency of its primitive operations. The measured efficiency of an in vitro programmed mutagenesis system suggests that segregating the products of DNA replication into separate compartments would be an efficient way to implement molecular computation. For computer science, using single DNA molecules to represent the state of a computation holds the promise of a new paradigm of composable molecular computing. For biology, the demonstration that DNA sequences could guide their own evolution under computational rules may have implications as we begin to unravel the mysteries of genome encoding and natural evolution.

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

universal system
biological computing
string rewrite systems
turing machines


On character-based index schemes for complex wildcard search in peer-to-peer networks We present a family of character-based index schemes for wildcard search in peer-to-peer networks. The supported query format allows the two wildcard matching operators ? and * to be used arbitrarily. To our knowledge, no distributed solution for this general form of wildcard search has been proposed thus far. Moreover, the schemes can achieve balanced loads, avoid hot-spots and single points of failure, reduce storage and maintenance costs, and offer ranking mechanisms for matching objects. The main focus is on a thorough comparative study on these index schemes from the following perspectives: query expressiveness, encoding effectiveness, load balance, and search performance.

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

keyword search
character-based index scheme
distributed search
structured peer-to-peer (p2p) networks
dht


The Ergodic Capacity of Phase-Fading Interference Networks We identify the role of equal strength interference links as bottlenecks on the ergodic sum capacity of a K user phase-fading interference network, i.e., an interference network where the fading process is restricted primarily to independent and uniform phase variations while the channel magnitudes are held fixed across time. It is shown that even though there are K (K - 1) cross-links, only about K/2 disjoint and equal strength interference links suffice to determine the capacity of the network regardless of the strengths of the rest of the cross channels. This scenario is called a minimal bottleneck state. It is shown that ergodic interference alignment is capacity optimal for a network in a minimal bottleneck state. The results are applied to large networks. It is shown that large networks are close to bottleneck states with a high probability, so that ergodic interference alignment is close to optimal for large networks. Limitations of the notion of bottleneck states are also highlighted for channels where both the phase and the magnitudes vary with time. It is shown through an example that for these channels, joint coding across different bottleneck states makes it possible to circumvent the capacity bottlenecks.

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

capacity
fading
interference alignment
interference network


A survey of multivariate aspects of the contraction method We survey multivariate limit theorems in the framework of the contraction method for recursive sequences as arising in the analysis of algorithms, random trees or branching processes. We compare and improve various general conditions under which limit laws can be obtained, state related open problems and give applications to the analysis of algorithms and branching recurrences.

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

analysis of algorithms
random trees
branching processes

weak convergence
probability metric
multivariate analysis


A numerical tension-stiffening model for ultra high strength fiber-reinforced concrete beams A numerical model that can simulate the nonlinear behavior of ultra high strength fiber-reinforced concrete (UHSFRC) structures subject to monotonic loadings is introduced. Since engineering material properties of UHSFRC are remarkably different from those of normal strength concrete and engineered cementitious composite, classification of the mechanical characteristics related to the biaxial behavior of UHSFRC, from the designation of the basic material properties such as the uniaxial stress-strain relationship of UHSFRC to consideration of the bond stress-slip between the reinforcement and surrounding concrete with fiber, is conducted in this paper in order to make possible accurate simulation of the cracking behavior in UHSFRC structures. Based on the concept of the equivalent uniaxial strain, constitutive relationships of UHSFRC are presented in the axes of orthotropy which coincide with the principal axes of the total strain and rotate according to the loading history. This paper introduces a criterion to simulate the tension-stiffening effect on the basis of the force equilibriums, compatibility conditions, and bond stress-slip relationship in an idealized axial member and its efficiency is validated by comparison with available experimental data. Finally, the applicability of the proposed numerical model is established through correlation studies between analytical and experimental results for idealized UHSFRC beams.

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

ultra high performance concrete (uhpc)
steel fiber-reinforced concrete (sfrc)
tension-stiffening model
tensile properties
finite element analysis


Design and implementation of a high-performance CCA event service Event services based on publish-subscribe architectures are well-established components of distributed computing applications. Recently, an event service has been proposed as part of the common component architecture (CCA) for high-performance computing (HPC) applications. In this paper we describe our implementation, experimental evaluation, and initial experience with a high-performance CCA event service that exploits efficient communications mechanisms commonly used on HPC platforms. We describe the CCA event service model and briefly discuss the possible implementation strategies of the model. We then present the design and implementation of the event service using the aggregate remote memory copy interface as an underlying communication layer for this mechanism. Two alternative implementations are presented and evaluated on a Cray XD-1 platform. The performance results demonstrate that event delivery latencies are low and that the event service is able to achieve high-throughput levels. Finally, we describe the use of the event service in an application for high-speed processing of data from a mass spectrometer and conclude by discussing some possible extensions to the event service for other HPC applications. Published in 2009 by John Wiley & Sons, Ltd.

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

components
common component architecture
event service


A note on SE-systems and regular canonical systems A synchronized extension system is a 4-tuple G = (V, L-1, L-2, S), where V is an alphabet and L-1, L-2 and S are languages over V. Such systems generate languages extending L-1 by L-2 to the left or to the right, and synchronizing on words in S. In this note we consider the relationship between synchronized extension systems and regular canonical systems. We are able to give a simplified and generalized proof for the classical result concerning the regularity of the languages defined by regular canonical systems.

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

synchronized extension systems
regular canonical systems


A Question from a Famous Paper of ErdAs Given a convex body , consider the smallest number so that there is a point such that every circle centred at intersects in at most points. In 1946 ErdAs conjectured that for all , but there are convex bodies for which this is not the case. As far as we know there is no known global upper bound. We show that no convex body has and that there are convex bodies for which .

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

erdos problem
convex curve
equidistant points
baire category


On the integration of highly oscillatory functions: Algorithms based on critical points and semi-periodic zones in scalar diffraction Two methods for the computation of the diffraction integrals appearing in the scalar approximation of the theory of diffraction of electromagnetic waves are developed. The methods are tuned since they avoid the oscillations of the integral kernel by dividing the integration domain in semi-periodic zones. A further optimization is applied hy taking advantage of the fact that the semi-periodic zones that contain a critical point have the main contribution to the result. (C) 2001 Elsevier Science B.V. All rights reserved.

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

diffraction integrals
highly oscillatory functions
critical points

integration algorithms
semi-periodic zones


making the switch to microsoft's live@edu services In 2009, the University of Montana switched student email from a campus hosted system to Microsoft's Live@Edu, which we labeled UMConnect. During Fall Semester 2009, approximately 4800 students voluntarily signed up for UMConnect accounts. On February 22, 2010, UMConnect accounts were created for the remaining 10,000 students. What happened? What could have happened? What problems didn't we anticipate? At 8:00 AM Monday, we waited for the anticipated long lines of students asking for help, complaining or just being puzzled. Only 23 students came in that day and by week's end, there were less than 200 students needing activation help, despite the fact that over 6000 students had "Activated" their UMConnect accounts that first week. Why were we so successful? We spent many months coordinating IT and University resources to make the switch. IT administration, our Web team, Microsoft Exchange administrators, Client Support Services, IT Central Help Desk, IT Communications and UM administration all worked on this enormous project.. What were the biggest issues? Most were with Microsoft's activation process. Numerous "Service not available" errors caused users to retry again and again. Several times, Windows Live@Edu was updated during our implementation. This resulted in new activation procedures and problems depending upon browser and/or operating system used. How we deal with this and what lessons we learn will be part of an ongoing process we expect to resolve in the coming months.

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

skydrive
officelive
live@edu
calendaring
collaboration tools


RESTARTING TILING AUTOMATA We present a new model of a two-dimensional computing device called restarting tiling automaton. The automaton defines a set of tile-rewriting, weight-reducing rules and a scanning strategy by which a tile to rewrite is being searched. We investigate properties of the induced families of picture languages. Special attention is paid to picture languages that can be accepted independently of the scanning strategy. We show that this family strictly includes REC and exhibits similar closure properties. Moreover, we prove that its intersection with the set of one-row languages coincides with the regular languages.

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

two-dimensional languages
tiling systems
restarting automata


EuroView 2010: "Visions of Future Generation Networks" On August 2nd - 3rd, 2010, the EuroView 2010 workshop on "Visions of Future Generation Networks" was held at the University of Wurzburg. The event was sponsored by the European Network of Excellence Euro-NF [1], the German Information Technology Society ITG [2], and the International Teletraffic Congress ITC [3]. EuroView 2010 brought together Internet and network technology researchers, network providers, as well as equipment and device manufacturers. In 2010, the focus was on "Future Internet Design and Experimental Facilities" and on current efforts towards a Future Internet. Special sessions were organized reflecting the latest results of selected testbed expert groups as well as current and future national and international collaborative projects: (1) the German G-Lab project [4] offering a national platform for Future Internet studies, (2) the Future Internet Activities in the European Framework FP7 organized by Max Lemke, and (3) the GENI project [5] in US organized by Aaron Falk. A keynote talk was given by Lawrence Landweber on the challenges and paradigms emerging in the Future (Inter) Network.

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

experimentation
measurement
management
prototypes and testbeds
cloud computing
virtualization
federation
protocols and interfaces
routing
security
data plane and control plane


Eligibility-based round robin for fair and efficient packet scheduling in wormhole switching networks Interconnection networks of parallel systems are used for servicing traffic generated by different applications, often belonging to different users. When multiple users contend for channel bandwidth, fairness in bandwidth sharing becomes a key requirement. In fact, enforcing a fair sharing of channel bandwidth improves flow isolation, thus preventing misbehaving flows from affecting the performance of other flows. This paper presents a novel packet scheduling algorithm, called Eligibility-Based Round Robin (EBRR), devised to provide fair queueing in interconnection networks. In fact, EBRR meets the constraints imposed by wormhole switching, which is the most popular switching technique in interconnection networks of parallel systems. It can also be applied to packet switching Wide Area Networks (WANs), such as IP and ATM. We show that EBRR has O(1) complexity and better delay and fairness properties than existing algorithms of comparable complexity. In this paper, we also investigate the means for assessing the fairness of a scheduler: We show that using the Relative Fairness Bound as a fairness measure may lead to erroneous results. We then propose an alternative measure, called the Generalized Relative Fairness Bound, that allows fairness to be assessed more precisely.

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

packet scheduling
fairness
wormhole switching networks


A computer model of lung morphology to analyze SPECT images Measurement of the spatial distribution of aerosol deposition in human lungs can be performed using single photon emission computed tomography (SPECT). To relate deposition patterns to real lung structures, a computer model of the airway network has been developed. Computer simulations are presented that are compatible with the analysis of SPECT images. Computational techniques that are consistent with clinical procedures are used to analyze airways by type and number within transverse slices of the lung volume. The computer models serve as customized templates, which when analyzed alongside gamma scintigraphy images, can assist in the interpretation of human test data.

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

single photon emission computed tomography analysis


Effects of visual cue and spatial distance on exitability in electronic negotiation We examined the effects of the visual anonymity of self and spatial distance on exitability in electronic negotiation in a role-play experiment. Exitability is the psychological factor that causes one to perceive the negotiation as unstable. We predicted that the lack of visual information and the spread of spatial distance would reduce anticipation of retaliation, make the continuation norm less salient, and prompt to exit from the current negotiation. Visual anonymity was manipulated by two conditions (visual anonymity or non-anonymity conditions). Spatial distance was manipulated by two conditions (remote or close conditions). Forty-three students were assigned in one of these four conditions, and negotiated. The results showed both the visual anonymity and remote distance inhibited the activation of continuation norm, prompted to exit from the current negotiation.

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

electronic negotiation
exitability
visual anonymity
spatial distance
continuation norm


Simulating evolution in model-based product line engineering Numerous approaches are available for modeling product lines and their variability. However, the long-term impacts of model-based development on maintenance effort and model complexity can hardly be investigated due to a lack of empirical data. Conducting empirical research in product line engineering is difficult as companies are typically reluctant to provide access to data from their product lines. Also, many benefits of product lines can be measured only in longitudinal studies, which are difficult to perform in most environments. In this paper, we thus aim to explore the benefit of simulation to investigate the evolution of model-based product lines. We present a simulation approach for exploring the effects of product line evolution on model complexity and maintenance effort. Our simulation considers characteristics of product lines (e.g., size, dependencies in models) and we experiment with different evolution profiles (e.g., technical refactoring vs. placement of new products). We apply the approach in a simulation experiment that uses data from real-world product lines from the domain of industrial automation systems to demonstrate its feasibility. Our results demonstrate that simulation contributes to understanding the effects of maintenance and evolution in model-based product lines.

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

product line engineering
maintenance and evolution
simulation
industrial automation systems


An adaptive mesh redistribution method for the incompressible mixture flows using phase-field model A phase field model which describes the motion of mixtures of two incompressible fluids is presented by Liu and Shen [C. Liu, J. Shen, A phase field model for the mixture of two incompressible fluids and its approximation by a Fourier-spectral method, Phys. D 179 (2003) 211228]. The model is based on an energetic variational formulation. In this work, we develop an efficient adaptive mesh method for solving a phase field model for the mixture flow of two incompressible fluids. It is a coupled nonlinear system of NavierStokes equations and AllenCahn phase equation (phase-field equation) through an extra stress term and the transport term. The numerical strategy is based on the approach proposed by Li et al. [R. Li, T. Tang, P.-W. Zhang, Moving mesh methods in multiple dimensions based on harmonic maps, J. Comput. Phys. 170 (2001) 562588] to separate the mesh-moving and PDE evolution. In the PDE evolution part, the phase-field equation is numerically solved by a conservative scheme with a Lagrange multiplier, and the coupled incompressible NavierStokes equations are solved by the incremental pressure-correction projection scheme based on the semi-staggered grid method. In the mesh-moving part, the mesh points are iteratively redistributed by solving the EulerLagrange equations with a parameter-free monitor function. In each iteration, the pressure and the phase are updated on the resulting new grid by a conservative-interpolation formula, while the velocity is re-mapped in a non-conservative approach. A simple method for preserving divergence-free is obtained by projecting the velocity onto the divergence-free space after generating the new mesh at the last iterative step. Numerical experiments are presented to demonstrate the effectiveness of the proposed method for solving the incompressible mixture flows.

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


ABACUS: frequent pAttern mining-BAsed Community discovery in mUltidimensional networkS Community discovery in complex networks is the problem of detecting, for each node of the network, its membership to one of more groups of nodes, the communities, that are densely connected, or highly interactive, or, more in general, similar, according to a similarity function. So far, the problem has been widely studied in monodimensional networks, i.e. networks where only one connection between two entities may exist. However, real networks are often multidimensional, i.e., multiple connections between any two nodes may exist, either reflecting different kinds of relationships, or representing different values of the same type of tie. In this context, the problem of community discovery has to be redefined, taking into account multidimensional structure of the graph. We define a new concept of community that groups together nodes sharing memberships to the same monodimensional communities in the different single dimensions. As we show, such communities are meaningful and able to group nodes even if they might not be connected in any of the monodimensional networks. We devise frequent pAttern mining-BAsed Community discoverer in mUltidimensional networkS (ABACUS), an algorithm that is able to extract multidimensional communities based on the extraction of frequent closed itemsets from monodimensional community memberships. Experiments on two different real multidimensional networks confirm the meaningfulness of the introduced concepts, and open the way for a new class of algorithms for community discovery that do not rely on the dense connections among nodes.

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

community discovery
multidimensional networks


Experiencing standardized media fragment annotations within HTML5 W3Cs Video in the Web activity aims at a better integration of media within the Web. In this paper, we show how two specifications currently under development within this activity, i.e., Media Fragment URIs and Media Annotations, can be combined within media-enabled HTML5 Web applications. In particular, we introduce a number of extensions for the Media Annotations ontology in order to close the gap with Media Fragment URIs. Additionally, we show how rich media fragment annotations can be converted into a WebVTT file. The latter can be used by HTML5-enabled players to show the annotations in a synchronized way. Further, a fully integrated Web application has been developed that shows how both specifications can work together within an HTML5 environment. This application relies on NinSuna, our media delivery platform targeted at multichannel publication that provides server-side support for both Media Fragment URIs and Media Annotations.

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


Data parallel-fault simulation Fault simulation is a compute-intensive problem. Parallel professing is one method to reduce simulation time. In this paper, we discuss a technique to partition the fault set for fault-parallel simulation on multiple processors. When applied statically, the technique can scale well for up to 32 processors. The fault-set partitioning technique is simple and can itself be parallelized, Existing uniprocessor algorithms, based on parallel-pattern simulation, can be used for multiprocessor simulation without modification, Therefore, the techniques can be used effectively on a low-cost parallel resource such as a network of workstations.

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

computer simulation
fault detection
ic test
parallel processing
test generation


MapReduce indexing strategies: Studying scalability and efficiency In Information Retrieval (IR), the efficient indexing of terabyte-scale and larger corpora is still a difficult problem. MapReduce has been proposed as a framework for distributing data-intensive operations across multiple processing machines. In this work, we provide a detailed analysis of four MapReduce indexing strategies of varying complexity. Moreover, we evaluate these indexing strategies by implementing them in an existing IR framework, and performing experiments using the Hadoop MapReduce implementation, in combination with several large standard TREC test corpora. In particular, we examine the efficiency of the indexing strategies, and for the most efficient strategy, we examine how it scales with respect to corpus size, and processing power. Our results attest to both the importance of minimising data transfer between machines for IO intensive tasks like indexing, and the suitability of the per-posting list MapReduce indexing strategy, in particular for indexing at a terabyte-scale. Hence, we conclude that MapReduce is a suitable framework for the deployment of large-scale indexing.

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

mapreduce indexing efficiency scalability hadoop


Negative exponential disparity based family of goodness-of-fit tests for multinomial models This paper investigates a new family of goodness-of-fit tests based on the negative exponential disparities. This family includes the popular Pearson's chi-square as a member and is a subclass of the general class of disparity tests (Basu and Sarkar, 1994) which also contains the family of power divergence statistics. Pitman efficiency and finite sample power comparisons between different members of this new family are made. Three asymptotic approximations of the exact null distributions of the negative exponential disparity family of tests are discussed. Some numerical results on the small sample performance of this family of tests are presented for the symmetric null hypothesis. It is shown that the negative exponential disparity family, like the power divergence family, produces a new goodness-of-fit test statistic that can be a very attractive alternative to the Pearson's chi-square. Some numerical results suggest that, application of this test statistic, as an alternative to Pearson's chi-square, could be preferable to the I-2/3 statistic of Cressie and Read (1984) under the use of chi-square critical values.

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

disparity tests
negative exponential disparity
power divergence

goodness-of-fit
likelihood ratio test
pearson's chi-square


Stromal predominant type mesenchymal hamartoma of liver: CT and MR features Mesenchymal hamartoma is a rare pediatric liver tumor. The tumor is mainly cystic but occasionally a solid component is seen. Therefore the tumor can be divided into two forms: (a) cystic predominant, and (b) stromal predominant. In this report, CT and MR features of stromal predominant type mesenchymal hamartoma are presented.

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

diagnosis
radiologic features
pediatric liver tumors


A Visual Approach to Efficient Analysis and Quantification of Ductile Iron and Reinforced Sprayed Concrete This paper describes advanced volume visualization and quantification for applications in non-destructive testing (NDT), which results in novel and highly effective interactive workflows for NDT practitioners. We employ a visual approach to explore and quantify the features of interest, based on transfer functions in the parameter spaces of specific application scenarios. Examples are the orientations of fibres or the roundness of particles. The applicability and effectiveness of our approach is illustrated using two specific scenarios of high practical relevance. First, we discuss the analysis of Steel Fibre Reinforced Sprayed Concrete (SFRSpC). We investigate the orientations of the enclosed steel fibres and their distribution, depending on the concrete's application direction. This is a crucial step in assessing the material's behavior under mechanical stress, which is still in its infancy and therefore a hot topic in the building industry. The second application scenario is the designation of the microstructure of ductile cast irons with respect to the contained graphite. This corresponds to the requirements of the ISO standard 945-1, which deals with 2D metallographic samples. We illustrate how the necessary analysis steps can be carried out much more efficiently using our system for 3D volumes. Overall, we show that a visual approach with custom transfer functions in specific application domains offers significant benefits and has the potential of greatly improving and optimizing the workflows of domain scientists and engineers.

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

non-destructive testing
multi-dimensional transfer functions
direction visualization
volume rendering


scheduling garbage collection in real-time systems The key to successful deployment of garbage collection in real-time systems is to enable provably safe schedulability tests of the real-time tasks. At the same time one must be able to determine the total heap usage of the system. Schedulability tests typically require a uniformed model of timing assumptions (inter-arrival times, deadlines, etc.). Incorporating the cost of garbage collection in such tests typically requires both artificial timing assumptions of the garbage collector and restricted capabilities of the task scheduler. In this paper, we pursue a different approach. We show how the reactive object model of the programming language Timber enables us to decouple the cost of concurrently running copying garbage collector from the schedulability of the real-time tasks. I.e., we enable any regular schedulability analysis without the need of incorporating the cost of an interfering garbage collector. We present the garbage collection demand analysis , which determines if the garbage collector can be feasibly scheduled in the system.

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


nat/firewall traversal cost model for publish-subscribe systems We consider large scale Publish/Subscribe systems deployed across multiple organizations. However, such cross organizational deployment is often hindered by firewalls and Network Address Translators (NATs). Several workarounds have been proposed to allow firewall and NAT traversal, e.g. VPN, connection reversal, relay routers. However, each traversal mechanism in turn leads to trade-offs with respect to implementation complexity, infrastructure overhead, latency, etc. We focus on the latency aspect in this work. We propose a cost-performance model that allows quantitative evaluation of the performance latency induced by the different firewall traversal mechanisms. The utility of the model is that for a given network configuration, it is able to provide a (close) approximation of the performance latencies based on simulation results, without actually having to deploy them in practice. This also allows selecting the best traversal mechanism for a given configuration. Finally, experimental results are given to show the validity of the proposed model.

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

nat/firewall traversal
cost performance model
publish-subscribe systems
network latency


algorithms for vertical and orthogonal l1 linear approximation of points This paper presents algorithms for approximating a set of n points by a linear function, or a line, that minimizes the L 1 norm of vertical and orthogonal distances. The algorithms find exact solutions based upon geometric properties of the problems as opposed to approximate solutions based upon existing numerical techniques. The algorithmic complexity of these problems appears not to have been investigated before our work in [9], although &Ogr;(n 3 ) naive algorithms can be easily obtained based on some simple characteristics of optimal L 1 solutions. In this paper, an &Ogr;(n) optimal time algorithm for the weighted vertical L 1 problem is presented. The algorithm is based upon a modified multi-dimensional search technique which extends the applicability of the basic technique to a wider class of problems. An &Ogr;(n 1.5 log 2 n) algorithm is presented for the unweighted orthogonal problem, and an &Ogr;(n 2 ) algorithm is presented for the weighted problem. An &OHgr;( n log n) lower bound for the orthogonal L 1 problem is shown under a certain model of computation. Also, the complexity of solving the orthogonal L 1 problem is related to the construction of the k-belt of an arrangement of lines.

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

lower bound
log
approximation
arrangement
complexity
algorithm
paper
search
model of computation
class

distance point applications optimality functional timing


Yada: Straightforward parallel programming Now that multicore chips are common, providing an approach to parallel programming that is usable by regular programmers has become even more important. This cloud has one silver lining: providing useful speedup on a program is useful in and of itself, even if the resulting performance is lower than the best possible parallel performance on the same program. To help achieve this goal, Yada is an explicitly parallel programming language with sequential semantics. Explicitly parallel, because we believe that programmers need to identify how and where to exploit potential parallelism, but sequential semantics so that programmers can understand and debug their parallel programs in the way that they already know, i.e. as if they were sequential. The key new idea in Yada is the provision of a set of types that support parallel operations while still preserving sequential semantics. Beyond the natural read-sharing found in most previous sequential-like languages, Yada supports three other kinds of sharing. Writeonce locations support a single write and multiple reads, and two kinds of sharing for locations updated with an associative operator generalise the reduction and parallel-prefix operations found in many data-parallel languages. We expect to support other kinds of sharing in the future. We have evaluated our Yada prototype on eight algorithms and four applications, and found that programs require only a few changes to get useful speedups ranging from 2.2 to 6.3 on an 8-core machine. Yada performance is mostly comparable to parallel implementations of the same programs using OpenMP or explicit threads.

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

parallel language
language design
determinism
parallel-reduction
parallel-prefix


Eigenvalue approach to study the effect of rotation and relaxation time in generalised thermo elasticity The fundamental equations of the problems of generalized thermoelasticity with one relaxation parameter including heat sources in infinite rotating media have been written in the form of a vector-matrix differential equation in the Laplace transform domain for a one-dimensional problem. These equations have been solved by the eigenvalue approach. The results have been compared to those available in the existing literature. The graphs have been drawn to show the effect of rotation. (C) 2003 Elsevier Ltd. All rights reserved.

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

generalized thermoelasticity
eigenvalue
laplace transform


Comment on "Exact Bayesian variable sampling plans for the exponential distribution with progressive hybrid censoring" Lin et al. [Exact Bayesian variable sampling plans for the exponential distribution with progressive hybrid censoring, J. Stat. Comput. Simul. 81 (2011), pp. 873-882] claimed to have derived exact Bayesian sampling plans for exponential distributions with progressive hybrid censoring. We comment on the accuracy of the design parameters of their proposed sampling plans and the associated Bayes risks given in tables of Lin et al. [Exact Bayesian variable sampling plans for the exponential distribution with progressive hybrid censoring, J. Stat. Comput. Simul. 81 (2011), pp. 873-882]. Counter-examples to their claim are provided.

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

acceptance sampling
bayes risk
decision function
loss function
sampling plan