ppxscal/embedding_network huggingface dataset:
Word Image Decomposition from Mixed Text/Graphics Images Using Statistical Methods
Authors: Chang-Bu Jeong, Soo-Hyung Kim
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

This paper describes the development and implementation of a algorithm to extract words from image regions mixed text/graphics in document images using statistical analyses, which is a component of DIPS(Document Images Processing System) using statistical methods. To extract word images from image regions, the character components need to be separated from graphic components. For this process, we propose a method to separate them with an analysis of box-plot using a statistics of structural components. An accuracy of this method is not sensitive to the changes of images because the criterion of separation is defined by the statistics of components. And then the character regions are determined by analyzing a local crowdedness of the separated character elements. Finally, we divide the character regions into text lines and word images using projection profile analysis and gap clustering, etc. The proposed system could reduce the influence resulted from the changes of images because it uses the criterion based on the statistics of image regions.
Optimal Design of the Real-Time Production Control System for a General Single-Product Assembly Line Based on Fuzzy Logic Control, Genetic Algorithm and Simulation
Authors: Ju-Hua Mo, Min Huang, Xing-Wei Wang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

In this paper an optimal design approach is proposed for the real-time production control of a general assembly line using fuzzy logic control (FLC) mechanism and genetic algorithm (GA) based on simulation. The optimal control system combines push and FLC policies together. We consider single part type production line with infinite buffers and reliable machines whose process time are determinate. The objective is to minimize the average inventory cost while satisfying uncertain demand. In order to investigate the feasibility and effectiveness of the design approach proposed, an illustrative example is discussed and the optimal system is compared to the original one. The results show that the optimal design methodology is completely feasible and the optimal system holds superior performance.
Identity federation for voip-based services
Authors: Samir Saklikar, Subir Saha
Venue: Proceedings of the 2007 ACM workshop on Digital identity management (2007)

Identity Federation enables managing a single User's multiple Identities across administrative domains. Instead of forcing a single Identity for the User, it leverages trust between Service Providers to share User Identity information viz. Authentication, Authorization and Attributedetails. Users can federate their multiple Identities at different domains, for combined cross-domain benefits such as Single Sign On(SSO) on the Internet. In this paper, we analyze and present how the power of Identity Federation can be used within VoIP, to offer a more flexible and capable service environment to the User. Also, Identity Federationcan save VoIP, from any impending challenges of "Identity multiplicity" arising from the presence of numerous Service Providers. We select the Session Initiation Protocol (SIP) and argue that in order to achieve its true potential of a pervasive VoIP platform, SIP needs a way for supporting "mobility across multiple User Identities". The paperanalyzes differences in introducing Identity Federation for VoIP, as compared to HTTP-based services and identifies additional benefits that are possible for VoIP entities. An important aspect is that of user control over Identity Federation enablement and usage, keeping in line with the SIP design philosophy. We propose a user-controlled Identity Federation sub-layer within SIP, so that federation benefitscan be leveraged to all kinds of multimedia applications. We also present a set of exemplary yet novel use-cases enabled by the framework.
Hierarchical Tensor Approximation of Multi-Dimensional Visual Data
Authors: Qing Wu, Tian Xia, Chun Chen, Hsueh-Yi Sean Lin, Hongcheng Wang, Yizhou Yu
Venue: IEEE Transactions on Visualization and Computer Graphics (2008)

Visual data comprise of multi-scale and inhomogeneous signals. In this paper, we exploit these characteristics and develop a compact data representation technique based on a hierarchical tensor-based transformation. In this technique, an original multi-dimensional dataset is transformed into a hierarchy of signals to expose its multi-scale structures. The signal at each level of the hierarchy is further divided into a number of smaller tensors to expose its spatially inhomogeneous structures. These smaller tensors are further transformed and pruned using a tensor approximation technique. Our hierarchical tensor approximation supports progressive transmission and partial decompression. Experimental results indicate that our technique can achieve higher compression ratios and quality than previous methods, including wavelet transforms, wavelet packet transforms, and single-level tensor approximation. We have successfully applied our technique to multiple tasks involving multi-dimensional visual data, including medical and scientific data visualization, data-driven rendering and texture synthesis.
A Torres condition for twisted Alexander polynomials
Authors: Takayuki Morifuji
Venue: Publications of the Research Institute for Mathematical Sciences (2007)

As a generalization of a fundamental result about the Alexander polynomial of links, we give a description of a Torres condition for the twisted Alexander polynomial of links associated to a unimodular representation.
An Efficient BIST Scheme for Non-Restoring Array Dividers
Authors: H. T. Vergos
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

A new effective built-in self-test (BIST) scheme for nonrestoring array dividers (NADs) is proposed, that offers more than 99% cell fault coverage in all NADs of practical use. Moreover, it can be implemented in small hardware and can apply all its test vectors within 128 clock cycles. A version of the proposed scheme for power critical applications is also exploited.
AdaptiviTree: Adaptive Tree Visualization for Tournament-Style Brackets
Authors: Desney Tan, Greg Smith, Bongshin Lee, George Robertson
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

Online pick'em games, such as the recent NCAA college basketball March Madness tournament, form a large and rapidly growing industry. In these games, players make predictions on a tournament bracket that defines which competitors play each other and how they proceed toward a single champion. Throughout the course of the tournament, players monitor the brackets to track progress and to compare predictions made by multiple players. This is often a complex sensemaking task. The classic bracket visualization was designed for use on paper and utilizes an incrementally additive system in which the winner of each match-up is rewritten in the next round as the tournament progresses. Unfortunately, this representation requires a significant amount of space and makes it relatively difficult to get a quick overview of the tournament state since competitors take arbitrary paths through the static bracket. In this paper, we present AdaptiviTree, a novel visualization that adaptively deforms the representation of the tree and uses its shape to convey outcome information. AdaptiviTree not only provides a more compact and understandable representation, but also allows overlays that display predictions as well as other statistics. We describe results from a lab study we conducted to explore the efficacy of AdaptiviTree, as well as from a deployment of the system in a recent real-world sports tournament.
On the File Design Problem for Partial Match Retrieval
Authors: Hung-Chang Du
Venue: IEEE Transactions on Software Engineering (1985)

In the past two decades, the increasing usage of databases and integrated information systems has encouraged the development of file structures suited for partial match retrieval. A partial match query is a query with some number of attributes specified and the rest of them unspecified. One interesting file structure proposed and heavily studied recently is called a multikey hashing scheme, but most of the previous results on designing optimal multikey hashing schemes ignored the record distribution of a file. In this paper we show that the problem of designing an optimal multikey hashing scheme taking into consideration the record distribution is computationally intractable (NP-hard). Therefore, a heuristic approach is necessary. In a multikey hashing scheme, although the directory is space efficient and the search algorithm is fast, due to the insufficient information in the directory some accessed buckets may not contain any record satisfying the given query. Thus, certain retrieval effort is wasted. A new class of file structures which combine a multikey hashing scheme and an indexed descriptor technique is introduced in this paper. By adding some extra information (either record descriptors or bucket descriptors) into the directory of a multikey hashing scheme, either only those buckets which contain at least one record satisfying the given query need to be accessed or the number of accessed buckets which do not contain any record satisfying the query is reduced.
Efficiency-quality tradeoffs for vector score aggregation
Authors: Pavan Kumar C. Singitham, Mahathi S. Mahabhashyam, Prabhakar Raghavan
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Finding the l nearest neighbors to a query in a vector space is an important primitive in text and image retrieval. Here we study an extension of this problem with applications to XML and image retrieval: we have multiple vector spaces, and the query places a weight on each space. Match scores from the spaces are weighted by these weights to determine the overall match between each record and the query; this is a case of score aggregation. We study approximation algorithms that use a small fraction of the computation of exhaustive search through all records, while returning nearly the best matches. We focus on the tradeoff between the computation and the quality of the results. We develop two approaches to retrieval from such multiple vector spaces. The first is inspired by resource allocation. The second, inspired by computational geometry, combines the multiple vector spaces together with all possible query weights into a single larger space. While mathematically elegant, this abstraction is intractable for implementation. We therefore devise an approximation of this combined space. Experiments show that all our approaches (to varying extents) enable retrieval quality comparable to exhaustive search, while avoiding its heavy computational cost.
VR-based Simulation on Material Handling Remote Operation for Engineering Machine
Authors: Guofu Ding, Jian Zhang, Yong He, Yisheng Zou, Boxing Liu
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

VR-based technology is a feasible idea for remote distance operation. Aiming the present material handling machine status, which is widely used in mine, port, train station, etc al, in this paper, the scheme of VR-based Material Handling Remote Operating for Engineering Machine(VMHROEM) is presented. The frame of this system is build, and simulating theory is studied in details, which mainly includes object-oriented modeling, modeling of virtual environment, modeling of human-computer interaction. In order to testify the theory, an experimental system considering the operator, computer, working machine, worked object, is given, which is integrated into closed loop by using mapping of human-computer and communication system. Here the interacting equipment consists of Dataglove, Spaceball, Shutter Glasses, and virtual environment is modeled by using Worldtoolkit. While the real scene includes experimental fork that is the same scale as virtual working machine, barriers, worked object and other assisting facilities. The simulating results show that the operator can efficiently complete a remote distance operating task in the condition that he can be far away from the real scene.
Controlled experimentation on adaptations of pair programming
Authors: Madeline Ann Domino, Rosann Webb Collins, Alan R. Hevner
Venue: Information Technology and Management (2007)

The use of agile methods is growing in industrial practice due to the documented benefits of increased software quality, shared programmer expertise, and user satisfaction. These methods include pair programming (two programmers working side-by-side producing the code) and test-driven approaches (test cases written first to prepare for coding). In practice, software development organizations adapt agile methods to their environment. The purpose of this research is to understand better the impacts of adapting these methods. We perform a set of controlled experiments to investigate how adaptations, or variations, to the pair programming method impact programming performance and user satisfaction. We find that method variations do influence programming results. In particular, better performance and satisfaction outcomes are achieved when the pair programming is performed in face-to-face versus virtual settings, in combination with the test-driven approach, and with more experienced programmers. We also find that limiting the extent of collaboration can be effective, especially when programmers are more experienced. These experimental results provide a rigorous foundation for deciding how to adapt pair programming methods into specific project contexts.
Brief paper: Squaring the circle: An algorithm for generating polyhedral invariant sets from ellipsoidal ones
Authors: A. Alessio, M. Lazar, A. Bemporad, W. P. M. H. Heemels
Venue: Automatica (Journal of IFAC) (2007)

This paper presents a new (geometrical) approach to the computation of polyhedral (robustly) positively invariant (PI) sets for general (possibly discontinuous) nonlinear discrete-time systems possibly affected by disturbances. Given a @b-contractive ellipsoidal set E, the key idea is to construct a polyhedral set that lies between the ellipsoidal sets @bE and E. A proof that the resulting polyhedral set is contractive and thus, PI, is given, and a new algorithm is developed to construct the desired polyhedral set. The problem of computing polyhedral invariant sets is formulated as a number of quadratic programming (QP) problems. The number of QP problems is guaranteed to be finite and therefore, the algorithm has finite termination. An important application of the proposed algorithm is the computation of polyhedral terminal constraint sets for model predictive control based on quadratic costs.
Using patterns paradigm to refine workflow policies
Authors: Taufiq Rochaeli, Claudia Eckert
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

We propose an approach to formalize the patterns and to automatically apply the formalized patterns. In our case, we use the pattern paradigm to refine security policies of a workflow. A policy refinement process derives lowlevel workflow policies from high-level and abstract policies specified by stakeholders. Such refinement process requires domain-specific expertise knowledge, which will be captured by using the pattern paradigm. These refinement patterns are formalized by using both description logic and temporal logic formalisms.
Three-Dimensional Computer Animation: More an Evolution Than a Motion Problem
Authors: Nadia Magnenat-Thalmann, Daniel Thalmann
Venue: IEEE Computer Graphics and Applications (1985)

Why are innovations in animation so rare? Part of the answer is that animators have failed to explore the many effects generated by the simple laws of evolution.
On the hardness of inferring phylogenies from triplet-dissimilarities
Authors: Ilan Gronau, Shlomo Moran
Venue: Theoretical Computer Science (2007)

This work considers the problem of reconstructing a phylogenetic tree from triplet-dissimilarities, which are dissimilarities defined over taxon-triplets. Triplet-dissimilarities are possibly the simplest generalization of pairwise dissimilarities, and were used for phylogenetic reconstructions in the past few years. We study the hardness of finding a tree best fitting a given triplet-dissimilarity table under the @?"~ norm. We show that the corresponding decision problem is NP-hard and that the corresponding optimization problem cannot be approximated in polynomial time within a constant multiplicative factor smaller than 1.4. On the positive side, we present a polynomial time constant-rate approximation algorithm for this problem. We also address the issue of best-fit under maximal distortion, which corresponds to the largest ratio between matching entries in two triplet-dissimilarity tables. We show that it is NP-hard to approximate the corresponding optimization problem within any constant multiplicative factor.
Pisces: An Environment for Parallel Scientific Computation
Authors: T. W. Pratt
Venue: IEEE Software (1985)

The Pisces 1 virtual machine retains sequential programming characteristics, yet allows for experimentation with the parallel languages that will drive the supercomputers of the 1990s.
Characterization of network processing overheads in Xen
Authors: Padma Apparao, Srihari Makineni, Don Newell
Venue: Proceedings of the 2nd International Workshop on Virtualization Technology in Distributed Computing (2006)

I/O virtualization techniques developed recently have led to significant changes in network processing. These techniques require network packets go through additional layers of processing. These additional layers have introduced significant overheads. So it is important to understand performance implications of this additional processing on network processing (TCP/IP). Our goals in this paper are to measure network I/O performance in a Xen virtualized environment and to provide a detailed architectural characterization of network processing highlighting major sources of overheads and their impact. In this paper, we study two modes of I/O virtualizations: 1) running I/O service VM along with the guest on the same CPU, and 2) running I/O service VM on a separate CPU. We measure TCP/IP processing performance in these two modes and compare it to that of on the native Linux machine. Our measurements show that both Rx and Tx performance suffer by more than 50% in virtualized environment. We have noticed that pathlength has increased by 3 to 4 times than that of the native processing. Most of this overhead comes from the Xen VMM layer and Dom0 VM processing. Our data also shows that running the Dom0 VM on a separate CPU is more expensive than running both Dom0 and guest VM on the same CPU. We provide a detailed characterization of this additional processing which we hope will help the Xen community focus on right areas for optimization.
Computing sparse Hessians with automatic differentiation
Authors: Andrea Walther
Venue: ACM Transactions on Mathematical Software (TOMS) (2008)

A new approach for computing a sparsity pattern for a Hessian is presented: nonlinearity information is propagated through the function evaluation yielding the nonzero structure. A complexity analysis of the proposed algorithm is given. Once the sparsity pattern is available, coloring algorithms can be applied to compute a seed matrix. To evaluate the product of the Hessian and the seed matrix, a vector version for evaluating second order adjoints is analysed. New drivers of ADOL-C are provided implementing the presented algorithms. Runtime analyses are given for some problems of the CUTE collection.
Deep reactive ion etching (Deep-RIE) process for fabrication of ordered structural metal oxide thin films by the liquid phase infiltration method
Authors: Minoru Mizuhata, Takuya Miyake, Yuki Nomoto, Shigehito Deki
Venue: Microelectronic Engineering (2008)

Deep reactive ion etching (Deep-RIE) process was established for fabrication of highly nano-ordered metal oxide thin films such as TiO"2, ZrO"2, SnO"2 etc, by the liquid phase infiltration (LPI) method. Electron beam lithography (EBL) technique and Deep-RIE were adapted to fabricate the Si wafer coated with a positive resist ZEP520A. Etching gas of SF"6 and C"4F"8 was used for Deep-RIE process. The flow rate and repeating time were optimized in order to obtain the straight shape on the sidewalls of the trench or pillar structure. We used polymethylmethacrylate (PMMA) and acetylcellulose as a replica films. The transcribed replica films are applied to the liquid phase deposition reaction. The film structure was completely reproduced from the original shape of the designed Si wafer. The optical interference on the fabricated metal oxide thin films was also observed using absolute reflective visible spectroscopy.
Pool-based active learning with optimal sampling distribution and its information geometrical interpretation
Authors: Takafumi Kanamori
Venue: Neurocomputing (2007)

We propose a pool-based active learning algorithm with approximately optimal sampling distributions. An intuitive understanding of the effectiveness of active learning is also illustrated from the viewpoint of the information geometry. In active learning, one can choose informative input points or input distributions. Appropriate choice of data points is expected in order to make prediction performance more accurate than random data selection. Conventional active learning methods, however, yield serious estimation bias, when parametric statistical models do not include the true probability distribution. To correct the bias, we apply the maximum weighted log-likelihood estimator with approximately optimal input distribution. Optimal input distribution for active learning can be obtained by simple regression estimation. Numerical studies show the effectiveness of the proposed learning algorithm.
Office Information Systems
Authors: F. Maryanski
Venue: Computer (1981)

In recent years, computer scientists have recognized the office as a natural environment for the application of computing technology. At the same time, there has been a growing awareness of the need for automated tools to increase the productivity of white-collar workers. In an ideal office environment, machines would assume all the repetitive, mechanical tasks, thus freeing people to concentrate on problems that require creative thinking. The key to providing these office tools is the representation and utilization of information about the business of the office. This special issue of Computer focuses on recent office information systems research that is directed at improving the environment and productivity of office workers.
Field flatness and symmetry of photon beams: Review of the current recommendations
Authors: V. E. Kouloulias, P. Poortmans, C. Antypas, C. Kappas, P. Sandilos
Venue: Technology and Health Care (2003)

Flatness and symmetry are main parameters determining the quality of a photon beam produced by linear accelerators. The quality assurance in routine clinical practice of radiotherapy and consequently the treatment-outcome depend definitely on the physical parameters of treatment-delivery. Several recommendations from national and international associations are reported. By reviewing the current literature and mainly according to the World Health Organization (WHO) report of quality assurance in radiotherapy, we may suggest that for flatness and symmetry, the optimal level of deviation should be within &plusmn; 3%. Flatness and symmetry should be checked monthly or once a year in accordance to the guidelines of national societies.