ppxscal/embedding_network huggingface dataset:
Knowledge Seeking and Location Choice of Foreign Direct Investment in the United States
Authors: Wilbur Chung, Juan Alcácer
Venue: Management Science (2002)

To what extent do firms go abroad to access technology available in other locations? This paper examines whether and when state technical capabilities attract foreign investment in manufacturing from 1987-1993. We find that on average state R--D intensity does not attract foreign direct investment. Most investing firms are in lower-tech industries and locate in low R--D intensity states, suggesting little interest in state technical capabilities. In contrast, we find that firms in research-intensive industries are more likely to locate in states with high R--D intensity. Foreign firms in the pharmaceutical industry value state R--D intensity the most, at a level twice that of firms in the semiconductor industry, and four times that of electronics firms. Interestingly, not only firms from technically lagging nations, but also some firms from technically leading nations are attracted to R--D intensive states. This suggests that beyond catching up, firms use knowledge-seeking investments also to source technical diversity.
Boolean Decomposition Using Two-literal Divisors
Authors: Nilesh Modi, Jordi Cortadella
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

This paper is an attempt to answer the following question:how much improvement can be obtained in logic decompositionby using Boolean divisors? Traditionally, the existence of toomany Boolean divisors has been the main reason why Booleandecomposition has had limited success. This paper explores anew strategy based on the decomposition of Boolean functionsby means of two-literal divisors. The strategy is shown to derivesuperior results while still maintaining an affordable complexity.The results show improvements of 15% on average, andup to 50% in some examples, w.r.t. algebraic decomposition.
Management of wireless home networking technologies in the context of composite radio environments
Authors: P. Demestichas, A. Oikonomou, G. Vivier, M. Theologou
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2003)

BRAN/WLAN systems are seen as promising solutions for covering residential, business, etc., environments, and therefore realising the wireless home/office concept. This paper presents management functionality for augmenting the exploitation of these systems, by making feasible their integration in a composite radio (CR) context. In the followed approach the first point will be to revisit the main features of a HiperLAN2 system. Next, will be the presentation of a general Service and Network Management System (SNMS) architecture. The last point will be the functionality of the SNMS components that are tailored to the managed HiperLAN2 technology. A set of resource management problems will be addressed, for exploiting HiperLAN2 networks in a CR context.
Product family modeling and design support: An approach based on graph rewriting systems
Authors: Xuehong Du, Jianxin Jiao, Mitchell M. Tseng
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2002)

Earlier research on product family design (PFD) often highlights isolated and successful empirical studies with a limited attempt to explore the modeling and design support issues surrounding this economically important class of engineering design problems. This paper proposes a graph rewriting system to organize product family data according to the underpinning logic and to model product derivation mechanisms for PFD. It represents the structural and behavioral aspects of product families as family graphs and related graph operations, respectively. The derivation of product variants becomes a graph rewriting process, in which family graphs are transformed to variant graphs by applying appropriate graph rewriting rules. The system is developed in the language of programmed graph rewriting systems or PROGRES, which supports the specification of hierarchical graph schema and parametric rewriting rules. A meta model is defined for family graphs to factor out those entities common to all product families. A generic model is defined to describe all specific entities relevant to particular families. An instance model describes all product variants for individual customer orders. A prototype of a graph-based PFD system for office chairs is also developed. The system can provide an interactive environment for customers to make choices among product offerings. It also facilitates design automation of product families and enhances interactions and negotiations among sales, design, and manufacturing.
A performance analysis tool for performance-driven micro-cell generation
Authors: R. Peset LLopis, R. J. H. Koopman, H. G. Kerkhoff, J. A. Braat
Venue: Proceedings of the conference on European design automation (1991)

A new method is presented to determine the power dissipation and propagation-delay time of small logical blocks (micro-cells). This method is a combination of the RC-tree and the macro modeling methods. It is a fast and accurate method, three orders of magnitude faster that SPICE, while the maximal error is 10 percent. This method will be used in a performance-driven micro-cell generator for a sea-of-gates environment.
A pressure weighted upwinding scheme for calculating flows on unstructured grids
Authors: Masoud Darbandi, Kiumars Mazaheri-Body
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

The correct estimation of conservative statements at the control volume surfaces has a serious influence in the accuracy of numerical solution and even improving the convergence history. In this paper, a sound physical pressure-weighted scheme is utilized to calculate the convective fluxes at cell faces. The method is extended in a manner which permits arbitrarily choice of element distributions and orientations in the solution domain, either entirely or partly, wherever the advantages of one distribution/orientation dominate those of others. In this regard, the necessary modifications which are needed to be undertaken in order to include the advantages of utilizing the unstructured element distributions/orientations in a finite element volume context are presented. Eventually, the extended formulations are validated against a standard benchmark test case.
Managing credit lines and prices for bank one credit cards
Authors: Margaret S. Trench, Shane P. Pederson, Edward T. Lau, Lizhi Ma, Hui Wang, Suresh K. Nair
Venue: Interfaces (2003)

We developed a method for managing the characteristics of a bank's card holder portfolio in an optimal manner. The annual percentage rate (APR) and credit line of an account influence card use and bank profitability. Consumers find low APRs and high credit lines attractive. However, low APRs may reduce bank profitability, while indiscriminate increases in credit-lines increase the bank's exposure to credit loss. We designed the PORTICO (portfolio control and optimization) system using Markov decision processes (MDP) to select price points and credit lines for each card holder that maximize net present value (NPV) for the portfolio. PORTICO uses account-level historical information on purchases, payments, profitability, and delinquency risk to determine pricing and credit-line changes. In competitive benchmark tests over more than a year, the PORTICO model outperforms the bank's current method and may increase annual profits by over $75 million.
Generator operations of asynchronous induction machines connected to ac or dc active/passive electrical networks
Authors: D. Iannuzzi, E. Pagano, L. Piegari, O. Veneri
Venue: Mathematics and Computers in Simulation (2003)

The paper analyses generator operations of asynchronous machines when they are connected to a passive electrical network either directly or by an intermediate static power converter. The analysis is performed by taking into account the saturation phenomena of the main magnetic circuits of the machine. Mathematical models of both physical configurations are given and their non-linearities are evidenced. The paper investigates the existence of periodical solutions related to stable operations of the systems. Numerical and experimental results support the theoretical analysis.
Beyond models of national culture in information systems research
Authors: Michael D. Myers, Felix B. Tan
Venue: Advanced topics in global information management (2003)

Many IS scholars argue that global organizations need to understand cultural differences if they are to successfully deploy information technology. We agree that an understanding of cultural differences is important, but suggest that the concept of "national culture" that has tended to dominate the IS research literature is too simplistic. In this article, we challenge information systems researchers to go beyond models of national culture. We propose that IS researchers should adopt a more dynamic view of culture - one that sees culture as contested, temporal and emergent.
An efficient and practical (t, n) threshold proxy signature scheme with known signers
Authors: Hui-Feng Huang, Chin-Chen Chang
Venue: Fundamenta Informaticae (2002)

Previously, all of the proposed threshold proxy signature schemes which have been based on the discrete logarithms required a protocol to generate and verify a shared secret among the proxy group. Therefore, it is necessary for the proxy signers to execute a lot of expensive modular exponential computations and communications to obtain and verify a shared secret. Thus, it is very time-consuming to construct the proxy signature. Moreover, some of the existing threshold proxy signature schemes reveal that the receiver cannot find out who signed the proxy signatures. In this paper, we proposed a practical, efficient, and low communications (t, n) threshold proxy signature scheme based on RSA cryptosystem. By using our way, not only the original signer can know who generated the proxy signature, but also everyone can be a verifier to certify the actuality of the group signers who made it. So, it is very convenient to clarify the responsibility of the document's signers fairly.
Formalization of generics for the .NET common language runtime
Authors: Dachuan Yu, Andrew Kennedy, Don Syme
Venue: ACM SIGPLAN Notices (2004)

We present a formalization of the implementation of generics in the .NET Common Language Runtime (CLR), focusing on two novel aspectsof the implementation: mixed specialization and sharing, and efficient support for run-time types. Some crucial constructs used in the implementation are dictionaries and run-time type representations. We formalize these aspects type-theoretically in a way that corresponds in spirit to the implementation techniques used in practice. Both the techniques and the formalization also help us understand the range of possible implementation techniques for other languages, e.g., ML, especially when additional source language constructs such as run-time types are supported. A useful by-product of this study is a type system for a subset of the polymorphic IL proposed for the .NET CLR.
Approaches for generating moving adaptive meshes: location versus velocity
Authors: Weiming Cao, Weizhang Huang, Robert D. Russell
Venue: Applied Numerical Mathematics (2003)

A variety of approaches for generating moving adaptive methods are summarized and compared. They basically fall into two groups: the velocity and the location based methods. The features, including the advantage and weakness, of each group are addressed. Brief numerical results are presented for several commonly used approaches to highlight their features and performance.
New separations in propositional proof complexity
Authors: Nathan Lee Segerlind
Venue:  (2003)

The problem of recognizing satisfiable formulas and propositional tautologies is ubiquitous in computer science. Propositional proof systems are methods for establishing that a propositional formula is a tautology. In general, proof systems correspond to algorithms for satisfiability so that lower bounds on proof sizes in a given system correspond to lower bounds on the run time of the related satisfiability algorithms. Moreover, the question of proof sizes is intimately connected to questions such as NP versus coNP. In this dissertation, we study the sizes of proofs in different propositional proof systems. We prove new lower bounds on the sizes of proofs in the Res( k) systems, we prove that constant-depth Frege systems with counting axioms do not polynomially simulate constant-depth Frege systems with counting gates, and we prove that constant-depth Frege systems with counting axioms polynomially simulate Nullstellensatz refutations. As corollaries to these results, we obtain the first separation of the Nullstellensatz and polynomial calculus systems with respect to size, and an exponential separation between constant-depth Frege systems and constant-depth Frege systems with counting axioms with respect to constant-width CNFs. The lower bounds for the Res(k) systems include: (1) The 2n to n weak pigeonhole principle requires size 2Wne to refute in Res( logn/loglogn ). (2) For each k, there exists a constant w > k so that random w-CNFs in n variables require size 2Wne to refute in Res(k). (3) We demonstrate sets of clauses on n variables that have polynomial size Res(k + 1) refutations, but require size 2Wne to refute in Res(k). Our lower bounds for proof sizes are proved using extensions of the switching lemma technique. The lower bound proofs for the Res(k) systems use a method we call switching with small restrictions, and the lower bound proof for constant-depth Frege with counting axioms uses a switching lemma that makes random substitutions rather than 0/1 restrictions. The switching lemma for small restrictions allows us to prove the first separation between depth d circuits of bottom fan-in k + 1 and depth d circuits of bottom fan-in k.
High-k gate stacks for planar, scaled CMOS integrated circuits
Authors: H. R. Huff, A. Hou, C. Lim, Y. Kim, J. Barnett, G. Bersuker, G. A. Brown, C. D. Young, P. M. Zeitzoff, J. Gutt, P. Lysaght, M. I. Gardner, R. W. Murto
Venue: Microelectronic Engineering (2003)

The gate stack should be regarded as a multi-element interfacial layered structure wherein the high-k gate dielectric and gate electrodes (and their corresponding interfaces) must be successfully comprehended. The surface clean and subsequent surface conditioning prior to high-k deposition as well as post-deposition annealing parameters significantly impact the equivalent oxide thickness and leakage current as well as the traditional parameters such as threshold voltage, saturation current, transconductance, and sub-threshold swing. The control of both the fixed electrical charges and charge traps incorporated at the various interfaces and within the high-k bulk film is of paramount importance to achieve the requisite transistor characteristics and, in particular, the effective carrier mobility. Interactive effects within the gate stack process modules and the subsequent integrated circuit fabrication process require the utmost attention to achieve the desired IC performance characteristics and help facilitate the continuance of Moore's Law towards the 10-nm physical gate length regime.
Fuzzy specification of finite state machines
Authors: Siegfried I. Mensch, Hans Martin Lipp
Venue: Proceedings of the conference on European design automation (1990)

Finite State Machines (FSM) are widely used in digital systems because of their transparent structure, of a thorough theoretical understanding and of powerful CAD-tools for their automated synthesis. In addition, special hardware components support the implementation of FSMs in a direct manner. The paper deals with unprecise specification techniques for FSMs that allow more design freedom than conventional ones. This strategy greatly increases the number of possible implementations especially when embedding problems in given hardware structure like programmable logic devices must be solved economically.
Numerical quadrature performed on the generalized prolate spheroidal functions
Authors: T. Levitina, E. J. Brändas
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

In the recent paper [1] on the computation of the prolate spheroidal wave functions the numerical technique for their accurate integration was also proposed. The conventional quadrature formulas can not be used here: this would cause a significant lost of accuracy. The point is that the prolate spheroidal functions may vanish exponentially fast or oscillate rapidly, accumulating zeroes near singular points ±1.
Swarming over the software barrier
Authors: H. Conrad Cunningham
Venue: Proceedings of the 6th international workshop on Software specification and design (1991)

Swarm is a concurrent programming model which integrates a Linda-like communication medium, the shared dataspace, with a UNITY-like computational model, proof system, and program structure. It generalizes the Linda tuple-space operations by providing more powerful dataspace queries. It generalizes UNITY by permitting content-based access to data, a dynamic set of statements, and the capability to control the execution mode (i.e., synchronous or asynchronous) for arbitrary collections of program statements.
The MANUS-HAND Dextrous Robotics Upper Limb Prosthesis: Mechanical and Manipulation Aspects
Authors: J. L. Pons, E. Rocon, R. Ceres, D. Reynaerts, B. Saro, S. Levin, W. Van Moorleghem
Venue: Autonomous Robots (2004)

Dextrous artificial hand design and manipulation is an active research topic. A very interesting practical application is the field of upper limb prosthetics. This paper presents the mechanical design and manipulation aspects of the MANUS-HAND project to develop a multifunctional upper limb prosthesis. The kinematics of our design makes use of the so-called underactuated principle and leads to an innovative design that triples the performance of currently existing commercial hand prosthesis. In addition, the thumb design allows its positioning both in flexion and opposition. As a consequence, up to four grasping modes (cylindrical, precision, hook and lateral) are available with just two actuators.The proposed impedance control approach allows the fingers to behave as virtual springs. Given the difficulty of including the user in the control loop, this approach is based on an autonomous coordination and control of the grasp. As a consequence, the requirements on the Human Machine interface are reduced. At the end of the paper, we briefly describe the clinical trials that were set up for evaluation purposes.
Thread Partitioning and Value Prediction for Exploiting Speculative Thread-Level Parallelism
Authors: Pedro Marcuello, Antonio González, Jordi Tubella
Venue: IEEE Transactions on Computers (2004)

Abstract--Speculative thread-level parallelism has been recently proposed as a source of parallelism to improve the performance in applications where parallel threads are hard to find. However, the efficiency of this execution model strongly depends on the performance of the control and data speculation techniques. In this work, several hardware-based schemes for partitioning the program into speculative threads are analyzed and evaluated. In general, we find that spawning threads associated to loop iterations is the most effective technique. We also show that value prediction is critical for the performance of all of the spawning policies. Thus, a new value predictor, the increment predictor, is proposed. This predictor is specially oriented for this kind of architecture and clearly outperforms the adapted versions of conventional value predictors such as the last value, the stride, and the context-based, especially for small-sized history tables.
A Comparison of Bayesian and Belief Function Reasoning
Authors: Barry R. Cobb, Prakash P. Shenoy
Venue: Information Systems Frontiers (2003)

The goal of this paper is to compare the similarities and differences between Bayesian and belief function reasoning. Our main conclusion is that although there are obvious differences in semantics, representations, and the rules for combining and marginalizing representations, there are many similarities. We claim that the two calculi have roughly the same expressive power. Each calculus has its own semantics that allow us to construct models suited for these semantics. Once we have a model in either calculus, one can transform it to the other by means of a suitable transformation.
Caramba&mdash;A Process-Aware Collaboration System Supporting Ad hoc and Collaborative Processes in Virtual Teams
Authors: Schahram Dustdar
Venue: Distributed and Parallel Databases (2004)

Organizations increasingly define many business processes as projects executed by &ldquo;virtual (project) teams&rdquo;, where team members from within an organization cooperate with &ldquo;outside&rdquo; experts. Virtual teams require and enable people to collaborate across geographical distance and professional (organizational) boundaries and have a somewhat stable team configuration with roles and responsibilities assigned to team members. Different people, coming from different organizations will have their own preferences and experiences and cannot be expected to undergo a long learning cycle before participating in team activities. Thus, efficient communication, coordination, and process-aware collaboration remain a fundamental challenge. In this paper we discuss the current shortcomings of approaches in the light of virtual teamwork (mainly Workflow, Groupware, and Project Management) based on models and underlying metaphors. Furthermore, we present a novel approach for virtual teamwork by tightly integrating all associations between processes, artifacts, and resources. In this paper we analyze (a) the relevant criteria for process-aware collaboration system metaphors, (b) coordination models and constructs for organizational structures of virtual teams as well as for ad hoc and collaborative processes composed out of tasks, and (c) architectural considerations as well as design and implementation issues for an integrated process-aware collaboration system for virtual teams on the Internet.
Wrapper Design for Testing IP Cores with Multiple Clock Domains
Authors: Qiang Xu, Nicola Nicolici
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

This paper addresses the testability problems raised by embedded cores with multiple clock domains. The proposed solution, based on a novel core wrapper architecture, shows how multi-frequency at-speed test response capture can be achieved using low-speed testers synchronized with high-speed on-chip generated clocks. Using experimental data, the trade-offs between the number of tester channels, testing time, area overhead and power dissipation are discussed.
E-community-building in wiInf-central
Authors: Bernd Pape, Leonard Reinecke, Markus Rohde, Monique Strauss
Venue: Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work (2003)

Our study examined WiInf-Central, the "virtual homeplace" of a student community at the University of Hamburg, focusing on the processes of social identity and community building. After a detailed description of WiInf-Central we review our theoretical approaches, based on Social Identity Theory and Communities of Practice, and then set out our research questions and design. Finally, we present and discuss our results, followed by some comments on the theoretical and practical implications of our findings.