ppxscal/embedding_network huggingface dataset:
Adaptive Ordering and Pricing for Perishable Products
Authors: Apostolos N. Burnetas, Craig E. Smith
Venue: Operations Research (2000)

We consider the combined problem of pricing and ordering for a perishable product with unknown demand distribution and censored demand observations resulting from lost sales, faced by a monopolistic retailer. We develop an adaptive pricing and ordering policy with the asymptotic property that the average realized profit per period converges with probability one to the optimal value under complete information on the distribution. The pricing mechanism is modeled as a multiarmed bandit problem, while the order quantity decision, made after the price level is established, is based on a stochastic approximation procedure with multiplicative updates.
Siting a Fire Station by Leveraging Soft Constraints and Supporting Science
Authors: Richard L. Hewitt
Venue: Interfaces (2002)

Gaining acceptance for the location of a new fire station depends on more than the minimization-of-response-time data. In this case, the technical solution took a back seat to political, interpersonal, and perception-based issues. Fourteen years ago I became a firefighter to learn how those issues affect the acceptance of a new location and, in the process, developed a fire-station-siting method that is still used today by the City and County of Denver. I did this work while I was a student in Gene Woolsey's operations research guild at the Colorado School of Mines.
The pseudo-Smarandache function
Authors: David Gorski
Venue: Smarandache Notions Journal (2002)

The Pseudo-Smarandache Function is part of number theory. The function comes from the Smarandache Function. The Pseudo-Smarandache Function is represented by Z(n) where n represents any natural number. The value for a given Z(n) is the smallest integer such that 1+2+3+... + Z(n) is divisible by n. Within the Pseudo-Smarandache Function, there are several formulas which make it easier to find the Z(n) values.Formulas have been developed for most numbers including: a) p, where p equals a prime number greater than two; b) b, where p equals a prime number, x equals a natural number, and b=-px; c) x, where x equals a natural number, if x/2 equals an odd number greater than two; d) x, where x equals a natural number, if x/3 equals a prime number greater than three. Therefore, formulas exist in the Pseudo-Smarandache Function for all values of b except for the following: a) x, where x = a natural number, if x/3 = a nonprime number whose factorization is not 3x; b) multiples of four that are not powers of two. All of these formulas are proven, and their use greatly reduces the effort needed to find Z(n) values.
Database Design and Development: An Essential Guide for IT Professionals, 1 edition
Authors: Paulraj Ponniah
Venue:  (2003)

:Today all enterprises, from retail stores to financial institutions, manufacturing to government departments, depend on their databases to provide the crucial information essential to running their businesses. Databases are central for the rapidly growing and maturing electronic commerce. This reference gives the Information Technology professional a basic understanding of database design and development, covering the fundamentals and laying a solid foundation for one's move to specialization in the database field.
Distribution-sensitive algorithms
Authors: Sandeep Sen, Neelima Gupta
Venue: Nordic Journal of Computing (1999)

We investigate a new paradigm of algorithm design for geometric problems that can be termed distribution-sensitive. Our notion of distribution is more combinatorial in nature than spatial. We illustrate this on problems like planar-hulls and 2D-maxima where some of the previously known output-sensitive algorithms are recast in this setting. In a number of cases, the distribution-sensitive analysis yields superior results for the above problems. Moreover these bounds are shown to be tight in the linear decision tree model.Our approach owes its spirit to the results known for sorting multisets and we exploit this relationship further to derive fast and efficient parallel algorithms for sorting multisets along with the geometric problems.
Euler Spiral for Shape Completion
Authors: Benjamin B. Kimia, Ilana Frankel, Ana-Maria Popescu
Venue: International Journal of Computer Vision (2003)

In this paper we address the curve completion problem, e.g., the geometric continuation of boundaries of objects which are temporarily interrupted by occlusion. Also known as the gap completion or shape completion problem, this problem is a significant element of perceptual grouping of edge elements and has been approached by using cubic splines or biarcs which minimize total curvature squared (elastica), as motivated by a physical analogy. Our approach is motivated by railroad design methods of the early 1900's which connect two rail segments by &ldquo;transition curves&rdquo;, and by the work of Knuth on mathematical typography. We propose that in using an energy minimizing solution completion curves should not penalize curvature as in elastica but curvature variation. The minimization of total curvature variation leads to an Euler Spiral solution, a curve whose curvature varies linearly with arclength. The construction of this curve from a pair of points and tangents at these points is reduced to a nonlinear system of equations involving Fresnel Integrals, whose solution relies on optimization from a suitable initial condition constrained to satisfy given boundary conditions. Since the choice of an appropriate initial curve is critical in this optimization, we analytically derive an optimal solution in the class of biarc curves, which is then used as the initial curve. The resulting interpolations yield intuitive interpolation across gaps and occlusions, and are extensible, in contrast to scale invariant elastica. In addition, Euler Spiral segments can be used in other applications of curve completions, e.g., modeling boundary segments between curvature extrema or skeletal branch geometry.
Blow-up solutions for a class of nonlinear parabolic equations with Dirichlet boundary conditions
Authors: Juntang Ding
Venue: Nonlinear Analysis: Theory, Methods Applications (2003)

In the present paper, the blow up of smooth local solutions for a class of nonlinear parabolic equations u,t = ∇(a(u)∇u) + f(x, u, q, t) (q = |∇u|2) with Dirichlet boundary conditions are studied. By constructing an auxiliary function and using Hopf's maximum principles on it, the sufficient conditions for blow-up solutions are obtained and the upper bound of "blow-up time" is given under some suitable assumptions on a, f and initial date. The obtained results are applied to some examples in which a and f are exponential functions.
The Strategy of Cramming
Authors: Larry Wos
Venue: Journal of Automated Reasoning (2003)

Offered in this article is a new strategy, cramming, that can serve well in an attempt to answer an open question or in an attempt to find a shorter proof. Indeed, when the question can be answered by proving a conjunction, cramming can provide substantial assistance. The basis of the strategy rests with forcing so many steps of a subproof into the remainder of the proof that the desired answer is obtained. As for reduction in proof length, the literature shows that proof shortening (proof abridgment) was indeed of interest to some of the masters of logic, masters that include C. A. Meredith, A. Prior, and I. Thomas. The problem of proof shortening (as well as other aspects of simplification) is also central to the recent discovery by R. Thiele of Hilbert's twenty-fourth problem. Although that problem was not included in his 1900 Paris lecture (because he had not yet sufficiently formulated it), Hilbert stressed at various times in his life the importance of finding simpler proofs. Because a sharp reduction in proof length (of constructive proofs) is correlated with a significant reduction in the complexity of the object being constructed, the cramming strategy is relevant to circuit design and program synthesis. The most impressive success with the use of the cramming strategy concerns an abridgment of the Meredith&ndash;Prior abridging of the &Lstrok;ukasiewicz proof for his shortest single axiom for the implicational fragment of two-valued sentential (or classical propositional) calculus. In the context of answering open questions, the most satisfying examples to date concern the study of the right-group calculus and the study of the modal logic C5. Various challenges are offered here.
Extraction of Indicative Summary Sentences from Imaged Documents
Authors: Francine R. Chen, Dan S. Bloomberg
Venue: Proceedings of the 4th International Conference on Document Analysis and Recognition (1997)

A system for selecting sentences from an imaged document for presentation as part of a document summary is presented. The extracts are identified without the use of optical character recognition. The sentences are selected based on a set of discrete features characterizing the words within a sentence and the location of the sentence within the imaged document. Each sentence is scored based on the values of the discrete features using a statistically based classifier. The imaged document is processed to identify the word locations, the reading order of words, and the location of sentence and paragraph boundaries in the text. The words are grouped into equivalence classes to mimic the terms in a text document. A sample extract for a technical document is shown, and evaluation against a set of abstracts created by a professional abstracting company is given. These results are compared with text-based abstracts.
Semantic heterogeneity resolution in federated databases by metadata implantation and stepwise evolution
Authors: Goksel Aslan, Dennis McLeod
Venue: The VLDB Journal &mdash; The International Journal on Very Large Data Bases (1999)

A key aspect of interoperation among data-intensive systems involves the mediation of metadata and ontologies across database boundaries. One way to achieve such mediation between a local database and a remote database is to fold remote metadata into the local metadata, thereby creating a common platform through which information sharing and exchange becomes possible. Schema implantation and semantic evolution, our approach to the metadata folding problem, is a partial database integration scheme in which remote and local (meta)data are integrated in a stepwise manner over time. We introduce metadata implantation and stepwise evolution techniques to interrelate database elements in different databases, and to resolve conflicts on the structure and semantics of database elements (classes, attributes, and individual instances). We employ a semantically rich canonical data model, and an incremental integration and semantic heterogeneity resolution scheme. In our approach, relationships between local and remote information units are determined whenever enough knowledge about their semantics is acquired. The metadata folding problem is solved by implanting remote database elements into the local database, a process that imports remote database elements into the local database environment, hypothesizes the relevance of local and remote classes, and customizes the organization of remote metadata. We have implemented a prototype system and demonstrated its use in an experimental neuroscience environment.
An integrative approach to the accommodation of various learning styles
Authors: Mohamad R. Neilforoshan
Venue: Journal of Computing Sciences in Colleges (2002)

The main goal of this paper is to introduce a new teaching methodology. In our previous work [1], we showed that using new teaching approaches could enhance the students' interest in the learning process. Our evidence indicates [1] that our teaching style directly affects the students' learning experience. In this paper, we will discuss the merits of using a new approach in getting students involved in the learning process. We have examined this approach through a course in the area of Computers and Society. The examination of the outcome of this process, at the end of fall semester 2000 [1] where this methodology was used, indicates that these methods were indeed very effective. It is our hope that by sharing our new teaching methodologies, we would be able to improve our students' desire to learn more [2] and cooperate fully in the process.
The Coevolution of Network Alliances: a Longitudinal Analysis of An International Professional Service Network
Authors: Mitchell P. Koza, Arie Y. Lewin
Venue: Organization Science (1999)

This paper examines a single longitudinal case study of a professional service network in the public accounting industry, a network intentionally created and formally organized to pursue residual referral revenue for the member firms. Applying and extending a coevolutionary perspective (Koza and Lewin 1998), the paper explores the antecedents and stimuli for the formation of the network, the network's morphology, the motivation of the network members, and the ways in which the network coevolves with its environment and with the adaptation practices of its members. We find that the network was initially created with the strategic intent of producing incremental income in exchange for cross-border referrals. However, we also find that this strategy reveals asymmetric positive returns, which produce serendipitous opportunities for individual member firms to bypass the original intent of network by entering each other's market. We propose that such tensions may be endemic to alliance networks, and we explore their sources and consequences on a variety of characteristics, including network stability, member opportunism, and control. The paper concludes with a model of the coevolutionary process.
The role of controlled and dynamic process environments in group decision making: an exploratory study
Authors: Subbasish Dasgupta
Venue: Simulation and Gaming (2003)

Information systems have focussed on controlling the decision-making environment, whereas in real life groups operate in an uncontrolled, asynchronous environment. In this article, we examine existing information system research on groups, analyze the role played by the process environment on the quality of group decisions, and argue the need for the design and research into information systems for uncontrolled dynamic environments. The recent growth of the Internet and Internet-mediated simulations provide unique uncontrolled environments for group decision making. We recommend that researchers in information systems and in group decision making these Internet-mediated simulations for additional research in the area of decision making in uncontrolled dynamic environments.
Dynamic addressing memory arrays with physical locality
Authors: Steven Hsu, Shih-Lien Lu, Shih-Chang Lai, Ram Krishnamurthy, Konrad Lai
Venue: Proceedings of the 35th annual ACM/IEEE international symposium on Microarchitecture (2002)

As pipeline width and depth grow to improve performance, memory arrays in microprocessors are growing in entries and ports. Arrays will increase in physical size, which prolongs the access time due to wiring delay. In order to boost clock frequency, these memory arrays must take multiple cycles to complete an access. This delays the scheduling of dependent instructions and affects overall performance. This paper proposes a different circuit organization to enable fast and slow accesses solely dependent on physical locality. Since the access time depends on a fixed physical location, it is pre-determined to scheduling dependent instructions. Furthermore, this paper presents a mechanism to re-configure the address decoding of the physical register file to increase the occurrence of fast access. Detailed circuit simulation using this proposed method determines the access cycle time. Reduction in average access cycle time for the register file and the first level data cache recovers 73% of the IPC degradation.
Modeling Bus Stops in Transit Networks: A Survey and New Formulations
Authors: Belgacem Bouzaïene-Ayari, Michel Gendreau, Sang Nguyen
Venue: Transportation Science (2001)

In this paper, we undertake a detailed study of the bus stop problem in congested transit networks. In the first part of the paper, we present and discuss the bus stop models existing in the literature. In the second part, we propose a new general model for which we prove a number of good properties and we give equivalent formulations. Then, we examine two special cases of the general model. In the first case, the line capacities are considered limited and therefore they can not be exceeded by the on-board passenger flows. In the second case, the strict capacity constraints are relaxed in order to obtain a stop model that can be easily integrated into an assignment model to predict the global passenger behavior in transit networks.
Optimal configuration of OSPF aggregates
Authors: Rajeev Rastogi, Yuri Breitbart, Minos Garofalakis, Amit Kumar
Venue: IEEE/ACM Transactions on Networking (TON) (2003)

Open Shortest Path First (OSPF) is a popular protocol for routing within an autonomous system (AS) domain. In order to scale for large networks containing hundreds and thousands of subnets, OSPF supports a two-level hierarchical routing scheme through the use of OSPF areas. Subnet addresses within an area are aggregated, and this aggregation is a crucial requirement for scaling OSPF to large AS domains, as it results in significant reductions in routing table sizes, smaller link-state databases, and less network traffic to synchronize the router link-state databases. On the other hand, address aggregation also implies loss of information about the length of the shortest path to each subnet, which in turn, can lead to suboptimal routing.In this paper, we address the important practical problem of configuring OSPF aggregates to minimize the error in OSPF shortest-path computations due to subnet aggregation. We first develop an optimal dynamic programming algorithm that, given an upper bound k on the number of aggregates to be advertised and a weight assignment function for the aggregates, computes the k aggregates that result in the minimum cumulative error in the shortest-path computations for all source-destination subnet pairs. Subsequently, we tackle the problem of assigning weights to OSPF aggregates such that the cumulative error in the computed shortest paths is minimized. We demonstrate that, while for certain special cases (e.g., unweighted cumulative error) efficient optimal algorithms for the weight assignment problem can be devised, the general problem itself is NP-hard. Consequently, we have to rely on search heuristics to solve the weight assignment problem. To the best of our knowledge, our work is the first to address the algorithmic issues underlying the configuration of OSPF aggregates and to propose efficient configuration algorithms that are provably optimal for many practical scenarios.
Melanoma Prediction Using Data Mining System LERS
Authors: Jan P. Grzymala-Busse, Jerzy W. Grzymala-Busse, Zdzislaw S. Hippe
Venue: Proceedings of the 25th International Computer Software and Applications Conference on Invigorating Software Development (2001)

One of the important tools for early diagnosis of malignant melanoma is the total dermatoscopy score computed using the ABCD formula. Our primary objective was to check whether the well-known ABCD formula is optimal. Using a data set containing 276 cases of melanoma and the LERS data mining system we checked more than 20,000 modified formulas for ABCD, computing the predicted error rate of melanoma diagnosis using ten-fold cross validation for every modified formula. As a result we found the optimal ABCD formula for our setup: discretization based on cluster analysis, LEM2 algorithm for rule induction (one of the four LERS algorithms for rule induction), and standard LERS classification scheme. The error rate for the standard ABCD formula was 10.21%, while for the optimal ABCD formula the error rate was reduced to 6.04%.Some research in melanoma diagnosis shows that the use of the ABCD formula does not improve the error rate. Our research shows that the ABCD formula is useful, since for our data set the error rate without the use of the ABCD formula was higher (13.73%).
Melt Scheduling to Trade Off Material Waste and Shipping Performance
Authors: Kedar S. Naphade, S. David Wu, Robert H. Storer, Bhavin J. Doshi
Venue: Operations Research (2001)

The ingot formation or "melt" process is the first step in many steel-making operations. This process involves melting steel and alloys in the desired chemical composition, then pouring it into a variety of ingot molds. Complex technological and resource constraints can make the planning and scheduling of such processes extremely challenging. In this paper, we report our experience in developing solution methods for this "melt scheduling" problem at BethForge, a division of the Bethlehem Steel Corporation, and a manufacturer of custom-made heavy steel forgings. We describe the main issues associated with generic melt-scheduling problems as well as constraints that are specific to BethForge. The problem at BethForge is particularly challenging, because of the need to keep the ingot at a high temperature before forging, their large product variety, and the need to consider trade-offs between two conflicting objectives. We first formulate the base melt-scheduling problem as a mixed-integer program. We then decouple the scheduling decisions into two levels and develop a local search algorithm based on Storer and Wu's problem space neighborhood. Our aim is to generate a family of efficient schedules that allow decision makers to balance the trade-off between two criteria. Computational experiments are performed using data from BethForge. The melt-scheduling procedure developed here has been implemented and installed at BethForge. It has made fundamental improvement in their melt-scheduling process.
On the definition of coherence measure for fuzzy sets
Authors: A. Sancho-Royo, J. L. Verdegay
Venue: Technologies for constructing intelligent systems: tools (2002)

Studying comparison methods for fuzzy sets is an essential task for the good understanding of the underlying theory in this field. Most of these tools deal with fuzzy sets from the view of similarity, order relationships and so forth. In this paper however, based on a former comparison measures introduced by the authors, the so called Coherence Measures, the extension and analysis of these tools to a measurable Lebesgue set X is carried out, with which coherence measures are linked to the Fishburn-Yager's ambiguity measures. Besides, two methods for constructing coherence measures, one from ambiguity measures and another from metrics on Pf(X), the set of fuzzy sets on X, are shown and exemplified by a variety of measures and metrics. Finally some illustrative examples testing the coherence measures introduced are provided.
Solution of the spectra puzzle
Authors: Robert L. Lamphere
Venue: Journal of Computing Sciences in Colleges (2002)

In this paper, we solve the SPECTRA Puzzle and express the solution in terms of color-path sets. We can add, invert, and combine these sets by the addition, inverse, and the union operators, respectively. We express the solution by a mathematical formula in which we use color-path sets and its operators. To simplify the C++ implementation of the solution, we define a C++ SPECTRA class. We translate the mathematical formula into C++ code by using the SPECTRA class. The SPECTRA class contains a color-path set and the set operators. The color-path set is implemented as a linked list and the set operators are implemented by extending the C++ operators "+", "--" and "*".