Vehicle routingscheduling for waste collection in Hanoi This paper addresses an application of operations research technique in waste collection activities in Hanoi, Vietnam. A real world vehicle routingscheduling problem is characterized as a loading and unloading problem complicated by several time windows and inter-arrival time constraints at each customer point. We formulate the problem into a mixed-integer program and propose a heuristic procedure consisting of construction and improvement phases. The route construction routine is a modification of Solomon's (Solomon, M.M., 1987. Operations Research 35, 254262) I1 heuristic, while the improvement phase combines the power of Or-opt and 2-opt* together. Compared with the current practice, our solution can achieve an improvement in both total cost and the number of vehicles utilized.

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


The \(r\)-acyclic chromatic number of planar graphs A vertex coloring of a graph G is r-acyclic if it is a proper vertex coloring such that every cycle \(C\) receives at least \(\min \{|C|,r\}\) colors. The \(r\)-acyclic chromatic number \(a_{r}(G)\) of \(G\) is the least number of colors in an \(r\)-acyclic coloring of \(G\). Let \(G\) be a planar graph. By Four Color Theorem, we know that \(a_{1}(G)=a_{2}(G)=\chi (G)\le 4\), where \(\chi (G)\) is the chromatic number of \(G\). Borodin proved that \(a_{3}(G)\le 5\). However when \(r\ge 4\), the \(r\)-acyclic chromatic number of a class of graphs may not be bounded by a constant number. For example, \(a_{4}(K_{2,n})=n+2=\Delta (K_{2,n})+2\) for \(n\ge 2\), where \(K_{2,n}\) is a complete bipartite (planar) graph. In this paper, we give a sufficient condition for \(a_{r}(G)\le r\) when \(G\) is a planar graph. In precise, we show that if \(r\ge 4\) and \(G\) is a planar graph with \(g(G)\ge \frac{10r-4}{3}\), then \(a_{r}(G)\le r\). In addition, we discuss the \(4\)-acyclic colorings of some special planar graphs.

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


Distributed full-order optimal fusion filters and smoothers for discrete-time stochastic singular systems The optimal fusion problem for the state estimation of discrete-time stochastic singular systems is considered. The key idea is to convert a stochastic singular system with multiple sensors and correlated noises into an equivalent group of non-singular systems. Based on the state estimation for each local non-singular system, the optimal full-order filters and smoothers with a three-layer fusion structure are obtained for the original system using the optimal weighted fusion algorithms in the linear minimum variance sense. A simulation example shows that the fusion estimator is better than each local one.

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


3D topology optimization using an immune algorithm Purpose - The paper introduces an evolutionary algorithm based on the artificial immune systems paradigm for topology optimization (TO) in 3D. Design/methodology/approach - The 3D TO algorithm is described, and experimentally validated on an electromagnetic design problem. Findings - The proposed method is capable of finding an optimal configuration for the validation problem used. Research limitations/implications - More tests are needed in order to fully assert the capabilities of the algorithm. Moreover, further improvements are needed in order to obtain smoother topologies at the end of the optimization procedure. Practical implications - The paper presents a novel tool for the design of electromagnetic devices, using a TO approach. Originality/value - So far most of the TO algorithms did not tackle true 3D problems, and the ones capable of 3D optimization do it at high computational costs. The algorithm presented here is capable of true 3D design at a reasonable computational budget.

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


Group technology based adaptive cell formation using predatorprey genetic algorithm In recent years, there has been a considerable growth of application of group technology in cellular manufacturing. This has led to investigation of the primary cell formation problem (CFP), both in classical and soft-computing domain. Compared to more well-known and analytical techniques like mathematical programming which have been used rigorously to solve CFPs, heuristic approaches have yet gained the same level of acceptance. In the last decade we have seen some fruitful attempts to use evolutionary techniques like genetic algorithm (GA) and Ant Colony Optimization to find solutions of the CFP. The primary aim of this study is to investigate the applicability of a fine grain variant of the predatorprey GA (PPGA) in CFPs. The algorithm has been adapted to emphasize local selection strategy and to maintain a reasonable balance between prey and predator population, while avoiding premature convergence. The results show that the algorithm is competitive in identifying machine-part clusters from the initial CFP matrix with significantly less number of iterations. The algorithm scaled efficiently for large size problems with competitive performance. Optimal cluster identification is then followed by removal of the bottleneck elements to give a final solution with minimum inter-cluster transition cost. The results give considerable impetus to study similar NP-complete combinatorial problems using fine-grain GAs in future.

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

cellular manufacturing
cell formation problem
predatorprey genetic algorithm
bottleneck

diagonal cluster
intra-cluster density
transitional cost
grouping efficacy


Generation of view dependent models using free form deformation We present a scheme which, given two 3D geometric models, creates a third, synergetic model with resemblance to one input model from one viewing direction and the other input model from another, orthogonal, viewing direction. Our scheme automatically calculates the necessary constraints needed to deform the first model's silhouette into the second model's in 2D, and creates a 3D deformation function based on these constraints while minimizing the object's distortion in all areas but the silhouette. The motivation of this work stems from the artwork of conceptual artists such as Shigeo Fukuda [9] and Markus Raetz [19].

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

3d modeling
non-photorealistic rendering
computer graphics art


SAR Image Regularization With Fast Approximate Discrete Minimization Synthetic aperture radar (SAR) images, like other coherent imaging modalities, suffer from speckle noise. The presence of this noise makes the automatic interpretation of images a challenging task and noise reduction is often a prerequisite for successful use of classical image processing algorithms. Numerous approaches have been proposed to filter speckle noise. Markov random field (MRF) modelization provides a convenient way to express both data fidelity constraints and desirable properties of the filtered image. In this context, total variation minimization has been extensively used to constrain the oscillations in the regularized image while preserving its edges. Speckle noise follows heavy-tailed distributions, and the MRF formulation leads to a minimization problem involving nonconvex log-likelihood terms. Such a minimization can be performed efficiently by computing minimum cuts on weighted graphs. Due to memory constraints, exact minimization, although theoretically possible, is not achievable on large images required by remote sensing applications. The computational burden of the state-of-the-art algorithm for approximate minimization (namely the a-expansion) is too heavy specially when considering joint regularization of several images. We show that a satisfying solution can be reached, in few iterations, by performing a graph-cut-based combinatorial exploration of large trial moves. This algorithm is applied to joint regularization of the amplitude and interferometric phase in urban area SAR images.

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

combinatorial optimization
denoising
graph-cuts
markov random field (mrf)
minimization methods
synthetic aperture radar (sar)
total variation (tv)


Transformation of a thin-walled solid model into a surface model via solid deflation A simplified geometric model with lower dimensionality, such as a mid-surface model, is often preferred over a detailed solid model for the analysis process, if the analysis results are not seriously impacted. In order to derive a mid-surface model from a thin-walled solid model, in this paper, we propose a novel approach called the solid deflation method. In this method, a solid model is assumed to be created by using air to inflate a shell that comprises the surface of the solid model. First, the model is simplified by the removal of any detailed features whose absence would not alter its overall shape. Next, the solid model itself can be converted into a degenerate solid model with zero thickness. Finally, a surface model is generated by splitting large faces paired in the thinned solid model, selecting one face per pair for creating a sheet model, and sewing the selected faces. Using this method, a more practical and usable mid-surface model can be very efficiently generated from a solid model because it can circumvent not only the tedious trimming and extension processes of the medial axis transformation method but also the time-consuming patch joining process of the mid-surface abstraction approach.

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

medial axis transformation
solid deflation

mid-surface
medial surface
dimension reduction


an automatic layout algorithm for bpel processes The Business Process Execution Language (BPEL) is the standard execution language for business workflows. BPEL is an XML-based, verbose and complex language, consisting of block- and graph-oriented control structures, which makes it hard to generate intuitive visualizations. Although many tools enable the visualization of workflows before the transformation into executable systems, notations and style criteria for the visualization and layout of workflows are not standardized, so it is very hard to compare different tools. Often, the construction of a layout for a possibly complex workflow is left to the user or the result is visually unsatisfying. We present a novel algorithm for the layout of complex BPEL workflows, which uses the principles of the algorithm by Sugiyama and takes into account BPEL specifics, e.g. nested structures, parallel paths and several distinct types of elements. The BPEL specifics represent challenges to the layout algorithm and are not completely fulfilled by any other layout approach for BPEL.

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


code injection attacks on harvard-architecture devices Harvard architecture CPU design is common in the embedded world. Examples of Harvard-based architecture devices are the Mica family of wireless sensors. Mica motes have limited memory and can process only very small packets. Stack-based buffer overflow techniques that inject code into the stack and then execute it are therefore not applicable. It has been a common belief that code injection is impossible on Harvard architectures. This paper presents a remote code injection attack for Mica sensors. We show how to exploit program vulnerabilities to permanently inject any piece of code into the program memory of an Atmel AVR-based sensor. To our knowledge, this is the first result that presents a code injection technique for such devices. Previous work only succeeded in injecting data or performing transient attacks. Injecting permanent code is more powerful since the attacker can gain full control of the target sensor. We also show that this attack can be used to inject a worm that can propagate through the wireless sensor network and possibly create a sensor botnet. Our attack combines different techniques such as return oriented programming and fake stack injection. We present implementation details and suggest some counter-measures.

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

code injection attacks
buffer overflow
harvard architecture
return oriented programming

wireless sensor networks
gadgets
computer worms
embedded devices


Fine-Grained DVFS Using On-Chip Regulators Limit studies on Dynamic Voltage and Frequency Scaling (DVFS) provide apparently contradictory conclusions. On the one hand early limit studies report that DVFS is effective at large timescales (on the order of million(s) of cycles) with large scaling overheads (on the order of tens of microseconds), and they conclude that there is no need for small overhead DVFS at small timescales. Recent work on the other hand-motivated by the surge of on-chip voltage regulator research-explores the potential of fine-grained DVFS and reports substantial energy savings at timescales of hundreds of cycles (while assuming no scaling overhead). This article unifies these apparently contradictory conclusions through a DVFS limit study that simultaneously explores timescale and scaling speed. We find that coarse-grained DVFS is unaffected by timescale and scaling speed, however, fine-grained DVFS may lead to substantial energy savings for memory-intensive workloads. Inspired by these insights, we subsequently propose a fine-grained microarchitecture-driven DVFS mechanism that scales down voltage and frequency upon individual off-chip memory accesses using on-chip regulators. Fine-grained DVFS reduces energy consumption by 12% on average and up to 23% over a collection of memory-intensive workloads for an aggressively clock-gated processor, while incurring an average 0.08% performance degradation (and at most 0.14%). We also demonstrate that the proposed fine-grained DVFS mechanism is orthogonal to existing coarse-grained DVFS policies, and further reduces energy by 6% on average and up to 11% for memory-intensive applications with limited performance impact (at most 0.7%).

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

design
experimentation
energy-efficiency
on-chip voltage regulators
fine-grained dvfs


branch merge reduction of rlcm networks In this paper we consider the problem of finding asmaller RLCM circuit that approximately replicates thebehavior (up to a certain frequency) of a given RLCM circuit.Targeted at parasitic extractors for verification of VLSIdesigns, the proposed algorithm uses a branch merge, nodeelimination methodology, with the choice of nodes forelimination being guided by time-constant criteria.Reliable,accurate, easy to code, the algorithm works well for coupledbuses and clocks, strongly inductive networks, and low-losstransmission lines, as well as for lossy RLC networks.

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

parasitic extraction
model order reduction
gaussian elimination
transmission-line modeling


New delay-dependent non-fragile H? observer-based control for continuous time-delay systems The problem of the delay-dependent non-fragile H? observer-based control for a class of continuous time-delay systems is investigated in this paper. The additive gain variations under consideration are contained in both the controller gain and obhsiunserver gain. Delay-dependent criteria are derived to guarantee the stability of the non-fragile H? observer-based control system using the Lyapunov functional approach. The controller and observer gains are given from the LMI feasible solutions. Based on the result of this paper, the constraint of matrix equality is not necessary for designing the non-fragile H? observer-based controls. Computer software Matlab can be applied to solve all the proposed results. Finally, a numerical example is illustrated to show the improvement of this 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

delay-dependent non-fragile h?
observer-based control
lmi approach
continuous time-delay systems


On the use of neighbourhood-based non-parametric classifiers Alternative non-parametric classification schemes, which come from the use of different definitions of neighbourhood, are introduced. Ln particular, the Nearest Centroid Neighbourhood along with the neighbourhood relation derived from the Gabriel Graph and the Relative Neighbourhood Graph are used to define the corresponding (k-)Nearest Neighbour-like classifiers. Experimental results are reported to compare the performance of the approaches proposed here to the one obtained with the k-Nearest Neighbours rule. (C) 1997 Elsevier Science B.V.

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

gabriel graph
relative neighbourhood graph
nearest centroid neighbourhood


Interrogatives, Recursion, and Incompleteness We show that some natural, reasonable assumptions concerning interrogatives and answers yield the existence of recursive sets of sentences which are not sets of direct answers to any interrogative. Our results strengthen Harrah's incompleteness theorem. We also draw some epistemic consequences from our results.

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


Adjusted Pearson residuals in exponential family nonlinear models In this paper, we give matrix formulae of order O(n-1), where n is the sample size, for the first two moments of Pearson residuals in exponential family nonlinear regression models [G.M. Cordeiro and G.A. Paula, Improved likelihood ratio statistic for exponential family nonlinear models, Biometrika 76 (1989), pp. 93-100.]. The formulae are applicable to many regression models in common use and generalize the results by Cordeiro [G.M. Cordeiro, On Pearson's residuals in generalized linear models, Statist. Prob. Lett. 66 (2004), pp. 213-219.] and Cook and Tsai [R.D. Cook and C.L. Tsai, Residuals in nonlinear regression, Biometrika 72(1985), pp. 23-29.]. We suggest adjusted Pearson residuals for these models having, to this order, the expected value zero and variance one. We show that the adjusted Pearson residuals can be easily computed by weighted linear regressions. Some numerical results from simulations indicate that the adjusted Pearson residuals are better approximated by the standard normal distribution than the Pearson residuals.

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

bias correction
nonlinear model
pearson residual


On-line failure prediction in safety-critical systems ? Non-intrusive and black box effective online failure prediction. We monitor network traffic, only, to perform online failure prediction. Application agnostic: no knowledge of application logic is required. We use complex event processing to produce a representation of the system state. We use hidden Markov models in order to create a state recognizer.

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

failure prediction
complex event processing

machine learning
complex distributed systems
critical infrastructures


refining the axiomatic definition of internal software attributes Several internal software attributes, like size, structural complexity, cohesion, coupling, have been introduced and used to reason about software engineering artifacts, and many measures have been proposed for them. Internal software attributes are important because they are believed to be related to quantities of industrial interest, like the number of defects or the development effort. However, the definition of internal software attributes still needs to be made more precise and formal, so measures can be defined that really quantify the attributes they purport to measure. In this paper, we extend, simplify, and refine an existing axiomatic approach that characterizes each internal attribute rigorously via a different set of axioms. This paper makes three specific contributions. First, the new proposal captures a larger set of aspects of software artifacts that may be relevant for internal software attributes than the original proposal did. Second, we identify the basic, foundational sets of axioms for each internal attribute studied, from which the other properties of the attribute can be derived, so the intrinsic properties of the attribute and their implications can be understood. Third, we investigate some relevant relationships among internal software attributes, so their similarities and differences, which are sometimes not well identified, are made more explicit.

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

coupling
cohesion
complexity
size
internal software attributes


Snippets: Support for drag-and-drop programming in the Redwood environment This paper presents an overview of the Redwood programming environment and details one of its key features, snippets. Through snippets, developers can both make use of a variety of predefined programming constructs and build their own reusable program components. Language-independent, snippets are descriptions of program parts that can be as simple as an assignment statement or as complex as a sophisticated optimization algorithm. In Redwood, snippets also provide support for a distinguishing facility of visual environments: direct manipulation via drag-and-drop. An example of working with snippets, including snippet definition, visualization, customization, and mapping to code is also presented in the paper.

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

snippets
programming environment
redwood

software development
visual programming
design tool
drag-and-drop


On stop conditions about methods to obtain polygonal approximations relied on break point suppression ? ?? In this work, we propose a new unsupervised stop condition for heuristic methods that employ break point suppression to obtain polygonal approximations. Using a stop condition, these heuristic methods delete redundant break points until a required level of approximation is satisfied. The new stop condition is based on the optimisation of the F2 measure. Comparisons with original stop conditions of several methods show that the new stop condition yields a measurable improvement in the approximation. The polygonal approximations obtained with the new stop condition are more efficient and better adjusted to the original contours. The new stop condition can be combined with supervised optimal methods to obtain a reference approximation of the original contour with a minimum number of points. In this case, the resulting methods are unsupervised methods.

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

digital planar curves
polygonal approximation
dominant points


A bored pile deficiency detection method based on optical fiber temperature measurement The optical fiber temperature measurement is proposed for detecting deficiency of bored piles. The method adopts only one optical fiber cable for both measurement and transmission. The basic principle of the integrity assessment is described with detection equation derived. The temperature rise in the optical fiber is found to be in direct proportion to heating power.

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

optical fiber temperature measurement
bored pile
integrity
temperature


Transmit Precoding in a Noncoherent Relay Channel With Channel Mean Feedback This paper investigates the optimal source transmit precoding to maximize the ergodic mutual information between the input and the output of a noncoherent amplify-and-forward relay channel, with multiple antennas at the source and with a single antenna at both the relay and the destination. It is assumed that only the source-relay channel mean information is available at the source. The challenge here is that relaying introduces a nonconvex structure in the objective function. Therefore, previous methods dealing with channel mean feedback, which generally require the concavity of the objective function, cannot be applied. To circumvent the difficulty at hand, a different approach based on stochastic ordering is employed. The stochastic optimization problem here is ultimately transformed into the comparison of two nonnegative random variables in the Laplace transform order. It is shown that the optimal source transmit strategy is to transmit along the known channel mean and its orthogonal eigen-channels. Our result subsumes as an asymptotic case the optimal precoding for multipleinput single-output (MISO) channels without relaying under mean feedback. Furthermore, the analysis can be partially extended to the case with multiple antennas at the relay. Numerical examples are provided to complement and corroborate the analysis.

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

channel mean feedback
laplace transform order
mutual information
stochastic optimization

multiantenna systems
relay channels
stochastic orders


ODP RM reflections on open service ecosystems This paper reflects on the use of the ODP reference model in the development of Pilarcos open service ecosystem architecture. The Pilarcos open service ecosystem architecture provides an environment where inter-enterprise collaborations can be collectively managed, utilizing correctness and acceptability criteria set in ecosystem-wide dynamic processes. The correctness requirements are defined in terms of business network models, policies and service definitions that are dynamically utilized as complex conformance reference points. Failures to conform to these reference points trigger pre-committed recovery behavior. The ODP reference model provides sufficient and efficient facilities for the design of this kind of complex, adaptive system.

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

service-oriented computing and software production


age based scheduling for asymmetric multiprocessors Asymmetric (or Heterogeneous) Multiprocessors are becoming popular in the current era of multi-cores due to their power efficiency and potential performance and energy efficiency. However, scheduling of multithreaded applications in Asymmetric Multiprocessors is still a challenging problem. Scheduling algorithms for Asymmetric Multiprocessors must not only be aware of asymmetry in processor performance, but have to consider the characteristics of application threads also. In this paper, we propose a new scheduling policy, Age based scheduling, that assigns a thread with a larger remaining execution time to a fast core. Age based scheduling predicts the remaining execution time of threads based on their age, i.e., when the threads were created. These predictions are based on the insight that most threads that are created together tend to have similar execution durations. Using Age based scheduling, we improve the overall performance of several important multithreaded applications including Parsec and asymmetric benchmarks from Splash-II and Omp-SCR. Our evaluations show that Age based scheduling improves performance up to 37\% compared to the state-of-the-art Asymmetric Multiprocessor scheduling policy and on average by 10.4\% for the Parsec benchmarks. Our results also show that the Age based scheduling policy with profiling improves the average performance by 13.2\% for the Parsec benchmarks.

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

asymmetric multiprocessors
age based scheduling


DFT-based theoretical QSPR models of Q-e parameters for the prediction of reactivity in free-radical copolymerizations Density functional theory (DFT) calculations at the B3LYP/6-31G(d) level were carried out for 47 vinyl monomers with structures (CH2)-H-1 = (CHR3)-H-2, and the calculated quantum chemical descriptors were used to construct quantitative structure-property relationship (QSPR) models of the reactivity parameters of monomers Q and e. Stepwise multiple linear regression analysis (MLRA) and artificial neural networks (ANN) were adopted to generate the models. Simulated with the final optimum back-propagation (BP) neural networks, the results show that predicted lnQ and e values are in good agreement with experimental data, with test sets possessing correlation coefficients of 0.982 for lnQ and 0.943 for e. The proposed ANN models have better prediction ability than existing models.

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

density functional theory
monomers
qspr
quantum chemical descriptors

artificial neural network
reactivity parameters of monomers (q,e)


An ergonomic intervention to reduce back strain among apple harvest workers in New York State The impact of modifications to the apple picking bucket on common picking postures, self-reported comfort, ease of use, and speed of harvest were measured. Fourteen apple pickers wore an intervention hip belt, were interviewed and measured using posture-activities-tools-handling methodology. The use of hip belt did not significantly alter time spent in various postures. 78.6% of interviewed workers preferred the modified bag, 71.4% noted a difference in the back, neck, or shoulder, while 64.3% said regular use of modified bag would slow their work. Major themes in worker comments are discussed. The hip belt modification to apple harvest bag seems generally acceptable to workers, but needs further development to overcome unintended effects. Although work sampling demonstrates that the bag does not affect work practices, workers appear somewhat concerned that productivity will be negatively impacted. Further training of workers in the use and potential benefits of bag are 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

ergonomic improvements
musculoskeletal disorders
muscle strain
fruit harvest
migrant and seasonal farmworkers
agricultural health


Sorter based permutation units for media-enhanced microprocessors Single or multibit subword permutations are useful in many multimedia and cryptographic applications. Several specialized instructions have been proposed to handle the required data rearrangements. In this paper, we examine the hardware implementation of the powerful permutation instruction group (GRP). The design of the proposed permutation unit is based on the functionality of sorting networks. Two variants of the sorter-based GRP unit are introduced and analyzed and their energy-delay behavior is investigated using static CMOS implementations in a 130-nm CMOS technology.

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

cryptography
data-rearrangement instructions
multimedia processors


A perturbation-method-based post-processing for the planewave discretization of KohnSham models In this article, we propose a post-processing of the planewave solution of the KohnSham LDA model with pseudopotentials. This post-processing is based upon the fact that the exact solution can be interpreted as a perturbation of the approximate solution, allowing us to compute corrections for both the eigenfunctions and the eigenvalues of the problem in order to increase the accuracy. Indeed, this post-processing only requires the computation of the residual of the solution on a finer grid so that the additional computational cost is negligible compared to the initial cost of the planewave-based method needed to compute the approximate solution. Theoretical estimates certify an increased convergence rate in the asymptotic convergence range. Numerical results confirm the low computational cost of the post-processing and show that this procedure improves the energy accuracy of the solution even in the pre-asymptotic regime which comprises the target accuracy of practitioners.

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

density-functional theory
perturbation method
planewave approximation
nonlinear eigenvalue problem
post-processing


Picocell based telemedicine health service for human UX/UI Telemedicine health created from the combination of IT and BT technologies has received increased attention for improved quality of life in medically vulnerable regions. As the health care paradigm shifts to preventive management in diagnosis and treatment, the importance of prevention of chronic diseases such as obesity is growing. In this paper, we proposed a picocell-based telemedicine health service for the human UX/UI based on a BT-IT fusion technology considering user convenience. The proposed medical service is a BT-IT fusion technology based on the telemedicine health service that can overcome the spatial limitations of hospital-oriented medical services in order to improve user convenience while naturally combining life and medical service spaces. Human UX/UI technology, which is based on sensor network and biomedical technology, requires next generation wireless communication between devices that connects the inside of the human body with the outside. A heterogeneous network is composed within a single domain, as the frequency bandwidth used by the medical device in the ISM bandwidth is different. If a wireless device and low output ISM device spatially access a heterogeneous network, then an interference problem will occur between the small cells. Additionally, there can be interference as the traffic is off-loaded from the base station at the grouped region of a hotspot. A fatal problem may occur due to an information error of the patient due to interference. To solve the interference problem generated by the telemedicine health platform, the performance of the picocell-based telemedicine health service can be improved by applying scheduling using ABS(Almost Blank Subframe) in the time domain. Therefore, the human UX/UI and the provided guidelines can quickly provide patient information, thereby increasing safety of patients.

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

heterogeneous network
telemedicine
picocell


Secure and privacy preserving data processing support for active authentication Keystroke dynamics and mouse movements are effective behavioral biometric modalities for active authentication. However, very little is done on the privacy of collection and transmission of keyboard and mouse data. In this paper, we develop a rule based data sanitization scheme to detect and remove personally identifiable and other sensitive information from the collected data set. Preliminary experiments show that our scheme incurs on average 5.69% false negative error rate and 0.64% false positive error rate. We also develop a data transmission scheme using the Extensible Messaging and Presence Protocol (XMPP) to guarantee privacy during transmission. Using these two schemes as a basis, we develop two distinct architectures for providing secure and privacy preserving data processing support for active authentication. These architectures provide flexibility of use depending upon the application environment.

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


automatic genre classification of latin american music using characteristic rhythmic patterns In the majority of musical genres, music is basically composed of repetitive rhythmic structures (patterns). Especially in Latin American music, particular styles can be distinguished through characteristics of these patterns. Therefore, the aim of the present work is the automatic classification of musical genres from Latin America using automatically extracted rhythmic patterns. The approach is based on setting up a knowledge base that consists of typical reference patterns for each genre. To obtain a tempo independent pattern representation, we apply both the scale transform and the log-lag autocorrelation function. Different distance measures were evaluated to measure the similarity between unknown patterns and reference patterns. Various tests with different preprocessing techniques were performed. For 9 distinct genres, a classification accuracy of 86.7\% for tests with synthetic data and 47.9\% with real-world music was achieved. In addition, conclusions to rhythmic similarity of particular music styles were drawn. Dealing with non-western music, the work presents an operational method for genre classification in the research field of Computational Ethnomusicology .

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

rhythm pattern similarity
music information retrieval
non-western music
music genre classification


A Minimum Risk Approach for Path Planning of UAVs In the last years, the Flight Mechanics Research Group of Politecnico di Torino started a wide research activity, focused on exploration and implementation of path planning algorithms for commercial autopilots, typically adopted on unmanned vehicles. Different path planning approaches were implemented in a Matlab/Simulink based tool, generating waypoints sequences with four methods: geometric predefined trajectories, manual waypoints definition, automatic waypoints distribution (i.e. optimizing camera payload capabilities) and, finally, a comprehensive A*-based approach. The tool was also integrated with functions managing the maps used for planning. In this paper, two approaches to path planning in presence of orographic obstacles are detailed. The first algorithm is subdivided in three phases: the generation of a risk map associated with the ground orography, the transformation of the map in a digraph analyzed with the A* algorithm (to obtain the path with minimum risk/minimum distance) and finally the smoothing phase, to obtain a flyable waypoint sequence, realized with the Dubins curves. The structure of this method was defined and implemented, but its optimization is still in progress. The second algorithm is based on the same risk map, but optimizing polynomial curves with a genetic algorithm. This method produces a flyable waypoints sequence, minimizing a cost function reflecting path length and collision risk. An extension of this path solver, including aircraft performance constraints, was also considered. This method was tested on sample domains and its computational cost has still to be evaluated before the implementation in the tool.

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


bidirectional overflow channel allocation scheme with handoff queuing for macro/micro cellular systems In this paper, the performance of bidirectional call overflow channel allocation scheme in hierarchical cellular systems (HCSs) with/without queuing for handoff calls is studied, the analytical results are derived and the numerical evaluation show that the scheme with queuing for handoff calls outperforms the strategy without queuing in terms of low handoff failure probability, whereas the blocking probability of new calls doesn't became worse.

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


Parallel multilevel algorithms for hypergraph partitioning In this paper, we present parallel multilevel algorithms for the hypergraph partitioning problem. In particular, we describe for parallel coarsening, parallel greedy k-way refinement and parallel multi-phase refinement. Using an asymptotic theoretical performance model, we derive the isoefficiency function for our algorithms and hence show that they are technically scalable when the maximum vertex and hyperedge degrees are small. We conduct experiments on hypergraphs from six different application domains to investigate the empirical scalability of our algorithms both in terms of runtime and partition quality. Our findings confirm that the quality of partition produced by our algorithms is stable as the number of processors is increased while being competitive with those produced by a state-of-the-art serial multilevel partitioning tool. We also validate our theoretical performance model through an isoefficiency study. Finally, we evaluate the impact of introducing parallel multi-phase refinement into our parallel multilevel algorithm in terms of the trade off between improved partition quality and higher runtime cost.

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

parallel sparse matrixvector multiplication


event-driven replication in distributed systems In order to address problems related to geographical distribution of application instances, data distribution has been a hot topic for years. Recently, the spectacular evolution of bandwidth, frameworks and components available to build Rich Internet Applications has brought back data centralization practices. As a consequence, most database-centric applications today (e.g. business management software) are being developed using a four tier architecture: presentation logic (web tier), business logic (services), persistence services (object relational mappings and SQL variants) and database management system (one single database). While plenty of data distribution scenarios can still be found in the real world, existing solutions mainly come from DBMS providers. However, in practice it has been proven that these low level replication techniques are not really easy to use and, in most cases, they do not fit well for real-time data replication, due to the fact that: (1) highly reliable network connections are required (uninterrupted connections, in most cases) and (2) every bit has the same critical importance as any other in order to keep data integrity. Even if object-oriented replication techniques exist, such as Hibernate replication API (the well known ORM framework in Java), this paper will show that they cannot be used alone in real production environments where network connections are highly unreliable and expensive. In this short paper we will present one practical case of multiple, geographically distributed application instances, using their own local databases, while real-time synchronization over a highly unreliable and expensive network is needed. The novelty of the solution described in this paper consists in transferring the replication responsibility from database level to application logic level (business services) using a message oriented model. Unlike DBMS replication tools and techniques, our proposed model does provide the critical requirements of real-world replication needs: 1) fault-tolerance and failure recovery with event-based exception handling while still keeping the system up and running; 2) information-centric instead of bit-centric system; 3) ability to deal with numerous, unpredictable, network connections breakdowns; 4) ability to replicate data over heterogeneous platforms (both application and database level); 5) ability to run within an a multiversion application environment (different application versions on different replication nodes).

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

service oriented architecture
event-driven system
message-oriented model


Assessing correlations between lingual movements and formants First and second formant histories have been used in studies of both normal and disordered speech to indirectly measure the activity of the vocal tract. The purpose of the present study was to determine the extent to which formant measures are reflective of lingual movements during diphthong production. Twenty native speakers of American English from the western United States produced four diphthongs in a sentence context while tongue movement was measured with a magnetic tracking system. Correlations were computed between the vertical tongue movements and the first formant, as well as between the anteroposterior movements and the second formant during the transition phase of the diphthong. In many instances the acoustic measures were clearly reflective of the kinematic data. However, there were also exceptions, where the acoustic and kinematic records were not congruent. These instances were evaluated quantitatively and qualitatively in an effort to understand the cause of the discrepancy. Factors such as coarticulation, motor equivalence (including the influence of structures other than the tongue), and nonlinearities in the linkage between movement and acoustics could account for these findings. Recognizing potential influences on the acoustickinematic relationship may be valuable in the interpretation of articulatory acoustic data on the individual speaker level.

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


Contributing factors in construction accidents This overview paper draws together findings from previous focus group research and studies of 100 individual construction accidents. Pursuing issues raised by the focus groups, the accident studies collected qualitative information on the circumstances of each incident and the causal influences involved. Site based data collection entailed interviews with accident-involved personnel and their supervisor or manager, inspection of the accident location, and review of appropriate documentation. Relevant issues from the site investigations were then followed up with off-site stakeholders, including designers, manufacturers and suppliers. Levels of involvement of key factors in the accidents were: problems arising from workers or the work team (70% of accidents), workplace issues (49%), shortcomings with equipment (including PPE) (56%), problems with suitability and condition of materials (27%), and deficiencies with risk management (84%). Employing an ergonomics systems approach, a model is proposed, indicating the manner in which originating managerial, design and cultural factors shape the circumstances found in the work place, giving rise to the acts and conditions which, in turn, lead to accidents. It is argued that attention to the originating influences will be necessary for sustained improvement in construction safety to be achieved.

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

injury prevention
accident investigation


Change-driven model transformations In this paper, we investigate change-driven model transformations, a novel class of transformations, which are directly triggered by complex model changes carried out by arbitrary transactions on the model (e.g. editing operation, transformation, etc). After a classification of relevant change scenarios, we identify challenges for change-driven transformations. As the main technical contribution of the current paper, we define an expressive, high-level language for specifying change-driven transformations as an extension of graph patterns and graph transformation rules. This language generalizes previous results on live model transformations by offering trigger events for arbitrarily complex model changes, and dedicated reactions for specific kinds of changes, making this way the concept of change to be a first-class citizen of the transformation language. We discuss how the underlying transformation engine needs to be adapted in order to use the same language uniformly for different change scenarios. The technicalities of our approach will be discussed on a (1) model synchronization case study with non-materialized target models and (2) a case study on detecting the violation of evolutionary (temporal) constraints in the security requirements engineering domain.

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

incremental model transformation
change models
change-driven transformations


A two-machine flowshop problem with processing time-dependent buffer constraints-An application in multimedia presentations To have a quality multimedia presentation through networks, its presentation lag needs to be controlled. One way to reduce the lag is to prefetch the media objects before their due dates. This paper explores techniques for optimizing the object sequence in a prefetch-enabled TV-like presentation. An optimal solution is the one with which the presentation lag is minimized. We formulate the problem into a two-machine flowshop scheduling problem with a single chain precedence constraint and a player-side buffer constraint. The player-side buffer is "processing time-dependent" and distinguished from the conventional item-based intermediate buffer constraints discussed in previous flowshop studies. We prove the problem to he strongly NP-hard. A branch and bound algorithm equipped with four lower bounds and an NEH-based upper bound is developed. The simulation results show that the average gaps between the overall lower bounds and the NEH-based upper bound are less than 3% for problems with a large buffer size, and less than 13% for problems with a small buffer size and high density of precedence constraints. For applications where the media objects are delivered through extremely busy servers with which only very restricted CPU resources can be allocated for computation, the CDS-based algorithm provides better sequences than the NEH-based algorithm. (C) 2008 Elsevier Ltd. All rights reserved.

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

multimedia presentation
buffer constraint

object sequence optimization
two-machine flowshop


Multi-Atlas-Based Segmentation With Local Decision Fusion-Application to Cardiac and Aortic Segmentation in CT Scans A novel atlas-based segmentation approach based on the combination of multiple registrations is presented. Multiple atlases are registered to a target image. To obtain a segmentation of the target, labels of the atlas images are propagated to it. The propagated labels are combined by spatially varying decision fusion weights. These weights are derived from local assessment of the registration success. Furthermore, an atlas selection procedure is proposed that is equivalent to sequential forward selection from statistical pattern recognition theory. The proposed method is compared to three existing atlas-based segmentation approaches, namely 1) single atlas-based segmentation, 2) average-shape atlas-based segmentation, and 3) multi-atlas-based segmentation with averaging as decision fusion. These methods were tested on the segmentation of the heart and the aorta in computed tomography scans of the thorax. The results show that the proposed method outperforms other methods and yields results very close to those of an independent human observer. Moreover, the additional atlas selection step led to a faster segmentation at a comparable performance.

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

atlas-based segmentation
cardiac segmentation
segmentation by registration


A high-precision calculation method for interface normal and curvature on an unstructured grid We develop a new height function method which works on an unstructured grid. Geometric relationships are used to calculate interface normal and curvature. The calculation accuracy of interface normal shows roughly second-order accuracy. The numerical error in interface curvature shows the monotonic decreasing trends with cell size.

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

unstructured grid
interface normal
curvature


Gaussian filtering and variational approximations for Bayesian smoothing in continuous-discrete stochastic dynamic systems Comparison of Gaussian filtering based and variational Gaussian smoothers for SDEs. Sigma-point approximations of the variational Gaussian smoother. Extension of variational Gaussian smoother to singular systems. Variational Gaussian smoother improves results in highly nonlinear systems.

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

gaussian approximation
variational inference


WISTA: A wireless Telemedicine system for disaster patient care In this paper, we introduce a low-cost and easy-o-deploy wireless telemedicine system, denoted WISTA, that can assist on-site patient care during disasters. The proposed system facilitates real-time transfer of multimedia data from video cameras, sensors, medical images and text from multiple disaster sites to the control center of the disaster area. WISTA enables disaster managers to obtain patients' status information in real-time from the entire disaster site, which can assist the timely diagnosis as well as the treatment of patients. Moreover, the disaster managers in the control center can remotely control the information sent from the individual disaster sites. The proposed system uses a hierarchical architecture which allows scalable implementation. For dense disaster areas, a layered structure is applied to support information dissemination from s large number of patients. We have implemented the system prototype over a wireless channel and successfully demonstrated simultaneous transmission of video, sensor information, medical images and text from multiple sites to the control center. In addition, the scalability of the system is evaluated using OPNET simulation. Both experiments validate our system design.

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

disaster telemedicine wireless multimedia


A comparison of privacy issues in collaborative workspaces and social networks With the advent of Web 2.0, numerous social software applications allow people to publish and share information on the Internet. Two of these types of applications collaborative workspaces and social network sites have a number of features in common, which are explored to provide a basis for comparative analysis. This basis is extended with a suitable definition of privacy, a sociological perspective and an applicable adversary model in order to facilitate an investigation of similarities and differences with regard to privacy threats. Practical examples are derived from the use of Wikipedia and Facebook. Analysis suggests that a combination of technical, legal, and normative solutions should be considered to counter privacy issues. A number of potential solutions that may mitigate these issues are proposed.

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

collaborative workspaces
comparison
facebook
privacy
social network sites
social software
wikipedia


A computer program to simulate Einstein-Podolsky-Rosen-Bohm experiments with photons Starting from the data gathering and analysis procedures used in Einstein-Podoisky-Rosen-Bohm experiments with photons, we construct a simulation algorithm that satisfies Einstein's criteria of local causality and realism and generates the same type of data as recorded in these idealized expefinnents. The simulation data is analyzed according to the experimental procedure to count coincidences, that is by using an expression for the coincidence counts that, besides depending on the settings of the variable polarizers, explicitly depends on the difference of the time tags of the detection signals in both observation stations and on an adjustable time window. We demonstrate that the simulation algorithm produces data that agrees with the two-particle correlation for the singlet state. (c) 2007 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

quantum mechanics
computational techniques


Feedforward neural networks for compound signals In this paper we consider possible extensions of the classical multilayer artificial neural network model to the situation when the signals processed by the network are by definition compound and possibly structured. We discuss existing approaches to this problem in various contexts and provide our own model - the Normalizing Neural Network - for networks that process vectors as signals. We discuss possible uses of the proposed approach in a series of case studies. (C) 2011 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

multilayer neural network
error backpropagation
compound signal
classification
approximation


characterizing chip-multiprocessor variability-tolerance Spatially-correlated intra-die process variations result in significant core-to-core frequency variations in chip-multiprocessors. An analytical model for frequency island chip-multiprocessor throughput is introduced. The improved variability-tolerance of FI-CMPs over their globally-clocked counterparts is quantified across a range of core counts and sizes under constant die area. The benefits are highest for designs consisting of many small cores, with the throughput of a globally-clocked design with 70 small cores increasing by 8.8\% when per-core frequency islands are used. The small-core FI-CMP also loses only 7.2\% of its nominal performance to process variations, the least among any of the designs.

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


Regularized multivariable grey model for stable grey coefficients estimation Propose R-GMC(1,N) for stable grey coefficients estimation. Introduce four versions of R-GMC(1,N) based on various regularization methods. Validate R-GMC(1,N) by two numerical tests on industrial indicators of China.

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

multivariable grey model
regularization
industrial indicators


Hydrological models are so good, do we still need data? Our ability to numerically model natural systems has progressed enormously over the last 1020 years. During the last decade computational power has increased to the stage where we can now have a super-computer on our desk, and the detail and fine scale processes that can be included in models are fantastic. The computational tools available for analysis and display have opened doors beyond the dreams of our forebears. However, as modelling power has increased there has been a concurrent reduction in data power, particularly in the collection of hydrological data. While we undoubtedly have access to large datasets of extraordinary technological finesse such as the remotely sensed data from satellites, our collection of more basic and traditional datasets suffers. We can read car number plates from outer space, but we still, in the main, measure rainfall by putting a bucket out in a paddock. This paper discusses the growth in sophistication of hydrological modelling through the last hundred years. The concept of validation or verification of models is questioned, and the role of data in modelling discussed. It is argued that modelling in the absence of adequate data is not science, unless it is to develop hypotheses that are to be tested by observation. Several modelling case studies with and without adequate testing data are discussed. It is also argued that improvement in the management of our environment and water resources will not come with improved models in the absence of improved data collection because we cannot manage what we do not measure.

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

hydrology monitoring topog lascam iqqm topmodel


Cellular Automata to More Efficiently Compute the Collatz Map The Collatz, or 3x + 1, Conjecture claims that for every positive integer n, there exists some k such that T-k(n) = 1, where T is the Collatz map. We present three cellular automata (CA) that transform the global problem of mimicking the Collatz map in bases 2, 3, and 4 into a local one of transforming the digits of iterates. The CAs streamline computation first by bypassing calculation of certain parts of trajectories: the binary CA bypasses division by two altogether. In addition, they allow for multiple trajectories to be calculated simultaneously, representing both a significant improvement upon existing sequential methods of computing the Collatz map and a demonstration of the efficacy of using a massively parallel approach with cellular automata to tackle iterative problems like the Collatz Conjecture.

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

collatz conjecture
massively parallel
cellular automata


Identification of nonlinear systems with outliers using wavelet neural networks based on annealing dynamical learning algorithm This paper presents an annealing dynamical learning algorithm (ADLA) to train wavelet neural networks (WNNs) for identifying nonlinear systems with outliers. In ADLAWNNs, wavelet-based support vector regression (WSVR) is adopted to determine the initial translation and dilation of a wavelet kernel and the weights of WNNs due to the similarity between WSVR and WNNs. After initialization, ADLA with nonlinear time-varying learning rates is applied to train the WNNs. In the ADLA, the determination of the learning rates would be a key work for the trade-off between stability and speed of convergence. A computationally efficient optimization method, particle swarm optimization (PSO), is adopted to find the optimal learning rates to overcome the stagnation in the training procedure of WNNs. Due to the advantages of WSVR and ADLA (WSVRADLA), the WSVR-based ADLAWNNs (WSVRADLAWNNs) can robust against outliers and achieve the promising efficiency of system identifications. Three examples are simulated to confirm the performance of the proposed algorithm. From the simulated results, the feasibility and superiority of the proposed WSVRADLAWNNs for identifying nonlinear systems with artificial outliers are verified.

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

annealing dynamical learning algorithm
particle swarm optimization
wavelet neural networks
outliers


Parallel numerical simulation with domain decomposition for seismic response analysis of shield tunnel The research presented in this paper deals with parallel explicit finite element simulation with domain decomposition for seismic response analysis of shield tunnel, which is the non-linear and time dependent behaviour of complex structures in engineering. Such simulations have to provide high accuracy in the prediction of deformations and stability, by taking into account the long-term influences of the non-linear behaviour of the material as well as the large deformation and contact conditions. The limiting factors of the computer simulation are the computer run time and the memory requirement during solution of large-scale problems. To overcome these problems, a domain decomposition method and dynamic-explicit time integration procedure are used, and the latter is used for the solution of the semi-discrete equations of motion, which is very suited for parallel processing. Using the high performance computer ShenWei-I, the seismic response of shield tunnel in Shanghai is processed, and the number of nodes and elements in final finite element model exceeded 4.0 million and 3.8 million, respectively. The results reveal the weak position in the shield tunnel under Shanghai seismic wave. The paper provides references for the antiseismic design of the shield tunnel.

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

explicit finite element dynamics
parallel computing


Finite element computation of absorbing boundary conditions for time-harmonic wave problems This paper proposes a new method, in the frequency domain, to define absorbing boundary conditions for general two-dimensional problems. The main feature of the method is that it can obtain boundary conditions from the discretized equations without much knowledge of the analytical behavior of the solutions and is thus very general. It is based on the computation of waves in periodic structures and needs the dynamic stiffness matrix of only one period in the medium which can be obtained by standard finite element software. Boundary conditions at various orders of accuracy can be obtained in a simple way. This is then applied to study some examples for which analytical or numerical results are available. Good agreements between the present results and analytical solutions allow to check the efficiency and the accuracy of the proposed method.

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

absorbing boundary conditions
finite element


Randomized selection in n + C + o(n) comparisons In this paper we present a randomized selection algorithm that with high probability 1 - 1/n(rho), for any constant p > 1 requires n + C + o(n) comparisons to determine the Cth order statistic of n keys thus matching a corresponding lower bound on the average number of comparisons required. Low order terms in the number of comparisons performed can also be reduced by extending the algorithm of Floyd and Rivest and analyzing its resulting performance more carefully. (C) 2003 Elsevier B.V. All rights reserved.

O B O O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 new case-based classification using incremental concept lattice knowledge This paper proposes a new case-based classification system with an incremental knowledge base. The new system employs a concept lattice with formal concept analysis as a knowledge structure. The paper also proposes a new efficient algorithm for knowledge construction as well as an effective retrieval method for formal concepts. The proposed retrieval method uses a concept similarity measure based on an appearance frequency of formal concepts. In addition, we provide a mathematical proof that the similarity measure satisfies a formal similarity metric definition. Experiment results on standard datasets show that our classifier with the proposed similarity measure gives accuracy better than with other existing similarity measures.

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

case-based reasoning
incremental algorithm


Properties of wurtzite GaN MESFETs studied by two-dimensional full band Monte Carlo approach The properties of a GaN MetalSemiconductor Field Effect Transistor were studied based on two-dimensional full band Monte Carlo simulations. The dependences of the distributions of the electric potential, electron concentration, electric field, drift velocity, and average electron energy on the gatesource voltage (VGS) and drainsource voltage (VDS) were obtained, then the characteristics of the drain current (IDS) versus the drainsource voltage (VDS) and the transconductance (Gm) versus VGS characteristics were determined. At and IDS is 5.03 A/cm, which is higher value. The Gm?VGS curve shows bell shaped and the maximum Gm is 112 ms/mm at and The current gain cutoff frequency (fT) is 98GHz at and

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

metalsemiconductor field effect transistor


Fuzzy regression using asymmetric fuzzy coefficients and fuzzified neural networks In this paper, first we explain several versions of fuzzy regression methods based on linear fuzzy models with symmetric triangular fuzzy coefficients. Next we point out some limitations of such fuzzy regression methods. Then we extend the symmetric triangular fuzzy coefficients to asymmetric triangular and trapezoidal Fuzzy numbers. We show that the limitations of the fuzzy regression methods with the symmetric triangular fuzzy coefficients are remedied by such extension. Several formulations of linear programming problems are proposed for determining asymmetric fuzzy coefficients from numerical data. Finally, we show how fuzzified neural networks can be utilized as nonlinear fuzzy models in fuzzy regression. In the fuzzified neural networks, asymmetric fuzzy numbers are used as connection weights. The fuzzy connection weights of the fuzzified neural networks correspond to the fuzzy coefficients of the linear fuzzy models. Nonlinear fuzzy regression based on the fuzzified neural networks is illustrated by computer simulations where Type I and Type II membership functions are determined from numerical data. (C) 2001 Elsevier Science B.V. All rights reserved.

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

fuzzy regression analysis
linear fuzzy model
nonlinear fuzzy model
fuzzified neural network
type ii membership function


On searching a table consistent with division poset Suppose P-n = {1, 2,..., n} is a partially ordered set with the partial order defined by divisibility, that is, for any two elements i, j epsilon P-n satisfying i divides j, we have i <= p(n) j. A table A(n) = {ai vertical bar i = 1, 2,..., n} of real numbers is said to be consistent with P-n, provided that for any two elements i, j epsilon {1, 2,..., n} satisfying i divides j, a(i) <= a(j). Given a real number x, we want to determine whether x c An, by comparing x with as few entries of An as possible. In this paper, we investigate the complexity tau (n), measured by the number of comparisons, of the above search problem. We present a 55n/72 + O (ln(2) n) search algorithm for A(n) and prove a lower bound (3/4 + 17/2160)n + O(1) on tau (n) using an adversary argument. (c) 2006 Elsevier B.V. All rights reserved.

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

search algorithm
complexity
partially ordered set
divisibility


Multi-Level Bounded Model Checking with Symbolic Counterexamples Bounded model checking is a widely used formal technique in both hardware and software verification. However, it cannot be applied if the bounds (number of time frames to be analyzed) become large, and deep bugs which are observed only through very long counterexamples cannot be detected. This paper presents a method concatenating multiple bounded model checking results efficiently with symbolic simulation. A bounded model checking with a large bound is recursively decomposed into multiple ones with smaller bounds, and symbolic simulation on each counterexample supports smooth connections to the others. A strong heuristic for the proposed method that targets deep bugs is also presented, and can be applied together with other efficient bounded model checking methods since it does not touch the basic bounded model checking algorithm.

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

bounded model checking
symbolic simulation

formal verification
finite state machine with datapath


A survey on the channel assignment problem in wireless networks Efficient allocation of channels for wireless communication in different network scenarios has become an extremely important topic of recent research. The main challenge lies in the fact that the channel allocation problem is NP-complete. Because of a maximum allowable time limit imposed in practical situations for allocation of channels, sometimes we may need to be satisfied with a near-optimal solution. In this correspondence, we present a discussion on the various challenges and approaches that have been used by different researchers to solve the problem of channel allocation taking into account different interference issues and efficient utilization of available communication channels for cellular mobile (including multimedia communication) environment and cognitive radio based networks. Copyright (C) 2010 JohnWiley & Sons, Ltd.

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

cellular networks
multimedia cellular networks
cognitive radio networks
spectrum utilization


representing design tradeoffs in safety-critical systems Different fault-tolerance strategies have been shown to be effective at achieving fail-safe behavior in a number of safety-critical application domains with different dependability, service, and cost requirements. A technique for comparing the domain profiles and their fault-tolerance strategies could assist architects of new safety-critical systems in choosing an appropriate fault-tolerance strategy. We suggest an approach using Kiviat graphs to visually represent the dependability, service, and cost profile of a system, and show how such a graph can be used to analyze automotive x-by-wire applications.

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

safety availability modeling integrity fault-tolerance


brain-computer interfaces for hci and games In this workshop we study the research themes and the state-of-the-art of brain-computer interaction. Brain-computer interface research has seen much progress in the medical domain, for example for prosthesis control or as biofeedback therapy for the treatment of neurological disorders. Here, however, we look at brain-computer interaction especially as it applies to research in Human-Computer Interaction (HCI). Through this workshop and continuing discussions, we aim to define research approaches and applications that apply to disabled and able-bodied users across a variety of real-world usage scenarios. Entertainment and game design is one of the application areas that will be considered.

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

affective computing
multimodal interaction
brain-computer interfaces


Conjunctive grammars with restricted disjunction It is shown that every conjunctive language is generated by a conjunctive grammar from a special subclass, in which every nonterminal A has at most one rule of the general form A -> alpha(1)& ... &alpha(n), while the rest of the rules for A must be of the type A -> w, where w is a terminal string. For context-free grammars, a similar property does not hold (S.A. Greibach et al. (1992)[3]). If it is furthermore required that each rule A -> w has a nonempty w, then a substantial subfamily of conjunctive languages can be generated, yet it remains unknown whether such grammars are as powerful as conjunctive grammars of the general form. (C) 2010 Elsevier B.V. All rights reserved.

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

single tree grammars
normal form
language equations


A hybrid hub-and-spoke postal logistics network with realistic restrictions: A case study of Korea Post We develop two mathematical models for hybrid hub-and-spoke postal network with realistic restrictions. The models use real data of Korea Post by simultaneously considering the locations and allocations. The proposed models and scenarios are very useful in decision making for postal logistics network designers and operators. The proposed models can be applied to multi-item supply chain and parcel delivery service companies.

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


Efficient identity-based RSA multisignatures ? A digital multisignature is a digital signature of a message generated by multiple signers with knowledge of multiple private keys. In this paper, an efficient RSA multisignature scheme based on Shamir's identity-based signature (IBS) scheme is proposed. To the best of our knowledge, this is the first efficient RSA-based multisignature scheme with both fixed length and the verification time. The proposed identity-based multisignature scheme is secure against forgerability under chosen-message attack. It is also secure against multi-signer collusion attack and adaptive chosen-ID attack.

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

identity-based signature
public-key cryptography


the locative web The concept of location has become very popular in many applications on the Web, in particular for those which aim at connecting the real world with resources on the Web. However, the Web as it is today has no overall location concept, which means that applications have to introduce their own location concepts and have done so in incompatible ways. By turning the Web into a location-aware Web, which we call the "Locative Web", location-oriented applications get better support for their location concepts on the Web, and the Web becomes an information system where location-related information can be more easily shared across different applications and application areas. We describe a location concept for the Web supporting different location types, its embedding into some of the Web's core technologies, and prototype implementations of these concepts in location-enabled Web components.

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

geolocation
http
html
uri
location-based services


Suboptimal adaptive filter for discrete-time linear Stochastic systems This paper considers the problem of recursive filtering for linear discrete-time systems with uncertain observation. A new approximate adaptive filter with a parallel structure is herein proposed. It is based on the optimal mean square combination of arbitrary number of correlated estimates which is also derived. The equation for error covariance characterizing the mean-square accuracy of the new filter is derived. In consequence of parallel structure of the filtering equations the parallel computers can be used for their design. It is shown that this filter is very effective for multisensor systems containing different types of sensors. A practical implementation issue to consider this filter is also addressed. Example demonstrates the accuracy and efficiency of the proposed filter.

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

mean-square estimation
kalman filtering
adaptive filtering
lainiotis' partition theorem


scenario oriented program slicing Slicing is an important decomposition technique for program understanding. However, traditional slicing methods tend to produce too large slices for human inspection as modern programs are often huge and static program analyses are hard to be precise enough. One possible solution to such problem could be combining other program decomposition techniques together with program slicing. With such inspiration, this paper proposes a scenario oriented program slicing method to slice programs under specified execution scenarios. The scenarios provide a clear and easy understanding functional decomposition for the system, while the new slicing method can help figure out how a computation is implemented in a given scenario by effectively reducing the amount of code that a user needs to inspect.

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

scenario
program slicing
decomposition
program understanding


A probabilistic and adaptive scheduling algorithm using system-generated predictions for inter-grid resource sharing Rapid advancement and more readily availability of Grid technologies have encouraged many businesses and researchers to establish Virtual Organizations (VO) and make use of their available desktop resources to solve computing intensive problems. These VOs, however, work as disjointed and independent communities with no resource sharing between them. We, in previous work, have proposed a fully decentralized and reconfigurable Inter-Grid framework for resource sharing among such distributed and autonomous Grid systems (Rao et al. in ICCSA, [2006]). The specific problem that underlies in such a collaborating Grids system is scheduling of resources as there is very little knowledge about availability of the resources due to the distributed and autonomous nature of the underlying Grid entities. In this paper, we propose a probabilistic and adaptive scheduling algorithm using system-generated predictions for Inter-Grid resource sharing keeping collaborating Grid systems autonomous and independent. We first use system-generated job runtime estimates without actually submitting jobs to the target Grid system. Then this job execution estimate is used to predict the job scheduling feasibility on the target system. Furthermore, our proposed algorithm adapted itself to the actual resource behavior and performance. Simulation results are presented to discuss the correctness and accuracy of our proposed algorithm.

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


A domain decomposition approach for coupled modelling of nonlinear soilstructure interaction This paper proposes a new approach for modelling coupled nonlinear soilstructure interaction problems by domain decomposition. It is assumed that the soilstructure coupled system is physically partitioned into independently modelled soil and structure sub-domains. A coupling procedure based on the sequential iterative DirichletNeumann coupling algorithm is presented, which utilizes the condensed tangent stiffness matrices at the soilstructure interface to ensure and accelerate convergence to compatibility in successive update of the boundary conditions. As a special case of the proposed approach, the condensed tangent stiffness matrix is approximated via reduced order models of the partitioned sub-domains throughout the coupling iterations. A simulation environment has been developed, utilizing discipline-oriented solvers for nonlinear structural and geotechnical analysis, and is discussed. This tool is used to demonstrate the applicability of the presented coupling algorithm in modelling nonlinear soilstructure interaction problems, highlighting its relative merits compared to interface relaxation algorithms. Furthermore, the developed tool is employed for a case study involving nonlinear soilstructure interaction analysis between a plane frame and soil subjected to ground excavation, where the computational and modelling benefits of the proposed approach and the developed tool are clearly established.

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

nonlinear soilstructure interaction
domain decomposition
interface relaxation
condensed tangent stiffness matrix


High-precision low-power quartz tuning fork temperature sensor with optimized resonance excitation This paper presents the design, fabrication, and characterization of a quartz tuning fork temperature sensor based on a new ZY-cut quartz crystal bulk acoustic wave resonator vibrating in a flexural mode. Design and performance analysis of the quartz tuning fork temperature sensor were conducted and the thermal sensing characteristics were examined by measuring the resonance frequency shift of this sensor caused by an external temperature. Finite element method is used to analyze the vibratory modes and optimize the structure of the sensor. The sensor prototype was successfully fabricated and calibrated in operation from 0 to 100 A degrees C with the thermo-sensitivity of 70x10(-6)/A degrees C. Experimental results show that the sensor has high thermo-sensitivity, good stability, and good reproducibility. This work presents a high-precision low-power temperature sensor using the comprehensive thermal characterization of the ZY-cut quartz tuning fork resonator.

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

tuning fork
thermal sensing
temperature sensor