ppxscal/embedding_network huggingface dataset:
Prominence-interpretation theory: explaining how people assess credibility online
Authors: B. J. Fogg
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

Four years of research has led to a theory that describes how people assess the credibility of Web sites. This theory proposes that users notice and interpret various Web site elements to arrive at an overall credibility assessment. Although preliminary, this theory explains previous research results and suggests directions for future studies.
Scalable P2P Search
Authors: Daniel A. Menascé
Venue: IEEE Internet Computing (2003)

PA probabilistic approach to resource-location can provide an efficient search mechanism for peer-to-peer systems.
Napoleon's soldiers
Authors: Elizabeth Goode, Goran Trajkovski
Venue: Journal of Computing Sciences in Colleges (2003)

This paper presents a counting problem the goal of which is to calculate the number of soldiers in Napoleon's army. Several approaches to solving the problem are given that are suitable for implementation in various contexts in a multitude of Mathematics and Computer Science undergraduate and graduate courses. Further generalizations of the problem are also discussed.
Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
Authors: Luis Gouveia
Venue: INFORMS Journal on Computing (1998)

We use variable redefinition (see R. MARTIN, 1987. Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition, Operations Research 35, 820Â 831) to strengthen a multicommodity flow (MCF) model for minimum spanning and Steiner trees with hop constraints between a root node and any other node. Hop constraints model quality of service constraints. The Lagrangean dual value associated with one Lagrangean relaxation derived from the MCF formulation dominates the corresponding LP value. However, the lower bounds given after a reasonable number of iterations of the associated subgradient optimization procedure are, for several cases, still far from the theoretical best limit. Martin's variable redefinition technique is used to obtain a generalization of the MCF formulation whose LP bound is equal to the previously mentioned Lagrangean dual bound. We use a set of instances with up to 100 nodes, 50 basic nodes, and 350 edges for comparing an LP approach based on solving the LP relaxation of the new model with the equivalent Lagrangean scheme derived from MCF.
Extending an Algebraic Modeling Language to Support Constraint Programming
Authors: Robert Fourer, David M. Gay
Venue: INFORMS Journal on Computing (2002)

Although algebraic modeling languages are widely used in linear and nonlinear programming applications, their use for combinatorial or discrete optimization has largely been limited to developing integer linear programming models for solution by branch-and-bound procedures. Yet much of a modeling language's underlying structure for expressing integer programs is equally useful for describing more general combinatorial optimization constructs.Constraint programming solvers offer an alternative approach to solving combinatorial optimization problems, in which natural combinatorial constructs are addressed directly within the solution procedure. Hence the growing popularity of constraint programming motivates a variety of extensions to algebraic modeling languages for the purpose of describing combinatorial problems and conveying them to solvers.We examine some of these language extensions along with the significant changes in solver interface design that they require. In particular, we describe how several useful combinatorial features have been added to the AMPL modeling language and how AMPL's general-purpose solver interface has been adapted accordingly. As an illustration of a solver connection, we provide examples from an AMPL driver for ILOG Solver.
Creating an Inventory Hedge for Markov-Modulated Poisson Demand: An Application and Model
Authors: Hari S. Abhyankar, Stephen C. Graves
Venue: Manufacturing Service Operations Management (2001)

Many firms face environments with long manufacturing leadtimes, great product variety, and uncertain, nonstationary demand. A challenge is how to plan production and inventories to provide the best customer service at the least cost. In this paper, we first describe an application at Teradyne in which we implemented an inventory hedge to protect against cyclic demand variability. Based on this experience, we develop a model to better understand the efficacy of this hedging policy. We consider an inventory system for a single aggregate product with a Markov-modulated Poisson demand process. We provide approximate performance measures for this system and develop an optimization problem for determining the size and location of an intermediate-decoupling inventory. We use this optimization to show the value of an intermediate-decoupling inventory as a hedge for cyclic demand environments.
Web site designs: influences of designer's expertise and design constraints
Authors: Aline Chevalier, Melody Y. Ivory
Venue: International Journal of Human-Computer Studies (2003)

Nowadays, much research examines both the cognitive difficulties encountered by web site users and the development of ergonomic guidelines for designers. However, few studies examine designers' cognitive functioning while designing web sites. We defend the idea that determining the difficulties web site designers encounter is necessary to better support their design activities, especially in making web sites easier to use. We present an experimental study that demonstrates that the designers' levels of expertise (novice and professional) as well as the design constraints that clients prescribe influences both the number and the nature of constraints designers articulate and respect in their web site designs. Based on our study findings, we suggest ways to better support web site designers.
Administrative scope: A foundation for role-based administrative models
Authors: Jason Crampton, George Loizou
Venue: ACM Transactions on Information and System Security (TISSEC) (2003)

We introduce the concept of administrative scope in a role hierarchy and demonstrate that it can be used as a basis for role-based administration. We then develop a family of models for role hierarchy administration (RHA) employing administrative scope as the central concept. We then extend RHA4, the most complex model in the family, to a complete, decentralized model for role-based administration. We show that SARBAC, the resulting role-based administrative model, has significant practical and theoretical advantages over ARBAC97. We also discuss how administrative scope might be applied to the administration of general hierarchical structures, how our model can be used to reduce inheritance in the role hierarchy, and how it can be configured to support discretionary access control features.
Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem
Authors: D. R. Stinson
Venue: Mathematics of Computation (2002)

In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are required to find a discrete logarithm in a finite group of order approximately 2m, given that the unknown logarithm has a specified number of l's, say t, in its binary representation. Heiman and Odlyzko presented the first algorithms for this problem. Unpublished improvements by Coppersmith include a deterministic algorithm with complexity O (m (t/2m/2)), and a Las Vegas algorithm, with complexity O (√t (m/2 t/2)).We perform an average-case analysis of Coppersmith's deterministic algorithm. The average-case complexity achieves only a constant factor speed-up over the worst-case. Therefore, we present a generalized version of Coppersmith's algorithm, utilizing a combinatorial set system that we call a splitting system. Using probabilistic methods, we prove a new existence result for these systems that yields a (nonuniform) deterministic algorithm with complexity O(t3/2 (log m) (t/2m/2)))). We also present some explicit constructions for splitting systems that make use of perfect hash families.
When one isn't enough: an analysis of virtual desktop usage strategies and their implications for design
Authors: Meredith Ringel
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

Screen space is a limited resource for computer users-multiple monitors are one means of workspace expansion, and "virtual desktops" are yet another way to increase screen real-estate. We present a taxonomy of organization strategies based on our observations during a series of interviews with virtual desktop users. Additionally, we explore causes of varying user preferences for physical versus virtual means of screen-space expansion. Finally, we discuss the design implications of our findings.
Optimizing pipelines for power and performance
Authors: Viji Srinivasan, David Brooks, Michael Gschwind, Pradip Bose, Victor Zyuban, Philip N. Strenski, Philip G. Emma
Venue: Proceedings of the 35th annual ACM/IEEE international symposium on Microarchitecture (2002)

During the concept phase and definition of next generation high-end processors, power and performance will need to be weighted appropriately to deliver competitive cost/performance. It is not enough to adopt a CPl-centric view alone in early-stage definition studies. One of the fundamental issues confronting the architect at this stage is the choice of pipeline depth and target frequency. In this paper we present an optimization methodology that starts with an analytical power-performance model to derive optimal pipeline depth for a superscalar processor. The results are validated and further refined using detailed simulation based analysis. As part of the power-modeling methodology, we have developed equations that model the variation of energy as a function of pipeline depth. Our results using a set of SPEC2000 applications show that when both power and performance are considered for optimization, the optimal clock period is around 18 F04. We also provide a detailed sensitivity analysis of the optimal pipeline depth against key assumptions of these energy models.
Research and Development of Advanced Database Systems for Integration of Media and User Environments
Authors: Yahiko Kambayashi
Venue: Proceedings of the Sixth International Conference on Database Systems for Advanced Applications (1999)

With rapid growth of recent development of computer and network technologies, the amount of data produced, transmitted and stored is growing enormously. The variety of data to be processed is widely spreading all over the world. We are facing the third communication revolution after the invention of printing technology and mass-communication. Databases are key technology for the coming network-age. To promote such research areas, Japanese Ministry of Education, Science, Sports and Culture had decided to sponsor the Scientific Research on Priority Areas entitled "Research and Development of Advanced Database Systems for Integration of Media and User Environments" (Research Project on Advanced Databases, in short.).
Selected topics on assignment problems
Authors: Rainer E. Burkard
Venue: Discrete Applied Mathematics (2002)

We survey recent developments in the fields of bipartite matchings, linear sum assignment and bottleneck assignment problems and applications, multidimensional assignment problems, quadratic assignment problems, in particular lower bounds, special cases and asymptotic results, biquadratic and communication assignment problems.
Modeling the Commute Activity-Travel Pattern of Workers: Formulation and Empirical Analysis
Authors: Chandra Bhat
Venue: Transportation Science (2001)

This paper proposes a methodological framework to analyze the activity and travel pattern of workers during the evening commute. The framework uses a discrete-continuous econometric system to model jointly the decision to participate in an activity during the evening commute and the following attributes of the participation: activity type, activity duration, and travel time deviation to the activity location relative to the direct travel time from work to home. The model parameters are estimated using a sample of workers from the 1991 Boston Household Activity Survey. The paper also presents mathematical expressions to evaluate the effect of changes in sociodemographic variables and policy-relevant exogenous variables on the temporal pattern of trips and cold starts attributable to commute stops. The application of the model indicates that failure to accommodate the joint nature of the activity decisions during the evening commute can lead to misdirected policy actions for traffic congestion alleviation and for mobile-source emissions reduction. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A graphical user interface for editing formal specification objects
Authors: Duanqing Wu, Yiching Cheng, Tim Wahls
Venue: Journal of Computing Sciences in Colleges (2002)

Extensive tool support is critical for increasing the usefulness and industrial acceptance of formal software engineering methods. In previous work, we have developed a technique for executing formal interface specifications of C++ classes, and a graphical user interface for this technique. In this work, we describe an extension to that interface that allows specification objects to be edited in an intuitive way, and which graphically displays complex relationships (including aliasing) among specification objects.
Enhancing Competitiveness of the Customer Loan Center at Promistar Financial Corporation
Authors: Prakash Mirchandani, G. G. Hegde, Richard E. Wendell
Venue: Interfaces (2001)

When a prospective automobile buyer seeks dealer financing, the dealer typically faxes the loan application to a number of banks. The consumer loan center of Promistar Financial Corporation, a medium-sized bank in southwestern Pennsylvania, competes with other banks to finance such loans. Competition is fierce with a bank's response time being an important factor in its "winning" the loan. In order to make more effective staffing decisions, the bank asked us to assess the relationship between response time and staffing levels at the loan center. What started out as a staffing analysis quickly became much more. The process of data collection and model building to address the staffing issue led to a number of important insights and a variety of recommendations that the bank implemented. This has led to significant improvements in the loan center's operations.
Children's use of the yahooligans! web search engine. III. cognitive and physical behaviors on fully self-generated search tasks
Authors: Dania Bilal
Venue: Journal of the American Society for Information Science and Technology (2002)

This article presents the third part of a research project that investigated the information-seeking behavior and success of seventh-grade science children in using the Yahooligans! Web search engine/directory. In parts 1 and 2, children performed fully assigned tasks to pursue in the engine. In the present study, children generated their tasks fully. Children's information seeking was captured from the cognitive, physical, and affective perspectives using both quantitative and qualitative inquiry methods. Their information-seeking behavior and success on the fully self-generated task was compared to the behavior and success they exhibited in the two fully assigned tasks. Children were more successful on the fully self-generated task than the two fully assigned tasks. Children preferred the fully self-generated task to the two fully assigned tasks due to their ability to find the information sought and satisfaction with search results rather than the nature of the task in itself (i.e., self-generated aspect). Children were more successful when they browsed than when they searched by keyword on the three tasks. Yahooligans! design, especially its poor keyword searching, contributed to the breakdowns children experienced, implications for system design improvement and Web training are discussed.
Transparent silica glasses containing single walled carbon nanotubes
Authors: J. DiMaio, S. Rhyne, Z. Yang, K. Fu, R. Czerw, J. Xu, S. Webster, Y.-P. Sun, D. L. Carroll, J. Ballato
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2003)

Organic/inorganic matrix nanocomposites have been created using an acid catalyzed, tetraethyl orthosilicate-based sol-gel technique with single-walled carbon nanotubes (SWNTs). By utilizing nanotubes functionalized with the dendron methyl 3,5-di(methyltrigycoloxy)benzylic alcohol (IPEG), ultrasonic blending in the sol phase prior to gelation yields excellent dispersion characteristics of the nanotube phase. The glasses were densified by heating to 600 °C yielding 80% of theoretical density with little change in the optical appearance or behavior. These materials exhibited intrinsic Rayleigh scattering, suggesting near ideal dispersion. Nonlinear optical transmission was observed for 1064 and 532 nm light suggesting that the matrix has a strong broad band coupling to the optical field. Such composites allow for a host of applications based on the novel confinement properties of carbon nanotubes in a robust inorganic host.
Minimizing the Average Query Complexity of Learning Monotone Boolean Functions
Authors: Vetle I. Torvik, Evangelos Triantaphyllou
Venue: INFORMS Journal on Computing (2002)

This paper addresses the problem of completely reconstructing deterministic monotone Boolean functions via membership queries. The minimum average query complexity is guaranteed via recursion, where partially ordered sets (posets) make up the overlapping subproblems. For problems with up to 4 variables, the posets' optimality conditions are summarized in the form of an evaluative criterion. The evaluative criterion extends then computational feasibility to problems involving up to about 20 variables. A frameworkfor unbiased average case comparison of monotone Boolean function inference algorithms is developed using unequal probability sampling. The unbiased empirical results show that an implementation of the subroutine considered as a standard in the literature performs almost twice as many queries as the evaluative criterion on the average. It should also be noted that the first algorithm ever designed for this problem performed consistently within two percentage points of the evaluative criterion. As such, it prevails, by far, as the most efficient of the many preexisting algorithms.
Tandem Queues with Blocking: a Comparison Between Dependent and Independent Service
Authors: Sharon Guy Browning
Venue: Operations Research (1998)

This paper considers tandem queues with finite buffers. Throughput values for the cases of independent and dependent service are compared, where in the dependent case a given customer has the same service time at each station. It is shown that for sufficiently large buffer sizes, dependent throughput is greater than independent. Simulation results that demonstrate this phenomenon are given.
Gauss quadrature approximations to hypergeometric and confluent hypergeometric functions
Authors: Walter Gautschi
Venue: Journal of Computational and Applied Mathematics (2002)

Integral representations of hypergeometric and confluent hypergeometric functions with real parameters and complex arguments are used to approximate these functions by Gaussian quadrature. An analysis is given of the errors involved and of estimates of the number of Gauss points required to achieve any given accuracy. Numerical examples illustrate the theory.
MEQA3 - a multi-end QoS application adaptation architecture
Authors: Athanasios G. Malamos, Theodora A. Varvarigou, Elias N. Malamas, Chi-Hsiang Yeh
Venue: Information processing and technology (2001)

We present MEQA3 application adaptation architecture. MEQA3 manages QoS in two different points of the service activity, 1) the setup/initialisation period and 2) the service period. During the initialisation phase, the system performs an overall optimal QoS to application allocation considering the user requests, the estimated service requirements and the resource constraints. However, during the service time a resource overloading may occur either by bad initial estimation of application requirements or by some unexpected event that limits its performance. Thus, MEQA3 monitors the QoS of the applications on the user's side and if this exceeds the user specifications then dynamically adapts applications to the current situation. We demonstrate by a videoconference example that MEQA3 is an easy to implement low complexity architecture.
An information-theoretic perspective of tf&mdash;idf measures
Authors: Akiko Aizawa
Venue: Information Processing and Management: an International Journal (2003)

This paper presents a mathematical definition of the "probability-weighted amount of information" (PWI), a measure of specificity of terms in documents that is based on an information-theoretic view of retrieval events. The proposed PWI is expressed as a product of the occurrence probabilities of terms and their amounts of information, and corresponds well with the conventional term frequency-inverse document frequency measures that are commonly used in today's information retrieval systems. The mathematical definition of the PWI is shown, together with some illustrative examples of the calculation.
Aggregation principle in the theory of nonlinear PDE
Authors: Endre Pap, Doretta Vivona
Venue: Technologies for constructing intelligent systems: tools (2002)

It is considered a pair of generalized aggregation operators connected by distributive law. It is given a complete characterization of such pairs of operations. The obtained results are applied on nonlinear PDE.
Introduction to Leonard pairs
Authors: Paul Terwilliger
Venue: Journal of Computational and Applied Mathematics (2003)

In this survey paper we give an elementary introduction to the theory of Leonard pairs. A Leonard pair is defined as follows. Let K denote a field and let V denote a vector space over K with finite positive dimension. By a Leonard pair on V we mean an ordered pair of linear transformations A : V → V and B : V → V that satisfy conditions (i), (ii) below. (i) There exists a basis for V with respect to which the matrix representing A is irreducible tridiagonal and the matrix representing B is diagonal. (ii)There exists a basis for V with respect to which the matrix representing A is diagonal and the matrix representing B is irreducible tridiagonal. We give several examples of Leonard pairs. Using these we illustrate how Leonard pairs arise in representation theory, combinatorics, and the theory of orthogonal polynomials.