ppxscal/embedding_network huggingface dataset:
An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows
Authors: Gilles Pesant, Michel Gendreau, Jean-Yves Potvin, Jean-Marc Rousseau
Venue: Transportation Science (1998)

This paper presents a constraint logic programming model for the traveling salesman problem with time windows which yields an exact branch-and-bound optimization algorithm without any restrictive assumption on the time windows. Unlike dynamic programmi ng approaches whose performance relies heavily on the degree of discretization applied to the data, our algorithm does not suffer from such space-complexity issues. The data-driven mechanism at its core more fully exploits pruning rules developed in opera tions research by using them not only a priori but also dynamically during the search. Computational results are reported and comparisons are made with both exact and heuristic algorithms. On Solomon's well-known test bed, our algorithm is instrumental in achieving new best solutions for some of the problems in set RC2 and strengthens the presumption of optimality for the best known solutions to the problems in set C2.m
A State-based Dynamic Location Management Scheme
Authors: Cao Peng, Cai Bin, Yang Xuejun, Huang Zailu
Venue: Wireless Personal Communications: An International Journal (2003)

We consider a state-based dynamic location management scheme, in which the user is partitioned into different mobility state set, and his location area size is changed dynamically corresponding to the state set that he belongs to. Comparing with the fixed LA scheme, numerical experiment result shows its performance can be improved by 30% while the current location and paging procedure can still be applied. Besides, as this scheme does not need to process complicated user information, the requirement of computing power can be decreased significantly in compare with the user-based schemes. Our scheme can be used in current 2G mobile systems (such as GSM, CDMA) and the Third Generation (3G) mobile systems with slightly modification of the equipment software.
Worst-case performance analysis of parallel, communicating software processes
Authors: A. Siebenborn, O. Bringmann, W. Rosenstiel
Venue: Proceedings of the tenth international symposium on Hardware/software codesign (2002)

In this paper we present a method to perform static timing analysis of SystemC models, that describe parallel, communicating software processes. The paper combines a worst-case execution time (WCET) analysis with an analysis of the communication behavior. The communication analysis allows the detection of points, where the program flow of two or more concurrent processes are synchronized. This knowledge allows the determination of the worst-case response time (WCRT). The method does not rely on restrictions on the system design to prevent deadlocks or data loss. Furthermore possible deadlocks and data loss can be detected during the analysis.
A method of numerical conformal mapping of curved slit domains by the charge simulation method
Authors: Dai Okano, Hidenori Ogata, Kaname Amano
Venue: Journal of Computational and Applied Mathematics (2003)

In this paper, we propose a method of numerical conformal mappings from a domain with a curved slit onto the canonical slit domains. Our method is based on Amano's method, which uses the charge simulation method as a rapid solver for potential problems. Due to the potential solver, his method gives high accuracy in many cases. The basic idea of the preceding method is to provide an approximation of harmonic functions by a linear combination of the complex logarithmic functions, g(z)= ΣjQj log(z - ζj), where the singularity points ζj are placed outside the problem domain. However, there are some difficulties on applying it to the problem domain with corners on the boundary, and the problem domain without enough space to place the singularity points properly. The problem domain with a curved slit is a typical example of such a difficulty. A technique we provide here is based on use of the Joukowski transformation. It inherits all the good properties of the original method. We show the effectiveness of our proposal by some numerical examples.
The programming model of ASSIST, an environment for parallel and distributed portable applications
Authors: Marco Vanneschi
Venue: Parallel Computing (2002)

A software development system based upon integrated skeleton technology (ASSIST) is a proposal of a new programming environment oriented to the development of parallel and distributed high-performance applications according to a unified approach. The main goals are: high-level programmability and software productivity for complex multidisciplinary applications, including data-intensive and interactive software; performance portability across different platforms, in particular large-scale platforms and grids; effective reuse of parallel software; efficient evolution of applications through versions that scale according to the underlying technologies.The purpose of this paper is to show the principles of the proposed approach in terms of the programming model (successive papers will deal with the environment implementation and with performance evaluation). The features and the characteristics of the ASSIST programming model are described according to an operational semantics style and using examples to drive the presentation, to show the expressive power and to discuss the research issues.According to our previous experience in structured parallel programming, in ASSIST we wish to overcome some limitations of the classical skeletons approach to improve generality and flexibility, expressive power and efficiency for irregular, dynamic and interactive applications, as well as for complex combinations of task and data parallelism. A new paradigm, called "parallel module" (parmod) is defined which, in addition to expressing the semantics of several skeletons as particular cases, is able to express more general parallel and distributed program structures, including both data-flow and nondeterministic reactive computations. ASSIST allows the programmer to design the applications in the form of generic graphs of parallel components. Another distinguishing feature is that ASSIST modules are able to utilize external objects, including shared data structures and abstract objects (e.g. CORBA), with standard interfacing mechanisms. In turn, an ASSIST application can be reused and exported as a component for other applications, possibly expressed in different formalisms.
A magic pot: self-assembly computation revisited
Authors: Takashi Yokomori, Yasubumi Sakakibara, Satoshi Kobayashi
Venue: Formal and natural computing (2002)

Molecular computing is a novel computing paradigm recently emerged from groundbreaking wet lab experiments by Adleman in 1994. His experimental work marks a potential capability and feasibility of "one pot" computing with molecules for solving hard problems of practical size.This paper concerns a molecular computing paradigm based on "self-assembly" and "screening mechanism". After a brief getting back to and reviewing Adleman's original work, we propose a new molecular implementation method based on length-only encoding, which leads us to much simpler molecular implementation techniques to solve graph problems.With two examples, we demonstrate the effectiveness of the molecular implementation method for one pot computing based on self-assembly: one is Nondeterministic Finite Automaton Pot and the other Hamiltonian Path Problem Pot.
A contextual inquiry of expert programmers in an event-based programming environment
Authors: Andrew Jensen Ko
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

Event-based programming has been studied little, yet recent work suggests that language paradigm can predict programming strategies and performance. A contextual inquiry of four expert programmers using the Alice 3D programming environment was performed in order to discover how event-based programming strategies might be supported in programming environments. Various programming, testing, and debugging breakdowns were extracted from observations and possible programming environment tools are suggested as aids to avoid these breakdowns. Future analyses and studies are described.
Benchmarks of the Efficiency of Bank Branches
Authors: Christiana V. Zenios, Stavros A. Zenios, Kostas Agatholeous, Andreas C. Soteriou
Venue: Interfaces (1999)

The Bank of Cyprus commissioned a study of the efficiency penalties paid by its branches operating in different environments. Bank staff and faculty members of the University of Cyprus jointly developed a data envelopment analysis (DEA) model that was used (1) to provide benchmarks on the relative efficiency of the bank's branches, (2) to provide guidelines for improvement to management, and (3) to isolate the effects of the environment on branch efficiency. The analys is showed that tourist branches were on average more efficient than urban branches during the peak tourist season. The DEA model was also used to benchmark seasonality effects. The analysis revealed branch resource under utilization, which depends on the season. The bank uses the DEA model developed to establish policy guidelines and to provide support for operational decisions toward performance improvement.
Fredholm-Volterra integral equation in contact problem
Authors: M. A. Abdou, Osama L. Moustafa
Venue: Applied Mathematics and Computation (2003)

In this work, the solution of the integral equation of the mixed type in the domain Ω = {(x,y,z) ∈ Ω: - ∞ < x,y < ∞, -∞ < z < 0} is obtained in the space L2(Ω) * C(0,T), where t is the time, 0 ≤t≤T < ∞, in a series form. Also, the solution of Wiener-Hopf integral equation of the second kind with Macdonald kernel is also obtained, and the convergence of the solution is discussed. Finally a numerical example is given.
BEM simulation of groundwater contamination remediation
Authors: V. Popov, H. Power
Venue: Development and application of computer techniques to environmental studies (2002)

In this work computer simulation is used to compare results of long-term remedial process of aquifer. The case studies presented show that by using computer simulation a clear picture of the results of different approaches can be obtained. This could help in choosing the right approach for each individual case.
Implementing and Evaluating Silverscreener: a Marketing Management Support System for Movie Exhibitors
Authors: Jehoshua Eliashberg, Sanjeev Swami, Charles B. Weinberg, Berend Wierenga
Venue: Interfaces (2001)

Every Monday morning, PatheÂ´ Theaters in the Netherlands decides which movies in its cinemas to retain and which to replace. It must choose replacement movies from those available at that time. We implemented the SilverScreener model, a mathematical-programming system [Swami, Eliashberg, and Weinberg 1999] to help PatheÂ´ managers make those decisions for one six-screen theater and tested its performance against the performance of two unaided similar multiscreen cinemas. Using PatheÂ´'s historical data, managerial judgment, and theater-specific factors, we developed an attendance-forecasting system. While a fully controlled experiment was not possible, the revenues at the theater using the SilverScreener recommendations were higher than those at the two comparable theaters. Managerial attitudes towards the modeling system improved after implementation of SilverScreener.
Linear quintuple-product identities
Authors: Richard Blecksmith, John Brillhart
Venue: Mathematics of Computation (2003)

In the first part of this paper, series and product representations of four single-variable triple products T0, T1, T2, T3 and four single-variable quintuple products Q0, Q1, Q2, Q3 are defined. Reduced forms and reduction formulas for these eight functions are given, along with formulas which connect them. The second part of the paper contains a systematic computer search for linear trinomial Q identities. The complete set of such families is found to consist of two 2-parameter families, which are proved using the formulas in the first part of the paper.
Mellin transforms for some families of q-polynomials
Authors: Renato Álvarez-Nodarse, M. K. Atakishiyeva, N. M. Atakishiyev
Venue: Journal of Computational and Applied Mathematics (2003)

By using Ramanujan's q-extension of the Euler integral representation for the gamma function, we derive the Mellin integral transforms for the families of the discrete q-Hermite II, the Al-Salam-Carlitz II, the big q-Laguerre, the big q-Legendre, the big q-Jacobi and the q-Hahn polynomials.
A language for multiple models of computation
Authors: Dag Björklund, Johan Lilius
Venue: Proceedings of the tenth international symposium on Hardware/software codesign (2002)

We introduce a new kernel language for modeling hardware/software systems, adopting multiple heterogenous models of computation. The language has formal operational semantics, and is well suited for model checking, code synthesis etc. For different blocks of code, different scheduling policies can be applied, to reflect the different interpretations of e.g. parallelism in different models of computation. The user can add his own scheduling policies, to use or explore different models of computation.
Integral Polyhedra Related to Even-Cycle and Even-Cut Matroids
Authors: Andrew A. King, Christopher L. Tucci, Srinagesh Gavirneni, Lode Li, Bertrand Guenin
Venue: Mathematics of Operations Research (2002)

A family of sets H is ideal if the polyhedron [math not displayed] is integral. Consider a graph G with vertices s, t. An odd st-walk is either an odd st-path or the union of an even st-path and an odd circuit that share, at most, one vertex. Let T be a subset of vertices of even cardinality. An st-T-cut is a cut of the form &#948;(U)where [math not displayed] is odd and U contains exactly one of s or t. We give excluded minor characterizations for when the families of odd st-walks and st-T-cuts (represented as sets of edges) are ideal. As a corollary, we characterize which extensions and coextensions of graphic and cographic matroids are 1-flowing.
Some properties of recognizable L-subsets
Authors: Nami Kobayashi
Venue: Theoretical Computer Science (2003)

We study some properties of recognizable L-subsets of A* and its subfamilies: the simple L-subsets, the limited L-subsets, the recognizable M-subsets, the simple M-subsets and the M-subsets which are nondeterministic complexities of finite automata. At first, we study some necessary conditions for membership in each one of these families and after we investigate the closure properties of these families under several operations. We also study the relations existing among some subfamilies of recognizable M-subsets and the families Hp (p ≥ 0) obtained by Simon.
Some conjectures on primes (II)
Authors: Maohua Le
Venue: Smarandache Notions Journal (2002)

For any positive integer n, let pn be the nth prime. In this paper we give a counter-example for the inequality exp(√(n+1)/pn+1)/exp(√pn/n)>exp(√3/5)/exp(√3/2).
TREEZ - An educational data structures game
Authors: Charles Wesley Ford,  Jr., Steven Minsker
Venue: Journal of Computing Sciences in Colleges (2003)

TREEZ is a planned educational software package in computer-game format. It is intended to reinforce knowledge of tree traversal techniques and to compare and contrast iterative and recursive traversal algorithms. This paper presents a description of the game, its design methodology, its underlying algorithms, implementation details, possible variations, and future enhancements.
Blocking nonorientability of a surface
Authors: Bojan Mohar, Alexander Schrijver
Venue: Journal of Combinatorial Theory Series B (2003)

Let S be a nonorientable surface. A collection of pairwise noncrossing simple closed curves in S is a blockage if every one-sided simple closed curve in S crosses at least one of them. Robertson and Thomas [9] conjectured that the orientable genus of any graph G embedded in S with sufficiently large face-width is "'roughly" equal to one-half of the minimum number of intersections of a blockage with the graph. The conjecture was disproved by Mohar (Discrete Math. 182 (1998) 245) and replaced by a similar one. In this paper, it is proved that the conjectures in Mohar (1998) and Robertson and Thomas (J. Graph Theory 15 (1991) 407) hold up to a constant error term: For any graph G embedded in S, the orientable genus of G differs from the conjectured value at most by O(g2), where g is the genus of S.
Knowledge Discovery in an Earthquake Text Database: Correlation between Significant Earthquakes and the Time of Day
Authors: Jeffrey A. Goldman, Douglas Stott Parker,  Jr., Wesley W. Chu
Venue: Proceedings of the Ninth International Conference on Scientific and Statistical Database Management (1997)

In this paper, we take a real world application from a text database and present a case history. The techniques ultimately led to a discovery contradicting an accepted paradigm in seismology. Using simple, tailored, keyword extraction, we examined a text collection of earthquake data. A discovery was made when an unusual pattern emerged from the text. We then tested a more comprehensive numerical database, treating the the text discovery as a hypothesis. It was verified using a standard chi-square statistic. The hypothesis was significant earthquakes in the longitude regions that include California, occur more often in the morning hours than any other time of day.
Partitioning into graphs with only small components
Authors: Noga Alon, Guoli Ding, Bogdan Oporowski, Dirk Vertigan
Venue: Journal of Combinatorial Theory Series B (2003)

The paper presents several results on edge partitions and vertex partitions of graphs into graphs with bounded size components. We show that every graph of bounded tree-width and bounded maximum degree admits such partitions. We also show that an arbitrary graph of maximum degree four has a vertex partition into two graphs, each of which has components on at most 57 vertices. Some generalizations of the last result are also discussed.
Construction of recurrences for the coefficients of expansions inq-classical orthogonal polynomials
Authors: Stanislaw Lewanowicz
Venue: Journal of Computational and Applied Mathematics (2003)

An algorithmic approach is given to construct recurrence relations for the coefficients of the series expansion of a solution of a linear q-difference equation in q-classical orthogonal polynomials (in the Hahn's sense).
Relaxed Annihilation-Reordering Look-Ahead QRD-RLS Adaptive Filters
Authors: Lijun Gao, Keshab K. Parhi, Jun Ma
Venue: Journal of VLSI Signal Processing Systems (2003)

The optimum architecture design and mapping of QRD-RLS adaptive filters can be achieved through filter architecture selections, look-ahead transformations, and hierarchical pipelining/folding transformations. In this paper, a relaxed annihilation-reordering look-ahead (RARL) architecture is proposed, and shown to be more power and area efficient than pipelined processing architecture which was considered the most area efficient. The filters with this architecture are based on relaxed weight-update through filtering approximation, where a filter tap weight is updated upon arrival of every block of input data, and are speeded up with annihilation-reordering look-ahead transformation. As a result of the computational complexity reduction, this architecture does not change the iteration bound and filter clock frequency, and leads to speed up with linear increase in power consumption, while the pipelined processing architectures result in speedup with quadratic increase in power consumption. Upon hardware mapping, this architecture is also more advantageous to achieve low area designs. Two design examples are presented to illustrate mapping optimization using above transformations. These results are important for mapping designs onto ASICs, FPGAs or parallel computing machines. The results show significant improvements in throughput, power consumption and hardware requirement. It is also interesting to show through mathematics and simulations that the RARL QRD-RLS filters have no performance degradation in terms of convergence rate.
Planar G2 Hermite interpolation with some fair, C-shaped curves
Authors: D. S. Meek, D. J. Walton
Venue: Journal of Computational and Applied Mathematics (2002)

G2 Hermite data consists of two points, two unit tangent vectors at those points, and two signed curvatures at those points. The planar G2 Hermite interpolation problem is to find a planar curve matching planar G2 Hermite data. In this paper, a C-shaped interpolating curve made of one or two spirals is sought. Such a curve is considered fair because it comprises a small number of spirals. The C-shaped curve used here is made by joining a circular arc and a conic in a G2 manner. A curve of this type that matches given G2 Hermite data can be found by solving a quadratic equation. The new curve is compared to the cubic Bézier curve and to a curve made from a G2 join of a pair of quadratics. The new curve covers a much larger range of the G2 Hermite data that can be matched by a C-shaped curve of one or two spirals than those curves cover.
Partitioning the boolean lattice into a minimal number of chains of relatively uniform size
Authors: Tim Hsu, Mark J. Logan, Shahriar Shahriari, Christopher Towse
Venue: European Journal of Combinatorics (2003)

Let 2[n] denote the Boolean lattice of order n, that is, the poset of subsets of {1,..., n} ordered by inclusion. Extending our previous work on a question of Füredi, we show that for any c > 1, there exist functions e(n) ∼ √n/2 and f(n)∼ c√n log n and an integer N (depending only on c) such that for all n < N, there is a chain decomposition of the Boolean lattice 2[n] into (n ⌊n/2⌋) chains, all of which have size between e(n) and f(n). (A positive answer to Füredi's question would imply that the same result holds for some e(n) ∼ √π/2 √n and f(n) = e(n) + 1.) The main tool used is an apparently new observation about rank-collection in normalized matching (LYM) posets.