ppxscal/embedding_network huggingface dataset:
Attitudes towards technology use in public zones: the influence of external factors on ATM use
Authors: Linda Little
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

This study used a Grounded theory approach to find factors that influence current and future use of technological systems in public zones. Fifteen participants who were either frequent or non-frequent automated teller machine (ATM) users were interviewed. They were asked their opinions, views, feelings and any other issues that they felt were important to them when using an ATM and that effected their use. From the themes and concepts that emerged from the data a conceptual model of ATM use was constructed. The model builds on ideas from the Technology Acceptance Model but additionally postulates that external factors such as perception of privacy exert an effect on attitude to use.
Analysis of the parallel packet switch architecture
Authors: Sundar Iyer, Nick W. McKeown
Venue: IEEE/ACM Transactions on Networking (TON) (2003)

Our work is motivated by the desire to design packet switches with large aggregate capacity and fast line rates. In this paper, we consider building a packet switch from multiple lower speed packet switches operating independently and in parallel. In particular, we consider a (perhaps obvious) parallel packet switch (PPS) architecture in which arriving traffic is demultiplexed overk identical lower speed packet switches, switched to the correct output port, then recombined (multiplexed) before departing from the system. Essentially, the packet switch performs packet-by-packet load balancing, or inverse multiplexing, over multiple independent packet switches. Each lower speed packet switch operates at a fraction of the line rate R. For example, each packet switch can operate at rateR/k. It is a goal of our work that all memory buffers in the PPS run slower than the line rate. Ideally,a PPS would share the benefits of an output-queued switch, i.e., the delay of individual packets could be precisely controlled, allowing the provision of guaranteed qualities of service.In this paper, we ask the question: Is it possible for a PPS to precisely emulate the behavior of an output-queued packet switch with the same capacity and with the same number of ports? We show that it is theoretically possible for a PPS to emulate a first-come first-served (FCFS) output-queued (OQ) packet switch if each lower speed packet switch operates at a rate of approximately 2R/k. We further show that it is theoretically possible for a PPS to emulate a wide variety of quality-of-service queueing disciplines if each lower speed packet switch operates at a rate of approximately 3R/k. It turns out that these results are impractical because of high communication complexity, but a practical high-performance PPS can be designed if we slightly relax our original goal and allow a small fixed-size coordination buffer running at the line rate in both the demultiplexer and the multiplexer. We determine the size of this buffer and show that it can eliminate the need for a centralized scheduling algorithm, allowing a full distributed implementation with low computational and communication complexity. Furthermore, we show that if the lower speed packet switch operates at a rate ofR/k (i.e., without speedup), the resulting PPS can emulate an FCFS-OQ switch within a delay bound.
Antecedent validity adaptation principle for fuzzy systems tuning
Authors: P. T. Chan, A. B. Rad
Venue: Fuzzy Sets and Systems (2002)

This paper proposes an antecedent validity adaptation (AVA) principle for fuzzy systems tuning. It is suggested that the fuzzy rules may be updated with respect to the validity of antecedents. This adaptation principle agrees with the human intuition and fuzzy logic reasoning. The principle is first applied to table look-up (TL) scheme to model recorded data; an on-line fuzzy identification algorithm is also proposed. Next, the principle is applied to fuzzy clustering algorithm. These methods are successfully applied to model nonlinear systems.
Heterogeneous image database selection on the web
Authors: Deok-Hwan Kim, Seok-Lyong Lee, Chin-Wan Chung
Venue: Journal of Systems and Software (2002)

Image databases on the Web have heterogeneous characteristics since they use different similarity measures and queries are processed depending on their own schemes. In the content-based image retrieval from distributed sites, it is crucial that the metaserver has the capability to find objects, similar to a given query object in terms of the global similarity measure, from different image databases with different local similarity measures. In this paper, we investigate the problem of finding databases, which contain more objects relevant to a given query than other databases, from many image databases dispersed on the Web. This problem is referred to as a database selection problem.We propose a new selection method to determine candidate databases. The selection of databases is based on the hybrid estimator using a few sample objects and compressed histogram information of image databases. Extensive experiments on a large number of image data demonstrate that our proposed method improves the effectiveness of distributed content-based retrieval in a heterogeneous environment.
A Mathematical Model and Descent Algorithm for Bilevel Traffic Management
Authors: Michael Patriksson, R. Tyrrell Rockafellar
Venue: Transportation Science (2002)

We provide a new mathematical model for strategic traffic management, formulated and analyzed as a mathematical program with equilibrium constraints (MPEC). The model includes two types of control (upper-level) variables, which may be used to describe such traffic management actions as traffic signal setting, network design, and congestion pricing. The lower-level problem of the MPEC describes a traffic equilibrium model in the sense of Wardrop, in which the control variables enter as parameters in the travel costs. We consider a (small) variety of model settings, including fixed or elastic demands, the possible presence of side constraints in the traffic equilibrium system, and representations of traffic flows and management actions in both link-route and link-node space.For this model, we also propose and analyze a descent algorithm. The algorithm utilizes a new reformulation of the MPEC into a constrained, locally Lipschitz minimization problem in the product space of controls and traffic flows. The reformulation is based on the Minty (1967) parameterization of the graph of the normal cone operator for the traffic flow polyhedron. Two immediate advantages of making use of this reformulation are that the resulting descent algorithm can be operated and established to be convergent without requiring that the travel cost mapping is monotone, and without having to ever solve the lower-level equilibrium problem. We provide example realizations of the algorithm, establish their convergence, and interpret their workings in terms of the traffic network.
Connectionist interaction information retrieval
Authors: Sandor Dominich
Venue: Information Processing and Management: an International Journal (2003)

Connectionist views for adaptive clustering in information retrieval (IR) have proved to be viable approaches, and have yielded a number of models and techniques. However there has never been any exhaustive and methodical--i.e., theoretical, formal, practical, simulation- and user-based-evaluation of such a retrieval method and system. The aim of the paper is therefore just this. It suggests a connectionist clustering technique and activation spreading-based IR model using the interaction information retrieval (I2R) method. Theoretical as well as simulation results as regards computational complexity of this method are presented and discussed. Evaluations of relevance effectiveness are also given using standard test collections. Two applications were designed, developed and implemented based on this method. Their relevance effectiveness was evaluated in vivo in experiments carried out with human subjects. The results obtained show that I2R based on a connectionist approach proves useful when emphasis is on high precision.
Evaluating the Impact of the Communication System on Distributed Virtual Environments
Authors: Renata Cruz Teixeira, Otto Carlos M. B. Duarte
Venue: Multimedia Tools and Applications (2003)

This paper analyzes the impact of the communication system on distributed virtual environments. We present a platform model that express the communication requirements of this kind of applications and evaluate it via simulation. Performance measurements varied the number of participants, the partition of the virtual environment, a participant's speed, and the size of the virtual world. Results show that the division of the environment improves the delay both to enter and to exchange groups, and reduces the number of messages exchanged. This partition allows both a participant's speed and the number of participants to increase, thereby ensuring a good interactivity.
Open source software development and Lotka's law: bibliometric patterns in programming
Authors: Gregory B. Newby, Jane Greenberg, Paul Jones
Venue: Journal of the American Society for Information Science and Technology (2003)

This research applies Lotka's Law to metadata on open source software development. Lotka's Law predicts the proportion of authors at different levels of productivity. Open source software development harnesses the creativity of thousands of programmers worldwide, is important to the progress of the Internet and many other computing environments, and yet has not been widely researched. We examine metadata from the Linux Software Map (LSM), which documents many open source projects, and Sourceforge, one of the largest resources for open source developers. Authoring patterns found are comparable to prior studies of Lotka's Law for scientific and scholarly publishing. Lotka's Law was found to be effective in understanding software development productivity patterns, and offer promise in predicting aggregate behavior of open source developers.
Interface design for metadata creation
Authors: Abe Crystal
Venue: CHI '03 extended abstracts on Human factors in computing systems (2003)

The rapid growth of the Web has increased the importance of decentralized metadata creation. Resource authors must create their own metadata to enable enhanced information seeking and retrieval, and they need effective interfaces to support their work. This paper reports a baseline study of author interactions with a metadata system and draws implications for the design of future interfaces.
Pseudo-t-norms and implication operators on a complete Brouwerian lattice
Authors: Zhudeng Wang, Yandong Yu
Venue: Fuzzy Sets and Systems (2002)

In this paper, we introduce and discuss the concept of pseudo-t-norms on a complete Brouwerian lattice L, study the relation between the set of all infinitely ∧-distributive pseudo-t-norms and the set of all infinitely ∧-distributive implications on L in detail, and point out that three classes fundamental fuzzy implications and Yager's implication on [0, 1] are all infinitely ∧-distributive implications that can be induced by infinitely ∧-distributive pseudo-t-norms on L when L = [0, 1]. We also give out a method for generating pseudo-t-norms and implications on L.
Partial cubes as subdivision graphs and as generalized Petersen graphs
Authors: Sandi Klavˇzar, Alenka Lipovec
Venue: Discrete Mathematics (2003)

Isometric subgraphs of hypercubes are known as partial cubes. The subdivision graph of a graph G is obtained from G by subdividing every edge of G. It is proved that for a connected graph G its subdivision graph is a partial cube if and only if every block of G is either a cycle or a complete graph. Regular partial cubes are also considered. In particular, it is shown that among the generalized Petersen graphs P(10,3) and P(2n, 1), n ≥ 2, are the only (regular) partial cubes.
Time to Change: Temporal Shifts as Enablers of Organizational Change
Authors: Nancy Staudenmayer, Marcie Tyre, Leslie Perlow
Venue: Organization Science (2002)

In this paper, we integrate findings from three field studies of technology intensive organizations to explore the process through which change occurred. In each case, problems were well recognized but had become entrenched and had failed to generate change. Across the three sites, organizational change occurred only after some event altered the accustomed daily rhythms of work, and thus changed the way people experienced time. This finding suggests that temporal shifts--changes in a collective's experience of time--can help to facilitate organizational change. Specifically, we suggest that temporal shifts enable change in four ways: (1) by creating a trigger for change, (2) by providing resources needed for change, (3) by acting as a coordinating mechanism, and (4) by serving as a credible symbol of the need to change.
Routing on a curve
Authors: Badri Nath, Dragoş Niculescu
Venue: ACM SIGCOMM Computer Communication Review (2003)

Relentless progress in hardware technology and recent advances in sensor technology, and wireless networking have made it feasible to deploy large scale, dense ad-hoc networks. These networks together with sensor technology can be considered as the enablers of emerging models of computing such as embedded computing, ubiquitous computing, or pervasive computing. In this paper, we propose a new paradigm called trajectory based forwarding (or TBF), which is a generalization of source based routing and Cartesian routing. We argue that TBF is an ideal technique for routing in dense ad-hoc networks. Trajectories are a natural namespace for describing route paths when the topology of the network matches the topography of the physical surroundings in which it is deployed which by very definition is embedded computing.We show how simple trajectories can be used in implementing important networking protocols such as flooding, discovery, and network management. Trajectory routing is very effective in implementing many networking functions in a quick and approximate way, as it needs very few support services. We discuss several research challenges in the design of network protocols that use specific trajectories for forwarding packets.
A physical model for characteristics of an optical amplifier-switch integrated device
Authors: M. H. Sheikhi, V. Ahmadi, M. K. Moravvej-Farshi
Venue: Iranian Journal of Science and Technology (2002)

A physical model is develpoed for operation of a functional quantum well optoelectronic integrated device (QW-OEID). Based on the model, static and dynamic characteristics of the device is analyzed numerically considering the effects of parameters such as internal optical feedback and lateral diffusion of carriers for both amplification and switching modes of operations.
Introduction to combinatorial pyramids
Authors: Luc Brun, Walter Kropatsch
Venue: Digital and image geometry: advanced lectures (2001)

A pyramid is a stack of image representations with decreasing resolution. Many image processing algorithms run on this hierarchical structure in O(log(n)) parallel processing steps where n is the diameter of the input image. Graph pyramids are made of a stack of successively reduced graphs embedded in the plane. Such pyramids overcome the main limitations of their regular ancestors. The graphs used in the pyramid may be region adjacency graphs or dual graphs. This paper reviews the different hierarchical data structures and introduces a new representation named combinatorial pyramid.
A parser project in a programming languages course
Authors: Michael Werner
Venue: Journal of Computing Sciences in Colleges (2003)

This experience report describes a programming exercise designed to reinforce concepts of parsing, regular and context-free grammars, first sets, and abstract syntax trees. Students build a parser for a language with real applications. To make this feasible tools including a compiler compilers and automated support for the visitor design pattern, are used. The exercise is extensible.
The competitive ratio for on-line dual bin packing with restricted input sequences
Authors: Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen
Venue: Nordic Journal of Computing (2001)

We consider the On-Line Dual Bin Packing problem where we have a fixed number n of bins of equal size and a sequence of items. The goal is to maximize the number of items that are packed in the bins by an on-line algorithm. An investigation of First-Fit and an algorithm called Log shows that, in the special case where all sequences can be completely packed by an optimal off-line algorithm, First-Fit has a constant competitive ratio, but Log does not. In contrast, if there is no restriction on the input sequences, Log is exponentially better than First-Fit. This is the first separation of this sort with a difference of more than a constant factor. We also design randomized and deterministic algorithms for which the competitive ratio is constant on sequences which the optimal off-line algorithm can pack using at most αn bins, if α is constant and known to the algorithm in advance.
Point-distributed algorithms on locally refined grids for second order elliptic equations
Authors: Richard E. Ewing, Jian Shen, Junping Wang
Venue: Scientific computing and applications (2001)

A discretization scheme, which relates the mixed finite element method with cell-centered finite difference and finite volume element methods, is proposed for second-order elliptic equations on rectangular domains with locally refined composite grids. Optimal order error estimates and superconvergence results are established, both in L2 and pointwise along special Gauss-line loci. These error estimates hold for discontinuous piecewise constant conductivity under some special assumptions about solutions.
Feasible itemset distributions in data mining: theory and application
Authors: Ganesh Ramesh, William A. Maniatty, Mohammed J. Zaki
Venue: Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2003)

Computing frequent itemsets and maximally frequent item-sets in a database are classic problems in data mining. The resource requirements of all extant algorithms for both problems depend on the distribution of frequent patterns, a topic that has not been formally investigated. In this paper, we study properties of length distributions of frequent and maximal frequent itemset collections and provide novel solutions for computing tight lower bounds for feasible distributions. We show how these bounding distributions can help in generating realistic synthetic datasets, which can be used for algorithm benchmarking.
Payments and banking with mobile personal devices
Authors: Amir Herzberg
Venue: Communications of the ACM (2003)

Mobile devices enable secure, convenient authorization of e-banking, retail payment, brokerage, and other types of transactions.
Expected-Case Complexity of Approximate Nearest Neighbor Searching
Authors: Sunil Arya, Ho-Yam Addy Fu
Venue: SIAM Journal on Computing (2003)

Most research in algorithms for geometric query problems has focused on their worst-case performance. However, when information on the query distribution is available, the alternative paradigm of designing and analyzing algorithms from the perspective of expected-case performance appears more attractive. We study the approximate nearest neighbor problem from this perspective.As a first step in this direction, we assume that the query points are sampled uniformly from a hypercube that encloses all the data points; however, we make no assumption on the distribution of the data points. We show that with a simple partition tree, called the sliding-midpoint tree, it is possible to achieve linear space and logarithmic query time in the expected case; in contrast, the data structures known to achieve linear space and logarithmic query time in the worst case are complex, and algorithms on them run more slowly in practice. Moreover, we prove that the sliding-midpoint tree achieves optimal expected query time in a certain class of algorithms.
A new Greedoid: the family of local maximum stable sets of a forest
Authors: Vadim E. Levit, Eugen Mandrescu
Venue: Discrete Applied Mathematics (2002)

A maximum stable set in a graph G is a stable set of maximum cardinality. S is a local maxtmum stable set if it is a maximum stable of the subgraph of G spanned by S∪N(S), where N(S) is the neighborhood of S. One theorem of Nemhauser and Trotter Jr. (Math. Programming 8 (1975) 232-248), working as a useful sufficient local optimality condition for the weighted maximum stable set problem, ensures that any local maximum stable set of G can be enlarged to a maximum stable set of G. In this paper we demonstrate that an inverse assertion is true for forests. Namely, we show that for any non-empty local maximum stable set S of a forest T there exists a local maximum stable set S1 of T, such that S1 ⊂ S and |S1|=|S|-1. Moreover, as a further strengthening of both the theorem of Nemhauser and Trotter Jr. and its inverse, we prove that the family of all local maximum stable sets of a forest forms a greedoid on its vertex set.
Arbitrary order numerical method for solving differential-algebraic equation by Padé series
Authors: Ercan Çelik, Mustafa Bayram
Venue: Applied Mathematics and Computation (2003)

In this paper, the solution for a differential-algebraic equation can be expanded up to arbitrary order using MAPLE computer algebra systems [MAPLE V, CRC Press, Boca Raton, FL 33431, 1996]. First we calculate power series of the given equations system then transform it into Padé series form, which give an arbitrary order for solving differential-algebraic equation numerically.
GeoSearcher: location-based ranking of search engine results
Authors: Carolyn Watters, Ghada Amoudi
Venue: Journal of the American Society for Information Science and Technology (2003)

Many web queries have geospatial dimensions. While online shopping is built on the premise that distance and location are irrelevant (with the possible exception of shipping charges), tourism and onsite inspection of goods have a geospatial dimension and distance and location are relevant factors. Current search engines build indices based on keyword occurrence and frequency for query negotiation using these indices. This approach is fast, robust, and generic but when queries are related to physical locations and distances rather than cyberdistances this approach leaves the user to sort through pages of results. In this paper, we describe an algorithm that assigns location coordinates dynamically to web sites based on the URL. A prototype search system was built using this algorithm that uses this information to re-rank the results of search engines for queries with a geospatial dimension. We found that over 80% of the URLs tested could be assigned correct location coordinates. This work makes a contribution to retrieval on the web by providing an alternative ranking order for search engine results so that users with queries with a geospatial dimension can more readily use the results of general search engines rather than special purpose applications.
In Search of Data: An Editorial
Authors: Steven M. Shugan
Venue: Marketing Science (2002)

We argue that: (1) whether articles contain numeric data should be irrelevant to the evaluation process; (2) the desirability of numeric real, numeric synthetic, or nonnumeric data depends on the research objective; (3) assumptions can and should sometimes substitute for additional data; and (4) equal scrutiny should be given to data collection procedures, regardless of whether the researcher influences the collection or not. Finally, rather than focusing on data, evaluation of research should focus on whether the research provides compelling evidence for the conclusions.