ppxscal/embedding_network huggingface dataset:
SBRML
Authors: Joseph O. Dada, Irena Spasić, Norman W. Paton, Pedro Mendes
Venue: Bioinformatics (2010)

Motivation: Research in systems biology is carried out through a combination of experiments and models. Several data standards have been adopted for representing models (Systems Biology Markup Language) and various types of relevant experimental data (such as FuGE and those of the Proteomics Standards Initiative). However, until now, there has been no standard way to associate a model and its entities to the corresponding datasets, or vice versa. Such a standard would provide a means to represent computational simulation results as well as to frame experimental data in the context of a particular model. Target applications include model-driven data analysis, parameter estimation, and sharing and archiving model simulations. Results: We propose the Systems Biology Results Markup Language (SBRML), an XML-based language that associates a model with several datasets. Each dataset is represented as a series of values associated with model variables, and their corresponding parameter values. SBRML provides a flexible way of indexing the results to model parameter values, which supports both spreadsheet-like data and multidimensional data cubes. We present and discuss several examples of SBRML usage in applications such as enzyme kinetics, microarray gene expression and various types of simulation results. Availability and Implementation: The XML Schema file for SBRML is available at http://www.comp-sys-bio.org/SBRML under the Academic Free License (AFL) v3.0. Contact: pedro.mendes@manchester.ac.uk Supplementary information:Supplementary data are available at Bioinformatics online. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Reliable Methods of Judgement Aggregation
Authors: Stephan Hartmann, Gabriella Pigozzi, Jan Sprenger
Venue: Journal of Logic and Computation (2010)

The aggregation of consistent individual judgements on logically interconnected propositions into a collective judgement on the same propositions has recently drawn much attention. Seemingly reasonable aggregation procedures, such as propositionwise majority voting, cannot ensure an equally consistent collective conclusion. The literature on judgement aggregation refers to such a problem as the discursive dilemma. In this article we assume that the decision which the group is trying to reach is factually right or wrong. Hence, we address the question of how good various approaches are at selecting the right conclusion. We focus on two approaches: distance-based procedures and a Bayesian analysis. They correspond to group-internal and group external decision making, respectively. We compare those methods in a probabilistic model whose assumptions are subsequently relaxed. Our findings have two general implications for judgement aggregation problems: first, in a voting procedure, reasons should carry higher weight than the conclusion, and second, considering members of an advisory board to be highly competent is a better strategy than discounting their advice. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Online perturbation analysis and control of tandem 2-class buffers using stochastic fluid models
Authors: S. Nosrati, M. Sabaei
Venue: International Journal of Modelling and Simulation (2008)

In this paper, we apply infinitesimal perturbation analysis (IPA) to packet loss and buffer workload-related performance metrics in tandem networks of two-class stochastic fluid models (SFM). We consider these performance metrics at a downstream SFM node as a function of the controlled traffic stream's threshold parameter at an upstream SFM node. The derived IPA gradient estimators are unbiased and nonparametric in the sense that they are computable directly from online measurements of real-life traffic processes as well as offline simulations, without any knowledge of underlying stochastic characteristic of the traffic and service processes. The efficiency of the derived IPA gradient estimators has been demonstrated in tandem buffers control problem by simulation.
Topology optimization of three-dimensional load-bearing structures using boundary elements
Authors: Christine Bertsch, Adrián P. Cisilino, Néstor Calvo
Venue: Advances in Engineering Software (2010)

A numerical procedure for the topological optimization of three-dimensional linear elastic problems using boundary elements and the Topological Derivative (TD) is presented in this work. The TD is a function which characterizes the sensitivity of a given cost function to the change of the domain topology, like opening a small hole in a continuum. In particular, for this work the total potential strain energy is selected as cost function, and the TD is computed from the stress field by means of the Topological-Shape Sensitivity Method. The optimization problem is solved incrementally. In every step small portions of the model domain are removed by deleting small portions of material associated with the internal points. The new geometry is then remeshed and the resulting boundary element discretization checked (and if necessary fixed) in order to avoid geometrically invalid models. This procedure is repeated until a given stopping criterion is satisfied. The proposed strategy proves to be flexible and robust. A Furthermore, a number of examples are solved and the results discussed and compared to those available in the literature.
Approximation algorithms for shortest descending paths in terrains
Authors: Mustaq Ahmed, Sandip Das, Sachin Lodha, Anna Lubiw, Anil Maheshwari, Sasanka Roy
Venue: Journal of Discrete Algorithms (2010)

A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to find a shortest descending path (SDP) from s to t in a polyhedral terrain. We present two approximation algorithms that solve the SDP problem on general terrains. We also introduce a generalization of the shortest descending path problem, called the shortest gently descending path (SGDP) problem, where a path descends, but not too steeply. The additional constraint to disallow a very steep descent makes the paths more realistic in practice. We present two approximation algorithms to solve the SGDP problem on general terrains. All of our algorithms are simple, robust and easy to implement.
An object-oriented architecture for sensorless cutting force feedback for CNC milling process monitoring and control
Authors: Roberto Augusto Gómez Loenzo, Pedro Daniel Alaniz Lumbreras, René de Jesús Romero Troncoso, Gilberto Herrera Ruiz
Venue: Advances in Engineering Software (2010)

Intelligent Manufacturing Systems require fault-tolerant components capable of preventing and detecting failures, and optimizing their own performance. Although there are a number of process monitoring and control systems (PMCS) available for these tasks, most of them require special equipment that increases cost and setup time. This work proposes a standard software architecture and methodology for implementing a sensorless PMCS which separates data representation from its algorithmic processing. Two different case studies are introduced showing the feasibility and applicability of the proposed design, one for cycle time optimization and another one for online tool condition detection. A good performance was obtained in both case studies based on the proposed PMCS architecture, which can be implemented using different distributed software technologies.
An effective hybrid video deinterlacing algorithm
Authors: Hossein Mahvash Mohammadi
Venue:  (2009)

HDTV system networks are expanding, but most TV systems still use traditional interlaced scans. In order to display the traditional TV signals on HDTV, deinterlacing and scan up conversion are applied. Even if all traditional TV systems were replaced with HDTV system, deinterlacing would be required to convert the video sequences that were originally recorded in interlaced scan to a progressive scan. Deinterlacing can improve the video quality by increasing the vertical resolution of the picture and by removing interlacing artifacts. Nowadays, the greatest challenge for deinterlacing is balancing the trade-off between implementation complexity and a reasonable image quality. In this thesis we propose an effective hybrid deinterlacing algorithm in which a motion compensated algorithm is combined with an edge-based method based on the reliability of motion vectors. A five-field motion compensated algorithm that works by using the amount of vertical motion within the reference fields is proposed to achieve the maximum vertical resolution improvement. A new measure for motion vector reliability assessment called reverse motion estimation (RME) is also proposed to qualify the motion vectors. The method tries reversing the calculated motion vector to confirm its validity. This measure was used in the hybrid algorithm to recognize unreliable motion vectors and switch to an edge-based method to prevent artifacts. The RME measure has a very low computational complexity compared to the other measures while being more efficient. A Pattern-Based Directional Interpolation (PBDI) deinterlacing algorithm is introduced. The algorithm can be used in the hybrid method in the case that unreliable motion vectors are encountered. It compares three-pixel patterns in the upper and lower lines to detect twenty one edge directions and to provide clear and smooth edges with less probability chance of misleading edges. Pattern comparison is done by a combination of the sum of absolute differences and a gradient-based difference. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A neural network ensemble model for on-line monitoring of process mean and variance shifts in correlated processes
Authors: Bin Wu, Jian-bo Yu
Venue: Expert Systems with Applications: An International Journal (2010)

In this paper, a neural network-based identification model is proposed for both mean and variance shifts in correlated processes. The proposed model uses a selective network ensemble approach named DPSOEN to obtain the improved generalization performance, which outperforms those of single neural network. The model is capable of on-line monitoring mean and variance shifts, and classifying the types of shifts without considering the occurrence of both mean and variance shifts in one time. This model is unique since all learning-based methods developed so far can only detect mean or variance shift, but are incapable of classifying types of shifts. The result is significant since it provides additional useful information about the process changes, which can greatly aid identification of assignable causes. The simulation results demonstrate that the model outperforms the conventional control charts in terms of average run length (ARL), and can classify the types of shifts in a real-mode.
Human pose estimation from a single view point
Authors: Gerard Medioni
Venue:  (2009)

We address the estimation of human poses from a single view point in images and sequences. This is an important problem with a range of applications in human computer interaction, security and surveillance monitoring, image understanding, and motion capture. In this work we develop methods that make use of single view cameras, stereo, and range sensors.First, we develop a 2D limb tracking scheme in color images using skin color and edge information. Multiple 2D limb models are used to enhance tracking of the underlying 3D structure. This includes models for lateral forearm views (waving) as well as for pointing gestures.In our color image pose tracking framework, we find candidate 2D articulated model configurations by searching for locally optimal configurations under a weak but computationally manageable fitness function. By parameterizing 2D poses by their joint locations organized in a tree structure, candidates can be efficiently and exhaustively localized in a bottom-up manner. We then adapt this algorithm for use on sequences and develop methods to automatically construct a fitness function from annotated image data.With a stereo camera, we use depth data to track the movement of a user using an articulated upper body model. We define an objective function that evaluates the saliency of this upper body model with a stereo depth image and track the arms of a user by numerically maintaining the optimum using an annealed particle filter.In range sensors, we use a DDMCMC approach to find an optimal pose based on a likelihood that compares synthesized and observed depth images. To speed up convergence of this search, we make use of bottom up detectors that generate candidate part locations. Our Markov chain dynamics explore solutions about these parts and thus combine bottom up and top down processing. The current performance is 10fps and we provide quantitative performance evaluation using hand annotated data. We demonstrate significant improvement over a baseline ICP approach. This algorithm is then adapted to estimate the specific shape parameters of subjects for use in tracking. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Heterogeneous decomposition of degree-balanced search trees and its applications
Authors: Guy E. Blelloch, Bruce M. Maggs
Venue:  (2009)

This thesis introduces the concept of heterogeneous decompositions of a degree-balanced search tree and applies this concept to establish the following three results. (1) Any leaf-store or node-store degree-balanced search tree can support a constant number of dynamic fingers in the worst case without storing extra pointers in its nodes nor restructuring after a finger search. Each dynamic finger is represented as a logarithmic-sized data structure that contains pointers pointing into the tree, which is maintained using dictionary algorithms that exploit this representation of dynamic fingers. (2) By construction, there exists a static binary search tree algorithm with the dynamic finger property in the worst case. This algorithm is primarily intended to serve as an alternate proof that the dynamic optimality conjecture implies the dynamic finger conjecture&mdash;in view of the fact that the earlier explicit proof of this implication is the highly-nontrivial proof of the dynamic finger theorem due to Cole. (3) By construction, there exists a static O(lg lg n)-competitive binary search tree algorithm with the dynamic finger property in the amortized case. As a corollary, if the splay trees of Sleator and Tarjan are O(1)-competitive even in the presence of splits and joins, then the multi-splay trees of Wang, Derryberry, and Sleator have the dynamic finger property in the amortized case. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Optimal monotone forwarding policies in delay tolerant mobile ad-hoc networks
Authors: Eitan Altman, Tamer Başar, Francesco De Pellegrini
Venue: Performance Evaluation (2010)

We study fluid approximations for a class of monotone relay policies in delay tolerant ad-hoc networks. This class includes the epidemic routing and the two-hops routing protocols. We enhance relay policies with probabilistic forwarding, i.e., a message is forwarded to a relay with some probability p. We formulate an optimal control problem where a tradeoff between delay and energy consumption is captured and optimized. We compute both the optimal static value of p as well as the optimal time dependent value of p. We show that the time-dependent problem is optimized by threshold type policies, and we compute explicitly the value of the optimal threshold for some special classes of relay policies.
Brief paper: A note on control of a class of discrete-time stochastic systems with distributed delays and nonlinear disturbances
Authors: Zidong Wang, Yurong Liu, Guoliang Wei, Xiaohui Liu
Venue: Automatica (Journal of IFAC) (2010)

This paper is concerned with the state feedback control problem for a class of discrete-time stochastic systems involving sector nonlinearities and mixed time-delays. The mixed time-delays comprise both discrete and distributed delays, and the sector nonlinearities appear in the system states and all delayed states. The distributed time-delays in the discrete-time domain are first defined and then a special matrix inequality is developed to handle the distributed time-delays within an algebraic framework. An effective linear matrix inequality (LMI) approach is proposed to design the state feedback controllers such that, for all admissible nonlinearities and time-delays, the overall closed-loop system is asymptotically stable in the mean square sense. Sufficient conditions are established for the nonlinear stochastic time-delay systems to be asymptotically stable in the mean square sense, and then the explicit expression of the desired controller gains is derived. A numerical example is provided to show the usefulness and effectiveness of the proposed design method.
Dynamically balanced optimal gaits of a ditch-crossing biped robot
Authors: Pandu Ranga Vundavilli, Dilip Kumar Pratihar
Venue: Robotics and Autonomous Systems (2010)

This paper deals with the generation of dynamically balanced gaits of a ditch-crossing biped robot having seven degrees of freedom (DOFs). Three different approaches, namely analytical, neural network (NN)-based and fuzzy logic (FL)-based, have been developed to solve the said problem. The former deals with the analytical modeling of the ditch-crossing gait of a biped robot, whereas the latter two approaches aim to maximize the dynamic balance margin of the robot and minimize the power consumption during locomotion, after satisfying a constraint stating that the changes of joint torques should lie within a pre-specified value to ensure its smooth walking. It is to be noted that the power consumption and dynamic balance of the robot are also dependent on the position of the masses on various links and the trajectory followed by the hip joint. A genetic algorithm (GA) is used to provide training off-line, to the NN-based and FL-based gait planners developed. Once optimized, the planners will be able to generate the optimal gaits on-line. Both the NN-based and FL-based gait planners are able to generate more balanced gaits and that, too, at the cost of lower power consumption compared to those yielded by the analytical approach. The NN-based and FL-based approaches are found to be more adaptive compared to the other approach in generating the gaits of the biped robot.
Application mapping of mesh based-NoC using multi-objective genetic algorithm
Authors: R. K. Jena, G. K. Sharma
Venue: International Journal of Computers and Applications (2008)

Network on Chip (NoC) is a new paradigm for design core based System on Chip (SoC) which supports high degree of reusability and provides increase computation power. This paper addresses the problem of topological mapping of intellectual properties (IPs) on the tiles of a mesh-based NoC in two systematic steps using multi-objective evolutionary algorithm. The main objective is to obtain the pareto mappings that minimized the energy consumption (computational and communicational) and link bandwidth requirement under performance constraints. The evaluation performed on three randomly generated benchmarks and a real application (M-JPEG encoder) to conform the efficiency, accuracy and scalability of the proposed approach. Our proposed approach saves up to 15--20% of energy and bandwidth requirements compared with the existing approaches.
CIDE: Chaotically Initialized Differential Evolution
Authors: Ahmet Bedri Ozer
Venue: Expert Systems with Applications: An International Journal (2010)

This paper proposes new Differential Evolution (DE) algorithm, named as Chaotically Initialized Differential Evolution (CIDE), that uses chaotic maps with certainty, ergodicity, unpredictability, non-periodicity, complex temporal behavior and the stochastic property for initial population generation. This has been done by using of different chaotic number generators each time a random number is needed by the classical DE algorithm in its initial step. Seven chaotic maps have been analyzed in the benchmark functions. It has been detected that coupling emergent results in different areas, like those of DE and complex dynamics, can improve the quality of results in some optimization problems and also that chaos may be a desired process. It has been also shown that, Sinus map and Circle map have somewhat increased the solution quality, that is in some cases they improved the global searching capability by escaping the local solutions.
A technology readiness levels (TRLs) calculator software for systems engineering and technology management tool
Authors: Taner Altunok, Tanyel Cakmak
Venue: Advances in Engineering Software (2010)

Turkish defense industry and policy makers seek effective and successful system development programs by implementing a validation mechanism to verify the maturity of new technologies being developed in national laboratories and industry. Technology Readiness Levels (TRLs) developed by NASA as a general metric of technology advancement and it has been widely accepted as a systems engineering and technology management metric tool. In order to explore the sufficiency of this tool, first of all, academic and applicable studies of army and civil organizations have been searched out and the lessons learned have been analyzed in this study. Thereafter, questionnaires of awareness of TRLs and TRL Calculator have been applied to defense firms in Ankara, and interviews held with the technology developers, firms' speakers and defense authorities. Finally, the applicable algorithm of TRL calculator has been recommended for Turkish defense industry.
Vibration based fault diagnosis of monoblock centrifugal pump using decision tree
Authors: N. R. Sakthivel, V. Sugumaran, S. Babudevasenapati
Venue: Expert Systems with Applications: An International Journal (2010)

Monoblock centrifugal pumps are widely used in a variety of applications. In many applications the role of monoblock centrifugal pump is critical and condition monitoring is essential. Vibration based continuous monitoring and analysis using machine learning approaches are gaining momentum. Particularly artificial neural networks, fuzzy logic were employed for continuous monitoring and fault diagnosis. This paper presents the use of C4.5 decision tree algorithm for fault diagnosis through statistical feature extracted from vibration signals of good and faulty conditions.