ppxscal/embedding_network huggingface dataset:
On fairness in simulatability-based cryptographic systems
Authors: Michael Backes, Dennis Hofheinz, Jörn Müller-Quade, Dominique Unruh
Venue: Proceedings of the 2005 ACM workshop on Formal methods in security engineering (2005)

Simulatability constitutes the cryptographic notion of a secure refinement and has asserted its position as one of the fundamental concepts of modern cryptography. Although simulatability carefully captures that a distributed protocol does not behave any worse than an ideal specification, it however does not capture any form of liveness guarantees, i.e., that something good eventually happens in the protocol.We show how one can extend the notion of simulatability to comprise liveness guarantees by imposing specific fairness constraints on the adversary. As the common notion of fairness based on infinite runs and eventual message delivery is not suited for reasoning about polynomial-time, cryptographic systems, we propose a new definition of fairness that enforces the delivery of messages after a polynomial number of steps. We provide strengthened variants of this definition by granting the protocol parties explicit guarantees on the maximum delay of messages. The variants thus capture fairness with explicit timeout signals, and we further distinguish between fairness with local timeouts and fairness with global timeouts.We compare the resulting notions of fair simulatability, and provide separating examples that help to classify the strengths of the definitions and that show that the different definitions of fairness imply different variants of simulatability.
WARP: Time Warping for Periodicity Detection
Authors: Mohamed G. Elfeky, Walid G. Aref, Ahmed K. Elmagarmid
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

Periodicity mining is used for predicting trends in time series data. Periodicity detection is an essential process in periodicity mining to discover potential periodicity rates. Existing periodicity detection algorithms do not take into account the presence of noise, which is inevitable in almost every real-world time series data. In this paper, we tackle the problem of periodicity detection in the presence of noise. We propose a new periodicity detection algorithm that deals efficiently with all types of noise. Based on time warping, the proposed algorithm warps (extends or shrinks) the time axis at various locations to optimally remove the noise. Experimental results show that the proposed algorithm out-performs the existing periodicity detection algorithms in terms of noise resiliency.
Exploring Logic Block Granularity in Leakage Tolerant FPGA
Authors: Rajan Konar, Rajarshee Bharadwaj, Dinesh Bhatia, Poras T. Balsara
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

Exponential increase in static power has emerged as a critical challenge to FPGA architects in nanometer designs. The significant amount of underutilized resources both in spatial and temporal domain provides opportunities for effective power management. In this work, we carry out an in-depth trade-off analysis of various design goals in a power aware programmable architecture designed to mitigate standby leakage energy. We identify the optimum granularity of logic blocks at which standby leakage has to be controlled while optimizing trade-offs with other design goals.
On P2P Collaboration Infrastructures
Authors: Manfred Hauswirth, Ivana Podnar, Stefan Decker
Venue: Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (2005)

BSCW [8] and Groove [10] have become the two defacto standards for collaboration over the Internet. They offer a wealth of functionalities, support a variety of possible collaboration styles, and are applied frequently in research and business projects. While being useful and powerful for standard scenarios, they suffer from some problematic aspects if support for distributed ad-hoc and mobile collaboration is needed. Both are centralized systems which require the setup and maintenance of a server. Setting up such an infrastructure for short-term and ad-hoc collaboration of mobile users is not feasible since it requires the infrastructure to be in place and configured a-priori, which is costly in terms of hardware, software, and time. Thus they are not very adequate for flexible, short term collaborations, a genuine building block of many light-weight distributed mobile collaboration scenarios. In this paper we discuss how P2P approaches could be applied to remedy these shortcomings and to what extent exist
Fuzzy Co-clustering of Web Documents
Authors: William-Chandra Tjhi, Lihui Chen
Venue: Proceedings of the 2005 International Conference on Cyberworlds (2005)

The Web is the largest information repository in the history of mankind. Due to its huge size however, finding relevant information without any appropriate tool can be virtually impossible. Web document clustering is one possible technique to improve the efficiency in information finding process. In this paper, we are looking into fuzzy co-clustering, which is known to be robust for clustering standard text documents. In our opinion, its robustness can also be extended to web documents because it can generate descriptive clusters in high dimension and it is able to discover data clusters with overlaps. We consider two existing fuzzy co-clustering algorithms, FCCM and Fuzzy Codok. In addition, we propose a new algorithm, FCC-STF, as an alternative to the existing ones. Empirical study of these algorithms on benchmark datasets is presented, together with the performance comparison with a standard fuzzy clustering algorithm HFCM. The results show that fuzzy co-clustering is generally superior to standard fuzzy clustering in the Web environment, making it a technique with great potential to assist internet user in discovering relevant information effectively.
A Preference Model for Structured Supervised Learning Tasks
Authors: Fabio Aiolli
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

The preference model introduced in this paper gives a natural framework and a principled solution for a broad class of supervised learning problems with structured predictions, such as predicting orders (label and instance ranking), and predicting rates (classification and ordinal regression). We show how all these problems can be cast as linear problems in an augmented space, and we propose an on-line method to efficiently solve them. Experiments on an ordinal regression task confirm the effectiveness of the approach.
Using a theory of human behavior to analyze the effects of documentation
Authors: Ruven Brooks
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1977)

While this example has mentioned five modeling domains, these same five would not necessarily be present in every task or for all parts of a task. If the task is to implement a particular algorithm for a general purpose algorithm, say, a matrix inversion routine, there will be no domain corresponding to the original domain of cargoes and routes in the example. On the other hand, use of a primitive operation of searching a tree at one level might require use of an intermediate domain, containing methods of tree traversal, before the knowledge could be represented at the programming language level. 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
The "control of fear": an interactive art experiencing and presenting system with multimodal sensors and media
Authors: Chin Chih Yang, Lipin Liu, Jacy Chen
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

The "Control of Fear" project is an interactive art exhibition project to provide the general public an opportunity to experience what it might be occurred to them if their lives were suddenly altered by an unforeseen and unpredictable catastrophic event.The project uses varieties of modern emerging technologies to simulate unpredictable catastrophic events and detect participant's behavior. Technologies used include multimodal sensors, 3D holographic projection, 360 degree panoramic view video, speech recognition, intelligent interaction response, and synchronous control of multiple multimedia programs.
Robust Congestion Control for High Speed Data Networks with Uncertain Time-Variant Delays: an LMI Control Approach
Authors: J. Hu, J. Lin, L. Xie
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

In this paper, we first develop a delay-dependent condition for the stability and 8 H performance of systems with time-variant delays in both the state and output equations in terms of an LMI (Linear Matrix Inequality). The analysis result is then applied to derive a 8 H congestion control where the congestion problem is formulated as the 8 H control of systems with time-variant input delays. Illustrative examples are provided to show excellent performance of the proposed algorithm in achieving an equilibrium in the buffer occupancy in the presence of time-variant delays. To the best of our knowledge, no such congestion control approach that directly accommodates the issue of the uncertain time-variant delays has been reported.
Efficient Behavioural Modelling of Small Timing Errors in A/D and D/A Converters
Authors: Timo Rahkonen, Heikki Repo
Venue: Analog Integrated Circuits and Signal Processing (2006)

In this paper, methods for analyzing the effects of small timing errors in D/A and time-interleaved A/D converters are studied. It is shown that timing skew and slew rate in D/A converters cause broadband spurious components, but the output spectrum can in most cases be calculated simply by averaging the errors over one sample period and using FFT at the original sample rate. Also the frequency-domain effects of mismatch in time-interleaved A/D converters can be constructed by calculating the mixing transfer functions caused by the time-varying gain and timing.
RT-MaC: Runtime Monitoring and Checking of Quantitative and Probabilistic Properties
Authors: Usa Sammapun, Insup Lee, Oleg Sokolsky
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

Correctness of a real-time system depends on its computation as well as its timeliness and its reliability. In recent years, researches have focused on verifying correctness of a real-time system during runtime by monitoring its execution and checking it against its formal specifications. Such verification method is called Runtime Verification. Most existing runtime verification tools verify computation correctness using qualitative property specifications but do not verify timeliness nor reliability correctness. In this paper, we investigate the verification on timeliness and reliability correctness by offering quantitative and probabilistic property specifications and implementing efficient verifiers.
Turbo Codes " Digital IC Design
Authors: Moeed Israr, Tad Kwasniewski
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

This paper presents a Digital ASIC implementation of Turbo Encoder and simulation of the Encoder and the Decoder. The simulations determine the impact of decoder iterations, encoder transfer function and block size on latency, throughput and bit error rate. The paper proposes a design of Turbo Encoding hardware with dual-port on-chip memory targeting 0.18 µm CMOS technology that reduces the memory requirements to half. Architectural and block level consideration are made to reduce power and area requirements while achieving a latency of "packet size + 5" clock cycles. Estimated power and area are 54.19mW and 12.0 mm² respectively.
An efficient query learning algorithm for ordered binary decision diagrams
Authors: Atsuyoshi Nakamura
Venue: Information and Computation (2005)

In this paper, we propose a new algorithm that exactly learns ordered binary decision diagrams (OBDDs) with a given variable ordering via equivalence and membership queries. Our algorithm uses at most n equivalence queries and at most 2n(⌈log2m⌉ + 3n) membership queries, where n is the number of nodes in the target-reduced OBDD and m is the number of variables. The upper bound on the number of membership queries is smaller by a factor of O(m) compared with that for the previous best known algorithm proposed by R. Gavaldà and D. Guijarro [Learning Ordered Binary Decision Diagrams, Proceedings of the 6th International Workshop on Algorithmic Learning Theory, 1995, pp. 228-238].
A Methodology for Switching Activity Based IO Powerpad Optimisation
Authors: Snehashis Roy, S. Jairam, H. Udayakumar
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

Backend planning for SoCs needs to account for power pads and pins for different power domains. IO power pad requirements for high speed interfaces, are directly dependent on the worst case switching of output buffers. This work proposes an algorithm that takes switching activity patterns of a set of output buffers for an interface and generates an optimized IO power and ground pad locations. Optimisation is achieved by splitting the spatial locations of the drivers into smaller groups and solving pad requirement problem for each of the groups. Ground bounce is the main component based on which the pad count is estimated. Special requirements like multiple power domains, different packages (TQFP, BGA) etc, have also been addressed. Its been shown by simulations that up to 20% reduction in pad count can be achieved if switching patterns are available.
A Mobile Phone-based Wearable Vital Signs Monitoring System
Authors: Wenxi Chen, Shigeru Tokinoya, Naotoshi Takeda
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

Design and implementation of a multiple vital signs monitoring system based upon mobile telephony and internet infrastructure for e-health are described. The system hierarchy comprises three layers for sensing, communication, and management. The core of the sensing layer is a wearable sensor unit, including a cordless sensor device and a sensor-wear garment, suitable for vital signs real-time monitoring without discomfort and constraint during daily activities. The communication layer performs bi-directional data/command exchange via either wired or wireless means to bridge between the sensor layer and management layer. The management layer conducts comprehensive data analysis and evidence-based health management. This article describes the architecture design considerations and systemic implementation to meet various practical needs and provide scalable solutions not only for home healthcare but also other applications driven by vital signs. Three applications platformed on this architecture are explained.
Biological inspired Tools for Patrimonial Handwriting Denoising and Categorization
Authors: Veronique EGLIN, Stephane BRES, Carlos RIVERO, Hubert EMPTOZ
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

In this paper, we propose a global segmentation free methodology for patrimonial documents denoising, handwriting characterization and categorization that are based on biological inspired approaches. We widely used here the spectral domain of handwritten images by frequency decompositions: Hermite transforms and Gabor bank filters. Handwritten pages are described by a multiscale signature that is based on orientation features and that is at the basis of a similarity measure. The current results of handwriting categorization and indexing are very promising and show that it is possible to analyze handwritten drawings without any a priori graphemes segmentation.
Host Behaviour Based Early Detection of Worm Outbreaks in Internet Backbones
Authors: Thomas Dubendorfer, Bernhard Plattner
Venue: Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (2005)

We propose a novel near real-time method for early detection of worm outbreaks in high-speed Internet backbones. Our method attributes several behavioural properties to individual hosts like ratio of outgoing to incoming traffic, responsiveness and number of connections. These properties are used to group hosts into distinct behaviour classes. We use flow-level (Cisco NetFlow) information exported by the border routers of a Swiss Internet backbone provider (AS559/SWITCH). By tracking the cardinality of each class over time and alarming on fast increases and other significant changes, we can early and reliably detect worm outbreaks. We successfully validated our method with archived flow-level traces of recent major Internet email based worms such as MyDoom.A and Sobig.F, and fast spreading network worms like Witty and Blaster. Our method is generic in the sense that it does not require any previous knowledge about the exploits and scanning method used by the worms. It can give a set of suspicious hosts in near real-time that have recently and drastically changed their network behaviour and hence are highly likely to be infected.
An Optimal and Lightweight Routing for Minimum Energy Consumption in Wireless Sensor Networks
Authors: Noseong Park, Daeyoung Kim, Yoonmee Doh, Sangsoo Lee, Ji-tae Kim
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

There are many trials to provide an optimal route for minimum energy consumption in a wireless sensor network. Currently, however, the mechanisms to find Minimum Energy Property Graph (MEPG) do not properly take into account the efficiency in time and storage, the optimality in results, and the feasibility in real systems. In this paper, we propose an efficient and first optimal algorithm to find the MEPG, in which all minimum energy paths are included, not only significantly reducing its total number of edges, but also obtaining an optimal result in O(VlogV+E). We also develop Power Aware Data-centric routing protocol characterized by minimum energy consumption and longer lifetime.
Adapting Particle Swarm Optimization to Stock Markets
Authors: Jovita Nenortaite, Rimvydas Simutis
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

The paper is focused on the development of intelligent decision-making model which is based on the application of artificial neural networks (ANN) and swarm intelligence algorithm. The proposed model generates one-step forward investment decisions. The ANN are used to make the analysis of historical stock returns and to calculate one day forward possible profit, which could be get while following the model proposed decisions concerning the purchase of the stocks. Subsequently the Particle Swarm Optimization (PSO) algorithm is applied for training of ANN. The training of ANN is made through the adjustment of all ANN towards the weights of "global best" ANN. The experimental investigation were made considering different forms of decision-making model: different structure ANN, input variables etc. The paper introduces experimental investigation for the evaluation of decision-making model. The experimental results show that the application of the proposed decision-making model lets to achieve better results than the average of the market.
Challenges in forensic computing
Authors: Rebecca Mercuri
Venue: Communications of the ACM (2005)

The ever-changing nature of technology contributes to the problems encountered by experts when collecting and preparing digital evidence for courtroom presentation.
On Generating Tests to Cover Diverse Worst-Case Timing Corners
Authors: Leonard Lee, Sean Wu, Charles H-P Wen, Li-C. Wang
Venue: Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2005)

With process variations, timing behavior may vary from chip to chip. This paper investigates the problem of generating test patterns to cover potentially diverse worst-case timing corners. We focus the work on a specific problem formulation where the delay of a path can be affected by k aggressors. We demonstrate that the search space for such a problem can be quite complex. We study various methods to guide the test generation. We show that with different chips having different worst-case corners, it may not be affordable to search for the tests to expose all these corners. Experimental results are presented to explain the problem formulation, the test generation methods, and the limitation on what we can achieve for solving the problem.
SystemC-based Design Methodology for Reconfigurable System-on-Chip
Authors: Yang Qu, Juha-Pekka Soininen
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

Reconfigurable system is a promising alternative to deliver both flexibility and performance at the same time. New reconfigurable technologies and technologydependent tools have been developed, but a system-level design methodology to support system analysis and fast design space exploration is missing. In this paper, we present a SystemC-based system-level design approach. The main focuses are the resource estimation to support system analysis and reconfiguration modeling for fast performance simulation. The approach was applied in a real design case of a WCDMA detector on a commercially available reconfigurable platform. The runtime reconfiguration was used and the design showed 40% area saving when compared to a functionally equivalent fixed system and 30 times better in processing time when compared to a functionally equivalent pure software design.
A causal approach to hierarchical decomposition of factored MDPs
Authors: Anders Jonsson, Andrew Barto
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

We present Variable Influence Structure Analysis, an algorithm that dynamically performs hierarchical decomposition of factored Markov decision processes. Our algorithm determines causal relationships between state variables and introduces temporally-extended actions that cause the values of state variables to change. Each temporally-extended action corresponds to a subtask that is significantly easier to solve than the overall task. Results from experiments show great promise in scaling to larger tasks.
The academic department head game
Authors: Stephen C. Chapman, John E. Osborne,  Jr.
Venue: ACM SIGSIM Simulation Digest (1974)

"The Academic Department Head Game" is a computerized management exercise (computer programs are written in American National Standard Fortran IV) designed to emphasize the more important decisions that must be made by an academic department head. The player assumes the position of head (or chairman) of the Department of Statistics at the State University of Id, a typical land-grant institution, with the objective of maximizing his departmental reputation.
Risk: compensation and the expected utility hypothesis
Authors: Kenneth H. Derus, John C. Hansen
Venue: ACM SIGSIM Simulation Digest (1978)

The formula for Fair Risk-Compensation (hereafter, FRC) in betting situations is usually expressed as B/p(W), where B is the amount bet and p(W) is the probability of winning. (The psychological interpretation is clear. If an individual has 1 - p(W) chances of losing his investment-- where 1 - p(W)&Gt;p(W), he must stand to gain, should he win, in proportion to his chances of winning; otherwise there is no point to undertaking the risk in the first place.) This formula is highly misleading. It is a trivial matter to construct betting policies where p(L) # 1 - p(W). (I. e. - where the probability of having to pay out money is not equal to the probability of not taking in money.)