ppxscal/embedding_network huggingface dataset:
On α+-stable König-Egerváry graphs
Authors: Vadim E. Levit, Eugen Mandrescu
Venue: Discrete Mathematics (2003)

The stability number of a graph G, denoted by α(G), is the cardinality of a stable set of maximum size in G. If its stability number remains the same upon the addition of any edge, then G is called α+-stable. G is a König-Egerváry graph if its order equals α(G) + µ(G), where µ(G) is the size of a maximum matching in G. In this paper, we characterize α+-stable König-Egerváry graphs, generalizing some previously known results on bipartite graphs and trees. Namely, we prove that a König-Egerváry graph G = (V,E) of order at least two is α+-stable if and only if G has a perfect matching and |∪ {V - S: S ∈ Ω(G)}| ≤ 1 (where Ω (G) denotes the family of all maximum stable sets of G). We also show that the equality |∪{V - S: S ∈ Ω(G)} = |∪{S: S ∈ Ω(G)}| is a necessary and sufficient condition for a König-Egerváry graph G to have a perfect matching. Finally, we describe the two following types of α+ stable König-Egerváry graphs: those with |∪ {S: S ∈ Ω (G)}| = 0 and | ∪{S: S ∈ Ω(G)}| = 1, respectively.
Salinas: a scalable software for high-performance structural and solid mechanics simulations
Authors: Manoj Bhardwaj, Kendall Pierson, Garth Reese, Tim Walsh, David Day, Ken Alvin, James Peery, Charbel Farhat, Michel Lesoinne
Venue: Proceedings of the 2002 ACM/IEEE conference on Supercomputing (2002)

We present Salinas, a scalable implicit software application for the finite element static and dynamic analysis of complex structural real-world systems. This relatively complete engineering software with more than 100,000 lines of C++ code and a long list of users sustains 292.5 Gflop/s on 2,940 ASCI Red processors, and 1.16 Tflop/s on 3,375 ASCI White processors.
Leakage power modeling and reduction with data retention
Authors: Weiping Liao, Joseph M. Basile, Lei He
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

In this paper, we study leakage power reduction using power gating in the forms of the Virtual power/ground Rails Clamp (VRC) and Multi-threshold CMOS (MTCMOS) techniques. We apply power gating to two circuit types: memory-based units and datapath components. Using a microarchitecture-level power simulator, as well as power and timing models derived from detailed circuit designs, we further study leakage power modeling and reduction at the system level for modern high-performance VLIW processors. We show that the leakage power can be over 40% of the total power for such processors. Moreover, we propose time-out scheduling of VRC to reduce power up to 85.65% for L2 cache. This power savings results in close to 1/3 total power dissipation for the VLIW processors we study.
Web organizations in the professional services sector
Authors: Hugo Meijers
Venue: Managing virtual web organizations in the 21st century: issues and challenges (2002)

This chapter covers a specific type of Web organization in the professional service sector. Due to the knowledge-intensive, project-based and service-centric characteristics, it acts as a prime example of possible new organization models. A general overview of all system elements is based on theoretical and practical experience out of three cases. Theoretical systemic models, academic literature and personal involvement as business architect in Web formation form the basis of this chapter. Many challenges lie ahead in developing the described Web organization form. Its limitations are not yet clear. The first signs are hopeful; its application in other sectors may well turn out to be limited.
Performance evaluation of switched ethernet for real-time industrial communications
Authors: Kyung Chang Lee, Suk Lee
Venue: Computer Standards Interfaces (2002)

The real-time industrial network, often referred to as fieldbus, is an important element for building automated manufacturing systems. Thus, in order to satisfy the real-time requirements of field devices such as sensors, actuators, and controllers, numerous standard organizations and vendors have developed various fieldbus protocols. As a result, the IEC 61158 standard, including Profibus, WorldFIP, and Foundation Fieldbus, was recently announced as an international standard. These fieldbus protocols have an important advantage over the widely used Ethernet (IEEE 802.3) in terms of the deterministic characteristics. However, the application of fieldbus has been limited due to the high cost of hardware and the difficulty in interfacing with multivendor products. In order to solve these problems, the computer network technology, especially Ethernet, is being adopted by the industrial automation field. The key technical obstacle for Ethernet for industrial applications is that its nondeterministic behavior makes it inadequate for real-time applications, where the frames containing real-time information, such as control command and alarm signal, have to be delivered within a certain time limit. Recently, the development of switched Ethernet shows a very promising prospect for industrial applications due to the elimination of uncertainties in the network operation that leads to the dramatically improved performance. This paper focuses on the application of the switched Ethernet for industrial communications. More specifically, this paper presents the performance evaluation of the switched Ethernet on an experimental network testbed along with an implementation method for using the switched Ethernet for industrial automation.
Optimal Conflict in Preference Assessment
Authors: Keely L. Croxton, Bernard Gendron, Thomas L. Magnanti, Sven Axsäter, Atul Nerkar, Philippe Delquié
Venue: Management Science (2003)

Conflict arises indecision making when the choice alternatives present strong advantages and disadvantages over one another, that is, when the trade-offs involved are large. Conflict affects human response to choice, in particular, it increases decision difficulty and response unreliability. On the other hand, larger trade-offs, i.e., higher conflict, reveal more information about an individual's preferences and mitigate the influence of measurement unreliability on preference model estimation. This suggests, somewhat counterintuitively, that there may exist some optimal level of conflict for efficient measurement of preferences. How to determine this level? This issue is examined from behavioral and analytical angles. We outline a general analysis of the interaction between trade-off size and modeling accuracy, and demonstrate its application on a simple example. The kind of analysis developed here can be conveniently implemented in a computer spreadsheet, and would be especially valuable when large amounts of preference data are to be collected, as in consumer preference studies, experimental research, and contingent valuation surveys.
Selection and Evaluation of Test Data Based on Genetic Programming
Authors: Maria Claudia F. P. Emer, Silvia Regina Vergilio
Venue: Software Quality Control (2003)

In the literature, we find several criteria that consider different aspects of the program to guide the testing, a fundamental activity for software quality assurance. They address two important questions: how to select test cases to reveal as many fault as possible and how to evaluate a test set T and end the test. Fault-based criteria, such as mutation testing, use mutation operators to generate alternatives for the program P being tested. The goal is to derive test cases capable of producing different behaviors in P and its alternatives. However, this approach usually does not allow the test of interaction between faults since the alternative differs from P by a simple modification. This work explores the use of Genetic Programming (GP), a field of Evolutionary Computation, to derive alternatives for testing P and introduces two GP-based procedures for selection and evaluation of test data. The procedures are related to the above questions, usually addressed by most testing criteria and tools. A tool, named GPTesT, is described and results from an experiment using this tool are also presented. The results show the applicability of our approach and allow comparison with mutation testing.
Evaluation of an Infrared/Radiofrequency Equipment-Tracking System in a Tertiary Care Hospital
Authors: Truls Østbye, David F. Lobach, Dianne Cheesborough, Ann Marie M. Lee, Katrina M. Krause, Vic Hasselblad, Darryl Bright
Venue: Journal of Medical Systems (2003)

Optimal management of assets in large hospitals is important to both cost control and patient care. A prospective controlled evaluation was conducted to determine whether an asset-tracking system using combined radiofrequency and infrared signals could increase equipment utilization, increase appropriate charge capture, and decrease personnel time spent looking for equipment. Two wards at Duke University Medical Center were randomly assigned as intervention and control. Beds, sequential compression devices (SCDs), and infusion pumps were monitored during a 6-week intervention period, preceded and followed by 6-week control periods. The system's accuracy for detecting equipment, relative to a trained surveyor, was greater than 80%. Accuracy for locating equipment to a specific room was 60&ndash;80%. With the system available, we observed increased utilization of infusion pumps but not of beds or SCDs. Nursing staff and system users had positive impressions of the system and its potential. Tracking systems can successfully locate hospital equipment and may improve utilization.
Applications of combinatorics to statics: rigidity of grids
Authors: Norbert Radics, Andr&#x0301;s Recski
Venue: Discrete Applied Mathematics (2002)

The infinitesimal rigidity (or briefly rigidity) of a bar-and-joint framework (in any dimension) can be formulated as a rank condition of the so-called rigidity matrix. If there are n joints in the framework then the size of this matrix is O(n), so the time complexity of determining its rank is O(n3). But in special cases we can work with graph and matroid theoretical models from which very fast and effective algorithms can be obtained. At first the case of planar square grids will be presented where they can be made rigid with diagonal rods and cables in the squares, and with long rods and cables which may be placed between any two joints of the grid. Then we will consider the one- and multi-story buildings, and finally some other results and algorithms.
Survivable embedding of logical topologies in WDM ring networks
Authors: Hwajung Lee, Hongsik Choi, Suresh Subramaniam, Hyeong-Ah Choi
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2003)

We consider the design of survivable logical topologies over physical WDM ring networks. The logical topology consists of the same set of nodes as the physical topology, and the links of the logical topology are lightpaths in the physical topology. The logical topology is said to be survivable if the failure of any single physical link does not disconnect the logical topology. In this paper, we consider the following problem. Given a logical topology with lightpath end-nodes, route the lightpaths to make the logical topology survivable if possible. Otherwise, determine and embed the minimum number of additional lightpaths to achieve survivability.
Taylor series associated with a differential-difference operator on the real line
Authors: Mohamed Ali Mourou
Venue: Journal of Computational and Applied Mathematics (2003)

We extend the classical theory of Taylor series to a first-order differential-difference operator Λ on the real line which includes as a particular case the Dunkl operator associated with the reflection group Z2 on R. More precisely, we establish first a generalized Taylor formula with integral remainder, and then specify sufficient conditions for a function on R to be expanded as a generalized Taylor series. Moreover, we provide a criterion of analyticity for functions on R involving the differential-difference operator Λ.
Implementing a web-based master's degree in instructional technology: a progress report
Authors: Phillip J. Heeler, Carolyn Hardy
Venue: Journal of Computing Sciences in Colleges (2002)

At Northwest Missouri State University, graduate computer education has existed since 1980 with the establishment of a Master of Science degree in School Computer Studies. This degree was designed specifically for teachers who were either currently teaching high school computer classes or were planning to implement computer classes in their schools. Now at the start of the 21st century, the interest in distance learning, Internet availability, curriculum topics, and modified student expectations have each forced Northwest to redesign that original degree into a Master's degree in Instructional Technology. This paper will examine the current issues associated with offering such a program as an online masters degree.
A Note on the Entropy Solutions of the Hydrodynamic Model of Traffic Flow
Authors: Shane Velan, Michael Florian
Venue: Transportation Science (2002)

This paper describes the hydrodynamic model of traffic flow, which is used to derive the future density and flow along a roadway with known initial density. The complete model is a first-order partial differential equation, complemented by the entropy condition. The contributions from fluid dynamics and traffic flow theory are integrated. The entropy condition is proven to be equivalent to driver's ride impulse. It is shown that multiple weak solutions are possible for initial value problems with certain density discontinuities. In addition,the implications of nonsmooth equilibrium flow-density relationships are explored.
Finding Geographic Information: Collection-Level Metadata
Authors: Michael F. Goodchild, Jianyu Zhou
Venue: Geoinformatica (2003)

Certain types of information are associated with specific locations on Earth&rsquo;s surface, and can be retrieved using location as the primary search key. The combination of a collection of such information and a location-based search mechanism is termed a geolibrary. A search for specific information over multiple collections is more efficient if one knows where to look. Information about the contents of a collection is termed collection-level metadata (CLM). Several conceptual designs for the process of search are reviewed, and the U.S. National Geospatial Data Clearinghouse is discussed. The Alexandria Digital Library provides an example of a large digital collection. Its geographic coverage is analyzed to determine whether its CLM can be modeled effectively. The difficulties of describing CLM are discussed from the perspective of institutional change, as library collections attempt to make themselves more accessible through the Internet.
Internet network resource information model
Authors: Chuanfeng Chen, Zengzhi Li, Yazhe Tang, Kangping Liu
Venue: Journal of Computer Science and Technology (2002)

The foundation of any network management systems is a database that contains information about the network resources relevant to the management tasks. A network information model is an abstraction of network resources, including both managed resources and managing resources. In the SNMP-based management framework, management information is defined almost exclusively from a "device" viewpoint, namely, managing a network is equivalent to managing a collection of individual nodes. Aiming at, making use of recent advances in distributed computing and in object-oriented analysis and design, the Internet management architecture can also be based on the Open Distributed Processing Reference Model (RM-ODP). The purpose of this article is to provide an Internet Network Resource Information Model. First, a layered management information architecture will be discussed. Then the Internet network resource information model is presented. The information model is specified using Object-Z.
Efficient Movie Retrieval Strategies for Movie-on-Demand Multimedia Services on Distributed Networks
Authors: Li-Gang Dong, B. Veeravalli, C. C. Ko
Venue: Multimedia Tools and Applications (2003)

In this paper, for a network-based multimedia Video/Movie-on-demand(VoD/MoD) service, we design and analyze efficient retrieval strategies to minimize both the access times of the movies and the block rates. We consider a heterogeneous set of servers and a generic network topology in which clients can request for movies from any site. We design and analyze a multiple servers retrieval strategy (MSRS) to retrieve the movies requested by the clients and present a rigorous analysis on its performance with respect to access times of the requested movies and the block rates. A generalized approach of MSRS is designed in a judicious manner using a two-step approach. In the first step, we partition the available bandwidth among the requested movies and in the second step, we derive optimal portions of the movies to be retrieved from each of the servers for each movie, based on allocated bandwidths in the first step. Thus, with the optimal playback portions of the movies using aggregate retrieval bandwidth from several servers, the access times of the movies are minimized. In the first step, in addition to the access times, we minimize the block rates by balancing the total accesses/requests among the servers. In generating the retrieval schedule, our scheme utilizes the available bandwidth (resource) among the servers and guarantees to use less buffer space than a single server retrieval strategy (SSRS). With this two-step approach, a complete flexibility is provided in tuning the access times of the movies and also shown to be robust to any variations in the user access rates of the movies, in reality. Rigorous simulation experiments are presented to observe the performance of MSRS with respect to some important system dependent parameters. Comparing with SSRS, MSRS shows better performance in the simulation.
A novel codesign approach based on distributed virtual machines
Authors: Christian Kreiner, Christian Steger, Egon Teiniker, Reinhold Weiss
Venue: Proceedings of the tenth international symposium on Hardware/software codesign (2002)

This paper describes a hardware/software codesign approach for the design of embedded systems based on digital signal processors and FPGAs. Our approach is based on distributed virtual machines for simulation and verification of the application on a Linux cluster and for running the application on different target architectures (DSPs, FPGAs) as well. The main focus is the description of the virtual machine, which was designed to make DSP applications portable across different platforms while maintaining optimal code.
Short-run forecasts of electricity loads and peaks
Authors: Ramu Ramanathan, Robert Engle, Clive W. J. Granger, Farshid Vahid-Araghi, Casey Brace
Venue: Essays in econometrics: Spectral analysis, seasonality, nonlinearity, methodology, and forecasting (2001)

This paper reports on the design and implementation of a short-run forecasting model of hourly system loads and an evaluation of the forecast performance. The model was applied to historical data for the Puget Sound Power and Light Company, who did a comparative evaluation of various approaches to forecasting hourly loads, for two years in a row. The results of that evaluation are also presented here. The approach is a multiple regression model, one for each hour of the day (with weekends modelled separately), with a dynamic error structure as well as adaptive adjustments to correct for forecast errors of previous hours. The results show that it has performed extremely well in tightly controlled experiments against a wide range of alternative models. Even when the participants were allowed to revise their models after the first year, many of their models were still unable to equal the performance of the authors' models.
Fine-grain design space exploration for a cartographic SoC multiprocessor
Authors: Alessio Bechini, Pierfrancesco Foglia, Cosimo Antonio Prete
Venue: ACM SIGARCH Computer Architecture News (2003)

Traditionally, in the field of embedded systems low power consumption and low cost have been always regarded as stringent specification constraints. In recent years, high computational power has become a fundamental requirement as well. This has been mainly determined by the introduction of new features, typical of general-purpose systems, e.g. GUI-based interfaces. In this setting, low cost, low power consumption, significant computational power and short time-to-market are conflicting needs that have to be accommodated. The adoption of a simple multiprocessor on a single chip can be deemed a convenient answer, because it is able to deliver a considerable computing power using low-cost and low-power CPU cores. In this paper, we take into account SPP, a cartographic system to be deployed on hand-held devices. We present the overall methodology used for designing the multiprocessor architecture of its hardware platform, and we focus on the activities that have been carried out to get to the more convenient setting for the system, respect to the specification requirements.The adopted design process includes two phases. The former (coarse-grain exploration) is aimed at selecting an architecture suitable to properly support the appliance features; the latter (finegrain exploration) is aimed at tuning the parameter values with the purpose of obtaining to the best system setting. We show how this tuning phase for the SPP chipset has involved the selection the clock rate and the cache coherence strategy, and the analysis of bus traffic. Moreover, from the discussed study it becomes evident that further improvements in the system performance have to be pursued possibly operating on the software components.
Guest Editors' Introduction: Taking on the Embedded System Design Challenge
Authors: Jörg Henkel, Xiaobo Sharon Hu, Shuvra S. Bhattacharyya
Venue: Computer (2003)

A new generation of synthesis tools has provided the primary driving force behind the integration of hardware and software components during system design and development.
Achieving NTRU with Montgomery Multiplication
Authors: Colleen O'Rourke, Berk Sunar
Venue: IEEE Transactions on Computers (2003)

In this paper, we propose a new unified architecture that utilizes the Montgomery Multiplication algorithm to perform a modular multiplication for both integers and binary polynomials and NTRU's polynomial multiplications. The unified design is capable of supporting a majority of public-key cryptosystems such as NTRU, RSA, Diffie-Hellman key exchange, and Elliptic Curve schemes, among others. Furthermore, the architecture is highly efficient in terms of area and speed.
Energy frugal tags in reprogrammable I-caches for application-specific embedded processors
Authors: Peter Petrov, Alex Orailoglu
Venue: Proceedings of the tenth international symposium on Hardware/software codesign (2002)

In this paper we present a software-directed customization methodology for minimizing the energy dissipation in the instruction cache, one of the most power consuming microarchitectural components of high-end embedded processors. We target particularly the instruction cache tag operations and show how an exceedingly small number of tag bits, if any, are needed to compute the miss/hit behavior for the most frequently executed application loops, thus minimizing the energy needed to perform the tag reads and comparisons. The proposed methodology exploits the fact that the code layout structure of the program loops can be identified after compile and link, and that it typically resides in a very confined memory location, for which very few bits from the effective address can be utilized as a tag. Subsequently, we present an efficient, programmable implementation to apply the suggested energy minimization technique. The experimental results show a significant decrease in energy dissipation for a set of real-life applications.