ppxscal/embedding_network huggingface dataset:
Declarative definition of group indexed data structures and approximation of their domains
Authors: Jean-Louis Giavitto, Olivier Michel
Venue: Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming (2001)

We introduce a new high-level programming abstraction which extends the concept of data collection. The new construct, called GBF (for Group Based Data-Field), is based on an algebra of index sets, called a shape, and a functional extension of the array type, the field type. Shape constructions are based on group theory and put the emphasis on the logical neighborhood of the data structure elements. A field is a function from a shape to some set of values. In this study, we focus on regular neigh borhood structures and we show that arrays of any dimensions, cyclic array and trees are special kind of GBF.The recursive definitions of a GBF are then studied and we provide some elements for an implementation and some computability results in the case of recursive definition.
Boundedness by 3 of the whitney interpolation constant
Authors: J. Gilewicz, Yu. V. Kryakin, I. A. Shevchuk
Venue: Journal of Approximation Theory (2002)

Let the function f ∈ C[0, 1] satisfy f(j/k-1) = 0, j = 0,..., k - 1. We prove the estimate sup x∈[0,1] |f(x)|≤3 sup x,x+kh∈[0,1] |Σj=0k(-1)k-j (??kj??) f(x+jh)|.
Unitary operators on the document space
Authors: Eduard Hoenkamp
Venue: Journal of the American Society for Information Science and Technology (2003)

When people search for documents, they eventually want content, not words. Hence, search engines should relate documents more by their underlying concepts than by the words they contain. One promising technique to do so is Latent Semantic Indexing (LSI). LSI dramatically reduces the dimension of the document space by mapping it into a space spanned by conceptual indices. Empirically, the number of concepts that can represent the documents are far fewer than the great variety of words in the textual representation. Although this almost obviates the problem of lexical matching, the mapping incurs a high computational cost compared to document parsing, indexing, query matching, and updating. This article accomplishes several things. First, it shows how the technique underlying LSI is just one example of a unitary operator, for which there are computationally more attractive alternatives. Second, it proposes the Haar transform as such an alternative, as it is memory efficient, and can be computed in linear to sublinear time. Third, it generalizes LSI by a multiresolution representation of the document space. The approach not only preserves the advantages of LSI at drastically reduced computational costs, it also opens a spectrum of possibilities for new research.
Acceptance and Dispatching Policies for a Distribution Problem
Authors: Anton J. Kleywegt, Jason D. Papastavrou
Venue: Transportation Science (1998)

A dynamic and stochastic distribution problem with a number of terminals and a fleet of vehicles is analyzed. Customers request the transportation of batches of loads between different origins and destinations. A request can be accepted or rejected; if the request is accepted, a reward is received. Holding costs for vehicles and loads at terminals as well as transportation costs are included in the model. The objective is to determine a policy for accepting transportation requests and for dispatching vehicles that maximizes the expected value (rewards minus costs) of operating the distribution system. A Markov decision process model is developed, optimal policies are characterized, and algorithms that exploit the structure of the problem are developed.
The role of high-level and low-level features in style-based retrieval and generation of multimedia presentations
Authors: Frank Nack, Menzo Windhouwer, Lynda Hardman, Eric Pauwels, Michèle Huijberts
Venue: The New Review of Hypermedia and Multimedia (2002)

In this paper we argue that the automatic generation of dynamic multimedia presentation requires both low-level collections of objective measurements for media units representing prototypical style elements, and high-level conceptual descriptions supporting contextual and presentational requirements. Only the combination of both facilitates the retrieval of adequate material and its user-centred presentation. We discuss the problems of visual signification for images in dynamic systems and explain how a combined approach can help overcome such problems. We then propose an architecture for such a system and present its applicability for a museum-oriented multimedia system with a working example.
Managing a Retailer's Shelf Space, Inventory, and Transportation
Authors: Gerard Cachon
Venue: Manufacturing Service Operations Management (2001)

Retailers must constantly strive for excellence in operations; extremely narrow profit margins leave little room for waste and inefficiency. This article reports a retailer's challenge to balance transportation, shelf space, and inventory costs. A retailer sells multiple products with stochastic demand. Trucks are dispatched from a warehouse and arrive at a store with a constant lead time. Each truck has a finite capacity and incurs a fixed shipping cost, no matter the number of units shipped. There is a per unit shelf-space cost as well as holding and backorder penalty costs. Three policies are considered for dispatching trucks: a minimum quantity continuous review policy, a full service periodic review policy, and a minimum quantity periodic review policy. The first policy ships a truck when demand since the previous shipment equals a fixed fraction of a truck's capacity, i.e., a minimum truck utilization. The exact analysis of that policy is the same as the analysis of reorder point policies for the multiechelon problem with one-warehouse, multiple retailers, and stochastic demand. That analysis is not computationally prohibitive, but the minimum quantity level can be chosen with a simple economic order quantity (EOQ) heuristic. An extensive numerical study finds the following: Either of the two periodic review policies may have substantially higher costs than the continuous review policy, in particular when the warehouse to store lead time is short; the EOQ heuristic performs quite well; the minimum quantity policy's total cost is relatively insensitive to the chosen transportation utilization, and its total cost is close to a lower bound developed for this problem.
Optimal indexing using near-minimal space
Authors: C. Heeren, H. V. Jagadish, L. Pitt
Venue: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2003)

We consider the index selection problem. Given either a fixed query workload or an unknown probability distribution on possible future queries, and a bound B on how much space is available to build indices, we seek to build a collection of indices for which the average query response time is minimized. We give strong negative and positive peformance bounds.Let m be the number of queries in the workload. We show how to obtain with high probability a collection of indices using space O(B ln m) for which the average query cost is optB, the optimal performance possible for indices using at most B total space. Moreover, this space relaxation is necessary: unless NP &sube; nO(log log n), no polynomial time algorithm can guarantee average query cost less than M1--&epsilon; optB using space &alpha;B, for any constant &alpha;, where M is the size of the dataset. We quantify the error in performance introduced by running the algorithm on a sample drawn from a query distribution.
Feedback based routing
Authors: Dapeng Zhu, Mark Gritter, David R. Cheriton
Venue: ACM SIGCOMM Computer Communication Review (2003)

In this paper, we describe the problems that affect availability in BGP, such as vulnerability to attacks, slow convergence time, and lack of scalability. These problems arise from the basic assumption of BGP: every router has to cooperate to make routing work. We propose a new routing system, feedback based routing, which bifurcates structural information and dynamic information. Only structural information is propagated. Dynamic information is discovered by the routers based on feedback and probes. Routing decisions are made based on the dynamic information. We argue that this system is resilient to minority compromises in the infrastructure, provides higher availability than BGP, and can scale to the size of the Internet of the future.
Stability for a phase field model with the total variation functional as the interfacial energy
Authors: Nobuyuki Kenmochi, Ken Shirakawa
Venue: Nonlinear Analysis: Theory, Methods Applications (2003)

In this paper, we treat a one-dimensional solid-liquid phase transition model in which the interface energy is given by the total variation functional of the order parameter. We discuss the large time behavior of solutions of our problem under such a condition on initial data that the initial temperature is uniformly close to the phase transition temperature and the initial state of the material is sufficiently close to a class of steady states.
An automatic load/extract scheme for XML documents through object-relational repositories
Authors: Frank S. C. Tseng, Wen-Jong Hwung
Venue: Journal of Systems and Software (2002)

Extensible markup language (XML), a simplified version of standard generalized markup language (SGML), is designed to enable electronic text interchange in the Internet. XML documents have a rigorously described structure that may be analyzed by computers and easily understood by humans. Most current approaches store XML documents in file systems or in relational database systems. However, the nature and the design of file system or relational database schema may cause limitations on fitting with XML document structure. In this paper, we present an automatic load/extract scheme to store and retrieve XML documents through object-relational databases. We propose an architecture, called XML meta-generator (XMG), which, after reading a specific document type definition (DTD), automatically generates the corresponding object-relational database schema (OR-Schema), a DI-Decomposer and a DI-Reconstructor, which are explained as follows: 1. OR-Schema--an object-relational database schema in UniSQL/X format for a specific DTD. 2. DI-Decomposer--a module decomposes XML document instances (Dis) according to the specific DTD format and stores the elements into the corresponding object-relational database. 3. DI-Reconstructor--a module retrieves elements from the object-relational database and reconstructs it to recover the original DI.These modules make XML documents be automatically decomposed into and reconstructed from object-relational databases in a seamless manner. Moreover, documents stored in the object-relational databases can be managed and inquired more easily than it could be in file systems or relational databases. Useful applications on various documents can also be easily built on top of the target database, such as digital libraries, data warehouses, and data or text mining systems.
Scheduling a Major College Basketball Conference--Revisited
Authors: Martin Henz
Venue: Operations Research (2001)

Nemhauser and Trick presented the problem of finding a timetable for the 1997/1998 Atlantic Coast Conference (ACC) in basketball. Their solution, found with a combination of integer programming and exhaustive enumeration, was accepted by the ACC.Finite-domain constraint programming is another programming technique that can be used for solving combinatorial search problems such as sports tournament scheduling. This paper presents a solution of round-robin tournament planning based on finite-domain constraint programming. The approach yields a dramatic performance improvement, which makes an integrated interactive software solution feasible.
A new approximation procedure for fractals
Authors: E. de Amo, I. Chitescu, M. Díaz Carrillo, N. A. Secelean
Venue: Journal of Computational and Applied Mathematics (2003)

This paper is based upon Hutchinson's theory of generating fractals as fixed points of a finite set of contractions, when considering this finite set of contractions as a contractive set-valued map.We approximate the fractal using some preselected parameters and we obtain formulae describing the "distance" between the "exact fractal" and the "approximate fractal" in terms of the preselected parameters. Some examples and also computation programs are given, showing how our procedure works.
Quadratic trigonometric polynomial curves with a shape parameter
Authors: Xuli Han
Venue: Computer Aided Geometric Design (2002)

Quadratic trigonometric polynomial curves with a shape parameter are presented in this paper. Analogous to the quadratic B-spline curves, the trigonometric polynomial curves are constructed with three consecutive control points for each curve segment and are Cl continuous with a non-uniform knot vector. With the shape parameters, the trigonometric polynomial curves can yield tight envelopes for the quadratic B-spline curves and can be closer to the given control polygon than the quadratic B-spline curves. The trigonometric polynomial curves also can be decreased to linear trigonometric polynomial curves which can represent ellipses.
Web-based fuzzy neural networks for stock prediction
Authors: Yu Tang, Fujun Xu, Xuhui Wan, Yan-Qing Zhang
Venue: Computational intelligence and applications (2002)

A web-based stock prediction system is developed based on a fuzzy neural network by using the past stock data to discover fuzzy rules and make future predictions. The learning algorithm is implemented. Input data to each network are the moving averages of the weekly stock data, which are obtained from http://moneycentral.msn.com. The output simulation data are also the average values of the weekly stock data. After the input data are collected from the website for the specific term using web search techniques, the system is trained and then is able to make future predictions. To implement this stock prediction System, JSP (Java Server Page), JDK1.3, JSP server and IE server 5.0 are used.
Taking stock of Turing test: a review, analysis, and appraisal of issues surrounding thinking machines
Authors: Appa Rao Korukonda
Venue: International Journal of Human-Computer Studies (2003)

The Turing test (TT) has provided the inspiration for the inception and rapid development of artificial intelligence (AI) as a discipline. Additionally, it provided a platform for what might be termed a spirited, enduring, and enlightening--albeit occasionally frustrating-- rounds of debate on a broad range of questions. Turing, who proved to be much ahead of his time in more ways than one, predicted that it would be possible to develop machines capable of passing the TT in about 50 years time, that is just about now. Perhaps, Turing overestimated the rate of progress of technology, or of transformation of deeply entrenched paradigms of thought; but whatever the reason, his prediction about the feasibility of "thinking machines" is yet to come true in an engineering or in a symbolic-semantic sense. This paper presents a set of reflections on this and other predictions made by Turing and relates them to what has actually transpired in the 50 years since his original paper was published. Contributions of TT to the field of AI are assessed and directions for the future are presented.
Noncombinatorial Detection of Regular Repetitions under Perspective Skew
Authors: Tinne Tuytelaars, Andreas Turina, Luc Van Gool
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

We present a geometric framework for the efficient detection of regular repetitions of planar (but not necessarily coplanar) patterns. At the heart of our system, lie the fixed structures of the transformations that describe these regular configurations. The approach detects a number of symmetric configurations that have traditionally been dealt with separately, in that all configurations corresponding to planar homologies are detected. These include important cases such as periodicities, mirror symmetries, and reflections about a point. The approach can handle perspective distortions. It avoids to get trapped in combinatorics through invariant-based hashing for pattern matching and through Hough transforms for the detection of fixed structures. Additional efficiency and robustness are obtained from the system's ability to ¿reason¿ about the consistency of multiple homologies. The performance of the system is demonstrated with several examples.
Using sparsification for parametric minimum spanning tree problems
Authors: David Fernández-Baca, Giora Slutzki, David Eppstein
Venue: Nordic Journal of Computing (1996)

Two applications of sparsification to parametric computing are given. The first is a fast algorithm for enumerating all distinct minimum spanning trees in a graph whose edge weights vary linearly with a parameter. The second is an asymptotically optimal algorithm for the minimum ratio spanning tree problem, as well as other search problems, on dense graphs.
Best practices and future visions for search user interfaces: a workshop
Authors: Misha W. Vaughan, Helmut Degen, Marc Resnick, Peter Gremett
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

This one-day workshop will create a roadmap of current best practices and future needs for search user interface design. It will provide an interactive forum for participants to actively discuss submitted papers, industry trends, and gaps in our knowledge. Participants will come away with new research findings, key contacts, and identified opportunities for research. Participants will be both practitioners and academics to balance the discussion between theory and application.
Word recognition system using neural networks
Authors: H. Y. Y. Sanossian
Venue: Highly parallel computaions: algorithms and applications (2001)

In this chapter we discuss some of the methods used for word recognition. In general, word recognition systems are divided into three stages, segmentation, feature extraction and classification. We also present a technique for Arabic word recognition. Printed and handwritten Arabic words are mainly cursive. A segmentation technique is used taking into consideration the characteristic of the Arabic characters. Once a word is segmented, each subimage is passed through a feature extraction stage where the topological information is extracted and used for classification. The classification stage is performed using a set of neural networks. A feedback from the outcome of the neural networks to the segmentation stage occurs when a character is rejected. The technique is tested on printed Arabic characters.
R0 implication: characteristics and applications
Authors: Daowu Pei
Venue: Fuzzy Sets and Systems (2002)

R0 implication is an important fuzzy implication determined by standard nilpotent minimum t-norm. In this paper, this implication is further studied, its main properties are list out, its some characteristics and independence are discussed, and its applications in fuzzy logic and fuzzy reasoning are also reviewed.
Hardware simulation tools for computer design
Authors: Kenneth R. Vollmar
Venue: Journal of Computing Sciences in Colleges (2002)

An objective during the latest offering of our institution's Computer Organization course was to improve student's awareness that a computer is merely an electronic device, and that a simple working example may be constructed by using knowledge they already possess. A hardware simulation tool was used to construct illustrative portions of computer circuits and a complete, functioning computer used during different types of student exercises and assignments. Anecdotal feedback and a post-use survey confirmed my expectation that the simulation would contribute toward student's understanding and confidence.
Reconstruction based recognition of scenes with multiple repeated components
Authors: Ragini Choudhury, Santanu Chaudhury, J. B. Srivastava
Venue: Computer Vision and Image Understanding (2001)

This paper proposes an invariance based recognition scheme for scenes with multiple repeated components. The scheme considers three component subsets which characterize the scene completely. Each such three component subset is reconstructed using single image based information. We have developed a mathematical framework for the projective reconstruction based on relative affine structure of each such three component building block. This is extended to the case when each of the components is a quadric. A set of projective invariants of three quadrics has also been obtained by us. Although the reconstruction scheme is general and applicable to all multiple repeated components, it requires the computation of infinite homography. The infinite homography and hence the reconstruction scheme are only image computable with the given information in the case of translational repetition. We therefore develop a recognition strategy for the specific case of translationally repeated quadrics. As a recognition strategy for scenes with multiple translationally repeated quadric components, we propose to compute and store invariant values for each such three component subsets. Experiments on real data have shown the applicability of this approach for recognition of aerial images of power plants. The discriminatory power of the invariants and the stability of the recognition results have also been experimentally demonstrated.
A Common Set of Perceptual Observables for Grouping, Figure-Ground Discrimination, and Texture Classification
Authors: Anthony Hoogs, Roderic Collins, Robert Kaucic, Joseph Mundy
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2003)

We present a complete set of perceptual observables that provides a unified image description for grouping, figure-ground separation, and texture analysis. Although much progess has been made recently in treating contours and texture simultaneously for image segmentation and grouping, current approaches rely on different models for contours, regions, and texture such as one-dimensional intensity discontinuities for contours and filter bank responses for texture. This results in expensive computation that arbitrates between these disparate representations at each pixel. In our approach, salient image content such as contours, regions, and texture are represented in a common, low-level framework of image observables. We model the image as a partition of surfaces bounded by intensity discontinuities and derive perceptual measures as relations between neighboring surfaces. This enables us to extend the traditional Gestalt measures based on local edge geometry and contrast to region-based measures that jointly exploit large-scale image topology, photometry, and geometry. These measures provide a natural basis for grouping on multidimensional similarity criteria and texture is directly derived as relational properties on local region neighborhoods. The viability of our model is demonstrated by applying the common observables to texture recognition, figure-ground separation, and generic image segmentation. The texture classification algorithm approaches or exceeds the accuracy of filter bank approaches on both periodic and nonperiodic textures that have significant 3D structure. The measures are invariant to image rotation and slowly varying against large changes in illumination, viewpoint, and scale. The same perceptual measures are successfully applied in a difficult figure-ground separation problem in aerial images. Regions are first filtered, then grouped, using an efficient search algorithm based on perceptual salience to delineate objects of interest. Results for both are shown on large sets of complex, real-world images exhibiting difficult conditions.