A structure-preserving method for the quaternion LU decomposition in quaternionic quantum theory In this paper, for the first time, the structure-preserving Gauss transformation is defined. Then by means of its real representation matrix, we present a novel structure-preserving algorithm for the LU decomposition of a quaternion matrix. Numerical experiments show that the structure-preserving algorithm is better than that in the newest quaternion toolbox for matlab (QTFM). (C) 2013 Elsevier B.V. All rights reserved.

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


inductor design of 20-v boost converter for low power 3d solid state drive with nand flash memories A 3D-integrated Solid State Drive (SSD) with the boost converter can achieve both the low power and the fast write-operation at the small die area of the NAND flash memory. The performance of the boost converter, however, is critically affected by the inductor, because the output voltage of the boost converter, the rising time, and the energy consumption during the boost are determined by the inductor. Therefore, this paper proposes a design methodology of the inductor of the boost converter for the 3D SSD. By using the boost converter with the optimized inductor, the energy during write-operation of the proposed 1.8-V 3D-SSD is decreased by 68\% compared with the conventional 3.3-V 3D-SSD with the charge pump.

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

charge pump
boost converter
ssd
inductor design


Simulation methods for quantum walks on graphs applied to formal language recognition We describe an algorithm which automates the generation of appropriate shift and coin operators for a discrete time quantum walk, given the adjacency matrix of the graph over which the walk is run. This gives researchers the freedom to numerically investigate any discrete time quantum walk over graphs of a computationally tractable size by greatly reducing the time required to initialise a given walk. We then describe one application in which the swift initialisation of walks has enabled systematic investigations of walks over a large number of structures. New results concerning this application, which is to formal language recognition, are described. The reliability of these results, as well as the general suitability of numerical analysis as a tool for investigating discrete time quantum walks, are briefly discussed. We also mention specific Python packages which facilitate our simulations and analysis, motivating the use of high level programming languages in this context.

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

quantum walks
formal language recognition
algorithm
simulation


image tag refinement towards low-rank, content-tag prior and error sparsity The vast user-provided image tags on the popular photo sharing websites may greatly facilitate image retrieval and management. However, these tags are often imprecise and/or incomplete, resulting in unsatisfactory performances in tag related applications. In this work, the tag refinement problem is formulated as a decomposition of the user-provided tag matrix D into a low-rank refined matrix A and a sparse error matrix E, namely D = A + E, targeting the optimality measured by four aspects: 1) low-rank: A is of low-rank owing to the semantic correlations among the tags; 2) content consistency: if two images are visually similar, their tag vectors (i.e., column vectors of A) should also be similar; 3) tag correlation: if two tags co-occur with high frequency in general images, their co-occurrence frequency (described by two row vectors of A) should also be high; and 4) error sparsity: the matrix E is sparse since the tag matrix D is sparse and also humans can provide reasonably accurate tags. All these components finally constitute a constrained yet convex optimization problem, and an efficient convergence provable iterative procedure is proposed for the optimization based on accelerated proximal gradient method. Extensive experiments on two benchmark Flickr datasets, with 25K and 270K images respectively, well demonstrate the effectiveness of the proposed tag refinement approach.

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

error sparsity
content consistency
tag refinement
tag correlation


Simultaneous inpainting for image structure and texture using anisotropic heat transfer model We propose a PDE-based image inpainting method using anisotropic heat transfer model, which can simultaneously propagate the structure and texture information. In structure inpainting, the propagating direction and intensity are related to image contents, and the strength of propagation along gradient direction is made inversely proportional to the magnitude of gradient. In texture inpainting, the added texture term reflects periodicity along the texture and its perpendicular direction. For numerical implementation, the step size of finite difference is adaptively chosen according to the curvature, leading to fewer iteration steps and satisfactory inpainting quality. Compared with other high order PDE methods and layered methods, the proposed approach is more concise and doesnt need image decomposition. Experiments are carried out to show effectiveness of the method.

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

image inpainting
structure
texture
pde
heat transfer
anisotropic
finite difference


The Distribution of Adiponectin Receptors on Human Peripheral Blood Mononuclear Cells Adiponectin, an adipocytokine with anti-inflammatory and insulin-sensitizing properties, may provide a mechanism by which insulin resistance accelerates autoimmunity in type 1 diabetes (T1D). Its actions are mediated by two receptors, adiponectin receptors 1 (ADIPOR1) and 2 (ADIPOR2). In this study, we measured their distribution on human peripheral mononuclear cells by flow cytometry. ADIPOR1 is present approximately on 1% of T cells, 93% of monocytes, 47% of B cells, and 21% of NK cells (P < 0.01 for difference between subsets). The distribution of ADIPOR2 was found to be similar (r= 0.992, P < 0.01), and staining could be blocked in an antigen-specific manner. We were also able to confirm our finding at an RNA level by PCR using sequence-specific primers. Our data are consistent with an immunoregulatory role for adiponectin in T1D.

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

adiponectin
insulin resistance
type 1 diabetes


Your time and my time: a temporal approach to groupware calendar systems Groupware calendar systems (GCS)on-line, networked calendar softwareare increasingly being used in large organizations. This paper presents a study of the use of GCS in organizations. It reviews major issues in the area, showing that current efforts lack attention to the temporal aspect, which seems to be at the center of a GCS. Sociotemporal order is a foundation of social organization, and as such it is embedded in the use of GCS. The paper reports on a survey of GCS use in a business organization to show the relevancy of the temporal approach. It concludes by showing the increasing importance of GCS in particular and calendar technologies in general in new patterns of working (virtual, mobile, and flexible) in emerging forms of organizations.

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

groupware calendar systems
calendar technologies

social time
clock time
time management
groupware


A Riccati-based primal interior point solver for multistage stochastic programming - Extensions We show that a Riccati-based Multistage Stochastic Programming solver for problems with separable convex linear/nonlinear objective developed in previous papers can be extended to solve more general Stochastic Programming problems. With a Lagrangean relaxation approach, also local and global equality constraints can be handled by the Riccati-based primal interior point solver. The efficiency of the approach is demonstrated on a 10 staged stochastic programming problem containing both local and global equality constraints. The problem has 1.9 million scenarios, 67 million variables and 119 million constraints, and was solved in 97 min on a 32 node PC cluster.

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

interior point methods
parallel computations


A note on Yaos theorem about pseudo-random generators Yaos theorem gives an equivalence between the indistinguishability of a pseudo-random generator and the unpredictability of the next bit from an asymptotic point of view. In this paper we present with detailed proofs, modified versions of Yaos theorem which can be of interest for the study of practical cryptographic primitives. In particular we consider non-asymptotic versions. We study the case of one pseudo-random generator, then the case of a family of pseudo-random generators with the same fixed length and finally we consider the asymptotic case. We compute in each case the cost of the reduction (in the sense of complexity theory) between the two algorithms.

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

cryptography
distinguishable
prediction
pseudo-randomness
pseudo-random number generator
94a60
11k45


Preferential normal fuzzy subgroups In this paper we consider the notion of normality on preferential fuzzy subgroups of a finite group G and define the associated concept of a normal pinned-flag. We discuss the preferential equality of quotients and products of normal preferential fuzzy subgroups. Further normalizers of fuzzy subgroups under preferential equality are briefly dealt with. Examples are given to illustrate the structure of preferential normal fuzzy subgroups and normal pinned-flags.

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

normal fuzzy subgroup
normal pinned-flags
normalizer
keychain


An Orientation Inference Framework for Surface Reconstruction From Unorganized Point Clouds In this paper, we present an orientation inference framework for reconstructing implicit surfaces from unoriented point clouds. The proposed method starts from building a surface approximation hierarchy comprising of a set of unoriented local surfaces, which are represented as a weighted combination of radial basis functions. We formulate the determination of the globally consistent orientation as a graph optimization problem by treating the local implicit patches as nodes. An energy function is defined to penalize inconsistent orientation changes by checking the sign consistency between neighboring local surfaces. An optimal labeling of the graph nodes indicating the orientation of each local surface can, thus, be obtained by minimizing the total energy defined on the graph. The local inference results are propagated over the model in a front-propagation fashion to obtain the global solution. The reconstructed surfaces are consolidated by a simple and effective inspection procedure to locate the erroneously fitted local surfaces. A progressive reconstruction algorithm that iteratively includes more oriented points to improve the fitting accuracy and efficiently updates the RBF coefficients is proposed. We demonstrate the performance of the proposed method by showing the surface reconstruction results on some real-world 3-D data sets with comparison to those by using the previous methods.

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

graph optimization
orientation inference
surface reconstruction


A location model for a web service intermediary Recently, Web services have entered the competition for a new type of distributed e-commerce platform. This paper studies the placement of servers of a Web service intermediary. The intermediary serves as a common interface to its clients while obtaining Web services from independent providers. The intermediary locates its servers by minimizing costs where a major component is network latency. We propose and study an integer programming formulation to determine the locations and usage rates of the servers of an intermediary. A greedy heuristic method is used to obtain good solutions to the problem.

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

web services intermediary
facility location
heuristic algorithm


Continuity focused choice of maxima: Yet another defuzzification method In this paper, we present a new defuzzification method for a Mamdani fuzzy controller. The method selects an element of the core of the fuzzy output set as defuzzification value, in a way that the continuity of the controller can be preserved. However, in order for this continuity to be guaranteed, some constraints on the components of the controller have to be taken into account. Except for some constraints of continuity, convexity and points of intersection for the input and output linguistic terms, we will define the property of linguistic continuity that has to be fulfilled by the controller. Further we show that the new defuzzification method is computationally very efficient and we point out how the fuzzy controller can be tuned by modifying the output linguistic terms. Finally, we also give two variants of the proposed formula. (C) 2001 Elsevier Science B.V. All rights reserved.

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


multimodal estimation of user interruptibility for smart mobile telephones Context-aware computer systems are characterized by the ability to consider user state information in their decision logic. One example application of context-aware computing is the smart mobile telephone. Ideally, a smart mobile telephone should be able to consider both social factors (i.e., known relationships between contactor and contactee) and environmental factors (i.e., the contactee's current locale and activity) when deciding how to handle an incoming request for communication.Toward providing this kind of user state information and improving the ability of the mobile phone to handle calls intelligently, we present work on inferring environmental factors from sensory data and using this information to predict user interruptibility. Specifically, we learn the structure and parameters of a user state model from continuous ambient audio and visual information from periodic still images, and attempt to associate the learned states with user-reported interruptibility levels. We report experimental results using this technique on real data, and show how such an approach can allow for adaptation to specific user preferences.

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

smart mobile telephones
user interruptibility

hmms
hierarchical hmms
scene learning
context awareness


Modelling of pH and inorganic carbon speciation in estuaries using the composition of the river and seawater end members An equilibrium model based on the CO2 system was developed to model pH throughout the estuarine salinity range using the composition of the river and seawater end members. In order to validate the model, a spectrophotometric method was used to measure pH in an estuary and laboratory mixing experiments. The model successfully represented the measured pH values (0.1 pH units) for three different river water end member compositions. The pH decreased at low salinities (S?02), increased at intermediate salinities (S?215), and then stabilised for higher salinity values. Changes in the inorganic carbon speciation in the low salinity region of estuaries result in assimilation of river borne CO2(aq).

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


Stochastic stability of Markovian jump BAM neural networks with leakage delays and impulse control ? This paper deals with the globally exponential stability of impulsive bidirectional associative memory (BAM) neural networks with both Markovian jump parameters and mixed time delays. The jumping parameters are determined by a continuous-time, discrete-state Markov chain. Different from the previous literature, the mixed time delays considered here comprise discrete, distributed and leakage time-varying delays. By using the LyapunovKrasovskii functional having triple integral terms and model transformation technique, some novel sufficient delay-dependent conditions are derived to ensure the globally exponential stability in the mean square of the suggested system. Moreover, the derivatives of time delays are not necessarily zero or smaller than one since several free matrices are introduced in our results. Finally, a numerical example and its simulations are provided to demonstrate the effectiveness of the theoretical results.

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

markovian jump bam neural networks
leakage delays
lyapunovkrasovskii functional
impulse control


Manifold discriminant regression learning for image classification Least square regression (LSR) and its variants have been widely used for classification tasks. However, LSR-based methods ignore the local geometry structure of the data and the transformation matrix is not sparse or robust. In this paper, a novel linear regression (LR) framework is proposed for image classification. Two concrete algorithms are proposed under the framework, which are named manifold discriminant regression learning (MDRL) and robust manifold discriminant regression learning (RMDRL). MDRL introduces different norms for different purposes in the learning steps. MDRL introduces a within-class graph and between-class graph to compute an optimal subspace that can separate data points belonging to different class as far as possible and keep the data points from the same class closely. MDRL joints different norms constraints to generate sparse projections for feature extraction and classification. To enhance the robustness of discriminative LSR (DLSR), RMDRL uses the nuclear norm as a regularization term to learn a robust projection matrix. Extensive experiments are conducted on many databases to evaluate the performance of the proposed methods and the states-of-the-art algorithms. The experimental results indicate that our proposed methods outperform the related algorithms.

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

discriminant
linear regression
image classification


Neural network based focal liver lesion diagnosis using ultrasound images Present study proposes a computer-aided diagnostic system to assist radiologists in identifying focal liver lesions in B-mode ultrasound images. The proposed system can be used to discriminate focal liver diseases such as Cyst, Hemangioma, Hepatocellular carcinoma and Metastases, along with Normal liver. The study is performed with 111 real ultrasound images comprising of 65 typical and 46 atypical images, which were taken from 88 subjects. These images are first enhanced and then regions of interest are segmented into 800 non-overlapping segmented regions-of-interest. Subsequently 208-texture based features are extracted from each segmented region-of-interest. A two step neural network classifier is designed for classification of five liver image categories. In the first step, a neural network classifier gives classification among five liver image categories. If neural network decision is for more than one class as obtained from the first step, binary neural network classifiers are used in the second step for crisp classification between two classes. Test results of two-step neural network classifier showed correct decisions of 432 out of 500 segmented regions-of-interest in test set with classification accuracy of 86.4%. The classifier has given correct diagnosis of 90.3% (308/340) in the tested segmented regions-of-interest from typical cases and 77.5% (124/160) in tested segmented regions-of-interest from atypical cases.

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

ultrasound
focal liver lesions
classification
neural network classifier


Hex-splines: A novel spline family for hexagonal lattices This paper proposes a new family of bivariate, nonseparable splines, called hex-splines, especially designed for hexagonal lattices. The starting point of the construction is the indicator function of the Voronoi cell, which is used to define in a natural way the first-order hex-spline. Higher order hex-splines are obtained by successive convolutions. A mathematical analysis of this new bivariate spline family is presented. In particular, we derive a closed form for a hex-spline of arbitrary order. We also discuss important properties, such as their Fourier transform and the fact they form a Riesz basis. We also highlight the approximation order. For conventional rectangular lattices, hex-splines revert to classical separable tensor-product B-splines. Finally, some prototypical applications and experimental results demonstrate the usefulness of hex-splines for handling hexagonally sampled data.

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

approximation theory
bivariate splines
sampling theory


Treewidth and minimum fill-in on permutation graphs in linear time Permutation graphs form a well-studied subclass of cocomparability graphs. Permutation graphs are the cocomparability graphs whose complements are also cocomparability graphs. A triangulation of a graph G is a graph H that is obtained by adding edges to G to make it chordal. lino triangulation of G is a proper subgraph of H then H is called a minimal triangulation. The main theoretical result of the paper is a characterisation of the minimal triangulations of a permutation graph, that also leads to a succinct and linear-time computable representation of the set of minimal triangulations. We apply this representation to devise linear-time algorithms for various minimal triangulation problems on permutation graphs, in particular, we give linear-time algorithms for computing treewidth and minimum fill-in on permutation graphs. (C) 2010 Elsevier B.V. All rights reserved.

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

treewidth
minimal triangulation
linear time
permutation graphs


evolutionary online services This paper present a technique based on genetic algorithms for generating online adaptive services. Online adaptive systems provide flexible services to a mass of clients/users for maximizing some system goals; they dynamically adapt the form and the content of the issued services while the population of clients evolve over time. The idea of online genetic algorithms (online GAs) is to use the online clients response behavior as a fitness function in order to produce the next generation of services. The principle implemented in online GAs, "the application environment is the fitness", allow to model highly evolutionary domains where both services providers and clients change and evolve over time. The flexibility and the adaptive behavior of this approach seems to be very relevant and promising for applications characterized by highly dynamical features such as in the web domain (online newspapers, e-markets, websites and advertising engines). Nevertheless the proposed technique has a more general aim for application environments characterized by a massive number of anonymous clients/users which require personalized services, such as in the case of many new IT applications.

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

evolutionary computation
adaptive models
online consumer behavior


Resource space view tour mechanism The resource space model is a new semantic data model for managing various resources. On the basis of the model, this paper proposes a view mechanism for finding and reusing legacy resource spaces according to users' idiosyncratic interests. It establishes a flexible reorganizing mechanism of legacy resource spaces to reduce redundant work. As a viewpoint organization strategy, the resource subject tree is proposed as an effective way of discovering desirable resource space views. A case study is presented to demonstrate the proposed approach. Copyright (c) 2007 John Wiley & Sons, Ltd.

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

data model
resource space model
resource space view
viewpoint


a vision based human robot interface for robotic walkthroughs in a biotech laboratory. Both Robots and Personal Computers established new markets about 30 years ago and were enabling factors in Automation and Information Technology. However, while you can see Personal Computers in almost every home nowadays, the domain of Robots in general still is mostly restricted to industrial automation. Due to the physical impact of robots, a safe design is essential, which most robots still lack of and therefore prevent their application for personal use, although a slow change can be noticed by the introduction of dedicated robots for specific tasks, which can be classified as service robots. Moreover, as more and more robots are designed as service robots, their developers face the challenge of reducing the machines' complexity and providing smart user interface methods. Ideally the robot would be able to cooperate with a human, just like another human would.

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

life sciences
model based tracking
hri
lab automation


An Entropy-based Stability Algorithm for Regulating the Movement of MANET Nodes This paper proposes an algorithm that enables mobile nodes to implement self-regulated movements in mobile ad-hoc networks (MANETs). It is important for mobile nodes to maintain a certain level of network-based stability by harmonizing these nodes' movements autonomously due to their limited transmission range and dynamic topology. Entropy methods based on relative position are suggested, as a means for mobile nodes to regulate their local movements. Simulations show that an early warning mechanism is suitable to maintain movement-based stability. Isolation can be reduced by 99%, with an increased network cost of 12% higher power consumption, using the proposed algorithm.

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

relative position
entropy
stability
isolation

mobile ad hoc nnetworks
topology control
movement profile


Multiperiod optimization for the design and planning of multiproduct batch plants This paper presents a general multiperiod optimization model, which simultaneously solves the design and planning decisions in multiproduct batch plants. Therefore, the trade-offs between both problems are taken into account as well as variations due to seasonal effects, demand patterns, etc. From the design point of view, the model is formulated considering batch and semicontinuous units, the allocation of intermediate storage, and structural decisions. Following the usual procurement policy, equipment is provided using discrete sizes. From the planning point of view, the formulation takes into account both products and raw materials inventories, product demands and raw materials supplies that vary seasonally in a multiperiod approach. The objective is the maximization of an economic function, which considers incomes, and both investment and operation costs. A plant that produces five oleoresins in seven stages is used to illustrate this approach. (c) 2006 Elsevier Ltd. All rights reserved.

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

multiperiod optimization
multiproduct batch plants


Unsupervised color-texture segmentation based on soft criterion with adaptive mean-shift clustering An improved approach for J value segmentation (JSEG) is presented for unsupervised color-texture segmentation. Instead of the color quantization algorithm used in JSEG, an automatic classification method using adaptive rnean-shift (AMS) clustering is applied for nonparametric clustering of image data set. The clustering results are used to construct Gaussian mixture modelling for the calculation of soft J value. The region growing algorithm used in JSEG is then applied in segmenting the image based on the multiscale soft J-images. Experiments show that the improved method overcomes the limitations of JSEG successfully and is more robust. (c) 2005 Elsevier B.V. All rights reserved.

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

color-texture segmentation
adaptive mean-shift clustering
gaussian mixture modeling


Monolithic integration of a high-performance clustered insulated gate bipolar transistor with low-voltage components to form a 3kV intelligent power chip For the first time, we evaluate the feasibility of monolithic integration of low-voltage components, such as n and p channel MOSFETs, into a 3kV novel planar power semiconductor device, called the clustered insulated gate bipolar transistor, to realise an intelligent power chip. The power device employs MOS control with a thyristor to lower the on-state conduction losses and a unique self-clamping feature that provides current saturation at high gate voltages and enables the incorporation of low-voltage devices without any additional processing. This combination paves the way for realising an intelligent power chip with enhanced performance with respect to on-chip temperature, over-current and over-voltage protection circuitry.

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

intelligence power chip
power intergrated chip
nmos
pmos
igbt


Fault-tolerant routings with minimum optical index We construct sets of routings in the complete directed graph (K) over right arrow (n) that tolerate up to f failures of nodes or links. These routings are optimal with respect to several desirable criteria. In addition, our routings have minimum (or close to minimum) possible optical indices, which means that wavelengths can be assigned to the directed paths in the routings in an efficient manner. This property is useful in the context of optical networks. (C) 2006 Wiley Periodicals, Inc.

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


Differential shape statistical analysis A novel statistical approach that involves differential shape is proposed to analyze contour segments. First, a moment-based algorithm to represent the differential contour segment in an efficient way is introduced. Then, a curvature mean-shift method is adopted to search for the salient features. An optimized function is also developed to segment a contour into parts based on its structural properties. Compared with some other methods used in CSS (Curvature Scale Space) and shock graphs, our method is more powerful for shape contour analysis, especially for the incomplete or occluded contours. Experiments show that our method can track salient parts in real-time and give a judgment of the basic shape properties such as symmetry.

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


Solution methods for scheduling of heterogeneous parallel machines applied to the workover rig problem A novel mathematical model for the workover rig scheduling. Identifying several classes of valid inequalities. Developed a very efficient hyper-heuristic method. Developed a branch, price and cut algorithm for the problem. Work is based on a case study of Petrobras, Brazilian petroleum company.

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

workover rig scheduling
branch
price and cut


measuring similarity to detect qualified links The early success of link-based ranking algorithms was predicated on the assumption that links imply merit of the target pages. However, today many links exist for purposes other than to confer authority. Such links bring noise into link analysis and harm the quality of retrieval. In order to provide high quality search results, it is important to detect them and reduce their influence. In this paper, a method is proposed to detect such links by considering multiple similarity measures over the source pages and target pages. With the help of a classifier, these noisy links are detected and dropped. After that, link analysis algorithms are performed on the reduced link graph. The usefulness of a number of features are also tested. Experiments across 53 query-specific datasets show our approach almost doubles the performance of Kleinberg's HITS and boosts Bharat and Henzinger's imp algorithm by close to 9\% in terms of precision. It also outperforms a previous approach focusing on link farm detection.

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

link classification
web search engine
web spam


behavioral experiments in networked trade We report on an extensive series of highly controlled human subject experiments in networked trade. Our point of departure is a simple and well-studied bipartite network exchange model, for which previous work has established a detailed equilibrium theory relating wealth to network topology. A notable feature of this theory is its prediction that there may be significant local variation in equilibrium wealths and prices purely as a result of structural asymmetries in the network. Our experiments mix recent lines of thought from algorithmic game theory, behavioral economics and social network theory, and are among the first and largest behavioral economics experiments on network effects conducted to date. They continue a line of human subject experiments on networked games and optimization allowing only local interactions.

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


Content-Adaptive Motion Estimation Algorithm for Coarse-Grain SVC A joint model of scalable video coding (SVC) uses exhaustive mode and motion searches to select the best prediction mode and motion vector for each macroblock (MB) with high coding efficiency at the cost of computational complexity. If major characteristics of a coding MB such as the complexity of the prediction mode and the motion property can be identified and used in adjusting motion estimation (ME), one can design an algorithm that can adapt coding parameters to the video content. This way, unnecessary mode and motion searches can be avoided. In this paper, we propose a content-adaptive ME for SVC, including analyses of mode complexity and motion property to assist mode and motion searches. An experimental analysis is performed to study interlayer and spatial correlations in the coding information. Based on the correlations, the motion and mode characteristics of the current MB are identified and utilized to adjust each step of ME at the enhancement layer including mode decision, search-range selection, and prediction direction selection. Experimental results show that the proposed algorithm can significantly reduce the computational complexity of SVC while maintaining nearly the same rate distortion performance as the original encoder.

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

interlayer correlation
motion estimation (me)
scalable video coding (svc)
spatial correlation


In Silico Pharmacophore Modeling on Known Pyridinium Oxime Reactivators of Cyclosarin (GF) Inhibited AChE to Aid Discovery of Potential, More Efficacious Novel Non-Oxime Reactivators Cyclohexyl methylphosphonofluoridate (cyclosarin, cyclosin, GF) is a highly toxic organophosphorus (OP) nerve agent considered as potential warfare threats and known to be resistant to conventional oxime antidotal therapy. To aid discovery of novel antidotes for GF toxicity, a three-dimensional in silico pharmacophore model for reactivation efficacy against GF intoxication is presented. The model was generated from published experimental percentage reactivation data on oximes as changes of AChE/BuChE activities in the whole blood after cyclosarin intoxication and administration. The generated pharmacophore model was found to contain a hydrogen bond donor site and two ring aromatic sites as necessary optimal features for reactivation of GF intoxication. Stereo-electronic features of oximes reported by us earlier provided guidance to develop the model and were found to be consistent with the reported structure activity data. Furthermore, from virtual screening of two commercial databases, Maybridge and ChemNavigator using map-fitting of the model led us to identify two new non-oxime compounds showing reactivation efficacy within 10-fold range of 2-PAM for DFP-inhibited AChE. Since GF is a G simulator like DFP (diisopropylfluorophosphate), the model should have the potential for discovery of novel reactivators against GF intoxication.

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

3d pharmacophore model
acetylcholinesterase (ache)
butyrylcholinesterase buche)
cyclosarin (gf)
in vitro


Collision detection for deformable objects Interactive environments for dynamically deforming objects play an important role in surgery simulation and entertainment technology. These environments require fast deformable models and very efficient collision handling techniques. While collision detection for rigid bodies is well investigated, collision detection for deformable objects introduces additional challenging problems. This paper focuses on these aspects and summarizes recent research in the area of deformable collision detection. Various approaches based on bounding volume hierarchies, distance fields and spatial partitioning are discussed. In addition, image-space techniques and stochastic methods are considered. Applications in cloth modeling and surgical simulation are presented.

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

self-collision detection
continuous collision detection
stochastic collision detection
image-space collision detection
bounding-volume hierarchy
spatial subdivision
distance field


A modular network scheme for unsupervised 3D object recognition This paper presents an unsupervised learning scheme for recognizing 3D objects from their 2D projected images. The scheme consists of a mixture of nonlinear autoencoders which can compress various views of 3D objects into representations that indicate the view direction. We evaluate the performance of the proposed modular network scheme through simulations using 3D wire-frame objects and discuss its related issues on object representations in the primate visual cortex.

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

unsupervised learning
3d object recognition
autoencoders


designing for small display screens Wireless access to the Internet via PDAs (personal digital assistants) provides Web type services in the mobile world. What we are lacking are design guidelines for such PDA services. For Web publishing, however, there are many resources to look for guidelines. The guidelines can be classified according to which aspect of the Web media they are related: software/hardware, content and its organization, or aesthetics and layout. In order to be applicable to PDA services, these guidelines have to be modified. In this paper we analyze the main characteristics of PDAs and their influence to the guidelines.

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

personal digital assistant
world wide web


exploiting task-level concurrency in a programmable network interface Programmable network interfaces provide the potential to extend the functionality of network services but lead to instruction processing overheads when compared to application-specific network interfaces. This paper aims to offset those performance disadvantages by exploiting task-level concurrency in the workload to parallelize the network interface firmware for a programmable controller with two processors. By carefully partitioning the handler procedures that process various events related to the progress of a packet, the system can minimize sharing, achieve load balance, and efficiently utilize on-chip storage. Compared to the uniprocessor firmware released by the manufacturer, the parallelized network interface firmware increases throughput by 65\% for bidirectional UDP traffic of maximum-sized packets, 157\% for bidirectional UDP traffic of minimum-sized packets, and 32--107\% for real network services. This parallelization results in performance within 10--20\% of a modern ASIC-based network interface for real network services.

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

network performance throughput interfaces paper traffic sharing firmware workload storage concurrency instruction process

parallel programming
task
applications
event
programmable network interface
service
control
processor
partition
systems
procedure
parallel
functional
ethernet
load balancing
programmer


agile and object oriented practices in embedded systems Embedded systems are the most prevalent of all computer systems in the world. More than 99\% of all computer/microcontroller products that are sold each year are single purpose embedded systems rather than workstations, desktops, laptops, or server systems. This workshop will gather embedded systems programmers and engineers to discuss how Agile and object oriented practices affect the design and implementation of embedded systems. We will explore how/whether a product design is affected when an embedded system implements functionality that is inherently object oriented in nature. We will explore how constraints that are unique to embedded systems affect the adoption of Agile and objected oriented processes and practices. The primary goal for this workshop is to provide feedback to the embedded systems community on which practices are judged as useful and which are not.

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


TOWARD AGILE: AN INTEGRATED ANALYSIS OF QUANTITATIVE AND QUALITATIVE FIELD DATA ON SOFTWARE DEVELOPMENT AGILITY As business and technology environments change at an unprecedented rate, software development agility to respond to changing user requirements has become increasingly critical for software development performance. Agile software development approaches, which emphasize sense-and-respond, self-organization, cross-functional teams, and continuous adaptation, have been adopted by an increasing number of organizations to improve their software development agility. However, the agile development literature is largely anecdotal and prescriptive, lacking empirical evidence and theoretical foundation to support the principles and practices of agile development. Little research has empirically examined the software development agility construct in terms of its dimensions, determinants, and effects on software development performance. As a result, there is a lack of understanding about how organizations can effectively implement an agile development approach. Using an integrated research approach that combines quantitative and qualitative data analyses, this research opens the black box of agile development by empirically examining the relationships among two dimensions of software development agility (software team response extensiveness and software team response efficiency), two antecedents that can be con trolled (team autonomy and team diversity), and three aspects of software development performance (on-time completion, on-budget completion, and software functionality). Our PLS results of survey, responses of 399 software project managers suggest that the relationships among these variables are more complex than what has been perceived by the literature. The results suggest a tradeoff relationship between response extensiveness and response efficiency. These two agility dimensions impact software development performance differently: response efficiency positively affects all of on-time completion, on-budget completion, and software functionality, whereas response extensiveness positively affects only software functionality. The results also suggest that team autonomy has a positive effect on response efficiency and a negative effect on response extensiveness, and that team diversity has a positive effect on response extensiveness, We conducted 10 post hoc case studies to qualitatively cross-validate our PLS results and provide rich, additional insights regarding the complex, dynamic interplays between autonomy, diversity, agility, and performance. The qualitative analysis also provides explanations for both supported and unsupported hypotheses. We discuss these qualitative analysis results and conclude with the theoretical and practical implications of our research findings for agile development approaches.

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

software development agility
agile software development
team autonomy
team diversity
software development performance

requirement change
partial least square
case study


Currentvoltage characteristics of p-Si/carbon junctions fabricated by pulsed laser deposition Amorphous carbon/p-Si junctions were fabricated at different temperatures using KrF excimer laser (?=248nm, pulsed duration 20ns). The currentvoltage measurements of the devices showed diode characteristics. The value of various junction parameters such as ideality factor, barrier height, and series resistance were determined from forward bias IV characteristics, Cheung method, and Nordes function. There was a good agreement between the diodes parameters obtained from these methods. The ideality factor of ?1.12 and barrier height of ?0.37eV were estimated using currentvoltage characteristics for films grown at room temperature.

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


How productivity improves in hands-free continuous dictation tasks: lessons learned from a longitudinal study Speech recognition technology continues to improve, but users still experience significant difficulty using the software to create and edit documents. The reported composition speed using speech software is only between 8 and 15 words per minute [Proc CHI 99 (1999) 568; Universal Access Inform Soc 1 (2001) 4], much lower than people's normal speaking speed of 125-150 words per minute. What causes the huge gap between natural speaking and composing using speech recognition? Is it possible to narrow the gap and make speech recognition more promising to users? In this paper we discuss users' learning processes and the difficulties they experience as related to continuous dictation tasks using state of the art Automatic Speech Recognition (ASR) software. Detailed data was collected for the first time on various aspects of the three activities involved in document composition tasks: dictation, navigation, and correction. The results indicate that navigation and error correction accounted for big chunk of the dictation task during the early stages of interaction. As users gained more experience, they became more efficient at dictation, navigation and error correction. However, the major improvements in productivity were due to dictation quality and the usage of navigation commands. These results provide insights regarding the factors that cause the gap between user expectation with speech recognition software and the reality of use, and how those factors changed with experience. Specific advice is given to researchers as to the most critical issues that must be addressed. (c) 2004 Elsevier B.V. All rights reserved.

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

error correction
speech recognition software

automatic speech recognition technologies


Lets keep in touch online: a Facebook aware virtual human interface A virtual human is an effective interface for interacting with users and plays an important role in carrying out certain tasks. As social networking sites are getting more and more popular, we propose a Facebook aware virtual human. The social networking sites are used to empower virtual humans for interpersonal conversational interaction in this paper. We combine Internet world, physical world and 3D virtual world together to create a new interface for users to interact with an autonomous virtual human which can behave like a real modern human. In order to take advantages of social networking sites, virtual human gathers information of a user from its profile, its likes, dislikes and gauge mood from most recent status update. In two user studies, we investigated whether and how this new interface can enhance humanvirtual human interaction. Some positive results concluded from these studies will be guidelines on research and development of future virtual human interfaces.

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

human-virtual human interaction
dialogue


Spectral Methods for Thesaurus Construction Traditionally, popular synonym acquisition methods are based on the distributional hypothesis, and a metric such as Jaccard coefficients is used to evaluate the similarity between the contexts of words to obtain synonyms for a query. On the other hand, when one tries to compile and clean a thesaurus, one often already has a modest number of synonym relations at hand. Could something be done with a half-built thesaurus alone? We propose the use of spectral methods and discuss their relation to other network-based algorithms in natural language processing (NLP), such as Page Rank and Bootstrapping. Since compiling a thesaurus is very laborious, we believe that adding the proposed method to the toolkit of thesaurus constructors would significantly ease the pain in accomplishing this task.

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

synonym extraction
spectral clustering
graph laplacian


Cumulative Distribution Networks and the Derivative-sum-product Algorithm: Models and Inference for Cumulative Distribution Functions on Graphs We present a class of graphical models for directly representing the joint cumulative distribution function (CDF) of many random variables, called cumulative distribution networks (CDNs). Unlike graphs for probability density and mass functions, for CDFs the marginal probabilities for any subset of variables are obtained by computing limits of functions in the model, and conditional probabilities correspond to computing mixed derivatives. We will show that the conditional independence properties in a CDN are distinct from the conditional independence properties of directed, undirected and factor graphs, but include the conditional independence properties of bi-directed graphs. In order to perform inference in such models, we describe the 'derivative-sum-product' (DSP) message-passing algorithm in which messages correspond to derivatives of the joint CDF. We will then apply CDNs to the problem of learning to rank players in multiplayer team-based games and suggest several future directions for research.

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

graphical models
cumulative distribution function
inference


A Variational Approach Via Bipotentials for a Class of Frictional Contact Problems We study a class of frictional contact problems with prescribed normal stress, for nonlinearly elastic materials. Using a bipotential which depends on the constitutive map and its Fenchel conjugate, and a potential which depends on the prescribed normal stress and the coefficient of friction, we deliver a weak formulation which consists of a system of two variational inequalities. The unknown is the pair of displacement vector and Cauchy stress tensor. We prove the existence and the uniqueness of the weak solution by using minimization arguments. We also discuss some connections of the new variational approach to previous variational approaches.

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

frictional contact
prescribed normal stress
bipotential
weak solution


Cryptanalysis of publicly verifiable authenticated encryption Recently, Ma and Chen proposed a new authenticated encryption scheme with public verifiability. The signer can generate a signature with message recovery for a specified recipient. With a dispute, the recipient has ability to convert the signature into an ordinary one that can be verified by anyone without divulging her/his private key and the message. However, we point out that any adversary can forge a converted signature in this article.

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


GOLD infrastructure for virtual organizations The paper discusses the GOLD project (Grid-based Information Models to Support the Rapid Innovation of New High Value-Added Chemicals) whose principal aim is to carry out research and development into enabling technologies to support the formation, operation and termination of virtual organizations. The paper discusses the outcome of this research, which is the GOLD Middleware infrastructure. The infrastructure has been implemented in the form of a set of Middleware components, which address issues such as trust, security, contract monitoring and enforcement, information management and coordination. We discuss all these issues in turn and more importantly we demonstrate how current WS standards can be used to implement these issues. In addition, the paper follows a top down approach starting with a brief outline on the architectural elements derived during the requirements engineering phase and demonstrates how these elements were mapped onto actual services that were implemented according to service-oriented architecture principles and related technologies. Copyright (c) 2008 John Wiley & Sons, Ltd.

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


Counter tree diagrams: A unified framework for analyzing fast addition algorithms This paper presents a unified representation of fast addition algorithms based on Counter Tree Diagrams (CTDs). By using CTDs, we can describe and analyze various adder architectures in a systematic way without using specific knowledge about underlying arithmetic algorithms. Examples of adder architectures that can be handled by CTDs include Redundant-Binary (RB) adders, Signed-Digit (SD) adders, Positive-Digit (PD) adders, carry-save adders, parallel counters (e.g., 3-2 counters and 4-2 counters) and networks of such basic adders/counters. This paper also discusses the CTD-based analysis of carry-propagation-free adders using various number representations.

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

computer arithmetic algorithms
multipliers
datapath
vlsi
circuit synthesis


Mobile Imagery eXchange (MIX) toolkit: data sharing for the unconnected This paper proposes a healthcare solution that enables the sharing of medical videos in areas without satellite, broadband or mobile internet connectivity. Rural areas often encounter issues such as shortage of electricity, poor telecommunication services and lack of health facilities which have led to a deficiency of medical care in remote areas. The deployment of mobile devices for healthcare services is vital to alleviating these concerns. A majority of mobile device owners are located in developing nations, and the number of users is continually rising. These technologies effectively support remote health care due to their low-power requirements, multiple functionalities and custom applications. The Mobile Imagery eXchange (MIX) toolkit is a software application capable of converting echocardiogram videos into text for transmission through short message service (SMS), over a global system for mobile communications network. A smartphone or computer installed with the MIX toolkit can be utilized to deliver effective medical care within rural regions. To significantly shrink data size, video, image and file processing techniques are applied for analysis, segmentation, compression and conversion. Experiments show that data size reduction rates above 60 until 95% are achievable when transforming imagery into text. Furthermore, in optimal conditions, the average SMS per image ranges from 9 to 23 text 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 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 O O O O O O O O O O O O O O O O O O O O O O O O O O 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


chronological order of reversal events on rickettsia genus Traditional algorithms for sorting permutations by signed reversals output one solution while the solution space can be huge. The enumeration of traces of solutions for this problem can be a powerful tool to help the study of rear-rangement scenarios which only include reversals. Through the analysis of the permutations of six members of the Rickettsia genus in relation with their common ancestral, we were able to produce all possible scenarios and infer some chronological order over the reversal events that occurred during the evolution of these species. Our results matched with the scenario proposed in the literature.

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


Measurement of two-dimensional distribution profile of lead in a flame by planar laser-induced fluorescence spectroscopy Producing refuse-derived fuel (RDF) is one of the most effective measures of refuse treatment. However, RDF often consists of high level of lead. To reduce lead emission during combustion, understanding of lead behaviors in flames is required. In this study, we have applied planar laser-induced fluorescence spectroscopy to detect lead not only in a non-luminous methaneair flame, but also in a luminous RDF flame. In a methaneair flame, the number density of Pb atoms does not depend on the flame temperature, but also on the combustion environments. In RDF flames, because of acceleration of oxidizing process of Pb, Pb fluorescence profile obtained at 25% O2 became weaker than that at 20% O2.

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

planar laser-induced fluorescence
refuse derived fuel
oh radical


Some characteristics of logistic and Bessel random variables Products, ratios and sums of random variables arise explicitly in many areas. of the sciences, engineering and medicine. This has increased the need to have available the widest possible range of statistical results on products, ratios and sums of random variables. In this note, the exact distributions of XY, X/Y and X + Y are derived when X and Y are logistic and Bessel random variables distributed independently of each other. Tabulations of the associated percentage points obtained by inverting the derived distributions are also provided.

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

bessel function distribution
logistic distribution
products of random variables
ratios of random variables


Pancyclicity of recursive circulant graphs In this paper, we study the existence of cycles of all lengths in the recursive circulant graphs, and we show a necessary and sufficient condition for the graph being pancyclic and bipancyclic. (C) 2002 Elsevier Science B.V. All rights reserved.

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

interconnection networks
pancyclic property


An integrated digital CMOS time-to-digital converter with sub-gate-delay resolution An integrated digital CMOS time-to-digital converter with sub-gate delay LSB width and 50 ps single-shot precision sigma-value has been designed and implemented for a laser range-finding application. The measurement is based on a counter and a novel two-step parallel interpolation that uses only 32 delay elements to provide 128 LSBs in the interpolator within the reference clock cycle. The circuit was fabricated in the AMS 0.8 mu m CMOS process and the current consumption of the circuit is < 20 mA from a single +5 V supply.

O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O O 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-to-digital converter
time interval measurement
laser range-finding
delay locked loop
delay line


An empirical examination of factors affecting college students proactive stickiness with a web-based English learning environment Based on the SCT and U&G theory, an integrated theoretical model is developed. The results integrate findings of cognitive science & mass communication research. The cognitive, technology and social factors are identified as critical determinants. The proposed determinants significantly affect students learning gratifications. The identified critical factors impact students proactive stickiness with WBEL.

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

proactive stickiness
learning gratifications

uses and gratifications theory
social cognitive theory
web-based english learning


Numerical study of hydrogen permeation flux in ytterbium doped strontium cerate and thulium doped strontium cerate (II) This study analyses the hydrogen permeation flux model with (1) modification sin the defect concentration calculations where the concentration of substitutional cation on cerium site is utilised as the independent variable for the calculation, instead of the previous step-wise calculation with the concentration of oxygen vacancy as the independent variable and (2) the additional terms to include the oxygen partial pressure gradients for calculation of hydrogen permeation flux. The modification in the defect concentration method allows a short model simulation run time, which consequently allows incorporation of the concentration constraints in the parametric sensitivity analysis, but still produces the same set of defect concentrations as calculated in the previous methods. It is also found in this Study that the discrepancy between the model and experimental results (in terms of the effect of changes in hydrogen partial pressure gradients on the hydrogen permeation flux) is not due to the influence of oxygen partial pressure gradients. Parametric sensitivity analysis shows that there is no significant difference in the sensitivity of the model by comparing Case A and B. The result of parameter tuning to predict the hydrogen permeation flux for 5% thulium doped strontium cerate in Case B shows a similar trend to the previous study (Case A). These results Suggest negligible oxygen ion conductivities in these types of membrane, as reported in the literature. (c) 2008 IMACS. Published by Elsevier B.V. All rights reserved.

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

hydrogen permeation flux model
parametric sensitivity analysis

mixed protonic and ionic conduction
hydrogen separation


Some new solitonary solutions of the modified BenjaminBonaMahony equation In this paper, we use the exp-function method to construct some new soliton solutions of the BenjaminBonaMahony and modified BenjaminBonaMahony equations. These equations have important and fundamental applications in mathematical physics and engineering sciences. The exp-function method is used to find the soliton solution of a wide class of nonlinear evolution equations with symbolic computation. This method provides the concise and straightforward solution in a very easier way. The results obtained in this paper can be viewed as a refinement and improvement of the previously known results.

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

soliton solutions
nonlinear evolution equations


GPU-based computation of discrete periodic centroidal Voronoi tessellation in hyperbolic space Periodic centroidal Voronoi tessellation (CVT) in hyperbolic space provides a nice theoretical framework for computing the constrained CVT on high-genus (genus>1) surfaces. This paper addresses two computational issues related to such a hyperbolic CVT framework: (1) efficient reduction of unnecessary site copies in neighbor domains on the universal covering space, based on two special rules; (2) GPU-based parallel algorithms to compute a discrete version of the hyperbolic CVT. Our experiments show that with the dramatically reduced number of unnecessary site copies in neighbor domains and the GPU-based parallel algorithms, we significantly speed up the computation of CVT for high-genus surfaces. The proposed discrete hyperbolic CVT guarantees to converge and produces high-quality results.

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

centroidal voronoi tessellation
universal covering space
hyperbolic space


Longitudinal Clinical Course Following Pharmacological Treatment of Methamphetamine Psychosis Which Persists after Long-Term Abstinence The present article investigated clinical symptoms and their longitudinal clinical course following pharmacological treatment in 32 female incarcerated patients suffering from methamphetamine (METH) psychosis who were referred to psychiatric consultation. The length of METH-abuse periods of the patients ranged from 2 to 31 years. A total of 31 patients suffered from psychosis at abstinence after 531 months from the self-injection of METH. Nine of these 31 patients experienced episodes of psychotic relapse. The following symptoms were observe

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

methamphetamine psychosis
pharmacological treatment

persistent type
symptom dimensions
differential prognoses
liability to extrapyramidal symptoms


A competitive inventory model with reallocation on a plane market This paper considers a duopolistic inventory model with reallocation. Customers move according to the rectilinear distance over a plane market and choose a player whom they first visit with a probability dependent on their positions. This model can be interpreted as one of the unitsquare games with pure strategies of continuous cardinary. We consider the optimal strategies for two players from a viewpoint of pure strategies. The purpose of this paper is concretely to find an equilibrium point with respect to the optimal ordering quantities which minimize the total costs by using a payoff bimatrix in the deterministic model and to find the optimal solution in the stochastic model. As can be seen in this paper, there is a unique equilibrium point. (C) 2003 Elsevier Ltd. All rights reserved.

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

reallocation of excess demand
game theory
equilibrium point analysis
stochastic demand


Robust stability analysis of generalized neural networks with multiple discrete delays and multiple distributed delays Using the LyapunovKrasovskii functional method and the linear matrix inequality (LMI) technique, this paper is concerned with the robust stability of generalized neural networks with multiple discrete delays and multiple distributed delays. The global stability of the equilibrium point is proved under mild conditions, where the activation function is neither differentiable nor strictly monotone. For the considered system, a novel robust stability criterion of the system is derived, which can be easily solved by efficient convex optimization algorithms. And two numerical examples are given to justify the obtained results.

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

generalized neural networks
lyapunovkrasovskii functional method
multiple discrete delays
multiple distributed delays


Constructing a fuzzy-knowledge-based- system: an application for assessing the financial condition of public schools Financial evaluation in the public sector can utilize some of the tools developed for evaluation in the private sector. However, the emphasis on the bottom line characterized by productivity measures does not adequately address all of the issues faced by public institutions. Recent collaborations by researchers in management science and public administration have led to the successful development of an analytical approach that combines fuzzy set theory and knowledge based systems to produce a tool for evaluating the general performance of public institutions. Successful implementations have included evaluations of the management of state governments, the financial administration of large cities, and the credit worthiness of public institutions. This paper describes a recent collaborative project, funded by the State of New York, to develop a system to evaluate the financial condition of the state's nearly 700 school districts. (C) 2004 Elsevier Ltd. All rights reserved.

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

fuzzy logic
knowledge-based-systems
performance evaluation


motivation and learning preferences of information technology learners in south african secondary schools The Information Technology (IT) subject presented in South African secondary schools is considered to be a difficult subject. The programming component of IT is believed to be the main cause of this difficulty. Learners who struggle with programming are unable to obtain above average marks in IT, as the programming component has the largest weighting in the IT subject framework. The aim of the research upon which this paper is based is to identify factors related to learner achievement in programming and the IT subject. The two areas that this paper investigates are learner motivation towards programming and the learning preferences of IT learners. The Motivated Strategies for Learning Questionnaire (MSLQ) is used to determine learner motivation and the Visual, Aural, Read/Write and Kinesthetic (VARK) Questionnaire is used to determine the learning preferences of IT learners. Both questionnaires provide interesting results and observations. The self-efficacy for learning and performance and control of learning beliefs motivational subscales seem to influence the performance of learners at the different schools. The VARK questionnaire results for this study indicate that the learning preferences of IT learners may influence understanding of programming concepts and also that it is best to present content to IT learners using a balance between all four modal groups (visual, aural, read/write and kinesthetic) to ensure that the learning preferences of all learners are met. The findings of this research indicate the impact that motivation and learning preferences possibly have on the understanding of programming concepts and overall achievement in programming and the IT subject. The contribution of this paper is the identification of the MSLQ and VARK questionnaires as methods that can be used to improve teaching strategies in South African secondary schools.

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

vark questionnaire
information technology


Simulation study on rotating radial electromagnetic force for use in dynamic balancing A tentative idea of introducing rotating electromagnetic force for dynamic balancing is presented in the paper. A method of generating the force is put forward, the force generated has adjustable magnitude, speed and phase angle. Working characteristics of the force are analyzed Phase windings fed with half sine currents are designed to restrain pulsation of the force vector in space. Simulation results of a model indicate that a rotating force vector can be obtained by selecting a proper number of phases simultaneously fed with currents, which is able to meet the needs of ordinary engineering problems.

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


PREPARING HIGHLY ENTANGLED SIX-QUBIT GENUINE STATE IN ION-TRAP SYSTEM We propose a scheme for preparing a highly entangled six qubit genuine state [J. Phys. A 40 (2007) 13407] in an ion-trap system. We evaluate the influence of lasers' small intensity fluctuation and find it is negligible in our scheme. Our scheme is feasible with the present techniques.

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

highly entangled six-qubit genuine state


A splitting method for incompressible flows with variable density based on a pressure Poisson equation A new fractional time-stepping technique for solving incompressible flows with variable density is proposed. The main feature of this method is that, as opposed to other known algorithms, the pressure is determined by just solving one Poisson equation per time step, which greatly reduces the computational cost. The stability of the method is proved and the performance of the method is numerically illustrated.

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


Discrimination discovery in scientific project evaluation: A case study Discovering contexts of unfair decisions in a dataset of historical decision records is a non-trivial problem. It requires the design of ad hoc methods and techniques of analysis, which have to comply with existing laws and with legal argumentations. While some data mining techniques have been adapted to the purpose, the state-of-the-art of research still needs both methodological refinements, the consolidation of a Knowledge Discovery in Databases (KDD) process, and, most of all, experimentation with real data. This paper contributes by presenting a case study on gender discrimination in a dataset of scientific research proposals, and by distilling from the case study a general discrimination discovery process. Gender bias in scientific research is a challenging problem, that has been tackled in the social sciences literature by means of statistical regression. However, this approach is limited to test an hypothesis of discrimination over the whole dataset under analysis. Our methodology couples data mining, for unveiling previously unknown contexts of possible discrimination, with statistical regression, for testing the significance of such contexts, thus obtaining the best of the two worlds. (C) 2013 Elsevier Ltd. All rights reserved.

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

discrimination discovery
gender bias
case study
data mining
kdd process


automatic tuning of two-level caches to embedded applications The power consumed by the memory hierarchy of a microprocessor can contribute to as much as 50\% of the total microprocessor system power, and is thus a good candidate for optimizations. We present an automated method for tuning two-level caches to embedded applications for reduced energy consumption. The method is applicable to both a simulation-based exploration environment and a hardware-based system prototyping environment. We introduce the two-level cache tuner, or TCaT - a heuristic for searching the huge solution space of possible configurations. The heuristic interlaces the exploration of the two cache levels and searches the various cache parameters in a specific order based on their impact on energy. We show the integrity of our heuristic across multiple memory configurations and even in the presence of hardware/software partitioning -- a common optimization capable of achieving significant speedups and/or reduced energy consumption. We apply our exploration heuristic to a large set of embedded applications. Our experiments demonstrate the efficacy of our heuristic: on average the heuristic examines only 7\% of the possible cache configurations, but results in cache sub-system energy savings of 53\%, only 1\% more than the optimal cache configuration. In addition, the configured cache achieves an average speedup of 30\% over the base cache configuration due to tuning of cache line size to the application's needs.

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

architecture tuning
embedded systems
low energy
cache hierarchy
configurable cache
cache exploration
low power
cache optimization


Controllability and observability of impulsive fractional linear time-invariant system In this paper, we deal with the controllability and observability of impulsive fractional linear time-invariant (IF-LTI for short) system. Our main purpose is to built some necessary and sufficient conditions of controllability and observability for the IF-LTI system. At the same time, we establish some conclusions of controllability and observability for a continuous fractional LTI system, which is a special case of the IF-LTI system. Examples are given to illustrate our results. (C) 2012 Elsevier Ltd. All rights reserved.

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


Prediction of acute toxicity of organophosphorus pesticides using topological indices Topological indices were used in the prediction of the acute toxicity (intraperitoneal and oral LD50) of organophosphorus pesticides on rats. Models with six variables for the prediction of LD50-i.p. (r = 0.849, Q(2) = 0.613) and eight variables for LD50-oral (r = 0.906, Q(2) = 0.701) were selected. External group and cross-validation by use of leave-n-out tests were also performed in order to assess the stability and the prediction performance of the selected topological models.

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

acute toxicity
organophosphorus pesticides

topological descriptors
multilinear regression


IMAGE DESCRIPTION WITH NONSEPARABLE TWO-DIMENSIONAL CHARLIER AND MEIXNER MOMENTS This paper presents two new sets of nonseparable discrete orthogonal Charlier and Meixner moments describing the images with noise and that are noise-free. The basis functions used by the proposed nonseparable moments are bivariate Charlier or Meixner polynomials introduced by Tratnik et al. This study discusses the computational aspects of discrete orthogonal Charlier and Meixner polynomials, including the recurrence relations with respect to variable x and order n. The purpose is to avoid large variation in the dynamic range of polynomial values for higher order moments. The implementation of nonseparable Charlier and Meixner moments does not involve any numerical approximation, since the basis function of the proposed moments is orthogonal in the image coordinate space. The performances of Charlier and Meixner moments in describing images were investigated in terms of the image reconstruction error, and the results of the experiments on the noise sensitivity are given.

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

bivariate discrete orthogonal polynomials

nonseparable discrete orthogonal moments

second order linear partial difference equations


Computer-aided diagnosis of diabetic retinopathy: A review Diabetes mellitus may cause alterations in the retinal microvasculature leading to diabetic retinopathy. Unchecked, advanced diabetic retinopathy may lead to blindness. It can be tedious and time consuming to decipher subtle morphological changes in optic disk, microaneurysms, hemorrhage, blood vessels, macula, and exudates through manual inspection of fundus images. A computer aided diagnosis system can significantly reduce the burden on the ophthalmologists and may alleviate the inter and intra observer variability. This review discusses the available methods of various retinal feature extractions and automated analysis.

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

retina
fundus imaging
computer-aided diagnosis
pattern classification
image processing


Anonymous geo-forwarding in MANETs through location cloaking In this paper, we address the problem of destination anonymity for applications in mobile ad hoc networks where geographic information is ready for use in both ad hoc routing and Internet services. Geographic forwarding becomes a lightweight routing protocol in favor of the scenarios. Traditionally, the anonymity of an entity of interest can be achieved by hiding it among a group of other entities with similar characteristics, i.e., an anonymity set. In mobile ad hoc networks, generating and maintaining an anonymity set for any ad hoc node is challenging because of the node mobility and, consequently, the dynamic network topology. We propose protocols that use the destination position to generate a geographic area called an anonymity zone (AZ). A packet for a destination is delivered to all the nodes in the AZ, which make up the anonymity set. The size of the anonymity set may decrease, because nodes are mobile, yet the corresponding anonymity set management is simple. We design techniques to further improve node anonymity and reduce communication overhead. We use analysis and extensive simulation to study the node anonymity and routing performance and to determine the parameters that most impact the anonymity level that can be achieved by our protocol.

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

ad hoc routing protocol
anonymous routing protocol
georouting protocol
communication privacy


Reliable analysis of transverse vibrations of TimoshenkoMindlin beams with respect to uncertain shear correction factor The dependence of minimal eigenfrequencies on the shear correction factor is investigated for homogeneous prismatic beams with both ends either simply supported or clamped. It is proved that the eigenfrequency is simple and its derivative with respect to the shear correction factor is positive.

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


Extended synchronous dataflow for efficient DSP system prototyping Though synchronous dataflow (SDF) graph has been a successful input specification language for digital signal processing (DSP) applications, lack of support for global states makes it unsuitable for multimedia signal processing applications that need global states for efficient implementation. In this paper, we propose synchronous piggybacked dataflow (SPDF), an extension of SDF model to accommodate global states without side effects. Global states are accessed by a special block that piggybacks the global state update request on data samples. Such an extension enlarges the domain of application where dataflow representation can be used for rapid system prototyping. The only penalty it incurs is scheduling complexity since the scheduler now considers control dependency as well as data dependency. We present the static analysis of the SPDF model and an implementation technique for memory efficient code synthesis. Finally, we show experimental results with a real life example, MPEG-audio decoder, to present the novelty and usefulness of our approach.

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

synchronous dataflow
global states
synchronous piggybacked dataflow


A Parallel Framework for In-Memory Construction of Term-Partitioned Inverted Indexes With the advances in cloud computing and huge RAMs provided by 64-bit architectures, it is possible to tackle large problems using memory-based solutions. Construction of term-based, partitioned, parallel inverted indexes is a communication intensive task and suitable for memory-based modeling. In this paper, we provide an efficient parallel framework for in-memory construction of term-based partitioned, inverted indexes. We show that, by utilizing an efficient bucketing scheme, we can eliminate the need for the generation of a global vocabulary. We propose and investigate assignment schemes that can reduce the communication overheads while minimizing the storage and final query processing imbalance. We also present a study on how communication among processors should be carried out with limited communication memory in order to reduce the total inversion time. We present several different communication-memory organizations and discuss their advantages and shortcomings. The conducted experiments indicate promising 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

index inversion
term-based partitioning
parallel inversion
memory-based inversion