ppxscal/embedding_network huggingface dataset:
Real solving for positive dimensional systems
Authors: Philippe Aubry, Fabrice Rouillier, Mohab Safey El Din
Venue: Journal of Symbolic Computation (2002)

Finding one point on each semi-algebraically connected component of a real algebraic variety, or at least deciding if such a variety is empty or not, is a fundamental problem of computational real algebraic geometry. Although numerous studies have been done on the subject, only a small number of efficient implementations exist.In this paper, we propose a new efficient and practical algorithm for computing such points. By studying the critical points of the restriction to the variety of the distance function to one well chosen point, we show how to provide a set of zero-dimensional systems whose zeros contain at least one point on each semi-algebraically connected component of the studied variety, without any assumption either on the variety (smoothness or compactness for example) or on the system of equations which define it.From the output of our algorithm, one can then apply, for each computed zero-dimensional system, any symbolic or numerical algorithm for counting or approximating the real solutions. We report some experiments using a set of pure exact methods. The practical efficiency of our method is due to the fact that we do not apply any infinitesimal deformations, unlike the existing methods based on a similar strategy.
Heavy Traffic Analysis of Dynamic Cyclic Policies: A Unified Treatment of the Single Machine Scheduling Problem
Authors: David M. Markowitz, Lawrence M. Wein
Venue: Operations Research (2001)

This paper examines how setups, due dates, and the mix of standardized and customized products affect the scheduling of a single machine operating in a dynamic and stochastic environment. We restrict ourselves to the class of dynamic cyclic policies, where the machine busy/idle policy and lot-sizing decisions are controlled in a dynamic fashion, but different products must be produced in a fixed sequence. As in earlier work, we conjecture that an averaging principle holds for this queueing system in the heavy traffic limit, and optimize over the class of dynamic cyclic policies. The results allow for a detailed discussion of the interactions between the due-date, setup, and product mix facets of the problem.
The Spatial Representation of Market Information
Authors: Wayne S. DeSarbo, Alexandru M. Degeratu, Michel Wedel, M. Kim Saxton
Venue: Marketing Science (2001)

To be used effectively, market knowledge and information must be structured and represented in ways that are parsimonious and conducive to efficient managerial decision making. This manuscript proposes a new latent structure spatial model for the representation of market information that meets this requirement. When applied to a priori defined (e.g., socioeconomic) segments, our proposed methodology provides a new way to display marketing data parsimoniously via dimension reduction through a factor-analytic specification. In post hoc studies, we simultaneously derive market segments from the data and represent the structure of market information within each of the unobserved, derived groups/segments. We summarize all relevant information concerning derived market segments via a series of maps that prove conducive to the quick and accurate dissemination of customer and competitor market information. The associations between the variables are captured in a reduced space, where each variable is represented by a vector that emanates from the origin and terminates on a hypersphere of unit (the vector length is arbitrary) radius (e.g., a unit circle in a two-dimensional space). The angles between the variable vectors capture the correlation structure in the reduced space. The method is very general and can be utilized to identify latent structures in a wide range of marketing applications. We present an actual commercial marketing application involving the (normalized) prescription shares (of specialists) of ethical drugs to demonstrate the effectiveness of representing market information in this manner and to reveal the advantage of the proposed methodology over a more general finite mixture-based method. The proposed methodology derives three segments that tend to group specialists with respect to the stage of adoption of innovation in this therapeutic category. The specialists in the first group appear to be laggards because they prescribe more of the older class of brands. However, they also have a higher-than-average preference for a newer and somewhat cheaper brand. This suggests that some of the specialists belonging to this segment may be price sensitive, while others may exhibit a slower adoption cycle, replacing the older class with the newer brands, and thus, skip one stage in the cycle of innovation. The specialists in the second segment are heavy users of the newer class of brands but are not particularly fast to adopt the latest brands. Finally, the last segment clearly consists of innovators. Traditionally, pharmaceutical marketers have viewed specialists in one of two extremes--all specialists are the same (i.e., the market has only one segment) or all specialists are very different (i.e., the market consists of 10,000+ segments of one physician each). Not surprisingly, this analysis suggests a more moderate perspective: specialists adopt new products at different rates.
Creating a useable peer-tutoring site on-line
Authors: Paula Whitlock, Myra Kogen
Venue: Journal of Computing Sciences in Colleges (2002)

A description of the development and implementation of a peer-tutoring service on-line geared to urban commuter students is presented. A model for the student creation of the web site is discussed as well as the ongoing evaluation of software needed by the project. The issue of how to provide tutoring that complements the presentation of course material in the classroom is raised. The decision about what material should be available on-line involves a negotiation among a wide audience that includes faculty, administration and the students. The assessment of the usefulness of the site is just beginning and much developmental work remains. What has been learned is that establishing an on-line tutoring site in an academic environment requires the consideration of many issues beyond technical ones.
Interactive ray tracing on PCs
Authors: Philipp Slusallek
Venue: Practical parallel rendering (2002)

For almost two decades, researchers have argued that ray tracing will eventually become faster than the rasterization technique that completely dominates today's graphics hardware. However, this has not yet happened. Ray tracing is still almost exclusively being used for off-line rendering of photorealistic images. It is commonly believed that ray tracing is simply too costly to ever challenge rasterization-based algorithms for interactive use.In this chapter, we show that interactive ray tracing is indeed possible on commodity PCs. We first present a highly optimized ray tracer that improves performance by more than an order of magnitude compared to currently available ray tracers. The new algorithm makes better use of computational resources such as caches and SIMD instructions, and better exploits image and object space coherence. Secondly, we show that this software implementation can challenge and even outperform high-end graphics hardware in interactive rendering performance for complex environments.We also demonstrate how ray tracing can be made to work efficiently on a cluster of commodity PCs without shared memory. The same techniques that increased the speed of the ray tracing algorithms also helps to hide latency and reduce bandwidth for network communication in a distributed setup. Finally we show that the distributed ray tracing algorithm can handle highly complex models of tens of millions of polygons while still achieving interactive frame rates of up to ten frames per second on a small cluster of seven PCs.
On the Meaningfulness of Optimal Solutions to Scheduling Problems: Can An Optimal Solution Be Nonoptimal?
Authors: N. V. R. Mahadev, Aleksandar Pekec, Fred S. Roberts
Venue: Operations Research (1998)

We consider the problem of finding an optimal schedule for jobs on a single machine when there are penalties for both tardy and early arrivals. We point out that if attention is paid to how these penalties are measured, then a change of scale of measurement might lead to the anomalous situation where a schedule is optimal if these parameters are measured in one way, but not if they are measured in a different way that seems equally acceptable. In particular, we note that if the penalties measure utilities or disutilities, or loss of goodwill or customer satisfaction, then these kinds of anomalies can occur, for instance if we change both unit and zero point in scales measuring these penalties. We investigate situations where problems of these sorts arise for four specific penalty functions under a variety of different assumptions. The results of the paper have implications far beyond the specific scheduling problems we consider, and suggest that considerations of scale of measurement should enter into analysis of conclusions of optimality both in scheduling problems and throughout combinatorial optimization.
Analysis of axisymmetric structures using Coons' interpolation
Authors: Christopher G. Provatidis
Venue: Finite Elements in Analysis and Design (2003)

This paper investigates the performance of global shape functions in axisymmetric elastic structures. The main idea behind the proposed theory is the use of the interpolation formula developed by Coons for CAD purposes in automotive industry, in which it is shown that it is capable of interpolating the displacements within a large patch on the axial cross-section of a structure. The degrees of freedom appear only at the patch boundaries and can be used in the solution of displacement and stress analysis problems. Two different schemes for the interpolation of the boundary data, using B-splines and/or linear global shape functions, are investigated. Numerical results are presented for three typical test cases where the proposed method is successfully compared with conventional finite elements and closed analytical solutions.
On the thermodynamics of repetitive viscoplastic moulding
Authors: I. Müller, H.-S. Sahota, P. Villaggio
Venue: Zeitschrift f&uuml;r Angewandte Mathematik und Physik (ZAMP) (2002)

In moulding plastic deformation is accompanied by heating. Both phenomena are coupled because the yield limit decreases with temperature and since a moulded sample resists the tool with a dissipative viscous force. A linear one-dimensional theory of the process is proposed and exploited for the case in which the tool consists of compressive weights. These are applied to a sample at successsive times and relifted to be ready for the next sample. The energy needed for relifting the weights depends on the distribution of weights and on the times of their application.
Classroom experience with Jeroo
Authors: Dean Sanders, Brian Dorn
Venue: Journal of Computing Sciences in Colleges (2003)

Jeroo is a tool that has been developed to help students in beginning programming courses learn the semantics of fundamental control structures, learn the basic notions of using objects to solve problems, and learn to write methods that define the behavior of objects. Jeroo is similar to Karel the Robot and its descendants, but has a narrower scope and has a syntax that provides a smoother transition to either Java or C++. Jeroo has been class tested at Northwest Missouri State University, and has proven to be an effective tool for working with students in a beginning programming class.
Decision support for the academic library acquisition budget allocation via circulation database mining
Authors: S.-C. Kao, H.-C. Chang, C.-H. Lin
Venue: Information Processing and Management: an International Journal (2003)

Many approaches to decision support for the academic library acquisition budget allocation have been proposed to diversely reflect the management requirements. Different from these methods that focus mainly on either statistical analysis or goal programming, this paper introduces a model (ABAMDM, acquisition budget allocation model via data mining) that addresses the use of descriptive knowledge discovered in the historical circulation data explicitly to support allocating library acquisition budget. The major concern in this study is that the budget allocation should be able to reflect a requirement that the more a department makes use of its acquired materials in the present academic year, the more it can get budget for the coming year. The primary output of the ABAMDM used to derive weights of acquisition budget allocation contains two parts. One is the descriptive knowledge via utilization concentration and the other is the suitability via utilization connection for departments concerned. An applicat-ion to the library of Kun Shan University of Technology was described to demonstrate the introduced ABAMDM in practice.
A group decision support system based on linguistic multicriteria assessments
Authors: Janusz Kacprzyk, Slawomir Zadrozny
Venue: Technologies for constructing intelligent systems: Tasks (2002)

A group decision support system is presented. The main concern is an effective support for the consensus reaching process. The point of departure are linguistic assessments of options with respect to multiple criteria. These are processed to obtain individual and group preference structures as well as an assessment of the consensus in the group. A pilot implementation of the system in the WWW environment is presented.
Holistic scheduling and analysis of mixed time/event-triggered distributed embedded systems
Authors: Traian Pop, Petru Eles, Zebo Peng
Venue: Proceedings of the tenth international symposium on Hardware/software codesign (2002)

This paper deals with specific issues related to the design of distributed embedded systems implemented with mixed, event-triggered and time-triggered task sets, which communicate over bus protocols consisting of both static and dynamic phases. Such systems are emerging as the new standard for automotive applications. We have developed a holistic timing analysis and scheduling approach for this category of systems. We have also identified several new design problems characteristic to such hybrid systems. An example related to bus access optimization in the context of a mixed static/dynamic bus protocol is presented. Experimental results prove the efficiency of such an optimization approach.
Parabolic ADI Methods for Pricing America Options on Two Stocks
Authors: Stephane Villeneuve, Antonino Zanette
Venue: Mathematics of Operations Research (2002)

We propose two numerical methods for pricing American options on two stocks based on the ADI algorithm of Peaceman and Rachford (1955). We prove the stability and convergence of these schemes and establish a comparative result.
COTS and High Assurance: An Oxymoron?
Authors: Jeffrey M. Voas
Venue: The 4th IEEE International Symposium on High-Assurance Systems Engineering (1999)

Can COTS software be tolerated in high assurance environments? Or is this hopelessly impossible? My position is that COTS software will exist in high assurance environments (in the near future) no matter what prudence or due diligence suggests. Prudence and due diligence would argue that it is foolish to expect dependable functionality from generic products that are mass produced, engineered for the typical user (who can tolerate failures because they are mere nuisances), suffer from shrunken development and testing schedules, and carry shrink wrap disclaimers. Prudence and due diligence would ask why we opt to use COTS software when we cannot even reach our high dependability goals via code that is written from scratch and according to standards that are known to improve dependability. After all, the COTS vendors do not follow these standards. Is it reasonable to expect software that is intended for the mass market to be highly dependable? Probably not.
On the relationship between some extensions of fuzzy set theory
Authors: Glad Deschrijver, Etienne E. Kerre
Venue: Fuzzy Sets and Systems (2003)

Since Zadeh introduced fuzzy sets in 1965, a lot of new theories treating imprecision and uncertainty have been introduced. Some of these theories are extensions of fuzzy set theory, others try to handle imprecision and uncertainty in a different (better?) way. Kerre (Computational Intelligence in Theory and Practice, Physica-Verlag, Heidelberg, 2001, pp. 55-72) has given a summary of the links that exist between fuzzy sets and other mathematical models such as flou sets (Gentilhomme), two-fold fuzzy sets (Dubois and Prade) and L-fuzzy sets (Goguen). In this paper, we establish the relationships between intuitionistic fuzzy sets (Atanassov, VII ITKR's Session, Sofia, June 1983 (Deposed in Central Sci.-Techn. Library of Bulg. Acad. of Sci., 1697/84) (in Bulgarian)), L-fuzzy sets (J. Math. Anal. Appl. 18 (1967) 145), interval-valued fuzzy sets (Sambuc, Ph.D. Thesis, University of Marseille, France, 1975), interval-valued intuitionistic fuzzy sets (Intuitionistic fuzzy set, Physica-Verlag, Heidelberg, New York, 1999).
Loopback recovery from neighboring double-link failures in WDM mesh networks
Authors: Hongsik Choi, Suresh Subramaniam, Hyeong-Ah Choi
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2003)

Traditional survivable network design assumes that at any time at most a single link or node fails. In optical networks, a single point of failure may lead to the failure of multiple links. In this paper, we consider the design of an optical network that can survive the failures of any two neighboring links. We present a loopback recovery method that requires the computation of backup paths for each link. An optimal algorithm for computing the backup paths is presented. Numerical results comparing the performance of our algorithm with other loopback approaches indicate that a slight increase in capacity can achieve 100% protection under this failure model.
Using Lego mindstorms across the computer science curriculum
Authors: Frank Klassner
Venue: Journal of Computing Sciences in Colleges (2002)

Participants will learn how to use the LEGO Mindstorms Robotics Invention System as an active-learning platform for teaching topics ranging from Programming 101 to Computer Architecture to Operating Systems to Artificial Intelligence. Participants will learn how to use Java, C/C++, and Lisp to control and program Mindstorms robots. No personal kits are required; participants will use a workshop-supplied MindStorms kit and pre-built robots.
Evaluating social trails
Authors: Martin Svensson, Kristina Höök, Rickard Cöster
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

We performed a 6-month study of a food recommender system to determine the influence of social trails on users choice of recipes. To measure the impact of the recom-mender functionality, we choose to avoid predictive accu-racy metrics, and opted for contextualised subjective meas-ures, comparing recommendations to searching and brows-ing. 18% of the selected recipes came from the list of rec-ommended recipes. In addition, users liked and understood the recommendation functionality.
Stochastic Inventory Systems in a Supply Chain with Asymmetric Information: Cycle Stocks, Safety Stocks, and Consignment Stock
Authors: Charles J. Corbett
Venue: Operations Research (2001)

The two critical factors distinguishing inventory management in a multifirm supply-chain context from the more traditional centrally planned perspective areincentive conflicts andinformation asymmetries. We study the well-known order quantity/reorder point ( Q, r) model in a two-player context, using a framework inspired by observations during a case study. We show how traditional allocations of decision rights to supplier and buyer lead to inefficient outcomes, and we use principal-agent models to study the effects of information asymmetries about setup cost and backorder cost, respectively.We analyze two "opposite" models of contracting on inventory policies. First, we derive the buyer's optimal menu of contracts when the supplier has private information about setup cost, and we show how consignment stock can help reduce the impact of this information asymmetry. Next, we study consignment and assume the supplier cannot observe the buyer's backorder cost. We derive the supplier's optimal menu of contracts on consigned stock level and show that in this case, the supplier effectively has toovercompensate the buyer for the cost of each stockout.Our theoretical analysis and the case study suggest that consignment stock helps reducecycle stock by providing the supplier with an additional incentive to decrease batch size, but simultaneously gives the buyer an incentive to increasesafety stock by exaggerating backorder costs. This framework immediately points to practical recommendations on how supply-chain incentives should be realigned to overcome existing information asymmetries.
Optimal System Design with Multiple Decision Makers and Possible Debt: a Multicriteria De Novo Programming Approach
Authors: Esther Frostig, Benny Levikson, Yong Shi
Venue: Operations Research (1999)

This paper applies multicriteria de novo programming to formulate and solve problems of system design that involve multiple decision makers and a possible debt. In the framework of the system design model, each involved decision maker has his or her own preference for the budget availability level associated with multicriteria under consideration. If the possible debt occurs in the design time, the model allows flexibility for decision makers to borrow additional money from a bank with a fixed interest rate so as to keep the production process feasible. A contingency plan therefore can be constructed to deal with the debt situation. A solution procedure is developed to design the optimal system with a certain range of budget availability levels. Numerical examples are used to illustrate the procedure.
How information measure changes due to unreliability
Authors: Viviana Doldi, Gloria Naval, Carlo Bertoluzza
Venue: Technologies for constructing intelligent systems: tools (2002)

It is a common experience that an answer reaches different meaning in account of the reliability of the person to who we had posed the question. That is, the less a person is reliable, the less we are inclined to believe his answer as honest. In order to study this situation, we assign to each person a "membership degree" of his answer (between 0 and 1), that may be view as the degree of belonging of that person to the fuzzy set of "sinceres". Obviously our judgement will introduce changes also in the amount of information we have obtained: the real information that we have after having known the answer, will pay a variation, due to the knowledge of the degrees of belief, with respect to ideal information. In this paper we have found the form that the information's changement assumes, under the hypothesis that the membership function assumes only a finite range of values (α0 = 0, α1,..., αn = 1).