ppxscal/embedding_network huggingface dataset:
The Influence of Relational Demography and Guanxi: the Chinese Case
Authors: Jiing-Lih Farh, Anna S. Tsui, Katherine Xin, Bor-Shiuan Cheng
Venue: Organization Science (1998)

Two studies were conducted to investigate the indigenous concept of guanxi and its applications in the Chinese context. Guanxi refers to the existence of direct particularistic ties between an individual and others. We relate the concept to the idea of relational demography, which refers to similarities or differences between an individual and others on such factors as age, gender, race, religion, education, and occupation. The two studies focused on the importance of guanxi and relational demography in Chinese employment settings. In study 1, their importance was examined in a sample of 560 vertical dyads (i.e., between supervisor and subordinate) in Taiwan. In study 2, the effects were analyzed in a sample of 205 horizontal dyads, specifically between business executives and their important business connections (e.g., key customers, suppliers, bankers, government officials) in mainland China. Results support the importance of both guanxi and relational demography for subordinate trust in the supervisor, but only guanxi is found to be (extremely) important for business executives' trust in their connections. Implications for future cross-cultural research on the effect of common ties are discussed.
Multiple-writer entry consistency
Authors: Harjinder Sandhu, Tim Brecht, Diego Moscoso
Venue: Cluster Computing (2001)

In this paper, we present the design, implementation and evaluation of a new distributed shared memory (DSM) coherence model called multiple-writer entry consistency (MEC). MEC combines the efficient communication mechanisms of Lazy Release Consistency (LRC) with the flexible data management of the Shared Regions [17, 11] and Entry Consistency (EC) models [5]. This is achieved in MEC by decoupling synchronization from coherence (in contrast to the tight coupling of synchronization and coherence present in EC)while retaining the familiar synchronization structure found in Release Consistent (RC) programs. The advantage of MEC is that it allows region-based coherence protocols (those that manage data at the granularity of user-defined shared regions) to be used along side page-based protocols within an application and within the RC framework. Our experimental evaluation on an 8 processor system shows that using MEC reduces parallel execution times by margins ranging from 5% to 46% in five of the six applications that we study. However, the parallel execution time of the LRC version of the remaining application is lower than the MEC version by 48%. We conclude that offering both page-based and region-based models for coherence within the same system is not only practical but necessary.
Web Site Usability, Design, and Performance Metrics
Authors: Jonathan W. Palmer
Venue: Information Systems Research (2002)

Web sites provide the key interface for consumer use of the Internet. This research reports on a series of three studies that developand validate Web site usability, design and performance metrics, including download delay, navigability, site content, interactivity, and responsiveness. The performance metric that was developed includes the subconstructs user satisfaction, the likelihood of return, and the frequency of use.Data was collected in 1997, 1999, and 2000 from corporate Web sites via three methods, namely, a jury, third-party ratings, and a software agent. Significant associations between Web site design elements and Web site performance indicate that the constructs demonstrate good nomological validity. Together, the three studies provide a set of measures with acceptable validity and reliability. The findings also suggest lack of significant common methods biases across the jury-collected data, third-party data, and agent-collected data.Results suggest that Web site success is a first-order construct. Moreover, Web site success is significantly associated with Web site download delay (speed of access and display rate within the Web site), navigation (organization, arrangement, layout, and sequencing), content (amount and variety of product information), interactivity (customization and interactivity), and responsiveness (feedback options and FAQs).
A task duplication based scheduling algorithm for shared memory multiprocessors
Authors: Oh-Han Kang, Si-Gwan Kim
Venue: Parallel Computing (2003)

We present a task duplication based scheduling algorithm for shared memory multiprocessors (SMPs), called S2MP (scheduling for SMP), to address the problem of task scheduling. This algorithm employs heuristics to select duplication of tasks so that schedule length is reduced/minimized. The performance of the S2MP algorithm has been observed by comparing the schedule length under various number of processors and the ratio of communication to computation cost.
The Babylon Project: Toward an Extensible Text-Mining Platform
Authors: Gary H. Merrill
Venue: IT Professional (2003)

Using the given ontology-translation methodology, this platform converts ontologies to XML topic maps, then to search-engine-compatible representations.
Finite element simulation of thermoforming processes for polymer sheets
Authors: M. K. Warby, J. R. Whiteman, W.-G. Jiang, P. Warwick, T. Wright
Venue: Mathematics and Computers in Simulation (2003)

The problem of modelling and the finite element simulation of thermoforming processes for polymeric sheets at various temperatures and for different loading regimes is addressed. In particular, the vacuum forming process for sheets at temperatures of approximately 200°C and the Niebling process for sheets at temperature of 100°C with high pressure loading are both described. Discussion is given to the assumptions made concerning the behaviour of the polymers and the physical happenings in the process in order that realistic models of the inflation part of each process may be produced. Stress-strain curves produced from experimental testing of BAYFOL® at various strain rates and temperatures are presented. A model for the elastic-plastic deformation of BAYFOL® is described and is used within the finite element framework to simulate the inflation part of the Niebling process. Numerical results for the deformation of sheets into a mould in the Niebling context are presented.
The high quality electromagnetic oscillations in a dielectric microsphere with multilayer spherical stack
Authors: G. Burlak, S. Koshevaya, J. Sanchez-Mondragon, V. Grimalsky
Venue: Systems Analysis Modelling Simulation (2002)

We examine the waveguide properties of a spherical stack: a system of optical layers deposited onto the microsphere substrate, with arbitrary ratios between thicknesses of layers and a wavelength of propagating electromagnetic radiation. Frequency dependencies of the reflection coefficient and impedance of the stack are studied. An appropriate matrix formalism is developed to generalize the matrix method well-known for the plane case, into the case of the spherical layer geometry. The material losses and random deviations of thicknesses of layers are taken into account. The quarter-wave length layers are studied in details. Our numerical calculations have revealed the narrow gap of a transparency in a zone of high reflectance of a stack under the suitable parameters. The spectrum of eigenfrequencies of a spherical resonator coating by the dielectric stack has been calculated. It has been found that Q factor electromagnetic oscillations in such a system exponentially grows with increasing number of layers in the stack, but only for eigenfrequencies which are in the zone of high a stack reflection.
A fuzzy project scheduling approach to minimize schedule risk for product development
Authors: Juite Wang
Venue: Fuzzy Sets and Systems (2002)

The efficient management of product development projects is important to reduce the required development time and cost. However, each project is unique in nature and the duration of activities involed in a project often cannot be predicted accurately. The uncertainty of activity duration may lead to incorrect scheduling decisions. The objective of this research is to develop a fuzzy scheduling methodology to deal with this problem. Possibility theory is used to model the uncertain and flexible temporal information. The concept of schedule risk is proposed to evaluate the schedule performance. A fuzzy beam search algorithm is developed to determine a schedule with the minimum schedule risk and the start time of each activity is selected to maximize the minimum satisfaction degrees of all temporal constraints. In addition, the properties of schedule risk are also discussed. We show that the proposed methodology can assist project managers in selecting a schedule with the least possibility of being late in an uncertain scheduling environment. An example with an electronic product development project is used to illustrate the developed approach.
Stock Wars: Inventory Competition in a Two-Echelon Supply Chain with Multiple Retailers
Authors: Gérard P. Cachon
Venue: Operations Research (2001)

This paper studies the competitive and cooperative selection of inventory policies in a two-echelon supply chain with one supplier andN retailers. Stochastic demand is monitored continuously. Retailers incur inventory holding and backorder penalty costs. The supplier incurs holding costs for its inventory and backorder penalty costs for backorders at the retailers. The latter cost reflects the supplier's desire to maintain adequate availability of its product to consumers. Previous research finds the supply chain cost minimizing reorder point policies, the cooperative solution. The competitive solution is a Nash equilibrium, a set of reorder points such that no firm can deviate from the equilibrium and lower its cost. It is shown that Nash equilibria exist and a method is presented to find all of them. In some settings the cooperative solution is a Nash equilibrium; competition does not necessarily lead to supply chain inefficiency. In other settings, competition leads to costs that are substantially higher than optimal. Usually (but not always), the competitive supply chain carries too little inventory. Three cooperation strategies are discussed: change incentives, change equilibrium, and change control. A set of contracts is provided that changes the firms' incentives so that the optimal policy is a Nash equilibrium. An equilibrium change can improve performance but does not guarantee optimal performance. To change control, the firms let the supplier choose all reorder points, a key component in vendor managed inventory. That change leads to optimal supply chain performance.
Simplex and Interior Point Specialized Algorithms for Solving Nonoriented Multicommodity Flow Problems
Authors: P. Chardaire, A. Lisser
Venue: Operations Research (2002)

Multicommodity network flow models arise in a wide variety of contexts, typical among which is the dimensioning of telecommunication networks. In this paper, we present various approaches based on specialization of the simplex algorithm and interior-point methods to solve nonoriented multicommodity flowproblems. Algorithms are tested with data from the France-Telecom Paris district transmission network. First, we focus on a specialization for the node-arc formulation of the problem. A Primal simplex and Dual Affine Scaling algorithms exploiting the particular structure of the constraint matrix are presented and compared. Numerical results are provided for problems up to about 800,000 constraints and 6,000,000 variables. However, much more powerful approaches based on specialized decomposition methods can be implemented for solving the problem. A Dantzig-Wolfe decomposition method is designed and compared with a specialized implementation of the Analytic Center Cutting Plane Method (ACCPM). Partitioning techniques are used to exploit the structure of the master programs involved in those methods.
HMSCs as partial specifications ... with PNs as completions
Authors: Benoit Caillaud, Philippe Darondeau, Loïc Hélouët, Gilles Lesventes
Venue: Modeling and verification of parallel processes (2001)

The paper presents ongoing work aiming at understanding the nature of specifications given by High Level Message Sequence Charts and the ways in which they can be put into effective use. Contrarily to some authors, we do not set finite state restrictions on HMSCs as we feel such restrictions do not fit in with the type of distributed systems encountered today in the field of telecommunications. The talk presents first a series of undecidability results about general HMSCs following from corresponding undecidability results on rational sets in product monoids. These negative results which with one exception do not appear yet in the literature on HMSCs do indicate that the sole way in which general HMSCs may be usefully handed as behavioural specifications is to interpret their linear extensions as minimal languages, to be approximated from above in any realization. The problem is then to investigate frameworks in which these incomplete specifications may be given a meaning by a closure operation. The second part of the paper presents a closure operation relative to Petri net languages. This closure operation is an effective procedure that relies on semilinear properties of HMSCs languages. We finally present some decidability results for the distribution and verification of HMSCs transformed into Petri nets.
The A to Z of SoCs
Authors: Reinaldo A. Bergamaschi, John Cohn
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

The exploding complexity of new chips and the ever decreasing time-to-market window are forcing fundamental changes in the way systems are designed. The advent of Systems-on-Chip (SoC) based on pre-designed intellectual-property (IP) cores has become an absolute necessity for embedded systems companies to remain competitive. Designing an SoC, however, is extremely complex, as it encompasses a range of difficult problems in hardware and software design. This paper explains a wide range of SoC issues including market drivers and trends, technology and integration aspects, early architecture definition, methodology, hardware and software design and verification techniques.
Equations for bi-directional waves over an uneven bottom
Authors: M. Chen
Venue: Mathematics and Computers in Simulation (2003)

This paper is centered at deriving and studying systems modeling bi-directional surface waves over an uneven or a moving bottom. Compared with the huge amount of work on model equations describing one-way propagation of water waves, much less attention has been given to Boussinesq systems describing two-way propagation of water waves, especially to the systems which are externally forced.
Evaluation of a decision support system for the useful application of hazardous wastes with means of immobilisation-techniques
Authors: F. Felix, A. L. A. Fraaij, Ch. F. Hendriks
Venue: Development and application of computer techniques to environmental studies (2002)

In the Netherlands, dumping of hazardous wastes on a landfill is discouraged. On the other hand, the Building Material Decree set standards to building materials in order to protect surface-, groundwater and soil from the leaching of hazardous components. Moreover, the government intends to minimise the use of primary materials. Therefore, new applications of hazardous wastes are needed. The most promising is Stabilisation/Solidification, sometimes called immobilisation.Immobilisation-techniques are defined as changing the physical and chemical state of a hazardous wastes in order to reduce the leaching of hazardous components. Despite financial incentives, few applications of immobilised wastes are known. Therefore, a Decision Support System (DSS) is necessary to calculate the impact of the immobilised waste on the environment. A DSS has been developed and evaluated for a case with contaminated soil and residues from inorganic industry.The first criterion of the DSS is called long term behaviour and aims at minimising the release of hazardous compounds in relation to external influences and material properties. The second criterion, environmental load focuses at consumption of (non)renewable natural resources. The third criterion is financial consequences, which calculates the overall costs and incomes during the life cycle with respect to all stakeholders.
Cycle therapy: a prescription for fold and unfold on regular trees
Authors: Franklyn Turbak, J. B. Wells
Venue: Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming (2001)

Cyclic data structures can be tricky to create and manipulate in declarative programming languages. In a declarative setting, a natural way to view cyclic structures is as denoting regular trees, those trees which may be infinite but have only a finite number of distinct subtrees. This paper shows how to implement the unfold (anamorphism) operator in both eager and lazy languages so as to create cyclic structures when the result is a regular tree as opposed to merely infinite lazy structures. The usual fold (catamorphism) operator when used with a strict combining function on any infinite tree yields an undefined result. As an alternative, this paper defines and show how to implement a cycfold operator with more useful semantics when used with a strict function on cyclic structures representing regular trees. This paper also introduces an abstract data type (cycamores) to simplify the use of cyclic structures representing regular trees in both eager and lazy languages. Implementions of cycamores in both SML and Haskell are presented.
Facets and Reformulations for Solving Production Planning With Changeover Costs
Authors: Thomas L. Magnanti, Trilochan Sastry
Venue: Operations Research (2002)

We study a scheduling problem with changeover costs and capacity constraints. The problem is NP-complete, and combinatorial algorithms for solving it have not performed well. We identify a general class of facets that subsumes as special cases some known facets from the literature. We also develop a cutting-plane-based procedure and reformulation for the problem, and we obtain optimal solutions to problem instances with up to 600 integer variables without resorting to branch-and-bound procedures.
A method for approximate inversion of the hyperbolic CDF
Authors: G. Leobacher, F. Pillichshammer
Venue: Computing (2002)

It has been observed by E. Eberlein and U. Keller that the hyperbolic distribution fits logarithmic rates of returns of a stock much better than the normal distribution. We give a method for sampling from the hyperbolic distribution by the inversion method, which is suited for simulation using low discrepancy point sets.Instead of directly inverting the cumulative distribution function (CDF) we provide an approximation of the inverse function which is simple to obtain by standard numerical methods and which is fast to compute.
A Case for CMOS/nano co-design
Authors: Matthew M. Ziegler, Mircea R. Stan
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

The challenge of extending Moore's Law past the physical and economic barriers of present semiconductor technologies calls for novel nanoelectronic solutions. Circuits composed of mixed silicon semiconductors and nanoelectronics can provide a means for gradually switching technology paradigms. We suggest a design methodology to accompany this concept. Furthermore, we explore design tradeoffs for a nanoscale crossbar technology that supports CMOS/nano co-design.
An extensible event-based infrastructure for networked virtual worlds
Authors: Jim Purbrick, Chris Greenhalgh
Venue: Presence: Teleoperators and Virtual Environments (2003)

Many VR platforms emphasize extensibility to support as wide a range of applications as possible. The current trend is to move this extensibility to lower levels of the system to support extensibility of infrastructure mechanisms such as networking protocols. This kind of extensibility allows the runtime of the virtual environment system to evolve even while the system is running. This paper presents a new virtual environment platform that allows multiple infrastructure mechanisms to be added to and coexist within the running system, with different elements of the virtual world using different mechanisms. This allows the virtual environment system to efficiently support a wider range of applications by, for example, having only certain virtual objects use conservative consistency and persistence. It can also optimize the performance of the CVE by tailoring the infrastructure mechanisms according to the different roles played by different objects in the virtual environment.
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Venue: Symposium on Principles of Database Systems (2003)

This volume contains the proceedings of the Twenty-second ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS 2003), held at San Diego, California on June 9-11, 2003 in conjunction with the 2003 ACM SIGMOD International Conference on Management of Data and as part of the Federated Computing Research Conference FCRC 2003. It consists of a paper based on the invited talk by Rick Hull, a paper based on the invited tutorial by Rakesh Agrawal, and 27 contributed papers that were selected by the program committee for presentation at the symposium.The contributed papers were selected from 136 submissions. Most of the papers are "extended abstracts" and are preliminary reports on work in progress. While they have been read by program committee members, they have not been formally refereed. It is expected that much of the research described in these papers will be published in detail in computer science journals.The program committee selected \An Information-Theoretic Approach to Normal Forms for Relational and XML Data" by Marcelo Arenas and Leonid Libkin for the PODS 2003 Best Paper Award and "Algorithms for Data Migration with Cloning" by Samir Khuller, Yoo-Ah Kim, Yung-Chun (Justin) Wan for the PODS 2003 Best Newcomer Award. Warmest congratulations to the authors of these papers.
Automatic pool allocation for disjoint data structures
Authors: Chris Lattner, Vikram Adve
Venue: ACM SIGPLAN Notices (2003)

This paper presents an analysis technique and a novel program transformation that can enable powerful optimizations for entire linked data structures. The fully automatic transformation converts ordinary programs to use pool (aka region) allocation for heap-based data structures. The transformation relies on an efficient link-time interprocedural analysis to identify disjoint data structures in the program, to check whether these data structures are accessed in a type-safe manner, and to construct a Disjoint Data Structure Graph that describes the connectivity pattern within such structures. We present preliminary experimental results showing that the data structure analysis and pool allocation are effective for a set of pointer intensive programs in the Olden benchmark suite. To illustrate the optimizations that can be enabled by these techniques, we describe a novel pointer compression transformation and briefly discuss several other optimization possibilities for linked data structures.