ppxscal/embedding_network huggingface dataset:
Privacy Preserving Web-Based Questionnaire
Authors: Junji Nakazato, Kenji Fujimoto, Hiroaki Kikuchi
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

This paper proposes a secure protocol for web-based questionnaire that preserves the privacy of responders and ensures the robustness. The proposed protocol is based on secure electronic voting protocol proposed by Cramer et al. confidentiality and efficiency, which are common requirements for both applications. This paper points out an issue particular in the secure questionnaire, that is, a requirement to deal with a multiple-choice question, and shows that the communication overhead grows exponentially with the number of choices n. To address the issue, the proposed protocol reduces the cost from ¿(2^n) to ¿(n). The performance based on the experimental implementation is also shown.
Inventory Sharing and Rationing in Decentralized Dealer Networks
Authors: Hui Zhao, Vinayak Deshpande, Jennifer K. Ryan
Venue: Management Science (2005)

An increasing number of manufacturers have started to pursue a strategy that promotes inventory sharing among the dealers in their distribution network. In this paper we analyze a decentralized dealer network in which each independent dealer is given the flexibility to share his inventory. We model inventory sharing as a multiple demand classes problem in which each dealer faces his own customer demand with high priority, and inventory-sharing requests from other dealers with low priority. Assuming that each dealer uses a base-stock and threshold-rationing policy for his inventory-stocking and inventory-sharing decisions, we explicitly model the interactions between the dealers through inventory sharing and obtain aclosed-form cost function for each dealer based on the steady-state distribution of the inventory levels at the two dealers. We then provide a detailed supermodularity analysis of the inventory-sharing and inventory-rationing game in which each dealer has a two-dimensional strategy set (stocking level and rationing level). We show that the full-sharing game (in which dealers precommit to sharing all of their on-hand inventory) and the fixed-sharing-level game (in which dealers precommit to sharing a portion of their on-hand inventory) are supermodular, and thus a pure-strategy Nash equilibrium is guaranteed to exist. For the rationing game (in which dealers precommit to their stocking levels), we show that there exists a dominant strategy equilibrium on the dealers' sharing (rationing) levels. Finally, a comprehensive computational study is conducted to highlight the impact of the manufacturer's incentives, subsidies, and/or transshipment fees on the dealers' sharing behavior.
Learning algorithms for single-instance electronic negotiations using the time-dependent behavioral tactic
Authors: Wilson Wai Ho Mok, R. P. Sundarraj
Venue: ACM Transactions on Internet Technology (TOIT) (2005)

Negotiator often rely on learning an opponent's behavior and on then using the knowledge gained to arrive at a better deal. However, in an electronic negotiation setting in which the parties involved are often unknown to (and therefore lack information about) each other, this learning has to be accomplished with only the bid offers submitted during an ongoing negotiation. In this article, we consider such a scenario and develop learning algorithms for electronic agents that use a common negotiation tactic, namely, the time-dependent tactic (TDT), in which the values of the negotiating issues are dependent on the time elapsed in the negotiation. Learning algorithms for this tactic have not been proposed in the literature. Our approach is based on using the derivatives of the Taylor's series approximation of the TDT function in a three-phase algorithm that enumerates over a partial discretized version of the solution space. Computational results with our algorithms are encouraging.
Comparison of forwarding strategies in internet connected MANETs
Authors: Erik Nordström, Per Gunningberg, Christian Tschudin
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2004)

For efficient Internet Connectivity in MANETs, multiple gateways and potentially multi-homing and hand-over need to be supported. We compare two forwarding strategies; default routes and tunneling to gateways. We find that tunneling is more efficient and flexible compared to default routes. In fact, we show that default routes will not operate correctly in some situations, particularly in multi-homed networks with more than one gateway.
An Exchange Protocol for Alternative Currencies
Authors: Yiyao Hao, Daniel M. Havey, David A. Turner
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

Alternative currencies are currencies issued by individuals or entities other than national governments for the purpose of improving the economic well being of individuals by cultivating new trading relationships. We present a currency exchange protocol for use in alternative currency markets, such as those based on the Lightweight Currency Protocol, Local Exchange Transaction Systems, and Time Dollar Systems. In order to further enable the benefits derived from the use of alternative currencies, we propose the establishment of an exchange protocol that enables users to swap currencies. In this paper, we define the protocol we developed for this purpose, and describe the systems we prototyped to demonstrate the practicability of the currency exchange protocol.
Review of "Readings in Medical Artificial Intelligence by William J. Clancey and Edward Shortliffe", Addison-Wesley Publishing Co, Reading, MA.
Authors: Marco Valtorta
Venue: Issue 92 (April 1985) (1985)

This volume is a collection of twenty-one articles on Al systems "concerned primarily with diagnosis and therapy" (p. 4). Eighteen are already published, one is based on a doctoral dissertation, and the remaining two, the first and the last ones, were written by the editors, William J. Clancey and Edward H. Shortliffe of Stanford University, especially for this book. Each article appears as a separate chapter introduced by a tow-page essay explaining its relevance and its relation to other work.
HCI in the classroom
Authors: Daniel D. McCracken
Venue: Journal of Computing Sciences in Colleges (2004)

Human-Computer Interaction is a recognized field in the CS curriculum, as of Computing Curricula 2001. But what is it? Can you teach it without a formal background in the subject? This workshop addresses both questions, through a combination of lecture/demonstrations and group exercises, and discusses how to fit HCI into an already-crowded CS curriculum. Each participant may request a desk a copy of User-Centered Website Development: A Human-Computer Interaction Approach, by Dan McCracken and Rosalee Wolfe (DePaul University). All participants will receive a CD containing instructor supplements, one of which is a complete set of PowerPoint slides, some of which will be used in the workshop. HCI materials from other NSF-supported grants will also be used.
A chain theorem for 4-connected matroids
Authors: Rhiannon Hall
Venue: Journal of Combinatorial Theory Series B (2005)

A matroid M is said to be k-connected up to separators of size l if whenever A is (k - 1)-separating in M, then either |A| ≤ l or |E(M) - A|≤ l. We use si(M) and co(M) to denote the simplification and cosimplification of the matroid M. We prove that if a 3-connected matroid M is 4-connected up to separators of size 5, then there is an element x of M such that either co(M\x) or si(M/x) is 3-connected and 4-connected up to separators of size 5, and has a cardinality of |E(M)| - 1 or |E(M)| - 2.
Motion Panoramas: Research Articles
Authors: Adrien Bartoli, Navneet Dalal, Radu Horaud
Venue: Computer Animation and Virtual Worlds (2004)

In this paper we describe a method for analysing video sequences and for representing them as mosaics or panoramas. Previous work on video mosaicking essentially concentrated on static scenes. We generalize these approaches to the case of a rotating camera observing both static and moving objects where the static portions of the scene are not necessarily dominant, as it has been often hypothesized in the past. We start by describing a robust technique for accurately aligning a large number of video frames under unknown camera rotations and camera settings. The alignment technique combines a feature-based method (initialization and refinement) with rough motion segmentation followed by a colour-based direct method (final adjustment). This precise frame-to-frame alignment allows the dynamic building of a background representation as well as an efficient segmentation of each image such that moving regions of arbitrary shape and size are aligned with the static background. Thus a motion panorama visualizes both dynamic and static scene elements in a geometrically consistent way. Extensive experiments applied to archived videos of track-and-field events validate the approach. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Elsewhere
Venue: IEEE Internet Computing (2004)

Review of Internet stories in Computer Society and trade press. 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
On the Optimal Ordering of Maps and Selections under Factorization
Authors: Thomas Neumann, Sven Helmer, Guido Moerkotte
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

The query optimizer of a database system is confronted with two aspects when handling user-defined functions (UDFs) in query predicates: the vast differences in evaluation costs between UDFs (and other functions) and multiple calls of the same (expensive) UDF. The former is dealt with by ordering the evaluation of the predicates optimally, the latter by identifying common subexpressions and thereby avoiding costly recomputation. Current approaches order n predicates optimally (neglecting factorization) in O(n log n). Their result may deviate significantly from the optimal solution under factorization. We formalize the problem of finding optimal orderings under factorization and prove that it is NP-hard. Furthermore, we show how to improve on the run time of the brute-force algorithm (which computes all possible orderings) by presenting different enhanced algorithms. Although in the worst case these algorithms obviously still behave exponentially, our experiments demonstrate that for real-life examples their performance is much better.
An adaptive middleware infrastructure for mobile computing
Authors: Ronnie Cheung
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

In a mobile environment where mobile applications suffer from the limitation and variation of system resources availability, it is desirable for the applications to adapt their behaviors to resource limitations and variations. It is also necessary to exploit optimal application performance. However, adaptation mechanisms by mobile applications usually suffers from the problem of unfairness to other applications, in contrast, adaptation by the operation system focuses more on the overall system performance, while neglecting the needs of individual applications. Hence, the adaptation task is best coordinated by a middleware that is able to cater for individual application's need on a fair ground, while maintaining optimal system performance. This is achieved by a context-aware mobile middleware that sits in between the mobile application and the operating environment.
Examples of ill-behaved central paths in convex optimization
Authors: J. Charles Gilbert, Clovis C. Gonzaga, Elizabeth Karas
Venue: Mathematical Programming: Series A and B (2005)

This paper presents some examples of ill-behaved central paths in convex optimization. Some contain infinitely many fixed length central segments; others manifest oscillations with infinite variation. These central paths can be encountered even for infinitely differentiable data.
Review of "The Handbook of Artificial Intelligence, Volume 2 by A. Barr & E. A. Feigenbaum, eds., Volume 3 by P. R. Cohen & E. A. Feigenbaum, eds.".
Authors: Keith Price
Venue: Issue 83 (January 1983) (1983)

The Handbook of Artificial Intelligence, Volumes 2 and 3, continue the work started in Volume 1 (see review in SIGART #81, July 1982). Volume 2 primarily covers applications oriented work (expert systems) with chapters on programming languages and automatic programming. Volume 3 contains a long chapter on vision and shorter chapters on learning, theorem proving, planning and models of cognition.
Revisiting an automatic program inverter for Lisp
Authors: Robert Glück, Masahiko Kawabe
Venue: ACM SIGPLAN Notices (2005)

We reformulate the Korf-Eppstein method for automatic inversion of first-order functional programs using a structural operational semantics and compare it with the program inversion method described by Gries. We analyze the method and suggest possible extensions. The method is noteworthy in that it was used to construct the first automatic program inverter described in the literature. The key features of the Korf-Eppstein method are the simultaneous inversion of an injective system of functions, an equation-oriented transformation, and the use of postcondition inference heuristics.
Selective Stimulation to Superficial Mechanoreceptors by Temporal Control of Suction Pressure
Authors: Yasutoshi Makino, Hiroyuki Shinoda
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

In this paper we propose a new set of primitives to realize a large-area covering realistic tactile display. They stimulate the skin surface with suction pressure (SPS method) as our former paper proposed. The difference from the former device is that a single suction hole provides a pair of primitives. Since the identical hole provides the multiple primitives, we can expect Multi-Primitive Tactile Stimulation is realized more stably, and the physical structure is simpler than the former method. The method uses the frequency characteristics of the mechanoreceptor sensitivity and a feature of SPS that suction pressure through a hole does not reach the deep receptors, Pacinian corpuscles. We show the basic theory and results of fundamental experiments. In the experiments, we show the spatial feature of the virtual object (edged or round) can be controlled by the temporal profile of the primitives. We explain the reason of the phenomena based on a tactile perception model called Simple Bundle Model.
Weakly useful sequences
Authors: Stephen A. Fenner, Jack H. Lutz, Elvira Mayordomo, Patrick Reardon
Venue: Information and Computation (2005)

An infinite binary sequence x is defined to be (i) strongly useful if there is a computable time bound within which every decidable sequence is Turing reducible to x; and (ii) weakly useful if there is a computable time bound within which all the sequences in a non-measure 0 subset of the set of decidable sequences are Turing reducible to x.Juedes, Lathrop, and Lutz [Theorectical Computer Science 132 (1994) 37] proved that every weakly useful sequence is strongly deep in the sense of Bennett [The Universal Turing Machine: A Half-Century Survey, 1988, 227] and asked whether there are sequences that are weakly useful but not strongly useful. The present paper answers this question affirmatively. The proof is a direct construction that combines the martingale diagonalization technique of Lutz [9] with a new technique, namely, the construction of a sequence that is "computably deep" with respect to an arbitrary, given uniform reducibility. The abundance of such computably deep sequences is also proven and used to show that every weakly useful sequence is computably deep with respect to every uniform reducibility.
Tuning SoC Platforms for Multimedia Processing: Identifying Limits and Tradeoffs
Authors: Alexander Maxiaguine, Yongxin Zhu, Samarjit Chakraborty, Weng-Fai Wong
Venue: Proceedings of the international conference on Hardware/Software Codesign and System Synthesis: 2004 (2004)

We present a analytical framework to identify the tradeoffs and performance impacts associated with different SoC platform configurations in the specific context of implementing multimedia applications. "Configurations" in this case might include sizes of different on-chip buffers and scheduling mechanisms (or associated parameters) implemented on the different processing elements of the platform. Identifying such tradeoffs is difficult because of the bursty nature of on-chip traffic arising out of multimedia processing and the high variability in their execution requirements, which result in a highly irregular design space. We show that this irregularity in the design space can be precisely captured using an abstraction called variability characterization curves.
Prefix and Interval-Partitioned Dynamic IP Router-Tables
Authors: Haibin Lu, Kun Suk Kim Sartaj Sahni
Venue: IEEE Transactions on Computers (2005)

Two schemes¿prefix partitioning and interval partitioning¿are proposed to improve the performance of dynamic IP router-table designs. While prefix partitioning applies to all known dynamic router-table designs, interval partitioning applies to the alternative collection of binary search tree designs of Sahni and Kim [18]. Experiments using public-domain IPv4 router databases indicate that one of the proposed prefix partitioning schemes¿TLDP¿results in router tables that require less memory than when prefix partitioning is not used. Further significant reduction in the time to find the longest matching-prefix, insert a prefix, and delete a prefix is achieved.
The Combinatorial Quantum Cohomology Ring of G/B
Authors: Augustin-Liviu Mare
Venue: Journal of Algebraic Combinatorics: An International Journal (2005)

A purely combinatorial construction of the quantum cohomology ring of the generalized flag manifold is presented. We show that the ring we construct is commutative, associative and satisfies the usual grading condition. By using results of our previous papers [12, 13], we obtain a presentation of this ring in terms of generators and relations, and formulas for quantum Giambelli polynomials. We show that these polynomials satisfy a certain orthogonality property, which--for G = SLn( $${\cal C}$$ )--was proved previously in the paper [5].
Supporting Bulk Synchronous Parallelism with a high-bandwidth optical interconnect: Research Articles
Authors: I. Gourlay, P. M. Dew, K. Djemame, J. F. Snowdon, G. Russell
Venue: Concurrency and Computation: Practice Experience (2004)

The list of applications requiring high-performance computing resources is constantly growing. The cost of inter-processor communication is critical in determining the performance of massively parallel computing systems for many of these applications. This paper considers the feasibility of a commodity processor-based system which uses a free-space optical interconnect. A novel architecture, based on this technology, is presented. Analytical and simulation results based on an implementation of BSP (Bulk Synchronous Parallelism) are presented, indicating that a significant performance enhancement, over architectures using conventional interconnect technology, is possible. Copyright &copy; 2004 John Wiley & Sons, Ltd.
External-memory depth-first search algorithm for solid grid graphs
Authors: Jun-Ho Her, R. S. Ramakrishna
Venue: Information Processing Letters (2005)

In this paper, we propose an external memory depth first search algorithm for solid grid graphs, a subclass of grid graphs. The I/O-complexity of the algorithm is O(sort(N)), where N = |V| + |E|, sort(N) = Θ(N/B logM/B N/B) is the sorting I/O-complexity, M is the memory size, and B is the block size. Since grid graphs might be nonplanar (if diagonal edges intersect), they are beyond the reach of existing planar depth first search algorithms. The best known algorithm for this class of graph is the standard (internal memory) DFS algorithm with appropriate block (sub-grid) I/O-access. Its I/O-complexity is O(N/√B).
requirements uncertainty: influencing factors and concrete improvements
Authors: Christof Ebert, Jozef De Man
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Practically all industry studies on software project results conclude that good requirements engineering plays a pivotal role for successful projects. A key reason for project failures is insufficient management of changing requirements during all stages of the project life cycle. This article investigates one of the root causes for changing requirements, namely requirements uncertainty. In an experimental field study we looked into four underlying drivers for requirements uncertainty. We found several techniques must be used simultaneously to see tangible success. Using only one such technique in isolation doesn't make a difference. The field study is supported by extensive data from well over 200 projects stemming from very different business areas of Alcatel over a period of two years. Results are presented with practical experiences to allow effective transfer.
An integrated approach to acoustic noise and echo cancellation
Authors: Geert Rombouts, Marc Moonen
Venue: Signal Processing (2005)

We describe an approach to speech signal enhancement where acoustic echo cancellation and noise reduction, which are traditionally handled separately, are combined in one integrated scheme. The optimization problem defined by this scheme is solved adaptively using a QRD-based least squares lattice (QRD-LSL) algorithm. We show that the performance of the integrated scheme is superior to the performance of traditional (cascading) schemes, while complexity is kept at an affordable level.
Current awareness on comparative and functional genomics: Current Awareness - Isaac Newton Institute, centre for mathematical sciences, Cambridge University, UK, 26&ndash;30 April 2004
Authors: Staff
Venue: Comparative and Functional Genomics (2004)

In order to keep subscribers up-to-date with the latest developments in their field, this current awareness service is provided by John Wiley & Sons and contains newly-published material on comparative and functional genomics. Each bibliography is divided into 16 sections. 1 Reviews & symposia; 2 General; 3 Large-scale sequencing and mapping; 4 Genome evolution; 5 Comparative genomics; 6 Gene families and regulons; 7 Pharmacogenomics; 8 Large-scale mutagenesis programmes; 9 Functional complementation; 10 Transcriptomics; 11 Proteomics; 12 Protein structural genomics; 13 Metabolomics; 14 Genomic approaches to development; 15 Technological advances; 16 Bioinformatics. Within each section, articles are listed in alphabetical order with respect to author. If, in the preceding period, no publications are located relevant to any one of these headings, that section will be omitted. 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