ppxscal/embedding_network huggingface dataset:
Conflict driven techniques for improving deterministic test pattern generation
Authors: Chen Wang, Sudhakar M. Reddy, Irith Pomeranz, Xijiang Lin, Janusz Rajski
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

This work presents several new techniques for enhancing the performance of deterministic test pattern generation for VLSI circuits. The techniques introduced are called dynamic decision ordering, conflict driven recursive learning and conflict learning. An important feature shared by all these techniques is that they are triggered by the occurrence of a conflict in the generation of tests. Hence, they are not active all the time nor for all the faults. This feature allows the ATPG system that uses these techniques to resolve hard-to-resolve faults with far fewer backtracks and leaves the system as efficient as before in the absence of conflicts. We have incorporated these techniques into a commercial D-algorithm based ATPG tool. The experimental results on full scan versions of ITC'99 benchmark circuits demonstrate an improvement of the ATPG system both in the number of aborted faults and in test generation time.
Increasing business value of communications infrastructure: the case of internet-based virtual private networks
Authors: Bongsik Shin, Daniel C. Kinsella,  Jr.
Venue: Creating business value with information technology: challenges and solutions (2003)

An Internet-based Virtual Private Network (IVPN) is a system and service that enables secure communication within a controlled user group across the Internet public infrastructure. For the last few years, the Internet-based VPN has been available, providing organizational use for meaningful applications. The paper empirically investigates the value of IVPNs in managing communications among distributed business entities. For this, we conducted two case studies based on the information gathered from two companies. Then, a general decision model of the IVPN is proposed, which could be used for the assessment of its strategic value as well as for the design of virtual telecommunication networks at other organizations.
Trust as an Organizing Principle
Authors: Bill McEvily, Vincenzo Perrone, Akbar Zaheer
Venue: Organization Science (2003)

Although research on trust in an organizational context has advanced considerably in recent years, the literature has yet to produce a set of generalizable propositions that inform our understanding of the organization and coordination of work. We propose that conceptualizing trust as an organizing principle is a powerful way of integrating the diverse trust literature and distilling generalizable implications for how trust affects organizing. We develop the notion of trust as an organizing principle by specifying structuring and mobilizing as two sets of causal pathways through which trust influences several important properties of organizations. We further describe specific mechanisms within structuring and mobilizing that influence interaction patterns and organizational processes. The principal aim of the framework is to advance the literature by connecting the psychological and sociological micro-foundations of trust with the macro-bases of organizing. The paper concludes by demonstrating how the framework can be applied to yield novel insights into traditional views of organizations and to stimulate original and innovative avenues of organizational research that consider both the benefits and downsides of trust.
A Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem
Authors: Athanasios K. Ziliaskopoulos
Venue: Transportation Science (2000)

Recently, Daganzo introduced the cell transmission model--a simple approach for modeling highway traffic flow consistent with the hydrodynamic model. In this paper, we use the cell transmission model to formulate the single destination System Optimum Dynamic Traffic Assignment (SO DTA) problem as a Linear Program (LP). We demonstrate that the model can obtain insights into the DTA problem, and we address various related issues, such as the concept of marginal travel time in a dynamic network and system optimum necessary and sufficient conditions. The model is limited to one destination and, although it can account for traffic realities as they are captured by the cell transmission model, it is not presented as an operational model for actual applications. The main objective of the paper is to demonstrate that the DTA problem can be modeled as an LP, which allows the vast existing literature on LP to be used to better understand and compute DTA. A numerical example illustrates the simplicity and applicability of the proposed approach.
The virtual showcase as a new platform for augmented reality digital storytelling
Authors: Oliver Bimber, L. Miguel Encarnação, Dieter Schmalstieg
Venue: Proceedings of the workshop on Virtual environments 2003 (2003)

In this paper we discuss a case study for which we applied a customized augmented reality display -the Virtual Showcase- as a new platform for digital storytelling. Different storytelling components are identified and examples for their specific realization are explained. Our case study focuses on communicating scientific information to a novice audience in a museum context. Addressing first user feedback, we describe our current efforts of improvement.
Trust Transfer on the World Wide Web
Authors: Katherine J. Stewart
Venue: Organization Science (2003)

The World Wide Web (WWW) has been touted as providing great opportunities for small businesses to compete and thrive. Concerns about trust have been identified as a barrier to such businesses' success. This research explores how consumers' initial trust judgments about organizations they encounter on the Web may be influenced by hypertext links from trusted websites and associations with the more trust-inducing traditional retail channel. This paper develops and tests a cognitive model of the trust transfer process, arguing that trust is transferred across hypertext links based on the perceived interaction and similarity of the linked organizations, and that institution-based trust is transferred from the traditional shopping channel to a Web-based organization based on evidence that the Web-based organization has a physical store. An experimental study shows that a hypertext link from one website to another increased the extent to which the linked organizations were perceived to have a business relationship and be similar, and these perceptions had a positive influence on trusting beliefs regarding the linked site. Associating with the physical shopping channel by showing a picture of a building on a website increased the extent to which subjects reported intention to buy from the site. The study provided empirical evidence that trusting beliefs regarding the website had a significant positive effect on intention to buy from it. This paper discusses further development of the trust transfer model based on the social perception literature and explores implications for future research.
Inventory-Service Optimization in Configure-to-Order Systems
Authors: Feng Cheng, Markus Ettl, Grace Lin, David D. Yao
Venue: Manufacturing Service Operations Management (2002)

This study is motivated by a process-reengineering problem in personal computer (PC) manufacturing, i.e., to move from a build-to-stock operation that is centered around end-product inventory towards a configure-to-order (CTO) operation that eliminates endproduct inventory. In fact, CTO has made irrelevant the notion of preconfigured machine types and focuses instead on maintaining the right amount of inventory at the components. CTO appears to be the ideal operational model that provides both mass customization and a quick response time to order fulfillment. To quantify the inventory-service trade-off in the CTO environment, we develop a nonlinear optimization model with multiple constraints, reflecting the service levels offered to different market segments. To solve the optimization problem, we develop an exact algorithm for the important case of demand in each market segment having (at least) one unique component, and a greedy heuristic for the general (nonunique component) case. Furthermore, we show how to use sensitivity analysis, along with simulation, to fine-tune the solutions. The performance of the model and the solution approach is examined by extensive numerical studies on realistic problem data. We present the major findings in applying our model to study the inventory-service impacts in the reengineering of a PC manufacturing process.
Transformation formula for a double Clausenian hypergeometric series, its q-analogue, and its invariance group
Authors: J. Van der Jeugt
Venue: Journal of Computational and Applied Mathematics (2002)

A transformation formula for a double basic hypergeometric series of type φ1:2;20:2;2 is derived. This transformation yields a double series analogue of Sears' transformation for a terminating 3φ2 series. In the limit q → 1, the formula reduces to a transformation for a terminating double Clausenian hypergeometric series of unit argument (one of the proper Kampé de Fériet series, F1:2;20:2;2(1,1)). This formula is a double series analogue of Whipple's terminating 3F2 transformation. This transformation gives rise to a transformation group (the invariance group) acting on the parameters of the double series. The invariance group is examined and shown to be a subgroup of a double copy of the symmetries of the square.
Lower bound estimation of hardware resources for scheduling in high-level synthesis
Authors: Shen Zhaoxuan, Jong Ching Chuen
Venue: Journal of Computer Science and Technology (2002)

In high-level synthesis of VLSI circuits, good lower bound prediction can efficiently narrow down the large space of possible designs. Previous approaches predict the lower bound by relaxing or even ignoring the precedence constraints of the data flow graph (DFG), and result in inaccuracy of the lower bound. The loop folding and conditional branch were also not considered. In this paper, a new stepwise refinement algorithm is proposed, which takes consideration of precedence constraints of the DFG to estimate the lower bound of hardware resources under time constraints. Processing techniques to handle multi-cycle. chaining, pipelining, as well as loop folding and mutual exclusion among conditional branches are also incorporated in the algorithm. Experimental results show that the algorithm can produce a very tight and close to optimal lower bound in reasonable computation time.
Some numerical computations concerning Spinor Zeta functions in genus 2 at the central point
Authors: Winfried Kohnen, Michael Kuss
Venue: Mathematics of Computation (2002)

We numerically compute the central critical values of odd quadratic character twists with respect to some small discriminants D of spinor zeta functions attached to Seigel-Hecke eigenforms F of genus 2 in the first few cases where F does not belong to the Maass space. As a result, in the cases considered we can numerically confirm a conjecture of Böcherer, according to which these central critical values should be proportional to the squares of certain finite sums of Fourier coefficients of F.
Linking Organizational Values to Relationships with External Constituents: A Study of Nonprofit Professional Theatres
Authors: Glenn B. Voss, Daniel M. Cable, Zannie Giraud Voss
Venue: Organization Science (2000)

This study explores the organizational values that characterize firms in the nonprofit professional theatre industry, and examines the links between firms' organizational values and their relationships with external constituents. Using grounded research methods, we uncover five value dimensions that are relevant to arts organizations: prosocial, artistic, financial, market, and achievement. Using a sample of 97 nonprofit theatres, we extend our qualitative inquiry with an empirical investigation of how firms enact their organizational values to build and maintain relationships with external constituents. Results from a two-wave survey design indicate consistent patterns of association between organizational values and (1) perceptions of values congruence with external constituents, (2) human resource allocation and programming decisions that firms make to support relationships with external constituents, and (3) the level of financial resources that firms obtain from their relationships with different external constituents. Interestingly, results from both investigations hint at underlying tensions between competing values in cultural firms, such as pressures to be both artistic- and market-oriented.
AudioBattleship: blind learners collaboration through sound
Authors: Jaime Sánchez, Nelson Baloian, Tiago Hassler, Ulrich Hoppe
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

A growing number of audio-based applications for blind learners have being produced in the last few years. Many of them focus on the development of 3D audio interfaces to map the entire surrounding space. Other studies center on the impact of sound interaction on cognition by evaluating the usability of these applications. No previous work has centered on using spatialized sound to develop collaborative skills in blind learners. This ongoing research study introduces AudioBattleShip, an interactive audio-based environment to enhance collaboration and cognition in blind learners. AudioBattleship mimics the traditional game battleship for sighted people but without visual cues. A preliminary pilot study has been implemented showing that blind children collaboration can be enhanced through the interaction with spatialized sound.
Energy savings through compression in embedded Java environments
Authors: G. Chen, M. Kandemir, N. Vijaykrishnan, M. J. Irwin, W. Wolf
Venue: Proceedings of the tenth international symposium on Hardware/software codesign (2002)

Limited energy and memory resources are important constraints in the design of an embedded system. Compression is an useful and widely employed mechanism to reduce the memory requirements of the system. As the leakage energy of a memory system increases with its size and because of the increasing contribution of leakage to overall system energy, compression also has a significant effect on reducing energy consumption. However, storing compressed data/instructions has a performance and energy overhead associated with decompression at runtime. The underlying compression algorithm, the corresponding implementation of the decompression and the ability to reuse decompressed information critically impact this overhead.In this paper, we explore the influence of compression on overall memory energy using a commercial embedded Java virtual machine (JVM) and a customized compression algorithm. Our results show that compression is effective in reducing energy even when considering the runtime decompression overheads for most applications.
Developing a Theory of Reverse Logistics
Authors: Shad Dowlatshahi
Venue: Interfaces (2000)

Reverse logistics, a fairly new concept in logistics, has gained increasing importance as a profitable and sustainable business strategy. I describe a holistic view of reverse logistics and distill 11 insights for successful implementation of reverse logistics from the existing literature and published case studies. The strategic factors consist of strategic costs, overall quality, customer service, environmental concerns, and legislative concerns. The operational factors consist of cost-benefit analysis, transportation, warehousing, supply management, remanufacturing and recycling, and packaging. Insights about these factors together form the state-of-the-art knowledge about the keys to successful design and use of reverse-logistics systems.
Eliminating dead code on recursive data
Authors: Yanhong A. Liu, Scott D. Stoller
Venue: Science of Computer Programming (2003)

This paper describes a powerful method for dead-code analysis and elimination in the presence of recursive data constructions. We describe partially dead recursive data using liveness patterns based on general regular tree grammars extended with the notion of live and dead, and we formulate the analysis as computing liveness patterns at all program points based on constraints constructed from the program and programming language semantics. The analysis yields the most precise program-based grammars that satisfy the constraints. The analysis algorithm takes cubic time in terms of the size of the program in the worst case but is very efficient in practice, as shown by our prototype implementation. The analysis results are used to identify and eliminate dead code. The framework for representing and analyzing properties of recursive data structures using general regular tree grammars applies to other analyses as well.
A fisheye calendar interface for PDAs: providing overviews for small displays
Authors: Benjamin B. Bederson, Aaron Clamage, Mary P. Czerwinski, George G. Robertson
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

DateLens is a novel calendar interface for PDAs. It supports users in performing planning and analysis tasks by using a fisheye representation of dates coupled with compact overviews, user control over the visible time period, and integrated search. This enables users to see overviews and to easily navigate the calendar structure, and to discover patterns and outliers.
Segmentation of brush strokes by saliency preserving dual graph contraction
Authors: P. Kammerer, R. Glantz
Venue: Pattern Recognition Letters (2003)

Brush strokes are segmented from works of art by a combination of filtering and grouping. Filtering yields local evidence for crossings and lines. Grouping is done on two levels of scale and abstraction. The first level is a dual pair (Gu, Gu) of attributed plane graphs, the vertex and edge attributes of which are derived from the filtering. The result of the grouping on this level is given by a topological minor Gtop of Gu. The derivation of Gtop from Gu is done by dual graph contraction, i.e. by parallel steps, each of which involves only local operations on Gu and Gu. This step is shown to preserve connections via most salient paths. On the second level consecutive edges of Gtop are grouped to strokes which are consistent with our model of strokes from superimposed brush moves. Experimental results are presented for portrait miniatures.
Development of a stand-alone lighting system for 70 W HPS lamps
Authors: S. Farhangi, M. Mostafavi, A. Poursoltani
Venue: Iranian Journal of Science and Technology (2002)

A stand-alone photovoltaic lighting system is reported in this paper. The system uses a 70 W HPS lamp with a DC bus voltage of 12 V. An efficient electronic ballast, which makes possible the use of 70 W HPS lamp in photovoltaic applications is reported. Design of the ballast is discussed. The ballast has an efficiency of more than 87 percent for the operating load range. The performance of the HPS lamp with the electronic ballast is reported and compared with passive ballast.
Flexible network topologies for your computing lab: VLAN and router technology at work in the classroom
Authors: Robert Belles, Sandra Gorka, Jacob R. Miller
Venue: Journal of Computing Sciences in Colleges (2002)

In our multipurpose computer labs, we often have the necessity of reconfiguring the network topology to accommodate different classes. Some classes require that the lab be configured as a single network with Internet access while, at the other end of the spectrum, some classes require that the lab be configured as multiple, separate, small networks isolated from the Internet and the rest of the school. Historically, we have accomplished this using a series of hubs and switches to connect many small networks into one large one. When required, we unplug the small networks from the switch separating them from the school, the Internet and/or each other. This process has several inherent drawbacks. This report documents our experiences using VLAN and router technology to configure the network topology of our multi-use computer lab, allowing us to have more control over the network configuration. Advantages include reduced administration and maintenance costs, allowing the demonstration of router and switch functionality, and allowing students to be exposed to the functionality of different network configurations and equipment.
Statistical Real-Time Communication over Ethernet
Authors: Seok-Kyu Kweon, Kang G. Shin
Venue: IEEE Transactions on Parallel and Distributed Systems (2003)

In order to realize real-time communication over Ethernet or fast Ethernet, one must be able to bound the medium access time within an acceptable limit. The multiple access nature of Ethernet makes it impossible to guarantee a deterministic medium access time (hence, packet-delivery deadlines) to individual stations. However, one can bound the medium access time statistically by limiting the packet-arrival rate at the medium access control (MAC) layer. While considering automated manufacturing systems as the main target application, this paper addresses the connection admission control (CAC) problem for statistically bounding the medium access time of Ethernet. Specifically, a packet is guaranteed to have a medium access time smaller than a predefined bound with a certain probability if the instantaneous packet-arrival rate is kept below a certain threshold. Through a mathematical analysis, we first derived such a threshold. In order to keep the packet-arrival rate under the given threshold, we developed and installed a middleware which 1) resides between the transport layer and the Ethernet datalink layer and 2) smooths packet streams between them. The implementation of this middleware requires only a minimal change in the OS kernel without any modification to the current standard of Ethernet MAC protocol or TCP or UDP/IP stack. In order to solve the CAC problem, we derived the probability of transmitting a packet successfully upon each trial by modeling the MAC protocol, 1-persistent CSMA/CD, and the collision resolution protocol¿Binary Exponential Backoff¿of Ethernet. Our in-depth simulation results have shown this analytic model to provide a reasonably accurate estimate of packet-loss (or deadline-miss) ratio over Fast Ethernet. Finally, we implemented the middleware on the Linux OS, experimentally demonstrating the effectiveness of our approach in providing real-time communication over Ethernet.
Objects with prototype-based mechanisms
Authors: Linda Wilkens
Venue: Journal of Computing Sciences in Colleges (2002)

In this paper we consider using the popular scripting language JavaScript / ECMAScript to teach object-based and object-oriented programming to beginning or novice programmers. We explore JavaScript's use of constructors and prototypes as an alternative to class-definition based systems. We show that JavaScript's prototype-based mechanisms provide the four essential components of the object-oriented paradigm: abstraction, encapsulation, modularity, and hierarchy.We provide examples which conform to the ECMAScript standard, and which have been implemented and tested using the JavaScript interpreter incorporated into Netscape Communicator 4.7.