ppxscal/embedding_network huggingface dataset:
Reconstruction Using Witness Complexes
Authors: Leonidas J. Guibas, Steve Y. Oudot
Venue: Discrete Computational Geometry (2008)

We present a novel reconstruction algorithm that, given an input point set sampled from an object&#x00a0;S, builds a one-parameter family of complexes that approximate S at different scales. At a high level, our method is very similar in spirit to Chew&#x2019;s surface meshing algorithm, with one notable difference though: the restricted Delaunay triangulation is replaced by the witness complex, which makes our algorithm applicable in any metric space. To prove its correctness on curves and surfaces, we highlight the relationship between the witness complex and the restricted Delaunay triangulation in 2d and in&#x00a0;3d. Specifically, we prove that both complexes are equal in 2d and closely related in&#x00a0;3d, under some mild sampling assumptions.
A Pragmatic Method for Stable Stiffness Reflection in Telesurgery
Authors: Bert Willaert, Emmanuel Vander Poorten, Dominiek Reynaerts, Hendrik Brussel
Venue: Proceedings of the 6th international conference on Haptics: Perception, Devices and Scenarios (2008)

At present, surgical master-slave systems lack any kind of force feedback. Typically, controllers giving good stiffness transparency for soft environments cannot guarantee stability during hard contact. This paper presents a pragmatic method to avoid instability of a master-slave system during hard contacts, which does not affect the stiffness reflection for soft environments. The time derivative of the interaction force with the environment is used to detect a hard contact. Upon detection of a hard contact the force feedback is switched off and a virtual wall is activated at the master side in order to guarantee the perception of hard contact by the operator. The experiments demonstrate good stiffness transparency for soft environments, while the system remains stable for both soft and hard environments.
Sensor Modeling Using Visual Object Relation in Multi Robot Object Tracking
Authors: Daniel Göhring, Jan Hoffmann
Venue: RoboCup 2006: Robot Soccer World Cup X (2006)

In this paper we present a novel approach to estimating the position of objects tracked by a team of mobile robots. Modeling of moving objects is commonly done in a robo-centric coordinate frame because this information is sufficient for most low level robot control and it is independent of the quality of the current robot localization. For multiple robots to cooperate and share information, though, they need to agree on a global, allocentric frame of reference. When transforming the egocentric object model into a global one, it inherits the localization error of the robot in addition to the error associated with the egocentric model.We propose using the relation of objects detected in camera images to other objects in the same camera image as a basis for estimating the position of the object in a global coordinate system. The spacial relation of objects with respect to stationary objects (e.g., landmarks) offers several advantages: a) Errors in feature detection are correlated and not assumed independent. Furthermore, the error of relative positions of objects within a single camera frame is comparably small. b) The information is independent of robot localization and odometry. c) As a consequence of the above, it provides a highly efficient method for communicating information about a tracked object and communication can be asynchronous.We present experimental evidence that shows how two robots are able to infer the position of an object within a global frame of reference, even though they are not localized themselves.
Dynamic Process Management Based upon Existing Systems
Authors: M. Heller, M. Nagl, R. Wörzberger, T. Heer
Venue: Collaborative and Distributed Chemical Engineering. From Understanding to Substantial Design Process Support: Results of the IMPROVE Project (2008)

In the past funding periods of the CRC 476 the process management system AHEAD has been developed as a research prototype (cf. 3.4). The project T6 aims at transferring the corresponding research results into two different industrial environments. Together with innotec GmbH, we realize a process management system on top of the chemical engineering tool Comos PT. This system will allow for the holistic management of the overall administration configuration (activities, products and resources). Furthermore, we extend our application experience by also considering dynamic business processes. In cooperation with AMB-Informatik, we build a workflow management system that allows dynamic changes of workflows at runtime. This new workflow management system is also built on top of an existing one, which strictly separates build-time from runtime.
A System to Segment Text and Symbols from Color Maps
Authors: Partha Pratim Roy, Eduard Vazquez, Josep Lladós, Ramon Baldrich, Umapada Pal
Venue: Graphics Recognition. Recent Advances and New Opportunities: 7th International Workshop, GREC 2007, Curitiba, Brazil, September 20-21, 2007. Selected Papers (2008)

Automatic separation of text and symbols from graphics in document image is one of the fundamental aims in graphics recognition. In maps, separation of text and symbols from graphics involves many challenges because the text and symbols frequently touch/overlap with graphical components. Sometimes the colors in a single character are gradually distributed which adds extra difficulty in text and symbol separation from color maps. In this paper we proposed a system to retrieve text and symbol from color map. Here, at first, we separate the map into different foreground layers according to color features and then in each layer, connected component features and skeleton information are used to identify text and symbol from graphics on the basis of their geometrical features. Lastly, segmentation results of the individual layers are combined to get final segmentation results. From the experiment we obtained encouraging results.
Progress Toward a Quantitative Scale for Describing Radiodensity in Mammographic Images
Authors: Christopher Tromans, Sir Michael Brady, Dominique Sompel, Michele Lorenzon, Massimo Bazzocchi, Chiara Zuiani
Venue: Proceedings of the 9th international workshop on Digital Mammography (2008)

A technique is presented for computing a normalised image in which each pixel directly describes the radiodensity of the underlying anatomy. Precisely, each pixel quantifies the equivalent thickness of reference material per unit traversal distance required to match the radiodensity of the breast tissues present within the traversal between the focal spot and the image receptor pixel. Measurements are computed using a model of image formation, which includes consideration of both the attenuation and scattering phenomena that occur. In view of the complexity of the underlying model, substantial computational optimisation has been made to yield clinically realistic execution times. Validation experiments are described using a purpose designed and manufactured tissue equivalent test object which allows both the assessment of the performance of the image normalisation, and a comparison with "ground truth".
Learning Languages from Bounded Resources: The Case of the DFA and the Balls of Strings
Authors: Colin Higuera, Jean-Christophe Janodet, Frédéric Tantini
Venue: Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications (2008)

Comparison of standard language learning paradigms (identification in the limit, query learning, Pac learning) has always been a complex question. Moreover, when to the question of converging to a target one adds computational constraints, the picture becomes even less clear: how much do queries or negative examples help? Can we find good algorithms that change their minds very little or that make very few errors? In order to approach these problems we concentrate here on two classes of languages, the topological balls of strings (for the edit distance) and the deterministic finite automata ( ), and (re-)visit the different learning paradigms to sustain our claims.
A decision framework for supplier rating and purchase allocation: A case in the semiconductor industry
Authors: Jing-Rung Yu, Chao-Chia Tsai
Venue: Computers and Industrial Engineering (2008)

By using a case study of the semiconductor industry, this paper proposes a framework which integrates the analytic hierarchy process (AHP) and integer programming to rate suppliers' performance regarding incoming raw materials in the context of supplier management and then to allocate periodical purchases. Our findings are such that the rating weights of primary criteria and sub-criteria for each supplier should be flexibly considered in peak and off seasons to meet actual requirements. However, the current practical method rates the suppliers subjectively using fixed weights regardless of peak or off seasons. Therefore, how to develop an objective and flexible method for reviewing each criterion is grounded in empirical work. A detailed case study is presented in which five wafer suppliers are evaluated. The outcomes of peak and off seasons by the AHP reflect the practical strategy and tradeoffs of decision makers while rating suppliers via five perspectives of quality: cost, delivery, service, and environment (QCDSE). Additionally, the average cost per wafer is shown to be reduced by $0.455, which increases the gross margin, most notably, in the off season. Results indicate that the proposed methodology can lead to substantial improvements in supplier management.
Breast Skin-Line Segmentation Using Contour Growing
Authors: Robert Martí, Arnau Oliver, David Raba, Jordi Freixenet
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II (2007)

This paper presents a novel methodology to obtain the breast skin line in mammographic images. The breast edge provides important information of the breast shape and deformation which is posteriorly used by other processing techniques, typically mammographic image registration and abnormality detection. The proposed methodology is based on applying edge detection algorithms and scale space concepts. The proposed method is a particular implementation (application focused) of a growing active contour with common considerations. Quantitative and qualitative evaluation is provided to show the validity of the approach.
A Formal Metamodel for Problem Frames
Authors: Denis Hatebur, Maritta Heisel, Holger Schmidt
Venue: Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems (2008)

Problem frames are patterns for analyzing, structuring, and characterizing software development problems. This paper presents a formal metamodel for problem frames expressed in UML class diagrams and using the formal specification notation OCL. That metamodel clarifies the nature of the different syntactical elements of problem frames, as well as the relations between them. It provides a framework for syntactical analysis and semantic validation of newly defined problem frames, and it prepares the ground for tool support for the problem frame approach.
Analogy-Based Learning How to Construct an Object Model
Authors: Jemin Bae
Venue: Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks (2007)

Code reuse in software reuse has several limitations such as difficulties of understanding and retrieval of the reuse code written by other developers. To overcome these problems, it should be possible to reuse the analysis/design information than source code itself. In this paper, I present analogical matching techniques for the reuse of object models and design patterns. We have suggested the design patterns as reusable components and the representation techniques to store them. The contents of the paper are as follows. 1) Analogical matching functions to retrieve analogous design patterns from reusable libraries. 2) The representation of reusable components to be stored in the library in order to support the analogical matching. 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
Verification of Mathematical Formulae Based on a Combination of Context-Free Grammar and Tree Grammar
Authors: Akio Fujiyoshi, Masakazu Suzuki, Seiichi Uchida
Venue: Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics (2008)

This paper proposes the use of a formal grammar for the verification of mathematical formulae for a practical mathematical OCR system. Like a C compiler detecting syntax errors in a source file, we want to have a verification mechanism to find errors in the output of mathematical OCR. Linear monadic context-free tree grammar (LM-CFTG) was employed as a formal framework to define "well-formed" mathematical formulae. For the purpose of practical evaluation, a verification system for mathematical OCR was developed, and the effectiveness of the system was demonstrated by using the ground-truthed mathematical document database INFTY CDB-1.
Learning Kruskal's Algorithm, Prim's Algorithm and Dijkstra's Algorithm by Board Game
Authors: Wen-Chih Chang, Yan-Da Chiu, Mao-Fan Li
Venue: Proceedings of the 7th international conference on Advances in Web Based Learning (2008)

This paper describes the reasons about why it is beneficial to combine with graph theory and board game. Forbye, it also descants three graph theories: Dijkstra's, Prim's, and Kruskal's minimum spanning tree. Then it would describe the information about the board game we choose and how to combine the game with before-mentioned three graph theories. At last, we would account for the advantage of combining with these three graph theories and the game specifically.
Denoising Natural Images Using Sparse Coding Algorithm Based on the Kurtosis Measurement
Authors: Li Shang, Fengwen Cao, Jie Chen
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks, Part II (2008)

A new natural image denoising method using a modified sparse coding (SC) algorithm proposed by us was discussed in this paper. This SC algorithm exploited the maximum Kurtosis as the maximizing sparse measure criterion at one time, a fixed variance term of sparse coefficients is used to yield a fixed information capacity. On the other hand, in order to improve the convergence speed, we use a determinative basis function as the initialization feature basis function of our sparse coding algorithm instead of using a random initialization matrix. This denoising method is evaluated by values of the normalized mean squared error (NMSE) and signal to noise ratio (NSNR). Compared with other denoising methods, the simulation results show that our SC shrinkage technique is indeed effective.
Device-Aware Cache Replacement Algorithm for Heterogeneous Mobile Storage Devices
Authors: Young-Jin Kim, Jihong Kim
Venue: Proceedings of the 3rd international conference on Embedded Software and Systems (2007)

Hard disks, most prevalent mass-storage devices, have high power consumption and high response time for random I/O requests. Recent remarkable technology improvement of flash memory has made it a rising secondary storage device but flash memory still has high cost per bit. Usage of heterogeneous storage devices such as a pair of a hard disk and a flash memory can provide reasonable cost, relatively acceptable response time, and low-power consumption. In this paper, we propose a novel buffer cache replacement algorithm which targets a mobile computing system with a heterogeneous storage pair of a hard disk and a flash memory. The algorithm partitions the cache per each device and adjusts the size of each partition based on the performance indices of the devices, and manages each partition according to workload patterns. Simulations show that the proposed algorithm yields a hit rate up to two times higher than LRU on the typical mobile traces according to the cache size and achieves also better system I/O response time and energy consumption.
From IVAs to Comics Generating Comic Strips from Emergent Stories with Autonomous Characters
Authors: Tiago Alves, Ana Simões, Marco Vala, Ana Paiva, Adrian Mcmichael, Ruth Aylett
Venue: Proceedings of the 7th international conference on Intelligent Virtual Agents (2007)

Emergent narrative systems create stories which are always different from each other. Creating summaries of these stories is a challenge especially if we want to capture the richness of the characters. Our goal is to automatically generate summaries from emergent narrative using comics as the visual medium for the summary. We identify the most important situations in the story log looking at the emotional state of the characters, transform the resulting summary into a comics description and create the comic. We believe that a good summarization of a story that maintains the emotions of the characters together with an expressive visual representation is essential for the user to remember the story.
Semantic Information and Local Constraints for Parametric Parts in Interactive Virtual Construction
Authors: Peter Biermann, Christian Fröhlich, Marc Latoschik, Ipke Wachsmuth
Venue: Proceedings of the 8th international symposium on Smart Graphics (2007)

This paper introduces a semantic representation for virtual proto typing in interactive virtual construction applications. The representation reflects semantic information about dynamic constraints to define objects' modification and construction behavior as well as knowledge structures supporting multimodal interaction utilizing speech and gesture. It is conveniently defined using XML-based markup for virtual building parts. The semantic information is processed during runtime in two ways: Constraint graphs are mapped to a generalized data-flow network and scene-graph. Interaction knowledge is accessed and matched during multimodal analysis.
SmartPro: A Smart Card Based Digital Content Protection for Professional Workflow
Authors: Alain Durand, Marc Éluard, Sylvain Lelievre, Christophe Vincent
Venue: Proceedings of the 8th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Applications (2008)

This paper introduces SmartPro, a smart card based technology aiming at protecting content in professional workflows. It gives an overview on how SmartPro works. It also explains the design constrains that led to the use of smart cards and some of the extra difficulties implied by this choice in order to get to an implementation that may be industrially deployed.
A heterogeneous computing platform for biological sequence database searches
Authors: Vipin Chaudhary
Venue:  (2007)

Due to the high cost of dedicated parallel computing and supercomputing machines, the High Performance Computing (HPC) for today&rsquo;s enterprise computing infrastructure has emerged as a heterogeneous computing architecture that allows us to integrate the new commercial-off-the-shelf components or innovative implementation through the extension of services. To enable low cost HPC, we have developed a hybrid-computing platform, Wayne Bio-Accelerator (WaBA), for high-throughput biological sequence analysis utilizing the existing enterprise computing infrastructure as well as various general-purpose computer architectures via the network. WaBA is a heterogeneous computing platform that integrates heterogeneous computer architectures including legacy processors, conventional processors with SSE2 instructions, and reconfigurable coprocessors together into one system, and allows each to perform the task to which it is best suited. Accurate biological sequence database search algorithms like the Smith-Waterman algorithm are the most sensitive, but their high computational complexity limits their use. WaBA effectively accelerates the most sensitive and time-consuming Smith-Waterman biological sequence database search core with dynamic load balancing, data pre-fetching, database and query segmentations, and a series of optimizations. The WaBA scheduling strategy automatically distributes the workload across multiple heterogeneous processors based on their processing capabilities. An efficient adaptive data pre-fetching scheme was designed for slow IO interfaces like PCI-based reconfigurable computing systems to overlap the communication and computation time. The implementation effectively eliminated a major portion of data access penalty and improved the performance by up to 42%. We also developed a list of WaBA API functions which hide the complexity of hardware programming and data format conversion for seamlessly connecting the WaBA accelerator to the existing biological sequence search tools. Furthermore, the parallel SSE2 implementation obtained a speedup of 143 on a cluster of 16 dual CPU Intel processors as compared to the sequential version that was widely used at the time. Additionally the WaBA The WaBA heterogeneous computing system demonstrated a speedup of 110 by utilizing only one reconfigurable coprocessor and 8 dual core AMD processors. Clearly, the integrated heterogeneous computing architecture can support the data and compute intensive life science applications at low cost.
A Performance Evaluation of Single and Multi-feature People Detection
Authors: Christian Wojek, Bernt Schiele
Venue: Proceedings of the 30th DAGM symposium on Pattern Recognition (2008)

Over the years a number of powerful people detectors have been proposed. While it is standard to test complete detectors on publicly available datasets, it is often unclear how the different components (e.g. features and classifiers) of the respective detectors compare. Therefore, this paper contributes a systematic comparison of the most prominent and successful people detectors. Based on this evaluation we also propose a new detector that outperforms the state-of-art on the INRIA person dataset by combining multiple features.
Flow Visualization and Local Mass Transfer Studies for Turbulent Flow in a Wind Tunnel with Chamfered Ribs
Authors: Rajendra Karwa, B. K. Maheshwari, Nitin Karwa
Venue: Journal of Visualization (2008)

The paper presents results of flow visualization and mass transfer studies for fully developed turbulent flow of air in a square section wind tunnel with repeated chamfered rib roughness on the bottom of the tunnel (rib head chamfer angles &phis; of &minus;15&deg;, 0&deg;, and 15&deg;; relative roughness pitch p/ e = 3, 5, 7.5, and 10). Direct video recordings of flow patterns were made using a simple technique of particles visualization. For the positively chamfered closely spaced ribs (p/ e &les; 5) vigorous vortex shedding has been seen compared to the square or negatively chamfered ribs, which is found to be a function of the Reynolds number. For the widely spaced ribs, the study shows flow separation at the ribs and reattachment in the inter-rib region. Local mass transfer studies, based on the variation in colour of cobaltous chloride solution impregnated paper due to evaporation of water, showed a significant improvement in mass transfer rate in the recirculating region in the wake of ribs with the change in the chamfer angle from &minus;15&deg; to 15&deg;. The positively chamfered 15&deg; ribs are found to be better than square section ribs at p/ e &les; 7.5. The performance of negatively chamfered ribs is found to be poor compared to other ribs irrespective of the relative roughness pitch.