ppxscal/embedding_network huggingface dataset:
A compiler for business simulations: toward business model development by yourselves
Authors: Kazuhiko Tsuda, Takao Terano, Yasushi Kuno, Hiroaki Shirai, Hisatoshi Suzuki
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2002)

This paper is a proposal for business simulation compiler. This compiler can utilize and modify a business simulation on the WWW easily for any person who is inexperienced in program development. This compiler was created as part of our business simulation course. The course we are developing consists of: (i) a simple gaming experiment among multiple students using Alexander Islands, a tiny business simulation on the WWW; (ii) lectures to let students understand the core concepts of systems management through the simulation; and (iii) the development of a homemade simulation model by the students themselves using business model description language (BMDL) and a business model development system (BMDS). Our course is unique in the sense that, through the business simulation, we aim to develop students' skills: (1) to implement their own specific models of business firms, (2) to develop information systems for the films, and (3) to understand business processes among companies. This paper describes the background and motivation, basic principles, the architecture and implementation of BMDL/BMDS, and the results of the experiments.
The Asymptotic Optimality of the SPT Rule for the Flow Shop Mean Completion Time Problem
Authors: Philip Kaminsky, David Simchi-Levi
Venue: Operations Research (2001)

In the flow shop mean completion time problem, a set of jobs has to be processed onm-machines. Every machine has to process each one of the jobs, and every job has the same routing through the machines. The objective is to determine a sequence of the jobs on the machines so as to minimize the sum of the completion times of all jobs on the final machine. In this paper, we prove the asymptotic optimality of the Shortest Processing Time algorithm for any continuous, independent, and identically distributed job processing times.
An Axiomatic Characterization of a Class of Locations in Tree Networks
Authors: Dean P. Foster, Rakesh V. Vohra
Venue: Operations Research (1998)

In this paper we describe four axioms that uniquely characterize the class of locations in tree networks that are obtained by minimizing an additively separable, nonnegative, nondecreasing, differentiable, and strictly convex function of distances. This result is analogous to results that have been obtained in the theory of bargaining, social choice, and fair resource allocation.
Fuzzy complete sets
Authors: Shu Lan, Pen Jia Yin
Venue: Fuzzy Sets and Systems (2002)

In this paper, the notion of fuzzy complete sets is introduced and the structure of maximal fuzzy codes is depicted using fuzzy complete sets.
New internet connected air pollution monitoring network of Slovenia
Authors: M. Lesjak, B. Grašič, M. Boznar, P. Mlakar
Venue: Development and application of computer techniques to environmental studies (2002)

In spring 2001, the Environmental Agency of Slovenia commissioned new ambient air pollution monitoring system. Financed from the Phare funds, it was completely designed and built by the Slovenian company AMES. As opposed to the old monitoring network, based on the dedicated data transmission and hierarchic star-topology, new system fully utilizes Internet technology and distributed network concept.
Managed C++ and .Net Development
Authors: Stephen R. G. Fraser
Venue:  (2003)

:This book only focuses on Managed C++ and .NET Framework development. It is specifically targeted to help developers develop .NET applications, class libraries, and Web services and applications using C++. It does not get bogged down worrying about older Microsoft C++ development methods.Managed C++ and .NET Development is about writing .NET applications and services. It is designed to start developers with a clean slate, wiping clear any need for developing COM, DCOM, COM+, or ActiveX components. Instead, it will show readers how to code in the world of .NET-free of all that unneeded baggage. More importantly, this is a book about writing .NET applications using C++. It covers a lot of ground in a short period of time. In the end, developers should be proficient at developing .NET applications, specifically for Windows and the World Wide Web. While readers are learning the ins-and-outs of .NET application development, they will also be learning the syntax of C++, both old and new to .NET. Readers will also gain a good understanding of the .NET architecture. Most of all, Managed C++ and .NET Development is truly a .NET book applying C++ as its development language-not another C++ syntax book which happens to cover .NET. Author Information Stephen Fraser is the Managing Principal for Fraser Training, a corporate training company focusing on .NET technologies. Stephen has over 15 years of IT experience working for a number of consulting companies ranging from the large consulting firms of EDS and Andersen Consulting (Accenture), to a number of smaller e-business companies. His IT experience covers all aspects of application and web development and management ranging from initial concept all the way through to deployment. Stephen currently resides, with his beautiful wife and daughter, Sarah and Shaina, in beautiful Louisville, Kentucky. - Focuses specifically on .NET Framework development-not an after thought as you find in most of the Visual C++ .NET books being released. - C++ has a well-established and loyal following-a large portion of which will prefer not to migrate to C# if they don't have to. This book provides the means to that end. - When marketed with Essential Guide To Managed Extensions for C++, Apress has a complete Managed C++ .NET offering.
An output-shared buffer ATM switch
Authors: Jin Li
Venue: Proceedings of the 1996 International Conference on Computer Design, VLSI in Computers and Processors (1996)

An output-shared buffer ATM switch is proposed in this paper. This switch sits between an output-buffer ATM switch and a shared-buffer ATM switch. It offers better buffer utilization than a pure output-buffer ATM switch. It also has lower bandwidth requirement than a pure shared-buffer ATM switch.
Parallel Processor Scheduling with Limited Number of Preemptions
Authors: Oliver Braun, Günter Schmidt
Venue: SIAM Journal on Computing (2003)

In this paper, we compare the makespan of preemptive and i-preemptive schedules where only a limited number i of preemptions is allowed. The problem is to schedule n independent jobs on m identical processors that operate in parallel. The objective is to minimize the makespan, i.e., the completion time of the last job that finishes. We show that the ratio of the optimal i-preemptive schedule length ${C_{max}^{ip^*}}$ versus the optimal preemptive schedule length ${C_{max}^{p^*}}$ is bounded from above by ${C_{max}^{ip^*}} \le {( 2 - 2 / (m/(i+1) + 1) )} {C_{max}^{p^*}}$. Furthermore, we show that the ratio of the length ${C_{max}^{LPT}}$ of a nonpreemptive schedule following the {\it longest processing time (LPT)} rule versus the optimal preemptive schedule length ${C_{max}^{p^*}}$ is bounded from above by exactly the same bound when i=0.
An information-theoretic approach to normal forms for relational and XML data
Authors: Marcelo Arenas, Leonid Libkin
Venue: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2003)

Normalization as a way of producing good database designs is a well-understood topic. However, the same problem of distinguishing well-designed databases from poorly designed ones arises in other data models, in particular, XML. While in the relational world the criteria for being well-designed are usually very intuitive and clear to state, they become more obscure when one moves to more complex data models.Our goal is to provide a set of tools for testing when a condition on a database design, specified by a normal form, corresponds to a good design. We use techniques of information theory, and define a measure of information content of elements in a database with respect to a set of constraints. We first test this measure in the relational context, providing information-theoretic justification for familiar normal forms such as BCNF, 4NF, PJ/NF, 5NFR, DK/NF. We then show that the same measure applies in the XML context, which gives us a characterization of a recently introduced XML normal form called XNF. Finally, we look at information-theoretic criteria for justifying normalization algorithms.
Corpora for topic detection and tracking
Authors: Christopher Cieri, Stephanie Strassel, David Graff, Nii Martey, Kara Rennert, Mark Liberman
Venue: Topic detection and tracking: event-based information organization (2002)

The TDT corpora, developed to support the DARPA-sponsored program in Topic Detection and Tracking, combine data collected over a nine month period from 8 English and 3 Chinese sources. The published corpora contain audio, reference text including written news text and transcripts of the broadcast audio, boundary tables segmenting the broadcasts into stories and relevance tables resulting from millions of human judgments. Sections of the corpora have undergone topic-story, first story and story link annotation. Both the TDT-2 and TDT-3 text corpora and the accompanying broadcast audio are now available from the Linguistic Data Consortium. This paper described the raw material collected for the corpora, the annotation of that material to prepare it for research use and the formats in which it is distributed. Special attention is paid to the quality control measures developed for these data sets.
Increment formulations for rounding error reduction in the numerical solution of structured differential systems
Authors: Mark Sofroniou, Giulia Spaletta
Venue: Future Generation Computer Systems (2003)

Strategies for reducing the effect of cumulative rounding errors in geometric numerical integration are outlined. The focus is, in particular, on the solution of separable Hamiltonian systems using explicit symplectic integration methods and on solving orthogonal matrix differential systems using projection. Examples are given that demonstrate the advantages of an increment formulation over the standard implementation of conventional integrators. We describe how the aforementioned special purpose integration methods have been set up in a uniform, modular and extensible framework being developed in the problem solving environment Mathematica.
The Bernstein constant and polynomial interpolation at the Chebyshev nodes
Authors: Michael I. Ganzburg
Venue: Journal of Approximation Theory (2002)

In this paper, we establish new asymptotic relations for the errors of approximation in Lp [-1, 1], 0< p≤ ∞, of |x|λ, λ > 0, by the Lagrange interpolation polynomials at the Chebyshev nodes of the first and second kind. As a corollary, we show that the Bernstein constant Bλp := limn→∞ nλ+1/P infck || |x|λ - Σk=0n ckxk||Lp[-1, 1] is finite for λ > 0 and p ∈ (1/3, ∞).
A hierarchical modeling framework for on-chip communication architectures
Authors: Xinping Zhu, Sharad Malik
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

The communication sub-system of complex IC systems is increasingly critical for achieving system performance. Given this, it is important that the on-chip communication architecture should be included in any quantitative evaluation of system design during design space exploration. While there are several mature methodologies for the modeling and evaluation of architectures of processing elements, there is relatively little work done in modeling of an extensive range of on-chip communication architectures, and integrating this into a single modeling and simulation environment combining processing element and on-chip communication architectures. This paper describes a modeling framework with accompanying simulation tools that attempts to fill this gap. Based on an analysis of a wide range of on-chip communication architectures, we describe how a specific hierarchical class library can be used to develop new on-chip communication architectures, or variants of existing ones with relatively little incremental effort. We demonstrate this through three case studies including two commercial on-chip bus systems and an on-chip packet switching network. Here we show that through careful analysis and construction it is possible for the modeling environment to support the common features of these architectures as part of the library and permit instantiation of the individual architectures as variants of the library design. As part of this methodology we also show how different levels of abstraction of the model can be supported and viewed as different variants that can be used in an accuracy versus simulation time trade-off.
Defining Who You Are By What You're Not: Organizational Disidentification and The National Rifle Association
Authors: Kimberly D. Elsbach, C. B. Bhattacharya
Venue: Organization Science (2001)

Through two exploratory studies, we develop and test an introductory framework of "organizational disidentification." Our first study explores the concept of organizational disidentification through a qualitative investigation of cognitive relationships with the National Rifle Association (NRA). Findings suggest that organizational disidentification is a self-perception based on: (1) a cognitive separation between one's identity and the organization's identity, and (2) a negative relational categorization of oneself and the organization (e.g., categorizations such as "rivals" or "enemies"). Organizational disidentification appears to be motivated by individuals' desires to both affirm positive distinctivenessand avoid negative distinctiveness by distancing themselves from incongruent values and negative stereotypes attributed to an organization. Our findings also suggest that organizational disidentification can lead individuals to take action (either volunteer work or voicing their opinion) as a result of their perceived separation from the organization's identity. Results of our second study--a large-scale survey of public attitudes about the NRA--provide support for this framework.
Electronic portfolio assessment: a pilot project of Northwest Missouri State University 2000-01
Authors: Gary Ury
Venue: Journal of Computing Sciences in Colleges (2002)

Portfolios are quickly winning favor as a form of authentic assessment at all levels of education. This presentation discusses efforts to develop an electronic portfolio assessment strategy as a graduation requirement for undergraduate students at Northwest Missouri State University. The presenter explains efforts of an electronic portfolio pilot project conducted during the 2000-2001 academic year and presents data analysis of student responses to an opinion survey. Curriculum issues will be discussed and explained. Differences between fall and spring cohorts will be examined as well as differences between students involved from the beginning of the pilot project and those not involved in the initial pilot project. The conclusions include cautions about similar pilot projects and projections concerning full implementation of an electronic portfolio assessment strategy at the university level.
A novel scan architecture for power-efficient, rapid test
Authors: Ozgur Sinanoglu, Alex Orailoglu
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

Scan-based testing methodologies remedy the testability problem of sequential circuits; yet they suffer from prolonged test time and excessive test power due to numerous shift operations. The high density of the unspecified bits in test data enables the utilization of the test response data captured in the scan chain for the generation of the subsequent test stimulus, thus reducing both test time and test data volume. The proposed scan-based test scheme accesses only a subset of scan cells for loading the subsequent test stimulus while freezing the remaining scan cells with the response data captured, thus decreasing the scan chain transitions during shift operations. The experimental results confirm the significant reductions in test application time, test data volume and test power achieved by the proposed scan-based testing methodology.
A Criterion for Extractability of Mutual Information for a Triple of Strings
Authors: A. E. Romashchenko
Venue: Problems of Information Transmission (2003)

We say that the mutual information of a triple of binary strings a, b, c can be extracted if there exists a string d such that a, b, and c are independent given d, and d is simple conditional to each of the strings a, b, and c. It is proved that the mutual information between a, b, and c can be extracted if and only if the values of the conditional mutual informations I(a : b&verbar;c), I(a : c&verbar;b), and I(b : c&verbar;a) are negligible. The proof employs a non-Shannon-type information inequality (a generalization of the recently discovered Zhang&ndash;Yeung inequality).
Concurrent execution semantics and sequential simulation algorithms for the metropolis meta-model
Authors: Felice Balarin, Luciano Lavagno, Claudio Passerone, Alberto Sangiovanni-Vincentelli, Yosinori Watanabe, Guang Yang
Venue: Proceedings of the tenth international symposium on Hardware/software codesign (2002)

This paper presents the simulation techniques that are available in Metropolis, an inter-disciplinary research project that develops a design methodology, supported by a comprehensive design environment and tool set, for embedded systems. System behavior is non-deterministic in general, especially in the beginning of the design process, when several key decision, such as the mapping on an implementation platform, have not yet been made, and thus the traces obtainable by simulation are not unique even under the same input sequence. One may want to visit as many traces as possible for regression tests at the final stage of designs, or may just need one valid trace for a quick validation of the design at an early stage. Our techniques can adapt to these different objectives easily. They are also platform-independent in that simulation using different languages, such as SystemC 2.0, Java, and C++ with a thread library, are possible. This feature is important for co-simulation between designs captured in Metropolis and those that have been already designed in other languages.
One giant step backward
Authors: Robert L. Glass
Venue: Communications of the ACM (2003)

Old saying: "The more things change, the more they remain the same" &hellip;or do they?
GeoWorlds: integrating GIS and digital libraries for situation understanding and management
Authors: Robert Neches, Ke-Thia Yao, In-Young Ko, Alejandro Bugacov, Vished Kumar, Ragy Eleish
Venue: The New Review of Hypermedia and Multimedia (2002)

Helping organizations to marshal, analyze, discuss, and act on all of the available information about a situation playing out over space and time is a critical problem. GeoWorlds (http://www.isi.edu/geoworlds) is a component-based information management system that addresses this issue. It brings together information analysis, retrieval and collaboration tools and integrates digital library, geographic information systems (GIS), and remote sensor data management technologies. It provides three key services: 1) rapidly assembling a custom repository of geographic information about a region, 2) bi-directionally linking it to collections of document-based information from the World-Wide Web, and 3) monitoring real-time sensor data for information that might change conclusions or decisions formed on the basis of this rich information set. GeoWorlds framework enables synchronous and asynchronous collaboration over finding, filtering, organizing and visualizing the needed information.
An algorithm to solve a two variable linear programming problem
Authors: P. Z. Wang, R. Alex, R. Ostermark, A. Jiang
Venue: Journal of Computing Sciences in Colleges (2002)

This work is about an algorithm for solving a two-dimensional linear programming problem. The algorithm is built on the concept of slope and intercept of a line. The algorithm uses a Deletion principle based on the consistency between slopes and intercepts. Every line corresponding to a constraint may be classified to belong to one the following: the upper-wall, lower-wall, or vertical-wall of the feasible region. Some of the lines corresponding to the constraints in the problem that may not form an edge of the upper or lower-walls are deleted using the Deleting principle. The corner points on the upper-wall are then used to determine the optimal solution of the problem. An algorithm to solve a higher dimensional linear program by the repeated application of the proposed two-dimensional algorithm is part of our ongoing research.
Aggregation of interacting criteria by means of the discrete Choquet integral
Authors: Jean-Luc Marichal
Venue: Aggregation operators: new trends and applications (2002)

The most often used operator to aggregate criteria in decision making problems is the classical weighted arithmetic mean. In many problems however, the criteria considered interact, and a substitute to the weighted arithmetic mean has to be adopted. Under rather natural conditions, the discrete Choquet integral is proved to be an adequate aggregation operator that extends the weighted arithmetic mean by the taking into consideration of the interaction among criteria. The axiomatic that supports the Choquet integral is presented and some subfamilies are studied.
An approach to web-based application integration using Java adapters and XML
Authors: Bill Karakostas, Stelios Christofi
Venue: Web-enabled systems integration: practices and challenges (2003)

This chapter is concerned with Application-to-Application (A2A) integration, in dynamic heterogeneous environments, where applications are not aware of each other in advance and must therefore exchange data in a peer to peer (P2P) fashion. This is achieved via dynamic discovery of application services and integration through XML message exchange using Java adapters.
An incremental unique representation for regular trees
Authors: Laurent Mauborgne
Venue: Nordic Journal of Computing (2000)

In order to deal with infinite regular trees (or other pointed graph structures) efficiently, we give new algorithms to store such structures. The trees are stored in such a way that their representation is unique and shares substructures as much as possible. This maximal sharing allows substantial memory gain and speed up over previous techniques. For example, equality testing becomes constant time (instead of O(nlog(n))). The algorithms are incremental, and as such allow good reactive behavior. These new algorithms are then applied in a representation of sets of trees. The expressive power of this new representation is exactly what is needed by the original set-based analyses of Heintze and Jaffar [1990], or Heintze [1994].
On a fieldless method for the computation of induction-generated heat in 3D non-ferromagnetic metal bodies
Authors: Ivo Doležel, Pavel Šolín, Bohuš Ulrych
Venue: Mathematics and Computers in Simulation (2003)

The paper deals with the mathematical and computer modeling of the induction heating of non-ferromagnetic metal bodies in harmonic electromagnetic fields. One of the main advantages of the presented method is the elimination of the surrounding air from the electromagnetic model, which strongly reduces the necessity of meshing and simplifies the computation. The task is formulated as a non-stationary quasi-coupled problem, with respect to the temperature dependencies of all important material parameters. Distribution of the eddy currents and Joule losses in the metal body is solved by a system of second-kind Fredholm integral equations. Existence and uniqueness of solution for the continuous as well as discrete problem is shown. Convergence results for the numerical scheme are presented. The theoretical analysis is supplemented with two illustrative examples.