A hybrid immersed-boundary and multi-block lattice Boltzmann method for simulating fluid and moving-boundaries interactions A numerical method is developed for modelling the interactions between incompressible viscous fluid and moving boundaries. The principle of this method is introducing the immersed-boundary concept in the framework of the lattice Boltzmann method, and improving the accuracy and efficiency of the simulation by refining the mesh near moving boundaries. Besides elastic boundary with a constitutive law, the method can also efficiently simulate solid moving-boundary interacting with fluid by employing the direct forcing technique. The method is validated by the simulations of flow past a circular cylinder, two cylinders moving with respect to each other and flow around a hovering wing. The versatility of the method is demonstrated by the numerical studies including elastic filament flapping in the wake of a cylinder and fish-like bodies swimming in quiescent fluid. Copyright (c) 2006 John Wiley & Sons, Ltd.

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

immersed-boundary method
multi-block strategy
direct forcing method
moving boundary
fluid-structure interactions


generating mc68000 code for ada We adapted the code generator of the Karlsruhe Ada compiler to produce symbolic MC68000 code. The essential part of the code generator - the code selection phase - is produced automatically by the Code Generator Synthesis System (CGSS) out of a formal description of the target machine. Therefore our main task consisted of writing a Target Machine Description (TMD) for the Motorola MC68000. In this paper we report our experience made in writing the target machine description and in adapting the whole code generator.

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

task experience synthesis paper writing code

select
compilation
adapt
systems
formalism
code generation


classification and quality assessment of high quality digital photographs We are interested in high quality photographs. This paper outlines our research proposal for the tasks of classification and quality assessment. We address these challenges by exploring the aesthetics from the combined perspectives of the artists and the photographers. We propose to use the aesthetic primitives of images for visualization as a guideline for high and low-level image feature extraction and to classify this high quality content into six creative exposure themes , which are commonly followed by the professional photographers. Then, we suggest to evaluate the quality of the photograph accordingly to these themes. We solve the problems using statistical modeling and learning approach.

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

photograph
classification
aesthetics
quality assessment
feature extraction


Online scheduling with preemption or non-completion penalties We consider online preemptive scheduling problems where jobs have deadlines and the objective is to maximize the total weight of jobs completed before their deadlines. In the first problem, preemptions are not free but incur a penalty. In the second problem, a job has to be accepted or rejected immediately upon arrival, and may need to be immediately allocated a fixed scheduling interval as well; if these accepted jobs are not eventually completed, the job is lost, and a penalty is incurred. We give an algorithm with the optimal competitive ratio for the first problem, and new and improved algorithms for the second problem, under different models of preemptions and job weights.

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

online algorithms
competitive analysis
immediate notification
immediate decision
preemption penalty


On enhanced non-linear free surface flow simulations with a hybrid LBM-VOF model In this paper, we present extensions, extensive validations and applications of our previously published hybrid volume-of-fluid-based (VOF) model for the simulation of free-surface flow problems. For the solution of the flow field, the lattice Boltzmann method is used, where the free surface is represented by a VOF approach. The advection equation for the VOF fill level is discretized with a finite volume method, on the basis of a 3D Piecewise Linear Interface Reconstruction (PLIC) algorithm. The model is validated for several standard free surface benchmarks, such as breaking dam scenarios and a free falling jet. Finally, the hybrid algorithm is applied to the simulation of a wave breaking by overturning during shoaling, which is considered to be a demanding test case, especially for VOF solvers. In this case, the flow field is initialized early in the shoaling process with a solitary wave solution from inviscid, irrotational potential flow. The wave breaking process is then simulated with the 3D transient and turbulent LBM-VOF solver. All validation and benchmark tests confirm the accuracy of the proposed hybrid model. (C) 2013 Published by Elsevier Ltd

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

free surface
lattice boltzmann method
plic
potential flow


An efficient algorithm for delay buffer minimization A data flow machine is said to be synchronized if for any vertex u in the underlying data flow graph, all inputs to vertex u arrive at the same time. An unsynchronized data flow machine with an acyclic underlying data flow graph can be transformed into a synchronized system by adding unit delay buffers to the system. This synchronization process can increase pipelining and throughout. Since the addition of delay buffers introduces hardware and area costs, it is desirable to insert the minimum number of delay buffers to synchronize a given data flow machine. Due to important applications in computer design, various delay buffer minimization problems have been studied by many researchers. Several optimal algorithms and heuristic algorithms have been proposed for slightly different models. In this paper, we introduce the concept of extensions of a directed acyclic graph to generalize and formalize several delay buffer minimization problems studied in the literature and present a polynomial time algorithm for computing the minimum delay buffer synchronization of a given data flow machine. Examples are provided to illustrate our algorithm and to show that our algorithm requires fewer delay buffers than previously published optimal algorithms for various models.

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

vlsi technology
optimal delay buffer insertion


Formalizing the LLVM Intermediate Representation for Verified Program Transformations This paper presents Vellvm (verified LLVM), a framework for reasoning about programs expressed in LLVM's intermediate representation and transformations that operate on it. Vellvm provides a mechanized formal semantics of LLVM's intermediate representation, its type system, and properties of its SSA form. The framework is built using the Coq interactive theorem prover. It includes multiple operational semantics and proves relations among them to facilitate different reasoning styles and proof techniques. To validate Vellvm's design, we extract an interpreter from the Coq formal semantics that can execute programs from LLVM test suite and thus be compared against LLVM reference implementations. To demonstrate Vellvm's practicality, we formalize and verify a previously proposed transformation that hardens C programs against spatial memory safety violations. Vellvm's tools allow us to extract a new, verified implementation of the transformation pass that plugs into the real LLVM infrastructure; its performance is competitive with the non-verified, ad-hoc original.

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


Comparison of isometric and anatomical graft placement in synthetic ACL reconstructions: A pilot study Correct graft placement is critical to the success of anterior cruciate ligament reconstructions (ACLR). Whilst current trend is to insert the graft in an anatomical location, synthetic grafts have shown to better perform when they are located in an isometric position. Placement, however, is largely dependent on the surgeon and no consensus has been reached for synthetic grafts. Kinematic flexion-extension data of four separate cadaveric knees was obtained using an optical tracking system. Knees were CT-scanned and computer models were developed for each specimen. Three different graft insertion techniques were simulated in each of the computer models. Kinematic data obtained from the optical tracking was applied to the 3D computer models to simulate knee flexion-extension, and virtual change in ACL graft length was measured over the cycle for each insertion technique. Length changes were plotted onto the Radiological-Quadrant. The isometric region on the femur was found to be a band spreading from the mid to deep end of the Blumensaat's line down to the shallow-inferior end of the femoral condyle. The JP Laboureau isometric point technique was consistently located in the isometric zone, with the following coordinates on the Radiographic-Quadrant: t=0.375 (SD 0.0066), h=0.227 (SD 0.0266). The BernardHertel and Charlie Brown anatomical placement methods were located (13%, ?6%) and (8%, ?15%) away, from the JP Laboureau isometric point, respectively, based on t- and h- coordinates of the Radiographic-Quadrant. This study has determined the isometric region using three-dimensional analysis relative to the Radiographic-Quadrant. The JP Laboureau method best finds the isometric point. This information is useful for synthetic graft placement.

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

knee joint
acl reconstruction
synthetic ligament
isometric insertion points


Built-In Sensor for Signal Integrity Faults in Digital Interconnect Signals Testing of signal integrity ( SI) in current high-speed ICs, requires automatic test equipment test resources at the multi-gigahertz range, normally not available. Furthermore, for most internal nets of state-of-the-art ICs, external speed testing is not possible for the newest technologies. In this paper, on-chip testing for SI faults in digital interconnect signals, using built-in high speed monitors, is proposed. A coherent sampling scheme is used to capture the signal information. Two monitors to test SI violations are proposed: one for undershoots at the high logic level and the other for overshoots at the low logic level. The monitors are capable of detecting small noise pulses and have been extended to test sequentially more than one signal. The cost of the proposed strategy is analyzed in terms of area, delay penalization, and test time. The effects of clock jitter and process variations are analyzed. Experimental results obtained in designed and fabricated circuits show the feasibility of the proposed testing strategy. A good agreement appears between the theoretical analysis, simulation results, and the experimental measurements.

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

high speed
noise pulses
overshoots
testing
undershoots


Impact of information sharing in hierarchical decision-making framework in manufacturing supply chains This paper presents a comprehensive framework for the analysis of the impact of information sharing in hierarchical decision-making in manufacturing supply chains. In this framework, the process plan selection and real-time resource allocation problems are formulated as hierarchical optimization problems, where problems at each level in the hierarchy are solved by separate multi-objective genetic algorithms. The considered multi-objective genetic algorithms generate near optimal solutions for NP-hard problems with less computational complexity. In this work, a four-level hierarchical decision structure is considered, where the decision levels are defined as enterprise level, shop level, cell level, and equipment level. Using this framework, the sources of information affecting the achievement of best possible decisions are then identified at each of these levels, and the extent of their effects from sharing them are analyzed in terms of the axis, degree and the content of information. The generality and validity of the proposed approach have been successfully tested for diverse manufacturing systems generated from a designed experiment.

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

multi-objective optimization
supply chain
shop floor control
hierarchical decision-making


distributed problem solving in sensor networks The difficulties in developing large-scale, distributed sensor networks are discussed and our recent experience in developing and analyzing distributed problem solving methods for applications in sensor networks is overviewed.

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

resource allocation
distributed constraint satisfaction


Calibration of fracture locus in scope of uncoupled elasticplastic-ductile fracture material models We performed uncoupled elasticplastic - damage material calibration. We used custom design specimens and testing devices to perform all experiments. We calibrated fracture locus according to Bai and Wierzbicki. We outlined calibration alternative based on target function variants. Experiments with excessive stress concentration showed limitations of used approach.

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

ductile fracture
damage mechanics
uncoupled elasticplastic-damage
material experiments
alternative calibration


moult: An R Package to Analyze Moult in Birds Moult is the process by which birds replace their feathers. It is a costly process in terms of energy and reduced flight ability but necessary for the maintenance of the plumage and its functions. Because birds generally avoid to moult while engaged with other energy demanding activities such as breeding and migration, the analysis of moult data gives insight into how birds fit this life stage into the annual cycle, on time constraints in the annual cycle, and on the effects of environmental variables on the timing of moult. The analysis of moult data requires non-standard statistical techniques. More than 20 years ago Underhill and Zucchini developed a likelihood approach for estimating duration, mean start date and variation in start date of a population of moulting birds. However, use of these models has been limited, mainly due to the lack of user-friendly software. The moult package for R implements the Underhill-Zucchini models, allowing the user to specify moult models in a regression type formula. In addition the functions allow the moult parameters (duration, and mean and variation in start date) to depend on explanatory variables. We here describe the package, give a brief summary of the theory and illustrate the models on two data sets included in the package.

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


Management Implications in Information Systems Research: The Untold Story In this essay, we take a fresh look at the IS academic community's enduring concern with the management implications of its research. We examine in particular what we call the "variables-centered" research paradigm, which focuses its attention on co-variance among independent and dependent variables. As the predominant research tradition in the field, the variables-centered paradigm ought to constitute a major platform from which our community can speak to issues of managerial interest. Unfortunately, the variables-centered paradigm appears to distance researchers from the organizational actors, such as managers, to whom they would give advice and counsel. Particularly disturbing is the systematic erasure of those very actors from the domain of inquiry. Erased, too, are their actions and means of acting. Thus, when it comes time to offer useful prescriptions for action, our community attempts to do so on the basis of research in which, ironically, neither actors nor action directly appear. We offer some recommendations that may help to rectify this problem and, thereby, enrich the capacity of variables-centered research to speak in an informative and useful way to issues of practice.

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

management implications
information systems research

variables-centered research
narrative
process theory
pragmatic generality


APDL: A reference XML schema for process-centered definition of RFID solutions ? Despite the proliferation of RFID systems and applications, there is still no easy way to develop, integrate and deploy non-trivial RFID solutions. Indeed, the latter comprise various middleware modules (e.g., data collection and filtering, generation of business events, integration with enterprise applications), which must be deployed and configured independently. In this paper we introduce APDL (AspireRFID Process Description Language), an XML based specification for describing and configuring RFID solutions. Using APDL one can minimize the steps and effort required to integrate and configure an RFID solution, since it unifies all the configuration parameters and steps comprising an RFID deployment. APDL supports several configuration parameters defined in the scope of the EPCglobal architecture and related standards. However, it extends beyond the EPCglobal architecture, to a wider class of RFID solutions. Furthermore, APDL is amendable by visual tools, which obviates the need to carry out low-level programming tasks in order to deploy an RFID solution. These tools are also presented and evaluated in the paper.

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

rfid middleware
rfid business processes
rfid business events
master data
rfid for logistics
rfid in supply chain management


Designing and testing a calibrating procedure for combining the coordination systems of a handling robot and a stationed video camera The paper discusses some of the results of designing and testing a calibrating procedure with important implications in contemporary robotics. This procedure is also mentioned in the literature as the procedure for calibrating by matching the coordination systems of a robot and a stationed video camera. The procedure is tested by a training robotechnic system, which consists of an anthropomorphic robot with five stages of freedom and a stationed video camera that can identify solid stationary objects. The results of this experimental testing are used to create and adopt some new methods for laboratory exams in robotics for students of FA in a Technical University and for developing further research on calibrating procedures in robotics needed for the industry.

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

handling with robot
programming of robot
recognition of video image
calibrating procedure
calibrating of coordination systems.


probabilistic model of triangulation This paper analyses the probability that randomly deployed sensor nodes triangulate any point within the target area. Its major result is the probability of triangulation for any point given the number of nodes lying up to a specific distance (2 units) from it, employing a graph representation where an edge exists between any two nodes close than 2 units from one another. The expected number of un-triangulated coverage holes, i.e. uncovered areas which cannot be triangulated by adjacent nodes, in a finite target area is derived. Simulation results corroborate the probabilistic analysis with low error, for any node density. These results will find applications in triangulation-based or trilateration-based pointing analysis, or any computational geometry application within the context of triangulation.

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


an efficient cache design for scalable glueless shared-memory multiprocessors Traditionally, cache coherence in large-scale shared-memory multiprocessors has been ensured by means of a distributed directory structure stored in main memory. In this way, the access to main memory to recover the sharing status of the block is generally put in the critical path of every cache miss, increasing its latency. Considering the ever-increasing distance to memory, these cache coherence protocols are far from being optimal from the perspective of performance. On the other hand, shared-memory multiprocessors formed by connecting chips that integrate the processor, caches, coherence logic, switch and memory controller through a low-cost, low-latency point-to-point network (glueless shared-memory multiprocessors) are a reality.In this work, we propose a novel design for the L2 cache level, at which coherence has to be maintained, aimed at being used in glueless shared-memory multiprocessors. Our proposal splits the cache structure into two different parts: one for storing data and directory information for the blocks requested by the local processor, and another one for storing only directory information for blocks accessed by remote processors. Using this cache scheme we remove the directory from main memory. Besides saving memory space, our proposal brings very significant reductions in terms of latency of the cache misses (speed-ups of 3.0 on average), which translate into reductions in applications' execution time of 31\% on average.

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

memory wall
glueless shared-memory multiprocessors
cache coherence


Using disability data to estimate design exclusion Exclusion auditing is a process that can quantitatively evaluate the inclusive merit of different products, or alternative design decisions. The results from such an audit can provide prioritised directions for product improvement and support the business case for reducing the capability levels required to use mainstream products. The 1996/1997 disability follow-up survey, conducted by the Office of National Statistics, is currently the most comprehensive data source for estimating design exclusion in the UK. In this paper, the data source is explained in detail, and a method is presented that uses this data to estimate the exclusion associated with several tasks that occur in series or in parallel, illustrated through worked examples. Having evaluated how many people are excluded, one can investigate why they were excluded, thus generating design insights into how they could be included. Data from the survey is also converted to a series of stylised graphs, which are intended to inspire designers to think about the relationship between the demands required to use a product and the resulting levels of population exclusion.

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

inclusive design
usability data
product assessment


Likelihood-based feature relevance for figure-ground segmentation in images and videos We propose an efficient method for image/video figure-ground segmentation using feature relevance (FR) and active contours. Given a set of positive and negative examples of a specific foreground (an object of interest (OOI) in an image or a tracked objet in a video), we first learn the foreground distribution model and its characteristic features that best discriminate it from its contextual background. For this goal, an objective function based on feature likelihood ratio is proposed for supervised FR computation. FR is then incorporated in foreground segmentation of new images and videos using level sets and energy minimization. We show the effectiveness of our approach on several examples of image/video figure-ground segmentation.

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

feature relevance
positive and negative examples
level sets

figure-ground segmentation
gaussian mixture models (gmms)


Improving the predictive power of spatial statistical models of stream macroinvertebrates using weighted autocovariance functions Spatial stream-network models had more predictive power than non-spatial models. The scale and pattern of spatial autocorrelation varied for all three indices. The choice of spatial weights strongly impacted model performance. Index composition may affect the scale and pattern of spatial autocorrelation. Insight into ecological processes may be gained by modelling spatial covariance.

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

spatial statistics
macroinvertebrate index
aquatic monitoring


Optimal regenerator placement in translucent optical networks The distance an optical signal can travel, before its quality degrades to a level that requires 3R-regeneration, is called the optical reach. In a translucent optical network, if an optical signal has to be communicated over a distance that exceeds the optical reach, the signal is regenerated at selected nodes of the network, so that the signal quality never degrades to an unacceptable level. Given a value of the optical reach, the goal of the Regenerator Placement Problem (RPP), in networks handling ad-hoc demands for lightpaths, is to find the minimum number of nodes capable of 3R regeneration necessary in the network and their positions, so that every pair of nodes (u,v) ( u , v ) can establish a lightpath (either transparent or translucent) from u to v. In this paper we have presented two Integer Linear Program (ILP) formulations that can optimally solve the RPP problem for practical-sized networks within a reasonable amount of time. The first formulation works for networks having 35 nodes or less. The second formulation works for larger networks as well (we have reported results with up to 140 nodes). We have used a branch-and-cut approach to implement the second formulation, where we have intercepted the optimization process with control callbacks from the CPLEX callable library to introduce new constraints, as needed.

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

wdm networks
translucent networks
branch-and-cut


P SYSTEMS AND TOPOLOGY: SOME SUGGESTIONS FOR RESEARCH Lately, some studies linked the computational power of abstract computing systems based on multiset rewriting to Petri nets and the computation power of these nets to their topology. In turn, the computational power of these abstract computing devices can be understood just looking at their topology, that is, information flow. This line of research is very promising for several aspects: (i) its results are valid for a broad range of systems based on multiset rewriting; (ii) it allows to know the computational power of abstract computing devices without tedious proofs; (iii) it links computational power to topology and, in this way, it opens a broad range of questions. In this paper we summarise the known results on this topic and we list a few suggestions for research together with the relevance of possible outcomes.

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


aspects of availability In this paper, we propose a domain-specific aspect language to prevent the denials of service caused by resource management. Our aspects specify availability policies by enforcing time limits in the allocation of resources. In our language, aspects can be seen as formal timed properties on execution traces. Programs and aspects are specified as timed automata and the weaving process as an automata product. The benefit of this formal approach is two-fold: the user keeps the semantic impact of weaving under control and (s)he can use a model-checker to optimize the woven program and verify availability properties.

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

timed automata
availability
weaving
resource management

denial of service
aspect-oriented programming


A possible model of benzimidazole binding to ?-tubulin disclosed by invoking an inter-domain movement ? Although it is well established that benzimidazole (BZMs) compounds exert their therapeutic effects through binding to helminth ?-tubulin and thus disrupting microtubule-based processes in the parasites, the precise location of the benzimidazole-binding site on the ?-tubulin molecule has yet to be determined. In the present study, we have used previous experimental data as cues to help identify this site. Firstly, benzimidazole resistance has been correlated with a phenylalanine-to-tyrosine substitution at position 200 of Haemonchus contortus ?-tubulin isotype-I. Secondly, site-directed mutagenesis studies, using fungi, have shown that other residues in this region of the protein can influence the interaction of benzimidazoles with ?-tubulin. However, the atomic structure of the ??-tubulin dimer shows that residue 200 and the other implicated residues are buried within the protein. This poses the question: how might benzimidazoles interact with these apparently inaccessible residues? In the present study, we present a mechanism by which those residues generally believed to interact with benzimidazoles may become accessible to the drugs. Furthermore, by docking albendazole-sulphoxide into a modelled H. contortus ?-tubulin molecule we offer a structural explanation for how the mutation conferring benzimidazole resistance in nematodes may act, as well as a possible explanation for the species-specificity of benzimidazole anthelmintics.

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

benzimidazole
tubulin
haemonchus contortus

benzimidazole resistance
domain movement
fasciola hepatica


extending the constraint database framework Constraint Databases (CDBs) are an extension of relational databases that enrich both the relational data model and the relational query primitives with constraints. By providing a finite representation of data with infinite semantics, the Constraint Database approach is particularly appropriate for querying spatiotemporal data.Since the introduction of Constraint Databases in the early 1990's, several Constraint Database systems have been implemented. In this paper, we discuss several extensions to Paris's Constraint Database framework that we believe necessary, based on the experience with these implementations, and specifically CQA/CDB:Extending the CDB schema to explicitly distinguish traditional from constraint attributes.Additional Constraint Query Algebra operators: keeping queries safe.Multi-attribute indexing systems: how best to group the attributes?Flexibility in representing infinite data: taking constraints.We believe that Paris would have been the first to modify the Constraint Database framework if he felt there were a way to improve it, and we hope that these extensions to the CDB framework bring us closer towards realizing the promise that constraint database technology holds for integrating the advantages of traditional relational database technology with emerging data intensive applications.

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

constraint query languages
spatial databases
database indexing


The boolean hierarchy of NP-partitions We introduce the boolean hierarchy of k-partitions over NP for k >= 3 as a generalization of the boolean hierarchy of sets (i.e., 2-partitions) over NP. Whereas the structure of the latter hierarchy is rather simple the structure of the boolean hierarchy of k-partitions over NP for k >= 3 turns out to be much more complicated. We formulate the Embedding Conjecture which enables us to get a complete idea of this structure. This conjecture is supported by several partial results. (c) 2007 Elsevier Inc. All rights reserved.

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

computational complexity theory
partitions
polynomial hierarchy
orders and lattices


Cross border railway operations: improving safety at cultural interfaces Organizations with different cultures will interface with each other as legislation is introduced to ensure the interoperability of railway systems across Europe. To approach the safety challenges related to interfaces between cultures, the International Union of Railways (UIC) initiated the project Safety Culture at Interfaces. The project covers the development of a method for assessing and trying to improve safety cultural interfaces. The project was performed by SINTEF. This paper presents the method, which is called SafeCulture. The project has piloted the method in three railway organizations with positive evaluations from the participants, identifying several issues that could improve safety at interfaces. It is not possible to isolate safety culture at interfaces from the whole system, embracing environment, infrastructure, organization, individual and teamwork. Safety culture at interfaces is an integrated part of the whole picture. Building safety culture at interfaces has been seen as a learning process that requires involvement and commitment between organizations. This is a difficult challenge. One of the first challenges is to motivate and get involvement from the relevant parties in the process. The next challenge is to develop real commitment from the organizations that are involved to agree on common solutions. Our approach to these challenges has been to establish a qualitative method, consisting of questionnaires and exploration of scenarios where the involved parties feel confident of their knowledge and can be motivated to share experience. Involvement and participation from the workforce and management, from the beginning of the learning loop, will create ownership and commitment to the problems and their solutions.

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 B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O B 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 semi-Lagrangian method for a cell population model in a dynamical environment We formulate a numerical method on a regular grid, which is based on integration along characteristics curves, to solve a size-structured cell population model in an environment with an evolutionary resource concentration. Numerical simulations are also reported to show the convergence of the approximations and to study the dynamics of the considered problem thanks to the fine behavior of the numerical scheme. (C) 2011 Elsevier Ltd. All rights reserved.

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

size-structure
numerical simulation
semi-lagrangian scheme


The cost of getting local monotonicity We study convex combinations of power indices and the possible violation of local monotonicity. Our approach can be seen as a general method for the designing of power indices with specified properties. If local monotonicity is not violated, then the ratio of the Public Good index has to be rather small. Our study gives some insight on the differences between certain power indices.

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

simple games
weighted games
design of power indices
solidarity
fair division


An algorithm for reporting maximal c-cliques Given two graphs, a fundamental task faced by matching algorithms consists of computing either the (connected) maximal common induced subgraphs ((C)MCIS) or the (connected) maximal common edge subgraphs ((C)MCES). In particular, computing the CMCIS or CMCES reduces to reporting so-called c-connected cliques in product graphs, a problem for which an algorithm has been presented in I. Koch, Fundamental study: enumerating all connected maximal common subgraphs in two graphs, Theoret. Comput. Sci. 250 (1-2), (2001) 1-30. This algorithm suffers from two problems which are corrected in this note. (c) 2005 Elsevier B.V. All rights reserved.

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

maximal c-connected cliques
maximal-cliques
maximal common induced/edge subgraphs
shape matching


spatial-temporal understanding of urban scenes through large camera network Outdoor surveillance cameras have become prevalent as part of the urban infrastructure, and provided a good data source for studying urban dynamics. In this work, we provide a spatial-temporal analysis of 8 weeks of video data collected from the large outdoor camera network at UCSB campus, which consists of 27 cameras. We first apply simple vision algorithm to extract the crowdedness information in the scene. Then we further explore the relationship between the traffic pattern observed from the cameras with activities in the nearby area using additional knowledge such as campus class schedule. Finally we investigate the potential of discovering aggregated human movement pattern by assuming a simple probabilistic model. Experiment has shown promising results using the proposed method.

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


Bayesian network-based formulation and analysis for toll road utilization supported by traffic information provision We analyzed drivers toll road usage preference with traffic information support. A nested logit model is used to select significant factors on toll road usage. A Bayesian network is trained to assess the interdependency among selected factors. This study provides insights into drivers tendency concerning toll road usage.

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

toll road
traffic information provision
nested logit model
bayesian network


MMSE relay precoding schemes based on quantization error compensation for multi-relay system In order to deal with the performance degradation resulting from the quantization error, this paper introduces the statistics of Grassmannian codebook's quantization error into relay precoding design for multirelay system. Based on the two-step MMSE optimization algorithm for relay precoding and receiver equalizing with full feedback under QoS requirements, we first propose a limited feedback two-step MMSE optimization scheme for relay precoding and receiver equalizing with quantization error compensation, and then we propose a limited feedback joint MMSE optimization scheme for relay precoding and receiver equalizing with quantization error compensation subject to a global power constraint at the output of relays. Simulation results show that the proposed joint MMSE optimization scheme with quantization error compensation has a much lower bit-error rate than the two-step MMSE optimization scheme with quantization error compensation and the joint MMSE optimization scheme without quantization error compensation.

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


Drug Abuse in China The drug problem in China reappeared in the late 1980s. At that time, most drug abusers used opium only, with heroin accounting for a very small proportion and its use being limited to border areas in the southwest and rural areas in the northwest. Beginning in the early 1990s, drug abuse spread quickly. The number of registered drug addicts increased from 70,000 in 1990 to one million by the end of 2002. Besides opioids, some new kinds of drugs including amphetamines and ketamine have penetrated the country through various channels since 1997. Drug abuse has caused severe problems for both the abusers and society. Three types of treatment settings for detoxification and rehabilitation are available

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


The design and implementation of the NCTUns 1.0 network simulator This paper presents the design and implementation of the NCTUns 1.0 network simulator, which is a high-fidelity and extensible network simulator capable of simulating both wired and wireless IP networks. By using an enhanced simulation methodology, a new simulation engine architecture, and a distributed and open-system architecture, the NCTUns 1.0 network simulator is much more powerful than its predecessorthe Harvard network simulator, which was released to the public in 1999. The NCTUns 1.0 network simulator consists of many components. In this paper, we will present the design and implementation of these components and their interactions in detail.

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

network simulator
simulation methodology


A Near-Optimal Solution Approach for the Multi-hop Traffic Grooming Problem In this paper we consider a capacity sizing and routing problem in synchronous digital hierarchy/wavelength division multiplexing networks with nodes having switching capabilities. This problem is well known in the literature as the multi-hop traffic grooming problem and is generally formulated as an integer linear program, which is especially hard to solve when the demand channels are unsplittable and nonuniform. To overcome this difficulty we develop a branching strategy, using a lower bound that is close to the optimal solution. We also devise a reformulation which accelerates branch-and-bound-based solvers. The computational results clearly show that our method is effective in reducing execution time as well as memory consumption, in comparison to traditional methods based on branch-and-bound.

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

branch-and-bound
multi-hop traffic grooming
network design
sdh/wdm
sonet


Max-margin Non-negative Matrix Factorization In this paper we introduce a supervised, maximum margin framework for linear and non-linear Non-negative Matrix Factorization. By contrast to existing methods in which the matrix factorization phase (i.e. the feature extraction phase) and the classification phase are separated, we incorporate the maximum margin classification constraints within the NMF formulation. This results to a non-convex constrained optimization problem with respect to the bases and the separating hyperplane, which we solve following a block coordinate descent iterative optimization procedure. At each iteration a set of convex (constrained quadratic or Support Vector Machine-type) sub-problems are solved with respect to subsets of the unknown variables. By doing so, we obtain a bases matrix that maximizes the margin of the classifier in the low dimensional space (in the linear case) or in the high dimensional feature space (in the non-linear case). The proposed algorithms are evaluated on several computer vision problems such as pedestrian detection, image retrieval, facial expression recognition and action recognition where they are shown to consistently outperform schemes that extract features using bases that are learned using semi-NMF and classify them using an SVM classifier. (C) 2012 Elsevier B.V. All rights reserved.

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

non-negative matrix factorization
supervised feature extraction
semi-nmf
max-margin classifier


Experience with user-centred requirements engineering This paper describes the application of humancomputer interaction (HCI) principles and methods to requirements engineering in a case study development of a visualisation tool, ADVISES, to support epidemiological research. The development approach consisted of scenario-based design and analysis of the users tasks and mental model of the domain. Prototyping and storyboarding techniques were used to explore design options with users as well as specifying functionality for two versions of the software to meet the needs of novice and expert users. Application of HCI functional allocation heuristics to guide system requirements decisions is explained. An evaluation of the prototype was carried out to assess the extent to which the expert model would support public health professionals in their analysis activities. The results of the design exploration requirements analysis study are reported. The implications of scenario-based design exploration, functional allocation and software architecture are discussed.

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

requirements elicitation
scenarios
user-centred design
re methods


Flocking behaviour in simple ecosystems as a result of artificial evolution In this paper the FLOCK system is presented, which was designed to test the ability of simple genetic algorithm to evolve flocking behaviour in ecosystems consisting of plants, herbivores and predators. Open-ended evolution was applied in the experiments, first. Many different behaviours were observed, which were very similar to those in nature, for instance: the escape of herbivore from predators, making herbivores route towards plants or a pursuit of predators after herbivores. Another interesting behaviour was grouping of predators around plants, where the probability of meeting herbivores is greater than in other places. But open-ended evolution and complex vision system of animal were not sufficient to observe flocking behaviour. The advanced behaviour such as creation of flocks appeared as a result of steered evolution.

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


efficient top-k querying over social-tagging networks Online communities have become popular for publishing and searching content, as well as for finding and connecting to other users. User-generated content includes, for example, personal blogs, bookmarks, and digital photos. These items can be annotated and rated by different users, and these social tags and derived user-specific scores can be leveraged for searching relevant content and discovering subjectively interesting items. Moreover, the relationships among users can also be taken into consideration for ranking search results, the intuition being that you trust the recommendations of your close friends more than those of your casual acquaintances. Queries for tag or keyword combinations that compute and rank the top-k results thus face a large variety of options that complicate the query processing and pose efficiency challenges. This paper addresses these issues by developing an incremental top-k algorithm with two-dimensional expansions: social expansion considers the strength of relations among users, and semantic expansion considers the relatedness of different tags. It presents a new algorithm, based on principles of threshold algorithms, by folding friends and related tags into the search space in an incremental on-demand manner. The excellent performance of the method is demonstrated by an experimental evaluation on three real-world datasets, crawled from deli.cio.us, Flickr, and LibraryThing.

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

top-k processing
scoring and ranking
social networks


Watershed level risk assessment of nitrogen and phosphorus export ? Land cover composition across a watershed is a principal factor in controlling the amount of nitrogen and phosphorus exported from a watershed. A well developed literature of nutrient export coefficients by land-cover class was used to model the risk of equaling or exceeding specified levels of nutrient export. The model was applied to about 1000 comparatively small watersheds mapped for the state of Maryland for environmental analysis and planning. Risk estimates generally increased from west to east, but numerous areas of high variability were evident. Risk of exceeding specified levels of nitrogen and phosphorus export were nonlinearly related to the amount of forest in the watershed. Risk increased more dramatically for phosphorus and nitrogen when forest dropped below between 90 and 95%, respectively. Bifurcations in this nonlinear relationship were the result of the relative abundance of agriculture and urban land in the watershed. The nonlinear relationship between percentage forest and risk increased more dramatically for phosphorus and less dramatically for nitrogen when urban was relatively more abundant than agriculture. Regional-scale variation in risk is discussed in terms of its relevance to environmental management.

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


Adaptive road detection via context-aware label transfer The vision ability is fundamentally important for a mobile robot. Many aspects have been investigated during the past few years, but there still remain questions to be answered. This work mainly focuses on the task of road detection, which is considered as the first step for a robot to become moveable. The proposed method combines the depth clue with traditional RGB information and is divided into three steps: depth recovery and superpixel generation, weakly supervised SVM classification and context-aware label transfer. The main contributions made in this paper are (1) Design a novel superpixel based context-aware descriptor by utilizing depth map. (2) Conduct label transfer in an efficient nearest neighbor search and a temporal MRF model. (3) Update the learned model adaptively with the changing scene. Experimental results on a publicly available dataset justify the effectiveness of the proposed method.

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

road detection
depth map
label transfer
mrf


tcp-sleek channel access scheduling for multi-hop mesh networks Wireless channel contention/interference problems combined with the constraints imposed by the TCP congestion control scheme have a severe impact on TCP throughput performance and fairness in a wireless mesh network. In this paper, we propose a TCP-sleek spatial TDMA scheduling algorithm to construct a sleek data and ACK packet flowing environment for TCP flows along the wireless paths. The proposed scheme considers the TCP demands of individual directional links during channel access scheduling and time slot assignment to enable the TCP congestion control mechanisms to perform as effectively as they do in wired networks, irrespective of their spatial locations and the number of hops traversed. In addition, employing link-layer retransmission can effectively hide local transmission errors from the end-to-end TCP congestion control mechanisms. The simulation results demonstrate that, under the proposed scheme, the problem of unfair bandwidth sharing to long-hop TCP flows caused by wireless communication is successfully eliminated, and the throughput disparity between long- and short-hop TCP flows is also substantially reduced. The scheme also achieves high overall network throughput.

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

spatial tdma channel access
wireless mesh networks


towards system-mediated car passenger communication In this paper, we outline a system that supports the communication between passengers by transmitting speech (and maybe also video) of the communication partners back and forth. A study is presented that addresses the questions: 1. Is listening to noisy speech coming from the backseat really distracting the driver? Subjects are rating the truth of common-sense statements played from the back of the car (clear, noisy) while driving with a drive simulator. NOISY is rated significantly more distracting than CLEAR while objective driving performance only degrades for men but not for women.

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

lane change
multi-party
infotainment
automotive


Accurate recovery-based upper error bounds for the extended finite element framework This paper introduces a recovery-type error estimator yielding upper bounds of the error in energy norm for linear elastic fracture mechanics problems solved using the extended finite element method (XFEM). The paper can be considered as an extension and enhancement of a previous work in which the upper bounds of the error were developed in a FEM framework. The upper bound property requires the recovered solution to be equilibrated and continuous. The proposed technique consists of using a recovery technique, especially adapted to the XFEM framework that yields equilibrium at a local level (patch by patch). Then a postprocess based on the partition of unity concept is used to obtain continuity. The result is a very accurate but only nearly-statically admissible recovered stress field, with small equilibrium defaults introduced by the postprocess. Sharp upper bounds are obtained using a new methodology accounting for the equilibrium defaults, as demonstrated by the numerical tests.

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

extended finite element method
linear elastic fracture mechanics
upper error bounds

a posteriori error estimation
equilibrated stresses
stress recovery


Data reduction for graph coloring problems ? ?? This paper studies the kernelization complexity of graph coloring problems with respect to certain structural parameterizations of the input instances. We are interested in how well polynomial-time data reduction can provably shrink instances of coloring problems, in terms of the chosen parameter. It is well known that deciding 3-colorability is already NP-complete, hence parameterizing by the requested number of colors is not fruitful. Instead, we pick up on a research thread initiated by Cai (DAM, 2003) who studied coloring problems parameterized by the modification distance of the input graph to a graph class on which coloring is polynomial-time solvable; for example parameterizing by the number k of vertex-deletions needed to make the graph chordal. We obtain various upper and lower bounds for kernels of such parameterizations of q-Coloring, complementing Cai?s study of the time complexity with respect to these parameters. Our results show that the existence of polynomial kernels for q-Coloring parameterized by the vertex-deletion distance to a graph class F F is strongly related to the existence of a function f(q) f ( q ) which bounds the number of vertices which are needed to preserve the no-answer to an instance of q-List Coloring on F F .

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

graph coloring
polynomial kernels
structural parameterizations


symbolic state traversal for wcet analysis Static worst-case execution time analysis of real-time tasks is based on abstract models that capture the timing behavior of the processor on which the tasks run. For complex processors, task-level execution time bounds are obtained by a state exploration which involves the abstract model and the program. Partial state space exploration is not sound. A full exploration can become too expensive. We present a novel symbolic method for WCET analysis based on abstract pipeline models which produces sound results and is scalable in terms of the considered hardware states.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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
hard real time
binary decision diagram
processor models
worst-case execution time


A Galerkin least squares method for time harmonic Maxwell equations using Nedelec elements A Galerkin least squares finite element method for the solution of the time-harmonic Maxwell's equations using Nedelec elements is proposed. This method appends a least-squares term, evaluated within element interiors, to the standard Galerkin method. For the case of lowest order hexahedral element, the numerical parameter multiplying this term is determined so as to optimize the dispersion properties of the resulting formulation. In particular, explicit expressions for this parameter are derived that lead to methods with no dispersion error for propagation along a specified direction and reduced dispersion error over all directions. It is noted that this method is easy to implement and does not add to the computational costs of the standard Galerkin method. The performance of this method is tested on problems of practical interest. (c) 2012 Elsevier Inc. All rights reserved.

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

time-harmonic maxwell's equations
nedelec edge element
stabilized finite element method
galerkin least-squares method


dynamic linking on a shared-memory multiprocessor This paper presents a technique for backpatching instructions in an SMP environment. This technique is used by the Jalapeno virtual machine to support dynamic class loading in Java. There is a small runtime overhead the first time a backpatch site is executed. Thereafter, it executes at the same speed as equivalent sites not requiring back-patching.

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

dynamic
support
virtual machine
paper
runtime
backpatching
linking
class

java virtual machine
environments
shared memory multiprocessors
instruction
timing
idempotent code
powerpc architecture
relaxed memory consistency
patch
dynamic linking


Sparse representation and position prior based face hallucination upon classified over-complete dictionaries In compressed sensing theory, decomposing a signal based upon redundant dictionaries is of considerable interest for data representation in signal processing. The signal is approximated by an over-complete dictionary instead of an orthonormal basis for adaptive sparse image decompositions. Existing sparsity-based super-resolution methods commonly train all atoms to construct only a single dictionary for super-resolution. However, this approach results in low precision of reconstruction. Furthermore, the process of generating such dictionary usually involves a huge computational cost. This paper proposes a sparse representation and position prior based face hallucination method for single face image super-resolution. The high- and low-resolution atoms for the first time are classified to form local dictionaries according to the different regions of human face, instead of generating a single global dictionary. Different local dictionaries are used to hallucinate the corresponding regions of face. The patches of the low-resolution face inputs are approximated respectively by a sparse linear combination of the atoms in the corresponding over-complete dictionaries. The sparse coefficients are then obtained to generate high-resolution data under the constraint of the position prior of face. Experimental results illustrate that the proposed method can hallucinate face images of higher quality with a lower computational cost compared to other existing methods.

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

sparse representation
face hallucination


A TEMPERATURE FIELD DETECTION SYSTEM FOR BLAST FURNACE BASED ON MULTI-SOURCE INFORMATION FUSION With regard to the difficulty in detecting the burden surface temperature of blast furnace (BF), an online detection system based on multi-source information fusion is put forward in this paper. Firstly, a method for estimating the temperature of burden surface based on heterogeneous single information is proposed. Then an approach of multi-source information fusion based on reliability theory and Kalman Filter is presented. Lastly, the system implementation and industrial application is introduced. The result from a 2200 m(3) BF indicates that this system can directly and accurately reflect the real-time state of burden surface temperature distribution. This paper provides an effective solution to control and monitor the process of complicated metallurgy.

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

burden surface temperature field
multi-source information fusion


Analysis of resolution and noise properties of nonquadratically regularized image reconstruction methods for PET We present accurate and efficient methods for estimating the spatial resolution and noise properties of non-quadratically regularized image reconstruction for positron emission tomography (PET). It is well known that quadratic regularization tends to over-smooth sharp edges. Many types of edge-preserving nonquadratic penalties have been proposed to overcome this problem. However, there has been little research on the quantitative analysis of nonquadratic regularization due to its nonlinearity. In contrast, quadratically regularized estimators are approximately linear and are well understood in terms of resolution and variance properties. We derive new approximate expressions for the linearized local perturbation response (LLPR) and variance using the Taylor expansion with the remainder term. Although the expressions are implicit, we can use them to accurately predict resolution and variance for nonquadratic regularization where the conventional expressions based on the first-order Taylor truncation fail. They also motivate us to extend the use of a certainty-based modified penalty to nonquadratic regularization cases in order to achieve spatially uniform perturbation responses, analogous to uniform spatial resolution in quadratic regularization. Finally, we develop computationally efficient methods for predicting resolution and variance of non-quadratically regularized reconstruction and present simulations that illustrate the validity of these methods.

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

image resolution
positron emission tomography (pet)
statistical image reconstruction


Internet-based expert systems The Internet offers a large potential for delivery of various information-based services, including the services of intelligent applications. As the availability, of the Internet has grown, its value as a medium for the delivery of expert systems in particular has increased. There are now a large number of expert systems available on the Internet, including applications in industry, medicine, science and government. Though the Internet provides several advantages for expert system development, it also presents some special problems. These advantages and disadvantages are explored in more detail in this paper. The paper also presents a review of several Internet-based expert systems with a representative sample of publicly available applications, and a discussion of typical tools for developing Internet-based expert systems. A case study of an Internet-based expert system is presented as well.

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

world wide web
web-based information systems


Factors Affecting Knowledge, Attitudes, and Skills Levels for Nursing Staff Toward the Clinical Management System in Hong Kong The purpose of the present study was to develop a tool for evaluating knowledge, skills, and attitudes levels of nursing staff members toward the clinical management system and to determine factors affecting their knowledge, attitudes, and skill levels. A survey was conducted from December 2004 to May 2005, with 282 nurses in four local hospitals in Hong Kong Completing a self-report questionnaire. Multiple regression showed that older age (beta = 0. 13, P =.01), higher educational levels (beta = 0.37, P <.001), and attitude scores (beta = 0.14, P <.001) are factors that significantly improve nurses' knowledge. Factors that may improve nurses' attitudes were shown to be more on work experiences (beta = 0.52, P =.01), experience in medical or specialist units and senior ranking (beta = 2.51, P<.001), and higher knowledge (beta = 1.24, P <.001). Older age (beta = 0.73, P <.001), higher educational level (beta = 1.78, P <.001), and senior ranking (beta = 4.06, P <.001) are factors that improve nurses' skills. The managerial implications for these findings are important because the variables identified in this study are directly related to enhancement of the quality and efficiency of the clinical management system. These findings should be.,used to formulate strategies to encourage nurses to resolve actual problems and increase the depth and breadth of their computer knowledge, attitudes, and skills.

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


Urban rapid transit network capacity expansion ? This paper examines a multi-period capacity expansion problem for rapid transit network design. The capacity expansion is realized through the location of train alignments and stations in an urban traffic context by selecting the time periods. The model maximizes the public transportation demand using a limited budget and designing lines for each period. The location problem incorporates the user decisions about mode and route. The network capacity expansion is a long-term planning problem because the network is built over several periods, in which the data (demand, resource price, etc.) are changing like the real problem changes. This complex problem cannot be solved by branch and bound, and for this reason, a heuristic approach has been defined in order to solve it. Both methods have been experimented in test networks.

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

capacity expansion
multiperiod
rapid transit network design
branch and bound


Improving the Efficiency of Image Clustering using Modified Non Euclidean Distance Measures in Data Mining The Image is very important for the real world to transfer the messages from any source to destination. So, these images are converted in to useful information using data mining techniques. In existing all the research papers using kmeans and fuzzy k means with euclidean distance for image clustering. Here, each cluster needs its own centric for cluster calculation and the euclidean distance calculate the distance between the points. In clustering this process of distance calculation did not give efficient result. For make this in to efficient, this research paper proposes the non Euclidean distance measures for distance calculation. Here, the logical points are used to find the cluster. The result shows that image clustering based on the modified non Euclidean distance and the performance shows the efficiency of non euclidean distance measures.

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


FlexiMine - A flexible platform for KDD research and application development FlexiMine is a KDD system designed as a testbed for data-mining research, as well as a generic knowledge discovery tool for varied database domains. Flexibility is achieved by an open-ended design for extensibility, thus enabling integration of existing data-mining algorithms, new locally developed algorithms, and utility functions such as visualization and preprocessing. Support for new databases is simple and clean: the system interfaces with a standard database server via SQL queries and thus can handle any application database. With a view of serving remote, as well as local, users, internet availability was a design goal. By implementing the system in Java, minor modifications allow us to run the user-end of the system either as a Java applications or (with some limitations on the user) as a Java Applet. This paper reviews the architecture, design and operation of FlexiMine and presents some of the new ideas incorporated in the data-mining algorithms (Association rules, Decision trees, Bayesian knowledge-bases and Meta-queries).

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

knowledge discovery in databases
data mining
meta-queries
flexible software systems
www-based tools
bayesian knowledge bases


optimising the flow of experiments to a robot scientist with multi-objective evolutionary algorithms A Robot Scientist is a physically implemented system that applies artificial intelligence to autonomously discover new knowledge through cycles of scientific experimentation. Additionally, our Robot Scientist is able to execute experiments that have been requested by human biologists. There arises a multi-objective problem in the selection of batches of trials to be run together on the robot hardware. We describe the use of the jMetal framework to assess the suitability of a number of multi-objective metaheuristics to optimise the flow of experiments run on a Robot Scientist. Experiments are selected in batches, chosen in order to maximise the information gain and minimise the use of resources. The evolutionary multi-objective algorithms evaluated here perform well in finding solutions to this problem, either finding a long, fairly efficient Pareto optimal front, or a shorter, highly efficient Pareto optimal front.

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

evaluation
robot scientists
yeast genomics
sxperiment flow optimisation
performance


An integrated multidimensional process improvement methodology for manufacturing systems In this paper, an integrated multidimensional process improvement methodology (IMPIM) is formulated to address the yield management, process control and cost management problems of a manufacturing system. Simulation is used as a platform to implement the integrated multidimensional process methodology by incorporating the productivity, quality and cost dimension in a unified, systematic and holistic manner. Total Quality Management (TQM) addresses the quality parameters and Activity-Based Costing is used to manage the cost dimension of the system. Discrete event simulation is then used. as a platform to perform process reengineering (Business Process Reengineering) and process improvement (TQM). The general implementation framework of the IMPIM is given with a step-by-step explanation. A conceptual discussion is also provided for the integrated methodology. The generic IMPIM is then formulated and the detailed implementation procedures for two case studies are compared with the generic methodology. (C) 2003 Elsevier Science Ltd. All rights reserved.

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

activity-based costing
control chart
neural networks
statistical process control


Synchronous approach in interactive multiobjective optimization We introduce a new approach in the methodology development for interactive multiobjective optimization. The presentation is given in the context of the interactive NIMBUS method, where the solution process is based on the classification of objective functions. The idea is to formulate several scalarizing functions, all using the same preference information of the decision maker. Thus, opposed to fixing one scalarizing function (as is done in most methods), we utilize several scalarizing functions in a synchronous way. This means that we as method developers do not make the choice between different scalarizing functions but calculate the results of different scalarizing functions and leave the final decision to the expert, the decision maker. Simultaneously, (s)he obtains a better view of the solutions corresponding to her/his preferences expressed once during each iteration. In this paper, we describe a synchronous variant of the NIMBUS method. In addition, we introduce a new version of its implementation WWW-NIMBUS operating on the Internet. WWW-NIMBUS is a software system capable of solving even computationally demanding nonlinear problems. The new version of WWW-NIMBUS can handle versatile types of multiobjective optimization problems and includes new desirable features increasing its user-friendliness.

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

multiple objective programming
mcdm
interactive methods
www-nimbus
nonlinear programming


Reprint of: Refold rigidity of convex polyhedra ? We show that every convex polyhedron may be unfolded to one planar piece, and then refolded to a different convex polyhedron. If the unfolding is restricted to cut only edges of the polyhedron, we identify several polyhedra that are edge-refold rigid in the sense that each of their unfoldings may only fold back to the original. For example, each of the 43,380 edge unfoldings of a dodecahedron may only fold back to the dodecahedron, and we establish that 11 of the 13 Archimedean solids are also edge-refold rigid. We begin the exploration of which classes of polyhedra are and are not edge-refold rigid, demonstrating infinite rigid classes through perturbations, and identifying one infinite nonrigid class: tetrahedra.

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


On alleviating MTC overload in EPS In this paper, we introduce novel mechanisms that anticipate system overload due to MTC signaling messages in 3GPP networks. These mechanisms proactively avoid system congestion by: (i) reducing the amount of signaling messages exchanged when triggering low mobility MTC devices and (ii) reducing the signaling message content for a group of MTC devices sharing redundant Information Element (IE) by creating a profile ID for this group. In addition, along with the second solution, we propose a dynamic grouping solution, which groups MTC device with common subscription features in orders to control the MTC signaling traffics when the network is overloaded. Numerical results show the efficiency of using the proposed solutions compared to only grouping the MTC devices, and using a bulk signaling mechanism.

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


splitting rules for graceful degradation of user interfaces This paper presents a series of new algorithms for paginating interaction spaces (i.e.; windows, dialog boxes, web pages...) based on a multi-layer specification in a user interface description language. We first describe how an interaction space can be split using information from the presentation layer (Concrete User Interface). We then demonstrate how information from higher levels of abstraction (Abstract User Interface, Task model) can be used to produce a pagination that is more meaningful from the task's viewpoint than other techniques. The pagination relies on a set of explicit splitting rules that can be applied as the first step in a graceful degradation. These splitting rules are implemented as an interface builder plug-in which automatically generates code under the designer's control.

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

graceful degradation
pagination
splitting rules


efficient implementation of decoupling capacitors in 3d processor-dram integrated computing systems Three-dimensional (3D) integration of a single high performance microprocessor die and multiple DRAM dies has been considered as a viable option to tackle the looming memory wall problem. Meanwhile, on-chip decoupling capacitors are becoming increasingly important to ensure power delivery integrity, particularly for high-performance integrated circuits. Targeting at 3D processor-DRAM integrated computing systems, this paper proposes to use 3D stacked DRAM dies to provide decoupling capacitors for the processor die. This can well leverage the superior capacitor fabrication ability of DRAM to eliminate the area penalty of decoupling capacitor insertion on the processor die. For its practical implementation, a simple uniform decoupling capacitor network design strategy is presented, and circuit SPICE simulations and computer system simulations are carried out to quantitatively demonstrate the effectiveness and illustrate various design trade-offs.

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


An iterative procedure for equivalent source representation of focusing magnetic fields in TWT Purpose - This paper aims to present a new iterative procedure for the 3D representation of focusing magnetic fields in TWTs generated by PPMs, by using equivalent sources and optimisation algorithms. Design/methodology/approach - In the integrated optimisation strategy general models for magnetic sources are employed and local and global inverse problems are iteratively solved for the minimization of the representation error. Findings - The results obtained show that the target accuracy is reached with a low computational effort, employing a minimum number of equivalent sources. Practical implications - The procedure is robust and converges for all the examined magnetic field configurations. Originality/value - Different from other approaches, the procedure presented here can be directly applied to a variety of different models for magnetic sources.

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


Encoding atlases by randomized classification forests for efficient multi-atlas label propagation We propose encoding image atlases by randomized classification forests. Scheme requires only a single registration for labeling of one target. Increased efficiency through properties of the proposed encoding. Evaluation of accuracy on 4 publicly available datasets.

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

randomized forest
multi-atlas label propagation
brain
segmentation


A shock-capturing methodology based on adaptative spatial filtering for high-order non-linear computations A shock-capturing methodology is developed for non-linear computations using low-dissipation schemes and centered finite differences. It consists in applying an adaptative second-order filtering to handle discontinuities in combination with a background selective filtering to remove grid-to-grid oscillations. The shock-capturing filtering is written in its conservative form, and its magnitude is determined dynamically from the flow solutions. A shock-detection procedure based on a Jameson-like shock sensor is derived so as to apply the shock-capturing filtering only around shocks. A second-order filter with reduced errors in the Fourier space with respect to the standard second-order filter is also designed. Linear and non-linear 1D and 2D problems are solved to show that the methodology is capable of capturing shocks without providing dissipation outside shocks. The shock detection allows in particular to distinguish shocks from linear waves, and from vortices when it is performed from dilatation rather than from pressure. Finally the methodology is simple to implement and reasonable in terms of computational cost.

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


Coulomb Greens function and image potential near a cylindrical diffuse interface In a preceding paper [Comput. Phys. Commun. 184 (1): 5159, 2013], we revisited the problem of calculating Coulomb Greens function and image potential near a planar diffuse interface within which the dielectric permittivity of the inhomogeneous medium changes continuously along one Cartesian direction in a transition layer between two dissimilar dielectric materials. In the present paper, we consider a cylindrical diffuse interface within which the dielectric permittivity changes continuously along the radial direction instead. First we propose a specific cylindrical diffuse interface model, termed the quasi-harmonic diffuse interface model, that can admit analytical solution for the Greens function in terms of the modified Bessel functions. Then and more importantly we develop a robust numerical method for building Greens functions for any cylindrical diffuse interface models. The main idea of the numerical method is, after dividing a diffuse interface into multiple sublayers, to approximate the dielectric permittivity profile in each one of the sublayers by one of the quasi-harmonic functional form rather than simply by a constant value as one would normally do. Next we describe how to efficiently compute well-behaved ratios, products, and logarithmic derivatives of the modified Bessel functions so as to avoid direct evaluations of individual modified Bessel functions in our formulations. Finally we conduct numerical experiments to show the effectiveness of the quasi-harmonic diffuse interface model in overcoming the divergence of the image potential, to validate the numerical method in terms of its accuracy and convergence, and to demonstrate its capability for computing Greens functions for any cylindrical diffuse interface models.

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

greens function
image potential
cylindrical diffuse interface


Automatically generated CSP specifications Two possibilities of automated CSP ( Communicating Sequential Processes) support are introduced in [ 11] and [ 10] using either behavioral diagrams or application source code. While in the first approach a tool generates CSP specification from behavioral diagrams, based on UML Composite States diagram, in the second approach an application source code is translated directly into CSP specification using a compiler. This paper reviews tools related to both techniques.

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

model
formal specification
translator
grammar


A computer-based tool to foster engineering students' interest in dynamics With the aim of connecting the subject Dynamics with the real world, an educational software has been developed to assist teaching the course to first-year undergraduate industrial engineering students. The software simulates the 3D movement of the oscillating group of a washing machine that includes some of the familiar elements of a mechanical system: motors, pulleys, springs, or shock absorbers. The student is able to set up, run, and analyze the output of the mechanical model, which enhances the students' appreciation of the potential and utility of the mathematical model obtained for a mechanical system and helps them to reinforce some relevant mechanical concepts by changing the input parameters of a specific system. 2009 Wiley Periodicals, Inc. Comput Appl Eng Educ 19: 475486, 2011

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


ewa volume splatting In this paper we present a novel framework for direct volume rendering using a splatting approach based on elliptical Gaussian kernels. To avoid aliasing artifacts, we introduce the concept of a resampling filter combining a reconstruction with a low-pass kernel. Because of the similarity to Heckbert's EWA (elliptical weighted average) filter for texture mapping we call our technique EWA volume splatting. It provides high image quality without aliasing artifacts or excessive blurring even with non-spherical kernels. Hence it is suitable for regular, rectilinear, and irregular volume data sets. Moreover, our framework introduces a novel approach to compute the footprint function. It facilitates efficient perspective projection of arbitrary elliptical kernels at very little additional cost. Finally, we show that EWA volume reconstruction kernels can be reduced to surface reconstruction kernels. This makes our splat primitive universal in reconstructing surface and volume data.

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


The complete determination of the minimum distance of two-point codes on a Hermitian curve This is a continuation of the previous papers [3, 4, 5]. We finish determining the minimum distance of two-point codes on a Hermitian curve.

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