ppxscal/embedding_network huggingface dataset:
Towards a Theoretical Framework of Determinants for the Adoption and Diffusion of Buyer Authenticated Credit Card Payment Programs: The Online Merchant's Perspective
Authors: Mustafa A. Ally, Mark Toleman
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

This study employs Rogersý framework of perceived innovation attributes augmented by environmental influences and marketing initiatives and a new factor developed for this study, namely, risk mitigation measures, to examine the case of merchant adoption of buyer authenticated credit card payment programs (BACCPPs). Recently introduced by the major credit card associations as replacements for the decommissioned SET and 3DSET protocols, the new payment models, 3DSecure and UCAF/SPA, have been designed to provide an added level of security for merchants and consumers. Using data gleaned from preliminary interviews, discussion forums and promotional material, we present a critical analysis of the potential barriers and facilitators that will impact on the widespread diffusion of these programs. This is used as the basis for developing a preliminary theoretical framework of the potential determinants of adoption of BACCPP from the perspective of online merchants, as well as a survey instrument to demonstrate the empirical validity of our theoretical formulation.
Hardware Scheduling for Dynamic Adaptability using External Profiling and Hardware Threading
Authors: Brian Swahn, Soha Hassoun
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

While performance, area, and power constraints have been thedriving force in designing current communication-enabled embeddedsystems, post-fabrication and run-time adaptability is now required.Two dominant configurable hardware platforms are processorsand FPGAs. However, for compute-intensive applications,neither platform delivers the needed performance at the desiredlow power. The need thus arises for custom, application-specificconfigurable (ASC) hardware.This paper addresses the optimization of ASC hardware. Ourtarget application areas are multimedia and communication wherean incoming packet (task) is processed independently of otherpackets. We innovatively utilize two concepts: external profilingand hardware threading. We utilize an M/M/c queueing model toprofile task arrival patterns and show how profiling guides designdecisions. We introduce the novel concept of hardware threadingwhich allows on-the-fly borrowing of unutilized hardware, thusmaximizing task-level parallelism, to either boost performance orto lower power consumption. We present a scheduling algorithmthat synthesizes a hardware-threaded architecture, and discuss experimentalresults that illustrate adaptability to different workloads,and performance/power trade-offs.
Can eCRM and Trust Improve eC Customer Base?
Authors: Charles A. Shoniregun, Adebola Omoegun, Diepriye Brown-West, Oleksandr Logvynovskiy
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

E-commerce (eC) security depends on a complex interrelationship between several components. Securing consumer trust is a key factor in reducing complexity and the management of eC risk. By taking a methodical approach to searching for vulnerabilities on a target system all potential intruder needs to do is to systematically attempt to exploits available vulnerabilities in turn until a weakness that can be exploited is discovered. The current information and communication technologies enable businesses to foster customer relations in a better and more efficient way. Electronic customer relationship management (eCRM) as an extension of the traditional customer relationship management (CRM) provides suitable methods and instruments. This paper discusses how to be effective in managing customer relationship and advocated trust-based approach to viewing eCRM. We also conducted questionnaire survey ¿ to show the organisational value of eCRM and Trust in eC within multinational organisation. Furthermore, we proposed an eC Trust model, which incorporates People Trust, Technology Trust and Law and Policy Trust. The question posed by this paper is that: how can organisations improve their eCRM while also securing higher level of consumer trust on eC?
Quantum Communication Complexity: A Survey
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

This is a survey talk on the topic of Quantum CommunicationComplexity. A full survey paper by the author isavailable in Foundations of Physics.
Measuring adversaries
Authors: Vern Paxson
Venue: ACM SIGMETRICS Performance Evaluation Review (2004)

Many concepts and techniques developed for general Internet measurement have counterparts in the domain of detecting and analyzing network attacks. The task is greatly complicated, however, by the fact that the object of study is adversarial: attackers do not wish to be "measured" and will take steps to thwart observation. We look at the far-ranging consequences of this different measurement environment: the analysis difficulties-some fundamental-that arise due to subtle ambiguities in the true semantics of observed traffic; new notions of "active measurement"; the highly challenging task of rapidly characterizing Internet-scale pheonmena such as global worm pandemics; the need for detailed application-level analysis and related policy and legal difficulties; attacks that target passive analysis tools; and the inherent "arms race" nature of the undertaking.
Formal Analysis of Multi-Party Contract Signing
Authors: Rohit Chadha, Steve Kremer, Andre Scedrov
Venue: Proceedings of the 17th IEEE workshop on Computer Security Foundations (2004)

We analyze the multi-party contract-signing protocolsof Garay and MacKenzie (GM) and of Baum and Waidner(BW). We use a finite-state tool, MOCHA, which allowsspecification of protocol properties in a branching-timetemporal logic with game semantics. While our analysisdoes not reveal any errors in the BW protocol, in the GMprotocol we discover serious problems with fairness for foursigners and an oversight regarding abuse-freeness for threesigners. We propose a complete revision of the GM subprotocolsin order to restore fairness.
Integrating Real-time Analysis in a Component Model for Embedded Systems
Authors: Manuel Diaz, Daniel Garrido, Luis M. Llopis, Francisco Rus, Jose M. Troya
Venue: Proceedings of the 30th EUROMICRO Conference (2004)

Component-based development is a key technology in the development of software for modern embedded systems. However, standard component models and tools are not suitable for this type of systems, since they do not explicitly address real-time, memory or cost constraints. This paper presents a new predictable component model for embedded systems together with a set of tools to support it. The environment allows for the development of new components that can be assembled to build complete embedded applications, including hardware interaction. The main contribution of the environment is its support for real-time analysis at the component and application level. The analysis is achieved by combining component meta-information in the form of an abstract behaviour model and a method to measure worst-case execution times in the final platform.
Netmailmanhandled
Authors: Brain Reid
Venue: ACM SIGSOFT Software Engineering Notes (1982)

[This is a transcript of a computer-mail message sent by Brian Reid of Stanford to various interested parties about an annoying problem with ARPAnet mail. The nature of the problem was that whenever mail was sent to certain people, the other recipients of that message would keep getting copies of the message, at intervals, until some system programmer manually intervened. Brain's message was originally sent to various people who had complained about the mail looping, and to other interested parties. PGN] 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
Chairs' Message
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

mess-gen
Directed explicit-state model checking in the validation of communication protocols
Authors: Stefan Edelkamp, Stefan Leue, Alberto Lluch-Lafuente
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2004)

The success of model checking is largely based on its ability to efficiently locate errors in software designs. If an error is found, a model checker produces a trail that shows how the error state can be reached, which greatly facilitates debugging. However, while current model checkers find error states efficiently, the counterexamples are often unnecessarily lengthy, which hampers error explanation. This is due to the use of &#x201c;naive&#x201d; search algorithms in the state space exploration.In this paper we present approaches to the use of heuristic search algorithms in explicit-state model checking. We present the class of A* directed search algorithms and propose heuristics together with bitstate compression techniques for the search of safety property violations. We achieve great reductions in the length of the error trails, and in some instances render problems analyzable by exploring a much smaller number of states than standard depth-first search. We then suggest an improvement of the nested depth-first search algorithm and show how it can be used together with A* to improve the search for liveness property violations. Our approach to directed explicit-state model checking has been implemented in a tool set called HSF-SPIN. We provide experimental results from the protocol validation domain using HSF-SPIN.
Partially Reconfigurable Matrix Multiplication for Area and Time Efficiency on FPGAs
Authors: Luo Jianwen, Jong Ching Chuen
Venue: Proceedings of the Digital System Design, EUROMICRO Systems (2004)

This paper presents a novel architecture for matrix multiplication implemented on reconfigurable hardware with partially reconfigurable feature. The proposed design significantly reduces the size and achieves the minimum computation cycles for the n × n matrix multiplication. Compared with the linear array design [Area and Time Efficient Implementationof Matrix Multiplication on FPGAs], the area of our design is reduced by 72% - 81% while the AT metrics (product of area and latency) is reduced by 40% - 58% for matrix size between 3 × 3 and 48 × 48. The versatility of our design is demonstrated in different parameterisable instantiation to cater for different implementations with various time and area requirements. Partially reconfiguration allows us to reload the design contents with the minimum configuration overhead. The performance of our design is even better for larger matrices.
Transitive Edge Coloring of Graphs and Dimension of Lattices
Authors: András Gyárfás
Venue: Combinatorica (2002)

We explore properties of edge colorings of graphs de&#xfb01;ned by set intersections. An edge coloring of a graph G with vertex set V ={1,2, . . . , n} is called transitive if one can associate sets F 1,F 2, . . .,F n to vertices of G so that for any two edges ij,kl &#x2208; E(G), the color of ij and kl is the same if and only if F i &#x2229; F j = F k &#x2229; F l . The term transitive refers to a natural partial order on the color set of these colorings.We prove a canonical Ramsey type result for transitive colorings of complete graphs which is equivalent to a stronger form of a conjecture of A. Sali on hypergraphs. This&#x2014;through the reduction of Sali&#x2014;shows that the dimension of n-element lattices is o(n) as conjectured by F&#x00fc;redi and Kahn.The proof relies on concepts and results which seem to have independent interest. One of them is a generalization of the induced matching lemma of Ruzsa and Szemer&#x00e9;di for transitive colorings.
Toward Intelligent Agents on Quantum Computers
Authors: Matthias Klusch
Venue: Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3 (2004)

We present an innovative perspective of usage of intelligent agents and multi-agent systems in quantum computing, and summarize preliminary results of our initial research in this direction.
Triangulations of polytopes and algebraic geometry
Authors: Francisco Santos
Venue: Proceedings of the 2004 international symposium on Symbolic and algebraic computation (2004)

The interaction between polyhedral combinatorics and algebraic geometry is a classical theme. Two examples from the 70's, in which each discipline has benefited from the other, are the Bernstein-Kouchnirenko-Khovanski Theorem on the number of roots of a generic sparse system via mixed volumes and the algebraic proofs by Stanley of the Upper Bound Theorem for simplicial spheres and the g-theorem for simplicial polytopes.
A Business Model for B2B Integration through Web Services
Authors: Youcef Baghdadi
Venue: Proceedings of the IEEE International Conference on E-Commerce Technology (2004)

Sharing Web services to support B2B integration becomes intensive and critical. The paper proposes a business model with multiple interfaced abstraction levels as a framework to generate data-centric Web services. A time/space constraint called factual dependency is used to aggregate attributes describing the business objects and coordination artifacts as described in the highest abstraction level of a business model i.e. the universe of discourse. Each aggregation leads to a well-specified granular Web service. The resulting set of consistent Web services are then registered in a public or a private UDDI to be discovered and invoked by any business process. The proposed generation process differs from the current IT-perspective approaches that generate Web services directly from the redundant and duplicated elements in the information system.
Analyzing Information Flow Control Policies in Requirements Engineering
Venue: Proceedings of the Fifth IEEE International Workshop on Policies for Distributed Systems and Networks (2004)

Currently security features are implemented andvalidated during the last phases of the softwaredevelopment life cycle. This practice results in lesssecure software systems and higher cost of fixingdefects software vulnerability. To achieve more securesystems, security features must be considered duringthe early phases of the software development process.This paper presents a high-level methodology thatanalyzes the information flow requirements andensures the proper enforcement of information flowcontrol policies. The methodology uses requirementsspecified in the Unified Modeling Language (UML) asits input and stratified logic programming language asthe analysis language. The methodology improvessecurity by detecting unsafe information flows beforeproceeding to latter stages of the life cycle.
Efficient Interval Indexing for Content-Based Subscription E-Commerce and E-Service
Authors: Kun-Lung Wu, Shyh-Kwei Chen, Philip S. Yu, Mark Mei
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

This paper presents a dynamic interval index for fast event matching against a large number of predicate intervals specified by content-based subscriptions. A set of virtual construct intervals (VCIs) is predefined, each with a unique ID and an associated ID list. Each predicate interval is decomposed into one or more VCIs, which become activated by the predicate. The predicate ID is then inserted into the ID lists associated with the decomposed VCIs. To facilitate fast search, we start with a bitmap vector to indicate the activation of VCIs that cover an attribute value. Then, we study various techniques to reduce the storage cost, including logarithmic construct intervals (LCI) which reduce the total number of VCIs, bitmap clipping which prunes certain positions of a bitmap vector, and bitmap virtualization which eliminates the bitmap. Simulations are conducted to evaluate and compare these techniques.
Process research of high aspect ratio microstructure using SU-8 resist
Authors: J. Liu, B. Cai, J. Zhu, G. Ding, X. Zhao, C. Yang, D. Chen
Venue: Microsystem Technologies (2004)

SU-8 is a negative, epoxy type, near-UV photoresist. This resist has been specifically developed for ultrathick, high-aspect-ratio MEMS-type applications using standard lithography equipment. However, in practice, SU-8 has shown to be very sensitive to process parameter variation. The orthogonal array was used in our experiments in order to improve the lithography quality and analyze the interaction among the parameters. The analyses show that the interaction between the exposure dose and post exposure bake has played an important role in adhesion between SU-8 resist and the substrate. The proposed process conditions are given. The output structure has straight sidewall profile, fine line and good space resolution. The aspect ratio is larger than 20. Moreover, several metallic films are used as substrates. The Ti film with oxidation treatment was found to have the strongest adhesion to the resist. The result will help to open possibilities for low-cost LIGA-type process for MEMS applications.
The Bargmann analytic representation in signal analysis
Authors: L. K. Stergioulas, A. Vourdas
Venue: Journal of Computational and Applied Mathematics (2004)

The Bargmann analytic representation of quantum mechanics is used in the context of time-frequency signal analysis. Transformations between the various representations are derived. Examples that show how this method can be implemented numerically and demonstrate its robustness to noise are discussed.
Program animation in jeliot 3
Authors: Andrés Moreno, Niko Myller, Mordechai Ben-Ari, Erkki Sutinen
Venue: Proceedings of the 9th annual SIGCSE conference on Innovation and technology in computer science education (2004)

Jeliot is a family of program animation systems [1]. It has been successfully used to improve the teaching of intro- ductory programming by supplying a concrete language in which to explain programming structures and concepts [2]. Jeliot 3 [4] retains the novice-oriented GUI and animation display of the previous version, Jeliot 2000. Both versions automatically visualize the execution of user-written Java programs.Jeliot 3 introduces a new kind of design in order to make the system extendable and to add new features [5]. The front-end of system has been replaced by the DynamicJava interpreter, which was instrumented to produce an intermediate code, MCode, describing the program's runtime trace. The MCode trace is then rendered by the graphics back-end. The previous version of Jeliot animated variables, expressions, I/O and static method calls. Jeliot 3 is also capable of animating concepts for object-oriented programming: objects, class inheritance, constructors, method calls, instance fields, and reference semantics of arrays and objects. Jeliot 3 is intended to be a simple tool to be used in different kinds of learning scenarios [3]. It can be used to show and teach the basics of programming during a lecture. The lecturer can explain different concepts and show their corresponding animations with Jeliot. Students may use Jeliot 3 by themselves after the lectures to complete and understand the follow-up assignments related to the concepts learned at the lectures. Jeliot 3 can be used as a tool in interactive laboratory sessions. The visual display of the program can be used to facilitate communications about the errors. It can also support virtual courses, as where Jeliot 3 provides a tool that can assist students when external help is not available. Jeliot 3 is available under the GPL for downloading at http://www.cs.joensuu.fi/jeliot/. We intend to form a community around Jeliot 3, where teachers, students and developers could propose ideas and solutions in order to im- prove Jeliot 3 and the teaching of programming. The forum is available on the website and open for anyone interested. There are also plans for further development, for example, a new tool called JeCo (Jeliot Collaborative) [3] aims to integrate Jeliot 3 into a co-authoring environment where students can develop and visualize their programs together.
hMiDas and hMitChip: New Opportunities in Mitochondrial Bioinformatics and Genomic Medicine
Authors: Salvatore Alesci, Yan A. Su, George P. Chrousos
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

We developed a human mitochondria-focused gene database (hMiDas) and customizedcDNA microarray chip (hMitChip) to help biomedical research in mitochondrial genomics.The current version of hMiDas contains 1,242 gene entries (including mtDNA genes, nucleargenes related to mitochondria structure and functions, predicted loci and experimental genes),organized in 15 categories and 24 subcategories. The database interface allows keyword-based searches as well as advanced field and/or case-sensitive searches. Each gene record includes 19 fields, mostly hyperlinked to the corresponding source. Moreover, for each gene, the user is given the option to run literature search using PubMed, and gene/protein homology search using BLAST and FASTA. The hMitChip was constructed using hMiDas as a reference. Currently, it contains a selection of 501 mitochondria-related nuclear genes and 192 control elements, all spotted in duplicate on glass slides. Slide quality was checked by microarray hybridization with 50 µg of Cy3-labeled sample cDNA and Cy5-labeled comparing cDNA, followed by array scan and image analysis. The hMitChip was tested in vitro using RNA extracted from cancer cell lines. Gene expression changes detected by hMitChip were confirmed by quantitative real-time RT-PCR analysis.
Fractal Genomics Modeling: A New Approach to Genomic Analysis and Biomarker Discovery
Authors: Sandy Shaw, Paul Shapshak
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

Reverse engineering of genetic networks generally requires establishing correlative behavior within and between a very large number of genes. This becomes a difficult analytical problem for even a few hundred genes and the difficulty tends to grow exponentially as more genes are examined. Using a hybrid data analysis method known as Fractal Genomics Modeling (FGM), this problem is reduced to examining correlative behavior within small gene groups that can then be compared and integrated to produce a picture of larger networks using a type of shotgun approach. We have applied FGM toward examining genetic networks involved in HIV infection in the brain. These networks have relevance both to processes related to HIV infection and neurodegenerative disorders. Our preliminary findings have produced conjectures of related pathways and networks as well new candidates for genetic markers in HIV brain infection. Evidence has also been produced which appears to show the presence of a hierarchical network structure within the genes studied. We will discuss the background and methodology of FGM as well as our recent findings.