ppxscal/embedding_network huggingface dataset:
A decision support system for prescriptive academic advising
Authors: Louis A. Le Blanc, Conway T. Rucks, W. Scott Murray
Venue: Advanced topics in end user computing (2002)

A decision support system (DSS) was constructed to assist the academic advising staff of a college of business. The microcomputer-based system identifies any remaining unsatisfied degree program requirements, selects courses in which the student can enroll and then prioritizes them. Advisors are then able to spend time on more substantive or developmental advising issues, such as choice of electives, career options and life career goals. Using this system, a student with a minimum of computer knowledge can obtain an optimized course listing without the assistance of a human advisor in less than five minutes.A high-end spreadsheet (i.e., DSS generator) permits a workable and effective academic advising DSS. The database is the most significant part of this DSS. And, since the modeling component is difficult to separate from the structure of the data itself, a database management system might be a better choice as the DSS generator. This platform would provide a more flexible user interface as well as superior data handling capability but at some sacrifice in cost and implementation time.A recent development in the management of university and college organizations is the integrated software system, known also as enterprise resource planning (ERP) software. This integrated administrative software for higher education (e.g., CMDS [Computer Management Development Services]), operating on various hardware platforms, provides student advising data for a variety of prototyping and application development tools, such as Powersoft's Infomaker and Microsoft's Access.
Why Wi-Fi wants to be free
Authors: Terry Schmidt, Anthony Townsend
Venue: Communications of the ACM (2003)

As the telecommunications industry wavers, a global grassroots movement is building the next-generation wireless network.
Approximation Algorithms to Solve Real-Life Multicriteria Cutting Stock Problems
Authors: Chengbin Chu, Julien Antonio
Venue: Operations Research (1999)

This paper addresses a real-life unidimensional cutting stock problem. The objective is not only to minimize trim loss, as in traditional cutting stock problems, but also to minimize cutting time. A variety of technical constraints are taken into account. These constraints often arise in the iron and steel cutting industry. Since cutting stock problems are well known to be NP-hard, it is prohibitive to obtain optimal solutions. We develop approximation algorithms for different purposes: quick response algorithms for individual customer requirement planning to build a quotation, and elaborate algorithms to provide a production plan for the next day. These latter algorithms are submitted to less strict computation time limitations. Computational results show that our algorithms improve by 8% the performance of our partner company where the cutting plan had been carried out manually by very experienced people. Numerical comparison for small sized problems shows that these algorithms provide solutions very close to optimal. These algorithms have been implemented in the company.
Fast Nearest-Neighbor Query Processing in Moving-Object Databases
Authors: K. Raptopoulou, A. N. Papadopoulos, Y. Manolopoulos
Venue: Geoinformatica (2003)

A desirable feature in spatio-temporal databases is the ability to answer future queries, based on the current data characteristics (reference position and velocity vector). Given a moving query and a set of moving objects, a future query asks for the set of objects that satisfy the query in a given time interval. The difficulty in such a case is that both the query and the data objects change positions continuously, and therefore we can not rely on a given fixed reference position to determine the answer. Existing techniques are either based on sampling, or on repetitive application of time-parameterized queries in order to provide the answer. In this paper we develop an efficient method in order to process nearest-neighbor queries in moving-object databases. The basic advantage of the proposed approach is that only one query is issued per time interval. The time-parameterized R-tree structure is used to index the moving objects. An extensive performance evaluation, based on CPU and I/O time, shows that significant improvements are achieved compared to existing techniques.
On the efficacy of quality, frame rate, and buffer management for video streaming across best-effort networks
Authors: Wu-chi Feng
Venue: Journal of High Speed Networks (2002)

In this paper, we propose a mechanism that supports the high quality streaming and adaptation of stored, constant-quality video across best-effort networks. The difficulty in the delivery of such traffic over best-effort networks is the fact that both the bandwidth required from the stream and the bandwidth available across the network vary considerably over time. Our proposed approach has a number of useful features. First, it uses the a priori information from the video stream to drive that adaptation policy. Second, it does not rely on any special handling or support from the network itself, although any additional support from the network will indirectly help increase the video quality. Third, it can be built on top of TCP, which effectively separates the adaptation and streaming from the transport protocol. This makes the question of TCP-friendliness much easier to answer. Using actual MPEG encoded video data at multiple qualities, we show through experimentation that this approach provides a viable alternative for streaming media across best-effort networks.
Xerox's Approach to Sustainability
Authors: Irina Maslennikova, David Foley
Venue: Interfaces (2000)

Xerox's environmental strategic goal is to become a waste-free company. This ideal permeates the life cycle of Xerox products: waste-free products from waste-free factories for waste-free offices. Xerox has witnessed numerous benefits from implementing this strategy; by using design-for-the-environment principles, it has redesigned products and packaging to support product recovery and to reduce resource and energy consumption. Implementation of an end-of-life equipment takeback and reprocessing program led to savings of over $80 million in Europe in 1997, in addition to turning a potential disposal cost into a revenue stream. Through its environmental leadership program, Xerox has evolved a win-win-win scenario: improvements in environmental performance (win), customer satisfaction (win), and improved company performance (win).
Constructing complete tables of quartic fields using Kummer theory
Authors: Henri Cohen, Francisco Diaz Y Diaz, Michel Olivier
Venue: Mathematics of Computation (2003)

We explain how to construct tables of quartic fields of discriminant less than or equal to a given bound in an efficient manner using Kummer theory, instead of the traditional (and much less efficient) method using the geometry of numbers. As an application, we describe the computation of quartic fields of discriminant up to 107, the corresponding table being available by anonymous ftp.
Note on Parallel Machine Scheduling with Batch Setup Times
Authors: Paul A. Brinkley, David Stepto, Kristopher R. Haag, John Folger, Kui Wang, Kuanlian Liou, W. David Carr, Erling Moxnes, Scott Webster
Venue: Operations Research (1998)

Cheng and Chen (1994) use a high-multiplicity encoding scheme to prove binary NP-hardness of a scheduling problem. From this they infer a similar result for a well-known, more general problem. We explain that, although their initial proof is correct, their inference about the more general problem is not.
Beyond mere convergence
Authors: James A. Sellers
Venue: PRIMUS: problems, resources, and issues in mathematics undergraduate studies (2002)

In this article, I suggest that calculus instruction should include a wider variety of examples of convergent and divergent series than is usually demonstrated. In particular, a number of convergent series, such as, Σk ≥ 1k3/2k are considered, and their exact values are found in a straightforward manner. We explore and utilize a number of mathematical topics, including manipulation of certain power series and recurrences.
Cluster computing with message-passing interface
Authors: D. J. Evans, M. Y. Saman
Venue: Highly parallel computaions: algorithms and applications (2001)

The message-passing interface is a program library that allows a group of computers in a network to be specified as a Distributed-Memory System or a Cluster System. It provides the routines for task activations and communications. Writing programs for the cluster systems is a difficult task. However, the Message Passing Interface has simplified the task and presents a convenient way to program the systems. In this chapter, issues on the cluster systems are discussed and parallel programming with the message-passing interface is presented. Program solutions using the WMPI1.3, a version of MPI, to solve the Pi (π) calculation, the matrix-vector calculation, the sorting algorithm using Quicksort and the Torsion problem are presented. The programs are written and compiled in Microsoft Visual C++ version 6.
On the transition graphs of Turing machines
Authors: Didier Caucal
Venue: Theoretical Computer Science (2003)

As for pushdown automata, we consider labelled Turing machines with ε-rules. With any Turing machine M and with a rational set C of configurations, we associate the restriction to C of the ε-closure of the transition set of M. We get the same family of graphs by using the labelled word rewriting systems. We show that this family is the set of graphs obtained from the binary tree by applying an inverse mapping into F followed by a rational restriction, where F is any family of recursively enumerable languages containing the rational closure of all linear languages. We show also that this family is obtained from the rational graphs by inverse rational mappings. Finally we show that this family is also the set of graphs recognized by (unlabelled) Turing machines with labelled final states, and even if we restrict to deterministic Turing machines.
A conversation with Herbert R.J. Grosch
Authors: Ubiquity staff
Venue: Ubiquity (2001)

Reflections on the early days of computing, the importance of standards, and The Old Man.
Threshold Utility, Choice, and Binary Relations
Authors: F. T. Aleskerov
Venue: Automation and Remote Control (2003)

Representation of the binary relations and choice functions by the utility functions was considered. The results of utility maximization were presented for the classical case of no comparison threshold and with a threshold depending on one alternative. Models were constructed where the threshold depends on two compared alternatives and/or admissible set of alternatives. A model of choice describing H.A. Simon's concept of choice was proposed and considered. The class of binary relations of partial order and its subclasses were studied. Some new classes of binary relations such as weak biorders and simple and simplest semiorders were constructed, and their representations by the threshold utility function were determined.
The U.S. Army National Guard's Mobile Training Simulators Location and Routing Problem
Authors: Katta G. Murty, Philipp A. Djang
Venue: Operations Research (1999)

For training National Guard units, the U.S. Army National Guard will field 21 combat vehicle training simulators called mobile trainers. Each National Guard unit must train at a station that is not farther than a specified maximum travel distance from its armory. We address the problem of finding: the optimum locations for the home bases for the mobile trainers; the locations of secondary training sites to which the mobile trainers will travel to provide training; and the actual routes that the mobile trainers will take to cover all these secondary training sites. The aim is to allocate each National Guard unit to a training site within the maximum travel distance from its armory, while simultaneously minimizing the mobile trainer fleet mileage and the total distance traveled by all units. The problem is too large and complex to solve as a single model. We apply a heuristic decomposition strategy to break the overall probl em into manageable stages, developing suitable substitute objective functions for each. This approach led to a solution in which the mobile trainer fleet mileage is 72,850 miles per year: about 70% smaller than the 231,000 miles per year in the original Army's procurement plan. Our solution has been implemented (with minor modifications) by the Army.
Simple Procedures for Selecting the Best Simulated System When the Number of Alternatives is Large
Authors: Barry L. Nelson, Julie Swann, David Goldsman, Wheyming Song
Venue: Operations Research (2001)

In this paper, we address the problem of finding the simulated system with the best (maximum or minimum) expected performance when the number of alternatives is finite, but large enough that ranking-and-selection (R&S) procedures may require too much computation to be practical. Our approach is to use the data provided by the first stage of sampling in an R&S procedure to screen out alternatives that are not competitive, and thereby avoid the (typically much larger) second-stage sample for these systems. Our procedures represent a compromise between standard R&S procedures--which are easy to implement, but can be computationally inefficient--and fully sequential procedures--which can be statistically efficient, but are more difficult to implement and depend on more restrictive assumptions. We present a general theory for constructing combined screening and indifference-zone selection procedures, several specific procedures and a portion of an extensive empirical evaluation.
A Tandem Queue with a Gate Mechanism
Authors: Zbigniew Palmowski, Sabine Schlegel, Onno Boxma
Venue: Queueing Systems: Theory and Applications (2003)

Inspired by a problem regarding cable access networks, we consider a two station tandem queue with Poisson arrivals. At station 1 we operate a gate mechanism, leading to batch arrivals at station 2. Upon arrival at station 1, customers join a queue in front of a gate. Whenever all customers present at the service area of station 1 have received service, the gate before as well as a gate behind the service facility open. Customers leave the service area and enter station 2 (as a batch), while all customers waiting at the gate in front of station 1 are admitted into the service area. For station 1 we analyse the batch size and the time between two successive gate openings, as well as waiting and sojourn times of individual customers for different service disciplines. For station 2, we investigate waiting times of batch customers, where we allow that service times may depend on the size of the batch and also on the interarrival time. In the analysis we use Wiener&ndash;Hopf factorization techniques for Markov modulated random walks.
An M/G/1 queue with multiple types of feedback, gated vacations and FCFS policy
Authors: Bong Dae Choi, Bara Kim, Sung Ho Choi
Venue: Computers and Operations Research (2003)

We consider an M/G/1 queueing system with multiple types of feedback, gated vacations and FCFS policy where the first service of a new customer is either successful (and then the customer leaves the system) or unsuccessful (and then the customer joins to the end of the queue for another service as old customer with different Bernoulli feedback parameter and different service distribution), and customers are served in the order of joining the tail of the queue. By applying a new method developed by authors (Queueing system with fixed feedback policy, J. Aust. Math. Soc. B, to appear, Comput. Oper. Res. 27 (2000) 269) we obtain joint probability generating function of system sizes of new and old customers at steady state and Laplace Stieltjes transform of total response time. We also give algorithms for calculation of moments of system size and total response time.
Cultural usability: a localization study of mobile text messaging use
Authors: Huatong Sun
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

The success of mobile text messaging poses many questions for usability studies. Considering the inherent usability weaknesses of mobile phones such as the small display, poor input methods, the moving environment, and noisy surroundings, this success is hard to explain with traditional usability theories that ignore the social-cultural context. A new model -- cultural usability -- is proposed for studying the intriguing processes of how cultural factors and contextual issues affect the consumption of mobile text messaging in contexts of use.
Electronic Trading and Work Transformation in the London Insurance Market
Authors: Michael Barrett, Geoff Walsham
Venue: Information Systems Research (1999)

The integration of information and communications technologies (IT) is playing a key role in transforming the nature of work. The link between IT and tra nsformation is poorly understood, and further theoretical developments are needed to advance our current knowledge of this relationship. In this paper, we develop a conceptual scheme by drawing on and extending Giddens' social theory of transformation that relates changes in modern institutions to shifts in self-identity. We illustrate the value of these ideas in making sense of the introduction of an electronic trading system, LIMNET EPS, across the London Insurance Market. Furthermore, our case analyses suggest some practical implications on electronic trading and work transformation.
Human cognition of complex thought patterns
Authors: Harry M. Sneed
Venue: Acta Cybernetica (2002)

How much is our perception of the present determined by our experience of the past?
A non-reflecting boundary for analyzing wave propagation using the finite element method
Authors: G. R. Liu, S. S. Quek Jerry
Venue: Finite Elements in Analysis and Design (2003)

A finite element approach for the analysis of the wave propagation in an infinitely long plate is presented in this paper. The method of achieving a non-reflecting boundary condition such that there will be no spurious reflections generated by the finite boundary of the finite element model will be introduced. The method is used to study the steady-state wave propagation characteristics across a plate structure with and without flaws. The proposed method compared very well with the strip element method, which is a semi-exact method for wave propagation analysis.
Problems in simulating social reality: observations on a MUD construction
Authors: Holin Lin, Chuen-Tsai Sum
Venue: Simulation and Gaming (2003)

The authors look at computer-mediated simulation as an approach to studying social science issues and discuss its limitations, with the design process for a Multiple-User Dungeon (MUD) game serving as a context. Using data gleaned from interviews with the MUD designers, the authors present three findings: (a) fun is a key difference between simulations and reality, because a MUD user can always walk away from a game that is not fun but cannot walk away from difficult real-life situations; (b) simulated social systems require time and commitment from a fairly large population, which conflicts with the typical level of patience observed in most computer game players; and (c) the roles of technicians and designers as mediators in simulated social environments is an area requiring detailed study, because their attitudes toward technical constraints, social values, and stereotypes exert a strong influence on the appearance of their flnal products.
On condition numbers in hp-FEM with Gauss-Lobatto-based shape functions
Authors: J. M. Melenk
Venue: Journal of Computational and Applied Mathematics (2002)

Sharp bounds on the condition number of stiffness matrices arising in hp/spectral discretizations for two-dimensional problems elliptic problems are given. Two types of shape functions that are based on Lagrange interpolation polynomials in the Gauss-Lobatto points are considered. These shape functions result in condition numbers O(p) and O(p ln p) for the condensed stiffness matrices, where p is the polynomial degree employed. Locally refined meshes are analyzed. For the discretization of Dirichlet problems on meshes that are refined geometrically toward singularities, the conditioning of the stiffness matrix is shown to be independent of the number of layers of geometric refinement.
The universal embedding dimension of the binary symplectic dual polar space
Authors: A. Blokhuis, A. E. Brouwer
Venue: Discrete Mathematics (2003)

The universal embedding dimension of the binary symplectic dual polar space DSp(2d,2) equals (2d + 1)(2d-1 + 1)/3. This settles an old conjecture.
Intelligent system design using artificial neural networks for automatic semantic units extraction in medical literature
Authors: Clara Pérez
Venue: Second international workshop on Intelligent systems design and application (2002)

This paper presents a neural network-based system to extract semantic units in text medical documents. Semantic units contribute to a better indexing and therefore characterization of the dataset making easy the access to the knowledge contained in a medical database. Our aim is to extract semantic units defined by sets of words, since there is usually an element of meaning added to the combination. These items, also known as multiword expressions or complex concepts, consist of two or more words that correspond to some conventional way of saying things [1]. When doctors search information about a knowledge item, the subject is usually described by a set of words; this is what we call semantic unit.
A one-parameter quadratic-base version of the Baillie-PSW probable prime test
Authors: Zhenxiang Zhang
Venue: Mathematics of Computation (2002)

The well-known Baillie-PSW probable prime test is a combination of a Rabin-Miller test and a "true" (i.e., with (D/n) = -1) Lucas test. Arnault mentioned in a recent paper that no precise result is known about its probability Of error. Grantham recently provided a probable prime test (RQFT) with probability of error less than 1/7710, and pointed out that the lack of counter-examples to the Baillie-PSW test indicates that the true probability of error may be much lower.In this paper we first define pseudoprimes and strong pseudoprimes to quadratic bases with one parameter: Tu = T mod (T2 - uT + 1), and define the base-counting functions: B(n) : #{u: 0 ≤ u < n, n is a psp(Tu)} and SB(n) : #{u: 0 ≤ u < n, n is an spsp(Tu)}. Then we give explicit formulas to compute B(n) and SB(n), and prove that, for odd composites n, B(n) < n/2 and SB(n) < n/8, and point out that these are best possible. Finally, based on one-parameter quadratic-base pseudoprimes, we provide a probable prime test, called the One-Parameter Quadratic-Base Test (OPQBT), which passed by all primes ≥ 5 and passed by an odd composite n = p1r1 P2r2 ...Psrs (P1 < P2 < .... < Ps odd primes) with probability of error τ (n). We give explicit formulas to compute τ(n), and prove that τ(n) < {1/n4/3, for n nonsquare free with s = 1; 1/n2/3, for n square free with s = 2; 1/n2/7, for n square free with s = 3; 1/8s-4.166(p1+1), for n square free with s even ≥ 4; 1/16s-5.119726, for n square free with s odd ≥ 5; 1/4s Πi=1s 1/pi2(ri-1), otherwise, i.e., for n nonsquare free with s ≥ 2. The running time of the OPQBT is asymptotically 4 times that of a Rabin-Miller test for worst cases, but twice that of a Rabin-Miller test for most composites. We point out that the OPQBT has clear finite group (field) structure and nice symmetry, and is indeed a more general and strict version of the Baillie-PSW test. Comparisons with Gantham's RQFT are given.