ppxscal/embedding_network huggingface dataset:
Online store image: conceptual foundations and empirical measurement
Authors: Hans van der Heijden, Tibert Verhagen
Venue: Information and Management (2004)

Perceptions regarding an online store, developed after a brief study of the website, can significantly influence somebody's attitude towards purchasing at that store. These perceptions are collectively characterised as an "online store image." Our research developed reliable and valid measures for the components of an online store image, and examined the relationships of these components to attitudes and intentions to purchase online. Conceptually, the paper relied on the relatively established literature on "traditional" store image and technology acceptance research. Empirically, we focused on the store images of two online bookstores.Following standard processes for instrument development, we conducted two rounds of data collection (pilot sample, n = 61; main sample, n = 312) to assess reliability and validity. The paper presents multiple-item measurements for components of a store image: online store usefulness, enjoyment, ease of use, store style, familiarity, trustworthiness, and settlement performance. The components were regressed on attitudes and intentions towards purchasing at the online store, revealing significant, direct influences from usefulness, enjoyment, trustworthiness and settlement performance.
Relis-G: Remote Library Install System for Computational Grids
Authors: Hiromasa Watanabe, Hiroki Honda, Toshitsugu Yuba, Yoshio Tanaka, Mitsuhisa Sato
Venue: Proceedings of the High Performance Computing and Grid in Asia Pacific Region, Seventh International Conference (2004)

When a grid user installs the library which is used by the GridRPC etc. to the servers distributed over a grid, the user needs to solve complicated and laborious problems, such as user's effort to input commands for remote operation, creation of an installation package of the library for heterogeneous server systems, avoidance of redundant compilation, and observance of administration policy of each server. In order to enable the user to solve these problems easily, we propose the remote library install system, Relis-G, which is highly portable and multipurpose in the grid. Besides the function for automatic remote library installation, this system offers functions, such as automatic creation of an installation package, automatic avoidance of redundant compilation, and automatic observance of administration policy of each server. Moreover, we confirmed that this system mitigated the above-mentioned user's burden greatly by operation tests.
Auction algorithms for market equilibrium
Authors: Rahul Garg, Sanjiv Kapoor
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

In this paper we study algorithms for computing market equilibrium in markets with linear utility functions. The buyers in the market have an initial endowment given by a portfolio of items. The market equilibrium problem is to compute a price vector which ensures market clearing, i. e. the demand of a good equals its supply, and given the prices, each buyer maximizes its utility. The problem is of considerable interest in Economics. This paper presents a formulation of the market equilibrium problem as a parameterized linear program. We construct the dual of these parametrized linear programs. We show that finding the market equilibrium is the same as finding a linear-program from the family of programs where the optimal dual solution satisfies certain properties. The market clearing conditions arise naturally from complementary slackness conditions.We then define an auction mechanism which computes prices such that approximate market clearing is achieved. The algorithm we obtain outperforms previously known methods.
On numbers that are pseudo-Smarandache and Smarandache perfect
Authors: Charles Ashbacher
Venue: Smarandache Notions Journal (2004)

In a paper that is scheduled to be published in volume 31(3) of Journal of Recreational Mathematics, entitled "On A Generalization of Perfect Numbers"[1], Joseph L. Pe defines a generalization of the definition of perfect numbers. The standard definition is that a number n is perfect if it is the sum of its' proper divisors. n = Σki=1di Pe expands this by applying a function to the divisors. Therefore, a number n is said to be f-perfect if n = Σki=1f(di) for f an arithmetical function.
Performance bounds of algorithms for scheduling advertisements on a web page
Authors: Milind Dawande, Subodha Kumar, Chelliah Sriskandarajah
Venue: Journal of Scheduling (2003)

Consider a set of n advertisements (hereafter called "ads") A = {A1,...,An} competing to be placed in a planning horizon which is divided into N time intervals called slots. An ad Ai is specified by its size si and frequency wi. The size si represents the amount of space the ad occupies in a slot. Ad Ai is said to be scheduled if exactly wi copies of Ai are placed in the slots subject to the restriction that a slot contains at most one copy of an ad. In this paper, we consider two problems. The MINSPACE problem minimizes the maximum fullness among all slots in a feasible schedule where the fullness of a slot is the sum of the sizes of ads assigned to the slot. For the MAXSPACE problem, in addition, we are given a common maximum fullness S for all slots. The total size of the ads placed in a slot cannot exceed S. The objective is to find a feasible schedule A' ⊆ A of ads such that the total occupied slot space ΣAi∈A WiSi is maximized. We examine the complexity status of both problems and provide heuristics with performance guarantees.
Language Compression and Pseudorandom Generators
Authors: Harry Buhrman, Troy Lee, Dieter van Melkebeek
Venue: Proceedings of the 19th IEEE Annual Conference on Computational Complexity (2004)

The language compression problem asks for succinct descriptions of the strings in a language A such that the strings can be efficiently recovered from their description when given a membership oracle for A. We study randomized and nondeterministic decompression schemes and investigate how close we can get to the information theoretic lower bound of l\log \left\| {A^{ = n} } \right\| for the description length of strings of length n.Using nondeterminism alone, we can achieve the information theoretic lower bound up to an additive term of 0((\sqrt {\log \left\| {A^{ = n} } \right\|}+ \log n)\log n); using both nondeterminism and randomness, we can make do with an excess term of 0(\log ^3 n). With randomness alone, we show a lower bound of n - \log \left\| {A^{ = n} } \right\| - 0(\log n) on the description length of strings in A of length n, and a lower bound of 2 \cdot \log \left\| {A^{ = n} } \right\| - 0(1) on the length of any program that distinguishes a given string length n in A from any other string. The latter lower bound is tight up to an additive term of 0(log n).The key ingredient for our upperbounds is the relativizable hardness versus randomness trade offs based on the Nisan-Wigderson pseudorandom generator construction.
CorMet: a computational, corpus-based conventional metaphor extraction system
Authors: Zachary J. Mason
Venue: Computational Linguistics (2004)

CorMet is a corpus-based system for discovering metaphorical mappings between concepts. It does this by finding systematic variations in domain-specific selectional preferences, which are inferred from large, dynamically mined Internet corpora.Metaphors transfer structure from a source domain to a target domain, making some concepts in the target domain metaphorically equivalent to concepts in the source domain. The verbs that select for a concept in the source domain tend to select for its metaphorical equivalent in the target domain. This regularity, detectable with a shallow linguistic analysis, is used to find the metaphorical interconcept mappings, which can then be used to infer the existence of higher-level conventional metaphors.Most other computational metaphor systems use small, hand-coded semantic knowledge bases and work on a few examples. Although CorMet's only knowledge base is WordNet (Fellbaum 1998) it can find the mappings constituting many conventional metaphors and in some cases recognize sentences instantiating those mappings. CorMet is tested on its ability to find a subset of the Master Metaphor List (Lakoff, Espenson, and Schwartz 1991).
Comparative Analysis of Gene Expression and DNA Copy Number Data for Pancreatic and Breast Cancers Using an Orthogonal Decomposition
Authors: John A. Berger, Sampsa Hautaniemi, Sanjit K. Mitra
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

The causes of over-expression for many diseases are typically unknown, but current studies show that copy number aberrations may be strong candidates for driving gene over-expression. We present the use of the generalized singular value decomposition (GSVD) for simultaneously identifying relevant influences common to only copy numbers, gene expression, or both measurements in conjunction. These groups are reported and gene ontology (GO) annotations are used as a functional assessment of the groupings accompanied by probabilistic significance obtained by combinatorics. We illustrate this method for two independently published studies of pancreatic cancer and breast cancer, where public gene expression and DNA copy number data is provided and measured across numerous tumor cell lines.
Moment-Based Power Estimation in Very Deep Submicron Technologies
Authors: Alberto Garcia-Ortiz, Lukusa Kabulepa, Tudor Murgan, Manfred Glesner
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

The significant power optimization possibilities in the early stagesof the design flow advice the use of energy evaluation techniquesat high levels of abstraction. With this aim, the present work addressesthe estimation of the energy consumption in very deep submicrontechnologies. Using the characterization of the probabilitydensity function with a projection in an orthogonal polynomialbase, and a symbolic propagation mechanism, a technique is presentedto estimate the dynamic and static power consumption indigital systems. The proposed approach has been validated withcircuits and excitations from realistic applications. Comparisonswith reference transistor and bit level simulations are reported inorder to asses the the accuracy of the technique.
An Efficient Central Path Algorithm for Virtual Navigation
Authors: Parag Chaudhuri, Rohit Khandekar, Deepak Sethi, Prem Kalra
Venue: Proceedings of the Computer Graphics International (2004)

We give an efficient, scalable, and simple algorithmfor computation of a central path for navigation in closedvirtual environments. The algorithm requires less pre-processingand produces paths of high visual fidelity. Thealgorithm enables computing paths at multiple resolutions.The algorithm is based on a distance from boundary fieldcomputed on a hierarchical subdivision of the free space insidethe closed 3D object. We also present a progressiveversion of our algorithm based on a local search strategythus giving navigable paths in a localized region of interest.
Tight Lower Bounds for Certain Parameterized NP-Hard Problems
Authors: Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Huang, David Juedes, Iyad Kanj, Ge Xia
Venue: Proceedings of the 19th IEEE Annual Conference on Computational Complexity (2004)

Based on the framework of parameterized complexitytheory,we derive tight lower bounds on the computationalcomplexity for a number of well-known NP-hard problems.We start by proving a general result, namely that theparameterized weighted satisfiability problem on depth-tcircuits cannot be solved in time n^o(k) poly(m), where nis the circuit input length, m is the circuit size, and kis the parameter, unless the (t - 1)-st level W[t - 1] ofthe W-hierarchy collapses to FPT. By refining this technique,we prove that a group of parameterized NP-hardproblems, including weighted sat, dominating set,hitting set, set cover, and feature set, cannot besolved in time n^o(k) poly(m), where n is the size of theuniversal set from which the k elements are to be selectedand m is the instance size, unless the first level W[1] ofthe W-hierarchy collapses to FPT. We also prove thatanother group of parameterized problems which includesweighted q-sat (for any fixed q ¿ 2), clique, and independentset, cannot be solved in time n^o(k) unless allsearch problems in the syntactic class SNP, introduced byPapadimitriou and Yannakakis, are solvable in subexponentialtime. Note that all these parameterized problemshave trivial algorithms of running time either n^k poly(m)or O(n^k).
Technology of the IBM 3800 printing subsystem model 3
Authors: David H. McMurty, Mike J. Tinghitella, Roger G. Svendsen
Venue: IBM Journal of Research and Development (1984)

IBM has introduced the 3800 Model 3 electrophotographic printer, which is a modified version of the previously developed Model I. The Model 3 improves the print density of the 3800 Model 1 from 180 × 144 pels/in.2 to 240 × 240 pels/in.2 and permits each pel to be addressed individually. The laser print head was modified to create the higher density by using the same laser, focusing to a smaller spot size, slowing down the speed of the rotating mirror, and developing a dual-beam system. Beam-power balance and beam separation were selected for optimum print quality. The dual-beam print head required the development of a new photoconductor with improved sensitivity. That photoconductor also displayed a significantly increased lifetime. Improved manufacturing techniques were developed to reduce photoconductor defects. A digital voltmeter and a new processor were introduced that reduced the cost of the process servos by eliminating previously hard-wired elements.
Automatic sense disambiguation for acronyms
Authors: Manuel Zahariev
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

A machine learning methodology for the disambiguation of acronym senses is presented, which starts from an acronym sense dictionary. Training data is automatically extracted from downloaded documents identified from the results of search engine queries. Leave-one-out cross-validation on 9,963 documents with 47 acronym forms achieves accuracy 92.58% and Fß=1=91.52%.
Superposition: composition vs refinement of non-deterministic, action-based systems
Authors: Ant&#x00f3;nia Lopes, Jos&#x00e9; Luiz Fiadeiro
Venue: Formal Aspects of Computing (2004)

The traditional notion of superposition has been used for supporting two distinct aspects of parallel program design: composition and refinement. This is because, when trace-based semantics of concurrency are considered, which is typical of most formal methods, these two relationships are modelled as inclusion between sets of behaviours. However, when forms of non-deterministic behaviour have to be considered, which is the case for component and service-based development, these two aspects do not coincide. In this paper, we show how the two roles of superposition can be separated and supported at the language and semantic levels. For this purpose, we use a categorical formalisation of program design in the language CommUnity that we are also using for addressing architectural concerns, another area in which the distinction between composition and refinement is particularly important.
Integrating Distributed Heterogeneous Information Sources for Cultural Heritage: The DICE approach
Authors: Sebastiano Colazzo, Vito Perrone
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

In this paper we present the first results of an ongoing Italian research project named DICE (Distributed Infrastructure for Cultural hEritage). DICE aims at developing an innovative methodology and a technological infrastructure for integrating heterogeneous information belonging to different sources and allowing a more effective access to the immense cultural heritage in Italy by means of a Web interface. DICE addresses professional operators (tour operators, editors, directorates, researchers, etc.) who use DICE as unique source for discovering interesting pieces of information and act as "cultural mediators" towards the final users. From an architectural point of view, DICE is based on a peer-to-peer network in which each peer owns some information potentially interesting for the DICE community and participating to the network it "exposes" its database allowing other users accessing them through a unified navigational interface. From the organizational point of view, DICE supposes the community agrees on a common "representation model" and a sharing policy.
Design and evolution of an undergraduate course on web application development
Authors: Kwok-Bun Yue, Wei Ding
Venue: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education (2004)

Web technologies have become essential in the computing curricula. However, teaching a Web development course to computing students is challenging because of large bodies of knowledge, rapidly changing technologies, demanding support infrastructures and diverse background of audiences. This paper presents the evolution and the experiences we have gained in teaching a Web development course for the past seven years. We incorporate selected leading edge Web technologies as soon as they become mature and stable. The course covers a broad spectrum of Internet technologies to provide a solid conceptual framework. It also includes an in-depth study of a selected technology to provide the necessary depth and knowledge to build realistic Web applications. This paper describes the course design, our choice of topics, programming assignments, course delivery and our experience in coping with the rapidly changing Web technologies.
Granary: Architecture of Object Oriented Internet Storage Service
Authors: Weimin Zheng, Jinfeng Hu, Ming Li
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

Granary is a public storage service on the Internet that has two distinguished goals in comparison with previous projects. First, it is object-oriented, and thereby supports attribute-level data query. Second, it is very flexible to the system environment, i.e., it can be deployed in a grid-like environment, a peer-to-peer-like environment, or even a compromised one. In this paper, we present Granary's architecture, as well as some of its significant components that are designed in adherence to these two goals, including the node-collection protocol PeerWindow, the routing infrastructure Tourist, and the object-index management algorithm PB-link Tree. An implementation of Granary is in development and intended to be deployed in a campus scale.
Mining Navigation Patterns Using a Sequence Alignment Method
Authors: Birgit Hay, Geert Wets, Koen Vanhoof
Venue: Knowledge and Information Systems (2004)

In this article, a new method is illustrated for mining navigation patterns on a web site. Instead of clustering patterns by means of a Euclidean distance measure, in this approach users are partitioned into clusters using a non-Euclidean distance measure called the Sequence Alignment Method (SAM). This method partitions navigation patterns according to the order in which web pages are requested and handles the problem of clustering sequences of different lengths. The performance of the algorithm is compared with the results of a method based on Euclidean distance measures. SAM is validated by means of user-traffic data of two different web sites. Empirical results show that SAM identifies sequences with similar behavioral patterns not only with regard to content, but also considering the order of pages visited in a sequence.
Effective application development for presentation manager programs
Authors: S. M. Franklin, A. M. Peters
Venue: IBM Systems Journal (1990)

The OS/2TM Presentation ManagerTM provides an integrated graphical, windowing user interface to IBM's OS/2 operating system. This paper addresses a primary area of interest for Presentation Manager application developers: the use and development of user controls. A control in the Presentation Manager environment is a program object with a programming interface and application function. The structure and interfaces between controls and the system are described in order to provide an understanding of the correct procedure for programming the Presentation Manager efficiently.
Electronic learning communities: strategies for establishment and management
Authors: Judy Sheard
Venue: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education (2004)

Students working in an online environment are isolated from their educators and other learners. Asynchronous discussion forums are often used to provide the learner with assistance, support and the social structures more readily available in the face-to-face environment. A further benefit of online discussion forums is the enabling of the development of electronic learning communities. However, the operation of these communities has required learners and educators to adopt behaviours and strategies appropriate for communication within this medium. This paper presents a model for electronic learning communities developed from studies of computing students and their teaching staff. The studies found that the development of an electronic learning community was largely student driven; however, staff had key roles to play in this process. The paper concludes with a set of strategies for the establishment and effective management of these communities.
The single machine batching problem with family setup times to minimize maximum lateness is strongly NP-hard
Authors: T. C. E. Cheng, C. T. Ng, J. J. Yuan
Venue: Journal of Scheduling (2003)

In this paper, we consider the single machine batching problem with family setup times to minimize maximum lateness. While the problem was proved to be binary NP-hard in 1978, whether the problem is strongly NP-hard is a long-standing open question. We show that this problem is strongly NP-hard.
Probabilistic model for contextual retrieval
Authors: Ji-Rong Wen, Ni Lao, Wei-Ying Ma
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

Contextual retrieval is a critical technique for facilitating many important applications such as mobile search, personalized search, PC troubleshooting, etc. Despite of its importance, there is no comprehensive retrieval model to describe the contextual retrieval process. We observed that incompatible context, noisy context and incomplete query are several important issues commonly existing in contextual retrieval applications. However, these issues have not been previously explored and discussed. In this paper, we propose probabilistic models to address these problems. Our study clearly shows that query log is the key to build effective contextual retrieval models. We also conduct a case study in the PC troubleshooting domain to testify the performance of the proposed models and experimental results show that the models can achieve very good retrieval precision.