ppxscal/embedding_network huggingface dataset:
E-commerce interface design
Authors: John Vergo, Sunil Noronha, Joseph Kramer, Jon Lechner, Thomas Cofino
Venue: The human-computer interaction handbook: fundamentals, evolving technologies and emerging applications (2002)

This chapter is meant to serve as a resource to human-computer interaction (HCI) practitioners and researchers who wish to understand the existing body of research in the area of e-commerce systems as it applies to HCI. In particular, we report on research that will be useful to designers of interactive e-commerce systems. We identify issues that are unique to e-commerce systems design, which HCI practitioners need to understand. We attempt to answer the question, What do HCI practitioners need to do differently for e-commerce systems design?We look at the design of these systems as a two-actor system, with the role of the customer and the marketer being the two primary roles. The chapter is not a primer on marketing, Internet marketing, e-commerce systems, or HCI methods. Our goal is to identify issues in the design of e-commerce systems that are important for HCI practitioners to understand and to provide valuable references to existing research that will inform the activities of e-commerce systems interface designers. Additionally, we identify interesting research opporttmities for HCI practitioners in the area of e-commerce interface design. Please see chapter 36, The World Wide Web, by Jonathan Lazar for more general, Web-related HCI issues.
Parameters estimation of a repairable system
Authors: Ammar M. Sarhan, Lotfi Tadj
Venue: Applied Mathematics and Computation (2003)

In this paper we estimate the value of unknown parameters in a repairable system. The maximum likelihood and Bayes estimates of the underlying parameters are obtained. The presented estimates are compared with the moment estimates of the same parameters available in the literature. One advantage of the new estimates is that they can be calculated for all available observations to the contrary of the moment estimates. The other advantage is that they are better than the moment estimates in the sense of having smaller percentage errors.
Analyzing usage of location based services
Authors: Assaf Burak, Taly Sharon
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

FriendZone, a suit of mobile location-based community services has been launched. FriendZone's social services include Instant Messenger and Locator (IM&L), Location-based Chat, and Anonymous IM, with supporting Privacy Management. We describe the findings of a 16 months usage survey of 40,000 users, most of them young adults.The results indicate that Anonymous IM is the most popular service, more than IM&L, with lower use of Location-based Chat that was introduced last.
Implicit Enumeration of Hyperpaths in a Logit Model for Transit Networks
Authors: Sang Nguyen, Stefano Pallottino, Michel Gendreau
Venue: Transportation Science (1998)

This paper investigates the application of a logit model to urban transit networks where every set of competitive transit lines is described by a particular graph structure called hyperpath. It shows that a sequential form of the logit model transcends the inherent limitations of the global form while retaining the algorithmic advantages similar to those obtained with the ordinary logit model for private vehicle networks.
Asymptotic analysis for the Dunkl kernel
Authors: Margit Rösler, Marcel de Jeu
Venue: Journal of Approximation Theory (2002)

This paper studies the asymptotic behavior of the integral kernel of the Dunkl transform, the so-called Dunkl kernel, when one of its arguments is fixed and the other tends to infinity either within a Weyl chamber of the associated reflection group, or within a suitable complex domain. The obtained results are based on the asymptotic analysis of an associated system of ordinary differential equations. They generalize the well-known asymptotics of the confluent hypergeometric function 1F1 to the higher-dimensional setting and include a complete short-time asymptotics for the Dunkl-type heat kernel. As an application, it is shown that the representing measures of Dunkl's intertwining operator are generically continuous.
Built-in Test with Modified-Booth High-Speed Pipelined Multipliers and Dividers
Authors: Hao-Yung Lo, Hsiu-Feng Lin, Chichyang Chen, Jenshiuh Liu, Chia-Cheng Liu
Venue: Journal of Electronic Testing: Theory and Applications (2003)

An embedded test pattern generator scheme for large-operand (unlimited bit length) multiplier and divider is presented by employing a simple digital circuit. This scheme is based on the generation of cyclic code polynomials from a characterized polynomials generator G(X) and incorporated with Modified-Booth algorithm. Due to the advantages of the former, the hardware complexity is simple, and moreover, the multiplier and divider can share the same hardware with a small change of control lines. Due to the advantages of latter's schemes, the numbers of &ldquo;sub/add&rdquo; operations are reduced to one half of the multiplicand for the result of final product. Therefore, the proposed pipelined multipliers permit very high throughput for arbitrary value of digit size. Only full adders/subtractors and shift registers are used in the proposed multiplier and divider hardware. The input data of the multiplier/divider can be processed in parallel or in pipelined without considering carry/borrow delays during the operations. The speed of computation has therefore been greatly improved by approximately a factor of 2. Since most parts of the components can be used for both the multiplier and divider, with full adders replaced by subtractors for switching from a multiplier to a divider, the structure is therefore tremendously reduced. In addition, these function units are involved with cyclic code generators, so that they can be used as a built-in self-test (BIST).
Lowering the barrier to wireless and mobile experimentation
Authors: Brian White, Jay Lepreau, Shashi Guruprasad
Venue: ACM SIGCOMM Computer Communication Review (2003)

The success of ns highlights the importance of an infrastructure that enables efficient experimentation. Similarly, Netbed's automatic configuration and control of emulated and live network environments minimizes the effort spent configuring and running experiments. Learning from the evolution of these systems, in this paper we argue that a live wireless and mobile experimental facility focusing on ease of use and accessibility will not only greatly lower the barrier to research in these areas, but that the primary technical challenges can be overcome.The flexibility of Netbed's common abstractions for diverse node and link types has enabled its development from strictly an emulation platform to one that integrates simulation and live network experimentation. It can be further extended to incorporate wireless and mobile devices. To reduce the tedium of wireless and mobile experimentation, we propose automatically allocating and mapping a subset of a dense mesh of devices to match a specified network topology. To achieve low-overhead, coarse repeatability for mobile experiments, we outline how to leverage the predictability of passive couriers, such as PDA-equipped students and PC-equipped busses.
A Punt Returner Location Problem
Authors: Jack Brimberg, W. J. Hurley, R. E. Johnson
Venue: Operations Research (1999)

We formulate and solve a location problem that determines where to position punt returners to maximize the number of punts caught. The problem is unusual within the location literature because it includes the dimension of time as well as Euclidean distance. The parameters of the model are estimated from actual punt return data. Our major finding is that the standard horizontal configuration of two punt returners results in only a small increase in the percentage of punts fielded over the case where a single returner is used. Moreover if a punter is not "directionalizing," the vertical configuration of two returners (the punter and two returners are colinear) outperforms a horizontal configuration.
A family of restricted subadditive recursions
Authors: Roger J. Wallace
Venue: Discrete Applied Mathematics (2002)

For a fixed non-negative integer k, let Uk={Uk(n)}, n ≥0, denote that sequence which is defined by the initial conditions Uk(0) = Uk(1) = Uk(2)=.....Uk(k)=1, and by the restricted subadditive recursion Uk(n+k+1)= min 0 ≤ 1 ≤ [k/2](Uk(n+l)+Uk(n+k-l)), n ≥0.Uk is important in the theory of optimal sequential search for simple real zeros of real valued continuous kth derivatives. The structure of Uk depends substantially on the parity of k. In an earlier work, the author proved that U2p (p a fixed non-negative integer) also satisfies a certain periodic system of p+ 1 difference equations. This system was solved, and several closed form expressions for U2p (n), n > 2p, were duly exhibited. In contrast, much less is known about the behaviour of U2p+1, although it has been conjectured that it satisfies, eventually, a single (solvable) difference equation. In this paper, the author determines a sufficient condition for U2p+1 to satisfy this equation. It transpires that this finding on U2p+1 is a special case of a general conclusion on members of a certain family of restricted subadditive recursions.
Experiences in modelling feature interactions with coloured Petri Nets
Authors: Louise Lorentsen, Antti-Pekka Tuovinen, Jianli Xu
Venue: Acta Cybernetica (2002)

A modern mobile phone supports many features: voice and data calls, text messaging, personal information management like phonebooks and calendars, WAP browsing, games, alarm clock, etc. All these features are packaged into a handset with a small display and a special purpose keypad. The limited user interface and the seamless intertwining of logically separate features cause many interactions between the software components in the UI of mobile phones. In this paper, we present an overview of our approach to modelling feature interactions in Nokia's mobile phones with explicit behavioral models of features. We use Coloured Petri Nets as the modeling language and the tool Design/CPN that provides a graphical, interactive user interface for constructing and simulating Coloured Petri Nets. We describe at a general level how we have created a graphical user interface for controlling and observing the simulations of models through an on-screen mock-up of a mobile phone. Then, we discuss the conrete results we have achieved by using our approach.
Bringing social and organisational issues into information systems development: the story of multiview
Authors: David Avison, Trevor Wood-Harper
Venue: Socio-technical and human cognition elements of information systems (2003)

Multiview is a framework to support the information systems development process. It was formulated originally in 1985, but has been developed and changed since that time. It was originally defined to take into account the human and organisational aspects of information systems development, as the alternative methodologies of the time-and most since that time-took a very technology-oriented approach. Furthermore, it is a contingency approach, and again this compares with the alternative bureaucratic and prescriptive methodologies. In this chapter, we describe the history of Multiview, and we reflect on the experiences of using it in action in many organisations.
Generating Experimental Data for the Generalized Assignment Problem
Authors: H. Edwin Romeijn, Dolores Romero Morales
Venue: Operations Research (2001)

The Generalized Assignment Problem (GAP) is the problem of finding the minimal cost assignment of jobs to machines such that each job is assigned to exactly one machine, subject to capacity restrictions on the machines. We propose a new stochastic model for the GAP. A tight condition on this stochastic model under which the GAP is feasible with probability one when the number of jobs goes to infinity is derived. This new stochastic model enables us to analyze the adequacy of most of the random generators given for the GAP in the literature. We demonstrate that the random generators commonly used to test solution procedures for the GAP tend to create easier problem instances when the number of machinesm increases. We describe a greedy heuristic for the GAP, and use it to illustrate the results from the paper.
On the attainable order of collocation methods for pantograph integro-differential equations
Authors: Yoshiaki Muroya, Emiko Ishiwata, Hermann Brunner
Venue: Journal of Computational and Applied Mathematics (2003)

For the pantograph integro-differential equation (PIDE) with nonhomogeneous term: y'(t) = ay(t)+ ∫01 y(σ(q)t)dµ(q)+ ∫01 y'(ρ(q)t)dv(q)+ f(t), t > 0, y(0)= y0, with proportional delays σ(q)t and ρ(q)t, 0 < σ(q), ρ(q) ≤ 1, 0 < q < 1, we consider the attainable order of m-stage implicit (collocation-based) Runge-Kutta methods at the first mesh point t = h, and give conditions on the collocation polynomials Mm(t) of degree m to u(th), t ∈ [0, 1] such that |u(h)- y(h)| = O(h2m+1), where y(t) is the solution and u(t) is the collocation solution of PIDE. If m = 2 or f(t) is a polynomial of t whose degree is less than or equal to m, then such conditions of Mm(t) are simplified. A numerical example is also included.
From Security to Mobility: Generalized Investments in Human Capital and Agent Commitment
Authors: D. Charles Galunic, Erin Anderson
Venue: Organization Science (2000)

This paper considers the impacts of different investments in human capital (firm-specific versus generalized investments) on employee commitment to the firm. The resource-based literature has stressed that only firm-specific human capital is likely to generate organizational rents, since those assets are more likely to be inimitable, rare, and therefore a better basis for sustained competitive advantage. Generalized investments in human capital (i.e., investments in capabilities that people can transfer and deploy to other firms or settings) are to be avoided. However, observing lessons from the literature on psychological contracts and organizational commitment, we argue that generalized investments may have value for the firm through their effects on worker commitment to the firm. The gain in worker commitment is valuable to firms given the fragile state of the contemporary employment relation, in which the lack of job security is likely to breed diminished employee commitment. This is particularly a concern for employment relations consisting of externalized labor (i.e., contract work or selfemployed professionals operating as agents of the firm), in which agent commitment is vital but likely to be more scarce. In this paper we focus on the externalized workers (independent agents) of two insurance firms in addressing these issues. A sample of 237 agents shows support for the benefits of generalized investments on agent commitment, questioning conventional wisdom that such investments should be avoided. We also examine the impact of relation-specific investments and other key antecedents on agent commitment, concluding that a mixture of strategic investments in human capital should be considered, taking into account their impacts on the firm-worker psychological contract. We also examine the impact of agent commitment on agent performance in this context, finding committed agents do provide greater value to the insurer.
Positive entire solutions of nonlinear polyharmonic equations in R2
Authors: Xingye Xu, Bicheng Yang, Lokenath Debnath
Venue: Applied Mathematics and Computation (2002)

In this paper, the existence of positive, radially symmetric entire solutions for the equations δmu = f(|x|, u, |∇u|) (m = 2, 3,...) on R2 is proved. Some properties of the solutions are obtained. The results of this paper are generalizations of these proved in [W. Water, Math. Z 67 (1957) 32 - 37; W. Water, Arch. Math 9 (1958) 308-312; W. Water, H. Rhee, Proc. Royal Soc. Edinburgh A 82 (1979) 189-192; T. Kusno, C.A. Swanson, Hiroshima Math. J. 17 (1989) 13-28].
Magnet: a virtual shared tuplespace resource manager
Authors: Patty Kostkova, Tim Wilkinson
Venue: Virtual shared memory for distributed architectures (2001)

Traditional operating systems limit flexibility, performance and utilization of hardware resources by forcing applications to use inappropriate high-level abstractions, uniform protection schemes and high-level static resource management. This forced use of inappropriate services results in poor application and operating system performance. A radical new approach to operating systems design and construction is needed to meet the requirements of modern applications. Within our Centre, we are designing BITS: the Component Based Operating System, to address these issues.To realize its full potential, BITS requires a radically new resource management strategy. The operating system design gives an environment for implementing extensions, but a resource manager module is responsible for making them available. It allows system services to be specialized, replaced or extended to better serve application-specific needs.In this paper we propose the MAGNET Resource Manager enabling a free-market negotiation of application requests and server resources. It provides an additional level of flexibility for application participation in resource management. MAGNET also provides a platform for an additional runtime level of extensibility: dynamic modification and replacement of its parts during execution.
Richardson extrapolation of iterated discrete Galerkin solution for two-dimensional Fredholm integral equations
Authors: Guoqiang Han, Ruifang Wang
Venue: Journal of Computational and Applied Mathematics (2002)

In this paper, we study the numerical solution of two-dimensional Fredholm integral equation by discrete Galerkin and iterated discrete Galerkin method. We are able to derive an asymptotic error expansion of the iterated discrete Galerkin solution. This expansion covers arbitrarily high powers of the discretization parameters if the solution of the integral equation is smooth. The expansion gives rise to Richardson-type extrapolation schemes which rapidly improve the original rate of the convergence. Numerical experiments confirm our theoretical results.
XML query processing using document type definitions
Authors: Tae-Sun Chung, Hyoung-Joo Kim
Venue: Journal of Systems and Software (2002)

As eXtensible Markup Language (XML) has become an emerging standard for information exchange on the World Wide Web, it has gained attention in database communities to extract information from XML seen as a database model. Data in XML can be mapped to a semistructured data model based on edge-labeled graph, and queries can be processed against it. Here, we propose new query optimization techniques using document type definitions which have the schema information about XML data. Our techniques reduce the large search space significantly while at the same time requiring less memory compared to the traditional index techniques. Also, as they preserve source database's structure, they can process many kinds of complex queries. We implemented our techniques and provided preliminary performance results.
High-rate Ru electrode etching using O2/Cl2 inductively coupled plasma
Authors: Hyoun Woo Kim, Byong-Sun Ju, Chang-Jin Kang
Venue: Microelectronic Engineering (2003)

We have studied the characteristics of Ru etching using O2/Cl2 plasmas in an inductively coupled plasma (ICP) etcher. The changes of Ru etch rates and Ru electrode etching slopes by varying Cl2/(O2 + Cl2) gas flow ratio, total flow rate, source power, bias power, and pressure were investigated. A high Ru etch rate of > 1400 Å/min with a high etching slope of > 85° was demonstrated using 0.15 µm critical dimension (CD) patterned wafers. The mechanism of high-rate Ru etching is studied.
The error bounds and tractability of quasi-Monte Carlo algorithms in infinite dimension
Authors: Fred J. Hickernell, Xiaoqun Wang
Venue: Mathematics of Computation (2002)

Dimensionally unbounded problems are frequently encountered in practice, such as in simulations of stochastic processes, in particle and light transport problems and in the problems of mathematical finance. This paper considers quasi-Monte Carlo integration algorithms for weighted classes of functions of infinitely many variables, in which the dependence of functions on successive variables is increasingly limited. The dependence is modeled by a sequence of weights. The integrands belong to rather general reproducing kernel Hilbert spaces that can be decomposed as the direct sum of a series of their subspaces, each subspace containing functions of only a finite number of variables. The theory of reproducing kernels is used to derive a quadrature error bound, which is the product of two terms: the generalized discrepancy and the generalized variation.Tractability means that the minimal number of function evaluations needed to reduce the initial integration error by a factor s is bounded by Cε-p for some exponent p and some positive constant C. The ε-exponent of tractability is defined as the smallest power of ε-1 in these bounds. It is shown by using Monte Carlo quadrature that the ε-exponent is no greater than 2 for these weighted classes of integrands. Under a somewhat stronger assumption on the weights and for a popular choice of the reproducing kernel it is shown constructively using the Halton sequence that the ε-exponent of tractability is 1, which implies that infinite dimensional integration is no harder than one-dimensional integration.
Coloring 2-colorable hypergraphs with a sublinear number of colors
Authors: Noga Alon, Pierre Kelsen, Sanjeev Mahajan, Hariharan Ramesh
Venue: Nordic Journal of Computing (1996)

A coloring of a hypergraph is a mapping of vertices to colors such that no hyperedge is monochromatic. We are interested in the problem of coloring 2-colorable hypergraphs. For the special case of graphs (hypergraphs of dimension 2) this can easily be done in linear time. The problem for general hypergraphs is much more difficult since a result of Lovász implies that the problem is NP-hard even if all hyperedges have size three.In this paper we develop approximation algorithms for this problem. Our first result is an algorithm that colors any 2-colorable hypergraph on n vertices and dimension d with O(n1-1/dlog1-1/d n) colors. This is the first algorithm that achieves a sublinear number of colors in polynomial time. This algorithm is based on a new technique for reducing degrees in a hypergraph that should be of independent interest. For the special case of hypergraphs of dimension three we improve on the previous result by obtaining an algorithm that uses only O(n2/9 log17/8 n) colors. This result makes essential use of semidefinite programming. We further show that the semidefinite programming approach fails for larger dimensions.