ppxscal/embedding_network huggingface dataset:
Processor Allocation and Task Scheduling of Matrix Chain Products on Parallel Systems
Authors: Heejo Lee, Jong Kim, Sung Je Hong, Sunggu Lee
Venue: IEEE Transactions on Parallel and Distributed Systems (2003)

The problem of finding an optimal product sequence for sequential multiplication of a chain of matrices (the matrix chain ordering problem, MCOP) is well-known and has been studied for a long time. In this paper, we consider the problem of finding an optimal product schedule for evaluating a chain of matrix products on a parallel computer (the matrix chain scheduling problem, MCSP). The difference between the MCSP and the MCOP is that the MCOP pertains to a product sequence for single processor systems and the MCSP pertains to a sequence of concurrent matrix products for parallel systems. The approach of parallelizing each matrix product after finding an optimal product sequence for single processor systems does not always guarantee the minimum evaluation time on parallel systems since each parallelized matrix product may use processors inefficiently. We introduce a new processor scheduling algorithm for the MCSP which reduces the evaluation time of a chain of matrix products on a parallel computer, even at the expense of a slight increase in the total number of operations. Given a chain ofnmatrices and a matrix product utilizing at most P/k processors in a P-processor system, the proposed algorithm approaches k(n - 1) / ( n +k log(k)-k) times the performance of parallel evaluation using the optimal sequence found for the MCOP. Also, experiments performed on a Fujitsu AP1000 multicomputer show that the proposed algorithm significantly decreases the time required to evaluate a chain of matrix products in parallel systems.
Semantic Data Integration in Hierarchical Domains
Authors: Isabel F. Cruz, Afsheen Rajendran
Venue: IEEE Intelligent Systems (2003)

A major challenge in building the Semantic Web is resolving the differences among heterogeneous databases. After the rise of XML as the global standard for data interchange, researchers are developing techniques to handle data integration. So far, most approaches have focused on syntactic and schematic heterogeneities. This article illustrates an approach that leverages current XML technologies and the hierarchical organization of the data to resolve semantic heterogeneities. Two real-world cases from the field of geographic information systems illustrate the approach.
Itinerary-Based Airline Fleet Assignment
Authors: Cynthia Barnhart, Timothy S. Kniker, Manoj Lohatepanont
Venue: Transportation Science (2002)

We consider the airline fleet assignment problem involving the profit maximizing assignment of aircraft types to flight legs. Although several basic formulations have been proposed, important network considerations are insufficiently treated in these formulations and the resulting solutions are often suboptimal. We propose a new formulation and solution approach that captures network effects and generates superior solutions. We quantify the benefits of our proposed approach in a case study using data from a major United States airline.
Notes on the shadow process in self--dual codes
Authors: Michio Ozeki
Venue: Discrete Mathematics (2003)

In the present paper we present some tools in exploring the shadow process in self-dual codes for the purpose of finding singly even self-dual binary codes with higher minimal distances. The present paper can be viewed as a supplementary work to the preceding works (IEEE Trans. Inform. Theory 36 (1990) 1319; IEEE Trans. Inform Theory 37 (1991) 1222).
Global Optimization Procedures for the Capacitated Euclidean and lp Distance Multifacility Location-Allocation Problems
Authors: Hanif D. Sherali, Intesar Al-Loughani, Shivaram Subramanian
Venue: Operations Research (2002)

In this paper, we study the capacitated Euclidean andlpdistance location-allocation problems. There exists no global optimization algorithm that has been developed and tested for this class of problems, aside from a total enumeration approach. Beginning with the Euclidean distance problem, we design a branch-and-bound algorithm based on a partitioning of the allocation space that finitely converges to a global optimum for this nonconvex problem. For deriving lower bounds at node subproblems in this partial enumeration scheme, we employ two types of procedures. The first approach computes a lower bound via a projected location space subproblem. The second approach derives a significantly enhanced lower bound by using a Reformulation-Linearization Technique (RLT) to transform an equivalent representation of the original nonconvex problem into a higher dimensional linear programming relaxation. In addition, certain cut-set inequalities are generated in the allocation space, and objective function based cuts are derived in the location space to further tighten the lower bounding relaxation. The RLT procedure is then extended to the generallpdistance problem, forp > 1. Computational experience is provided on a set of test problems to investigate both the projected location space and the RLT-lower bounding schemes. The results indicate that the proposed global optimization approach using the RLT-based scheme offers a promising viable solution procedure. In fact, among the problems solved, for the only two test instances available in the literature for the Euclidean distance case, we report significantly improved solutions.
An information management system with the facility to support long-term creative thinking
Authors: Hirohito Shibata, Koichi Hori
Venue: New Generation Computing (2003)

Most previous creativity support systems sustain short-term temporal thinking that is separate from users' daily activities. In this paper, we propose a system to support long-term idea-generation in daily life. The system consists of two subsystems: a management system for problems and ideas called IdeaManager; and a personal information storage system called iBox. When information is registered in iBox, it searches related problems and ideas in IdeaManager and presents the results. Users then try to generate or enhance ideas for automatically retrieved problems or ideas using registered information as the hint. To evaluate and enhance our system, we carried out a six-week experiment. Based on the results, we give some proposals for future systems.
HCI and security systems
Authors: Andrew S. Patrick, A. Chris Long, Scott Flinn
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

This workshop will seek to understand the roles and demands placed on users of security systems, and explore design solutions that can assist in making security systems usable and effective. In addition to examining end-users, this workshop will also examine the issues faced by security system developers and operators. The goal of the workshop is to build a network of interested people, share research activities and results, discuss high priority areas for research and development, and explore opportunities for collaboration.
The Softening of Hardware
Authors: Frank Vahid
Venue: Computer (2003)

In the 1940s, when modern computing began, engineers tended to view computers and the programs running on them as unified entities. Now, after decades in which software and hardware developed along separate paths, we seem to have come full circle. The hardware on which our programs run is softening, thanks to embedded systems. These systems force designers to work under incredibly tight constraints. To understand the technologies developed to satisfy these constraints, we must first distinguish the underlying embedded systems elements.
Programming environments for high-performance grid computing: the Albatross project
Authors: Thilo Kielmann, Henri E. Bal, Jason Maassen, Rob van Nieuwpoort, Lionel Eyraud, Rutger Hofman, Kees Verstoep
Venue: Future Generation Computer Systems (2002)

The aim of the Albatross project is to study applications and programming environments for computational Grids. We focus on high-performance applications, running in parallel on multiple clusters or MPPs that are connected by wide-area networks (WANs). We briefly present three Grid programming environments developed in the context of the Albatross project: the MagPIe library for collective communication with MPI, the replicated method invocation (RepMI) mechanism for Java, and the Java-based Satin system for running divide-and-conquer programs on Grid platforms.A major challenge in investigating the performance of such applications is the actual WAN behavior. Typical wide-area links are just part of the Internet and thus shared among many applications, making runtime measurements irreproducible and thus scientifically hardly valuable. To overcome this problem, we developed a WAN emulator as part of Panda, our general-purpose communication substrate. The WAN emulator allows us to run parallel applications on a single (large) parallel machine with only the wide-area links being emulated. The Panda emulator is highly accurate and configurable at runtime. We present a case study in which Satin runs across various emulated WAN scenarios.
Evaluating the success of virtual corporations with CONECT: basic procedural indications and practical application
Authors: Oliver Wohlgemuth, Thomas Hess
Venue: Managing virtual web organizations in the 21st century: issues and challenges (2002)

A fundamental condition precedent to strategic decision s of virtual corporations and their partners is a profound knowledge of the cooperation's success. This paper discusses different evaluation methods and elaborates a specific technique for multidimensional appraisals of success. It reports the first outcomes and implications of its practical use at a consultancy network.
Differential Learning and Interaction in Alliance Dynamics: a Process and Outcome Discrepancy Model
Authors: Rajesh Kumar, Kofi O. Nti
Venue: Organization Science (1998)

Our paper develops a dynamic theory of alliances by examining certain outcome and process discrepancies that may emerge as the partners interact, highlighting issues that are especially relevant in knowledge intensive alliances, such as joint R&D or product development. Firms enter into these types of alliances to create economic value and to acquire knowledge to enhance their competencies. The degree to which the partners can realize their objectives is dependent on their absorptive capacities and the collaborative strategies adopted by the partners. Outcome and process discrepancies may emerge as collaboration unfolds. Outcome discrepancies concern the ability of the partners to achieve their economic and learning objectives. Process discrepancies relate to the partners' satisfaction with the pattern of interaction, and affect their feelings of psychological attachment to the relationship. How the partners assess and react to discrepancies shapes the developmental path of an alliance. The alliance flourishes in certain states but may collapse in others as the collaboration is subjected to environmental changes or shifts in the grand strategies of the partners. Guidelines for assessing and managing outcome and process discrepancies are suggested.
Different approaches to induce cooperation in fuzzy linguistic models under the COR methodology
Authors: Jorge Casillas, Oscar Cordón, Francisco Herrera
Venue: Technologies for constructing intelligent systems: Tasks (2002)

Nowadays, Linguistic Modeling is considered to be one of the most important areas of application for Fuzzy Logic. It is accomplished by linguistic Fuzzy Rule-Based Systems, whose most interesting feature is the interpolative reasoning developed. This characteristic plays a key role in their high performance and is a consequence of the cooperation among the involved fuzzy rules.A new approach that makes good use of this aspect inducing cooperation among rules is introduced in this chapter: the Cooperative Rules methodology. One of its interesting advantages is its flexibility allowing it to be used with different combinatorial search techniques. Thus, four specific metaheuristics are considered: simulated annealing, tabu search, genetic algorithms and ant colony optimization. Their good performance is shown when solving a real-world problem.
Efficient Implementation of Cryptographically Useful 'Large' Boolean Functions
Authors: Palash Sarkar, Subhamoy Maitra
Venue: IEEE Transactions on Computers (2003)

We present low cost hardware architecture for implementing state-of-the-art theoretical constructions of secure Boolean functions suitable for stream ciphers. Using a pipelined architecture, we show that it is possible to implement systems which use Boolean functions of a relatively large number of variables. Our architecture is reconfigurable and provide a universal circuit for a certain class of secure Boolean functions.
Points of learning and teaching systems (POLTS), part II
Authors: M. O. Thirunarayanan
Venue: Ubiquity (2002)

Proposed teaching system will reflect a learner's cognitive skills
Women, technology, and gender bias
Authors: Tabatha Verbick
Venue: Journal of Computing Sciences in Colleges (2002)

Computers and technology are a large part of everyone's daily life. So why is there a concern about gender bias against women in technology? Since technology, especially in the form of computers, is such a large part of our everyday lives, women need to have experience with and knowledge of computers and other forms of technology. However, in our school systems, girls and young women are showing less and less interest in higher level computer classes, which leads to a decline in the number of computer-related degrees for women in college.The decline in the number of computer-related degrees obtained by women is not only caused by difficulties in the higher education system, but actually has its roots in the K-12 education system. Since the problems/issues start as early as the elementary level, focusing on encouraging young girls into technology-related areas in the elementary and secondary school systems is very important. However, many of the issues faced by the K-12 system are also present in the post secondary system. In this paper, the focus will be on the K-12 system and possible solutions for that system. Yet, many of the solutions presented for K-12, such as role models and mentors, can also be applied to the post secondary system.
Pipelined scheduling of tiled nested loops onto clusters of SMPs using memory mapped network interfaces
Authors: Maria Athanasaki, Aristidis Sotiropoulos, Georgios Tsoukalas, Nectarios Koziris
Venue: Proceedings of the 2002 ACM/IEEE conference on Supercomputing (2002)

This paper describes the performance benefits attained using enhanced network interfaces to achieve low latency communication. We present a novel, pipelined scheduling approach which takes advantage of DMA communication mode, to send data to other nodes, while the CPUs are performing calculations. We also use zero-copy communication through pinned-down physical memory regions, provided by NIC's driver modules. Our testbed concerns the parallel execution of tiled nested loops onto a cluster of SMP nodes with single PCI-SCI NICs inside each node. In order to schedule tiles, we apply a hyperplane-based grouping transformation to the tiled space, so as to group together independent neighboring tiles and assign them to the same SMP node. Experimental evaluation illustrates that memory mapped NICs with enhanced communication features enable the use of a more advanced pipelined (overlapping) schedule, which considerably improves performance, compared to an ordinary blocking schedule, implemented with conventional, CPU and kernel bounded, communication primitives.
Centre SIM: hour-by-hour travel demand forecasting for mobile source emission estimation
Authors: J. L. Kuhnau, K. G. Goulias
Venue: Development and application of computer techniques to environmental studies (2002)

Urban Airshed Models for estimating air pollution concentrations in a region require travel demand models that can produce hour-by-hour mobile source emission estimates. Regional simulation models of this type are currently created and tested in Australia, Europe, Japan, and the United States using a variety of theories, decision-making formalisms, and operational implementation methods. On one hand, these relatively new conceptualizations and models of transport systems have improved in a substantial way the realism of computerized decision support tools and have the potential of improving quantification of environmental impacts and transport management/control strategies. On the other hand, however, these systems require a substantial amount of data and understanding about behavior that very often are not readily available and for this require additional research. In this paper first a brief comparative overview of conceptual designs, data requirements, and models used in computer simulation of regional transport systems is provided. Then, the basic ingredients of a model system called Longitudinal Integrated Forecasting Environment (LIFE) that contains a demographic simulator, a daily time allocation and travel scheduling system, and a Geographic Information System are also presented. One component of this model system emphasizing the spatial and temporal dimensions of travel demand is described in more detail together with its validation using observed traffic data. The paper concludes with a summary and a few directions for model improvements.
The Web Service Discovery Architecture
Authors: Wolfgang Hoschek
Venue: Proceedings of the 2002 ACM/IEEE conference on Supercomputing (2002)

In this paper, we propose the Web Service Discovery Architecture (WSDA). At runtime, Grid applications can use this architecture to discover and adapt to remote services. WSDA promotes an interoperable web service discovery layer by defining appropriate services, interfaces, operations and protocol bindings, based on industry standards. It is unified because it subsumes an array of disparate concepts, interfaces and protocols under a single semi-transparent umbrella. It is modular because it defines a small set of orthogonal multipurpose communication primitives (building blocks) for discovery. These primitives cover service identification, service description retrieval, data publication as well as minimal and powerful query support. The architecture is open and flexible because each primitive can be used, implemented, customized and extended in many ways. It is powerful because the individual primitives can be combined and plugged together by specific clients and services to yield a wide range of behaviors and emerging synergies.
Inverse images of polynomial mappings and polynomials orthogonal on them
Authors: Franz Peherstorfer
Venue: Journal of Computational and Applied Mathematics (2003)

Let J be a polynomial with complex coefficients. First, we study the inverse images of the real and imaginary axes under a polynomial mapping J in detail. Then for an arbitrary polynomial ρ and a sequence (pn) of orthogonal polynomials the orthogonality behaviour of the sequence of polynomials (ρ(pn ^ J))n ∈ N is investigated. In particular necessary and sufficient conditions are given such that (ρ(pn ^ J))n ∈ N is a subsequence of polynomials orthogonal with respect to a positive measure supported on a compact subset of the real line.
Network processor requirements and benchmarking
Authors: F. Arts, P. Barri, I. Clemminck, A. Niemegeers, B. Pauwels, G. Taildeman, M. Vrana
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

This paper intends to explore the demands put on Network Processors by evaluating their claim to address adequately the needs of Broadband Integrated Services Digital Networks, based on variable length packet communication.It starts by giving an overview of the elementary functions that are seen as essential capabilities to cover the broadening spectrum of packet communication applications.Besides functionality, performance is also critical in modern packet-based communication networks, not only for performing the elementary functions in isolation, but particularly for combinations of functions, to be executed by a Network Processor in the presence of live traffic, in a true contemporary network environment.The discussion of the requirements imposed by the external world is complemented by a brief overview of needs forthcoming from inter-working with another technologically demanding part of a packet network node: the switch fabric.Requirements for functionality and performance are one thing. The capability to meet them is another. The third part of the paper will discuss the strengths and weaknesses of some possible Network Processor architectures, when trying to meet these requirements. Aspects like packet classification, packet editing, data store access, packet scheduling and packet segmentation and re-assembly for cell-based switch fabrics will be addressed.
Expressing Health Care Objects in XML
Authors: Rachael Sokolowski
Venue: Proceedings of the 8th Workshop on Enabling Technologies on Infrastructure for Collaborative Enterprises (1999)

Information about patients is critical for delivery of high quality service, but this information currently exists in representations that make access difficult or impossible. A single point of care, such as a hospital or clinic, may draw patient information from distributed heterogeneous sources such as: laboratories, scheduling and billing systems, imaging archives, and many sources of paper records including records of care from other sites and organizations.The patient medical record has been entirely focused on being in a form that is human readable and has ignored the requirements for machine processing. Health care information transaction standards, such as HL7 (Health Level 7) and EDI X12 (Electronic Data Interchange), have been almost entirely focused on machine interaction and have ignored the paper-based medical record. We need to reach a middle ground. Documents need to be in a form in which humans are able to locate, read and analyze and one in which machines are able to process. XML, combined with distributed object technologies has the potential to reach this middle ground; however, there are some challenges. These challenges relate to the state of clinical information in health care today.
Integrating electronic and technology dimensions into an advanced business elective course
Authors: Srinivasan Ragothaman, Kumoli Ramakrishnan
Venue: Journal of Computing Sciences in Colleges (2002)

This paper discusses the experience of a small Midwestern University responding to the rapid developments in the business world related to the pervasive role of technology and e-Business. Pending creation of an e-Business program, a pilot course involving the various stages of creation of e-Ventures - from "Ideas to Implementation", was developed and team-taught by three tenured faculty members at the University. Twenty-four students enrolled in the "Electronic Ventures" course were required to complete e-commerce case exercises and develop a new business venture (complete with a business plan, and a web-site) as part of the course requirement. Given the level of interest and excitement in the 'real world' about e-Businesses, the course proved to be exciting, fast paced and very current. In-depth analysis of the course development and implementation process by the instructors, pedagogies used, and student reactions to the overall experience (team exercises, web projects, computer cases etc.) are presented.