ppxscal/embedding_network huggingface dataset:
Towards a Trust Model with Uncertainty for e-Commerce Systems
Authors: Guangwei Zhang, Jianchu Kang, Rui He
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

Lack of trust has often been considered as a crucial barrier to the adoption of electronic commerce. To address this problem, a trust model is proposed in this paper. Since uncertainty is the nature of trust, it is necessary for us to take uncertainty into account during modeling trust. Distinguished from other trust models, a novel approach is employed to describe uncertainty in the proposed trust model, namely the cloud-model. Since the cloud-model is quite new and still in the progress of development, it can not be applied into modeling trust directly, hence we have to extend it firstly. Then we present an extended-cloudmodel- based trust model (abbreviated as ECM-based trust model or ECMBTM). To prove the advantage of the proposed trust model, simulation experiments are carried out, and the ECMBTM is compared quantificationally with three typical trust models. Furthermore, we develop a trust evaluation system based on the ECMBTM and are applying it in a real B2B system.
Blocking Anonymity Threats Raised by Frequent Itemset Mining
Authors: Maurizio Atzori, Francesco Bonchi, Fosca Giannotti, Dino Pedreschi
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

In this paper we study when the disclosure of datamining results represents, per se, a threat to the anonymity of the individuals recorded in the analyzed database. The novelty of our approach is that we focus on an objective definition of privacy compliance of patterns without any reference to a preconceived knowledge of what is sensitive and what is not, on the basis of the rather intuitive and realistic constraint that the anonymity of individuals should be guaranteed. In particular, the problem addressed here arises from the possibility of inferring from the output of frequent itemset mining (i.e., a set of itemsets with support larger than a threshold ó), the existence of patterns with very low support (smaller than an anonymity threshold k)[3]. In the following we develop a simple methodology to block such inference opportunities by introducing distortion on the dangerous patterns.
Analysis of IEEE 802.11 in Radio over Fiber Home Networks
Authors: Bao Linh Dang, Ignas Niemegeers
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

Radio over Fiber (RoF) techniques have been developed to combine the mobility of wireless technologies and the huge bandwidth offered by optical fibers. In this paper, we present the concept of a hybrid radio-fiber system using IEEE 802.11 specifications as a solution for future broadband in-house networks. An analysis on the feasibility of applying RoF techniques to the IEEE 802.11's Medium Access Control (MAC) protocol will be presented. To substantiate our discussion, simulations of the hybrid system have been carried out. The results show that the throughput of a 802.11 cell extended with an optical distribution network does not decrease drastically when the propagation delay increases.
Assessing Efficiency of Trust Management in Peer-to-Peer Systems
Authors: R. Aringhieri
Venue: Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (2005)

P2P applications support exchanging resources while preserving total or partial anonymity of both requestors and providers. However, concerns have been raised about the possibility that anonymity may encourage malicious peers to spread tampered-with resources (e.g., malicious programs and viruses). A considerable amount of research is now being carried out on the development of trust and reputation models in P2P networks. In this paper, we assess the efficiency of our approach to the design of reputation systems involving flexible techniques for collecting and aggregating peers' opinions via comparison with probabilistic approaches.
Towards computationally sound symbolic analysis of key exchange protocols
Authors: Prateek Gupta, Vitaly Shmatikov
Venue: Proceedings of the 2005 ACM workshop on Formal methods in security engineering (2005)

We present a cryptographically sound formal method for proving correctness of key exchange protocols. Our main tool is a fragment of a symbolic protocol logic. We demonstrate that proofs of key agreement and key secrecy in this logic imply simulatability in Shoup's secure multi-party framework for key exchange. As part of the logic, we present cryptographically sound abstractions of CMA-secure digital signatures and a restricted form of Diffie-Hellman exponentiation, which is a technical result of independent interest. We illustrate our method by constructing a proof of security for a simple authenticated Diffie-Hellman protocol.
Toward an Infrastructure to Support Interoperability in Reverse Engineering
Authors: Nicholas A. Kraft, Brian A. Malloy, James F. Power
Venue: Proceedings of the 12th Working Conference on Reverse Engineering (2005)

In this paper we present an infrastructure that supports interoperability among various reverse engineering tools and applications. We include an Application Programmer's Interface that permits extraction of information about declarations, including classes, functions and variables, as well as information about scopes, types and control statements in C++ applications. We also present a hierarchy of canonical schemas that capture minimal functionality for middle-level graph structures. This hierarchy facilitates an unbiased comparison of results for different tools that implement the same or a similar schema. We have a repository, hosted by SourceForge.net, where we have placed the artifacts of our infrastructure.
FCC Inconsistency Could Squeeze Enterprise Customers
Authors: Greg Goth
Venue: IEEE Distributed Systems Online (2005)

In recent decisions--both announced the same day--the commissioners of the US Federal Communications Commission used almost completely contrary logic to decide the status ofnetwork carriers' services.
A Statistical Classification Approach to Question Answering using Web Data
Authors: Edward Whittaker, Sadaoki Furui, Dietrich Klakow
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

In this paper we treat question answering (QA) as a classification problem. Our motivation is to build systems for many languages without the need for highly tuned linguistic modules. Consequently, word tokens and web data are used extensively but no explicit linguistic knowledge is incorporated. A mathematical model for answer retrieval, answer classification and answer length prediction is derived. The TREC 2002 QA task is used for system development where 33% of questions are answered correctly. Performance is then evaluated on the factoid questions of the TREC 2003 QA task where 23% of questions were answered correctly, which would rank the system in the top 10 of contemporary QA systems on the same task.
Comparison on the effects of defects at Si(111) and Si(100) surface on electrical characteristics of MOS devices with HfOxNy gate dielectric
Authors: Chin-Lung Cheng, Kuei-Shu Chang-Liao, Tien-Ko Wang
Venue: Microelectronic Engineering (2005)

This work investigates and compares the effects of forming a denuded zone (DZ) at (111) and (100) Si surface on the electrical characteristic of MOS devices with HfOxNy high-k gate dielectric. Devices with DZ (low defect region) treatment at Si surface exhibit better electrical characteristics, such as reduced gate leakage current, defect generation rate, and interface trap density, as well as increased time to breakdown than those of without DZ treatment. This improvement can be attributed to the decrease of the defects at Si surface. In particular, by introducing DZ at the Si surface, the (111)-surface-oriented Si substrate has demonstrated more significant improvement on electrical properties than the (100) one.
A Fuzzy Fair Packet Dropping Algorithm Supporting Differentiated Services
Authors: Yuan Chen, Lemin Li
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

In order to improve the adaptability and fairness of RED, we replace the buffer occupancy of individual flow with a new introduced variable - Sharing Index to indicate the network resource share among difference flows. Through defining linguistic rules of both Sharing Index and queue length, a fuzzy logic based buffer management algorithm named FF-RED is proposed. When calculating packet dropping probability in FF-RED algorithm, the probability will further increase or decrease based on the sharing of network resource, so it can make use of the difference between flows to make congestion relief more quickly, and it is more fair and has better adaptability.
Content and Web Services Converge: A Unified User Interface
Authors: Daniel F. Zucker, Michimasa Uematsu, Tomihisa Kamada
Venue: IEEE Pervasive Computing (2005)

The smart phone is a new class of computing device, correspondingly demanding a new class of user interface. The new UI must be easy to customize, update, and maintain. The authors propose a new UI solution in which the Web browser broadens its role beyond browsing external content to also function as the handset UI. This is only the next step in the continuing evolution of today's wireless ecosystem.
RFID middleware design: addressing application requirements and RFID constraints
Authors: Christian Floerkemeier, Matthias Lampe
Venue: Proceedings of the 2005 joint conference on Smart objects and ambient intelligence: innovative context-aware services: usages and technologies (2005)

Radio Frequency Identification (RFID) technology holds the promise to automatically and inexpensively track items as they move through the supply chain. The proliferation of RFID tags and readers will require dedicated middleware solutions that manage readers and process the vast amount of captured data. In this paper we analyze the requirements and propose a design for such an RFID middleware. We argue that an RFID middleware should not only focus on the application needs, but must also consider the constraints imposed by passive RFID technology.
Spatial QBE Interface for Web GIS
Authors: Shapiee Abd Rahman, Subhash Bhalla
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Many applications use geographic data, such as land management, urban planning, tourism, vehicle guidance and navigation, and e-commerce. A related research problem is to define user-friendly interfaces for Web GIS. There is a need for the definition of simple and user-friendly interfaces to allow the users to pose ad-hoc queries. Query-By-Example (QBE) is a user-friendly language developed for a RDBMS. However, many RDBMS have included support for spatial extensions in SQL. QBE has not been extended in line with these extensions. In this paper, we make an effort to create extensions for QBE to support spatial queries and thus calling it Spatial QBE. We show that Spatial QBE is a simple and user-friendly interface for Web users. It can cater to both spatial and common database queries. The main strengths of this interface are its simplicity to express a query and its expressive power.
Automatic Path-Delay Fault Test Generation for Combined Resistive Vias, Resistive Bridges, and Capacitive Crosstalk Delay Faults
Authors: Shweta Chary, Michael L. Bushnell
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

We present a new algorithm to generate path-delay fault tests for combined resistive vias, resistive bridges, and crosstalk capacitive coupling faults. We generate all possible coupling pairs in the circuit, and then we use the resistive bridging fault reduction algorithm to reduce these faults to the important ones. We use a simulation-based sequential automatic test-pattern generation (ATPG) system, with a multiple delay sequential fault simulator, to generate path-delay fault tests. We discuss the analog macromodels used to accurately model these fault effects elsewhere [1]. For defective resistive vias, we obtained a 71 to 93 % path-delay fault coverage on three combinational circuits and 49 to 71 % coverage on four sequential circuits. These are the first reported results for resistive via ATPG. We obtained resistive bridge path-delay fault coverages from 72 to 90 % on three combinational circuits and from 48 to 65 % on four sequential circuits.
Scheduling and Traffic Policing for Variably Demanding Video Traffic Integrated with Voice and Data Traffic in 4th Generation Wireless Networks
Authors: Polychronis Koutsakis
Venue: Wireless Personal Communications: An International Journal (2006)

In this paper, we present an effective mechanism for scheduling and traffic policing in 4th generation wireless networks. More specifically, we: a) extend our previous work on a Multiple Access Control (MAC) scheme for the multiplexing of voice, video and bursty data traffic over a very high-speed wireless TDMA channel, and we study our scheme's performance when MPEG-4 videoconference users of various traffic characteristics are present in the system, and b) we combine the MAC mechanism with an improved version of an efficient traffic policing mechanism. Our results are derived for cases with and without handoff traffic in the uplink channel, and it is shown that although the burstiness of MPEG-4 traffic and channel errors impedes the maximization of channel throughput, our scheme still achieves high channel throughput for all the combined voice/video/data loads examined.
Improved Wideband Low Distortion Cascaded Delta-Sigma Modulator
Authors: Xiaolong Yuan, Andreas Gothenberg, Xiaobo Wu
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

It has recently become very popular to feedforward the input signal in wideband delta-sigma modulators, so that the integrators only process quantization errors. The advantage being that the actual signal is not distorted by opamp and integrator nonlinearities. In this paper, we focus on improved feedforward techniques for cascaded delta-sigma modulators. A feedforward cascaded structure is presented based on unity-gain signal transfer function (STF) and optimized noise transfer function (NTF) zero placement, using ë-analysis. The proposed structure has improved signal-to-noise-ratio (SNR) across the entire input range.
Minimal Ellipsoid Circumscribing a Polytope Defined by a System of Linear Inequalities
Authors: Jun-Ya Gotoh, Hiroshi Konno
Venue: Journal of Global Optimization (2006)

In this paper, we will propose algorithms for calculating a minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities. If we know all vertices of the polytope and its cardinality is not very large, we can solve the problem in an efficient manner by a number of existent algorithms. However, when the polytope is defined by linear inequalities, these algorithms may not work since the cardinality of vertices may be huge. Based on a fact that vertices determining an ellipsoid are only a fraction of these vertices, we propose algorithms which iteratively calculate an ellipsoid which covers a subset of vertices. Numerical experiment shows that these algorithms perform well for polytopes of dimension up to seven.
Learning to rank using gradient descent
Authors: Chris Burges, Tal Shaked, Erin Renshaw, Ari Lazier, Matt Deeds, Nicole Hamilton, Greg Hullender
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

We investigate using gradient descent methods for learning ranking functions; we propose a simple probabilistic cost function, and we introduce RankNet, an implementation of these ideas using a neural network to model the underlying ranking function. We present test results on toy data and on data from a commercial internet search engine.
Introduction to Bayesian learning
Authors: Aaron Hertzmann
Venue: ACM SIGGRAPH 2004 Course Notes (2004)

Sophisticated computer graphics applications require complex models of appearance, motion, natural phenomena, and even artistic style. Such models are often difficult or impossible to design by hand. Recent research demonstrates that, instead, we can "learn" a dynamical and/or appearance model from captured data, and then synthesize realistic new data from the model. For example, we can capture the motions of a human actor and then generate new motions as they might be performed by that actor. Bayesian reasoning is a fundamental tool of machine learning and statistics, and it provides powerful tools for solving otherwise-difficult problems of learning about the world from data. Beginning from first principles, this course develops the general methodologies for designing learning algorithms and describes their application to several problems in graphics.
Counter example for Q-bucket-brigade under prediction problem
Authors: Atsushi Wada, Keiki Takadama, Katsunori Shimohara
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

Aiming to clarify the convergence or divergence conditions for Learning Classifier System (LCS), this paper explores: (1) an extreme condition where the reinforcement process of LCS diverges; and (2) methods to avoid such divergence. Based on our previous work that showed equivalence between LCS's reinforcement process and Reinforcement Learning (RL) with Function approximation (FA) method, we present a counter-example for LCS with Q-bucket-brigade based on the 11-state star problem, a counter-example originally proposed to show the divergence of Q-learning with linear FA. Furthermore, the empirical results applying the counter-example to LCS verified the results predicted from the theory: (1) LCS with Q-bucket-brigade diverged under the prediction problem, where the action selection policy was fixed; and (2) such divergence was avoided by using implicit-bucket-brigade or applying residual gradient algorithm to Q-bucket-brigade.
An interview with Vladimir Trifonov 2005 Danny Lewin best student paper award winner
Authors: Tim Roughgarden
Venue: ACM SIGACT News (2005)

The 2005 Danny Lewin Prize for the best student paper at STOC was awarded to Vladimir Trifonov, of the University of Texas at Austin, for his paper "An O(log n log log n) Space Algorithm for Undirected st-Connectivity" [1]. Hal Gabow recently started the tradition of interviewing the Danny Lewin Prize winner and publishing the interview in SIGACT News. (An interview with the 2003 winner Tom Hayes can be found in the September 2003 issue.) I had the pleasure of (electronically) chatting with Vladimir about his work; a transcript of our conversation follows.
System Availability Analysis Considering Hardware/Software Failure Severities
Authors: Swapna S. Gokhale, John R. Crigler, William H. Farr, Dolores R. Wallace
Venue: Proceedings of the 29th Annual IEEE/NASA on Software Engineering Workshop (2005)

Model-based analysis is a well-established approach to assess the influence of several factors on system availability within the context of system structure. Prevalent availability models in the literature consider all failures to be equivalent in terms of their consequences on system services. In other words, all the failures are assumed to be of the same level of severity. In practice, failures are typically classi- ?ed into multiple severity levels, where failures belonging to the highest severity level cause a complete loss of service, while failures belonging to levels belowthe highest level enable the system to operate in a degraded mode. This makes it necessary to consider the influence of failure severities on system availability. In this paper we present a Markov model which considers failure severities of the components of the system in conjunction with its structure. The model also incorporates the repair of the components. Based on themodel, we derive a closed form expression which relates system availability to the failure and repair parameters of the components. The failure parameters in the model are estimated based on the data collected during acceptance testing of a satellite system. However, since adequate data are not available to estimate the repair parameters, the closed form expressions are used to assess the sensitivity of the system availability to the repair parameters.
Web: Modern Unmediated and Semi-Mediated Search
Authors: Nicholas Eugene Buzikashvili
Venue: Proceedings of the International Workshop on Challenges in Web Information Retrieval and Integration (2005)

The paper reevaluates a comparison of quantitative characteristics, strategies and principles of information searching behavior on the Web and in traditional search environments. Counter to widely spread opinions unmediated search on the Web doesn't differ from really unmediated search in other online environments neither in searching strategies nor in quantitative characteristics. At the same time the Web changes dramatically mediated and 'semi-mediated' search. While traditional mediated search is absent on the Web at all, the Web gives rise to a cooperative semi-mediated search, mass sort of non-classical mediated search, which differs from the traditional mediated search.
A Performance Comparison of Different FEC System Architectures for ATM over Wireless Multi-Carrier Modulation
Authors: José Marcos Câmara Brito, Sebastião Bonatti
Venue: Wireless Personal Communications: An International Journal (2005)

In multi-carrier modulation (MCM) systems multiple relatively narrowband sub-carriers are used to alleviate the undesirable influence of frequency selective fading. This paper analyses the performance of MCM data links when forward error correction is employed either in each sub-carrier or in the main stream of bits. The influences on system performance of interleaving and suppression of the poorest sub-carriers are also analysed.
Acceptable Operating Force for Buttons on In-Ear Type Headphones
Authors: Vincent Buil, Gerard Hollemans
Venue: Proceedings of the Ninth IEEE International Symposium on Wearable Computers (2005)

The Touch Headphones are a solution for providing playback and volume controls on in-ear type headphones. One of the issues with placing controls on earpieces is that applied pressure is transferred to the inner ear, which potentially creates discomfort. The experiment described in this short paper shows that conventional button switches are not well accepted. Users preferred to operate a button on an earpiece with a force of around 85 grams.
A High-Performance VLSI Architecture for Advanced Encryption Standard (AES) Algorithm
Authors: Naga M. Kosaraju, Murali Varanasi, Saraju P. Mohanty
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

In this paper we present a high-performance, high throughput, and area efficient architecture for the VLSI implementation of the AES algorithm. The subkeys, required for each round of the Rijndael algorithm, are generated in real-time by the key-scheduler module by expanding the initial secret key, thus reducing the amount of storage for buffering. Moreover, pipelining is used after each standard round to enhance the throughput. A prototype chip implemented using 0.35µ CMOS technology resulted in a throughput of 232Mbps for iterative architecture and 1.83Gbps for pipelining architecture.