Environmental Conditions Unexpectedly Affect the Long-Term Extent of Cell Death Following an Hypoxic Episode Previously we reported delayed cell death, defined by clear-cut cell loss 60 days after a nitrite-induced hypoxic episode. The loss of cells was not apparent two weeks after the treatment, although some changes in cellular appearance were observed at that time. A similar delayed loss of neurons in the hippocampus after hypoxia induced by blood vessel occlusion has also been found. In addition, we reported that the amount of methemoglobinemia induced by the sodium nitrite can be reduced by the stress produced by handling and the injection of saline 2 or 24 h before the nitrite administration. The degree of methemoglobin formed is directly related to cell death in certain areas of the brain, including regions within the hippocampus. Considering the many effects that can be produced by chronic and acute stress of several kinds and the length of time during which these effects manifest themselves, we undertook to determine the histologic effects of the stresses of transport on the neuroanatomic effects of sodium nitrite administration 60 days post administration. Comparisons were made of the effects of two methods of transport from the laboratory in which the animals (male CD-1 mice) were injected with the sodium nitrite or saline (Tufts Medical School) to the laboratory in which the histologic evaluations were made (Binghamton University). The animals began their travel several hours after the injections. One transport method was by commuter airline and the other was by automobile. All animals had the same transport from the supplier to the Boston location (truck). Thus, the stress of experimental interest occurred after the nitrite administration. Upon arrival at Binghamton University, the animals were housed at the University in their own colony room for 60 days before sacrifice. After sacrifice, sections from their brains were subjected to a number of histologic staining procedures, including PTAH, the Bielschowsky silver method, GFAP, and the standard Nissl procedure. Although special attention was paid to hippocampal areas, changes in cells in the habenul and the linings of ventricular areas were also prominent. Surprisingly, the nitrite treatment before transport to Binghamton offered partial protection against the very substantial and lasting effects of the injections, transport, and handling found in the control animals. Differential effects caused by the two methods of transport were also noted.

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

nitrite-induced hypoxia in rats
stresses of handling and transport
delayed death


G(1)-smooth branching surface construction from cross sections This paper proposes a framework for constructing G(1) surfaces that interpolate data points on parallel cross sections, consisting of simple disjoined and non-nested contours, the number of which may vary from plane to plane. Using appropriately estimated cross tangent vectors at the given points, we split the problem into a sequence of local Hermite problems, each of which can be one of the following three types: "one-to-one", "one-to-many" or "many-to-many ". The solution of the "one-to-many" branching problem, where one contour on the i-plane is to be connected to M contours on the (i+1)-plane, is based on combining skinning with trimming and hole filling. More specifically, we first construct a C-1 surrounding curve of all M contours on the (i+1)-plane. Next, we build the so-called surrounding surface that skins the i-plane contour with the (i+1)-plane surrounding curve, and trim suitably along parts of the surrounding curve that connect contours. The resulting multi-sided hole is covered with quadrilateral Gordon-Coons patches that possess G(1) continuity. For this purpose, we develop a hole-filling technique that employs shape-preserving guide curves and is able to preserve data symmetries. The "many-to-many" problem is handled by combining the "one-to-many" methodology with a zone-separation technique, that achieves splitting the "many-to-many" problem into two "one-to-many" problems. The methodology, implemented as a C++ Rhino v3.0 plug-in, is illustrated via two synthetic data sets and in the context of two realistic design examples. Finally, the paper concludes with discussing ongoing work towards improving the robustness and the applicability of the method regarding the surrounding curve construction step. (c) 2007 Elsevier Ltd. All rights reserved.

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

design
cross sections
skinning
trimming
hole filling

reconstruction
branching surfaces
g(1) surfaces
shape-preserving interpolation


Design and analysis of a reconfigurable discrete pin tooling system for molding of three-dimensional free-form objects This paper presents the design and analysis of a new reconfigurable tooling for the fabrication of three-dimensional (3D) free-form objects. The proposed reconfigurable tooling system comprises a set of matrices of a closely stacked discrete elements (i.e., pins) arranged to form a cavity in which a free-form object can be molded. By reconfiguring the pins, a single tool can be used in the place of multiple tools to produce different parts with the involvement of much lesser time and cost. The structural behavior of a reconfigurable mold tool under process conditions of thermoplastic molding is studied using a finite element method (FEM) based methodology. Various factors that would affect the tool behavior are identified and their effects are analyzed to optimally design a reconfigurable mold tool for a given set of process conditions. A prototype, open reconfigurable mold tool is developed to present the feasibility of the proposed tooling system. Several case studies and sample parts are also presented in 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 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

reconfigurable molds
3d objects
contact analysis
interlocking arrangement


web-gis technology for dynamic data analysis In this paper we give an overview of a web-based geographical information system called GeoTime 2.0. Despite being light-weight, it possesses the features essential for conducting research into complex processes which involve large amounts of data. These features include (i) network access to distributed geographical information (ii) modern methods of knowledge acquisition from spatial and spatio-temporal data, (iii) high interactivity and clarity of visualization leading to boost the decision-making efficiency. Even though the main application of this system is the seismic hazard research, it can also be effectively applied for modeling various dynamic processes which we demonstrate on the example of modeling the process of pollution distribution associated with the water surface-flow.

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

web-gis
spatio-temporal data analysis
computer simulation
geoinformation technology


A mathematical and numerical model for reactive fluid flow systems We formulate mathematical and numerical models for multispecies, multi-phase and non-isothermal reactive fluid flow in porous media focusing on the chemical reactions and the transport of solutes. Mass conservation and stability in the time integration are emphasized. We use cell-centered finite volume differencing in space and an implicit Runge-Kutta method in time. Assuming two space dimensions, we introduce flux approximation for arbitrarily shaped convex quadrilaterals. On equidistant and variable sized rectangular grids we choose limited kappa = 1/3 related schemes to approximate the advective flux and the central difference scheme for the diffusive flux. On non-rectangular grids we recommend the VF9 scheme for the estimation of the diffusive flux. Our model exists as a code.

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

partial differential equations
finite volume methods
runge-kutta methods
chemical reacting flow


Evaluation and optimization of the catalog search process of e-procurement platforms With the emerging of e-catalog standards the product search can be used in a very different and improved matter. Beyond the usual keyword search this opens the arena for attribute-based search engines, including parametric search and preference search. We analyze the impact of different search techniques for such e-catalogs on the overall search process costs. It turns out that preference search has a high potential to significantly reduce the process costs. A large-scale use case with the MAN2B e-procurement platform supports our claim. We identify improvements achievable by using preference search, in particular less navigation steps during the product search and better search results due to the BMO query model. Expensive cases, where frustrated users accept bad search results or phone up the company's purchasing department, should decrease significantly. This in turn will enable the purchasing department to focus more on strategic issues like supplier relationship management than on operative issues as it still happens widely today. (c) 2005 Elsevier B.V. All rights reserved.

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

preference xpath
e-catalogs
e-procurement


Categories isomorphic to L-FTOP In this paper, our purpose is twofold. First, we deal with the local structure of L-fuzzy topology. Hence, modifying the idea of quasi-coincident neighborhood in L-topology, we concretely create an axiomatic system of neighborhood in L-fuzzy topology. Thus we find the category L-FQN of topological L-fuzzy quasi-coincident neighborhood spaces and appropriate continuous maps, which is isomorphic to the category L-FTOP, where L is fuzzy lattice. Further we prove that the category L-FQN is concretely bireflective in another category L-PrFQN constructed in the paper and L-PrFQN is topological category over SET. Secondly, to establish the relation between L-FTOP and L-TOP, we construct two categories L-AITOP and LaTQN. It is proved that L-AITOP is isomorphic to L-FTOP, in particular, when L is fuzzy lattice with locally multiplicative property, LaTQN is isomorphic to L-FTOP. (C) 2005 Elsevier B.V. All rights reserved.

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

l-fuzzy quasi-coincident neighborhood system


Machine learning in digital games: a survey Artificial intelligence for digital games constitutes the implementation of a set of algorithms and techniques from both traditional and modern artificial intelligence in order to provide solutions to a range of game dependent problems. However, the majority of current approaches lead to predefined, static and predictable game agent responses, with no ability to adjust during game-play to the behaviour or playing style of the player. Machine learning techniques provide a way to improve the behavioural dynamics of computer controlled game agents by facilitating the automated generation and selection of behaviours, thus enhancing the capabilities of digital game artificial intelligence and providing the opportunity to create more engaging and entertaining game-play experiences. This paper provides a survey of the current state of academic machine learning research for digital game environments, with respect to the use of techniques from neural networks, evolutionary computation and reinforcement learning for game agent control.

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


A Dependent Model for Fault Tolerant Software Systems During Debugging This paper proposes a special redundant model for describing the s-dependency of multi-version programming software during testing and debugging. N-version programming (NVP) is one of the most important software fault tolerance techniques. Many papers have studied the issue of fault correlation among versions. However, only a few of them consider this issue during the testing and debugging part of the software development life cycle. During testing and debugging, faults may not be successfully removed. Imperfect debugging may result in unsuccessful removal, and the introduction of new faults. Different from existing NVP models, the model proposed in this paper allows an assessment of s-dependency when correlated failures may not necessarily occur at the same execution time point. The model focuses on 2 VP systems. It is developed to be a bivariate counting process by assuming positive s-dependency among versions. Considering imperfect debugging, this bivariate process characterizes dynamic changes of fault contents for each version during testing and debugging. The system reliability, expected number of faults, probability of perfect debugging, and parameter estimation of model parameters are presented. An application example is given to illustrate the proposed model. The paper provides an alternative approach for evaluating the reliability of 2 VP software systems when there is positive s-dependency between versions.

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

bivariate counting process
correlated failures
imperfect debugging
software fault tolerance

n-version programming
software reliability


Merging the local and global approaches to probabilistic satisfiability The probabilistic satisfiability problem is to verify the consistency of a set of probability values or intervals for logical propositions. The (tight) probabilistic entailment problem is to find best bounds on the probability of an additional proposition. The local approach to these problems applies rules on small sets of logical sentences and probabilities to tighten the given probability intervals. The global approach uses linear programming to find best bounds. We show that merging these approaches is profitable to both: local solutions can be used to find global solutions more quickly through stabilized column generation, and global solutions can be used to confirm or refute the optimality of the local solutions found. As a result, best bounds are found, together with their step-by-step justification. (c) 2007 Elsevier Inc. All rights reserved.

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

probabilistic satisfiability
probabilistic entailment
linear programming
column generation


The effects of XML compression on SOAP performance XML is the foundation of the SOAP protocol, and in turn, Web Service communication. This self-descriptive textual format for structured data is renowned to be verbose. This verbosity can cause problems due to communication and processing overhead in resource-constrained environments (e.g., small wireless devices), In this paper, we compare different binary representations of XML documents. To this end, we propose a multifaceted and reusable test suite based on real-world scenarios. Our main result is that only simple XML compression methods are suitable for a wide range of scenarios. While these simple methods do not match the compression ratios of more specialized ones, they are still competitive in most scenarios. We also show that there are scenarios that none of the evaluated methods can deal with efficiently.

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

binary xml
web services
performance small
sensor networks
benchmark
wireless telephony


On the boundary of regular languages ? We prove that the tight bound on the state complexity of the boundary of regular languages, defined as bd ( L ) = L ? ? ( L ) ? , is 3/8?4n+2n?2?2?3n?2?n+2 3 / 8 ? 4 n + 2 n ? 2 ? 2 ? 3 n ? 2 ? n + 2 . Our witness languages are described over a five-letter alphabet. Next, we show that this bound cannot be met by any quaternary language if n?5 n ? 5 . However, the state complexity of boundary in the quaternary case is smaller by just one. Finally, we prove that the state complexity of boundary in the binary and ternary cases is ?(4n) ? ( 4 n ) .

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

regular languages
boundary
state complexity


Impact of QoS operations on an experimental testbed network By making the best use of limited bandwidth, quality of service (QoS) provisioning over internet is essential for satisfying various types of internet-application requirements. The traffic classification and scheduling are the key functions to provide various kinds of class of service (CoS) under an overload condition. This paper investigates QoS performance in a network equipment testbed when implementing these main functions. We examine the major CoS functions provided by the Juniper T320 router, and measure their performance. In addition to fundamental analysis of the QoS behavior, we show the impact of QoS operations on a parallel system distributed in multi-domain networks as a practical case study of grid environments.

quality of service (qos)
class of service (cos)
weighted round robin (wrr)
priority queuing (pq)


contaminated garbage collection We describe a new method for determining when an object can be garbage collected. The method does not require marking live objects. Instead, each object X is dynamically associated with a stack frame M , such that X is collectable when M pops. Because X could have been dead earlier, our method is conservative. Our results demonstrate that the method nonetheless identifies a large percentage of collectable objects. The method has been implemented in Sun's Java Virtual Machine interpreter, and results are presented based on this implementation

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

implementation
object
demonstrate
live
method
virtual machine


photon differentials A number of popular global illumination algorithms uses density estimation to approximate indirect illumination. The density estimate is performed on finite points -- particles -- generated by a stochastic sampling of the scene. In the course of the sampling, particles, representing light, are stochastically emitted from the light sources and reflected around the scene. The sampling induces noise, which in turn is handled by the density estimate during the illumination reconstruction. Unfortunately, this noise reduction imposes a systematic error (bias), which is seen as a blurring of prominent illumination features. This is often not desirable as these may lose clarity or vanish altogether. We present an accurate method for reconstruction of indirect illumination with photon mapping. Instead of reconstructing illumination using classic density estimation on finite points, we use the correlation of light footprints, created by using Ray Differentials during the light pass. This procedure gives a high illumination accuracy, improving the trade-off between bias and variance considerable as compared to traditional particle tracing algorithms. In this way we preserve structures in indirect illumination.

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

ray differentials
photon mapping
global illumination


Hardware-software platform for computing irreducible testors In pattern recognition, feature selection is a very important task for supervised classification. The problem consists in, given a dataset where each object is described by a set of features, finding a subset of the original features such that a classifier that runs on data containing only these features would reach high classification accuracy. A useful way to find this subset of the original features is through testor theory. A testor is defined as a subset of the original features that allows differentiating objects from different classes. Testors are very useful particularly when object descriptions contain both numeric and non-numeric features. Computing testors for feature selection is a very complex problem due to exponential complexity, with respect to the number of features, of algorithms based on testor theory. Hardware implementation of testor computing algorithms helps to improve their performance taking advantage of parallel processing for verifying if a feature subset is a testor in a single clock cycle. This paper introduces an efficient hardware-software platform for computing irreducible testors for feature selection in pattern recognition. Results of implementing the proposed platform using a FPGA-based prototyping board are presented and discussed. (C) 2011 Elsevier Ltd. All rights reserved.

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


Energy-Efficient Mobile Data Uploading from High-Speed Trains Recent decades have witnessed the fast development of high-speed railway systems in many countries, which have significantly shortened the travel time between distant cities. Accompanied with this convenience is the challenge for cell phone vendors to provide broadband Internet access for passengers, particularly considering the fast changing channel conditions in high-speed trains and the limited battery of cell phones, which often cannot be re-charged in trains. In this paper, inspired by the unique spatial-temporal characteristics of wireless signals along high-speed railways, we propose a novel energy-efficient scheduling approach for uploading data from cell phones, both with soft deadlines (e.g., documents) and hard deadlines (e.g., video streaming). Our solution effectively predicts the signal strength through its spatial-temporal periodicity in this new application scenario, and smartly adjusts the transmission rate to maximize the overall data transmission rate and yet conserves the energy consumption. Performance evaluation based on realistic railway scenarios and H.264 video traces demonstrate the effectiveness of our solution and its superiority as compared to the existing solutions.

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

high-speed railway
energy-efficient uploading


The paraconsistent process order control method We have already developed some kinds of paraconsistent annotated logic programs. In this paper we propose the paraconsistent process order control method based on a paraconsistent annotated logic program called beforeafter extended vector annotated logic program with strong negation (bf-EVALPSN) with a small example of pipeline process order verification. Bf-EVALPSN can deal with beforeafter relations between two processes (time intervals) in its annotations, and its reasoning system consists of two kinds of inference rules called the basic bf-inference rule and the transitive bf-inference rule. We introduce how the bf-EVALPSN-based reasoning system can be applied to the safety verification for process order.

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

paraconsistent annotated logic program
process order control


Constraint programming based column generation for crew assignment Airline crew assignment problems are large-scale optimization problems which can be adequately solved by column generation. The subproblem is typically a so-called constrained shortest path problem and solved by dynamic programming. However, complex airline regulations arising frequently in European airlines cannot be expressed entirely in this framework and limit the use of pure column generation. In this paper, we formulate the subproblem as a constraint satisfaction problem, thus gaining high expressiveness. Each airline regulation is encoded by one or several constraints. An additional constraint which encapsulates a shortest path algorithm for generating columns with negative reduced costs is introduced. This constraint reduces the search space of the subproblem significantly. Resulting domain reductions are propagated to the other constraints which additionally reduces the search space. Numerical results based on data of a large European airline are presented and demonstrate the potential of our approach.

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

airline crew assignment
constraint satisfaction
column generation

shortest path constraint
hybrid or/cp methods


A new super-resolution PIV accelerated by characteristic pixel selection A new high-speed super-resolution PIV was proposed using characteristic pixel selection to accelerate the successive abandonment (SA) with recursive window subdivision. The performance and applicability of the proposed PIV were evaluated. In the SA calculation with the characteristic pixel selection, 1000 candidates are narrowed down to only one at over 50% of the measurement points, and the number of error vectors is reduced because the difference between the cumulative intensities of a correct candidate and of other ones becomes clear due to the characteristics of selected pixels. In all recursive processes, error checks are carefully performed using the summation of the distribution of the cumulative intensity difference distribution, which is suitable for the SA method. In a comparison of the time per velocity vector, the present super-resolution PIV was shown to be 10 times faster than the former ordinary resolution PIV. Another feature of the present super resolution PIV is that the velocity vectors are obtained in the region very close to the image boundaries and masked regions by using the recursive algorithm.

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

super-resolution piv
successive abandonment method
boundary region
mask


Cell-related location area planning for 4G PCS networks with variable-order Markov model We propose a distributed location management scheme between static and dynamic schemes. We use variable-order Markov models to find mobility patterns shared by UEs. The planned LAs are allowed to be overlapped with other LAs which are now supported by 4G standards, i.e., LTE and WiMAX. The OD matrix from the Taipei Rapid Transit Corporation is referred in our simulation. We illustrate how to apply the proposed scheme over IEEE 802.16 networks.

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

location management
location area planning

variable-order markov model
mobile computing


Comparison between Gurson and Lemaitre damage models in wiping die bending processes This paper is devoted to a finite element prediction of material damage distribution within the workpiece during wiping die bending processes. The damage mechanics approach has been used in this investigation in order to describe the progressive damage evolution within the sheet. A comparative study between the results obtained by the simulations using the Lemaitre and Gurson damage models is presented and discussed. The elastoplastic constitutive laws are integrated by means of an incremental formulation which has been implemented in the finite element code ABAQUS. The punch load, influenced by the friction coefficient, is investigated for different cases of die radius. The springback angle, which depends on the elastic properties of the material, is computed for all cases. Both models give similar results in the modelling of bending operations. The Gurson one is shown to have more flexibility for applications.

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

damage bending springback gurson lemaitre


A domain decomposition preconditioner for p-FEM discretizations of two-dimensional elliptic problems In this paper, a uniformly elliptic second order boundary value problem in 2-D discretized by the p-version of the finite element method is considered. An inexact Dirichlet-Dirichlet domain decomposition pre-conditioner for the system of linear algebraic equations is investigated. Two solvers for the problem in the sub-domains, a pre-conditioner for the Schur-complement and an extension operator operating from the edges of the elements into the interior are proposed as ingredients for the inexact DD-pre-conditioner. In the main part of the paper, several numerical experiments on a parallel computer are given.

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

solution of discretized equations
finite elements


Filter-based resolution principle for lattice-valued propositional logic LP(X) ? As one of most powerful approaches in automated reasoning, resolution principle has been introduced to non-classical logics, such as many-valued logic. However, most of the existing works are limited to the chain-type truth-value fields. Lattice-valued logic is a kind of important non-classical logic, which can be applied to describe and handle incomparability by the incomparable elements in its truth-value field. In this paper, a filter-based resolution principle for the lattice-valued propositional logic LP(X) based on lattice implication algebra is presented, where filter of the truth-value field being a lattice implication algebra is taken as the criterion for measuring the satisfiability of a lattice-valued logical formula. The notions and properties of lattice implication algebra, filter of lattice implication algebra, and the lattice-valued propositional logic LP(X) are given firstly. The definitions and structures of two kinds of lattice-valued logical formulae, i.e., the simple generalized clauses and complex generalized clauses, are presented then. Finally, the filter-based resolution principle is given and after that the soundness theorem and weak completeness theorems for the presented approach are proved.

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

resolution principle
filter
automated reasoning

lattice-valued logic
simple generalized clause
complex generalized clause


Time Donating Barrier for efficient task scheduling in competitive multicore systems We present Tidon, a time donating barrier synchronization mechanism. Tidon leverages waiting threads to accelerate barrier in competitive environments. Tidon alleviates the performance degradation of barrier-intensive applications. Tidon maintains good fairness among co-running applications. We implement a prototype of Tidon and show its efficiency by experiments.

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


Non-cooperative computation: Boolean functions with correctness and exclusivity We introduce the concept of non-cooperative computation (NCC), which is the joint computation of a function by self-motivated agents, where each of the agents possesses one of the inputs to the function. In NCC the agents communicate their input (truthfully or not) to a trusted center, which performs a commonly-known computation and distributes the results to the agents. The question is whether the agents can be incented to communicate their true input to the center, allowing all agents to compute the function correctly. NCC is a game theoretic concept and specifically is couched in terms of mechanism design. NCC is a very broad framework and is specialized by imposing specific structure on the agents' utility functions. The technical results we present are specific to the setting in which each agent has a primary interest in computing the function and a secondary interest in preventing the others from computing it (properties called correctness and exclusivity). For this setting we provide a complete characterization of the Boolean functions that are non-cooperatively computable. We do this for three versions of NCC: a basic deterministic version, a probabilistic version and a version in which the computation can be subsidized by the center. The analysis turns out to depend on whether the inputs of the agents are probabilistically correlated or not and we analyze both cases.(1) (c) 2005 Elsevier B.V. All rights reserved.

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

non-cooperative computation
informational mechanism design
cryptography


Analysis and Optimization for Boolean Expression Indexing BE-Tree is a novel dynamic data structure designed to efficiently index Boolean expressions over a high-dimensional discrete space. BE-Tree copes with both high-dimensionality and expressiveness of Boolean expressions by introducing an effective two-phase space-cutting technique that specifically utilizes the discrete and finite domain properties of the space. Furthermore, BE-Tree employs self-adjustment policies to dynamically adapt the tree as the workload changes. Moreover, in BE-Tree, we develop two novel cache-conscious predicate evaluation techniques, namely, lazy and bitmap evaluations, that also exploit the underlying discrete and finite space to substantially reduce BE-Tree's matching time by up to 75%. BE-Tree is a general index structure for matching Boolean expression which has a wide range of applications including (complex) event processing, publish/subscribe matching, emerging applications in cospaces, profile matching for targeted web advertising, and approximate string matching. Finally, the superiority of BE-Tree is proven through a comprehensive evaluation with state-of-the-art index structures designed for matching Boolean expressions.

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

boolean expressions
complex event processing
data structure

algorithms design measurement experimentation performance publish/subscribe


NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting We prove NP-hardness of two generalizations of the EDGE COVER problem. We resolve two open questions from the literature regarding the complexity of these two generalizations. We resolve the complexity of three open questions from computational social choice regarding control and bribery for Approval voting.

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

computational social choice
approval voting

computational complexity
graph problems
manipulating elections


two systems which produce animated representations of the execution of computer programs This paper describes two prototype systems which facilitate the production of teaching films containing animated representations of the execution of computer programs. With such systems, it is possible for an instructor to produce short quick-and-dirty single-concept film clips with only hours of effort, and more polished material with only slightly more effort. Demonstration clips produced in this way will be shown at the Symposium.

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

teaching material paper systems prototype film

concept program demonstrate product computation


A memetic particle swarm optimization algorithm for multimodal optimization problems Recently, multimodal optimization problems (MMOPs) have gained a lot of attention from the evolutionary algorithm (EA) community since many real-world applications are MMOPs and may require EAs to present multiple optimal solutions. In this paper, a memetic algorithm that hybridizes particle swarm optimization (PSO) with a local search (LS) technique, called memetic PSO (MPSO), is proposed for locating multiple global and local optimal solutions in the fitness landscape of MMOPs. Within the framework of the proposed MPSO algorithm, a local PSO model, where the particles adaptively form different species based on their indices in the population to search for different sub-regions in the fitness landscape in parallel, is used for globally rough exploration, and an adaptive LS method, which employs two different LS operators in a cooperative way, is proposed for locally refining exploitation. In addition, a triggered re-initialization scheme, where a species is re-initialized once converged, is introduced into the MPSO algorithm in order to enhance its performance of solving MMOPs. Based on a set of benchmark functions, experiments are carried out to investigate the performance of the MPSO algorithm in comparison with some EAs taken from the literature. The experimental results show the efficiency of the MPSO algorithm for solving MMOPs.

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

memetic algorithm
particle swarm optimization
local search
species


The SEXTANT software: A tool for automating the comparative analysis of mental models of dynamic systems Most management situations are dynamic; and managers decisions are framed by their mental models. Mental models of dynamic systems (MMDS) have three levels of representation: elements, loops and the whole model. Distance ratios at each level reveal differences both between subjects and over time. SEXTANT calculates the distance ratios for elements, loops and the whole model for large samples of MMDS. SEXTANT enables researchers to strongly reduce the efforts to apply MMDS research.

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

education
decision analysis
problem structuring
psychology of decision
strategic planning


A fast method for solving the heat equation by layer potentials Boundary integral formulations of the heat equation involve time convolutions in addition to surface potentials. If M is the number of time steps and N is the number of degrees of freedom of the spatial discretization then the direct computation of a heat potential involves order N2M2 operations. This article describes a fast method to compute three-dimensional heat potentials which is based on Chebyshev interpolation of the heat kernel in both space and time. The computational complexity is order p4q2NM operations, where p and q are the orders of the polynomial approximation in space and time.

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

fast multipole method
fast gauss transform


Network Capacity Region and Minimum Energy Function for a Delay-Tolerant Mobile Ad Hoc Network We investigate two quantities of interest in a delay-tolerant mobile ad hoc network: the network capacity region and the minimum energy function. The network capacity region is defined as the set of all input rates that the network can stably support considering all possible scheduling and routing algorithms. Given any input rate vector in this region, the minimum energy function establishes the minimum time-average power required to support it. In this paper, we consider a cell-partitioned model of a delay-tolerant mobile ad hoc network with general Markovian mobility. This simple model incorporates the essential features of locality of wireless transmissions as well as node mobility and enables us to exactly compute the corresponding network capacity and minimum energy function. Furthermore, we propose simple schemes that offer performance guarantees that are arbitrarily close to these bounds at the cost of an increased delay.

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

delay-tolerant networks
minimum energy scheduling
queueing analysis


A population-based variable neighborhood search for the single machine total weighted tardiness problem This paper investigates the single machine total weighted tardiness problem, in which a set of independent jobs with distinct processing times, weights, and due dates are to be scheduled on a single machine to minimize the sum of weighted tardiness of all jobs. This problem is known to be strongly NP-hard, and thus provides a challenging area for metaheuristics. A population-based variable neighborhood search (PVNS) algorithm is developed to solve it. This algorithm differs from the basic variable neighborhood search (VNS). First, the PVNS consists of a number of iterations of the basic VNS, and in each iteration a population of solutions is used to simultaneously generate multiple trial solutions in a neighborhood so as to improve the search diversification. Second, the PVNS adopts a combination of path-relinking, variable depth search and tabu search to act as the local search procedure so as to improve the search intensification. Computational experiments show that the proposed PVNS algorithm can obtain the optimal or best known solutions within a reasonable computation time for all standard benchmark problem instances from the literature.

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

total weighted tardiness
variable neighborhood search


Central schemes for the modified Buckley-Leverett equation In this paper, we extend the second and third order classical central schemes for the hyperbolic conservation laws to solve the modified Buckley-Leverett (MBL) equation which is of pseudo-parabolic type. The MBL equation describes two-phase flow in porous media, and it differs from the classical Buckley-Leverett (BL) equation by including a balanced diffusive-dispersive combination. The classical BL equation gives a monotone water saturation profile for any Riemann problem; on the contrast, when the dispersive parameter is large enough, the MBL equation delivers non-monotone water saturation profiles for certain Riemann problems as suggested by the experimental observations. Numerical results in this paper confirm the existence of non-monotone water saturation profiles consisting of constant states separated by shocks. (C) 2012 Elsevier B.V. All rights reserved.

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

conservation laws
porous media
central schemes

dynamic capillarity
two-phase flows
shock waves
pseudo-parabolic equations


QoS routing across multiple autonomous systems using the path computation element architecture We examine various algorithms for calculating quality of service (QoS)-enabled paths spanning multiple autonomous systems (ASs) using the path computation element (PCE) architecture. The problem is divided into two parts. We first calculate an AS path, then the node-by-node path. Using extensive simulation, we compared various AS-path calculation algorithms based on border gateway protocol (BGP) and various AS-aggregation procedures, such as mesh, star and nodal aggregation. For node-to-node path calculation, we employed the per-domain backward algorithm and the per-domain backward tree algorithm (also known as backward recursive PCE-based computation). Results point to the fact that complex AS-path calculation algorithms do not perform significantly better than BGP. However, if the service quality provided by ASs varies greatly, either in time or space, then we expect a QoS-aware AS-path computation algorithm, e.g., static nodal aggregation, to outperform BGP. Although the per-domain backward tree algorithm generally performs better than the per-domain backward algorithm, using a persistent variant of the latter makes it outperform the per-domain backward tree algorithm. The cost is a negligible increase in computational complexity and a slightly increased connection setup delay.

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


Vector control for loss minimization of induction motor using GAPSO This paper deals with the GAPSO (genetic algorithmparticle swarm optimization) based vector control for loss minimization operation of induction motor. It is estimated that more than around 50% of the world electric energy generated is consumed by electric machines such as induction motor, dc motor. So, improving efficiency in electric drives is important and control strategy for minimum energy loss is needed as one of optimal operation strategies. The vector control of induction motor has been widely used to operate in a wide speed range by using flux weakening at rated speed. However, it is still necessary to advance because of coupling is behavior between fluxes in motor. In this paper, vector control approach is suggested for an optimal operation of induction motor using variable acceleration and GAPSO tuning method through simulation. We can obtain satisfactory results for energy saving control.

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

induction machines
hybrid intelligent system
genetic algorithm
particle swarm optimization


Partial iterates for symmetrizing non-parametric color correction Mosaic generation is a central tool in various fields ranging way beyond the scope of photogrammetry and requires the radiometry and color of the images to be corrected. Correction can either be done by a global parametric approach (looking for an optimal gain or gamma for each image of the mosaic), or by iteratively correcting image pairs with a non-parametric approach. Such non-parametric approaches allow for much finer correction but are asymmetric, i.e. they require the choice of a source image that will be corrected to match a target image. Thus the result on the whole mosaic will be very dependant on the order in which images are corrected. In this paper, we propose to use partial iterates to symmetrize non-parametric correction in order to solve this problem. Partial iterates formalize what partially applying a bijective function means and we explain how this can be done in both the continuous and discrete domain. This mechanism is applied to a simple non-parametric approach (histogram transfer of the luminance) to show its potential.

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

mosaic
color correction
radiometry
image


Towards Large-Scale Meteorological Data Services: A Case Study Meteorological data contribute significantly to Big Data, handling multi-dimensional raster data cubes up to 5-D and with single cubes up to multi-Petabyte sizes. Due to the lack of support for raster data, traditionally file-based implementations have been used for serving such data to the community, rather than databases. Array databases overcome this by providing storage and query support.

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


A Case for Continuous Data Protection at Block Level in Disk Array Storages This paper presents a study of data storages for continuous data protection (CDP). After analyzing the existing data protection technologies, we propose a new disk array architecture that provides Timely Recovery to Any Point-in-time, referred to as TRAP. TRAP stores not only the data stripe upon a write to the array but also the time-stamped Exclusive ORs (XORs) of successive writes to each data block. By leveraging the XOR operations that are performed upon each block write in today's RAID4/5 controllers, TRAP does not incur noticeable performance overhead. More importantly, TRAP is able to recover data very quickly to any point-in-time upon data damage by tracing back the sequence and history of XORs resulting from writes. What is interesting is that the TRAP architecture is very space efficient. We have implemented a prototype of the new TRAP architecture using software at the block level and carried out extensive performance measurements using TPC-C benchmarks running on Oracle and Postgres databases, TPC-W running on a MySQL database, and file system benchmarks running on Linux and Windows systems. Our experiments demonstrated that TRAP not only is able to recover data to any point-in-time very quickly upon a failure but also uses less storage space than traditional daily incremental backup/snapshot. Compared to the state-of-the-art CDP technologies, TRAP saves disk storage space by one to two orders of magnitude with a simple and a fast encoding algorithm. In addition, TRAP can provide two-way data recovery with the availability of only one reference image in contrast to the one-way recovery of snapshot and incremental backup technologies.

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

disk i/o
data storage
data protection and recovery
data backup


Robust visual tracking based on structured sparse representation model Sparse representation has been one of the most influential frameworks for visual tracking. However, most tracking methods based on sparse representation only consider the holistic representation and lack local information, which may lead to fail when there is similar object or occlusion in the scene. In this paper, we present a novel robust visual tracking algorithm based on structured sparse representation model. This model includes one fixed template, nine variational templates and the background templates, which are selectively updated to adapt to the appearance change of the target. And the update scheme is developed by exploiting the strength of the incremental PCA learning and sparse representation. By incorporating the block-division feature into sparse representation framework, it can capture the intrinsic structured distribution of sparse coefficients effectively and reduce the influence of the occluded target template. In addition, we propose a sparsity-based discriminative classifier, which employ the distinction of reconstruction error between the foreground and the background to improve discrimination performance for object tracking. Both qualitative and quantitative evaluations on benchmark challenging sequences demonstrate that the proposed tracking algorithm performs favorably against several state-of-the-art tracking methods.

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

block division
particle filter
template update


Uniform strength for large deflections of cantilever beams under end point load Analysis is conducted for slender beams with a varying cross-section under large non-linear elastic deformation. A thickness variation function is derived to achieve optimal - constant maximum bending stress distribution along the beam for inclined end load of arbitrary direction. Closed form solutions are derived for the large deflections that correspond to the various loading conditions. The analysis is repeated for a beam with optimally varying width (for arbitrary end force) and the width variation function is also determined.

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

non-linear
large deflection
varying thickness
inclined load


A Dynamic Program Analysis to find Floating-Point Accuracy Problems Programs using floating-point arithmetic are prone to accuracy problems caused by rounding and catastrophic cancellation. These phenomena provoke bugs that are notoriously hard to track down: the program does not necessarily crash and the results are not necessarily obviously wrong, but often subtly inaccurate. Further use of these values can lead to catastrophic errors. In this paper, we present a dynamic program analysis that supports the programmer in finding accuracy problems. Our analysis uses binary translation to perform every floating-point computation side by side in higher precision. Furthermore, we use a lightweight slicing approach to track the evolution of errors. We evaluate our analysis by demonstrating that it catches well-known floating-point accuracy problems and by analyzing the Spec CFP2006 floating-point benchmark. In the latter, we show how our tool tracks down a catastrophic cancellation that causes a complete loss of accuracy leading to a meaningless program result. Finally, we apply our program to a complex, real-world bioinformatics application in which our program detected a serious cancellation. Correcting the instability led not only to improved quality of the result, but also to an improvement of the program's run time.

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

program instrumentation
floating-point accuracy


a semantic web architecture for advocate agents to determine preferences and facilitate decision making The world-wide-web (WWW) today consists of distinct, isolated islands of data and metadata. In the near future we expect the availability of a critical mass of data and metadata for use by intelligent agents that act on behalf of human users. These agents would identify, propose and capture new opportunities to assist human users in satisfying their goals, by traversing and acting on this semantically rich and abundant information. We envision a new class of agents, their networks and their communities that exist for the sole purpose of serving as their human "master's" Advocates - Advocate Agents . Advocate Agents learn a human's goals and preferences, collaborate with other agents, mine semantic content, identify new opportunities for action, propose them and finally transact them, while always keeping the human "in-the-loop." This paper discusses this class of distributed, intelligent, Advocate Agents, their potential uses, and proposed architectures and techniques that provide a conceptual framework for these networked agent societies to collaborate in the achievement of their human user's goals.

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

personalization
recommendation agents
preferences elicitation


a coordination model for the semantic web The Semantic Web foresees a Web of machine-processable knowledge interacted with by clients in an operationalized manner. At Web scale, the coordination between clients will be vital for ensuring the success of their interactions. In this paper we consider how a coordination model for the Semantic Web would look, as a precursor to the design and implementation of Semantic Web Spaces, a middleware platform for real-world Semantic Web applications.

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


Electronic properties of 2D and 3D hybrid organic/inorganic perovskites for optoelectronic and photovoltaic applications We herein investigate theoretically both 2D and 3D Hybrid Organic/inorganic perovskite crystal structures based on density functional theory (DFT) calculations and symmetry analyses. Our findings reveal the universal features of the electronic band structure for the class of lead-halide hybrids (R-NH\(_{3})_{n}\hbox {PbX}_{m}\), where \((\mathrm{{n}}, \mathrm{{m}})=(2,4)\) and (1,3) respectively for 2D and 3D structures. Among those, the large spin-orbit coupling acting on the conduction band is shown to play a major role on the band gap of these materials. Moreover, this approach can easily be generalized to related layered and 3D hybrids, thus providing a clear-sighted inside in their electronic and optical properties.

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


An adaptive neuromorphic model of ocular dominance map using floating gate synapse A novel analogue CMOS design of a cortical cell, that computes weighted sum of inputs, is presented. The cells feedback regime exploits the adaptation dynamics of floating gate p p FET synapse to perform competitive learning amongst input weights as time-staggered winner take all. A learning rate parameter regulates adaptation time and a bias enforces resource limitation by restricting the number of input branches and winners in a competition. When learning ends, the cells response favours one input pattern over others to exhibit feature selectivity. Embedded in a 2-D RC grid, these feature selective cells are capable of performing a symmetry breaking pattern formation, observed in some reactiondiffusion models of cortical feature map formation, e.g. ocular dominance. Close similarity with biological networks in terms of adaptability and long term memory indicates that the cells design is ideally suited for analogue VLSI implementation of Self-Organizing Feature Map (SOFM) models of cortical feature maps.

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

floating gate synapse
feature selectivity
ocular dominance
reactiondiffusion
cortical feature maps


del.icio.us development tools Developers need better knowledge tools to answer their information needs, rather than continuing to rely so heavily on communication with coworkers. Web sites, like the social bookmarking site Del.icio.us, might provide a way forward. They are designed to provide each user an individual incentive for entering data, but provide even more value by combining data from different users into collective knowledge. Several research projects hint that designing knowledge tools for developers using this principle would be more cost effective and provide better incentive structures for capturing knowledge.

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


Looking forward: Toward an understanding of the nature and definition of IT acceptance In the past two decades the Technology Acceptance Model ( TAM) has successfully catalyzed a large number of studies related to IT usage or intentions toward that usage. However, we argue that the focus of these studies has been on a narrow aspect of usage ( typically, extent or frequency of use). Moreover, we suggest that, these studies implicitly include the notion that "IT acceptance" be construed as simply the relationship between antecedent factors such as perceived usefulness and ease of use that target or predict that particular type of intention connected to amount of IT usage. Rather than continuing studies for additional antecedents or contexts that moderate this particular mode of use, we suggest a reflexive pause regarding the notion of IT acceptance itself. Specifically, we encourage broadening our understanding of IT acceptance toward a wider constellation of behavioral usage and its psychological counterparts. Other aspects of usage behavior or post hoc usage evaluation such as infusion, routinization, substantive use, exploitive usage, or faithfulness of appropriation have recently emerged and will likely require/involve other psychological notions of acceptance ( Sundaram et al, forthcoming; Jones et al. 2002; Jasperson et al. 2005; Burton-Jones and Straub, 2006; Chin, et al. 1997). The call for this expansion is only made more salient by recent studies that indicate that the traditional TAM antecedents do not necessarily relate to these other forms of usage ( Jones et al. 2002) and, furthermore, that these alternative notions of usage such as routinization or infusion may have stronger connection to performance outcomes ( Sundaram et al., forthcoming).

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


Influence of different transition zones on the dynamic response of tracksubgrade systems A railway tracksubgrade system is modeled using the finite element method (FEM). Two different transition zones between a bridge and an ordinary subgrade, usually used for high speed passenger lines in China, are investigated. Both the calculated vertical displacement and acceleration of the rail and the slab and the calculated vertical displacement and the stress of the subgrade surface of the two transition zones are compared. The dynamic response of the two-part transition section is better than that of the inverted trapezoid transition section, and a 30-m length of both transition sections is recommended. The dynamic response of the tracksubgrade system changes abruptly after the first 3m of the transition section, measured from the bridge abutment. Special attention should be given to this critical zone during construction.

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

finite element method
dynamic response
tracksubgrade system

track transition zone
track stiffness distribution


CORRECTION OF REGRESSION PREDICTIONS USING THE SECONDARY LEARNER ON THE SENSITIVITY ANALYSIS OUTPUTS For a given regression model, each individual prediction may be more or less accurate. The average accuracy of the system cannot provide the error estimate for a single particular prediction, which could be used to correct the prediction to a more accurate value. We propose a method for correction of the regression predictions that is based on the sensitivity analysis approach. Using predictions, gained in sensitivity analysis procedure, we build a secondary regression predictor whose task is to predict the signed error of the prediction which was made using the original regression model. We test the proposed methodology using four regression models: locally weighted regression, linear regression, regression trees and neural networks. The results of our experiments indicate significant increase of prediction accuracy in more than 20% of experiments. The favorable results prevale especially with the regression trees and neural networks, where locally weighted regression was used as a model for predicting the prediction error. In these experiments the prediction accuracy increased in 60% of experiments with regression trees and in 50% of experiments with neural networks, while the increase of the prediction error did not occur in any experiment.

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

regression
predictions
sensitivity analysis
prediction error
prediction accuracy


Mining events connections on the social web: Real-time instance matching and data analysis in EventMedia Event and media services have recently witnessed a rapid growth driving the way people explore information of interest. A significant amount of social calendars, media memes and background knowledge are daily created on various platforms, conveying event clues or past users experience. Mining, in real-time, the connection of these distributed data fragments provides a key advantage not only to deliver enriched views, but also to gain insight into interesting sociological aspects. To this aim, we harness the power of Semantic Web technologies as means to easily steer the data integration and analysis. Our overall goal is to build a web-based environment that allows users to discover meaningful, surprising or entertaining connections between events, media and people. In this paper, we present EventMedia, a platform that provides descriptions of events associated with media, and interlinked with the Linked Data cloud. It draws on a live data update and a real-time interlinking to face the natural dynamics of events. A user-friendly interface has been designed to meet the user needs: relive experiences based on media and support decision making for attending upcoming events.

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

lode ontology
real-time
event-based social network


modeling and simulating a disease outbreak by learning a contagion parameter-based model Various advanced disease-surveillance models have been developed to provide early detection of infectious disease outbreaks and bioterrorist attacks. New methods that increase the overall detection capabilities of these systems can have a broad practical impact. This paper considers the problem of learning the Contagion Parameter (CP) in a black box model involving healthy, sick and contagious individuals. We base our study on a well-established model of contagion that is characterized by certain fixed parameters, some of which are known, while others are assumed unknown. In the modelling process, we assume that the individuals randomly move within a discretized grid, possibly infecting people or getting infected if they come in contact with healthy/sick individuals. In our study, the parameter of interest involves ? which is the probability with which an infected person will transmit the disease to a healthy person. By invoking a novel learning strategy, we show how the CP can be computed using a Training and Testing phase. The results obtained by simulations are very impressive, and are pioneering to the best of our knowledge. The policy-related implications for the contagion control and disease outbreak are also open and very challenging.

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

policies in epidemiology
stochastic point location
learning automata


Embedded holonic fault diagnosis of complex transportation systems The use of electronic equipment and embedded computing technologies in modern complex transportation systems continues to grow in a highly competitive market, in which product maintainability and availability is vital. These technological advances also make fault diagnosis and maintenance interventions much more challenging, since these operations require a deep understanding of the entire system. This paper proposes a holonic cooperative fault diagnosis approach, along with a generic architecture, to increase the embedded diagnosis capabilities of complex transportation systems. This concept is applied to the fault diagnosis of door systems of a railway transportation system. (C) 2012 Elsevier Ltd. All rights reserved.

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

embedded diagnosis
cooperative fault diagnosis
railway transportation system

holonic architecture
model-based diagnosis
corrective maintenance


image annotation refinement using random walk with restarts Image annotation plays an important role in image retrieval and management. However, the results of the state-of-the-art image annotation methods are often unsatisfactory. Therefore, it is necessary to refine the imprecise annotations obtained by existing annotation methods. In this paper, a novel approach to automatically refine the original annotations of images is proposed. On the one hand, for Web images, textual information, e.g. file name and surrounding text, is used to retrieve a set of candidate annotations. On the other hand, for non-Web images that are lack of textual information, a relevance model-based algorithm using visual information is used to decide the candidate annotations. Then, candidate annotations are re-ranked and only the top ones are reserved as the final annotations. To re-rank the annotations, an algorithm using Random Walk with Restarts (RWR) is proposed to leverage both the corpus information and the original confidence information of the annotations. Experimental results on both non-Web images of Corel dataset and Web images of photo forum sites demonstrate the effectiveness of the proposed method.

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

web
photo
relevance
paper
random walk with restarts
management
role
image annotation refinement
method
image annotation
annotation
text
demonstrate
image retrieval
algorithm
refine

art
imaging
model
informal
random walks
visualization
experimentation
effect
ranking


Dynamic task mapping for Network-on-Chip based systems Efficiency of Network-on-Chip (NoC) based multi-processor systems largely depends on optimal placement of tasks onto processing elements (PEs). Although number of task mapping heuristics have been proposed in literature, selecting best technique for a given environment remains a challenging problem. Keeping in view the fact that comparisons in original study of each heuristic may have been conducted using different assumptions, environment, and models. In this study, we have conducted a detailed quantitative analysis of selected dynamic task mapping heuristics under same set of assumptions, similar environment, and system models. Comparisons are conducted with varying network load, number of tasks, and network size for constantly running applications. Moreover, we propose an extension to communication-aware packing based nearest neighbor (CPNN) algorithm that attempts to reduce communication overhead among the interdependent tasks. Furthermore, we have conducted formal verification and modeling of proposed technique using high level Petri nets. The experimental results indicate that proposed mapping algorithm reduces communication cost, average hop count, and end-to-end latency as compared to CPNN especially for large mesh NoCs. Moreover, proposed scheme achieves up to 6% energy savings for smaller mesh NoCs. Further, results of formal modeling indicate that proposed model is workable and operates according to specifications.

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

network-on-chip (noc)
multiprocessor system-on-chip (mpsoc)


An innovative microwave system for wooden art object disinfestation Purpose - Many objects made up of wood, as well as paper and carpets with artistic or cultural value, are seriously damaged by various infesting microorganisms and often such damage is irreversible. The purpose of this paper is to describe an equipment which has been realized, able to induce, inside the object to be treated, having any shape, and in particular in the infesting agents, a uniform distribution of temperature. Design/methodology/approach - The equipment consists of a metallic shielding chamber where the objects to be disinfested are placed. Here, through appropriate openings in the walls, electromagnetic energy at the frequency of the microwaves is introduced. The electromagnetic waves provoke a heating effect in the infesting biological forms with no significant thermal effects in the materials of the artistic object due to the different dielectric characteristics and to the very little percentages of water in them. Findings - The uniform distribution of temperature guarantees that the organisms or the microorganisms are heated up over their lethal temperature while the temperature reached by the object and its spatial variations do not provoke deformations. Practical implications - The current technologies employed in disinfestation of works of art present big limits as regards excessive treatment times, risks of pollution both for the operator and for the environment and possible damage to the treated objects. Originality/value - This new system described in the paper gives complete effectiveness of disinfestation, with a rapid treatment,, without damage to the objects, with total protection for the operators and the possibility of re-using the object immediately after the disinfestation process.

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

micro-organisms
electromagnetic induction
microwaves ovens
reverberating chamber


Design and implementation of dual processor block with shared external cache memory The availability of low cost, high performance microprocessors has led to various designs of shared memory multiprocessor systems. As a result, commercial products which are based on shared memory have been proliferated. Such a multiprocessor system is heavily influenced by the structure of memory system and it is not difficult to find that most configurations include local cache memories. The more processors a system carries, the larger local cache memory is needed to maintain the traffic to and from the shared memory at reasonable level. The implementation of local cache memories, however, is not a simple task because of environmental limitations. In particular, the general lack of board space availability presents a formidable problem. A cache memory system usually needs space mostly to support its complex control logic circuits for the cache itself and network interfaces like snooping logic circuits for shared bus. Although packaging can be made denser to reduce system size, there are still multiple processors per board. It requires a more area-efficient cache memory architecture. This paper presents a design of shared cache for dual processor board of bus-based symmetric multiprocessors. The design and implementation issues are described first and then the evaluation and measurement results are discussed. The shared cache proposed in this paper has been determined to be quite area-efficient without the significant loss of throughput and scalability. It has been implemented as a plug-in unit for TICOM, a prevalent commercial multiprocessor system.

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

multiprocessor
ticom
shared cache
shared bus

on-chip cache
bus utilization
pipelined bus protocol


garbage collection of timestamped data in stampede Stampede is a parallel programming system to facilitate the programming of interactive multimedia applications on clusters of SMPs. In a Stampede application, a variable number of threads can communicate data items to each other via channels , which are distributed, synchronized data structures containing timestamped data such as images from a video camera. Channels are not queue-like: threads may produce and consume items out of timestamp order; they may produce and consume items sparsely (skipping timestamps), and multiple threads (including newly created threads) may consume an item in a channel. These flexibilities are required due to the complex dynamic parallel structure of applications, to support increased parallelism, and because of real-time requirements. Under these circumstances, a key issue is the garbage collection condition: When can an item in a channel be garbage collected? In this paper we specify precisely Stampede's semantics concerning timestamps, and we describe two associated garbage collection conditions& a weak condition, and a more expensive but stronger condition. We then describe a distributed, concurrent algorithm that implements these two GC conditions. We present performance numbers that show little or no application-level performance penalty to using this algorithm for aiding automatic garbage collection in a cluster. We conclude with some remarks about the implementation in the Stampede system.

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

requirements
applications
video
performance
data structures
camera
paper
interactive multimedia
timestamp
structure
parallel
dynamic
implementation
data
support
algorithm
distributed
cluster

communication
synchronization
association
collect
imaging
real-time
thread
variability
program
systems
semantic
parallel programming
concurrency
complexity


A constructive version of Birkhoffs ergodic theorem for Martin-Lof random points We prove the effective version of Birkhoffs ergodic theorem for Martin-Lof random points and effectively open sets, improving the results previously obtained in this direction (in particular those of Vyugin, Nandakumar and Hoyrup, Rojas). The proof consists of two steps. First, we prove a generalization of Kucera's theorem, which is a particular case of effective ergodic theorem: a trajectory of a computable ergodic mapping that starts from a random point cannot remain inside an effectively open set of measure less than 1. Second, we show that the full statement of the effective ergodic theorem can be reduced to this special case. Both steps use the statement of classical ergodic theorem. but not its usual classical proof. Therefore, we get a new simple proof of the effective ergodic theorem (with weaker assumptions than before). This result was recently obtained independently by Franklin, Greenberg, Miller and Ng. (C) 2011 Elsevier Inc. All rights reserved.

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

algorithmic randomness
poincare recurrence theorem
martin-lof randomness


AAM-based segmentation for imaging cardiac electrophysiology Objectives. Activation time (AT) imaging from electrocardiographic (ECG) mapping data has been developing for several years. By coupling 4-dimensional volume data (31) + time) the electrical sequence can be computed non-invasively. In this paper an approach for extracting the ventricular and atrial blood mosses for structurally normal hearts by using cine-gated short-axis data obtained via magnetic resonance imaging (MRI) is introduced. Methods: The blood mosses are extracted by employing Active Appearance Models (AAMs). The ventricular blood masses are segmented, applying the AAMs after providing apex cordis and base of the heart in the volume data, whereas the more complex geometry of the atria requires a more specific attempt. On account of this the atrium was divided into three divisions of appearance, where the images of the volume data in the related divisions have a maximum affinity. The first division reaches from the base of the heart to initial visibility of the upper and left lower pulmonary vein. The second division up from there to the lost occurrence and the third division from there to the end of the visibility of the right upper and lower pulmonary vein. After extracting the cardiac blood mosses the result gets triangulated and remeshed for activation time imaging. Results: With this method the cardiac models of eight patients were extracted and the AT imaging approach was applied to single-beat ECG data of atrial and ventricular depolorization. Conclusion: The advantage of the proposed AAM approach is that only a few initial parameters have to be set. Therefore, the approach can be integrated into a processing pipeline that works semi-automotically. The extracted models can be used for further investigations.

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


Use of neural networks in the condition monitoring of ground anchorages The GRANIT1 system is a non-destructive integrity testing method for ground anchorages. It has won two major UK Awardsthe Design Council Millennium Product Status in 1999 and the John Logie Baird Award in 1997. It makes use of novel artificial intelligence techniques in order to learn the complicated relationship that exists between an anchorage and its frequency response to an impulse. The GRANIT system has a worldwide patent and is currently licensed to AMEC plc. It is widely recognised that non-destructive testing methods for ground anchorages need to be developed as a high priority [A National Agenda for Long-term and Fundamental Research for Civil Engineering in the United Kingdom (1992)], with only between 1 and 5% of anchorages currently being monitored in service [British Standard Code of Practice for Ground Anchorages (8081) (1989)] using currently available techniques. The GRANIT system is a solution for this requirement, and this paper describes how the use of artificial intelligence techniques enabled, for the first time, the cross-anchorage diagnosis of ground anchorages, where data taken from one anchorage was used to train a neural network, which was then used to diagnose the condition of an adjacent anchorage. The results presented in this paper describe the training of a neural network on data taken from a bolt anchorage, and the diagnosis, using this neural network, of further test data taken from the same anchorage. Data taken from an adjacent anchorage of similar construction is also presented to the neural network, and the cross-anchorage diagnosis of the load level of the second anchorage is achieved.

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

artificial intelligence
condition monitoring
ground anchorages

dynamic response
non-destructive testing
vibration


How to correct inner filter effects altering 3D fluorescence spectra by using a mirrored cell In this paper we present a new correction method of inner filter effects that occurs when measuring fluorescence Excitation-Emission Matrices (EEM) of concentrated solutions. While traditional method requires absorption measurement or sample dilution(s), the Mirrored Cell Approach (MCA) only requires two different EEM of the considered sample: a first one using a traditional cell and a second one using a mirrored cell. The mathematical relationship between both models is originally exploited to obtain a simple numerical correction. Method is validated using a set of known mixtures. In addition we show that advanced multilinear analysis can be efficiently applied on to the corrected EEM. (C) 2013 Elsevier B.V. All rights reserved.

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

eem
inner filter effects
fluorescence
mirrored cell


Optimal Sparse Matrix Dense Vector Multiplication in the I/O-Model We study the problem of sparse-matrix dense-vector multiplication (SpMV) in external memory. The task of SpMV is to compute y :=Ax, where A is a sparse N x N matrix and x is a vector. We express sparsity by a parameter k, and for each choice of k consider the class of matrices where the number of nonzero entries is kN, i.e., where the average number of nonzero entries per column is k. We investigate what is the external worst-case complexity, i.e., the best possible upper bound on the number of I/Os, as a function of k, N and the parameters M (memory size) and B (track size) of the I/O-model. We determine this complexity up to a constant factor for all meaningful choices of these parameters, as long as k = B(1+epsilon), the I/O complexity is O(kN/B max{1, log(M/B) N/max{k, M}}) for A in column major layout.

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

sparse matrix dense vector multiplication

i/o-model
external memory algorithms
lower bound


Adaptive fractal image sequence coding by variable shape decomposition A two-phase fractal image sequence compression system is proposed. In the classification phase, according to the texture attribution a testing solid image block is assigned to its corresponding texture class. The texture attribution is derived from the tomographic block projection classification for the finite projection directions at the three-dimensional (3D) space. In the adaptive coding phase, both the algorithm of the 3D projection classification and the 3D variable shape decomposition are incorporated into the variable shape block transformation for image sequence. By applying this variable shape block transformation algorithm to fractal image sequence coding scheme, we can obtain a promising performance.

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

fractal image sequence coding
variable shape decomposition
variable shape block

computerized tomographic image reconstruction


review recommendation with graphical model and em algorithm Automatically assessing the quality and helpfulness of consumer reviews is more and more desirable with the evolutionary development of online review systems. Existing helpfulness assessment methodologies make use of the positive vote fraction as a benchmark and heuristically find a "best guess" to estimate the helpfulness of review documents. This benchmarking methodology ignores the voter population size and treats the the same positive vote fraction as the same helpfulness value. We propose a review recommendation approach that make use of the probability density of the review helpfulness as the benchmark and exploit graphical model and Expectation Maximization (EM) algorithm for the inference of review helpfulness. The experimental results demonstrate that the proposed approach is superior to existing approaches.

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

online review
recommendation
helpfulness