IPRAILintellectual property reuse-based analog IC layout automation ? This paper presents a computer-aided design tool, IPRAIL, which automatically retargets existing analog layouts for technology migration and new design specifications. The reuse-based methodology adopted in IPRAIL utilizes expert designer knowledge embedded in analog layouts. IPRAIL automatically extracts analog layout intellectual properties as templates, incorporates new technology design rules and device sizes, and generates fully functional layouts. This is illustrated by retargeting two practical operational amplifier layouts from the TSMC 0.25?m CMOS process to the TSMC 0.18?m CMOS process. While manual re-design is known to take days to weeks, IPRAIL only takes minutes and achieves comparable circuit performances.

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

analog integrated circuit design
analog layout automation
layout symmetry
analog synthesis and optimization


Topic dynamics in Weibo: a comprehensive study The tremendous development of online social media has changed peoples life fundamentally in recent years. Weibo, a Twitter-like service in China, has attracted more than 500 million users in less than 5years and produces more than 100 million Chinese tweets everyday. In these massive tweets, different user interests and daily trends are reflected by different topics. To our best knowledge, a systematic investigation of topic dynamics in Weibo is still missing. Aiming at filling this vital gap, we try to comprehensively disclose the topic dynamics from the perspective of time, geography, demographics, emotion, retweeting and correlation. An incremental learning framework is first established to probe more than 200 million streaming tweets and an interaction network constituted by around 90,000 active users. Many interesting patterns are then revealed, which could provide insights for topic-related applications in online social media, such as user profiling, event detection, trend tracking or content recommendation.

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

topic classification
topic patterns
topic correlation


method-specific dynamic compilation using logistic regression Determining the best set of optimizations to apply to a program has been a long standing problem for compiler writers. To reduce the complexity of this task, existing approaches typically apply the same set of optimizations to all procedures within a program, without regard to their particular structure. This paper develops a new method-specific approach that automatically selects the best optimizations on a per method basis within a dynamic compiler. Our approach uses the machine learning technique of logistic regression to automatically derive a predictive model that determines which optimizations to apply based on the features of a method. This technique is implemented in the Jikes RVM Java JIT compiler. Using this approach we reduce the average total execution time of the SPECjvm98 benchmarks by 29\%. When the same heuristic is applied to the DaCapo+ benchmark suite, we obtain an average 33\% reduction over the default level O2 setting.

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

task
machine learning
structure
method
logistic regression
benchmark
dynamic
reduction
java
jikes rvm
compilation
complexity
paper

optimality
procedure
compiler optimization
dynamic compilation
timing
heuristics
feature
prediction model


New quadratic solidshell elements and their evaluation on linear benchmark problems This paper is concerned with the development of a new family of solidshell finite elements. This concept of solidshell elements is shown to have a number of attractive computational properties as compared to conventional three-dimensional elements. More specifically, two new solidshell elements are formulated in this work (a fifteen-node and a twenty-node element) on the basis of a purely three-dimensional approach. The performance of these elements is shown through the analysis of various structural problems. Note that one of their main advantages is to allow complex structural shapes to be simulated without classical problems of connecting zones meshed with different element types. These solidshell elements have a special direction denoted as the thickness, along which a set of integration points are located. Reduced integration is also used to prevent some locking phenomena and to increase computational efficiency. Focus will be placed here on linear benchmark problems, where it is shown that these solidshell elements perform much better than their counterparts, conventional solid elements.

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

solidshell finite elements
locking phenomena
reduced integration
benchmark problems

mixed variational principle
rank deficiency
74s05


Schedulability Analysis of EDF-Scheduled Embedded Real-Time Systems with Resource Sharing Earliest Deadline First (EDF) is the most widely studied optimal dynamic scheduling algorithm for uniprocessor real-time systems. In the existing literature, however, there is no complete exact analysis for EDF scheduling when both resource sharing and release jitter are considered. Since resource sharing and release jitter are important characteristics of embedded real-time systems, a solid theoretical foundation should be provided for EDF scheduled systems. In this paper, we extend traditional processor demand analysis to let arbitrary deadline real-time tasks share non-preemptable resources and suffer release jitter. A complete and exact schedulability analysis for EDF scheduled systems is provided. This analysis is incorporated into QPA (Quick Processor-demand Analysis) which provides an efficient implementation of the exact test.

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

resource sharing
schedulability analysis
scheduling
earliest deadline first

algorithms
design
reliability
embedded and real-time systems
control and reliability


Computing the minimum enclosing sphere of free-form hypersurfaces in arbitrary dimensions The problem of computing the minimum enclosing sphere (MES) of a point set is a classical problem in Computational Geometry. As an LP-type problem, its expected running time on the average is linear in the number of points. In this paper, we generalize this approach to compute the minimum enclosing sphere of free-form hypersurfaces, in arbitrary dimensions. This paper makes the bridge between discrete point sets (for which indeed the results are well-known) and continuous curves and surfaces, showing that the general solution for the former can be adapted for the latter. To compute the MES of a pair of hypersurfaces, each one having a contact point (a point at which the sphere touches the hypersurface), antipodal constraints are employed. For more than a pair, equidistance constraints along with tangency constraints are applied. These constraints yield a finite set of solution points which are used to identify the minimum enclosing sphere. The algorithm uses the LP-characteristic of the problem to process the input set. Furthermore, an optimization procedure that uses the convex hull of sampled points from the hypersurfaces is also described. Finally, results from our implementation are presented.

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

minimum enclosing circle
lp-type problems
free-form hypersurfaces


On some classes of nonstationary parametric processes In this paper we investigate nonstationary stochastic processes that are characterized by temporal- and spectral-domain parameters with the aim of determining when temporal and spectral parameterizations exist simultaneously. We begin by examining the large class of purely nondeterministic nonstationary stochastic processes generated by passing white noise through a general linear time-varying filter. Then four subclasses of nonstationary parametric processes are studied: (1) the rational class; (2) the rational adjoint class; (3) the well-known ARMA class; and (4) the ARMA adjoint class. For each of these classes, we give membership conditions on the Green's function. These conditions are used to determine when minimum-order parameterizations are unique. Next, we use these results to give precise conditions under which a unique minimum-order process is a member of one or more of these classes. Although these conditions are quite restrictive, examples are included to show that these conditions do not apply to nonunique minimum-order parameterizations.

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

time-varying
model building
spectral density


A physically based trunk soft tissue modeling for scoliosis surgery planning systems One of the major concerns of scoliotic patients undergoing spinal correction surgery is the trunk's external appearance after the surgery. This paper presents a novel incremental approach for simulating postoperative trunk shape in scoliosis surgery. Preoperative and postoperative trunk shapes data were obtained using three-dimensional medical imaging techniques for seven patients with adolescent idiopathic scoliosis. Results of qualitative and quantitative evaluations, based on the comparison of the simulated and actual postoperative trunk surfaces, showed an adequate accuracy of the method. Our approach provides a candidate simulation tool to be used in a clinical environment for the surgery planning process.

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

biomedical modeling
soft tissue deformation modeling
interactive surgical planning systems
thin-plate splines
energy minimization


using multiple offspring sampling to guide genetic algorithms to solve permutation problems The correct choice of an evolutionary algorithm, a genetic representation for the problem being solved (as well as their associated variation operators) and the appropriate values for the parameters of the algorithm is a hard task and it is often considered as an optimization problem itself. In this contribution, we propose a new theoretical formalism, called Multiple Offspring Sampling (MOS). This new technique combines different evolutionary approaches taking advantage of the benefits provided by each of them. MOS dynamically balances the participation of different mechanisms to spawn the new offspring population, according to the benefits provided by each of them in previous generations. This approach evaluates multiple offspring generation methods (for example different coding strategies), and configures appropriate sampling sizes. This formalism has been applied to a well-known permutation problem, the traveling salesman problem (TSP). The results on several instances of this problem show that most of the combined techniques outperform the results obtained by single ones.

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

traveling salesman problem
multiple offspring sampling
genetic algorithms
permutation problems


Maximal Linear Embedding for Dimensionality Reduction Over the past few decades, dimensionality reduction has been widely exploited in computer vision and pattern analysis. This paper proposes a simple but effective nonlinear dimensionality reduction algorithm, named Maximal Linear Embedding (MLE). MLE learns a parametric mapping to recover a single global low-dimensional coordinate space and yields an isometric embedding for the manifold. Inspired by geometric intuition, we introduce a reasonable definition of locally linear patch, Maximal Linear Patch (MLP), which seeks to maximize the local neighborhood in which linearity holds. The input data are first decomposed into a collection of local linear models, each depicting an MLP. These local models are then aligned into a global coordinate space, which is achieved by applying MDS to some randomly selected landmarks. The proposed alignment method, called Landmarks-based Global Alignment (LGA), can efficiently produce a closed-form solution with no risk of local optima. It just involves some small-scale eigenvalue problems, while most previous aligning techniques employ time-consuming iterative optimization. Compared with traditional methods such as ISOMAP and LLE, our MLE yields an explicit modeling of the intrinsic variation modes of the observation data. Extensive experiments on both synthetic and real data indicate the effectivity and efficiency of the proposed algorithm.

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

dimensionality reduction
maximal linear patch

manifold learning
landmarks-based global alignment


Balancing Bounded Treewidth Circuits We use algorithmic tools for graphs of small treewidth to address questions in complexity theory. For our main construction, we prove that multiplicatively disjoint arithmetic circuits of size n O(1) and treewidth k can be simulated by bounded fan-in arithmetic formulas of depth O(k 2logn). From this we derive an analogous statement for syntactically multilinear arithmetic circuits, which strengthens the central theorem of M.Mahajan and B.V.R. Rao (Proc. 33rd International Symposium on Mathematical Foundations of Computer Science, vol.5162, pp.455466, 2008). We show our main construction has the following three applications: Bounded width arithmetic circuits of size n O(1) can be balanced to depth O(logn), provided chains of iterated multiplication in the circuit are of length O(1). Boolean bounded fan-in circuits of size n O(1) and treewidth k can be simulated by bounded fan-in formulas of depth O(k 2logn). This strengthens in the non-uniform setting the known inclusion that SC0?NC1. We demonstrate treewidth restricted cases of Directed-Reachability and Circuit Value Problem that can be solved in LogDCFL.

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

arithmetic circuits
bounded treewidth
circuit value problem


SWGDT: A sliding window-based genotype dependence testing tool for genome-wide susceptibility gene scan We developed a sliding window-based genotype dependence testing tool SWGDT. SWGDT can be applied for genome-wide susceptibility gene scan. We identified a novel susceptibility gene TACR1 for KBD. SWGDT can help to identify novel causal genes of complex diseases.

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

genotype independence analysis
genome-wide association studies
sliding window


Buffering-deflection tradeoffs in optical burst switching A very important issue in optical burst switching (OBS) networks is the excessive burst drop when no suitable network resources are found during path reservation. In this study, a network scenario is evaluated in which AWG-based optical nodes are used as burst router nodes within the optical network. The two classical solutions to solve the burst contentions on the channels outgoing from the node are considered, that is, either based on buffering within the node, or by exploiting deflection routing. A performance evaluation is carried out to evaluate and compare these solutions for different network topologies with different node and traffic parameters. Our main contribution is to set numerical tradeoffs between burst deflection through the network and buffering in the node, so that a guidance in optical network design is provided where node buffering is inherently technologically limited.

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

optical burst switching
deflection routing

arrayed waveguide grating
buffering-deflection tradeoff


Simultaneous process mean and variance monitoring using artificial neural networks Control chart patterns (CCPs) can be employed to determine the behavior of a process. Hence, CCP recognition is an important issue for an effective process-monitoring system. Artificial neural networks (ANNs) have been applied to CCP recognition tasks and promising results have been obtained. It is well known that mean and variance control charts are usually implemented together and that these two charts are not independent of each other, especially for the individual measurements and moving range (X-R(m),) charts. CCPs on the mean and variance charts can be associated independently with different assignable causes when corresponding process knowledge is available. However, ANN-based CCP recognition models for process mean and variance have mostly been developed separately in the literature with the other parameter assumed to be under control. Little attention has been given to the use of ANNs for monitoring the process mean and variance simultaneously. This study presents a real-time ANN-based model for the simultaneous recognition of both mean and variance CCPs. Three most common CCP types, namely shift, trend, and cycle, for both mean and variance are addressed in this work. Both direct data and selected statistical features extracted from the process are employed as the inputs of ANNs. The numerical results obtained using extensive simulation indicate that the proposed model can effectively recognize not only single mean or variance CCPs but also mixed CCPs in which mean and variance CCPs exist concurrently. Empirical comparisons show that the proposed model performs better than existing approaches in detecting mean and variance shifts, while also providing the capability of CCP recognition that is very useful for bringing the process back to the in-control condition. A demonstrative example is provided. (C) 2010 Elsevier Ltd. All rights reserved.

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

artificial neural networks
control charts

feature extraction
pattern recognition
statistical process control


Sensitivity-analysis based method in single-robot cells cost-effective design and optimization The paper considers the design of an economically efficient robotic cell, parallel workstations at each production stage, gripper type of the robot, and the layout, which affects the travel time of the robot. This proposed method is successfully employed in the real-life engineering cases by ABB engineers. Its effectiveness are fully demonstrated by these established engineering scenarios.

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

productivity
sensitivity-analysis
cost-effective design


Adaptive robust stabilisation for a class of uncertain nonlinear time-delay dynamical systems The problem of adaptive robust stabilisation is considered for a class of uncertain nonlinear dynamical systems with multiple time-varying delays. It is assumed that the upper bounds of the nonlinear delayed state perturbations are unknown and that the time-varying delays are any non-negative continuous and bounded functions which do not require that their derivatives have to be less than one. In particular, it is only required that the nonlinear uncertainties, which can also include time-varying delays, are bounded in any non-negative nonlinear functions which are not required to be known for the system designer. For such a class of uncertain nonlinear time-delay systems, a new method is presented whereby a class of continuous memoryless adaptive robust state feedback controllers with a rather simpler structure is proposed. It is also shown that the solutions of uncertain nonlinear time-delay systems can be guaranteed to be uniformly exponentially convergent towards a ball which can be as small as desired. Finally, as an application, an uncertain nonlinear time-delay ecosystem with two competing species is given to demonstrate the validity of the results.

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

time-delay systems
uncertainty
time-varying delays
adaptive control
robust control
uniform boundedness
exponential convergence
ecological systems


Deterministic Parallel Random-Number Generation for Dynamic-Multithreading Platforms Existing concurrency platforms for dynamic multithreading do not provide repeatable parallel random-number generators. This paper proposes that a mechanism called pedigrees be built into the runtime system to enable efficient deterministic parallel random-number generation. Experiments with the open-source MIT Cilk runtime system show that the overhead for maintaining pedigrees is negligible. Specifically, on a suite of 10 benchmarks, the relative overhead of Cilk with pedigrees to the original Cilk has a geometric mean of less than 1%. We persuaded Intel to modify its commercial C/C++ compiler, which provides the Cilk Plus concurrency platform, to include pedigrees, and we built a library implementation of a deterministic parallel random-number generator called DOTMIX that compresses the pedigree and then "RC6-mixes" the result. The statistical quality of DOTMIX is comparable to that of the popular Mersenne twister, but somewhat slower than a nondeterministic parallel version of this efficient and high-quality serial random-number generator. The cost of calling DOTMIX depends on the "spawn depth" of the invocation. For a naive Fibonacci calculation with n = 40 that calls DOTMIX in every node of the computation, this "price of determinism" is about a factor of 2.3 in running time over the nondeterministic Mersenne twister, but for more realistic applications with less intense use of random numbers - such as a maximal-independent-set algorithm, a practical samplesort program, and a Monte Carlo discrete-hedging application from QuantLib - the observed "price" was at most 2 1%, and sometimes much less. Moreover, even if overheads were several times greater, applications using DOTMIX should be amply fast for debugging purposes, which is a major reason for desiring repeatability.

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

cilk
determinism
dynamic multithreading
pedigree

algorithms
performance
theory
nondeterminism
parallel computing
random-number generator


Characterizing and comparing the evolution of the major global economies in information and communication technologies ? We compare status of the ICT industry of the six major global economies in ICT. The USA is clearly the top global player in ICT. The EU is the largest economy of the world, and the least ICT-specialised economy of all six major ICT economies. ICT BERD in China remains low but its ICT BERD intensity grows strongly. Of all six analysed economies, Taiwan and Korea are the most ICT-specialised.

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

r&d investment
patenting
employment
digital agenda for europe


A fractional step lattice Boltzmann method for simulating high Reynolds number flows A fractional step lattice Boltzmann scheme is presented to greatly improve the stability of the lattice Boltzmann method (LBM) in modelling incompressible flows at high Reynolds number. This method combines the good features of the conventional LBM and the fractional step technique. Through the fractional step, the flow at an extreme case of infinite Reynolds number (inviscid flow) can be effectively simulated. In addition, the non-slip boundary condition can be directly implemented. (c) 2006 IMACS. Published by Elsevier B.V. All rights reserved.

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

lattice boltzmann method
fractional step


Reliability-based code-search algorithms for maximum-likelihood decoding of block codes Efficient code-search maximum-likelihood decoding algorithms, based on reliability information, are presented for binary linear block codes, The codewords examined are obtained via encoding. The information set utilized for encoding comprises the positions of those columns of a generator matrix G of the code which, for a given received sequence, constitute the most reliable basis for the column space of G, Substantially reduced computational complexity of decoding is achieved by exploiting the ordering of the positions within this information set. The search procedures do not require memory; the codeword to be examined is constructed from the previously examined codeword according to a fixed rule, Consequently, the search algorithms are applicable to codes of relatively large size. They are also conveniently modifiable to achieve efficient nearly optimum decoding of particularly large codes.

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

maximum-likelihood decoding
code-search
ordered basis
ordered information set
partial ordering


Simultaneous topology, shape and sizing optimisation of a three-dimensional slender truss tower using multiobjective evolutionary algorithms This paper presents an integrated design technique to carry out simultaneous topology, shape and sizing optimisation of a three-dimensional truss structure. Design objectives include mass, compliance, natural frequencies, frequency response function (FRF), and force transmissibility (FT). The Pareto fronts are explored by using: strength Pareto evolutionary algorithm (SPEA2), population-based incremental learning (PBIL), and archived multiobjective simulated annealing (AMOSA). The results obtained from using the optimisers are compared based upon the hypervolume (HV) and generational distance (GD). It is shown that PBIL is the best for optimising compliance and natural frequency, while SPEA2 is superior when dealing with FRF and FT.

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

multiobjective evolutionary algorithms
frequency response function

truss optimisation
topology optimisation
structural vibration


A cost-effective programmable environment for developing environmental decision support systems1 This paper presents the TRACE system, a software platform for the development of Environmental Decision Support Systems, which is currently under development and will be available by late 1998. The main objective of the TRACE technology is to support the user in the real-time management of environmental emergencies, by rapidly assessing a crisis situation and building an effective intervention plan, which exploits the available operational resources at best. The first part of the paper presents the conceptual framework of the TRACE system, including user and application modelling methodologies, tools and techniques. Next the design framework is presented, including the architecture of the system and a selection of relevant modules (namely the resource manager, the dependency manager and the constraint reasoner). The TRACE approach is then illustrated by a pilot application that will support decision making in the case of wind-throw management in Romanian forests. The related works are considered within the context of the other relevant research projects.

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

environmental systems
task analysis
constraint reasoning
resource allocation


hierarchical dynamic slicing Dynamic slicing is a widely used technique for program analysis, debugging, and comprehension. However, the reported slice is often too large to be inspected by the programmer. In this work, we address this deficiency by hierarchically applying dynamic slicing at various levels of granularity. The basic observation is to divide a program execution trace into "phases", with data/control dependencies inside each phase being suppressed. Only the inter-phase dependencies are presented to the programmer. The programmer then zooms into one of these phases which is further divided into sub-phases and analyzed. We also discuss how our ideas can be used to augment debugging methods other then slicing (such as "fault localization", a recently proposed trace comparison method for software debugging).

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


A high-brightness diffractive stereoscopic display technology In this research, the diffractive blazed grating was proposed to produce the stereoscopic effects that were traditionally generated by barrier grating through parallax barrier method. Three wavelengths, 596nm, 554nm and 450nm, were chosen as the main light waves for three sub-pixels, RGB. Because the diffractive optical element was directly attached to the color filter of a MPEG-4 player (Motion Picture Experts Group Four Player, MPEG-4 player) panel, the stereoscopic image remained high brightness. Since lithography would be the most possible manufacturing method, multilevel approximation was to proceeded during simulation. From the simulated results of optical simulation software, LightTools, the RGB lights moved parallelly and consequently avoiding cross-talk.

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

blazed grating
diffractive optical element


When Is a Function Securely Computable? A subset of a set of terminals that observe correlated signals seek to compute a function of the signals using public communication. It is required that the value of the function be concealed from an eavesdropper with access to the communication. We show that the function is securely computable if and only if its entropy is less than the capacity of a new secrecy generation model, for which a single-letter characterization is provided.

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

aided secret key
balanced coloring lemma
function computation
maximum common function
omniscience
secret key capacity
secure computability


Virtual data space load balancing for irregular applications ? Load balancing is a key issue in the development of parallel algorithms with irregular structures. Existing load balancing systems each support only one specific programming paradigm and thus are of limited use. The system VDS presented here allows concurrent use of various paradigms such as fork-join, weighted tasks, and static dags (directed acyclic graphs that are known in advance). The system provides visual performance evaluation tools to facilitate the efficient application of the system. VDS supports various communication interfaces including PVM and MPI. Thus, VDS-applications can be run on architectures ranging from workstation clusters to massively parallel systems.

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

programming environment
multithreaded computations
dag-scheduling


Multi-core and many-core shared-memory parallel raycasting volume rendering optimization and tuning Given the computing industry trend of increasing processing capacity by adding more cores to a chip, the focus of this work is tuning the performance of a staple visualization algorithm, raycasting volume rendering, for shared-memory parallelism on multi-core CPUs and many-core GPUs. Our approach is to vary tunable algorithmic settings, along with known algorithmic optimizations and two different memory layouts, and measure performance in terms of absolute runtime and L2 memory cache misses. Our results indicate there is a wide variation in runtime performance on all platforms, as much as 254% for the tunable parameters we test on multi-core CPUs and 265% on many-core GPUs, and the optimal configurations vary across platforms, often in a non-obvious way. For example, our results indicate the optimal configurations on the GPU occur at a crossover point between those that maintain good cache utilization and those that saturate computational throughput. This result is likely to be extremely difficult to predict with an empirical performance model for this particular algorithm because it has an unstructured memory access pattern that varies locally for individual rays and globally for the selected viewpoint. Our results also show that optimal parameters on modern architectures are markedly different from those in previous studies run on older architectures. In addition, given the dramatic performance variation across platforms for both optimal algorithm settings and performance results, there is a clear benefit for production visualization and analysis codes to adopt a strategy for performance optimization through auto-tuning. These benefits will likely become more pronounced in the future as the number of cores per chip and the cost of moving data through the memory hierarchy both increase.

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

parallel volume rendering
auto-tuning
multi-core cpu
many-core gpu


Toward smarter health and well-being: an implicit role for networking and information technology The number of people afflicted with chronic illnesses such as obesity, cancer, and diabetes has soared in recent years, generating new kinds of disparate medical challenges. In turn, these challenges have resulted in skyrocketing costs, preventable deaths, and medical malpractice claims. For example, studies have found nearly half of all US patients receive inadequate care each year, over 2 million are harmed by hospital-acquired infections, and over 1 million suffer disabling complications during surgery even though half of these are thought to be avoidable. These challenges have catalyzed the beginning of a transformation in care delivery, from a health-care system that focuses on disease to one that must look after patients including individuals and communities. To provide proper treatment to those who are chronically ill, the health-care system has to support improved individuals' health-related practices prior to the manifestation of disease; ensure that a range of practitioners can deliver quality clinical care during the onset of an illness; and facilitate patient-provider-family partnerships during post-disease wellness care. As we describe in this review, key advances in networking and information technologies spanning patient monitoring, data visualization and decision making, robotics and computer vision for diagnosis and surgery, social networking for fostering community-based support systems, and so on stand to drive forward these changes. Together with social scientists, systems engineers, medical practitioners, and computer scientists, information systems scholars can help alter the nature of care delivery well into the twenty-first century, ultimately contributing to a system that is much more safe, effective, reliable, and timely than it is today. Journal of Information Technology (2011) 26, 120-128. doi:10.1057/jit.2011.5 Published online 19 April 2011

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

patient monitoring
data visualization
robotics and computer vision
social networking

health information technology
smart health and well-being


Foreign DNA IntegrationPerturbations of the GenomeOncogenesis We have been interested in the consequences of foreign DNA insertion into established mammalian genomes and have initially studied this problem in adenovirus type 12 (Ad12)-transformed cells or in Ad12-induced hamster tumors. Since integrates are frequently methylated de novo, it appears that they might be modified by an ancient defense mechanism against foreign DNA. In cells transgenic for the DNA of Ad12 or for the DNA of bacteriophage ?, changes in cellular methylation and transcription patterns have been observed. Thus, the insertion of foreign DNA can have important functional consequences that are not limited to the site of foreign DNA insertion. These findings appear to be relevant also for tumor biology and for the interpretation of data derived from experiments with transgenic organisms. For most animals, the main portal of entry for foreign DNA is the gastrointestinal tract. Large amounts of foreign DNA are regularly ingested with the supply of nutrients. Starting in 1987/1988, we have been investigating the fate of orally administered foreign DNA in mice. Naked DNA of bacteriophage M13 and the cloned gene for the green fluorescent protein (GFP) of Aequorea victoria have been used as test molecules. Moreover, the plant-specific gene for the ribulose-1,5-bisphosphate carboxylase (rubisco) has been followed in mice after feeding soybean leaves. At least transiently, food-ingested DNA can be traced to different organs and, after transplacental transfer, to fetuses and newborns. There is no evidence for germ line transmission or for the expression of orally administered GFP DNA.

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


Learning from the future of component repositories ? We consider quality issues that can arise in future evolutions of software repositories. We define a class of such issues that is amenable to automatic verification. Two relevant instances of such a class are identified: outdated and challenged components. We validate our findings on real-world repositories.

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

component repository
quality assurance
software evolution
speculative analysis
open source


General evolutionary theory of information production processes and applications to the evolution of networks Evolution of information production processes (IPPs) can be described by a general transformation function for the sources and for the items. It generalises the FellmanJakobsson transformation which only works on the items. In this paper the dual informetric theory of this double transformation, defined by the rank-frequency function, is described by, e.g. determining the new size-frequency function. The special case of power law transformations is studied thereby showing that a Lotkaian system is transformed into another Lotkaian system, described by a new Lotka exponent. We prove that the new exponent is smaller (larger) than the original one if and only if the change in the sources is smaller (larger) than that of the items. Applications to the study of the evolution of networks are given, including cases of deletion of nodes and/or links but also applications to other fields are given.

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

ipp
information production process
zipf
network


A hybrid algorithm for automatic segmentation of slowly moving objects Segmentation of moving objects in video sequences is a basic task in many applications. However, it is still challenging due to the semantic gap between the low-level visual features and the high-level human interpretation of video semantics. Compared with segmentation of fast moving objects, accurate and perceptually consistent segmentation of slowly moving objects is more difficult. In this paper, a novel hybrid algorithm is proposed for segmentation of slowly moving objects in video sequence aiming to acquire perceptually consistent results. Firstly, the temporal information of the differences among multiple frames is employed to detect initial moving regions. Then, the Gaussian mixture model (GMM) is employed and an improved expectation maximization (EM) algorithm is introduced to segment a spatial image into homogeneous regions. Finally, the results of motion detection and spatial segmentation are fused to extract final moving objects. Experiments are conducted and provide convincing results.

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

moving object segmentation
spatio-temporal information
frame difference
fusing operation


Finite element analysis of the influence of loading rate on a model of the full lumbar spine under dynamic loading conditions Despite an increase in the number of experimental and numerical studies dedicated to spinal trauma, the influence of the rate of loading or displacement on lumbar spine injuries remains unclear. In the present work, we developed a bio-realistic finite element model (FEM) of the lumbar spine using a comprehensive geometrical representation of spinal components and material laws that include strain rate dependency, bone fracture, and ligament failure. The FEM was validated against published experimental data and used to compare the initiation sites of spinal injuries under low (LD) and high (HD) dynamic compression, flexion, extension, anterior shear, and posterior shear. Simulations resulted in forcedisplacement and moment-angular rotation curves well within experimental corridors, with the exception of LD flexion where angular stiffness was higher than experimental values. Such a discrepancy is attributed to the initial toe-region of the ligaments not being included in the material law used in the study. Spinal injuries were observed at different initiation sites under LD and HD loading conditions, except under shear loads. These findings suggest that the strain rate dependent behavior of spinal components plays a significant role in load-sharing and failure mechanisms of the spine under different loading conditions.

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

bone fracture
finite element model
lumbar spine

dynamic load
ligament tear
experimental validation


Speech enhancement based on undecimated wavelet packet-perceptual filterbanks and MMSESTSA estimation in various noise environments In this paper, we proposed a new speech enhancement system, which integrates a perceptual filterbank and minimum mean square errorshort time spectral amplitude (MMSESTSA) estimation, modified according to speech presence uncertainty. The perceptual filterbank was designed by adjusting undecimated wavelet packet decomposition (UWPD) tree, according to critical bands of psycho-acoustic model of human auditory system. The MMSESTSA estimation (modified according to speech presence uncertainty) was used for estimation of speech in undecimated wavelet packet domain. The perceptual filterbank provides a good auditory representation (sufficient frequency resolution), good perceptual quality of speech and low computational load. The MMSESTSA estimator is based on a priori SNR estimation. A priori SNR estimation, which is a key parameter in MMSESTSA estimator, was performed by using decision directed method. The decision directed method provides a trade off between noise reduction and signal distortion when correctly tuned. The experiments were conducted for various noise types. The results of proposed method were compared with those of other popular methods, Wiener estimation and MMSElog spectral amplitude (MMSELSA) estimation in frequency domain. To test the performance of the proposed speech enhancement system, three objective quality measurement tests (SNR, segSNR and ItakuraSaito distance (ISd)) were conducted for various noise types and SNRs. Experimental results and objective quality measurement test results proved the performance of proposed speech enhancement system. The proposed speech enhancement system provided sufficient noise reduction and good intelligibility and perceptual quality, without causing considerable signal distortion and musical background noise.

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

minimum mean square errorshort time spectral amplitude estimation


Local bandwidth selectors for deconvolution kernel density estimation We consider kernel density estimation when the observations are contaminated by measurement errors. It is well-known that the success of kernel estimators depends heavily on the choice of a smoothing parameter called the bandwidth. A number of data-driven bandwidth selectors exist, but they are all global. Such techniques are appropriate when the density is relatively simple, but local bandwidth selectors can be more attractive in more complex settings. We suggest several data-driven local bandwidth selectors and illustrate via simulations the significant improvement they can bring over a global bandwidth.

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

contaminated data
data-driven bandwidth
ebbs
errors-in-variables
kernel smoothing
plug-in


Multipoint boundary value problems by differential quadrature method This paper extends the application of the differential quadrature method (DQM) to high order (greater than or equal to 3(rd)) ordinary differential equations with the boundary conditions specified at multiple points (greater than or equal to three different points). Explicit weighting coefficients for higher order derivatives have been derived using interpolating trigonometric polynomials. A three-point, linear third-order differential equation governing the shear deformation of sandwich beams is examined. Two examples of four-point nonlinear fourth-order systems are also presented. Accurate results are obtained for the example problems. Since boundary conditions are usually specified only at two extreme ends and not at intermediate boundary points, the present work opens new areas of application of the DQM. (C) 2001 Elsevier Science Ltd. All rights reserved.

O O O O O B I I O O O O O O O B I I O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 collocation method
multipoint boundary value problem
collocation
frechet derivative
numerical method


A new addition formula for elliptic curves over GF(2(n)) In this paper, we propose a new addition formula in projective coordinates for elliptic curves over GF (2'). The new formula speeds up the elliptic curve scalar multiplication by reducing the number of field multiplications, This was achieved by rewriting the elliptic curve addition formula, The complexity analysis shows that the new addition formula speeds up the addition in projective coordinates by about 10-2 percent, which leads to enhanced scalar multiplication methods for random and Koblitz curves.

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

elliptic curves
projective coordinates
scalar multiplication


Improved algorithms for two single machine scheduling problems In this paper, we investigate two single machine scheduling problems. The first problem addresses a class of the two-Stage scheduling problems in which the first stage is job production and the second stage is job delivery. For the case that jobs are processed on a single machine and delivered by a single vehicle to one customer area, with the objective of minimizing the time when all jobs are completed and delivered to the customer area and the vehicle returns to the machine, an approximation algorithm with a worst-case ratio of 5/3 is known and no approximation can have a worst-case of 3/2 unless P = NP. We present an improved approximation algorithm with a worst-case ratio of 53/35, which only leaves a gap of 1/70. The second problem is a single machine scheduling problem subject to a period of maintenance. The objective is to minimize the total completion time. The best known approximation algorithm has a worst-case ratio of 20/17. We present a polynomial time approximation scheme. (C) 2006 Elsevier B.V. All rights reserved.

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


learning juntas We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give an algorithm for learning such functions from uniform random examples which runs in time roughly (n k ) ?/(? + 1) , where ? < 2.376 is the matrix multiplication exponent. We thus obtain the first polynomial factor improvement on the naive n k time bound which can be achieved via exhaustive search. Our algorithm and analysis exploit new structural properties of Boolean functions.

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

fourier
uniform distribution
relevant variables


Object recognition using wavelets, L-G graphs and synthesis of regions This paper presents a recipe of methodologies for object recognition using wavelets, local-global (L-G) graphs and a region synthesis approach. In particular, the wavelets rearrange the shape of an object for reaching a desirable size, the L-G graphs represent the shape, color, texture and location of each image region obtained by an image segmentation method and the synthesis of the regions that compose an object is achieved by synthesizing their graph representations under certain neighborhood criteria. The synthesis of the regions is based on the L-G modeling that compares a set of L-G-based object models sitting in an L-G database. The methodology is accurate for objects existed in the database and it has the ability of "learning" new L-G patterns associated with objects that do not exist in the database. Illustrative examples are also provided. (c) 2006 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.

B I O B O B O O O O O O O O O O O O B I O B O O B O O B I O O O O B O O O O O O O O O O O O O B O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 recognition
wavelets
graphs
region synthesis


a computer architecture for highly parallel signal processing A computer of unusual architecture is described that achieves highly parallel operation through use of a data-flow program representation. The machine is especially suited for signal processing computations such as waveform generation, modulation, and filtering, in which a group of operations must be performed once for each sample of the signals being processed. The difficulties of processor switching and memory/processor interconnection arising in attempts to adapt Von Neuman type computers for parallel operation are avoided by an organization in which sections of the machine communicate through transmission of information packets, and delays in packet transmission do not compromise effective utilization of the hardware. The design concept is especially suited to implementation using asynchronous logic and large-scale integrated circuits. Application of the concepts to generalized data-flow program languages is under study.

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


Multimodal biomedical image indexing and retrieval using descriptive text and global feature mapping The images found within biomedical articles are sources of essential information useful for a variety of tasks. Due to the rapid growth of biomedical knowledge, image retrieval systems are increasingly becoming necessary tools for quickly accessing the most relevant images from the literature for a given information need. Unfortunately, article text can be a poor substitute for image content, limiting the effectiveness of existing text-based retrieval methods. Additionally, the use of visual similarity by content-based retrieval methods as the sole indicator of image relevance is problematic since the importance of an image can depend on its context rather than its appearance. For biomedical image retrieval, multimodal approaches are often desirable. We describe in this work a practical multimodal solution for indexing and retrieving the images contained in biomedical articles. Recognizing the importance of text in determining image relevance, our method combines a predominately text-based image representation with a limited amount of visual information, in the form of quantized content-based visual features, through a process called global feature mapping. The resulting multimodal image surrogates are easily indexed and searched using existing text-based retrieval systems. Our experimental results demonstrate that our multimodal strategy significantly improves upon the retrieval accuracy of existing approaches. In addition, unlike many retrieval methods that utilize content-based visual features, the response time of our approach is negligible, making it suitable for use with large collections.

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


Dynamic Synchronous/Asynchronous Replication Online, remote, data replication is critical for today's enterprise IT organization. Availability of data is key to the success of the organization. A few hours of downtime can cost from thousands to millions of dollars With increasing frequency, companies are instituting disaster recovery plans to ensure appropriate data availability in the event of a catastrophic failure or disaster that destroys a site (e.g. flood, fire, or earthquake). Synchronous and asynchronous replication technologies have been available for a long period of time. Synchronous replication has the advantage of no data loss, but due to latency, synchronous replication is limited by distance and bandwidth. Asynchronous replication on the other hand has no distance limitation, but leads to some data loss which is proportional to the data lag. We present a novel method, implemented within EMC Recover-Point, which allows the system to dynamically move between these replication options without any disruption to the I/O path. As latency grows, the system will move from synchronous replication to semi-synchronous replication and then to snapshot shipping. It returns to synchronous replication as more bandwidth is available and latency allows.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 impact of genetic variation in comt and bdnf on resting-state functional connectivity Genetic imaging techniques allow investigation of the mechanisms by which genetic variants influence brain structure and function. The default mode network (DMN) is characterized by a default state of neuronal activity in the brain that is linked to core processes of human cognition. This study examined the role of catechol-O-methyl transferase (COMT) and brain-derived neurotrophic factor (BDNF) polymorphisms on functional connectivity between brain areas. Twenty-three healthy volunteers underwent a resting-state functional magnetic resonance imaging scan and genotyping of COMT and BDNF single nucleotide polymorphisms (SNPs). A resting-state functional connectivity map was created using the posterior cingulate cortex (PCC) as a seed region. The Val/Val homozygote group of the COMT Val158Met SNP showed significantly greater DMN connectivity in the medial and superior frontal gyri and cerebellum compared with the Met allele carrier group. For the BDNF Val66Met SNP, connectivity between the PCC and precuneus was stronger in the Val/Val homozygote group than in the Met allele carrier group. Different patterns of DMN connectivity related to BDNF and COMT SNPs were observed in this study. These findings suggest interaction between genes and functional connectivity in the brain and indicate that altered functional connectivity may be an endophenotype of cognitive vulnerability. 2012 Wiley Periodicals, Inc. Int J Imaging Syst Technol, 22, 97102, 2012

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

resting-state connectivity
functional neuroimaging
brain-derived neurotrophic factor
catechol-o-methyl transferase
genetic polymorphism


Multiobjective controller design handling human preferences ? Trends in controller design point to the integration of several objectives to achieve new performances. Moreover, it is easy to set the controller design problem as an optimization problem. Therefore, future improvements are likely to be based on the adequate formulation and resolution of the multiobjective optimization problem. The multiobjective optimization strategy called physical programming provides controller designers with a flexible tool to express design preferences with a physical meaning. For each objective (settling time, overshoot, disturbance rejection, etc.) preferences are established through categories such as desirable, tolerable, unacceptable, etc. to which numerical values are assigned. The problem is normalized and converted to a single-objective optimization problem but normally it results in a multimodal problem very difficult to solve. Genetic algorithms provide an adequate solution to this type of problems and open new possibilities in controller design and tuning.

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

multiobjective optimization
controller design


Compression of SAR raw data through range focusing and variable-rate trellis-coded quantization There is an ever-growing interest in the compression of SAR data because of the huge resources they require for storage and transmission. This is especially true for spaceborne sensors, given the limited capacity of the downlink channel. Unfortunately, SAR data lack the useful properties on which compression algorithms rely; indeed, these are present in the focused images, but focusing is too complex for on-board implementation at this time. In [11], we proposed to perform on the satellite only the low-complexity range focusing, which increases the data correlation and better concentrates their energy. These properties were then exploited by adopting a variable-rate vector quantizer, with a clear performance improvement with respect to reference techniques. However, vector quantization (VQ) is too complex for actual on-board implementation, and therefore, here we replace VQ with trellis-coded VQ. To limit complexity, only small vectors are used, which reduces VQ's ability to exploit data dependencies; on the other hand, trellis coding allows one to encode large blocks of data at once, and to obtain a better partition of the input space. Experiments on real SAR data show that the overall performance is comparable to that of [11], but the complexity is much lower, making on-board implementation possible.

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

synthetic aperture
trellis coded quantization


Optimization of sylvite transformation into arcanite using experimental design methodology This study is an application of the experimental design methodology for optimizing a potassium sulfate synthesis reaction. The latter is a two-stage reaction through an intermediate product (Schoenite: K2SO4 center dot MgSO4 center dot 6H(2)O). To determine optimal experimental conditions of the first stage, we have conducted a fractional factorial design and a central composite one. The optimal conditions of the second stage were determined only by means of a fractional factorial design. Several physico-chemical techniques were used to implement this study, namely potentiometry, complexometry, gravimetry and X-ray diffraction. This work has showed that this double decomposition reaction, when performed under the determined optimal conditions, gives good quality potassium sulfate (purity more than 95%) with a maximal yield. Copyright (c) 2008 John Wiley & Sons, Ltd.

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


Conversions between three methods for representing 3D surface textures under arbitrary illumination directions Representing the appearances of surfaces illuminated from different directions has long been an active research topic. While many representation methods have been proposed, the relationships and conversion between different representations have been less well researched. These relationships are important, as they provide (a) an insight as to the different capabilities of the surface representations, and (b) a means by which they may be converted to common formats for computer graphic applications. In this paper, we introduce a single mathematical framework and use it to express three commonly used surface texture relighting representations: surface gradients (Gradient), Polynomial Texture Maps (PTM) and eigen base images (Eigen). The framework explicitly reveals the relations between the three methods, and from this we propose a set of conversion methods. We use 26 rough surface textures illuminated from 36 directions for our experiments and perform both quantitative and qualitative assessments to evaluate the conversion methods. The quantitative assessment uses a normalized root-mean-squared error as metric to compare the original images and those produced by proposed representation methods. The qualitative assessment is based on psychophysical experiments and non-parametric statistics. The results from the two assessments are consistent and show that the original Eigen representation produces the best performance. The second best performances are achieved by the original PTM representation and the conversion between Polynomial Texture Maps (PTM) and eigen base images (Eigen), while the performances of other representations are not significantly different.

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

gradient
eigen
relighting
conversion methods


A novel clonal selection algorithm and its application to traveling salesman problem The Clonal Selection Algorithm (CSA) is employed by the natural immune system to define the basic features of an immune response to an antigenic stimulus. In the immune response, according to Burnet's clonal selection principle, the antigen imposes a selective pressure on the antibody population by allowing only those cells which specifically recognize the antigen to be selected for proliferation and differentiation. However ongoing investigations indicate that receptor editing, which refers to the process whereby antigen receptor engagement leads to a secondary somatic gene rearrangement event and alteration of the receptor specificity, is occasionally found in affinity maturation process. In this paper, we extend the traditional CSA approach by incorporating the receptor editing method, named RECSA, and applying it to the Traveling Salesman Problem. Thus, both somatic hypermutation (HM) of clonal selection theory and receptor editing (RE) are utilized to improve antibody affinity. Simulation results and comparisons with other general algorithms show that the RECSA algorithm can effectively enhance the searching efficiency and greatly improve the searching quality within reasonable number of generations.

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

clonal selection algorithm
receptor editing
traveling salesman problem
affinity


Recursive program optimization through inductive synthesis proof transformation The research described in this paper involved developing transformation techniques that increase the efficiency of the original program, the source, by transforming its synthesis proof into one, the tar-get, which yields a computationally more efficient algorithm. We describe a working proof transformation system that, by exploiting the duality between mathematical induction and recursion, employs the novel strategy of optimizing recursive programs by transforming inductive proofs. We compare and contrast this approach with the more traditional approaches to program transformation and highlight the benefits of proof transformation with regards to search, correctness, automatability, and generality.

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


role-based access control in ambient and remote space In the era of Ubiquitous Computing and world-wide data transfer mobility, as an innovative aspect of professional activities, imposes new andcomplex problems of mobile and distributed access to information,services, and on--line negotiations for this purpose. This paperrestricts itself to presenting a distributed and location--dependentRBAC approach which is multi--layered. Also an adapted form ofAdministration Nets is presented whichallows the scheduling of distributed on--line processes for automatedlocation--dependent negotiating procedures, and for provingtheir correctness. Examples are discussed in some detail.

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


On the security of the Okamoto-Tanaka ID-based key exchange scheme against active attacks As far as the knowledge of authors, the rigorous security of Okamoto-Tanaka identity-based key exchange scheme nas shown in [4] for the first time since its invention. However, the analysis deals with only the passive attack. In this paper, we give several models of active attacks against the scheme and show the rigorous security of the scheme in these models. We prove several relationships among attack models, including that (1) breaking the scheme in one attack model is equivalent to breaking the RSA public-key cryptosystem and (2) breaking the scheme in another attack model is equivalent to breaking the Diffie-Hellman key exchange scheme over Z(n). The difference of the complexity stems from the difference of the timing of dishonest party's sending out and receiving messages.

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

okamoto-tanaka key exchange scheme
id-based scheme
active attack
known-key attack
forward secrecy


a study of low-cost, robust assistive listening system based on uhf wireless technology In this paper, we describe the development of a low cost wireless UHF broadcasting system prototype. It is designed for a short range application, with up to ten receivers, such as one used in a classroom for hearing impaired students. This system is intended to be a low cost alternative to an existing FM system, with additional capability in security with an encryption function. Additionally a multimode function including one-to-one, one-to-many and broadcast is added. Test results show that the system operating range is approximately ten metres, and the sound quality is close to telephone quality. The broadcasting mode and system range fit the requirements for small classroom use.

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


Description and verification of an aquatic optics Monte Carlo model An open source aquatic optics Monte Carlo (AOMC) model is described and evaluated. The open source nature of the AOMC software allows for a complete peer review process. The AOMC model simulates apparent optical properties commonly measured in aquatic systems. These include spectral or non-spectral radiance, upwelling and downwelling planar and scalar irradiances. The model output can be in a non-gridded or gridded format with the latter used to simulate a radiometric image. In gridded mode, the user may specify a bottom target whose reflecting characteristics are independent from the surrounding water bottom boundary. In both gridded and non-gridded mode, the model inputs consist of depth dependent concentrations of the various components comprising the simulated aquatic environment, their inherent optical properties, and environmental characteristics such as skylight distribution and optical properties of the aquatic bottom boundary. The model is evaluated by comparing its output to: (1) a test of the models closure, (2) an evaluation of a known relationship, (3) the comparison with results from other published numerical models, and (4) the simulation of a spectral pivot-point. The results of the evaluation indicate good agreement between the model and the anticipated outcome.

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


A droplet in a stationary electric field Water droplets on insulating material influence strongly the aging process of the material. The shape of the droplets signifies the state of the aging material. The present paper discusses a numerical procedure to calculate the droplet shape in an electric field generated by a constant voltage. A combined stationary solution of the droplet shape and the electric field is searched for. This leads to a free boundary value problem which is solved by an iterative method. The typical shapes of the droplets are shown for several voltages. Special care is taken to the singularities of the electric field in the triple points. (C) 2003 IMACS. Published by Elsevier B.V. All rights reserved.

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

stationary electric field
droplets
free boundary value problem

insulators
corner points
numerical analysis


An efficient quantum search engine on unsorted database We consider the problem of finding one or more desired items out of an unsorted database. Patel has shown that if the database permits quantum queries, then mere digitization is sufficient for efficient search for one desired item. The algorithm, called factorized quantum search algorithm, presented by him can locate the desired item in an unsorted database using O(\(log_4N\)) queries to factorized oracles. But the algorithm requires that all the attribute values must be distinct from each other. In this paper, we discuss how to make a database satisfy the requirements, and present a quantum search engine based on the algorithm. Our goal is achieved by introducing auxiliary files for the attribute values that are not distinct, and converting every complex query request into a sequence of calls to factorized quantum search algorithm. The query complexity of our algorithm is O(\(log_4N\)) for most cases.

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

quantum search model
quantum computation
database search


Finite element modeling of borehole heat exchanger systems Part 1. Fundamentals Single borehole heat exchanger (BHE) and arrays of BHE are modeled by using the finite element method. The first part of the paper derives the fundamental equations for BHE systems and their finite element representations, where the thermal exchange between the borehole components is modeled via thermal transfer relations. For this purpose improved relationships for thermal resistances and capacities of BHE are introduced. Pipe-to-grout thermal transfer possesses multiple grout points for double U-shape and single U-shape BHE to attain a more accurate modeling. The numerical solution of the final 3D problems is performed via a widely non-sequential (essentially non-iterative) coupling strategy for the BHE and porous medium discretization. Four types of vertical BHE are supported: double U-shape (2U) pipe, single U-shape (1U) pipe, coaxial pipe with annular (CXA) and centred (CXC) inlet. Two computational strategies are used: (1) The analytical BHE method based on Eskilson and Claesson's (1988) solution, (2) numerical BHE method based on Al-Khoury et al.'s (2005) solution. The second part of the paper focusses on BHE meshing aspects, the validation of BHE solutions and practical applications for borehole thermal energy store systems. (C) 2010 Elsevier Ltd. All rights reserved.

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

borehole heat exchanger
thermal resistances

finite elements
local problem
static condensation


Improving fairness in a WRED-based DiffServ network: A fluid-flow approach The DiffServ architecture has been proposed as a scalable approach for upgrading the Internet, adding service differentiation functionalities. However, several aspects of this architecture still have to be analyzed and solved. For this reason, network designers need to be provided with tools which are able to estimate the average behavior of a DiffServ network with a high level of accuracy and in a short time. In this paper a fluid-flow model of a DiffServ network supporting Assured Forwarding Per-Hop Behavior (PHB) and loaded with TO flows is proposed. At the edge of the network, two rate three color markers (TRTCM) are employed as profile meters, while within the network core routers implement a Weighted RED (WRED) buffer management mechanism. In order to demonstrate the high accuracy of the proposed model, a comparison between model and simulation results is performed, taking into account not just a bottleneck link, but a complex network topology. The proposed analytical framework is then used to analyze the impact of several factors on the fair sharing of network resources between traffic aggregates with the same traffic profile, and to achieve some guidelines for WRED parameter settings with the aim of reducing unfairness. (C) 2008 Elsevier B.V. All rights reserved.

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


Automatic segmentation of corpus collasum using Gaussian mixture modeling and Fuzzy C means methods This paper presents a comparative study of the success and performance of the Gaussian mixture modeling and Fuzzy C means methods to determine the volume and cross-sectionals areas of the corpus callosum (CC) using simulated and real MR brain images. The Gaussian mixture model (GMM) utilizes weighted sum of Gaussian distributions by applying statistical decision procedures to define image classes. In the Fuzzy C means (FCM), the image classes are represented by certain membership function according to fuzziness information expressing the distance from the cluster centers. In this study, automatic segmentation for midsagittal section of the CC was achieved from simulated and real brain images. The volume of CC was obtained using sagittal sections areas. To compare the success of the methods, segmentation accuracy, Jaccard similarity and time consuming for segmentation were calculated. The results show that the GMM method resulted by a small margin in more accurate segmentation (midsagittal section segmentation accuracy 98.3% and 97.01% for GMM and FCM); however the FCM method resulted in faster segmentation than GMM. With this study, an accurate and automatic segmentation system that allows opportunity for quantitative comparison to doctors in the planning of treatment and the diagnosis of diseases affecting the size of the CC was developed. This study can be adapted to perform segmentation on other regions of the brain, thus, it can be operated as practical use in the clinic.

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

gaussian mixture modeling
fuzzy c means
corpus collasum


An enhanced thermal face recognition method based on multiscale complex fusion for Gabor coefficients The recognition of thermal face is a very promising strategy in biometrics. It is invariant to illumination, robust to pose and immune to forgery. However, thermal face image consist of face heat energy and face counter information mainly, and it makes lower discrimination for inter-class. In this paper, an enhanced thermal face recognition approach based on Multiscale Complex Fusion for Gabor coefficients (MCFG) is proposed. Initially, the Complex Gabor Jet Descriptor (CGJD) is acquired based on the block mean and standard deviation generated from the magnitude, phase, real and imaginary parts of Gabor coefficients. Then, the Complex LDA (CLDA) algorithm and feature level fusion are implemented on multiscale Gabor coefficients to reduce the dimension and enhance the discrimination. Experiments conducted on two thermal face databases NVIE and IRIS, which have some challenging thermal face images, show that the proposed thermal face recognition approach significantly outperforms the state-of-the-art approaches.

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

thermal face recognition
multiscale
complex gabor jet descriptor
complex lda
feature level fusion


An intrusion detection model based upon intrusion detection markup language (IDML) Due to the rapid growth of networked computer resources and the increasing importance of related applications, intrusions which threaten the infrastructure of these applications have are critical problems. In recent years, several intrusion detection systems designed to identify and detect possible intrusion behaviors. In this work, an intrusion detection model is proposed to for building an intrusion detection system which can solve problems involved in building an intrusion detection systems, including pattern representation. computability, performance, extendibility and maintenance problems. In this model, IDML is first designed to express intrusion patterns, and these patterns are transformed into intrusion pattern state machines. Once the intrusion pattern state machines are obtained, the corresponding intrusion detection mechanism that can use these state machines to detect intrusions is designed. To evaluate the performance of our model, an IDML-based intrusion detection experimental system based upon this architecture has been implemented.

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

intrusion detection
intrusion pattern
idml


tcp with adaptive pacing for multihop wireless networks In this paper, we introduce a novel congestion control algorithm for TCP over multihop IEEE 802.11 wireless networks implementing rate-based scheduling of transmissions within the TCP congestion window. We show how a TCP sender can adapt its transmission rate close to the optimum using an estimate of the current 4-hop propagation delay and the coefficient of variation of recently measured round-trip times. The novel TCP variant is denoted as TCP with Adaptive Pacing (TCP-AP). Opposed to previous proposals for improving TCP over multihop IEEE 802.11 networks, TCP-AP retains the end-to-end semantics of TCP and does neither rely on modifications on the routing or the link layer nor requires cross-layer information from intermediate nodes along the path. A comprehensive simulation study using ns-2 shows that TCP-AP achieves up to 84\% more goodput than TCP NewReno, provides excellent fairness in almost all scenarios, and is highly responsive to changing traffic 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 O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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 wireless networks
end-to-end congestion control
performance evaluation


What do transition organizations lack to be innovative? Purpose - Innovativeness is probably the most effective way for organizations in the transition economies to improve their competitiveness. The purpose of this research is to find those factors, which significantly contribute to the innovativeness of organizations in the oldest market-based economies but they have not been developed in the transition organizations. Design/methodology/approach - A range of recently published works, which aimed to provide different theoretical findings and best practice of innovative economies highlighted organizational culture, entrepreneurship and market orientation as the most important factors influencing the organizational innovation intensity and sustained competitive advantage. These factors and their relationships together with the characteristics of the transition economies were applied to put hypotheses about their impact on innovation intensity in the transition organizations. The structural equation modeling was used to test these hypotheses on the sample of 214 Slovenian organizations. Findings - The comparison of both innovation models, i.e. one significant for the innovative organizations, and the other found for the transition organizations showed that innovative organizational culture and market orientation have been the most important missing factors preventing the transition organizations from being innovative and thus achieving the sustained competitive advantage. Research limitations/implications - Data collection was limited to one country, i.e. Slovenia. Practical implications; - The results obtained show that organizations cannot be innovative if all the most important factors influencing the innovation capability are not equally developed. Originality/value - The missing factors and relations which have been the main obstacles for the transition organizations to be more innovative are found by benchmarking based on the structural equation modeling.

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


PERSPECTIVES ON THE PERFORMANCE OF SUPPLY CHAIN SYSTEMS: THE EFFECTS OF ATTITUDE AND ASSIMILATION The introduction of information systems into industry to enhance operational efficiency is a common business strategy. Introducing such information systems should be expected to enhance employee satisfaction if the systems work as expected. Based on previous studies of supply chain management (SCM) and using institution theory, and technology use and acceptance models, this study applies the lens of attitude and assimilation to explore employee behavior toward using SCM systems after implementation, as well as how employees' attitude and assimilation impact on the performance of the supply chain. Collecting data from employees in the relevant departments from selected companies through a survey and applying SEM in the analysis, the study finds that the employee's perceived ease of use, perceived usefulness, and the subjective norm (Theory of Reasoned Action) have a positive impact on their attitudes toward their use of the SCM systems. Furthermore, it was found that top management's positive beliefs and participation also have a positive impact on assimilation and SCM performance. Finally, it was found that attitudes toward the use of SCM systems impact upon information performance but not in other outcomes of SCM operations. Implications for research and practice are raised. This study contributes to the body of knowledge by adding to our understanding of the relationships among users' attitude, assimilation, and business performance at the post-adoption stage within the context of SCM systems.

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

attitude and assimilation
supply chain management

information systems performance
post-adoption


Test set embedding for deterministic BIST using a reconfigurable interconnection network We present a new approach for deterministic built-in self-test (BIST) in which a reconfigurable interconnection network (RIN) is placed between the outputs of a pseudorandom pattern generator and the scan inputs of the circuit under test (CUT). The RIN, which consists only of multiplexer switches, replaces the phase shifter that is typically used in pseudorandom BIST to reduce correlation between the test data bits that are fed into the scan chains. The connections between the linear-feedback shift-register (LFSR) and the scan chains can be dynamically changed (reconfigured) during a test session. In this way, the RIN is used to match the LFSR outputs to the test cubes in a deterministic test set. The control data bits used for reconfiguration ensure that all the deterministic test cubes are embedded in the test patterns applied to the CUT. The proposed approach requires very little hardware overhead, only a modest amount of CPU time, and fewer control bits compared to the storage required for reseeding techniques or for hybrid BIST. Moreover, as a nonintrusive BIST solution, it does not require any circuit redesign and has minimal impact on circuit performance.

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

embedded core testing
system-on-a-chip (soc) testing
test application time
test-data volume