ppxscal/embedding_network huggingface dataset:
Characterizing and predicting value degree of use
Authors: J. Adam Butts, Gurindar S. Sohi
Venue: Proceedings of the 35th annual ACM/IEEE international symposium on Microarchitecture (2002)

A value's degree of use---the number of dynamic uses of that value---provides the most essential information needed to optimize its communication. We present simulation results demonstrating the properties of degree of use of values, including their predictability: most static instructions generate values with few degrees of use and these exhibit temporal locality. We use these results to guide the design of a degree of use predictor. The development and detailed characterization of this predictor is the focus of this paper. Our predictor leverages future control flow information (e.g., branch predictions) to select among different possible degrees of use. We study the effects of several optimizations and variations in the predictor's algorithms to tune the predictor for maximum performance. The resulting predictor generates correct degree of use predictions for over 92% of all dynamic values and has a misprediction rate below 2.5%. Such a predictor has a wide range of potential applications in optimizing value communication.
Development of a software package for ergonomic assessment of manufacturing industry
Authors: Ashraf Shikdar, Saeed Al-Araimi, Bill Omurtag
Venue: Computers and Industrial Engineering (2002)

A computer software package has been developed to be used as a self-assessment tool to evaluate ergonomic improvement potential of production systems by engineers, managers and safety professionals. Production managers of manufacturing industries with no prior knowledge of ergonomics were able to identify ergonomic deficiencies successfully (81%) in the shop floors as a result of the application of the ergonomic assessment tool. This enabled them to formulate intervention strategies to improve ergonomic conditions in their industries. The software package is user friendly, self-explanatory and provides relevant information, data and guidelines. It is unique, as the users will have access to necessary ergonomics information, which is often lacking in the manufacturing industries, especially in developing countries.
Monotone Optimal Policies for a Transient Queueing Staffing Problem
Authors: Michael C. Fu, Steven I. Marcus, I-Jeng Wang
Venue: Operations Research (2000)

We consider the problem of determining the optimal policy for staffing a queueing system over multiple periods, using a model that takes into account transient queueing effects. Formulating the problem in a dynamic programming setting, we show that the optimal policy follows a monotone optimal control by establishing the submodularity of the objective function with respect to the staffing level and initial queue size in a period. In particular, this requires proving that the system occupancy in aG/M/s queue is submodular in the number of servers and initial system occupancy.
Knowledge warehouse: an intelligent analysis platform for enhancing management decision process
Authors: Hamid Nemati, Natalie Steiger, David Steiger, Richard T. Herschel
Venue: Decision making support systems: achievements, trends and challenges for (2002)

This paper proposes a knowledge warehouse architecture to enhance both DSS and knowledge management efforts. First, differences in data, information, and knowledge are discussed. Then, tacit and explicit knowledge, their relationship within the knowledge spiral, and their criticality to organizational knowledge creation and decision making are explored. Finally, a knowledge warehouse architecture is proposed which enhances all aspects of the knowledge spiral and the associated decision making processes.
Coordinating communication: awareness displays and interruption
Authors: Laura Dabbish, Robert Kraut
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

In this paper, we describe a laboratory experiment to determine whether peripheral awareness information about a remote collaborator's workload aids in timing interruptive communication. Our results indicate that a display with an abstract representation of a collaborator's workload is best in that it leads to better timing of interruptions without overwhelming the interrupter.
Hydraulic and salinity finite element modeling of Smelt Brook, Massachusetts
Authors: R. Sands, C. Chang
Venue: Development and application of computer techniques to environmental studies (2002)

Smelt Brook collects flow from a basin that drains the majority of the township of Weymouth Landing, Massachusetts located south of Boston. The brook quickly forms a confluence with the Monatiquot River forming the tidal influenced Weymouth Fore River. A recent engineering design effort to reestablish rail transportation through Weymouth Landing has impacted the existing 183-cm circular culvert that conveys Smelt Brook underneath the township. This culvert acts as a 300-meter passage for Rainbow Smelt fish to reach additional breeding locations upstream of the town where the brook flows on the surface. The rail segment requires a modified shallow cut through this particular area forcing a change in shape of the culvert from circular to box and a lowering of the top of the conduit by 0.612 meters. This paper reports the analysis conducted to determine the impacts of the culvert changes on the velocity and salinity profile on this breeding ground. The primary goal of the overall study was to determine the impact on smelt fish migration along the tidally influenced Smelt Brook, but this document is solely focused on the activities addressing the determination of the hydraulic changes toward this end.
Extremal subgraphs with respect to vertex degree bounds
Authors: Dieter Rautenbach, Lutz Volkmann
Venue: Discrete Mathematics (2003)

A weighted graph (G,w) is a graph G=(V,E) together with a weight function on its vertices w : V → N0. We consider the maximal (minimal) number α0,w(G) (β0,w(G)) of edges in a spanning subgraph H of G with d(v,H) ≤ w(v) (d(v,H) ≥ w(v)) for all v ∈ V For these parameters and their corresponding duals we prove--among other results--generalizations of the well-known theorems of König (Mat. Fiz. Lapok 38 (1931) 116-119) and Gallai (Ann. Univ. Sci. Budapest. Eötvös Sect. Math. 2 (1959) 133-138). Note that these notions naturally generalize maximum matchings and minimum edge covers in graphs.
Research Report: Richness Versus Parsimony in Modeling Technology Adoption Decisions--Understanding Merchant Adoption of a Smart Card-Based Payment System
Authors: Christopher R. Plouffe, John S. Hulland, Mark Vandenbosch
Venue: Information Systems Research (2001)

The Technology Acceptance Model (TAM) has received considerable research attention in the IS field over the past decade, placing an emphasis on the roles played by perceived ease-of-use and perceived usefulness in influencing technology adoption decisions. Meanwhile, alternative sets of antecedents to adoption have received less attention. In this paper, sets of antecedent constructs drawn from both TAM and the Perceived Characteristics of Innovating (PCI) inventory are tested and subsequently compared with one another. The comparison is done in the context of a large-scale market trial of a smart card-based electronic payment system being evaluated by a group of retailers and merchants. The PCI set of antecedents explains substantially more variance than does TAM, while also providing managers with more detailed information regarding the antecedents driving technology innovation adoption.
On the use of surface interpolation techniques in generalised finite volume strategies for simulating transport in highly anisotropic porous media
Authors: Pasdunkorale A. Jayantha, Ian W. Turner
Venue: Journal of Computational and Applied Mathematics (2003)

A control volume technique for solving a representative diffusion equation in an orthotropic medium is considered. The approximation of the cross-diffusion flux term is of utmost important for the accuracy of the solution. A preliminary investigation that used exact function values from an available analytical solution to approximate this term during the numerical simulation provided excellent agreement with the exact solution. This finding motivated the need for accurate surface interpolation techniques for estimating the cross-diffusion term. The use of radial basis functions is a well-known interpolation technique for fitting scattered data, which can be considered as a global interpolating method because function values in the whole solution domain contribute towards the interpolation. A number of radial basis functions (RBF) was used to approximate the gradients in the cross-diffusion flux term and it was found that the accuracy of the finite volume solution was generally poor. It was concluded that the RBF estimated function does not reflect local variation of the solution, particularly for the gradients. Another strategy for local function estimation concerns the weighted least-squares method. Different variants of this method were analysed here for approximating the cross-diffusion term and it was found that the numerical results well matched the exact solution. The results highlight that the development of an accurate, generalised finite volume strategy requires a highly accurate flux approximation to enable second-order spatial accuracy to be achieved.
Towards a quantitative analysis of individuality and its maintenance
Authors: Alexandra Penn
Venue: Proceedings of the seventh international conference on simulation of adaptive behavior on From animals to animats (2002)

In the context of the study of the evolution of new levels of biological organisation, we present initial work on constructing a metric to detect individuality, or cooperative systems of agents. This is based on the production of new sets of higher-level variables, and their homeostatic maintainence with increasing external perturbation. Results of applying the measure to collectives of simulated Kheperas are presented.
Behaviour control using a functional and emotional model
Authors: Ignasi Cos, Gillian R. Hayes
Venue: Proceedings of the seventh international conference on simulation of adaptive behavior on From animals to animats (2002)

Animals are capable of pursuing long term goals while coping with the ever-changing events in their scenario. In the quest of animats towards autonomy, we propose to use a functional model biased by emotions to drive their behaviours. In addition to that, we suggest that emotions can be used as source of reinforcement to build functional description of objects, on the grounds of which to decide what behaviour to take next.
Commentary on "Indistrial Pricing: Theory and Mangerial Practice"
Authors: Awi Federgruen, Aliza Heching, Richard J. Schonberger, George E. Cressman,  Jr.
Venue: Marketing Science (1999)

Noble and Gruca (1999, this issue) provide useful insights into the pricing practices managers employ. Their findings indicate managerial pricing practices are heavily dominated by internal, cost-based approaches. Particularly relevant is the absence of value-based pricing practices. Noble and Gruca's findings indicate that the emerging market orientation work has not connected to pricing practice. This work poses a significant challenge for marketing theoreticians and educators: How can managers be helped to move beyond internally focused to externally-customer focused pricing practice?
An empirical study on the adoption of information appliances with a focus on interactive TV
Authors: Hun Choi, Minseok Choi, Jinwoo Kim, Hyoshik Yu
Venue: Telematics and Informatics (2003)

Home-style information appliances are expected to increase in number and variety rapidly in the near future. User adoption of new technology for information appliances may be different from adoption of other technologies in that the appliances are mainly used at-home by consumers who have never encountered such technology before.We developed a theoretical model of technology adoption specific to interactive TV, a representative example of information appliances, based on prior research regarding general technology acceptance. We also conducted a large-scale online survey to test the validity of the proposed model. The results from pretest and pilot studies indicated that measures for the proposed model met content validity, reliability and construct validity. Finally, results from LISREL analysis indicated that three factors influencing behavioral intention were attitude, subjective norm and perceived behavioral control. Attitude was influenced by attitudinal belief, which could be measured by perceived usefulness, trialability, result demonstrability, image and enjoyment. Subjective norm was influenced by normative belief, Which could be measured by belief from family and belief from friends. Perceived behavioral control Was influenced by control belief, which could be measured by rapidity of change in technology, cost and ease of use. This paper concludes with statements of implications and limitations of the study results.
External Technology Sourcing Through Alliances or Acquisitions: An Analysis of the Application-Specific Integrated Circuits Industry
Authors: Wim Vanhaverbeke, Geert Duysters, Niels Noorderhaven
Venue: Organization Science (2002)

In today's turbulent business environment innovation is the result of the interplay between two distinct but related factors: endogenous R&D efforts and (quasi) external acquisition of technology and know-how. Given the increasing importance of innovation, it is vital to understand more about the alternative mechanisms--such as alliances and acquisitions--that can be used to enhance the innovative performance of companies. Most of the literature has dealt with these alternatives as isolated issues. Companies, however, are constantly challenged to choose between acquisitions and strategic alliances, given the limited resources that can be spent on research and development. This paper contributes to the literature because it focuses on the choice between innovation-related alliances and acquisitions. We focus on the question of how the trade-off between strategic alliances and acquisitions is influenced by previous direct and indirect ties between firms in an industry network of interfirm alliances. We formulate hypotheses pertaining to the number of direct ties between two companies, their proximity in the overall alliance network, and their centrality in that network. In so doing, we distinguish between ties that connect firms from the same and from different industry segments, and those that connect firms from the same or from different world regions. These hypotheses are tested on a sample of strategic alliances and acquisitions in the application-specific integrated circuits (ASIC) industry. The findings show that a series of strategic alliances between two partners increases the probability that one will ultimately acquire the other. Whereas previous direct contacts tend to lead to an acquisition, this is not true of previous indirect contacts, which increase the probability that a link between the companies, once it is forged, takes the form of a strategic alliance. In the case of acquisitions, firms that are more centrally located in the network of interfirm alliances tend to be acquirers, and firms with a less central position tend to become acquired. These findings underscore the importance of taking previously formed interfirm linkages into account when explaining the choice between strategic alliances and acquisitions, as these existing links influence the transaction costs associated with both alternatives.
Integrable systems on the lattice and orthogonal polynomials of discrete variable
Authors: Miguel Lorente
Venue: Journal of Computational and Applied Mathematics (2003)

Some particular examples of classical and quantum systems on the lattice are solved with the help of orthogonal polynomials and its connection to continuous models are explored.
A professional practice component in writing: a simple way to enhance an existing course
Authors: Karen Anewalt
Venue: Journal of Computing Sciences in Colleges (2003)

The annual survey conducted in 2001 by the National Association of Colleges and Employers showed that employers rank good communication skills (both written and oral) as the most desirable quality in applicants seeking employment [7]. The recently published 2001 ACM/IEEE Computing Curriculum guidelines respond to industry demands by stressing the importance of incorporating "professional practice" components, including coursework focusing on written communication skills, in the undergraduate curriculum [1]. Despite evidence that communication skills are highly valued and professional recommendations to include writing in the computer science curriculum, many computer science faculty members are reluctant to add written components to their courses. This paper describes simple, practical ways of incorporating writing into existing computer science courses. Examples of writing assignments used in a sophomore-level data structures course are provided.
Pathwise Properties and Performance Bounds for a Perishable Inventory System
Authors: William L. Cooper
Venue: Operations Research (2001)

We study a perishable inventory system under a fixed-critical number order policy. By using an appropriate transformation of the state vector, we derive several key sample-path relations. We obtain bounds on the limiting distribution of the number of outdates in a period, and we derive families of upper and lower bounds for the long-run number of outdates per unit time. Analysis of the bounds on the expected number of outdates shows that at least one of the new lower bounds is always greater than or equal to previously published lower bounds, whereas the new upper bounds are sometimes lower than and sometimes higher than the existing upper bounds. In addition, using an expected cost criterion, we compare optimal policies and different choices of critical-number policies.
Periodic Scheduling with Service Constraints
Authors: Shoshana Anily, Julien Bramel
Venue: Operations Research (2000)

We consider the problem of servicing a number of objects in a discrete time environment. In each period, we may select an object that will receive a service in the period. Each time an object is serviced, we incur a servicing cost dependent on the time since the object's last service. Problems of this type appear in many contexts, e.g., multiproduct lot-sizing, machine maintenance, and several problems in telecommunications. We assume that at most one object can be serviced in a given period. For the general problem withm objects, which is known to be NP-Hard, we describe properties of an optimal policy, and for the specific case ofm = 2 objects, we determine an optimal policy.
A Unified Framework for Clustering Heterogeneous Web Objects
Authors: Hua-Jun Zeng, Zheng Chen, Wei-Ying Ma
Venue: Proceedings of the 3rd International Conference on Web Information Systems Engineering (2002)

In this paper, we introduce a novel framework forclustering web data which is often heterogeneous innature. As most existing methods often integrateheterogeneous data into a unified feature space, theirflexibilities to explore and adjust contributing effect fromdifferent heterogeneous information are compromised. Incontrast, our framework enables separate clustering ofhomogeneous data in the entire process based on theirrespective features, and a layered structure with linkinformation is used to iteratively project and propagatethe clustered results between layers until it converges. Ourexperimental results show that such a scheme not onlyeffectively overcomes the problem of data sparsenesscaused by the high dimensional link space but alsoimproves the clustering accuracy significantly. We achieve19% and 41% performance increases when clusteringweb-pages and users based on a semi-synthetic web log.Finally, we show a real clustering result based on UCBerkeley's web log.
On the Complexity of Verifying Structural Properties of Discrete Event Simulation Models
Authors: Sheldon H. Jacobson, Enver Yucesan
Venue: Operations Research (1999)

This paper uses computational complexity theory to assess the difficulty of various discrete event simulation problems. More specifically, accessibility of states, ordering of events, noninterchangeability of model implementations, and execution stalling for discrete event simulations are formally stated as search problems and proven to be NP-hard. The consequences of these results cover a wide range of modeling and analysis problems in simulation. For example, problems associated with certain variance reduction techniques, model verification, model validation, and the applicability of infinitesimal perturbation analysis, among others, are deemed intractable.
Minimizing Cycle Time in a Blocking Flowshop
Authors: I.N. Kamal Abadi, Nicholas G. Hall, Chelliah Sriskandarajah
Venue: Operations Research (2000)

We consider a blocking (i.e., bufferless) flowshop that repetitively processes a minimal part set to minimize its cycle time, or equivalently to maximize its throughput rate. The best previous heuristic procedure solves instances with 9 machines and 25 jobs, with relative errors averaging about 3% but sometimes as much as 10%. The idea of deliberately slowing down the processing of operations (i.e., increasing their processing times) establishes a precise mathematical connection between this problem and a no-wait flowshop. This enables a very effective heuristic for the no-wait flowshop to be adapted as a heuristic for the blocking flowshop. Our computational results show relative errors that average less than 2% for instances with 20 machines and 250 jobs.
Generating Realignment-Based Communication for HPF Programs
Authors: Tsunehiko Kamachi, Kazuhiro Kusano, Kenji Suehiro, Yoshiki Seo
Venue: Proceedings of the 10th International Parallel Processing Symposium (1996)

This paper presents methods for generating communication on compiling HPF programs for distributed-memory machines. We introduce the concept of an iteration template corresponding to an iteration space. Our HPF compiler performs the loop iteration mapping through the two-level mapping of the iteration template in the same way as the data mapping is performed in HPF. Making use of this unified mapping model of the data and the loops, communication for nonlocal accesses is handled based on data-realignment between the user-declared alignment and the optimal alignment, which ensures that only local accesses occur inside the loop. This strategy results in effective means of dealing with communication for arrays with undefined mapping, a simple manner for generating communication, and high portability of the HPF compiler. Experimental results on the NEC Cenju-3 distributed-memory machine demonstrate the effectiveness of our approach: the execution time of the compiler-generated program was within 10% of that of the hand-parallelized program.
A Heuristic for Boolean Optimization Problems
Authors: Thomas Davoine, Peter L. Hammer, Béla Vizvári
Venue: Journal of Heuristics (2003)

A heuristic method is proposed for the solution of a large class of binary optimization problems, which includes weighted versions of the set covering, graph stability, partitioning, maximum satisfiability, and numerous other problems. The reported substantial computational experiments amply demonstrate the efficiency of the proposed method.