VHDL-AMS based modeling and simulation of mixed-technology microsystems: a tutorial ? This tutorial paper describes different approaches to modeling and simulation of mixed-technology microsystems that consist of electrical circuits connected to subsystems described by partial differential equations (PDEs), which is a typical situation in many modern integrated circuits and systems. We target this paper towards the audience use of VHDL-AMS (a hardware description language suitable for modeling and simulation of such systems). We describe existing approaches to modeling such systems and present three examples accompanied by their VHDL-AMS implementations and simulation results.

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


Neurologial interpretations and the information in the cognitive pupillary response It has been known for 70 years that the human pupil dilates when a person responds to a cognitive task. Further, it is known that parasympathetic pupillary innervation decreases with raised attention state while sympathetic innervation increases, But the information the pupil transmits during elevated attention states about such neurological dynamics and a quantitative measure of this information have defied statistical modelling, Now we describe experiments using a short-term memory task called an acoustic impulse test in which the pupillary dynamics in response to random acoustic impulses are recorded with a high resolution (0.01mm) pupillometer with the result that parasympathetic and sympathetic pupillary dilation components are quantifiable, as is the information transmitted by these components.

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


A view of averaging aggregation operators Aggregation operators have been used and studied for a long time. More than ten different types of means (including the arithmetic, geometric, and harmonic ones) were already studied 2000 years ago. Nevertheless, this topic has gained relevance in recent years. This is partly due to the increasing need of methods and operators for fusing information within computer programs. In this paper, we will present a personal view of the field, focusing on the application issues and on averaging aggregation operators. We will point out some research topics and open lines for future research.

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

applications
decision models
fuzzy integrals
fuzzy measures


Nonlinear model and constrained ML for removing back-to-front interferences from recto-verso documents In this paper, we approach the removal of back-to-front interferences from scans of double-sided documents as a blind source separation problem, and extend our previous linear mixing model to a more effective nonlinear mixing model. We consider the front and back ideal images as two individual patterns overlapped in the observed recto and verso scans, and apply an unsupervised constrained maximum likelihood technique to separate them. Through several real examples, we show that the results obtained by this approach are much better than the ones obtained through data decorrelation or independent component analysis. As compared to approaches based on segmentation/classification, which often aim at cleaning a foreground text by removing all the textured background, one of the advantages of our method is that cleaning does not alter genuine features of the document, such as color or other structures it may contain. This is particularly interesting when the document has a historical importance, since its readability can be improved while maintaining the original appearance. (C) 2011 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O

document restoration
nonlinear data model
back-to-front interferences


Connectivity preserving transformations for higher dimensional binary images An N N -dimensional digital binary image (I I ) is a function I:ZN?{0,1} I : Z N ? { 0 , 1 } . I I is B 3 N ? 1 , W 3 N ? 1 connected if and only if its black pixels and white pixels are each (3N?1 3 N ? 1 )-connected. I I is only B 3 N ? 1 connected if and only if its black pixels are (3N?1 3 N ? 1 )-connected. For a 3-D binary image, the respective connectivity models are B 26 , W 26 and B 26 . A pair of (3N?1 3 N ? 1 )-neighboring opposite-valued pixels is called interchangeable in a N N -D binary image I I , if reversing their values preserves the original connectedness. We call such an interchange to be a (3N?1) ( 3 N ? 1 ) -local interchange. Under the above connectivity models, we show that given two binary images of n n pixels/voxels each, we can transform one to the other using a sequence of (3N?1) ( 3 N ? 1 ) -local interchanges. The specific results are as follows. Any two B 26 -connected 3-dimensional images I I and J J each having n n black voxels are transformable using a sequence of O((c1+c2)n2) O ( ( c 1 + c 2 ) n 2 ) 26-local interchanges. Here, c1 c 1 and c2 c 2 are the total number of 8-connected components in all 2-dimensional layers of I I and J J respectively. We also show bounds on B 26 connectivity under a different interchange model as proposed in [A. Dumitrescu, J. Pach, Pushing squares around, Graphs and Combinatorics 22 (1) (2006) 3750]. Next, we show that any two simply connected images under the B 26 , W 26 connectivity model and each having n n black voxels are transformable using a sequence of O(n2) O ( n 2 ) 26-local interchanges. We generalize this result to show that any two B 3 N ? 1 , W 3 N ? 1 -connected N N -dimensional simply connected images each having n n black pixels are transformable using a sequence of O(Nn2)(3N?1) O ( N n 2 ) ( 3 N ? 1 ) -local interchanges, where N>1 N > 1 .

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 B I O O O B I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 image transformation
ip-equivalence


DC offset calibration method for zero-IF receiver removing the PGA-gain-correlated offset residue This paper presents a novel DC offset calibration method for the zero-IF (intermediate frequency) receiver that removes the PGA-gain-correlated offset residue. The conventional calibration method usually uses the classic input/output referred offset model, in which the receiver IF programmable gain amplifiers (PGAs) have offset sources that varies a lot with different gain settings. Consequently, the conventional calibration method needs to generate the calibration code at each gain step and requires a huge look up table (LUT) to store the calibration values. This paper presents a new DC offset model which is gain non-correlated, by analyzing two types of commonly used PGA. Based on the new model, a LUT-free single-step DC offset calibration method in together with the implementation circuit is designed. The proposed method has been verified on a practical zero-IF receiver circuit in a standard 0.18?m CMOS technology through the Monte Carlo (MC) simulation. The simulation results show that the receiver IF output offset residue after calibration using the proposed method is reduced to below 12mV, in contrast to 200mV by the conventional method.

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

dc-offset calibration
successive approximation
zero-if receiver


augmentation techniques for efficient exploration in head-mounted display environments Physical characteristics and constraints of today's head-mounted displays (HMDs) often impair interaction in immersive virtual environments (VEs). For instance, due to the limited field of view (FOV) subtended by the display units in front of the user's eyes more effort is required to explore a VE by head rotations than for exploration in the real world. In this paper we propose a combination of two augmentation techniques that have the potential to make exploration of VEs more efficient: (1) augmenting the geometric FOV (GFOV) used for rendering the VE, and (2) amplifying head rotations while the user changes her head orientation. In order to identify how much manipulation can be applied without users noticing, we conducted two psychophysical experiments in which we analyzed subjects' ability to discriminate between virtual and real head pitch and roll rotations while three different geometric FOVs were used. Our results show that the combination of both techniques has great potential to support efficient exploration of VEs. We found that virtual pitch and roll rotations can be amplified by 30\% and 44\% respectively, when the GFOV matches the subject's estimation of the most natural FOV. This leads to a possible reduction of the user's effort required to explore the VE using a combination of both techniques by approximately 25\%.

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

geometric field of view
head motion perception
head-mounted displays


A multiple model approach to nonlinear internal model control design A nonlinear internal model control (NIMC) design using multiple model is proposed. In this design approach, the process model is described via validity functions as the weighted sum of a set of local models. Subsequently, an approximate inverse of the process model is constructed in order to design NIMC controller. It is shown that the validity functions can be treated as time-varying uncertainties in the resultant NIMC structure, and a structured singular value test for mixed time-varying and time-invariant perturbations is used to assess the performance limitation of the proposed NIMC design. Simulation results of a continuous stirred tank reactor illustrate that the proposed NIMC design method is superior to the conventional IMC design.

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

internal model control
structured singular value

global multiple model
robust control
time-varying perturbation
model validity function


De-blocking artifacts in DCT domain using projection onto convex sets algorithm Based on the theory of block projection onto convex sets (BPOCS), a novel de-blocking algorithm is proposed. A new smoothness constraint set (SCS) is used to remove the unnecessary high frequencies. In addition, an adaptive quantization constraint set (AQCS) is employed to suppress error in the smoothing process. The proposed size and position of new SCS are different from traditional ones. Extensive experimental results are provided to demonstrate that the proposed method can achieve better image quality with fewer iterations.

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


Experimental program analysis ? Program analysis techniques are used by software engineers to deduce and infer characteristics of software systems. Recent research has suggested that certain program analysis techniques can be formulated as formal experiments. This article reports the results of research exploring this suggestion. Building on principles and methodologies underlying the use of experimentation in other fields, we provide descriptive and operational definitions of experimental program analysis, illustrate them by example, and describe several differences between experimental program analysis and experimentation in other fields. We also explore the applicability of experimental program analysis to three software engineering problems: program transformation, program debugging, and program understanding. Our findings indicate that experimental program analysis techniques can provide new and potentially improved solutions to these problems, and suggest that experimental program analysis offers a promising new direction for program analysis research.

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

experimental program analysis
program analysis
experimentation


Radiometric normalization and cloud detection of optical satellite images using invariant pixels Clouds in optical satellite images can be a source of information for water measurement or viewed as contaminations that obstruct landscape observations. Thus, the use of a cloud detection method that discriminates cloud and clear-sky pixels in images is necessary in remote sensing applications. With the aid of radiometric correction/normalization, previous methods utilized temporal and spectral information as well as cloud-free reference images to develop threshold-based cloud detection filters. Although this strategy can effectively identify cloud pixels, the detection accuracy mainly relies on the successful radiometric correction/normalization and reference image quality. Relative radiometric normalization generally suffers from cloud covers, while multi-temporal cloud detection is sensitive to the radiometric normalization quality. Thus, the current study proposes a method based on weighted invariant pixels for both processes. A set of invariant pixels is extracted from a time series of cloud-contaminated images by using the proposed weighted principle component analysis, after which multi-temporal images are normalized with the selected invariant pixels. In addition, a reference image is generated for each cloud-contaminated image using invariant pixels with a weighting scheme. In the experiments, image sequences acquired by the Landsat-7 Enhanced Thematic Mapper Plus sensor are analyzed qualitatively and quantitatively to evaluate the proposed method. Experimental results indicate that F-measures of cloud detections are improved by 1.16.9% using the generated reference images.

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

cloud detection
radiometric normalization


Artificial immune systems as a novel soft computing paradigm Artificial immune systems (AIS) can be defined as computational systems inspired by theoretical immunology, observed immune functions, principles and mechanisms in order to solve problems. Their development and application domains follow those of soft computing paradigms such as artificial neural networks (ANN), evolutionary algorithms (EA) and fuzzy systems (FS). Despite some isolated efforts, the field of AIS still lacks an adequate framework for design, interpretation and application. This paper proposes one such framework, discusses the suitability of AIS as a novel soft computing paradigm and reviews those works from the literature that integrate AIS with other approaches, focusing ANN, EA and FS. Similarities and differences between AIS and each of the other approaches are outlined. New trends on how to create hybrids of these paradigms and what could be the benefits of this hybridization are also presented.

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

hybrid intelligent systems
survey of hybrids


How will telecommunications bundles impact competition and regulatory analysis? In this article, one makes two points about the impact of bundles on competition and regulatory policy. First, one argues that the growing importance of bundles requires an adjustment in the current framework of relevant product markets for individual services, and that the traditional tools of competition policy, namely the SSNIP test, can be adjusted to deal with these new circumstances. Second, one argues that the technological and behavioral changes, underlying the emergence of bundles, call for a shift of emphasis in regulatory policy from ensuring access to the incumbents fixed telecommunications network services to ensuring access to television content.

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


Universal compression of Markov and related sources over arbitrary alphabets Recent work has considered encoding a string by separately conveying its symbols and its pattern-the order in which the symbols appear. It was shown that the patterns of independent and identically distributed (i.i.d.) strings can be losslessly compressed with diminishing per-symbol redundancy. In this correspondence, the pattern redundancy of distributions with memory is considered. Close lower and upper bounds are established on the pattern redundancy of strings generated by Hidden Markov models (HMMs) with a small number of states, showing in particular that their per-symbol pattern redundancy diminishes with increasing string length. The upper bounds are obtained by analyzing the growth rate of the number of multidimensional integer partitions, and the lower bounds, using Hayman's theorem.

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

integer partitions
patterns
redundancy
universal compression

hidden markov models (hmms)
large alphabets
multidimensional partitions


Maximizing the entropy of a sum of independent bounded random variables Let X-1,..., X-n be n independent, symmetric random variables supported on the interval [-1,1] and let S-n = Sigma(n)(i=1) X-i be their sum. We show that the differential entropy of Sn is maximized when X-1,..., Xn-1 are Bernoulli taking on +1 or -1 with equal probability and X-n is uniformly distributed.

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

bounded random variables
differential entropy

majorization
multiple-access channel
schur convexity


Highlighted Depth-of-Field Photography: Shining Light on Focus We present a photographic method to enhance intensity differences between objects at varying distances from the focal plane. By combining a unique capture procedure with simple image processing techniques, the detected brightness of an object is decreased proportional to its degree of defocus. A camera-projector system casts distinct grid patterns onto a scene to generate a spatial distribution of point reflections. These point reflections relay a relative measure of defocus that is utilized in postprocessing to generate a highlighted DOF photograph. Trade-offs between three different projector-processing pairs are analyzed, and a model is developed to help describe a new intensity-dependent depth of field that is controlled by the pattern of illumination. Results are presented for a primary single snapshot design as well as a scanning method and a comparison method. As an application, automatic matting results are presented.

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

design
depth of field
matting
image processing

algorithms
computational photography
hdof photo
active illumination


Complexity-regularized image denoising We study a new approach to image denoising based on complexity regularization, This technique presents a flexible alternative to the more conventional l(2), l(1), and Besov regularization methods, Different complexity measures are considered, in particular those induced by state-of-the-art image coders. We focus on a Gaussian denoising problem and derive a connection between complexity-regularized denoising and operational rate-distortion optimization. This connection suggests the use of efficient algorithms for computing complexity-regularized estimates. Bounds on denoising performance are derived in terms of an index of resolvability that characterizes the compressibility of the true image. Comparisons with state-of-the-art denoising algorithms are given.

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

image compression
image restoration
minimum description length principle
rate-distortion optimization
wavelets


A new model of conceptual design based on Scientific Ontology and intentionality theory. Part I: The conceptual foundation With the Scientific Ontology, some basic concepts (e.g., behavior) are clarified. Based on an intentionality theory, the concept of (design) need is clarified. An explicit concept of function is derived for conceptual design research. An explicit concept of abstract principle is given for design research.

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

design theory
philosophy of design
design science
engineering design


Label propagation based semi-supervised non-negative matrix factorization for feature extraction As a feature extraction method, Non-negative Matrix Factorization (NMF) has attracted much attention due to its effective application to data classification and clustering tasks. In this paper, a novel algorithm named Label propagation based Semi-supervised Non-negative Matrix Factorization (LpSNMF) is proposed. For the sake of making full use of label information, our LpSNMF algorithm takes the distribution relationships between the labeled and unlabeled data samples into consideration and integrates the procedures of class label propagation and matrix factorization into a joint framework. Moreover, an iterative updating optimization scheme is developed to solve the objective function of the proposed LpSNMF and the convergence of our scheme is also proven. Extensive experimental results on several UCI benchmark data sets and four image data sets (such as Yale, CMU PIE, UMIST, and COIL20) demonstrate that by propagating the label information and factorizing the matrix alternately, our algorithm can obtain better performance than some other algorithms.

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

nmf
feature extraction
label propagation
lpsnmf
classification
clustering


An anticipative scheduling approach with controllable processing times In practice, machine schedules are usually subject to disruptions which have to be repaired by reactive scheduling decisions. The most popular predictive approach in project management and machine scheduling literature is to leave idle times (time buffers) in schedules in coping with disruptions, i.e. the resources will be under-utilized. Therefore, preparing initial schedules by considering possible disruption times along with rescheduling objectives is critical for the performance of rescheduling decisions. In this paper, we show that if the processing times are controllable then an anticipative approach can be used to form an initial schedule so that the limited capacity of the production resources are utilized more effectively. To illustrate the anticipative scheduling idea, we consider a non-identical parallel machining environment, where processing times can be controlled at a certain compression cost. When there is a disruption during the execution of the initial schedule, a match-up time strategy is utilized such that a repaired schedule has to catch-up initial schedule at some point in future. This requires changing machinejob assignments and processing times for the rest of the schedule which implies increased manufacturing costs. We show that making anticipative job sequencing decisions, based on failure and repair time distributions and flexibility of jobs, one can repair schedules by incurring less manufacturing cost. Our computational results show that the match-up time strategy is very sensitive to initial schedule and the proposed anticipative scheduling algorithm can be very helpful to reduce rescheduling costs.

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

anticipative scheduling
controllable processing times
reactive scheduling


computing minimum cost diagnoses to repair populated dl-based ontologies Ontology population is prone to cause inconsistency because the populating process is imprecise or the populated data may conflict with the original data. By assuming that the intensional part of the populated DL-based ontology is fixed and each removable ABox assertion is given a removal cost, we repair the ontology by deleting a subset of removable ABox assertions in which the sum of removal costs is minimum. We call such subset a minimum cost diagnosis. We show that, unless P=NP, the problem of finding a minimum cost diagnosis for a DL-Lite ontology is insolvable in PTIME w.r.t. data complexity. In spite of that, we present a feasible computational method for more general (i.e. SHIQ) ontologies. It transforms a SHIQ ontology to a set of disjoint propositional programs, thus reducing the original problem into a set of independent subproblems. Each such subproblem computes an optimal model and is solvable in logarithmic calls to a SAT solver. Experimental results show that the method can handle moderately complex ontologies with over thousands of ABox assertions, where all ABox assertions can be assumed removable.

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


Bregman Voronoi Diagrams The Voronoi diagram of a finite set of objects is a fundamental geometric structure that subdivides the embedding space into regions, each region consisting of the points that are closer to a given object than to the others. We may define various variants of Voronoi diagrams depending on the class of objects, the distance function and the embedding space. In this paper, we investigate a framework for defining and building Voronoi diagrams for a broad class of distance functions called Bregman divergences. Bregman divergences include not only the traditional (squared) Euclidean distance but also various divergence measures based on entropic functions. Accordingly, Bregman Voronoi diagrams allow one to define information-theoretic Voronoi diagrams in statistical parametric spaces based on the relative entropy of distributions. We define several types of Bregman diagrams, establish correspondences between those diagrams (using the Legendre transformation), and show how to compute them efficiently. We also introduce extensions of these diagrams, e.g., k-order and k-bag Bregman Voronoi diagrams, and introduce Bregman triangulations of a set of points and their connection with Bregman Voronoi diagrams. We show that these triangulations capture many of the properties of the celebrated Delaunay triangulation.

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

voronoi diagram
delaunay triangulation
legendre transformation

computational information geometry
bregman divergence
bregman ball


Light field transfer: Global illumination between real and synthetic objects We present a novel image-based method for compositing real and synthetic objects in the same scene with a high degree of visual realism. Ours is the first technique to allow global illumination and near-field lighting effects between both real and synthetic objects at interactive rates, without needing a geometric and material model of the real scene. We achieve this by using a light field interface between real and synthetic components-thus, indirect illumination can be simulated using only two 4D light fields, one captured from and one projected onto the real scene. Multiple bounces of inter-reflections are obtained simply by iterating this approach. The inter-activity of our technique enables its use with time-varying scenes, including dynamic objects. This is in sharp contrast to the alternative approach of using 6D or 8D light transport functions of real objects, which are very expensive in terms of acquisition and storage and hence not suitable for real-time applications. In our method, 4D radiance fields are simultaneously captured and projected by using a lens array, video camera, and digital projector. The method supports full global illumination with restricted object placement, and accommodates moderately specular materials. We implement a complete system and show several example scene compositions that demonstrate global illumination effects between dynamic real and synthetic objects. Our implementation requires a single point light source and dark background.

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

augmented reality
image-based relighting


application-aware management of parallel simulation collections This paper presents a system deployed on parallel clusters to manage a collection of parallel simulations that make up a computational study. It explores how such a system can extend traditional parallel job scheduling and resource allocation techniques to incorporate knowledge specific to the study. Using a UINTAH-based helium gas simulation code (ARCHES) and the SimX system for multi-experiment computational studies, this paper demonstrates that, by using application-specific knowledge in resource allocation and scheduling decisions, one can reduce the run time of a computational study from over 20 hours to under 4.5 hours on a 32-processor cluster, and from almost 11 hours to just over 3.5 hours on a 64-processor cluster.

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

parallel system
high-throughput computing


massively parallel isosurface extraction We describe experiences during the investigation of parallel methods for faster isosurface generation on SIMD machines. A sequential version of a well known isosurfacing algorithm is algorithmically enhanced for a particular type of SIMD architecture. The SIMD implementation takes full advantage of the data parallel nature of the algorithm and experiments have proven the implementation to be highly scalable. A parallel tool, which can generate 170K polygons / second, gives scientists the means to explore large 3D scalar or vector fields interactively.

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

generation extraction parallel isosurface architecture implementation tool proven 3d version algorithm

vectorization
method
scalability
experience
data parallelism
exploration


design and analysis of compact ultra energy-efficient logic gates using laterally-actuated double-electrode nems Nano-Electro-Mechanical Switches (NEMS) are among the most promising emerging devices due to their near-zero subthreshold-leakage currents. This paper reports device fabrication and modeling, as well as novel logic gate design using "laterally-actuated double-electrode NEMS" structures. The new device structure has several advantages over existing NEMS architectures such as being immune to impact bouncing and release vibrations (unlike a vertically-actuated NEMS) and offer higher flexibility to implement compact logic gates (unlike a single-electrode NEMS). A comprehensive analytical framework is developed to model different properties of these devices by solving the Euler-Bernoulli's beam equation. The proposed model is validated using measurement data for the fabricated devices. It is shown that by ignoring the non-uniformity of the electrostatic force distribution, the existing models "underestimate" the actual value of V pull-in and V pull-out . Furthermore, novel energy efficient NEMS-based circuit topologies are introduced to implement compact inverter, NAND, NOR and XOR gates. For instance, the proposed XOR gate can be implemented by using only two NEMS devices compared to that of a static CMOS-based XOR gate that requires at least 10 transistors.

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

nano-electro-mechanical switches
steep-subthreshold switch
energy-efficient electronics
laterally-actuated nems
logic design
process variation


A fast algorithm for evaluation of normalized Hermite functions An algorithm for computing the normalized Hermite Functions, h(n)(x) in floating point arithmetic is presented. The algorithm is based on an efficient numerical evaluation of certain closed contour integrals in the complex plane. For large degree n, the algorithm is significantly faster than the O(n) complexity of the well known three term recurrence relation. Comparable accuracy is achieved in no more than O(v n) operations, and for arguments bounded away from +/-root 2n, only O(root ln n) operations.

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


Generalized extended fuzzy implications This paper is devoted to investigate generalized extended fuzzy implications in accordance with the generalized extension principle. The algebraic properties of generalized extended fuzzy implications are discussed on different algebras of fuzzy truth values. On this basis, fuzzy-valued fuzzy implications are constructed from arbitrary fuzzy implications and t-norms. Moreover, a fuzzy-valued fuzzy implication is identical with a generalized extended fuzzy implication on the algebra of fuzzy values, when they are induced by exactly the same continuous fuzzy implication and same upper semicontinuous t-norm.

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

generalized extended fuzzy implications
fuzzy values

type-2 fuzzy sets
type-2 fuzzy implications
fuzzy-valued fuzzy implications


Better approximation algorithms for influence maximization in online social networks Influence maximization is a classic and hot topic in social networks. In this paper, firstly we argue that in online social networks, due to the time sensitivity of popular topics, the assumption in IC or LT model that the influence propagates endlessly in the network, is not applicable. Based on this we consider influence transitivity and limited propagation distance in our new model. Secondly, under our model we propose Semidefinite based algorithms. While most existing algorithms rely on monotony and submodularity to obtain approximation ratio of \(1-1/e\), when no size limitation exists on the number of seeds, our algorithm achieves approximation ratio with \(0.857\), which is a great improvement. Moreover, when only a limited number of nodes can be chosen as seeds, based on computer-assisted proof, we claim our algorithm still keeps approximation ratio higher than \(1-1/e\) if the ratio of the seeds to the total number of nodes resides in a certain range. At last, we evaluate the effectiveness of our algorithms through extensive experiments on real world social networks.

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

semidefinite programming
approximation algorithm


agile regression testing using record & playback There are times when it is not practical to hand-script automated tests for an existing system before one starts to modify it (whether to refactor it to permit automated testing or to add new functionality). In these circumstances, the use of "record & playback" testing may be a viable alternative to handwriting all the tests.This paper describes experiences using this approach and summarizes key learnings applicable to other projects.

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

acceptance test
junit
robot user
functional test
user interface
patterns
best practices
xml


Packet Delay in UAV Wireless Networks Under Non-saturated Traffic and Channel Fading Conditions In this paper, we conduct a statistical analysis for the packet delay in a wireless network of unmanned aerial vehicles (UAVs) under non-saturated traffic and channel fading conditions. Each UAV runs the distributed coordination function of IEEE 802.11 at the medium access control layer, and all UAVs are one-hop neighbors. A pair of UAVs can communicate over the lossy wireless channel of a fixed data rate. A non-saturated traffic condition is used. By modeling each node UAV as a standard queueing system (i.e., \(M/M/1\) or \(M/G/1\) queue), we derive the mean packet delay under the non-saturated traffic condition. Numerical and simulation results show that the mean packet delay derived based on \(M/M/1\) queue is accurate for UAV wireless networks under the non-saturated traffic condition and with an independent packet error rate. It is observed that the mean packet delay increases with either the number of UAVs in the network or the packet generation rate. More important, existing results in the literature, based on the saturated traffic condition (i.e., packets are always supplied for transmission), tend to overestimate by a large amount the mean packet delay for networks with non-saturated traffic. In the second part of this paper, we apply simulation data to analysis of the probability distribution function of the packet delay when the packet error rate equals zero. Using a distribution fitting tool, we observe that the packet delay can be well approximated by the sum of a deterministic delay, which corresponds to the time period during which the UAV senses the medium and is able to perform a successful transmission, and a random delay, which follows a Gamma distribution function.

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

ieee 802.11 distributed coordination function (dcf)

queueing modeling and performance evaluation


Nefertiti: a query by content system for three-dimensional model and image databases management This paper presents a new approach for the classification and retrieval of three-dimensional images and models from databases. A set of retrieval algorithms is introduced. These algorithms are content-based, meaning that the input is not made out of keywords but of three-dimensional models. Tensors of inertia, distribution of normals, distribution of cords and multiresolution analysis are used to describe each model. The database can be searched by scale, shape or color or any combination of these parameters. A user-friendly interface makes the retrieval operation simple and intuitive and makes it possible to edit reference models according to the specifications of the user. Experimental results using a database of more than 400 range images and 1000 VRML models are presented (C) 1999 Elsevier Science B.V. All rights reserved.

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

object oriented database management system


UNCORRELATED LOCAL FISHER DISCRIMINANT ANALYSIS FOR FACE RECOGNITION An improved manifold learning method, called Uncorrelated Local Fisher Discriminant Analysis (ULFDA), for face recognition is proposed. Motivated by the fact that statistically uncorrelated features are desirable for dimension reduction, we propose a new difference-based optimization objective function to seek a feature submanifold such that the within-manifold scatter is minimized, and between-manifold scatter is maximized simultaneously in the embedding space. We impose an appropriate constraint to make the extracted features statistically uncorrelated. The uncorrelated discriminant method has an analytic global optimal solution, and it can be computed based on eigen decomposition. As a result, the proposed algorithm not only derives the optimal and lossless discriminative information, but also guarantees that all extracted features are statistically uncorrelated. Experiments on synthetic data and AT&T, extended YaleB and CMU PIE face databases are performed to test and evaluate the proposed algorithm. The results demonstrate the effectiveness of the proposed method.

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

face recognition
manifold learning
local fisher discriminant analysis

dimensionality reduction
uncorrelated constraint


A novel opposition-based gravitational search algorithm for combined economic and emission dispatch problems of power systems Gravitational search algorithm (GSA) is based on the law of gravity and interaction between masses. In GSA, the searcher agents are a collection of masses, and their interactions are based on the Newtonian laws of gravity and motion. This paper proposes a novel algorithm to accelerate the performance of the GSA. The proposed opposition-based GSA (OGSA) of the present work employs opposition-based learning for population initialization and also for generation jumping. In the present work, opposite numbers have been utilized to improve the convergence rate of the GSA. For the experimental verification of the proposed algorithm, a comprehensive set of 23 complex benchmark test functions including a wide range of dimensions is employed. Additionally, four standard power systems problems of combined economic and emission dispatch (CEED) are solved by the OGSA to establish the optimizing efficacy of the proposed algorithm. The results obtained confirm the potential and effectiveness of the proposed algorithm compared to some other algorithms surfaced in the recent state-of-the art literatures. Both the near-optimality of the solution and the convergence speed of the proposed algorithm are promising.

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

gravitational search algorithm
opposite numbers

benchmark test function
combined economic emission dispatch
optimization


Fast simulation of viscous fluids with elasticity and thermal conductivity using position-based dynamics Viscous fluids are simulated using position-based dynamics. Time steps can be set larger than those previously adopted for viscous fluid simulations. An associated boundary-handling scheme for position-based fluids precisely handles boundary conditions with constraints. Thermal conduction is considered for changes in properties and phase transition in materials. Materials with different properties can be simulated by adjusting parameters within a unified framework.

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

viscous fluid
elasticity
thermal conductivity

fluid simulation
position-based dynamics
geometric constraint


Web performance scale What does a high performance website look like? And how can we measure its performance? The present research develops and validates a new scale that measures Web performance as perceived by consumers. This scale discerns the formation of Web performance into the hedonic and utilitarian aspects reflecting Web users entertainment and information needs. Content domains for the two aspects were developed based on marketing and information systems literatures, and then tested for reliability and validity in two studies involving a total of 912 Web users. The measure was purified through exploratory and confirmatory factor analyses and MTMM models, resulting in one three-item scale for hedonic (reliability=0.867) and one four-item scale for utilitarian (reliability=0.850) Web performance. The scale thus developed not only has face validity, but also displays adequate construct reliability, convergent validity, discriminant validity, and nomological validity. It achieved reliability and validity using only seven items for the two aspects of Web performance making it highly feasible for implementation and particularly appealing to Web managers for tracking and improving site performance.

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


Hybrid functional- and instruction-level power modeling for embedded and heterogeneous processor architectures In this contribution the concept of functional- level power analysis (FLPA) for power estimation of programmable processors is extended in order to model embedded as well as heterogeneous processor architectures featuring different embedded processor cores. The basic FLPA approach is based on the separation of the processor architecture into functional blocks like, e.g. processing unit, clock network, internal memory, etc. The power consumption of these blocks is described by parameterized arithmetic models. By application of a parser based automated analysis of assembler codes the input parameters of the arithmetic functions like e.g. the achieved degree of parallelism or the kind and number of memory accesses can be computed. For modeling an embedded general purpose processor (here, an ARM940T) the basic FLPA modeling concept had to be extended to a so-called hybrid functional-level and instruction-level (FLPA/ILPA) model in order to achieve a good modeling accuracy. In order to show the applicability of this approach even a heterogeneous processor architecture (OMAP5912) featuring an ARM926EJ-S core and a C55x DSP core has been modeled using the hybrid FLPA/ILPA technique described before. The approach is exemplarily demonstrated and evaluated applying a variety of basic digital signal processing tasks ranging from basic filters to complete audio decoders or classical benchmark suits. Estimated power figures for the inspected tasks are compared to physically measured values for both inspected processor architectures. A resulting maximum estimation error of 9% for the ARM940T and less than 4% for the OMAP5912 is achieved.

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


Of XML and databases: Where's the beef? This panel will examine the implications of the XML revolution, which is currently raging on the web, for database systems research and development.

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


Reputation systems: A survey and taxonomy The concepts for reputation systems are discussed. A survey of existing reputation systems is presented. We construct a new taxonomy for reputation systems. We identify under-represented areas for research.

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


Multicue-Based Crowd Segmentation Using Appearance and Motion In this paper, our aim is to segment a foreground region into individual persons in crowded scenes. We will focus on the combination of multiple clues for crowd segmentation. To ensure a wide range of applications, few assumptions are needed on the scenarios. In the developed method, crowd segmentation is formulated as a process to group the feature points with a human model. It is assumed that a foreground region has been detected and that an informative foreground contour is not required. The approach adopts a block-based implicit shape model (B-ISM) to collect some typical patches from a human being and assess the possibility of their occurrence in each part of a body. The combination of appearance cues with coherent motion of the feature points in each individual is considered. Some results based on the USC-Campus sequence and the CAVIAR data set have been shown. The contributions of this paper are threefold. First, a new B-ISM model is developed, and it is combined with joint occlusion analysis for crowd segmentation. The requirement for an accurate foreground contour is reduced. In addition, ambiguity in a dense area can be handled by collecting the evidences inside the crowd region based on the B-ISM. Furthermore, motion cues-which are coherent moving trajectories of feature points from individuals" are combined with appearance cues to help segment the foreground region into individuals. The usage of motion cues can be an effective supplement to appearance cues, particularly when the background is cluttered or the crowd is dense. Third, three features have been proposed to distinguish points on rigid body parts from those with articulated movements. Coherent motion of feature points on each individual can be more reliably identified by excluding points with articulated motion.

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

implicit shape model (ism)
independent motion
occlusions


Performance analysis of E-shaped dual band antenna for wireless hand-held devices Due to evolution in wireless applications, the high performance dual band handsets were blooming in the market. In this paper, a compact dual band E shaped planar inverted F antenna is presented, which is suitable for GSM application in handheld devices. Here, antenna is described for GSM (900MHz and 1800MHz), which covers (831MHz 973MHz and 1700MHz 1918MHz) 10dB bandwidth. The designs and simulations are performed using Finite Difference Time Domain (FDTD) technique based General Electro Magnetic Simulator Version 7.9 (GEMS-7.9). The performance analysis of E-shaped antenna also includes real world interaction between antenna element and Spherical human head model composed of three layers, skin, skull and brain. The simulated results including, S-Parameter, radiation pattern, current distributions and Specific absorption rate, thermal distributions have validated the proposed E shaped antenna design as useful for compact mobile phone devices with comparatively low average Specific Absorption Rate in market.

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

gsm (global system for mobile communication)

general electro magnetic simulator (gems)


A new scheme for source term in LBGK model for convectiondiffusion equation A new scheme for source term in the lattice BGK (LBGK) model for convectiondiffusion equation is proposed. Unlike the models proposed previously, the present scheme only requires the source term in order of the Knudsen number by adding a differential operator of the source term to the evolution equation. The scheme can be applied to reactiondiffusion systems directly. Numerical results are found to be in excellent agreement with the analytical solutions. It is also found that the numerical accuracy of the present scheme is generally much better than that of the existing models.

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

convectiondiffusion equation with source


Electrical 1D tomography of nanofilaments using in-operando electrical characterization of Pt/NiO/Pt resistive memory cells during FIB milling In-operando electrical tomography is obtained using electrical measurements during FIB milling. In Pt/NiO/Pt resistive memory cells, the conducting nanofilament has a tree-like structure. This electrical shape is consistent with the crystalline defect map obtained from HRTEM. A subnanometric spatial resolution is achieved. An atomistic model involving oxygen vacancies is proposed.

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


Galerkin spectral method for the vorticity and stream function equations A Galerkin-Legendre spectral method for the solution of the vorticity and stream function equations in uncoupled form under no-slip conditions in a square domain is presented which fully exploits the separation of variables in the two elliptic problems, benefits from a nonsingular influence matrix, and is able to solve the singular driven cavity problem (modulo Gibbs' phenomenon) even without regularizing the boundary condition at the corners. (C) 1999 Academic Press.

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

galerkin-legendre spectral methods
navier-stokes equations
glowinski-pironneau method


Formation of micelle in the real-coded lattice gas We extend the Real-Coded Lattice Gas (RLG), which is a continuous lattice gas model for hydrodynamics (Malevanets, 1997), to simulate a multi-phase system with surfactants. We modeled the surfactant as a dumbbell-shaped particle, consisting of a set of hydrophilic and hydrophobic ends, and a rigid rod connecting in between. Based on this model, we carried our simulations of micelle formations in an aqueous environment. (C) 2000 Published by Elsevier Science B.V. All rights reserved.

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


Essential cycle calculation method for irregular array redistribution In many parallel programs, run-time array redistribution is usually required to enhance data locality and reduce remote memory access on the distributed memory multicomputers. In general, array distribution can be classified into regular distribution and irregular distribution according to the distribution fashion. Many methods for performing regular array redistribution have been presented in the literature. However, for the heterogeneous computation environment, irregular array redistributions can be used to adjust data assignment at run-time. In this paper, an Essential Cycle Calculation method for unequal block sizes array redistribution is presented. In the ECC method; a processor first computes the source/destination processor/data sets of array elements in the first essential cycle of the local array it owns. From the source/destination processor/data sets of array elements in the first essential cycle, we can construct packing/unpacking pattern tables. Since each essential cycle has the same communication pattern, based on the packing/unpacking pattern tables, a processor can pack/unpack array elements efficiently. To evaluate the performance of the ECC method, we have implemented this method on an IBM SP2 parallel machine and compare it with the Sequence method. The cost models for these methods are also presented. The experimental results show that the ECC method greatly outperforms the Sequence method for all test samples.

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

array redistribution
essential cycle calculation method
ecc
distributed memory multicomputers


The median function on graphs with bounded profiles ? The median of a profile ?=(u1,,uk) ? = ( u 1 , , u k ) of vertices of a graph G G is the set of vertices x x that minimize the sum of distances from x x to the vertices of ? ? . It is shown that for profiles ? ? with diameter ? ? the median set can be computed within an isometric subgraph of G G that contains a vertex x x of ? ? and the r r -ball around x x , where r>2??1?2?/|?| r > 2 ? ? 1 ? 2 ? / | ? | . The median index of a graph and r r -joins of graphs are introduced and it is shown that r r -joins preserve the property of having a large median index. Consensus strategies are also briefly discussed on a graph with bounded profiles.

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

local property
median graph
consensus strategy


A space-partitioning-based indexing method for multidimensional non-ordered discrete data spaces There is an increasing demand for similarity searches in a multidimensional non-ordered discrete data space (NDDS) from application areas such as bioinformatics and data mining. The non-ordered and discrete nature of an NDDS raises new challenges for developing efficient indexing methods for similarity searches. In this article, we propose a new indexing technique, called the NSP-tree, to support efficient similarity searches in an NDDS. As we know, overlap causes a performance degradation for indexing methods ( e. g., the R-tree) for a continuous data space. In an NDDS, this problem is even worse due to the limited number of elements available on each dimension of an NDDS. The key idea of the NSP-tree is to use a novel discrete space-partitioning (SP) scheme to ensure no overlap at each level in the tree. A number of heuristics and strategies are incorporated into the tree construction algorithms to deal with the challenges for developing an SP-based index tree for an NDDS. Our experiments demonstrate that the NSP-tree is quite promising in supporting efficient similarity searches in NDDSs. We have compared the NSP-tree with the ND-tree, a data-partitioning-based indexing technique for NDDSs that was proposed recently, and the linear scan using different NDDSs. It was found that the search performance of the NSP-tree was better than those of both methods.

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


heuristic-based model refinement for flavers FLAVERS is a finite-state verification approach that allowsan analyst to incrementally add constraints to improvethe precision of the model of the system being analyzed. Exceptfor trivial systems, however, it is impractical to computewhich constraints should be selected to produce preciseresults for the least cost. Thus, constraint selection hasbeen a manual task, guided by the intuition of the analyst.In this paper, we investigate several heuristics for selectingtask automaton constraints, a kind of constraint that tendsto reduce infeasible task interactions. We describe an experimentshowing that one of these heuristics is extremelyeffective at improving the precision of the analysis resultswithout significantly degrading performance.

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

verification task heuristics paper systems model constraint cost analysis performance


An Online Monitoring Approach for Web Service Requirements Web service technology aims to enable the interoperation of heterogeneous systems and the reuse of distributed functions in an unprecedented scale and has achieved significant success. There are still, however, challenges to realize its full potential. One of these challenges is to ensure the behavior of Web services consistent with their requirements. Monitoring events that are relevant to Web service requirements is, thus, an important technique. This paper introduces an online monitoring approach for Web service requirements. It includes a pattern-based specification of service constraints that correspond to service requirements, and a monitoring model that covers five kinds of system events relevant to client request, service response, application, resource, and management, and a monitoring framework in which different probes and agents collect events and data that are sensitive to requirements. The framework analyzes the collected information against the prespecified constraints, so as to evaluate the behavior and use of Web services. The prototype implementation and experiments with a case study shows that our approach is effective and flexible, and the monitoring cost is affordable.

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

web services
requirements
monitoring
constraints


A simple algorithm for identifying negated findings and diseases in discharge summaries Narrative reports in medical records contain a wealth of information that may augment structured data for managing patient information and predicting trends in diseases. Pertinent negatives are evident in text but are not usually indexed in structured databases. The objective of the study reported here was to test a simple algorithm for determining whether a finding or disease mentioned within narrative medical reports is present or absent. We developed a simple regular expression algorithm called NegEx that implements several phrases indicating negation, filters out sentences containing phrases that falsely appear to be negation phrases, and limits the scope of the negation phrases. We compared NegEx against a baseline algorithm that has a limited set of negation phrases and a simpler notion of scope. In a test of 1235 findings and diseases in 1000 sentences taken from discharge summaries indexed by physicians, NegEx had a specificity of 94.5% (versus 85.3% for the baseline), a positive predictive value of 84.5% (versus 68.4% for the baseline) while maintaining a reasonable sensitivity of 77.8% (versus 88.3% for the baseline). We conclude that with little implementation effort a simple regular expression algorithm for determining whether a finding or disease is absent can identify a large portion of the pertinent negatives from discharge summaries. (C) 2001 Elsevier Science (USA).

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

text classification
negation narrative
natural language processing
artificial intelligence


Print and electronic resources Usage statistics at Guru Gobind Singh Indraprastha University Library Purpose - The purpose of this paper is to quantify the use of electronic journals in comparison with the print collections in the Guru Gobind Singh Indraprastha University Library. Design/methodology/approach - A detailed analysis was made of the use of lending services, the Xerox facility and usage of electronic journals such as Science Direct, Emerald Management Xtra, ACM, IEL Library, subscribed to by the Library. Findings - The paper finds that, although many more users at the University are accessing electronic journals, it is not affecting the use of the print collection. The numbers of transactions and photocopy requests of print articles are continuously on the rise. Research limitations/implications - More research can be done by carrying out a deep log analysis of usage statistics of e-jounnals. Usage statistics of some of the resources could not be accessed. Purpose - The paper provides useful information on the use of electronic journals in comparison with the print collections in a university library.

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

user studies
print media
academic libraries
india


Preassociative aggregation functions The classical property of associativity is very often considered in aggregation function theory and fuzzy logic. In this paper we provide axiomatizations of various classes of preassociative functions, where preassociativity is a generalization of associativity recently introduced by the authors. These axiomatizations are based on existing characterizations of some noteworthy classes of associative operations, such as the class of Aczlian semigroups and the class of t-norms.

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


The effects of scaffolded computerized science problem-solving on achievement outcomes: a comparative study of support programs Abstract This study examined the effect of scaffolding learning components in a computerized environment, for students solving qualitative science problems in a simulation of laboratory experiments. Four scaffolding components were identified (structural, reflective, subject-matter and enrichment) and used in different configurations to construct four unique cognitive and meta-cognitive support programs based on human teaching. These ranged from low (Enrichment) to full support (Integrated). We compared the scaffolded groups with one another and with a non-scaffolded control group. A mathematics and reading comprehension questionnaire was used to divide the participants (n=473) into ability levels. At different points of time, achievement outcomes were measured by three open-ended subject-matter questionnaires, tapping knowledge and understanding. The findings indicate differential effects of the support programs mostly in the following order: Integrated>Strategic>Operative> Enrichment>Control. The structural component seems to be a sine qua non for success and has a consistent and powerful influence. The combination of reflection and structural components, however, are needed for superior achievement. Both reflection and subject-matter components work cumulatively over time.

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

cognitive support
computerized problem-solving
reflective support
structural support
subject-matter support


evaluating effects of machine translation accuracy on cross-lingual patent retrieval We organized a machine translation (MT) task at the Seventh NTCIR Workshop. Participating groups were requested to machine translate sentences in patent documents and also search topics for retrieving patent documents across languages. We analyzed the relationship between the accuracy of MT and its effects on the retrieval accuracy.

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

cross-lingual information retrieval
evaluation measures


On the development of a high-order compact scheme for exhibiting the switching and dissipative solution natures in the Camassa-Holm equation In this paper a two-step iterative solution algorithm for solving the Camassa-Holm equation, which involves only the first-order derivative term, is presented. In each set of the u - P and u - m differential equations, one is governed by the inviscid nonlinear convection-reaction equation for the time-evolving fluid velocity component along the horizontal direction. The other equation is known as the inhomogeneous Helmholtz equation. The resulting reduction of differential order facilitates us to develop the flux discretization scheme in a stencil with comparatively fewer points. For accurately predicting the unidirectional propagation of the shallow water wave, the modified equation analysis for eliminating several leading discretization error terms and the Fourier analysis for minimizing a particular type of wave-like error are employed. In this study, the fifth-order spatially accurate combined compact upwind scheme is developed in a three-point stencil for approximating the first-order derivative term. For the purpose of retaining a long-term accurate Hamiltonian and multi-symplectic geometric structures in Camassa-Holm equation, the time integrator (or time-stepping scheme) chosen in this study should conserve symplecticity. Another main emphasis of conducting the present calculation of Camassa-Holm equation is to shed light on the conservation of Hamiltonians up to the time before wave breaking. We also intended to elucidate the switching scenario by virtue of the peakon-peakon interaction problem and the dissipative scenario after the time of head-on collision in the peakon-antipeakon interaction problem. (C) 2011 Elsevier Inc. All rights reserved.

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

symplecticity
conservation of hamiltonians
switching scenario
dissipative scenario

camassa-holm equation
fifth-order spatially accurate
long-term accurate
peakon-peakon
peakon-antipeakon


Assessing brand image through communalities and asymmetries in brand-to-attribute and attribute-to-brand associations Brand image is a key component of customer-based brand equity, and refers to the associations a consumer holds in memory. Such associations are often directional; one should distinguish between brand-to-attribute and attribute-to-brand associations. Information on these associations arise from two ways of collecting data, respectively: brand-by-brand evaluations of all attributes and attribute-by-attributes evaluations of all brands. In this paper, the authors present a methodological approach, namely correspondence analysis of matched matrices, to assess the communalities as well as asymmetries between brand-to-attribute and attribute-to-brand associations. This allows studying whether or not there is match in a brands positioning (brand-to-attribute associations) and relative advantage (attribute-to-brand associations). The methodology results in perceptual maps visualizing brand image. The approach is illustrated in an empirical market research project in which two samples of consumers evaluated ten brands of deodorants and eleven attributes. The stability of the solution is examined using bootstrap resampling procedures.

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

brand image
correspondence analysis
bootstrap


An approximation algorithm for the directed telephone multicast problem Consider a network of processors modeled by an n-vertex directed graph G = ( V, E). Assume that the communication in the network is synchronous, i.e., occurs in discrete "rounds," and in every round every processor is allowed to pick one of its neighbors, and to send him a message. A set of terminals T. V of size |T | = k is given. The telephone k-multicast problem requires computing a schedule with a minimal number of rounds that delivers a message from a given single processor, that generates the message, to all the processors of T. The processors of V\T may be left uninformed. The telephone multicast is a basic primitive in distributed computing and computer communication theory. In this paper we devise an algorithm that constructs a schedule with O( log k . b*+k(1/2)) rounds for the directed k-multicast problem, where b* is the value of the optimum solution. This is the first algorithm with a non-trivial approximation guarantee for this problem. We show that our algorithm for the directed multicast problem can be used to derive an algorithm with a similar ratio for the directed Steiner poise problem, that is, the problem of constructing an arborescence that spans a collection T of terminals and has the minimum poise.

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


All Political Participation Is Socially Networked?: New Media and the 2012 Election This research examined the influence of attention to specific forms of traditional and online media on young adults' online and offline political participation as well as voter turnout during the fall 2012 presidential campaign. A three-wave panel survey demonstrated that attention to traditional media did not increase offline and online political participation in September; instead, participation was heightened by attention to online sources, particularly presidential candidate websites, Facebook, Twitter, and blogs. In the following months, individual-level change in participation was attributable to attention to several online media sources as well as change in media attention. In the case of voter turnout, results suggest that television attention was positively linked to voter likelihood in September but was negatively linked to individual-level change in voter turnout in November.

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


Robust control on saturated Markov jump systems with missing information In this paper, a robust H? H ? controller is designed for saturated Markov jump systems with uncertainties and time varying transition probabilities. The time-varying transition probability uncertainty is described as a polytope set. Stochastic stability is analyzed for the underlying systems by Lyapunov function approach and a sufficient condition is derived to design controllers such that the resulting closed-loop system is stochastically stable and a prescribed H? H ? performance is also achieved. Furthermore, the attraction domain of this Markov jump system is estimated and evaluated. A simulation example is given to show the effectiveness of the developed techniques.

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

h? h ? control h? h ? h? h ? h ?
actuator saturation


Modifications of Patterson-Wiedemann functions for cryptographic applications Three basic properties of Boolean functions to be useful for cryptographic purposes are balancedness, high algebraic degree, and high nonlinearity. In addition, strict avalanche criteria and propagation characteristics are required for design of S-boxes. In this correspondence, we introduce methods to modify the Patterson-Wiedemann and bent functions to achieve the above cryptographic properties. In the process, we are able to answer some open questions about Boolean functions.

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

algebraic degree
balancedness
nonlinearity
propagation characteristics
strict avalanche criteria


analytical characterisation of the performance of bluetooth piconets using serial port profile Bluetooth is a key connectivity technology for the deployment of wireless Personal Area Networks as far as it is the most popular low power communication feature incorporated in devices such as laptops or smartphones. This paper proposes an analytical model to predict the delay of the transmissions in Bluetooth piconets employing Serial Port Profile (SPP), which is massively implemented by Bluetooth-enabled equipments. The characterization includes the impact of the overhead and the segmentation imposed by the different protocols involved in the transmission as well as the delay provoked by the polling process that is executed to regulate the activity of the different slaves in the piconet. The model has been empirically evaluated and tested in an actual Bluetooth piconet.

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


Multiphase segmentation using an implicit dual shape prior: Application to detection of left ventricle in cardiac MRI Novel segmentation algorithm is presented incorporating shape prior. Segmentation algorithm is developed in a variational framework using level sets. The prior uses the anatomical shape similarity between endo- and epicardium. Their dissimilarity is modeled following a Gaussian distribution.

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

shape analysis
implicit shape prior
level set function
magnetic resonance imaging
cardiac disease


Optimization of dual response systems: A comprehensive procedure for degenerate and nondegenerate problems Most dual response systems (DRSs) arising in response surface modeling can be approximated using a nonlinear (and typically nonconvex) mathematical program involving two quadratic functions. One of the quadratic functions is used as the objective function, the other for imposing a target constraint. This paper describes an effective heuristic for computing global (or near-global) optimal solutions for this type of problem. The first part of the paper addresses the special case of degeneracy, a condition that makes the system more difficult to solve. Included are means for detecting degeneracy as well as issues relating to its likelihood in practice. The subsequent part of the paper describes our new procedure, AXIS, which rotates a degenerate problem and then decomposes it into a finite sequence of nondegenerate subproblems of lower dimension. The nondegenerate subproblems are solved using the algorithm DRSALG developed earlier. In the final parts of the paper, the AXIS and DRSALG algorithms are integrated into a single dual response solver termed DR2. DR2 is tested against two nonlinear optimization procedures that have been used frequently in dual response applications. The new solver proves to be extremely effective at locating best-practice operating conditions.

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

quadratic programming
global optimization
response surface methodology
robust parameter design
quality control


ownership, encapsulation and the disjointness of type and effect Ownership types provide a statically enforceable notion of object-level encapsulation. We extend ownership types with computational effects to support reasoning about object-oriented programs. The ensuing system provides both access control and effects reporting. Based on this type system, we codify two formal systems for reasoning about aliasing and the disjointness of computational effects. The first can be used to prove that evaluation of two expressions will never lead to aliases, while the latter can be used to show the non-interference of two expressions.

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

type system
ownership types
reasoning
systems
ownership
access control
support
aliasing
encapsulation
effect
evaluation

program
formalism
type-and-effects systems
computation
express
object
object-oriented
interference


A multiscale computational framework to understand vascular adaptation We develop a computational framework for multiscale modeling of vein graft adaptation that couple environmental condition described with PDEs and tissue adaptation at the cellular level described with agent base model. The implementation is designed to facilitate dialogue between computational scientist and MDs and accelerate the iterative process on model improvement: it is modular, simple and computationally efficient. We have been able to reproduce interesting pattern observed on our animal model and have a tool to question the impact of new potential control on the biology such as proliferation rate or inflammation.

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

agent based models
pde
hybrid agent base model
multiscale modeling
surgical outcome
intimal hyperplasia


Clique-Based Architectural Synthesis of Flow-Based Microfluidic Biochips Microfluidic biochips, also referred to "lab-on-a-chip," have been recently proposed to integrate all the necessary functions for biochemical analyses. This technology starts a new era of biology science, where a combination of electronic and biology is first introduced. There are several types of microfluidic biochips; among them there has been a great interest in flow-based microfluidic biochips, in which the flows of liquid is manipulated using integrated microvalves. By combining several microvalves, more complex resource units such as micropumps, switches and mixers can be built. For efficient execution, the flows of liquid routes in microfluidic biochips need to be scheduled under some resource constraints and routing constraints. The execution time of a biochemical application depends strongly on the binding and scheduling result. The most previously developed binding and scheduling algorithm is based on heuristics, and there has been no method to obtain optimal results. Considering the above, we propose an optimal method by casting the problem to a clique problem. Moreover, this paper also presents some heuristic techniques for computational time reduction. Experiments demonstrate that the proposed method is able to reduce the execution time of biochemical applications by more than, 15% compared with the previous approach. Moreover, the proposed heuristic method is able to produce the results at no or little cost of optimality, in significantly shorter time than the optimal method.

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

architectural synthesis
binding
scheduling
clique


A virtual prototyping system for rapid product development This paper describes a virtual prototyping (VP) system that integrates virtual reality with rapid prototyping (RP) to create virtual or digital prototypes to facilitate product development. The proposed VP system incorporates two new simulation methodologies, namely the dexel-based and the layer-based fabrication approaches, to simulate the powder-based and the laminated sheet-based RP processes, respectively. The dexel-based approach deposits arrays of solid strips to form a layer, while the layer-based approach directly forms a complete layer by extruding the slice contours. The layer is subsequently stacked up to fabricate a virtual prototype. The simulation approaches resemble the physical fabrication processes of most RP systems, and are therefore capable of accurately representing the geometrical characteristics of prototypes. In addition to numerical quantification of the simulation results, the system also provides stereoscopic visualisation of the product design and its prototype for detailed analyses. Indeed, the original product design may be superimposed on its virtual prototype, so that areas with dimensional errors beyond design limits may be clearly highlighted to facilitate point-to-point analysis of the surface texture and the dimensional accuracy of the prototype. Hence, the key control parameters of an RP process, such as part orientation, layer thickness and hatch space, may be effectively tuned up for optimal fabrication of physical prototypes in subsequent product development. Furthermore, the virtual prototypes can be transmitted via the Internet to customers to facilitate global manufacturing. As a result, both the lead-time and the product development costs can be significantly reduced.

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


Effects of load carriage, load position, and walking speed on energy cost of walking Purpose: The purpose of this study was to examine the effects of load, load position, and walking speed on the energy cost of walking per unit distance (Cw: ml/kg/m). Methods: Eight young male subjects walked on a treadmill at various speeds with and without load in the hands, on the back, and on the legs. The Cw values were determined from the ratio of 2-min steady-state oxygen consumption (VO2) above resting value ( ) to the walking speed (v): . Results: An energy-saving phenomenon was observed when the load was carried on the back at slower speeds. This phenomenon diminished at faster speeds, particularly when walking faster than 90m/min. It was also observed when the load was carried in the hands at slower speeds. Conclusions: These findings partly supported our hypothesis that an energy-saving phenomenon would be observed due to an interaction between rotative torque around the center of body mass and excessive burden on the lower muscles as a function of speed.

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

energy cost of walking
load carriage
load position
walking speed


Conditional diagnosability of hypercubes under the comparison diagnosis model ? ?? Processor fault diagnosis plays an important role in multiprocessor systems for reliable computing, and the diagnosability of many well-known networks has been explored. Lai et al. proposed a novel measure of diagnosability, called conditional diagnosability, by adding an additional condition that any faulty set cannot contain all the neighbors of any vertex in a system. We make a contribution to the evaluation of diagnosability for hypercube networks under the comparison model and prove that the conditional diagnosability of n-dimensional Hypercube Qn is 3(n?2)+1 for n?5. The conditional diagnosability of Qn is about three times larger than the classical diagnosability of Qn.

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

comparison model
diagnosability
hypercube


Automated processing of shoeprint images based on the Fourier transform for use in forensic science The development of a system for automatically sorting a database of shoeprint images based on the outsole pattern in response to a reference shoeprint image is presented. The database images are sorted so that those from the same pattern group as the reference shoeprint are likely to be at the start of the list. A database of 476 complete shoeprint images belonging to 140 pattern groups was established with each group containing two or more examples. A panel of human observers performed the grouping of the images into pattern categories. Tests of the system using the database showed that the first-ranked database image belongs to the same pattern category as the reference image 65 percent of the time and that a correct match appears within the first 5 percent of the sorted images 87 percent of the time. The system has translational and rotational invariance so that the spatial positioning of the reference shoeprint images does not have to correspond with the spatial positioning of the shoeprint images of the database. The performance of the system for matching partial-prints was also determined.

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

forensic science
shoeprint
fourier transform

image processing
shoe wear
partial-print
automated system