ppxscal/embedding_network huggingface dataset:
Table Image Segmentation
Authors: Konstantin Zuyev
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

Algorithm for table image segmentation, a part of complete document recognition system is presented. The proposed approach introduces a concept of table grid which can serve for advanced methods of table structure analysis. It provides a layer of terminal symbols for the table, which is used by syntactical methods. Detailed discussion of grid detection is presented which is performed through the analysis of connected components projection profile. Simple rules for analysis of table structure cover majority of real life tables. The system is implemented, tested, and is now extensively used in FineReader OCR product.Keywords. Table image segmentation, table grid, connected components, projection profile
Representing patient preference-related concepts for inclusion in electronic health records
Authors: Cornelia M. Ruland, Suzanne Bakken
Venue: Computers and Biomedical Research (2001)

In recent years shared decision making between patients and their health care providers and the inclusion of patient preferences in patient care have been, in theory, embraced as models for good clinical practice. Patients' experiences, values, and preferences are increasingly acknowledged as important pieces of evidence for appropriate health care decision making. To effectively use information about patient preferences in patient care, this information, which is gathered through a process of preference elicitation, needs to be integrated with other types of information, e.g., diagnoses, treatments, and patient status indicators within the context of a longitudinal electronic health record. This integration requires that patient preference-related concepts be represented nonambiguously and in a manner that renders them suitable for computer rather than human processing. In this article, the authors describe important patient preference-related concepts and illustrate the use of the LOINC semantic structure as a terminology model to create fully specified names for a sample of 15 preference elicitations from 8 published research articles.
XML queries and algebra in the Enosys integration platform
Authors: Yannis Papakonstantinou, Vinayak Borkar, Maxim Orgiyan, Kostas Stathatos, Lucian Suta, Vasilis Vassalos, Pavel Velikhov
Venue: Data Knowledge Engineering (2003)

We describe the Enosys XML integration platform, focusing on the query language, algebra, and architecture of its query processor. The platform enables the development of eBusiness applications in customer relationship management, e-commerce, supply chain management, and decision support. These applications often require that data be integrated dynamically from multiple information sources. The Enosys platform allows one to build (virtual and/or materialized) integrated XML views of multiple sources, using XML queries as view definitions. During run-time, the application issues XML queries against the views. Queries and views are translated into the XCQL algebra and are combined into a single algebra expression/plan. Query plan composition and query plan decomposition challenges are faced in this process. Finally, the query processor lazily evaluates the result, using an appropriate adaptation of relational database iterator models to XML. The paper describes the platform architecture and components, the supported XML query language and the query processor architecture. It focuses on the underlying XML query algebra, which differs from the algebras that have been considered by W3C in that it is particularly tuned to semistructured data and to optimization and efficient evaluation in a system that follows the conventional architecture of database systems.
Graph connectivity and its augmentation: applications of MA orderings
Authors: Hiroshi Nagamochi, Toshihide Ibaraki
Venue: Discrete Applied Mathematics (2002)

This paper surveys how the maximum adjacency (MA) ordering of the vertices in a graph can be used to solve various graph problems. We first explain that the minimum cut problem can be solved efficiently by utilizing the MA ordering. The idea is then extended to a fundamental operation of a graph, edge splitting. Based on this, the edge-connectivity augmentation problem for a given k (and also for the entire range of k) can be solved efficiently by making use of the MA ordering, where it is asked to add the smallest number of new edges to a given graph so that its edge-connectivity is increased to k. Other related topics are also surveyed.
Biomimetic oculomotor control
Authors: Tomohiro Shibata, Sethu Vijayakumar, Jörg Conradt, Stefan Schaal
Venue: Adaptive Behavior (2001)

Oculomotor control in a humanoid robot faces similar problems as biological oculomotor systems, that is, capturing targets accurately on a very narrow fovea, dealing with large delays in the control systems, the stabilization of gaze in the face of unknown perturbations of the body, selective attention, and the complexity of stereo vision. In this article, we suggest control circuits to realize three of the most basic oculomotor behaviors and their integration: the vestibulo-ocular reflex and optokinetic response (VOR-OKR) for gaze stabilization, smooth pursuit for tracking moving objects, and saccades for overt visual attention. Each of these behaviors and the mechanism for their integration were derived with inspiration from computational theories as well as behavioral and physiological data in neuroscience. Our implementations on humanoid demonstrate good performance of oculomotor behaviors, which proves to be a viable strategy to explore novel control mechanisms for humanoid robotics. Conversely, insights gained from our models have been able to directly influence views and provide new directions for computational neuroscience research.
A comment on the series solution of the solitary-wave problem
Authors: L. Engevik
Venue: Zeitschrift f&uuml;r Angewandte Mathematik und Physik (ZAMP) (2003)

The formal series solution of the solitary wave problem is an expansion of the surface elevation in powers of the function sech(εx), where ε is a parameter and x the coordinate in the horizontal direction. Previous numerical calculations have indicated that this series is not convergent. In this note it is shown, purely analytically, that it must necessarily be so. Furthermore, a simple method to calculate the coefficients in this series is given; the coefficients are easily obtained by means of the computer algebra system Maple. Also, it is shown that z = x+iy as a function of the complex potential ω has a pole where βω = iπ when β tends to zero. This is a proof of a previous conjecture which was put forward as a result of extensive numerical calculations.
Free space management for cut-based placement
Authors: Charles J. Alpert, Gi-Joon Nam, Paul G. Villarrubia
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

IP blocks and large macro cells are increasingly prevalent in physical design, actually causing an increase in the available free space for the dust logic. We observe that top-down placement based on recursive bisection with multilevel partitioning performs poorly on these porous designs. However, analytic solvers have the ability to find the natural distribution of cells in the layout. Consequently, we propose an enhancement to cut-based placement called Analytic Constraint Generation (ACG). ACG utilizes an analytic engine to set constraints for the multi-level partitioner. We show that for real industry designs, ACG significantly improves the performance of cut-based placement, as implemented within a state-of-the-art industrial placer.
Exploiting data-width locality to increase superscalar execution bandwidth
Authors: Gabriel H. Loh
Venue: Proceedings of the 35th annual ACM/IEEE international symposium on Microarchitecture (2002)

In a 64-bit processor, many of the data values actually used in computations require much narrower data-widths. In this study, we demonstrate that instruction data-widths exhibit very strong temporal locality and describe mechanisms to accurately predict data-widths.To exploit the predictability of data-widths, we propose a Multi-Bit-Width (MBW) microarchitecture which, when the opportunity arises, takes the wires normally used to route the operands and bypass the result of a 64-bit instruction, and instead uses them for multiple narrow-width instructions. This technique increases the effective issue width without adding many additional wires by reusing already existing datapaths.Compared to a traditional four-wide superscalar processor, our best MBW configuration with a peak issue rate of eight IPC achieves a 7.1% speedup on the simulated SPECint2000 benchmarks, which performs very well when compared to a 7.9% speedup attainable by a processor with a perfect data-width predictor.
Realizing high IPC through a scalable memory-latency tolerant multipath microarchitecture
Authors: D. Morano, A. Khalafi, D. R. Kaeli, A. K. Uht
Venue: ACM SIGARCH Computer Architecture News (2003)

A microarchitecture is described that achieves high performance on conventional single-threaded program codes without compiler assistance. To obtain high instructions per clock (IPC) for inherently sequential (e.g., SpecInt-2000 programs), a large number of instructions must be in flight simultaneously. However, several problems are associated with such microarchitectures, including scalability, issues related to control flow, and memory latency.Our design investigates how to utilize a large mesh of processing elements in order to execute a singlethreaded program. We present a basic overview of our microarchitecture and discuss how it addresses scalability as we attempt to execute many instructions in parallel. The microarchitecture makes use of control and value speculative execution, multipath execution, and a high degree of out-of-order execution to help extract instruction level parallelism. Execution-time predication and time-tags for operands are used for maintaining program order. We provide simulation results for several geometries of our microarchitecture illustrating a range of design tradeoffs. Results are also presented that show the small performance impact over a range of memory system latencies.
Rectilinear block placement using B*-trees
Authors: Guang-Ming Wu, Yun-Chih Chang, Yao-Wen Chang
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2003)

Due to the layout complexity in modern VLSI designs, integrated circuit blocks may not be rectangular. However, literature on general rectilinear block placement is still quite limited. In this article, we present approaches for handling the placement for arbitrarily shaped rectilinear blocks using B*-trees [Chang et al. 2000]. We derive the feasibility conditions of B*-trees to guide the placement of rectilinear blocks. Experimental results show that our algorithm achieves optimal or near-optimal block placement for benchmarks with various shaped blocks.
Sensitivity Analysis of Aggregated Variational Inequality Problems, with Application to Traffic Equilibria
Authors: Michael Patriksson, R. Tyrrell Rockafellar
Venue: Transportation Science (2003)

Some instances of variational inequality models over polyhedral sets can be stated in a disaggregated or aggregated formulation related by an affine variable transformation. For such problems, we establish that sensitivity analysis results under parameterizations rely neither on the strict monotonicity properties of the problem in terms of the disaggregated variables, nor on any particular choice of their values at the solution. We show how to utilize the affine transformation to devise computational tools for calculating sensitivity results and apply them to the sensitivity analysis of elastic demand traffic equilibrium problems. The results reached show that sensitivity results do not rely on the choice of any particular route or commodity flow solution. Further, the sensitivity analysis, including the calculation of the gradient of the equilibrium link flow if it exists, can be performed by means of solving linearized traffic equilibrium problems.
An experiment with hardware implementation of edge enhancement filter
Authors: Terry W. Griffin, Nelson L. Passos
Venue: Journal of Computing Sciences in Colleges (2002)

The significance of experimenting with hardware and software applications in an undergraduate program must be emphasized given the job market need for system designers with a broad knowledge on the computer science field. Interesting applications can always be found in the field of computer vision. In such a field, a digital image is usually segmented into regions. This paper presents an algorithm used to perform the operation of segmenting an image into regions, more specifically edges, and an experiment with its hardware implementation. The selected algorithm is known as the Laplace algorithm. The experiment is conducted by implementing the algorithm in hardware, or more specifically a Field Programmable Gate Array (FPGA), and then evaluating the required clock cycle required for execution of the algorithm.
Risk Aversion Or Myopia? Choices in Repeated Gambles and Retirement Investments
Authors: Shlomo Benartzi, Richard H. Thaler
Venue: Management Science (1999)

We study how decision makers choose when faced with multiple plays of a gamble or investment. When evaluating multiple plays of a simple mixed gamble, a chance to win x or lose y, subjects show a sensitivity to the amount to lose on a single trial, holding the distribution of returns for the portfolio constant; that is, they display "myopic loss aversion." Many subjects who decline multiple plays of such a gamble will accept it when shown the resulting distribution. This analysis is applied to the problem of retirement investing. We show that workers invest more of their retirement savings in stocks if they are shown long-term (rather than one-year) rates of return.
A note on the topological modification of the Hutton unit interval
Authors: Fengqiong Wang, Dexue Zhang
Venue: Fuzzy Sets and Systems (2003)

It is proved in this note that for every complete lattice L with an order reversing involution and with an order generating collection of primes, the topological modification lυLI(L) = iL(I(L)) of the Hutton L-fuzzy unit interval is completely regular if and only if L is completely distributive. This result provides a partial answer to a question of Kubiak raised in 1995.
Minnesota's Nutrition Coordinating Center Uses Mathematical Optimization to Estimate Food Nutrient Values
Authors: Brian J. Westrich, Michael A. Altmann, Sandra J. Potthoff
Venue: Interfaces (1998)

We developed, evaluated, and deployed computer software that uses mathematical optimization rather than trial-and-error methods to estimate the nutrient content of commercial food products. Linear programming (LP) and quadratic programming (QP) optimization methods were evaluated by comparing nutrient values estimated for 31 commercial products with known values for these nutrients. The optimization software was able to estimate nutrient values four times faster than conventional methods with the same degree of accuracy, although the QP method was slightly slower than LP. Nutritionists found the software easy to learn and use. The Nutrition Coordinating Center at the University of Minnesota now uses the LP version of the software as a decision support tool to maintain a food composition database.
An Efficient Channel Allocation Technique for Multiple Videos-on-Demand
Authors: Prasan Kumar Sahoo, Jang Ping Sheu
Venue: Multimedia Tools and Applications (2003)

There are several broadcasting protocols for video-on-demand (VOD). Most of these protocols are tailored to handle the distribution of single video for a specific range of request arrival rates. In order to distribute multiple videos, broadcasting protocols like fast broadcasting (FB), new pagoda broadcasting (NPB) and universal distribution (UD) require more channels that are proportional to the number of hot videos to be broadcast. We present here an efficient broadcasting protocol in which, channel numbers can be reduced when multiple videos are broadcast either simultaneously or asynchronously. During the low to moderate request rates, our protocol performs best as similar to other reactive protocols and saves bandwidth and requires lesser number of channels as compared to other proactive or reactive protocols.
A template-based approach to XML parsing in C++
Authors: John Dubchak
Venue: Linux Journal (2003)

Add XML support to your project with the Apache Software Foundation's Xerces parser and some C++ code.
Resource Allocation Capabilities of Commercial Project Management Software Packages
Authors: Maung K. Sein, Radhika Santhanam, Rainer Kolisch
Venue: Interfaces (1999)

This study concerns the quality of seven commercial project management software packages in allocating resources. Since the methods employed in these packages are proprietary, the quality is measured in terms of the deviation from an upper bound of the minimum makespan. As benchmark instances, a set of problems generated under a factorial design is used. Statistical tests are performed to investigate the impact of the problem parameters and to detect significant differences in quality among the packages.
NTT DoCoMo's i-mode: developing win-win relationships for mobile commerce
Authors: David J. MacDonald
Venue: Mobile commerce: technology, theory, and applications (2003)

In February 1999, Japan's NTT DoCoMo launched the i-mode service, becoming, with over 34 million active subscribers, undoubtedly the world's most successful mobile Internet service. While mobile commerce is an often-discussed topic around the world, it is important to look to the success of i-mode in Japan, to gain real insight into the potential for mobile commerce in other markets. i-mode is a success because of a careful balance of the right technology, the right strategy, the right content, and the right marketing. On this successful platform, many players have developed successful business models, be it premium content, e-commerce, advertising, or others. With the expansion of i-mode, it has now become a "lifestyle infrastructure" and a series of alliances with major players such as Coca-cola has expanded the possibilities. With new i-mode services being launched in Europe and Asia, it is timely to learn, based on the experiences of Japan, what the potential could be.
Comprehensive bibliography
Authors: Mo Adam Mahmood
Venue: Advanced topics in end user computing (2002)

Stimulated by recent high-profile incidents, concerns about business ethics have increased over the last decade. In response, research has focused on developing theoretical and empirical frameworks to understand ethical decision making. So far, empirical studies have used traditional quantitative tools, such as regression or multiple discriminant analysis (MDA), in ethics research. More advanced tools are needed. In this exploratory research, a new approach to classifying, categorizing and analyzing ethical decision situations is presented. A comparative performance analysis of artificial neural networks, MDA and chance showed that artificial neural networks predict better in both training and testing phases. While some limitations of this approach were noted, in the field of business ethics, such networks are promising as an alternative to traditional analytic tools like MDA.
Approximating Shortest Paths in Large-Scale Networks with An Application to Intelligent Transportation Systems
Authors: Yu-Li Chou, H. Edwin Romeijn, Robert L. Smith
Venue: INFORMS Journal on Computing (1998)

We propose a hierarchical algorithm for approximating shortest paths between all pairs of nodes in a large-scale network. The algorithm begins by extracting a high-level subnetwork of relatively long links (and their associated nodes) where routing decisions are most crucial. This high-level network partitions the shorter links and their nodes into a set of lower-level subnetworks. By fixing gateways within the high-level network for entering and exiting these subnetworks, a computational savings is achieved at the expense of optimality. We explore the magnitude of these tradeoffs between computational savings and associated errors both analytically and empirically with a case study of the Southeast Michigan traffic network. An order-of-magnitude drop in computation times was achieved with an on-line route guidance simulation, at the expense of less than 6% increase in expected trip times.
Impromptu: on-demand self-servicing software framework
Authors: Ella Grishikashvili, M. Allen, A. Taleb-Bendiab
Venue: Second international workshop on Intelligent systems design and application (2002)

Recent research advances in the field of reflective middleware systems, autonomous software agent, advanced software engineering and control engineering are contributing to a better understanding of adaptive software. Though, still further work is required to understand and develop high-level languages, protocols and associated tools for ad-hoc and opportunistic software self-servicing capabilities. This paper describes on-going research aiming at the development of a framework for self-adaptive middleware software services. The framework exploits service-oriented programming and computational intelligence to support software systems self-governance through dynamic reconfiguration using agent assembly models. The paper will present a brief overview of Jini basic mechanisms and their use to support the development of the impromptu framework. This will be followed by a description of our approach and concluding remarks.
Conservation properties of vectorial operator splitting
Authors: Rossitza S. Marinova, Tadayasu Takahashi, Hideaki Aiso, Christo I. Christov, Tchavdar T. Marinov
Venue: Journal of Computational and Applied Mathematics (2003)

This work is concerned with the conservation properties of a new vectorial operator splitting scheme for solving the incompressible Navier-Stokes equations. It is proven that the difference approximation of the advection operator conserves square of velocity components and the kinetic energy as the differential operator does, while pressure term conserves only the kinetic energy. Some analytical requirements necessary to be satisfied of difference schemes for incompressible Navier-Stokes equations are formulated and discussed. The properties of the methods are illustrated with results from numerical computations for lid-driven cavity flow.
Electronic commerce personnel in the age of clicks and mortar: toward a framework of individual and project level skills
Authors: Fred Niederman, Xiaorui Hu
Venue: Proceedings of the 2003 SIGMIS conference on Computer personnel research: Freedom in Philadelphia--leveraging differences and diversity in the IT workforce (2003)

With the explosive growth of Internet, the need for individuals to build and maintain electronic commerce programs has emerged. E-commerce sites have the dual challenges of appealing enough to users to purchasing online as well as running flawlessly to support secure transactions. Thus, e-commerce personnel need to integrate the creativity of delighting users with reliable technology. This paper examines the staffing of e-commerce teams and particularly focuses on skills needed and how they should be arranged. This paper details how e-commerce staffing should include IT professionals, web publication specialists, and hybrid professionals with skill profiles combining IT and publication abilities. This paper also presents a model of the particular skill set needed for staffing an e-commerce team. Finally, the paper discusses e-commerce positions in light of likely trends in employment and technology.