ppxscal/embedding_network huggingface dataset:
College Football Rankings: Do the Computers Know Best?
Authors: Joseph Martinich
Venue: Interfaces (2002)

The bowl-championship-series (BCS) committee uses 10 ranking schemes, including eight computer rankings, to select college football teams for bowl-championship-series bowl games, including the national championship game. The large financial benefits of participating in BCS bowl games make it imperative that the selection process accurately select the best teams. I evaluated the performance of the 10 ranking schemes the BCS committee used during the 1999 and 2000 seasons to select bowl teams. I found that almost all are equally accurate, but theSeattle Times scheme clearly underperforms the others. In addition, two proposed changes to the BCS selection formula, (1) to prohibit computer ranking schemes from considering the margin of victory in their rankings, and (2) to include explicitly the outcomes of head-to-head games among teams being considered for BCS bowls, could do more harm than good and could decrease the likelihood of the committee selecting the best teams for the BCS bowls.
Evolving integrated controllers for autonomous learning robots using dynamic neural networks
Authors: Elio Tuci, Inman Harvey, Matt Quinn
Venue: Proceedings of the seventh international conference on simulation of adaptive behavior on From animals to animats (2002)

In 1994, Yamauchi and Beer (1994) attempted to evolve a dynamic neural network as a control system for a simulated agent capable of performing learning behaviour. They tried to evolve an integrated network, i.e. not modularized; this attempt failed. They ended up having to use independent evolution of separate controller modules, arbitrarily partitioned by the researcher. Moreover, they "provided" the agents with hard-wired reinforcement signals.The model we describe in this paper demonstrates that it is possible to evolve an integrated dynamic neural network that successfully controls the behaviour of a khepera robot engaged in a simple learning task. We show that dynamic neural networks, based on leaky-integrator neuron, shaped by evolution, appear to be able to integrate reactive and learned behaviour with an integrated control system which also benefits from its own evolved reinforcement signal.
Stalking Information: Bayesian Inventory Management with Unobserved Lost Sales
Authors: Martin A. Lariviere, Evan L. Porteus
Venue: Management Science (1999)

Retailers are frequently uncertain about the underlying demand distribution of a new product. When taking the empirical Bayesian approach of Scarf (1959), they simultaneously stock the product over time and learn about the distribution. Assuming that unmet demand is lost and unobserved, this learning must be based on observing sales rather than demand, which differs from sales in the event of a stockout. Using the framework and results of Braden and Freimer (1991), the cumulative learning about the underlying demand distribution is captured by two parameters, a scale parameter that reflects the predicted size of the underlying market, and a shape parameter that indicates both the size of the market and the precision with which the underlying distribution is known. An important simplification result of Scarf (1960) and Azoury (1985), which allows the scale parameter to be removed from the optimization, is shown to extend to this setting. We present examples that reveal two interesting phenomena: (1) A retailer may hope that, compared to stocking out, realized demand will be strictly less than the stock level, even though stocking out would signal a stochastically larger demand distribution, and (2) it can be optimal to drop a product after a period of successful sales. We also present specific conditions under which the following results hold: (1) Investment in excess stocks to enhance learning will occur in every dynamic problem, and (2) a product is never dropped after a period of poor sales. The model is extended to multiple independent markets whose distributions depend proportionately on a single unknown parameter. We argue that smaller markets should be given better service as an effe ctive means of acquiring information.
Secure traceroute to detect faulty or malicious routing
Authors: Venkata N. Padmanabhan, Daniel R. Simon
Venue: ACM SIGCOMM Computer Communication Review (2003)

Network routing is vulnerable to disruptions caused by malfunctioning or malicious routers that draw traffic towards themselves but fail to correctly forward the traffic. The existing approach to addressing this problem is to secure the routing protocol by having it validate routing updates, i.e., verify their authenticity, accuracy, and/or consistency. In this paper, we argue that it is also important to ensure the robustness of packet forwarding itself. To this end, we propose a different approach, the central idea of which is a secure traceroute protocol that enables end hosts or routers to detect and locate the source of (arbitrarily severe) routing misbehaviors, so that appropriate action can be taken.
Non-existence of directed strongly regular graphs
Authors: Leif K. Jørgensen
Venue: Discrete Mathematics (2003)

Directed strongly regular graphs were introduced by Duval in 1988. We give several nonexistence results, each excluding infinite series of feasible parameter sets: We prove a result that extends the absolute bound for strongly regular graphs, and we give a characterization of directed strongly regular graphs whose adjacency matrix has rank 3 or 4. We also give some combinatorial non-existence results and a construction of five new directed strongly regular graphs.
A tracing algorithm for surface-surface intersections on surface boundaries
Authors: Kyu-Yeul Lee, Doo-Yeoun Cho, Tae-Wan Kim
Venue: Journal of Computer Science and Technology (2002)

In this paper we present an algorithm with a new trace-terminating condition for tracing along surface-surface intersection curves on surface boundaries, while several tracing methods and embedding methods that include tracing scheme may cause false termination with a traditional trace-terminating condition: tracing stops when the surface-domain's boundary is reached. And we also suggest another iterative method to calculate intersection points on surface boundaries with parallel surface normal. Some numerical examples with these two ideas and comparisons to 'DESIGNBASE','ACIS', and 'Parasolid' are included to demonstrate the effectiveness of our algorithm.
An introduction to the Smarandache geometries
Authors: L. Kuciuk, M. Antholy
Venue: Smarandache notions (2002)

In this paper we make a presentation of these exciting geometries and present a model for a particular one.
Research Commentary: Information Systems and Conceptual Modeling--A Research Agenda
Authors: Yair Wand, Ron Weber
Venue: Information Systems Research (2002)

Within the information systems field, the task of conceptual modeling involves building a representation of selected phenomena in some domain. High-quality conceptual modeling work is important because it facilitates early detection and correction of system development errors. It also plays an increasingly important role in activities like business process reengineering and documentation of best-practice data and process models in enterprise resource planning systems. Yet little research has been undertaken on many aspects of conceptual modeling. In this paper, we propose a framework to motivate research that addresses the following fundamental question:How can we model the world to better facilitate our developing, implementing, using, and maintaining more valuable information systems? The framework comprises four elements: conceptual-modeling grammars, conceptual-modeling methods, conceptual-modeling scripts, and conceptual-modeling contexts. We provide examples of the types of research that have already been undertaken on each element and illustrate research opportunities that exist.
Adaption of fast Fourier transformations to estimate structural failure probability
Authors: Ravi C. Penmetsa, Ramana V. Grandhi
Venue: Finite Elements in Analysis and Design (2003)

Probabilistic analysis with multiple non-normal random variables requires multi-fold integration, for which the closed-form solutions do not exist. Moreover, it is almost impossible to estimate failure probability accurately without the use of numerical integration. A central problem in probabilistic analysis is the computation of the cumulative distribution function of the limit-state. Since the limit-state surface is not available in a closed-form, the convolution theorem is usually thought to be not applicable to the problem. In this paper, a methodology based on function approximations and the convolution theorem is presented to estimate the structural failure probability. The convolution integral is solved efficiently using the fast Fourier transform technique, and the limit-state is approximated using a two-point adaptive nonlinear approximation at the most probable failure point. The proposed technique estimates the failure probability accurately with significantly less computational effort compared to the Monte Carlo simulation. The methodology developed is applicable to structural reliability problems with any number of random variables and any kind of random variable distribution, including normal, log-normal, extreme value, Weibull, etc. The accuracy and robustness of the proposed algorithm is demonstrated by several examples having highly complex, explicit/implicit performance functions.
Rationalizing key design decisions in the ATM user plane
Authors: Daniel B. Grossman
Venue: ACM SIGCOMM Computer Communication Review (2002)

Any technology requires some number of key design decisions. In the case of the ATM user plane, the choices to use fixed length, 53 byte cells and virtual connections were unorthodox from the perspective of many in the networking research community. This paper attempts a technical justification for those design decisions.
Predictive scheduling of network processors
Authors: Tilman Wolf, Prashanth Pappu, Mark A. Franklin
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

To provide flexibility in deploying new protocols and services, general-purpose processing engines are being placed in the datapath of routers. Such network processors (NPs) are typically simple RISC multiprocessors that perform forwarding and custom application processing of packets. The inherent unpredictability of execution time of arbitrary instruction code poses a significant challenge in providing service guarantees for data flows that compete for such processing resources in the network. However, we show that network processing workloads are highly regular and predictable, which can be exploited for scheduling purposes. We present two such predictive processor scheduling algorithms that aim at providing service guarantees as well as improving the performance of the NP by increasing the instruction data locality. Simulation results show that these algorithms provide significantly better performance than processor scheduling algorithms that do not take packet processing times into consideration.
Coordination technologies for internet agents
Authors: Paolo Ciancarini, Andrea Omicini, Franco Zambonelli
Venue: Nordic Journal of Computing (1999)

Since its birth the Internet has always been characterised by a two-fold aspect of a distributed information repository, to store, publish, and retrieve program and data files, and an interaction medium, including a variety of communication services. An important current trend consists of merging the two aspects described above, and envision the Internet as a globally distributed computing platform where communication and computation can be freely intertwined. However, traditional distributed programming models fall short in this context, due to the peculiar characteristics of the Internet. On the one hand, Internet services are decentralised and unreliable. On the other hand, even more important, mobility, either of users, devices, or application components, is going to impact the Internet in the near future. Since Internet applications are intrinsically interactive and collaborative, the definition of an appropriate coordination model and its integration in forthcoming Internet programming languages are key issues to build applications including mobile entities. We sketch the main features that such a model should present. Then, we survey and discuss some coordination models for Internet programming languages, eventually outlining open issues and promising research directions.
Typing in thin air: the canesta projection keyboard - a new method of interaction with electronic devices
Authors: Helena Roeber, John Bacus, Carlo Tomasi
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

Canesta Keyboard is a novel interface to electronic devices that consists of a projection system and a sensor module instead of the mechanical switches of a traditional keyboard. Users input text by pressing keys on a projected image of a keyboard. This paper describes the advantages and drawbacks of this interface compared to existing input methods for mobile devices in terms of data entry speed, error rate, user satisfaction and physical size as revealed through usability testing.
Algebra of program termination
Authors: Henk Doornbos, Roland Backhouse
Venue: Algebraic and coalgebraic methods in the mathematics of program construction (2002)

Well-foundedness and inductive properties of relations are expressed in terms of fixed points. A class of fixed point equations, called "hylo" equations, is introduced. A methodology of recursive program design based on the use of hylo equations is presented. Current research on generalisations of well-foundedness and inductive properties of relations, making these properties relative to a datatype, is introduced.
A continuum theory of superconductivity
Authors: A. Cemal Eringen
Venue: Zeitschrift f&uuml;r Angewandte Mathematik und Physik (ZAMP) (2002)

A continuum theory of superconductivity is formulated for a mixture consisting of three species: a superelectron fluid, a conducting fluid, and a conducting elastic solid. Each one of the three species is subject to their own electro-magnetic (E-M) fields and motions. Irreversible thermodynamics are used to obtain constitutive equations. Field equations, boundary and initial conditions are given. A special case is obtained, suitable for mathematical analysis and applications. The Pippard theory of superconductivity is shown to be a special case of the present theory.
A continuous probabilistic framework for image matching
Authors: Hayit Greenspan, Jacob Goldberger, Lenny Ridel
Venue: Computer Vision and Image Understanding (2001)

In this paper we describe a probabilistic image matching scheme in which the image representation is continuous and the similarity measure and distance computation are also defined in the continuous domain. Each image is first represented as a Gaussian mixture distribution and images are compared and matched via a probabilistic measure of similarity between distributions. A common probabilistic and continuous framework is applied to the representation as well as the matching process, ensuring an overall system that is theoretically appealing. Matching results are investigated and the application to an image retrieval system is demonstrated.
Through the Looking Glass of Complexity: the Dynamics of Organizations As Adaptive and Evolving Systems
Authors: Benoit Morel, Rangaraj Ramanujam
Venue: Organization Science (1999)

This paper examines how organization theory can benefit from advances made in the interdisciplinary field of complex systems theory (CST). Complex systems theory is not so much a single theory as a perspective for conceptualizing and modeling dynamic systems. The field of complexity is described in terms of the characteristics of systems that are typically the subject of its study, the type of analytical tools used by researchers in this field, and the recurring paradigms that characterize this research perspective. The concepts of self-organized criticality and self-organization and their relevance to organizational studies are examined. The potential usefulness of these concepts is illustrated in the context of organizational evolution and social network analysis. An alternative model of organizational evolution, based on biological evolution, is proposed and propositions are developed. Unlike traditional models for organization, this model does not rely on an algorithm of optimization of a fitness function. The problem of self-organization is approached from the viewpoint of random graph theory and is applied to the analysis of social networks. Finally, important issues in using concepts from the field of CST are discussed. It is suggested that the immediate benefits of CST may be as a framework that facilitates conceptual elaborations and encourages formal modeling; both activities may provide fresh and deep insights into organizational phenomena.
The retraction constant in some Banach spaces
Authors: Marco Baronti, Emanuele Casini, Carlo Franchetti
Venue: Journal of Approximation Theory (2003)

We give new sharper estimations for the retraction constant in some Banach spaces.
Women/minorities in computer science: where are they? no attention no retention
Authors: Carol L. Binkerd, Michelle D. Moore
Venue: Journal of Computing Sciences in Colleges (2002)

Lack of women (and other minorities) has been a long-standing situation in the sciences. Socialization and "the shrinking pipeline" are contributory factors. Both of those factors need long-term solutions. In the meantime, there are some solutions that can immediately be implemented that are not terribly costly. For example, supplying escort services so that women can safely come to and from labs and classes is relatively inexpensive. Tighter security benefits all students and faculty. A more difficult solution is for the academic administration to value the time faculty spends with students as highly as the administration values grants and papers. If you don't give the students attention, you won't get retention.
Ontology development as undergraduate research
Authors: Antonio M. Lopez,  Jr.
Venue: Journal of Computing Sciences in Colleges (2002)

Ontology development is a rich area of endeavor for undergraduate research. This paper briefly traces the evolution of ontology development in artificial intelligence (AI), gives some examples of successful applications by AI researchers, and presents arguments as to why ontology development is well suited for undergraduate research.
For Scientific Data Discovery: Why Can't the Archive be More Like the Web?
Authors: Thomas H. Hinke, John A. Rushing, Shalini Kansal, Sara J. Graves, Heggere S. Ranganath
Venue: Proceedings of the Ninth International Conference on Scientific and Statistical Database Management (1997)

This paper addresses the problem of acquiring from scientific data metadata that is descriptive of the actual content of the data. Scientists can use this content-based metadata in subsequent archive searches to find data sets of interest. Such metadata would be especially useful in large scientific archives such as NASA's Earth Observing System Data and Information System (EOSDIS). This paper presents two generic approaches for content-based metadata acquisition: target-dependent and target-independent. Both of these approaches are oriented toward characterizing datasets in terms of the scientific phenomena, such as mesoscale convective systems (severe storms) that they contain. In the target-dependent approach, the archived data is mined for particular phenomena of interest and polygons representing the phenomena are stored in a spatial database where they can be used in the data search process. In the target-independent approach, data is initially mined for deviations from normal and for trends. This data can then be used for subsequent searches for particular transient phenomena using the deviation data, or for phenomena related to trends. The paper describes results from implementing both of these approaches.
Optimal Computation of Shortest Paths on Doubly Convex Bipartite Graphs
Authors: Lin Chen
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

An optimal parallel algorithm for computing all-pair shortest paths on doubly convex bipartite graphs is presented here. Our parallel algorithm runs in O(log n) time with O(n^2 / log n) processors on an EREW PRAM and is time-and-work-optimal. As a by-product, we show that the problem can be solved by a sequential algorithm in O(n^2) time optimally on any adjacency list or matrix representing a doubly convex bipartite graph. The result in this paper improves a recent work on the problem for bipartite permutation graphs, which are properly contained in doubly convex bipartite graphs. 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
Maintaining variance and k-medians over data stream windows
Authors: Brain Babcock, Mayur Datar, Rajeev Motwani, Liadan O'Callaghan
Venue: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2003)

The sliding window model is useful for discounting stale data in data stream applications. In this model, data elements arrive continually and only the most recent N elements are used when answering queries. We present a novel technique for solving two important and related problems in the sliding window model---maintaining variance and maintaining a k--median clustering. Our solution to the problem of maintaining variance provides a continually updated estimate of the variance of the last N values in a data stream with relative error of at most &epsilon; using O(1/&epsilon;2 log N) memory. We present a constant-factor approximation algorithm which maintains an approximate k--median solution for the last N data points using O(k/&tau;4 N2&tau; log2 N) memory, where &tau; < 1/2 is a parameter which trades off the space bound with the approximation factor of O(2O(1/&tau;)).
Wavelength exchange: a novel function for optical networks
Authors: K. K. Y. Wong, M. E. Marhic, K. Uesaka, L. G. Kazovsky
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2003)

Theory shows that with a suitable choice of the wavelengths of two pumps, and two signals about the zero-dispersion wavelength of a fiber, simultaneous unit conversion efficiency from one signal to the other, and vice versa, can be obtained. We have demonstrated near-complete wavelength exchange between two signal wavelengths, with two 200 mW pumps at 1544.94 and 1551.06 nm, in a 1-km-long highly-nonlinear dispersion-shifted fiber. This novel optical phenomenon may provide new functionality for optical networks.
Classes of quadratic assignment problem instances: isomorphism and difficulty measure using a statistical approach
Authors: Nair Maria Maia de Abreu, Paulo Oswaldo Boaventura Netto, Tania Maia Querido, Elizabeth Ferreira Gouvea
Venue: Discrete Applied Mathematics (2002)

In this work, we introduce the variance expression for quadratic assignment problem (QAP) costs. We also define classes of QAP instances, described by a common linear relaxation form. The use of the variance in these classes leads to the study of isomorphism and allows for a definition of a new difficulty index for QAP instances. This index is then compared to a classical measure found in the literature.