ppxscal/embedding_network huggingface dataset:
Reducing Congestion Effects in Wireless Networks by Multipath Routing
Authors: Lucian Popa, Costin Raiciu, Ion Stoica, David Rosenblum
Venue: Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols (2006)

We propose a solution to improve fairness and increase throughput in wireless networks with location information. Our approachconsists of a multipath routing protocol, Biased Geographical Routing (BGR), and two congestion control algorithms, In-NetworkPacket Scatter (IPS) and End-to-End Packet Scatter (EPS), which leverage BGR to avoid the congested areas of the network.BGR achieves good performance while incurring a communication overhead of just 1 byte per data packet, and has a computationalcomplexity similar to greedy geographic routing. IPS alleviates transient congestion by splitting traffic immediately beforethe congested areas. In contrast EPS alleviates long term congestion by splitting the flow at the source, and performing ratecontrol. EPS selects the paths dynamically, and uses a less aggressive congestion control mechanism on non-greedy paths toimprove energy efficiency. Simulation and experimental results show that our solution achieves its objectives. Extensive ns-2simulations show that our solution improves both fairness and throughput as compared to single path greedy routing. Our solutionreduces the variance of throughput across all flows by 35%, reduction which is mainly achieved by increasing throughput oflong-range flows with around 70%. Furthermore, overall network throughput increases by approximately 10%. Experimental resultson a 50-node testbed are consistent with our simulation results, suggesting that BGR is effective in practice.
Frequency Analysis Method for Propagation of Transient Errors in Combinational Logic
Authors: Shaohua Lei, Yinhe Han, Xiaowei Li
Venue: Proceedings of the 16th Asian Test Symposium (2007)

The continuous development of VLSI technology is shrinking the minimal sizes to nanometer region, making circuits more susceptible to transient error. In this paper, we present a frequency analysis method to accurately estimate the possible propagation of transient fault-due glitches through a CMOS combinational circuit. We use the frequency feature of signal and frequency response of electrical system to analyze the propagation of transient error. Experiments show that on average, our approach provides approximately 95% accuracy and several orders of magnitude faster with respect to HSPICE simulation.
Fuzzy Temporal Interval Relationship Based on Interval-Valued Fuzzy Sets
Authors: Zhaoqiang Huang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

Time is an important feature in our real world. From computer science field that research temporal data to spatial information field that research spatial temporal data, the researchers all have considered that the conception of time is important. In many application domains, time is needed to record when the object exists or changes and when the event happens. In general, temporal information is regarded as crisp and is applied in many areas. However, in fact temporal information is not crisp, but is uncertain and vague. Geographic phenomena, such as when the real-estate begins to exchange and when the house is collapsed, have the imprecise temporal information. To represent these uncertain temporal information, in this paper we present fuzzy interval relationship model based on fuzzy interval- valued. And then a new fuzzy interval algebra is presented by extending the Allen's classical interval algebra. The approach naturally is compatible for existing classical temporal model.
On the Encryption of Image Decompression with User's Identity
Authors: Deyun Yang, Zhengliang Huan
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

The internet has been a main method of image's transmission and storage. A significative problem is how to prevent illegal diffusion for some images. In this paper, we prefer an effective method of registering the decode program with the user's identity by which the installation procedure produces the registering number with processed chaotic sequence or random sequences.
Displays on Display
Authors: F. Crow, C. Csuri
Venue: IEEE Computer Graphics and Applications (1981)

Color, resolution, and speed, though important factors in computer graphics, must be subordinate to the message the image must deliver. While many graphics designers and users have understood this, many others, bedazzled by the powerful hardware/software tools available to them, have been tempted to use all the techniques they can instead of the ones they should. If they had a system that could graph in eight colors and fifteen fonts, for example, they used them all-with confusion of the viewer the result.
Parallel on-chip ciphers development for the third generation mobile telecommunication system
Authors: Issam W. Damaj
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

The paper focuses on the synthesis of a highly parallel hardware implementation of the main cipher designed for the third generation mobile communication system. The investigated algorithm is the KASUMI block cipher. Currently, KASUMI is well known to be a strong encryption algorithm. The use of such an algorithm within critical applications, such as mobile communication, requires efficient, highly reliable and correct hardware implementation. We will investigate satisfying such requirements by proposing and adopting a step-wise refinement software engineering approach to develop correct hardware circuits. The method uses a formal functional programming notation for specifying algorithms. The parallel behavior is then obtained through the use of a combination of function decomposition strategies, besides, data and process refinement techniques. The refinements are inspired by the operators of Communicating Sequential Processes (CSP) and map easily to programs in Handel-C (a modern C-based high-level langauge with hardware output). In this paper, we obtain several hardware implementations with different performance characteristics by applying different refinements to the algorithm. The developed designs are compiled and tested under Celoxica's RC-1000 reconfigurable computer with its 2 million gates Virtex-E FPGA. Performance analysis and evaluation of these implementations are included.
Building a framework to characterize location-based services
Authors: Ana M. Bernardos, Jose R. Casar
Venue: Proceedings of the The 2007 International Conference on Next Generation Mobile Applications, Services and Technologies (2007)

This contribution proposes a feature-based framework to analyze mobile location based services (LBS) with the purpose of shedding some light on relevant aspects that may be relevant when defining sustainable business models. The framework is built from a survey and categorization of current commercial services, which also aims at representing the current LBS commercial state. Elaborating on this survey, a number of issues that impact on LBS business model sustainability are identified. The framework is not focused on traditional technical system descriptors (accuracy, coverage), but on user's experience related factors (e.g. service provision environments, user's devices functionalities, service's interactivity schemes, contents needs or privacy requirements) and on market and business concerns (related to the service's value chain composition, its commercialization channels or its revenue model). Some commercial mobile location services (with different functionalities and technological enablers) are reviewed under the suggested perspective.
New Products for Graphics and Image Processing
Venue: Computer (1977)

Ramtek's new 6000 Series micrographic terminal combines true graphics and high-speed alphanumerics in a programmable CRT display system. The 6000 Series MGT is available in color or black and white in a rack-mount chassis or desktop terminal. 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
DYFARS: Boosting Reliability in Fault-Tolerant Heterogeneous Distributed Systems Through Dynamic Scheduling
Authors: Wei Luo, JunLin Li, FuMin Yang, Gang Tu, LiPing Pang, Lin Shu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

In this paper, we propose a dynamic and reliability-driven real-time fault-tolerant scheduling algorithm on heterogeneous distributed systems (DYFARS). Primary-backup copy scheme is leveraged by DYFARS to tolerate both hardware and software failures. Most importantly, DYFARS employs reliability costs as its main objective to dynamically schedule independent, non-preemptive aperiodic tasks, therefore system reliability is enhanced without additional hardware costs. A salient difference between our DYFARS and existing scheduling approaches is that DYFARS considers backup copies in both active and passive forms; therefore, DYFARS is more flexible than the existing scheduling schemes in the literature. Finally, simulation experiments are carried out to compare DYFARS with existing similar algorithm, experiment results show that DYFARS is superior to existing algorithm regarding both Schedulability and Reliability.
Design, deployment, and use of the DETER testbed
Authors: Terry Benzel, Robert Braden, Dongho Kim, Clifford Neuman, Anthony Joseph, Keith Sklower, Ron Ostrenga, Stephen Schwab
Venue: Proceedings of the DETER Community Workshop on Cyber Security Experimentation and Test on DETER Community Workshop on Cyber Security Experimentation and Test 2007 (2007)

The DETER testbed provides infrastructure for conducting medium-scale repeatable experiments in computer security, especially experiments that involve malicious code. Built using Utah's EMULAB, the DETER testbed has been configured and extended to provide stronger assurances for isolation and containment. This paper provides information on the capabilities of the DETER testbed and discusses the lessons learned from its deployment. Our strategies for containment are described and future plans discussed.
Toward supporting real-time mining for data residing on enterprise systems
Authors: Yu-Chin Liu, Ping-Yu Hsu
Venue: Expert Systems with Applications: An International Journal (2008)

As data mining techniques are explored extensively, incorporating discovered knowledge into business strategies gives superior competitive advantage to corporations. Most techniques in mining association rules nowadays are designed to solve problems based on transaction files transformed to horizontal or vertical format. Namely, the transaction-normalized tables should be transformed before such methods could be applied, and some previous works have pointed out that such tasks of performing data transformation usually consume a lot of resources. As a result, traditionally, data mining technique has seldom being applied in real-time. However, in many cases, the decisions have to be made in a short time, such as the decisions of promoting fresh agriculture goods in retailing stores should be made daily and in the limit of one or two hours. This study therefore proposes a new method which incorporates mining algorithms with enterprise transaction databases directly to perform real-time mining. In addition, the proposed method has following advantages to support real-time mining performed in enterprise systems: *raw data of enterprise systems are used directly, *when the threshold is tuned, only newly qualified data are read and the data structure built for original data is kept intact, *product assortments centered on particular product can be effectively performed, *the performance of the mining algorithm is better than that of popular mining algorithms.
Estimating the output cardinality of partial preaggregation with a measure of clusteredness
Authors: Sven Helmer, Thomas Neumann, Guido Moerkotte
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

We introduce a new parameter, the clusteredness of data, and show how it can be used for estimating the output cardinality of a partial preaggregation operator. This provides the query optimizer with an important piece of information for deciding whether the application of partial preaggregation is beneficial. Experimental results are very promising, due to the high accuracy of the cardinality estimation based on our measure of clusteredness.
SAT based Verification Tool for Labeled Transition System
Authors: Sachoun Park, Gihwon Kwon
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

Multi-threaded Java programming such as an internet server program is difficult, because it is hard to detect subtle errors within multi-threading. LTSA is a tool for modeling and analyzing for catching some kinds of thread bugs, but still there remains scalability problem to deal with bigger applications. In this paper, we introduce a SAT based verification tool for Labeled Transition System and we explain LTS semantics and their CNF encoding. To verify large model, we focus our attention on efficient encoding for given model. In our tool, the property to be checked is expressed by either LTS or LTL formula based on Fluent. In order to solve a problem, LTSs and property are represented with CNF formulae, the input format to SAT-solver.
Deterministic Division Algorithm in a Negative Base
Authors: P. V. Sankar
Venue: IEEE Transactions on Computers (1973)

Described here is a deterministic division algorithm in a negative-base number system; here, the divisor is mapped into a suitable range by premultiplication, so that the choice of the quotient digit is deterministic.
Incremental component implementation selection: enabling ECO in compositional system synthesis
Authors: Soheil Ghiasi
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

The component implementation selection problem (CISP) is to select the appropriate implementation for components of a design, such that the timing constraint is met and some global design objective is optimized. CISP is a generic problem that implicitly or explicitly appears in many stages of CAD flow. In this paper, we present a methodology for quick and efficient updating of CISP solutions in face of incremental engineering changes. For a commonly-used formulation, we discuss necessary and sufficient conditions for optimality of a CISP solution based on which, we develop an algorithm that maintains both validity and optimality of a solution subject to incremental changes. We implemented our approach to incrementally update the threshold voltage assignment solution for a netlist going through engineering changes. On average, our method ran over 300 times faster than the "from-scratch" solver, while delivering the same results.
On the Minimization of the Control Store in Microprogrammed Computers
Authors: C. Halatsis
Venue: IEEE Transactions on Computers (1978)

A new approach is presented for the minimization of the word length of the control store in microprogrammed computers. Given the set of microinstructions and the set of microcommands of a microprogrammed computer a minimal subset of microcommands are determined so that every other microcommand not contained in this minimal subset to be generated from it by a single AND or OR gate. The problem of finding such minimal subsets of microcommands is formulated as a Boolean function simplification problem and is based upon an extension of the notion of the minimal dependence sets of a Boolean function.
Using the Bell Labs security framework to enhance the ISO 17799&#x002F;27001 information security management system
Authors: Andrew R. McGee, Frank A. Bastry, Uma Chandrashekhar, S. Rao Vasireddy, Lori A. Flynn
Venue: Bell Labs Technical Journal (2007)

The global information technology (IT) industry recognizes the need for standards to improve the quality and consistency of security for IT products and services. As such, the International Organization for Standardization&#x002F; International Electrotechnical Commission (ISO&#x002F;IEC) 27000 series is focusing on the requirements, security controls, and implementation guidance for an organization's information security management system (ISMS). This guidance establishes general principles that can be used in various industries and government&semi; however, standardized techniques are also needed to identify, implement, and operate security controls as part of the ISMS life cycle. The Bell Labs Security Framework identifies both the minimal and differentiating security controls by decomposing an IT product or service into a layered hierarchy of equipment and facilities groupings and examining the types of activities that occur at each layer in a standardized manner. Furthermore, the Bell Labs Security Framework security dimensions provide the necessary mechanisms to implement and operate the selected controls. The Bell Labs Security Framework enhances the ISO&#x002F;IEC 27000 series by providing a comprehensive end-to-end approach to implementing IT security. &copy; 2007 Alcatel-Lucent.
Application-level Fair Multicasting Scheme Suitable for Multipoint Real-time Communication
Authors: Kanako Uchida, Hideki Tode, Koso Murakami
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

The spread of broadband access to the Internet means that real-time applications have become commonplace. Video conferencing, communicating interactively in real time at multiple locations, is one such real-time application. For multipoint real-time communication, each member has to transmit information to all of the other members in the multicast delivery. However, there are some problems in real-time multicasting. Specifically, end-to-end delay and packet loss rate differ among multicast members. In this study, we aim to achieve fairness of time and quality among multicast members in multipoint realtime communication. In this paper, we assume that the multicast is of the application-level shared-tree type. To solve the problems mentioned above, we propose a new control mechanism in the root node of the shared tree. This mechanism consists of a proposed scheduling algorithm and a proposed discarding discipline. To make end-to-end delay among members uniform, the packet transfer order from the buffer is scheduled by considering the packet's generation time and the delay from the root node to the receiver. On the other hand, to make the packet loss rate among members uniform, the discard probability of packets that have arrived at the root node is decided by considering the packet loss rate in the network from the sender to the root node. Experimental performance evaluation demonstrates that our proposed system can achieve fairness in time and quality.
Denial of service or denial of security?
Authors: Nikita Borisov, George Danezis, Prateek Mittal, Parisa Tabriz
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

We consider the effect attackers who disrupt anonymous communications have on the security of traditional high- and low-latency anonymous communication systems, as well as on the Hydra-Onion and Cashmere systems that aim to offer reliable mixing, and Salsa, a peer-to-peer anonymous communication network. We show that denial of service (DoS) lowers anonymity as messages need to get retransmitted to be delivered, presenting more opportunities for attack. We uncover a fundamental limit on the security of mix networks, showing that they cannot tolerate a majority of nodes being malicious. Cashmere, Hydra-Onion, and Salsa security is also badly affected by DoS attackers. Our results are backed by probabilistic modeling and extensive simulations and are of direct applicability to deployed anonymity systems.
Psi^2 a Software Tool for the Perfect Simulation of Finite Queueing Networks
Authors: Jean-Marc Vincent, Jerome Vienne
Venue: Proceedings of the Fourth International Conference on Quantitative Evaluation of Systems (2007)

Markovian networks of finite capacity queues are widely used models for performance evaluation of systems and networks. Unfortunately, excepted in some specific situations, these models are not tractable analytically [2]. Approximation techniques, aggregation, fluidification have been proposed to capture the behavior such systems. But, in most complex cases, simulation remains the only tool to estimate the steady state of the system.
FPGA-based Road Traffic Videodetector
Authors: Marek Gorgon, Piotr Pawlik, Miroslaw Jablonski, Jaromir Przybylo
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

In the present paper the background generation and motion detection algorithms, which are of key importance for the implementation of videodetection, have been presented. A modification of the background generation algorithm, essential for proper algorithm functioning at medium and high road-traffic conditions, has been proposed. Algorithm adaptation for the implementation in reprogrammable device has been also presented. A modification of the SAD algorithm, used in motion detection, has been introduced. The modification allows for Regions of Interest of irregular shape and structure in the analyzed image. It creates a capability to conduct the calculations in independent and parallel manner for specific, user-defined, active videodetection regions. PixelStream-based implementation has been successfully performed. Real-time verification on reconfigurable platform has been done.
A Comparison Study of Credit Scoring Models
Authors: Defu Zhang, Hongyi Huang, Qingshan Chen, Yi Jiang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

In this paper we consider a credit scoring problem. We compare three powerful credit scoring models: genetic programming (GP), backpropagation neural networks (BP) and support vector machines (SVM) when applied to this problem, then we give a combined model. The results show that the combined model produces good classification results.
Classification and Recognition of Dynamical Models: The Role of Phase, Independent Components, Kernels and Optimal Transport
Authors: Alessandro Bissacco, Alessandro Chiuso, Stefano Soatto
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

We address the problem of performing decision tasks, and in particular classification and recognition, in the space of dynamical models in order to compare time series of data. Motivated by the application of recognition of human motion in image sequences, we consider a class of models that include linear dynamics, both stable and marginally stable (periodic), both minimum and non-minimum phase, driven by non-Gaussian processes. This requires extending existing learning and system identification algorithms to handle periodic modes and nonminimum phase behavior, while taking into account higher-order statistics of the data. Once a model is identified, we define a kernel-based cord distance between models that includes their dynamics, their initial conditions as well as input distribution. This is made possible by a novel kernel defined between two arbitrary (non-Gaussian) distributions, which is computed by efficiently solving an optimal transport problem. We validate our choice of models, inference algorithm, and distance on the tasks of human motion synthesis (sample paths of the learned models), and recognition (nearest-neighbor classification in the computed distance). However, our work can be applied more broadly where one needs to compare historical data while taking into account periodic trends, non-minimum phase behavior, and non-Gaussian input distributions.