ppxscal/embedding_network huggingface dataset:
Locally Adaptive Speed Functions for Level Sets in Image Segmentation
Authors: Karsten Rink, Klaus Tönnies
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

We propose a framework for locally adaptive level set functions. The impact of well-known speed terms for the evolution of the active contour is adjusted by parameterising them with functions based on pre-defined properties. This allows for the application of level set methods even if image features are subject to large variations or if certain properties of the model are only valid for parts of the segmentation process. We present a number of examples and applications for the proposed concept and also address advantages and drawbacks of combinations of locally adaptive speed terms.
Error suppression mechanisms for DNA tile self-assembly and their simulation
Authors: Kenichi Fujibayashi, David Yu Zhang, Erik Winfree, Satoshi Murata
Venue: Natural Computing: an international journal (2009)

Algorithmic self-assembly using DNA-based molecular tiles has been demonstrated to implement molecular computation. When several different types of DNA tile self-assemble, they can form large two-dimensional algorithmic patterns. Prior analysis predicted that the error rates of tile assembly can be reduced by optimizing physical parameters such as tile concentrations and temperature. However, in exchange, the growth speed is also very low. To improve the tradeoff between error rate and growth speed, we propose two novel error suppression mechanisms: the Protected Tile Mechanism (PTM) and the Layered Tile Mechanism (LTM). These utilize DNA protecting molecules to form kinetic barriers against spurious assembly. In order to analyze the performance of these two mechanisms, we introduce the hybridization state Tile Assembly Model (hsTAM), which evaluates intra-tile state changes as well as assembly state changes. Simulations using hsTAM suggest that the PTM and LTM improve the optimal tradeoff between error rate $$\epsilon$$ and growth speed r, from $$r \approx \beta \epsilon^{2.0}$$ (for the conventional mechanism) to $$r \approx \beta \epsilon^{1.4}$$ and $$r \approx \beta \epsilon^{0.7}$$ , respectively.
Agent-Based Architecture for Interactive System Design: Current Approaches, Perspectives and Evaluation
Authors: Christophe Kolski, Peter Forbrig, Bertrand David, Patrick Girard, Chi Dung Tran, Houcine Ezzedine
Venue: Proceedings of the 13th International Conference on Human-Computer Interaction. Part I: New Trends (2009)

This paper proposes a survey concerning agent-based architectures of interactive systems. This survey is focused on certain models and perspectives. Indeed, general agent-based architectures are first presented. Then agent-based approaches dedicated to CSCW systems are reviewed. The appearance of web services requires new agent-based approaches; basic ideas are introduced. Agent-based interactive systems necessitate new tools for their evaluation; an example of representative evaluation tool is presented.
Subgroup Discovery for Test Selection: A Novel Approach and Its Application to Breast Cancer Diagnosis
Authors: Marianne Mueller, Rómer Rosales, Harald Steck, Sriram Krishnan, Bharat Rao, Stefan Kramer
Venue: Proceedings of the 8th International Symposium on Intelligent Data Analysis: Advances in Intelligent Data Analysis VIII (2009)

We propose a new approach to test selection based on the discovery of subgroups of patients sharing the same optimal test, and present its application to breast cancer diagnosis. Subgroups are defined in terms of background information about the patient. We automatically determine the best t subgroups a patient belongs to, and decide for the test proposed by their majority. We introduce the concept of prediction quality to measure how accurate the test outcome is regarding the disease status. The quality of a subgroup is then the best mean prediction quality of its members (choosing the same test for all). Incorporating the quality computation in the search heuristic enables a significant reduction of the search space. In experiments on breast cancer diagnosis data we showed that it is faster than the baseline algorithm APRIORI-SD while preserving its accuracy.
Finisher Automatic Width Control in Hot Strip Mill Based on RBF
Authors: Peng Kaixiang, Dong Jie, Xu Pin
Venue: Proceedings of the 2009 WRI Global Congress on Intelligent Systems - Volume 04 (2009)

In order to increase the qualified ratio of the products and the precision of the width in continuous hot strip mill, width gauge is usually set behind the last finishing roll stand. At the same time, the purpose of controlling the strip width by adjusting the tension of the stands can be accomplished. However, the long distance from the last finishing roll stand’s central line to width gauge results in a large time delay and time variation of the system. It is difficult to establish accurate model. By using predictive control method which depends a little on the model and RBF network to approximate the control rule directly, it shots online computing time that passes over solving Diophantine and inversing Matrix and it is suitable for the fast rolling process. Simulation result shows the validity of the proposed method. The paper lays a solid theory foundation for further practical application.
Motion-aware temporal coherence for video resizing
Authors: Yu-Shuen Wang, Hongbo Fu, Olga Sorkine, Tong-Yee Lee, Hans-Peter Seidel
Venue: ACM Transactions on Graphics (TOG) (2009)

Temporal coherence is crucial in content-aware video retargeting. To date, this problem has been addressed by constraining temporally adjacent pixels to be transformed coherently. However, due to the motion-oblivious nature of this simple constraint, the retargeted videos often exhibit flickering or waving artifacts, especially when significant camera or object motions are involved. Since the feature correspondence across frames varies spatially with both camera and object motion, motion-aware treatment of features is required for video resizing. This motivated us to align consecutive frames by estimating interframe camera motion and to constrain relative positions in the aligned frames. To preserve object motion, we detect distinct moving areas of objects across multiple frames and constrain each of them to be resized consistently. We build a complete video resizing framework by incorporating our motion-aware constraints with an adaptation of the scale-and-stretch optimization recently proposed by Wang and colleagues. Our streaming implementation of the framework allows efficient resizing of long video sequences with low memory cost. Experiments demonstrate that our method produces spatiotemporally coherent retargeting results even for challenging examples with complex camera and object motion, which are difficult to handle with previous techniques.
Non-parametric Single View Reconstruction of Curved Objects Using Convex Optimization
Authors: Martin R. Oswald, Eno Töppe, Kalin Kolev, Daniel Cremers
Venue: Proceedings of the 31st DAGM Symposium on Pattern Recognition (2009)

We propose a convex optimization framework delivering intuitive and reasonable 3D meshes from a single photograph. For a given input image, the user can quickly obtain a segmentation of the object in question. Our algorithm then automatically generates an admissible closed surface of arbitrary topology without the requirement of tedious user input. Moreover we provide a tool by which the user is able to interactively modify the result afterwards through parameters and simple operations in a 2D image space. The algorithm targets a limited but relevant class of real world objects. The object silhouette and the additional user input enter a functional which can be optimized globally in a few seconds using recently developed convex relaxation techniques parallelized on state-of-the-art graphics hardware.
Fabrication of a Glucose Biosensor by Piezoelectric Inkjet Printing
Authors: Tianming Wang, Chris Cook, Brian Derby
Venue: Proceedings of the 2009 Third International Conference on Sensor Technologies and Applications (2009)

Glucose oxidase (GOx) is used as an immobilized enzyme in blood glucose level sensors. Conventional single used sensors are fabricated by screen printing enzyme suspensions or pastes, or photolithography method to immobilize the enzyme onto carbon black electrodes. There is considerable interest in producing sensor structures of smaller dimensions than are readily achievable through these techniques. One technology that may be able to deliver enzyme-based sensors with smaller length scales is inkjet printing. Inkjet printing is capable of accurately placing picolitre volumes of liquids onto a substrate, making it an ideal technology that could be used within the medical sensor field. GOx solution in PBS is printed by a drop-on-demand piezoelectric printer, the retained activity of GOx before and after printing demonstrates that inkjet printing is a practical technique to fabricate cheap, small, and reproducible biosensors.
The Mobile Robot GPS Position Based on Neural Network Adaptive Kalman Filter
Authors: Wei Wu, Wei Min
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 01 (2009)

This paper presents a GPS positioning method based on neural network adaptive Kalman filter. Using the innovation vector which reflects the degree how the model fits the data, and real-timely accessing to the innovation vector’s ratio of the theoretical variance to the actual of variance, we can get the working conditions of Kalman filter. Then track the change of system parameters through neural network, where the adaptive regulatory factors are generated which can correct the Kalman filter, improve the performance of the Kalman Filter, and prevent the filter divergence. Because neural network has a strong learning and adaptive ability, the system noise covariance matrix can be corrected real-timely, and can be adjusted online. The simulation results show that the error divergence produced by Kalman filter can be effectively suppressed, and the positioning accuracy of mobile robot GPS positioning system can be effectively improved.
Calibration of Radially Symmetric Distortion by Fitting Principal Component
Authors: Hideitsu Hino, Yumi Usami, Jun Fujiki, Shotaro Akaho, Noboru Murata
Venue: Proceedings of the 13th International Conference on Computer Analysis of Images and Patterns (2009)

To calibrate radially symmetric distortion of omnidirectional cameras such as fish-eye lenses, calibration parameters are usually estimated so that lines, which are supposed to be straight in the 3D real scene, are mapped to straight lines in the calibrated image. In this paper, this problem is treated as a fitting problem of the principal component in uncalibrated images, and an estimation procedure of calibration parameters is proposed based on the principal component analysis. Experimental results for synthetic data and real images are presented to demonstrate the performance of our calibration method.
An Integrated System of Freeway Toll and Traffic Data Investigation: PDF417 Two-Dimensional Bar Code System
Authors: Yongfei Yan, Shunying Zhu, Hong Wang
Venue: Proceedings of the 2009 International Conference on Measuring Technology and Mechatronics Automation - Volume 03 (2009)

Aiming at the deficiency of being difficult to investigating and analyzing the traffic data by the toll data of freeway, utilizing the information storage technology of PDF417 two-dimensional (PDF417-2D) bar code, this paper sets up an integrated system of freeway toll and traffic data investigation, makes the encoding rules and content of record information which on the PDF417-2D bar code, and presents the procedure of toll and traffic data investigating. Combining Microsoft SQL Server data base management system and utilizing the data information of PDF417-2D bar code, this paper also proposed methods of freeway traffic volume OD investigation, creating OD matrix of entrances and exits, and calculating average traffic volume of section, which has offered a new approach to the unity of freeway toll and traffic data investigating and analyzing.
Efficient triangulation for P2P networked virtual environments
Authors: Eliya Buyukkaya, Maha Abdallah
Venue: Multimedia Tools and Applications (2009)

Peer-to-peer (P2P) architectures have recently become a popular design choice for building scalable Networked Virtual Environments (NVEs). In P2P-based NVEs, system and data management is distributed among all participating users. Towards this end, a Delaunay Triangulation can be used to provide connectivity between the different NVE users depending on their positions in the virtual world. However, a Delaunay Triangulation clearly suffers from high maintenance cost as it is subject to high connection change rate due to continuous users' movement. In this paper, we propose a new triangulation algorithm that provides network connectivity to support P2P NVEs while dramatically decreasing maintenance overhead by reducing the number of connection changes due to users' insertion and movement. Performance evaluations show that our solution drastically reduces overlay maintenance cost in highly dynamic NVEs. More importantly, and beyond its quantitative advantages, this work questions the well accepted Delaunay Triangulation as a reference means for providing connectivity in NVEs, and paves the way for more research towards more practical alternatives for NVE applications.
Human guidance of synchronous E-discussions: the effects of different moderation scripts on peer argumentation
Authors: Baruch B. Schwarz, Christa S. C. Asterhan, Julia Gil
Venue: Proceedings of the 9th international conference on Computer supported collaborative learning - Volume 1 (2009)

Researchers and educators have considered synchronicity as a less desirable mode of communication than a-synchronicity in learning tasks involving discussions. This is because synchronicity does not easily allow students to take into consideration collaborative scripts in the heat of discussions. Also, moderation by teachers of synchronous discussions has been considered as extremely challenging so far. We describe here a study in which we trained students-teachers to moderate synchronous discussions and asked them to moderate discussions in two different ways of guidance, social and argumentation guidance. We show that moderation of synchronous discussions is feasible as effects of moderation on argumentative, social and interactive aspects of the discussion reflect the kind of guidance suggested. Also we show differences between girls and boys in the way they participate in synchronous discussions and respond to the moderator's suggestions.
Dependency-based semantic role labeling of PropBank
Authors: Richard Johansson, Pierre Nugues
Venue: Proceedings of the Conference on Empirical Methods in Natural Language Processing (2008)

We present a PropBank semantic role labeling system for English that is integrated with a dependency parser. To tackle the problem of joint syntactic--semantic analysis, the system relies on a syntactic and a semantic subcomponent. The syntactic model is a projective parser using pseudo-projective transformations, and the semantic model uses global inference mechanisms on top of a pipeline of classifiers. The complete syntactic-semantic output is selected from a candidate pool generated by the subsystems. We evaluate the system on the CoNLL-2005 test sets using segment-based and dependency-based metrics. Using the segment-based CoNLL-2005 metric, our system achieves a near state-of-the-art F1 figure of 77.97 on the WSJ+Brown test set, or 78.84 if punctuation is treated consistently. Using a dependency-based metric, the F1 figure of our system is 84.29 on the test set from CoNLL-2008. Our system is the first dependency-based semantic role labeler for PropBank that rivals constituent-based systems in terms of performance.
An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography
Authors: Jean-Charles Faugère, Ludovic Perret
Venue: Journal of Symbolic Computation (2009)

In this paper, we present an efficient and general algorithm for decomposing multivariate polynomials of the same arbitrary degree. This problem, also known as the Functional Decomposition Problem (FDP), is classical in computer algebra. It is the first general method addressing the decomposition of multivariate polynomials (any degree, any number of polynomials). As a byproduct, our approach can be also used to recover an ideal I from its kth power I^k. The complexity of the algorithm depends on the ratio between the number of variables (n) and the number of polynomials (u). For example, polynomials of degree four can be decomposed in O(n^1^2), when this ratio is smaller than 12. This work was initially motivated by a cryptographic application, namely the cryptanalysis of 2R^- schemes. From a cryptographic point of view, the new algorithm is so efficient that the principle of two-round schemes, including 2R^- schemes, becomes useless. Besides, we believe that our algorithm is of independent interest.
Clinical System Design Considerations for Critical Handoffs
Authors: Nancy Staggers, Jia-Wen Guo, Jacquelyn W. Blaz, Bonnie M. Jennings
Venue: Proceedings of the 1st International Conference on Human Centered Design: Held as Part of HCI International 2009 (2009)

Change of shift report (CoSR) is a nurse-to-nurse communication event (handoff) that could potentially result in missed or incomplete information, time inefficiencies and patient errors. Although technology is touted as being amenable for this process, researchers have not yet evaluated how CoSR might be supported through computerization. This paper summarizes past research on this critical transition, describes the results of a qualitative study for shift report content on medical and surgical units in the U.S. and then outlines requirements for computerized support of the process. Three potential CoSR designs are provided and discussed: a patient summary screen, a personally-tailored design for nurses, and a problem-oriented design. Benefits and disadvantages of each are proposed.
Sensitivity Analysis of Probabilistic Graphical Models: Theoretical Results and Their Applications on Bayesian Network Modeling and Inference
Authors: Hei Chan
Venue:  (2009)

Probabilistic graphical models such as Bayesian networks are widely used for large-scale data analysis in various fields such as customer data analysis and medical diagnosis, as they model probabilistic knowledge naturally and allow the use of efficient inference algorithms to draw conclusions from the model. Sensitivity analysis of probabilistic graphical models is the analysis of the relationships between the inputs (local beliefs), such as network parameters, and the outputs (global beliefs), such as values of probabilistic queries, and addresses the central research problem of how beliefs will be changed when we incorporate new information to the current model. This book provides many theoretical results, such as the assessment of global belief changes due to local belief changes, the identification of local belief changes that induce certain global belief changes, and the quantifying of belief changes in general. These results can be applied on the modeling and inference of Bayesian networks, and provide a critical tool for the researchers, developers, and users of Bayesian networks during the process of probabilistic data modeling and reasoning. 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 Method of Eliminating Direct Super-Class to Detect Cycle of Concepts
Authors: Zhang Hui, Zhang Zhen, Zhu Junwu
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 03 (2009)

Ontology has gained broad attention within the knowledge engineering community and their related application domain in recent years. Ontology is an explicit formal sharing conceptualization of one domain. Ontology maintenanceis one of most important work during ontology’s development lifecycle. Cycle of concepts is one of the most common inconsistency errors in ontology. In this paper, we propose a method of eliminating direct super-class to detect cycle of concepts (EDS2DCC).This method firstly constructs oriented graphs according to the system of concepts in ontology. Secondly, it defines an array to store concepts access states and a table to store current concepts list, then the method determines whether existing cycle of concepts or not based on the length which obtained from periodic oriented graphs. Finally, we demonstrate the validity of the method by applying and analyzing scenarios.
Multifractality in TCP/IP traffic: the case against
Authors: Darryl Veitch, Nicolas Hohn, Patrice Abry
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2005)

The discovery of long-range dependence (a kind of asymptotic fractal scaling) in packet data from LANs and WANs, was followed by further work detailing evidence for multifractal behaviour in TCP/IP traffic in WANs. In terms of networking however, physical mechanisms for such behaviour have never been convincingly demonstrated, leaving open the question of whether multifractal traffic models are of black box type, or alternatively if there is anything 'real' behind them. In this paper we review the evidence for multifractal behaviour of aggregate TCP traffic, and show that in many ways it is weak. Our study includes classic traces and very recent ones. We point out misunderstandings in the literature concerning the scales over which multifractality has been claimed. We explain other pitfalls which have led to the multifractal case being overstated, in particular the possibility of 'pseudo scaling' being confused with true scaling, due to shortcomings in the statistical tools. We argue for an alternative point process model with strong physical meaning. It reproduces the higher order statistics of the data well, despite not being calibrated for them, yet is not multifractal. From its standpoint, the empirical multifractal behaviour is seen as a misinterpretation due to a lack of power in the statistical methodology.
Approximate Computation of Nash Equilibrium in Complex Simulated Economic System
Authors: Minghong Zhang, Bin Wang, Shan Zou
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02 (2009)

In this article we simulate a complex economic system based on network economics, game theory and computer simulation technology. We develop a method to find approximate solution of Nash Equilibrium in the simulated economic system by tracing points of the optimal curve and thus estimate enterprise’s income in the neighborhood of Nash Equilibrium.