ppxscal/embedding_network huggingface dataset:
On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs
Authors: Nicla Bernasconi, Konstantinos Panagiotou, Angelika Steger
Venue: Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques (2008)

Let be a class of labeled connected graphs and let be the class of biconnected graphs in . In this paper we develop a general framework that allows us to derive mechanically the degree distribution of random graphs with n vertices from certain 'nice' classes as a function of the degree distribution of the graphs in that are drawn under a specific probabilistic model, namely the Boltzmann model. We apply this framework to obtain the degree distribution of a random outerplanar graph and a random series-parallel graph. For the latter we formulate a generic concentration result that allows us to make statements that are true with high probability for a large family of variables defined on random graphs drawn according to the Boltzmann distribution.
DINS, a MIP Improvement Heuristic
Authors: Shubhashis Ghosh
Venue: Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization (2007)

We introduce DISTANCE INDUCED NEIGHBOURHOOD SEARCH (DINS), aMIP improvement heuristic that tries to find improved MIP feasible solutions from a givenMIP feasible solution. DINS is based on a variation of local search that is embedded in an exact MIP solver, namely a branch-and-bound or a branch-and-cut MIP solver. The key idea is to use a distancemetric between the linear programming relaxation optimal solution and the currentMIP feasible solution to define search neighbourhoods at different nodes of the search tree generated by the exact solver. DINS considers each defined search neighbourhood as a new MIP problem and explores it by an exact MIP solver with a certain node limit. On a set of standard benchmark problems, DINS outperforms the MIP improvement heuristics Local Branching due to Fischetti and Lodi and Relaxation Induced Neighbourhood Search due to Danna, Rothberg, and Pape, as well as the generic commercial MIP solver Cplex.
Mixed Ant Colony Optimization for the Unit Commitment Problem
Authors: Ana-Talida Serban, Guillaume Sandou
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part I (2007)

In this paper, a mixed integer programming method based on ant colony optimization is presented, and applied to the classical Unit Commitment problem. The idea is to reformulate the problem into a graph exploration structure, and to use discrete ant colony optimization to explicitly take into account time down, time up and demand constraints in the optimization procedure. This method is coupled with a continuous ant colony algorithm to compute produced powers. Results, obtained on relatively small cases, show the viability of the proposed approach: a near optimal solution, with guarantees of feasibility, can be computed with low computation times.
Comparative Study of Meta-heuristics for Solving Flow Shop Scheduling Problem Under Fuzziness
Authors: Noelia González, Camino R. Vela, Inés González-Rodríguez
Venue: Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks (2007)

In this paper we propose a hybrid method, combining heuristics and local search, to solve flow shop scheduling problems under uncertainty. This method is compared with a genetic algorithm from the literature, enhanced with three new multi-objective functions. Both single objective and multi-objective approaches are taken for two optimisation goals: minimisation of completion time and fulfilment of due date constraints. We present results for newly generated examples that illustrate the effectiveness of each method.
Cartoon textures: re-using traditional animation via methods for segmentation, re-sequencing, and inbetweening
Authors: Robert E. Bodenheimer,  Jr.
Venue:  (2006)

A large body of traditional animation exists, both from television and film, which contains many interesting characters and animation sequences. This dissertation shows how to incorporate that body of animation into motion libraries by making them re-usable. The most desirable qualities of traditional animation are the nuances an artist adds to each character, giving that character personality and style. As such, the focus is on semi-automatic techniques that allow the re-use of traditional animation, yet include the artist at every step of the process. The objective is to provide a method of re-using traditional animation by creating novel animations from a library of existing hand-drawn cartoons. Sequences of similar-looking cartoon data are combined into a user-directed animation. This dissertation first addresses the issue of preparing the cartoon images to be incorporated into a motion library. Three methods are investigated for segmenting the cartoon images from their backgrounds: an ad hoc method, level sets, and support vector machines. We find that support vector machines are robust to artifacts in the cartoon images and are able to segment full-size images in a few seconds. Secondly, a method of nonlinear dimensionality reduction is applied to the cartoon images to discover a lower-dimensional manifold of the data. This manifold is traversed to create new sequences of cartoon animation, maintaining a model-free method, i.e., no a priori knowledge of the drawing or character is required. Finally, a radial basis function implicit surface modeling technique and a fast non-rigid elastic registration algorithm are combined to provide inbetween contours and textures given two key images of traditional animation.
Analogical Basis Deconstruction Theory for Signal Restoration and MRI Reconstruction
Authors: Fengqin Liu, Peng Miao
Venue: Proceedings of the 2008 Congress on Image and Signal Processing, Vol. 3 - Volume 03 (2008)

A new so-called Analogical Basis Deconstruction (ABD) theory for noisy signal restoration has been developed in this paper. The noise we consider here contaminates partial frequency bandwidth of the signal strongly. Intrinsically, the ABD theory treats any linear transform (like Fourier Transform and Wavelet Transform) as the transform of basis, not the weights of basis, so the signal can be reconstructed only based on the partial pure frequency data of noisy signal. The key part of the ABD theory is the process of deconstructing the partial frequency signal to the sum of weighted analogical basis which depend on the form of pure or nearly pure frequency bandwidth. We propose the Asymptotic Iterative Estimate (AIE) algorithm to deconstruct the signal. We also apply the ABD theory to accomplish the image reconstruction from partial k-space data in MRI where only partial frequency data are valid.
Mary Edwards: Computing for a Living in 18th-Century England
Authors: Mary Croarken
Venue: IEEE Annals of the History of Computing (2003)

The production of astronomical tables is an ancient activity, one requiring a great deal of mathematical computation. During the 18th century, production of these tables increased and the British government hired human computers to prepare the tables of the annual Nautical Almanac. From 1765 to 1811, the Nautical Almanac employed 35 computers; only one, Mary Edwards, was a woman, whose story is told here.
Genomic Spring-Synteny Visualization with IMAS
Authors: Chris D. Shaw
Venue: Proceedings of the 2008 Fifth International Conference BioMedical Visualization: Information Visualization in Medical and Biomedical Informatics (2008)

This paper presents a synteny visualization and analysis tool developed in connection with IMAS – the Interactive Multigenomic Analysis System. This visual analysis tool enables biologists to analyze the relationships among genomes of closely related organisms in terms of the locations of genes and clusters of genes. A biologist starts IMAS with the DNA sequence, uses BLAST to find similar genes in related sequences, and uses these similarity linkages to create an enhanced node-link diagram of syntenic sequences. We refer to this as Spring Syntenyvisualization, which is aimed at helping a biologist discover similar gene ordering relationships across species. The paper describes the techniques that are used to support synteny visualization, in terms of computation, visual design, and interaction design.
Dimensioning of power semiconductor devices in their unnatural environment
Authors: Dinesh Chamund, Noel Y. A. Shammas
Venue: Proceedings of the 7th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications (2008)

Power diodes, high power thyristors, gate turn-off thyristors (GTOs) and IGBT modules are the main power switches widely used in the industries today. Therefore it is important that ratings and characteristics are well understood before these devices are designed in the systems. Operating devices within the data-sheets limits assures safe and reliable operation of devices, however some applications such as pulsed power fall outside the natural applications limits for which the devices are originally designed. Therefore dimensioning these devices outside their normal application area becomes somewhat difficult. In this paper we introduce a methodology where by electro-thermal device models are created from the datasheet information which can be used in conjunction with spreadsheet to calculate the maximum junction temperature for reliable operation of power devices under abnormal conditions.
Modeling of High Quality Granules
Authors: Andrzej Skowron, Jaroslaw Stepaniuk
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

In Granular Computing (GC) we search for granules satisfying some criteria. These criteria can be based on the minimal length principle, can express acceptable risk degrees of granules, or can use some utility functions. We discuss the role of approximation spaces in modeling granules satisfying such criteria.
Agent-Based Co-Operative Co-Evolutionary Algorithm for Multi-Objective Optimization
Authors: Rafał Dreżewski, Leszek Siwik
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

Co-evolutionary algorithms are a special type of evolutionary algorithms, in which the fitness of each individual depends on other individuals' fitness. Such algorithms are applicable in the case of problems for which the formulation of explicit fitness function is difficult or impossible. Co-evolutionary algorithms also maintain population diversity better than "classical" evolutionary algorithms. In this paper the agent-based version of co-operative co-evolutionary algorithm is presented and applied to multi-objective test problems. The proposed technique is also compared to two "classical" multi-objective evolutionary algorithms.
A Colour Correlation-Based Stereo Matching Using 1D Windows
Authors: Sébastien Lefebvre, Sébastien Ambellouis, François Cabestaing
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

In this paper, we propose an original approach to colour correlation-based stereo matching with mono-dimensional windows. The result of the algorithm is a quasi-dense disparity map associated with its confidence map. For each pixel, correlation indices are computed for several widths of windows and several positions of the current pixel. Three criteria, extracted from each correlation curve, are combined by a fuzzy filter to define a confidence measure. A basic decision rule computes the disparity value and its associated confidence for most of the image pixels. A first study shows results obtained on grey level images with our 1D method and a classical 2D method. The method is applied to the RGB colour space: three disparity maps are computed and fused to compute the final disparity map. The method is validated on the Tsukuba image pair. On the first hand, we show that our method presents lower error rates with the RGB colour space than with the grey level image for identical density rates. On the other hand, our results are compared with those obtained using similar colour 2D methods (presented on the Middlebury website). Our algorithm is ranked in the first places for each area of the image.
A PHANTOM® Device with 6DOF Force Feedback and Sensing Capabilities
Authors: Abderrahmane Kheddar, Venkatraghavan Gourishankar, Paul Evrard
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

This paper describes a technical solution that has been devised to embed the SensAble PHANTOM® 6dof force feedback device with a light-weight 6dof force sensor from ATI: the Nano43. The design has been made in a way such that original performances are kept in terms of force feedback and sensing.
Computational Hematology in Systems Biology
Authors: Toru Horisawa, Toshihiko Komatsuzaki, Yutaka Saikawa
Venue: Proceedings of the 8th international conference on Cellular Automata for Reseach and Industry (2008)

One of the key issues in hematology is how blood cell production is conducted and sturdily maintained under physiological and pathological conditions. Due to the difficulty in manipulating hematopoietic stem cells in vitro, control of hematopoietic processes remains unclear. Models are required for easy access and are highly expected to show not only reproduction of blood cell behaviors in vivo, but also predictability of specific cellular responses under experimental stimulations. We demonstrate herein a granulopoietic model using a 3-dimensional cellular automaton (3D-CA) model. This model incorporates a spatio-temporal concept to describe granulopoiesis that develops in the finite space of the bone marrow cavity. This 3D-CA model is valuable in clinical simulation studies such as determination of a granulocyte growth factor administration for cancer patients with neutropenia. Analyzing the cellular kinetics of hematopoiesis by 3D-CA modeling will provide novel strategies for cancer treatment.
Indoor tracking of laboratory mice via an rfid-tracking framework
Authors: Mareike Kritzler, Stephanie Jabs, Philipp Kegel, Antonio Krüger
Venue: Proceedings of the first ACM international workshop on Mobile entity localization and tracking in GPS-less environments (2008)

In this paper a solution for tracking of laboratory mice in an indoor semi natural environment based on RIFD-Technology is presented. A tracking framework is built where combined sensors identify and track the mice continuously 24 hours a day and 7 days a week. Besides the hardware setup for the data collection we present a software solution which prototypically implements an analytic module for the mouse movements.
MRI-Compatible Rigid and Flexible Outer Sheath Device with Pneumatic Locking Mechanism for Minimally Invasive Surgery
Authors: Siyang Zuo, Noriaki Yamanaka, Ikuma Sato, Ken Masamune, Hongen Liao, Kiyoshi Matsumiya, Takeyoshi Dohi
Venue: Proceedings of the 4th international workshop on Medical Imaging and Augmented Reality (2008)

To reduce the invasiveness of surgery, we developed an outer sheath device using a flexible toothed link and pneumatic locking mechanism that works with flexible devices used in minimally invasive surgery. The outer sheath can be switched between flexible and rigid modes, and the angle of its tip can be controlled by a nylon wire. All parts of this device are made of plastic and are MRI-compatible. We manufactured a sheath prototype, 300 mm long, with a 20-mm outer diameter, and an 8-mm inner diameter. Experiment results showed that the outer sheath can protect tissues from high insertion force and secure the path for flexible devices. It can follow a curved path with a reasonable radius.
A Solution of Dynamic Vehicle Routing Problem with Time Window via Ant Colony System Metaheuristic
Authors: Sabrina Moreira de Oliveira, Sérgio Ricardo de Souza, Maria Amélia Lopes Silva
Venue: Proceedings of the 2008 10th Brazilian Symposium on Neural Networks (2008)

This paper addresses an architecture for solving the Dynamic Vehicle Routing Problem with Time Windows(DVRPTW) and capacitated fleet using the Ant Colony System(ACS) metaheuristic. All customers are known in advance,but their demands take place at any instant within a time horizon. The architecture has been developed to run in a centralized fashion, having two main elements, i.e, the Events Manager Element and the ACS Element. The Events Manager Element is the central structure of the solution architecture. The Static Problem Element receives the orders and selects them according to their time windows, sending them to the ACS Element. It defines, at each static problem,the number of routes and the sequence of customers to be served. All routes arose from the ACS Element are dispatched to the Events Manager, that will be responsible for assigning them to the vehicles. All the architecture provided results are feasible and all the time windows are always respected.
Perceptually Motivated Shape Evolution with Shape-Preserving Property
Authors: Sergej Lewin, Xiaoyi Jiang, Achim Clausing
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

In this paper we introduce a novel concept of shape evolution. It is perceptually motivated and takes the local shape symmetry into account. In particular, during the new shape evolution the shape parts in accordance with the human perception are removed step by step and the coarse parts remain geometrically unchanged during removing the fine parts. This shape-preserving property cannot be achieved by the popular Gaussian smoothing (evolution based on geometric heat flow) and related variants. Experimental results demonstrate the behavior and power of this new shape evolution scheme.
Geometric applications of bivariate q-Bernstein and q-orthogonal polynomials
Authors: Plamen Simeonov, Vasilis Zafiris
Venue: Proceedings of the American Conference on Applied Mathematics (2008)

A q-version of a Bernstein basis of bivariate polynomials and a system of q-orthogonal bivariate polynomials over triangular domains are introduced to construct q-versions of the de Casteljau and the degree elevation algorithms. The polynomials are similar to the polynomials introduced recently by Farouki, Goodman, and Sauer [2]. The orthogonal polynomials are defined as products of scaled q-Legendre polynomials and Jacobi polynomials, a construction introduced by Xu [4]. The double integration is continuous in one variable and discrete in the other variable.
Efficiency of Dynamic Reconfigurable Datapath Extensions --- A Case Study
Authors: Steffen Köhler, Jan Schirok, Jens Braunes, Rainer G. Spallek
Venue: Proceedings of the 4th international workshop on Reconfigurable Computing: Architectures, Tools and Applications (2008)

In this paper, we examine the efficiency of the ARRIVE architecture, a coarse-grain reconfigurable datapath extension to an embedded RISC microprocessor. It is considered platform specific, optimized for the media and communication processing domain. Detailed chip area requirements are obtained through the mapping to an UMC 0.18μm standard cell ASIC process layout. Furthermore, we present hardware utilization and power simulation results of six media/communication benchmark applications based on post-layout process information. As a result, we can recognize increased area efficiency ($\frac{operations}{mm^2\cdot s}$) and power efficiency ($\frac{operations}{mW\cdot s}$) of the reconfigurable datapath extended RISC microprocessor.
Ultra-Lightweight Implementations for Smart Devices --- Security for 1000 Gate Equivalents
Authors: Carsten Rolfes, Axel Poschmann, Gregor Leander, Christof Paar
Venue: Proceedings of the 8th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Applications (2008)

In recent years more and more security sensitive applications use passive smart devices such as contactless smart cards and RFID tags. Cost constraints imply a small hardware footprint of all components of a smart device. One particular problem of all passive smart devices such as RFID tags and contactless smart cards are the harsh power constraints. On the other hand, active smart devices have to minimize energy consumption. Recently, many lightweight block ciphers have been published. In this paper we present three different architecture of the ultra-lightweight algorithm present and highlight their suitability for both active and passive smart devices. Our implementation results of the serialized architecture require only 1000 GE. To the best of our knowledge this is the smallest hardware implementation of a cryptographic algorithm with a moderate security level.
CDMA Power Control Using Channel Prediction in Mobile Fading Channels
Authors: Sangho Choe
Venue: Proceedings of the 5th international conference on Wired/Wireless Internet Communications (2007)

This paper presents a CDMA closed-loop power control (CLPC) using channel prediction in time-varying mobile fading channels. The proposed CLPC that relies on least square (LS) or least mean square (LMS) based autoregressive (AR) low-rate prediction provides a particularly robust performance for large loop delays, especially in the presence of channel estimation errors. As the mobility increases the proposed CLPC reduces mean-square error (MSE) further than conventional CLPCs. The Monte-Carlo simulation results demonstrate the superiority of the proposed CLPC over conventional nonpredictive and predictive CLPCs.
Spectral Clustering Scheduling Techniques for Tasks with Strict QoS Requirements
Authors: Nikos Doulamis, Panagiotis Kokkinos, Emmanouel Varvarigos
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

Efficient task scheduling is fundamental for the success of the Grids, since it directly affects the Quality of Service (QoS) offered to the users. Efficient scheduling policies should be evaluated based not only on performance metrics that are of interest to the infrastructure side, such as the Grid resources utilization efficiency, but also on user satisfaction metrics, such as the percentage of tasks served by the Grid without violating their QoS requirements. In this paper, we propose a scheduling algorithm for tasks with strict timing requirements, given in the form of a desired start and finish time. Our algorithm aims at minimizing the violations of the time constraints, while at the same time minimizing the number of processors used. The proposed scheduling method exploits concepts derived from spectral clustering, and groups together for assignment to a computing resource the tasks so to a) minimize the time overlapping of the tasks assigned to a given processor and b) maximize the degree of time overlapping among tasks assigned to different processors. Experimental results show that our proposed strategy outperforms greedy scheduling algorithms for different values of the task load submitted.
People with Specific Learning Difficulties: Easy to Read and HCI
Authors: Andrea Petz, Bror Tronbacke
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

Off the beaten tracks of technically focused accessibility and usability regulations lies a field of research - almost undiscovered by mainstream accessibility and usability discussions that has the potential to serve people with Specific Learning Difficulties as well as other possible target groups best: How to provide information, tools, services and structures that is readable, understandable and usable for the biggest possible user group.