ppxscal/embedding_network huggingface dataset:
Understanding Changes in Consumer Payment Habits - Do Mobile Payments and Electronic Invoices Attract Consumers?
Authors: Tomi Dahlberg, Anssi Oorni
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Mobile payment services have, thus far, failed to entice consumers. An apparent conclusion is that these services have failed to meet consumers' payment needs. Deeper understanding of consumer adoption motivations is thus needed to be able to develop and launch mobile payment services successfully. Our paper seeks to find out if the generic technology adoption models are sufficient to explain factors consumers consider when they decide whether or not to adopt new payment services. In particular, we develop two models in the payment context. One of them models the determinants of the mobile payments services adoption while the other models the determinants of electronic invoicing adoption. Comparison of the model structures suggests that perceived ease of use seems to be the least common denominator for consumer adoption of these information technology based services while the context of technology adoption determines both the non-differentiating and the differentiating determinants of technology adoption.
On the Packet-Switched Implementation of a Discrete-Time CNN
Authors: Suleyman Malki, Lambert Spaanenburg
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

Cellular Neural Networks are widely used with real-time image processing's applications. Such systems can be efficiently realized using macro enriched field-programmable gate-arrays. This paper explores the benefits of packet switching and discusses itsadvantages over a current design based on circuit switching. The implementation is performed using Xilinx Virtex-II Pro P30 and handles around 500 Mpixels per second using 128 parallel processing nodes.
Analytical Bound for Unwanted Clock Skew due to Wire Width Variation
Authors: Anand Rajaram, Bing Lu, Wei Guo, Rabi Mahapatra, Jiang Hu
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Under modern VLSI technology, process variations greatly affectcircuit performance, especially clock skew which is very timingsensitive. Unwanted skew due to process variation forms a bottleneckpreventing further improvement on clock frequency. Impactfrom intra-chip interconnect variation is becoming remarkable andis difficult to be modeled efficiently due to its distributive nature.Through wire shaping analysis, we establish an analytical boundfor the unwanted skew due to wire width variation which is thedominating factor among interconnect variations. Experimental resultson benchmark circuits show that this bound is safer, tighterand computationally faster than similar existing approach.
A Complete Methodology for Memory Optimization in DSP Applications
Authors: F. Marteil, N. Julien, E. Senn, E. Martin
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

In the Digital and Signal Processing (DSP) applications, the main issue in system performance is strongly related to the memory sub-system characteristics and data positions.In such applications, exhaustive data analysis is often highly complex and time consuming whereas the actual bottlenecks are essentially due to the few largest data objects (arrays).Therefore, to ensure a good trade-off between analysis time and efficiency, we focus the optimization on these objects also called 'structures'.Our approach relies on a new graph formalism called 'Data Control Flow Graph' which analyzes an algorithm (written in C), and brings out data structure dependencies while retaining execution order constraints.Manipulating this graph allows to determine an optimized memory mapping according to a fixed memory hierarchy and thus to reduce bus activity, resulting in improved both execution time and energy consumption.This method is also planned to be extended to memory optimization by sizing both the memory hierarchy and the architecture.
Bounded-concurrent secure multi-party computation with a dishonest majority
Authors: Rafael Pass
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

We show how to securely realize any multi-party functionality in a way that preserves security under an a-priori bounded number of concurrent executions, regardless of the number of corrupted parties. Previous protocols for the above task either rely on set-up assumptions such as a Common Reference String, or require an honest majority. Our constructions are in the plain model and rely on standard intractability assumptions (enhanced trapdoor permutations and collision resistant hash functions). Even though our main focus is on feasibility of concurrent multi-party computation we actually obtain a protocol using only a constant number of communication rounds. As a consequence our protocol yields the first construction of constant-round phstand-alone secure multi-party computation with a dishonest majority, proven secure under standard (polynomial-time) hardness assumptions; previous solutions to this task either require logarithmic round-complexity, or subexponential hardness assumptions. The core of our protocol is a novel construction of (concurrently) simulation-sound zero-knowledge protocols, which might be of independent interest. Finally, we extend the framework constructed to give a protocol for secure multi-party (and thus two-party) computation for any number of corrupted parties, which remains secure even when arbitrary subsets of parties concurrently execute the protocol, possibly with interchangeable roles. As far as we know, for the case of two-party or multi-party protocols with a dishonest majority, this is the first positive result for any non-trivial functionality which achieves this property in the plain model.
Surface Quality Assessment of Subdivision Surfaces on Programmable Graphics Hardware
Venue: Proceedings of the Shape Modeling International 2004 (2004)

In this paper, we propose a method of subdivisionsurface quality assessment by reflection lines on programmablegraphics hardware (GPU). Using reflectionlines is effective for surface quality assessment becausethe shapes of these lines are changed according to a slightvariance of surface shapes. This fact also implies thatreflection lines should be calculated precisely. We introducean intuitive, fast and robust approach for calculating reflectionlines by using a plane light source texture based on afragment program of recently introduced GPU. In addition,we describe a method of calculating position and normalof subdivision surfaces for each fragment on GPU. As ourframework for calculating reflection lines does not dependon the level of subdivision, a precise assessment can beestablished even for low levels of subdivision polygons.
Using the web for automated translation extraction in cross-language information retrieval
Authors: Ying Zhang, Phil Vines
Venue: Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval (2004)

There have been significant advances in Cross-Language Information Retrieval (CLIR) in recent years. One of the major remaining reasons that CLIR does not perform as well as monolingual retrieval is the presence of out of vocabulary (OOV) terms. Previous work has either relied on manual intervention or has only been partially successful in solving this problem. We use a method that extends earlier work in this area by augmenting this with statistical analysis, and corpus-based translation disambiguation to dynamically discover translations of OOV terms. The method can be applied to both Chinese-English and English-Chinese CLIR, correctly extracting translations of OOV terms from the Web automatically, and thus is a significant improvement on earlier work.
Installable Unit Deployment Descriptor for Autonomic Solution Management
Authors: Christine Draper, Randy George, Marcello Vitaletti
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Today's enterprise solutions consist of multiple components whose deployment must be coordinated across multiple, heterogeneous hosting environments, including operating systems, application servers, databases and other middleware. The requirements of software components on their hosting environments and their interdependencies must be fully specified in order to enable an autonomic management of solutions during their life cycle. The Installable Unit Deployment Descriptor illustrated in this paper supports a fully declarative specification of a solution and provides a foundation for autonomic deployment services, as well as for the exchange of solution data across different tools and management applications.
Computer proofs for polynomial identities in arbitrary many variables
Authors: Manuel Kauers
Venue: Proceedings of the 2004 international symposium on Symbolic and algebraic computation (2004)

We present an algorithm for proving certain families of nomial identities in which the number of variables appears as a parameter.Typically,indefinite sums and products (possibly nested)are used for defining such polynomial ties, but in principle the definition of the problem may be given in terms of arbitrary polynomial recurrences (possibly nonlinear). An implementation of our algorithm in Mat e-matica was able to verify identities appearing in textbooks, which, to our knowledge,were previously not accessible by any symbolic method. A collection of examples is included in the paper.
Multipath-Based Multicasting Strategies for Wormhole-Routed Star Graph Interconnection Networks
Authors: Neng-Chung Wang, Chih-Ping Chu, Tzung-Shi Chen
Venue: The Journal of Supercomputing (2004)

The star graph interconnection network has been recognized as an attractive alternative to the popular hypercube network. In this paper, we present a multipath-based multicast routing model for wormholerouted star graph networks, propose two efficient multipath routing schemes, and contrast the performance of the proposed schemes with the performance of the scheme presented in our previous work. Both of the two proposed schemes have been proven to be deadlock-free. The first scheme, simple multipath routing, uses multiple independent paths for concurrent multicasting. The second scheme, two-phase multipath routing, includes two phases: source-to-relay and relay-to-destination. For each phase, multicasting is carried out using simple multipath routing. Experimental results show that, for short and medium messages with small message startup latencies, the proposed schemes reduce multicast latency more efficiently than other schemes.
More on three-machine no-idle flow shops
Authors: Jerzy Kamburowski
Venue: Computers and Industrial Engineering (2004)

Recently in this journal Saadani, Guinet, and Moalla [Comput Ind Engng 44 (2003) 425] considered the NP-hard problem of minimizing the makespan in a three-machine no-idle flow shop. We identify a simple network representation of the makespan that provides a better insight into the problem, reveals a certain anomaly resulting from the no-idle condition, and leads to some dominance relations among the machines under which the problem becomes efficiently solvable. Extensions to m-machine no-idle flow shops are also included.
A Secure M+1st Price Auction Scheme Based on RSAP
Authors: Xiao Qinghua, Ping Lingdi, Pan Xuezeng
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

The Internet is a prime vehicle for supporting electronic auction, a primitive pricing mechanism for setting price. But up to now, the study of efficient and secure M+1^st price auction is still very weak. Aiming at this drawback, this paper presented a new solution for M+1^st price auction in the case of protecting bidders. Employing the method of binary search, this scheme resolves the winners and the winning price synchronously and rapidly. If necessary, all auctioneers can collaborate with each other to open the winnersý bidding prices without leaking any privacy of losers. Comparison in terms of communication cost between our proposed scheme and others was given at the end of the paper. The result shows that our solution will consume less bandwidth in communication.
A Mechanism for Implementing Precise Exceptions in Pipelined Processors
Authors: Soyeb Alli, Chris Bailey
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

An exception is precise if all instructions before the faulting instruction have completed and those instructions following it can be restarted from scratch. If all exceptions in a processor are precise, the processor is said to implement the precise exception model. In a pipelined processor, precise exceptions can be difficult to achieve because an instruction may complete before its predecessors have completed. There exist several techniques for implementing precise exceptions, each varying in terms of performance and hardware cost. This paper introduces a novel solution to the precise exception problem and evaluates its predicted performance with respect to other schemes.
Genetic algorithm optimization and blending of composite laminates by locally reducing laminate thickness
Authors: David B. Adams, Layne T. Watson, Zafer Gürdal, Christine M. Anderson-Cook
Venue: Advances in Engineering Software (2004)

Composite panel structure optimization is commonly decomposed into panel optimization subproblems, with specified local loads, resulting in manufacturing incompatibilities between adjacent panel designs. A new method proposed here for constructing globally blended panel designs uses a parallel decomposition antithetical to that of earlier work. Rather than performing concurrent panel genetic optimizations, a single genetic optimization is conducted for the entire structure with the parallelism solely within the fitness evaluations. A genetic algorithm approach, based on locally reducing a thick (guide) laminate, is introduced to exclusively generate and evaluate valid globally blended designs, utilizing a simple master-slave parallel implementation, implicitly reducing the size of the problem design space and increasing the quality of discovered local optima.
Parameterization-free active contour models with topology control
Authors: Stephan Bischoff, Leif P. Kobbelt
Venue: The Visual Computer: International Journal of Computer Graphics (2004)

We present a novel approach for representing and evolving deformable active contours by restricting the movement of the contour vertices to the grid lines of a uniform lattice. This restriction implicitly controls the (re)parameterization of the contour and hence makes it possible to employ parameterization-independent evolution rules. Moreover, the underlying uniform grid makes self-collision detection very efficient. Our contour model is also able to perform topology changes, but &#x2013; more importantly &#x2013; it can detect and handle self-collisions at subpixel precision. In applications where topology changes are not appropriate, we generate contours that touch themselves without any gaps or self-intersections.
Middleware Support for the Deployment of Resource-Aware Parallel Java Components on Heterogeneous Distributed Platforms
Authors: Yves Maheo, Frederic Guidec, Luc Courtrai
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

This paper reports the development of the Concerto platform, which is dedicated to supporting the deployment of resource-aware parallel Java components on heterogeneous distributed platforms, such as pools of workstations in labs or offices. Our work aims at proposing a basic model of a parallel Java component, together with mechanisms and tools for managing the deployment of such a component on a distributed platform. Moreover, we strive to provide components with means to perceive their runtime environment, so they can for example dynamically adapt themselves to changes occurring in this environment. The Concerto platform was designed in order to allow the deployment of parallel components on a distributed platform. It additionally defines and implements an open and extensible framework for distributed resource discovery and monitoring in such an execution environment.
Exploring the Use of Stem-Loop Characteristics for Pinpointing Structural RNA Genes
Authors: Kirt Noel, Kay C. Wiese
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

Our goal is to determine whether a stem-loop metric or combination of stem-loop metrics can be used to identify structural RNAs along genomic sequences across the entire GC content spectrum. Herein we describe the first step towards this goal by comparing selected stem-loop metric valuations between structural RNAs and their genomic counterparts.
Worm and Attack Early Warning
Authors: Salvatore J. Stolfo
Venue: IEEE Security and Privacy (2004)

The author describes the Worminator project (http://worminator.cs.columbia.edu), acollaboration of academic institutions pursuing R&D of intelligent predictive and proactivetechnologies that detect, report, and defend against early preattack cyberevents--specificallynetwork observables--that are precursors to malicious activities during a later attack stage.
Application of Virtual Reality in Ecological Farmland Navigating System
Authors: Chia-Chen Kuo, Yi-Haur Shiau, Chen-Pey Huang, Cherng-Yeu Shen, Whey-Fone Tsai
Venue: Proceedings of the High Performance Computing and Grid in Asia Pacific Region, Seventh International Conference (2004)

Scientific visualization is a powerful and popular technique and is very useful in many areas of science and engineering. It mainly uses computer graphics to view or explore three-dimensional (3-D) objects, natural phenomenon, or numerical data. Virtual Reality (VR) is an application of scientific visualization and is getting popular for applications associated with high-performance computing. To help Council of Agriculture, Taiwan (COA), promote the importance of farmland conservation, and to help elementary education authorities on basic agricultural, ecological education, in this study, a 3-D virtual environment is developed to demonstrate the virtual farmland theme and associated temporal and spatial data and information. The system features (1) construction and visualization of the virtual farmland environment, (2) speedup and animation of the embedded objects, (3) multimedia effects, (4) display of the numerical analysis results of crops growing affected by nitrogen in land simulated by 2DSOIL model, sand (5) display of the numerical analysis results of groundwater flow and nitrogen transport in the farmland simulated by GMS-FEMWATER. Several computer graphics accelerating schemes, such as space partition, view frustum culling (VFC), billboard, and collision detection, were used to speedup the rendering. Users can immerse, navigate and interact with objects in the 3-D virtual farmland ecology environment.
Using GIS to Profile Health-Care Costs of VA Quality-Enhancement Research Initiative Diseases
Authors: Wei Yu, Diane Cowper, Magdalena Berger, Mark Kuebeler, Joe Kubal, Larry Manheim
Venue: Journal of Medical Systems (2004)

The Health Services Research and Development (HSR D) Service at the Department of Veterans Affairs (VA) Health Care System launched a Quality Enhancement Research Initiative (QUERI) in 1998. This study estimated health-care costs of nine diseases under the QUERI project and analyzed geographic differences in health-care costs and utilization across 22 VA Integrated Service Networks (VISNs), using a geographic information system (GIS). Patients with these diseases were identified from diagnoses recorded between October 1999 and September 2000. Annual health-care costs for each disease were estimated in four categories: inpatient medical or surgical, other inpatient, outpatient, and outpatient pharmacy. Geographic differences of costs and health-care utilization across the 22 VISNs for chronic heart failure, diabetes, and spinal-cord injury were mapped using a GIS package. Average costs and patterns of health-care utilization varied substantially across the 22 VISNs. The observed differences in health-care utilization across geographic regions raised questions for further investigation.
Directional Neighbourhood Calculations in Spatial Partition Trees
Authors: Jose Poveda, Michael Gould
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

We present an extension of the multidimensional binary indexing algorithm for neighbourhood calculations in spatial partition trees [Multidimensional Binary Indexing for Neighbourhood Calculations in Spatial Partition Trees]. The algorithm in the earlier paper provided a matrix characterization to support calculus of neighbours in a spatial partition tree representation. That calculus was implicitly defined only for face-to-face neighbours. The extension presented here considers any possible direction in which a neighbour sub-interval of a quadtree partition can be found, and not only along the coordinate axis. The paper starts from basic topological considerations in two dimensional space to finally generalize the result obtained for any arbitrary dimension. Finally, we present an explicit calculus of all neighbour location vectors of a given sub-interval as well as a graphic example in a three-dimensional space.
A stochastic set-covering location model for both ameliorating and deteriorating items
Authors: Heung-Suk Hwang
Venue: Computers and Industrial Engineering (2004)

Most of the previous works on classical location models are based on the assumption that the value (or utility) of inventory remains constant over time. In this study, a special case of the stochastic set-covering location problem is studied for both ameliorating and deteriorating items. The objective of this study is to determine the minimum number of storage facilities among a discrete set of location sites so that the probability of each customer being covered is not less than a critical value. We have formulated this problem using the stochastic set-covering problem, which can be solved via the 0-1 programming method. We have also developed a computer program for this problem and the results of a set of sample problems for fish culture storage and supply center will show the impact of the ameliorating and deteriorating rates on the location problem. For further study, a graphical user-interface with visualization for input and output needs is to be developed.