ppxscal/embedding_network huggingface dataset:
Storing and Handling Vague Spatial Objects
Authors: Arta Dilo, Pawalai Kraipeerapun, Wim Bakker, Rolf A. de By
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

This paper deals with the storage and manipulation of vague spatial objects: points, lines, and regions. Vector data format is used to implement vague objects. We store vague objects by extending GRASS vector format capabilities. A point is represented by a triple, containing the location and the membership value of the point. A line is represented by a sequence of triples, each containing the location and the membership value of a point on the line. A region is represented by a set of lines, which depict important characteristics of the region. Data structures are defined to put constraints on the stored data, so that desired properties for vague objects are satisfied. To complete (approximate) information about lines and regions, a linear interpolation and a triangulation-based interpolation method are used, respectively. Modules are built to edit and retrieve information of vague objects. A union operator on vague objects is also implemented.
A Heuristic for Wiring-Aware Built-In Self-Test Synthesis
Authors: Abdil Rashid Mohamed, Zebo Peng, Petru Eles
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

This paper addresses the problem of BIST synthesis that takes into account wiring area. A technique for minimizing BIST hardware overhead is presented. The technique uses results of symbolic testability analysis to guarantee testability of all modules in the design. New behavioral-level BIST enhancement metrics are used to guide synthesis in such a way that the number of testability enhancements is minimized. The technique is not only fast but also adds low BIST overhead.
A performance estimation model for AS/RS by M/G/1 queuing system
Authors: Sun Hur, Young Hae Lee, Si Yeong Lim, Moon Hwan Lee
Venue: Computers and Industrial Engineering (2004)

It is quite common to adopt a static approach or computer simulation method for the performance estimation of the Automated Storage/Retrieval System (AS/RS). In most research, the authors assume that the storage/retrieval machine performs only either single command or dual command at each operation and, in addition, the type of request is known in advance, which is not adequate in the real system. In this paper, we propose a stochastic approach for the performance estimation of a unit-load AS/RS by using an M/G/1 queuing model with a single server and two queues. In particular, the steady state probability distribution of the number of storage and retrieval commands waiting in the queues is obtained in the form of transform. According to the computational comparison with the simulation, the proposed approach gives satisfactory results with very high accuracy.
Mappings of Figure Spaces and Systems of These Spaces
Authors: V. Ya. Burdyuk
Venue: Cybernetics and Systems Analysis (2004)

The formation of an informal theory of figure spaces is considered. In particular, interesting and natural generalizations of such fundamental mathematical concepts as continuous and uniformly continuous mappings are proposed.
The effect of paged memory upon algorithm performance: short note
Authors: Alistair Moffat
Venue: ACM SIGACT News (1983)

We investigate the effect of a common memory management scheme on the running times of some simple algorithms. We find that some otherwise comparable algorithms have markedly different performance under this new algorithm metric.
Finding similar academic web sites with links, bibliometric couplings and colinks
Authors: Mike Thelwall, David Wilkinson
Venue: Information Processing and Management: an International Journal (2004)

A common task in both Webmetrics and Web information retrieval is to identify a set of Web pages or sites that are similar in content. In this paper we assess the extent to which links, colinks and couplings can be used to identify similar Web sites. As an experiment, a random sample of 500 pairs of domains from the UK academic Web were taken and human assessments of site similarity, based upon content type, were compared against ratings for the three concepts. The results show that using a combination of all three gives the highest probability of identifying similar sites, but surprisingly this was only a marginal improvement over using links alone. Another unexpected result was that high values for either colink counts or couplings were associated with only a small increased likelihood of similarity. The principal advantage of using couplings and colinks was found to be greater coverage in terms of a much larger number of pairs of sites being connected by these measures, instead of increased probability of similarity. In information retrieval terminology, this is improved recall rather than improved precision.
A Novel Interface Paradigm for Supporting Product Design
Venue: Proceedings of the Shape Modeling International 2004 (2004)

This paper presents the design and implementation ofan interactive free-form 3D sketching paradigm to supportcreative designs. This work builds on advances in a largenumber of related technologies such as multi-screendisplays, constraint-based assembly modelling,deformable modelling and state-of-the-art multi-sensoryinterfaces. This paper presents the current design andimplementation features of the proposed design paradigm.
Moment invariants for recognition under changing viewpoint and illumination
Authors: Florica Mindru, Tinne Tuytelaars, Luc Van Gool, Theo Moons
Venue: Computer Vision and Image Understanding (2004)

Generalised color moments combine shape and color information and put them on an equal footing. Rational expressions of such moments can be designed, that are invariant under both geometric deformations and photometric changes. These generalised color moment invariants are effective features for recognition under changing viewpoint and illumination. The paper gives a systematic overview of such moment invariants for several combinations of deformations and photometric changes. Their validity and potential is corroborated through a series of experiments. Both the cases of indoor and outdoor images are considered, as illumination changes tend to differ between these circumstances. Although the generalised color moment invariants are extracted from planar surface patches, it is argued that invariant neighbourhoods offer a concept through which they can also be used to deal with 3D objects and scenes.
The game of academe
Authors: Stanley Coren
Venue: ACM SIGACT News (1983)

A game simulating the progress of a professor through the ranks of academe is offered. This simulation includes many of the most relevant aspects of university life, such as teaching, administration and research. Because it is faithful to the rules of the real life academic situation, its actual playability is somewhat suspect. 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
Evaluation of decision trees: a multi-criteria approach
Authors: Kweku-Muata Osei-Bryson
Venue: Computers and Operations Research (2004)

Data mining (DM) techniques are being increasingly used in many modern organizations to retrieve valuable knowledge structures from organizational databases, including data warehouses. An important knowledge structure that can result from data mining activities is the decision tree (DT) that is used for the classification of future events. The induction of the decision tree is done using a supervised knowledge discovery process in which prior knowledge regarding classes in the database is used to guide the discovery. The generation of a DT is a relatively easy task but in order to select the most appropriate DT it is necessary for the DM project team to generate and analyze a significant number of DTs based on multiple performance measures. We propose a multi-criteria decision analysis based process that would empower DM project teams to do thorough experimentation and analysis without being overwhelmed by the task of analyzing a significant number of DTs would offer a positive contribution to the DM process. We also offer some new approaches for measuring some of the performance criteria.
On a Problem of Cameron&#x2019;s on Inexhaustible Graphs
Authors: Anthony Bonato, Dejan Deli&#x0107;
Venue: Combinatorica (2004)

A graph G is inexhaustible if whenever a vertex of G is deleted the remaining graph is isomorphic to G. We address a question of Cameron [6], who asked which countable graphs are inexhaustible. In particular, we prove that there are continuum many countable inexhaustible graphs with properties in common with the infinite random graph, including adjacency properties and universality. Locally finite inexhaustible graphs and forests are investigated, as is a semigroup structure on the class of inexhaustible graphs. We extend a result of [7] on homogeneous inexhaustible graphs to pseudo-homogeneous inexhaustible graphs.
An Inequality for Circle Packings Proved by Semidefinite Programming
Authors: Pablo A. Parrilo, Ronen Peretz
Venue: Discrete Computational Geometry (2004)

A geometric inequality among three triangles, originating in circle packing problems, is introduced. In order to prove it, we reduce the original formulation to the nonnegativity of a polynomial in four real indeterminates. Techniques based on sum of squares decompositions, semidefinite programming and symmetry reduction are then applied to provide an easily verifiable nonnegativity certificate.
Dimension, Entropy Rates, and Compression
Authors: John M. Hitchcock, N. V. Vinodchandran
Venue: Proceedings of the 19th IEEE Annual Conference on Computational Complexity (2004)

This paper develops relationships between resource-boundeddimension, entropy rates, and compression. Newtools for calculating dimensions are given and used to improveprevious results about circuit-size complexity classes.Approximate counting of SpanP functions is used toprove that the NP-entropy rate is an upper bound for dimensionin \Delta _3^E, the third level of the exponential-time hierarchy.This general result is applied to simultaneously improve theresults of Mayordomo (1994) on the measure on P/poly in\Delta _3^E and of Lutz (2003) on the dimension of exponential-sizecircuit complexity classes in ESPACE.Entropy rates of efficiently rankable sets, sets that are optimallycompressible, are studied in conjunction with time-boundeddimension. It is shown that rankable entropy ratesgive upper bounds for time-bounded dimensions. We usethis to improve results of Lutz (1992) about polynomial-sizecircuit complexity classes from resource-bounded measureto dimension.Exact characterizations of the effective dimensions interms of Kolmogorov complexity rates at the polynomialspaceand higher levels have been established, but in thetime-bounded setting no such equivalence is known. Weintroduce the concept of polynomial-time superranking asan extension of ranking. We show that superranking providesan equivalent definition of polynomial-time dimension.From this superranking characterization we show thatpolynomial-time Kolmogorov complexity rates give a lowerbound on polynomial-time dimension.
Development of an Immersive VR Display System for 3D Digital Art
Authors: Chung-Ryul Ryu, Yoon-Ho Cho, Young-Ho Chai
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualization (2004)

In this paper, a new 3D digital art and an immersive VR display system are presented. A 3D drawing interface and a real time object modeling, which is using auto 3D strokes, are implemented for 3D digital art. One 3D stroke makes some part of the object in one movement. This 3D modeling method has an advantage in representing complex objects quickly. 2D mouse interface is not appropriate for this kind of 3D stroke modeling task, so 3D virtual environment system with 3D wand interface is realized in this study. And an infrared camera-tracking device is used. Since the user viewpoint and wand are tracked, the user can see different screen display at various points of view and interact with objects directly.
Using Back Propagation Neural Network for Cardiac Wall Motion Detection on Angiocardiography
Authors: Yu-Chien Shiau, Hsiao-Hsuan Chou, Shue-Tsun Fan, Shu-Hsun Chu, Te-Son Kuo
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

We used back propagation neural network for cardiac wall motion detection oncatheterization angiocardiography. Phantom images of two circular discs were generated tosimulate the left ventricle. Training data sets were selected from the phantom images. Aftertraining, the neural network can perform cardiac wall motion detection for the phantomimages and for all series of patients' angiocardiographic images. The angiocardiography ofone patient with normal cardiac wall motion and two patients with abnormal cardiac wallmotion were acquired for cardiac wall motion detection. The results were displayed in theformats of vector fields superimposed on the original angiocardiographic images. The studyshowed that back propagation neural network was useful in the evaluation of cardiac wallmotion on catheterization angiocardiography.
Sam
Venue: ACM SIGGRAPH 2003 video review on Animation theater program: part 1 - Volume 145 (2003)

In the distant future of a galaxy very dissimilar to our own, an otherworldly janitor named Sam begins his duties at the cargo distribution center of WGA-Minora Biocybernetics. In the midst of cleaning up debris and longing for a life other than his own, Sam is suddenly presented with an unsupervised cargo plane, a disk containing all the knowledge of a cargo pilot, and the opportunity for the misadventure of a lifetime. Copyright held by creator.
A mean-field analysis of short lived interacting TCP flows
Authors: François Baccelli, Augustin Chaintreau, Danny De Vleeschauwer, David McDonald
Venue: ACM SIGMETRICS Performance Evaluation Review (2004)

In this paper, we consider a set of HTTP flows using TCP over a common drop-tail link to download files. After each download, a flow waits for a random think time before requesting the download of another file, whose size is also random. When a flow is active its throughput is increasing with time according to the additive increase rule, but if it suffers losses created when the total transmission rate of the flows exceeds the link rate, its transmission rate is decreased. The throughput obtained by a flow, and the consecutive time to download one file are then given as the consequence of the interaction of all the flows through their total transmission rate and the link's behavior.We study the mean-field model obtained by letting the number of flows go to infinity. This mean-field limit may have two stable regimes : one without congestion in the link, in which the density of transmission rate can be explicitly described, the other one with periodic congestion epochs, where the inter-congestion time can be characterized as the solution of a fixed point equation, that we compute numerically, leading to a density of transmission rate given by as the solution of a Fredholm equation. It is shown that for certain values of the parameters (more precisely when the link capacity per user is not significantly larger than the load per user), each of these two stable regimes can be reached depending on the initial condition. This phenomenon can be seen as an analogue of turbulence in fluid dynamics: for some initial conditions, the transfers progress in a fluid and interaction-less way; for others, the connections interact and slow down because of the resulting fluctuations, which in turn perpetuates interaction forever, in spite of the fact that the load per user is less than the capacity per user. We prove that this phenomenon is present in the Tahoe case and both the numerical method that we develop and simulations suggest that it is present in the Reno case too. It translates into a bi-stability phenomenon for the finite population model within this range of parameters.
Designing a 3D Authoring Tool for Children
Authors: Jana Hintze, Maic Masuch
Venue: Proceedings of the Second International Conference on Creating, Connecting and Collaborating through Computing (2004)

When designing their own interactive 3D worldsand computer games, children can not only engage ina fun and playful activity that has meaning to them, butwill be able to strengthen their creative power as wellas their analytical and problem solving skills.However, this requires tools that are designedcarefully to foster these processes and to be fun to useat the same time.We present work in progress on designing a 3Dauthoring tool for children to create interactive 3Dworlds. In the design process, emphasis was placed onfostering the userýs creative process as well as onconveying mathematical and structural principles andways of thinking through the toolýs structure. In thedesign process of a 3D authoring tool, these two goalsoften stand in contradiction to each other. In thispaper, we discuss selected problems that arecharacteristic to the design of this authoring tool andpresent our solutions to these problems as well as theresulting preliminary prototype system JiVE.
Approximate max-integral-flow/min-multicut theorems
Authors: Kenji Obata
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

We establish several approximate max-integral-flow / min-multicut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where the min-multicut is a constant fraction ε of the total capacity of the graph. This setting is motivated by several combinatorial and algorithmic applications. Prior to this work, a general max-integral-flow / min-multicut bound was known only for the special case where the graph is a tree. We prove that, for arbitrary graphs, the max-integral-flow / min-multicut ratio is O(ε-1 log k), where k is the number of commodites; for graphs excluding a fixed subgraph as a minor (for instance, planar graphs), O(1 / ε); and, for dense graphs, O(1√ε). Our proofs are constructive in the sense that we give efficient algorithms which compute either an integral flow achieving the claimed approximation ratios, or a witness that the precondition is violated.
Lot-sizing for inventory systems with product recovery
Authors: Ruud Teunter
Venue: Computers and Industrial Engineering (2004)

We study inventory systems with product recovery. Recovered items are as-good-as-new and satisfy the same demands as new items. The demand rate and return fraction are deterministic. The relevant costs are those for ordering recovery lots, for ordering production lots, for holding recoverable items in stock, and for holding new/recovered items in stock. We derive simple formulae that determine the optimal lot sizes for the production/procurement of new items and for the recovery of returned items. These formulae are valid for finite and infinite production rates as well as finite and infinite recovery rates, and therefore more general than those in the literature. Moreover, the method of derivation is easy and insightful.
CHIVE - A Program Source Visualisation Framework
Venue: Proceedings of the 12th IEEE International Workshop on Program Comprehension (2004)

The CHIVE visualisation framework is an attempt toprovide program comprehension and visualisation tooldevelopers with a flexible means for creating 3-Dimensional visualisations of hierarchies such as those that occur in program source. The CHIVE frameworksupports user definable datasets, multiple graph layoutsand an environment in which users can interact withvisualisations created from applying a graph layout to adataset.
Sizing tumors with TNM Classifications and Rough Sets Method
Authors: Gregor Stiglic, Peter Kokol
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

In this paper we present the medical decision support systems for TNM classification aiming to divide cancer patient to low and high risk patients. In addition to the decision the system also explains the decision in the form of IF-THEN rules and in this manner performs data mining and new knowledge discovery.
Implementation issues II
Authors: Michael S. Kenniston Russ Atkinson
Venue: ACM SIGPLAN Notices (1983)

The panelists were asked to address three questions. The three sections below are summaries of the ideas discussed in response to each of these questions. 1. When debugging a program, what information about that program is important for presentation to the user? What techniques can the debugger use to determine such information? While helping to develop a debugger, John Johnson had observed many programmers using it, and had noticed two distinct styles of information gathering: &bull; Many programmers began by getting fairly small amounts of information. They simply wanted an overview of the "flow" of the program, in order to get a general understanding of its behavior. &bull; After suspicion had been narrowed down to- a particular area within the program, the users wanted as much information as possible, formatted nicely.
Handel-C implementation of Classical Component Labelling Algorithm
Authors: Miroslaw Jablonski, Marek Gorgon
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

In the paper the implementation of Classical Label Component Algorithm in Handel-C language has been discussed. The implementation of the image segmentation stage has been realized in real-time in the pipeline structure. The process of construction of optimal implementation has been shown, including the algorithm parallelization on one hand and taking advantage of the language features on the other. Each implementation has been verified in hardware and tested by a set of specially designed test images.
some problems concerning the Smarandache square complementary function (II)
Authors: Maohua Le
Venue: Smarandache Notions Journal (2004)

In this paper we solve three diophantine equations concerning the Smarandache square coinplementary function.
Integration of multiple evidences based on a query type for web search
Authors: In-Ho Kang, Gil Chang Kim
Venue: Information Processing and Management: an International Journal (2004)

The massive and heterogeneous Web exacerbates IR problems and short user queries make them worse. The contents of web pages are not enough to find answer pages. PageRank compensates for the insufficiencies of content information. The content information and PageRank are combined to get better results. However, static combination of multiple evidences may lower the retrieval performance. We have to use different strategies to meet the need of a user. We can classify user queries as three categories according to users' intent, the topic relevance task, the homepage finding task, and the service finding task. In this paper, we present a user query classification method. The difference of distribution, mutual information, the usage rate as anchor texts and the POS information are used for the classification. After we classified a user query, we apply different algorithms and information for the better results. For the topic relevance task, we emphasize the content information, on the other hand, for the homepage finding task, we emphasize the Link information and the URL information. We could get the best performance when our proposed classification method with the OKAPI scoring algorithm was used.