ppxscal/embedding_network huggingface dataset:
Distributed Cooperative Control for Adaptive Performance Management
Authors: Mianyu Wang, Nagarajan Kandasamy, Allon Guez, Moshe Kam
Venue: IEEE Internet Computing (2007)

The authors' distributed cooperative-control framework uses concepts from optimal control theory to adaptively manage theperformance ofcomputer clusters operating in dynamic and uncertain environments. Decomposing the overall performance-management probleminto smaller sub problems that individual controllers solve cooperatively allows for the scalable control of large computing systems. Theframework also adapts to controller failures and allows for the dynamic addition and removal of controllers during system operation. Thisarticle presents a case study showing how to manage the dynamic power consumed by a computer cluster processing a time varying Webworkload.
Direction-of-arrival estimation from incomplete data
Authors: E. Larsson
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

We consider the problem of estimating the direction-of-arrival (DOA) of one or more signals using an array of sensors, where some of the sensors fail to work before the measurement is completed. Methods for estimating the array output covariance matrix are discussed and used for DOA estimation together with the MUSIC algorithm and with a covariance matching technique. In contrast to MUSIC, the covariance matching technique can utilize information on the estimation accuracy of the array covariance matrix, and it is shown that this can yield a significant performance gain.
Towards an efficient assertion based verification of SystemC designs
Authors: A. Habibi, S. Tahar
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2004. Ninth IEEE International (2004)

In this paper, we present an approach to verify efficiently assertions added on top of the SystemC library and based on the property specification language (PSL). In order to improve the assertion coverage, we also propose an approach based on both static code analysis and genetic algorithms. Static code analysis will help generate a dependency relation between inputs and assertion parameters as well as define the ranges of inputs affecting the assertion. The genetic algorithm will optimize the test generation to get more efficient coverage of the assertion. Experimental results illustrate the efficiency of our approach compared to random simulation.
An Alternative Solution Initiative to Problematic of Computer Science Security of Virus and Malware with Experimentation of Firewalls and Antivirus
Authors: Jorge Alberto Ruiz-Vanoye, Ocotlan Diaz-Parra, Alejandro Fuentes Penna, Jorge Omar Ceyca Castro, Juan Carlos Olivares-Rojas
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2007)

Exist in the computer science market a great amount of antivirus, the election of one of them depends on the company. But truely they are necessary, or with a tool we can be protected of the virus and the accesses no authorized our computer. In this document one sets out to demonstrate that firewall personal formed good will protect to us of the intruders and the virus.
A protected division algorithm
Authors: Marc Joye, Karine Villegas
Venue: Proceedings of the 5th conference on Smart Card Research and Advanced Application Conference - Volume 5 (2002)

Side-channel analysis is a powerful tool for retrieving secrets embedded in cryptographic devices such as smart cards. Although several practical solutions have been proposed to prevent the leakage of sensitive data, mainly the protection of the basic cryptographic operation itself has been thoroughly investigated. For example, for exponentiation-based cryptosystems (including RSA, DH or DSA), various exponentiation algorithms protected against side-channel analysis are known. However, the exponentiation algorithm itself or the underlying crypto-algorithm often involve division operations (for computing a quotient or a remainder). The first case appears in the normalization (resp. denormalization) process in fast exponentiation algorithms and the second case appears in the data processing before (resp. after) the call to the exponentiation operation. This paper proposes an efficient division algorithm protected against simple side-channel analysis. The proposed algorithm applies equally well to software and hardware implementations. Furthermore, it does not impact the running time nor the memory requirements.
Fusion of color and edge information for improved segmentation and edge linking
Authors: E. Saber
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

We propose a new method for combined color image segmentation and edge linking. The image is first segmented based on color information only. The segmentation map is modeled by a Gibbs random field, to ensure formation of spatially contiguous regions. Next, spatial edge locations are determined using the magnitude of the gradient of the 3-channel image vector field. Finally, regions in the segmentation map are split and merged by a region-labeling procedure to enforce their consistency with the edge map. The boundaries of the final segmentation map constitute a linked edge map. Experimental results are reported.
Peak current estimation for digital filters
Authors: S. Bobba
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

Estimates of the peak power dissipation and the peak current are required in the design of reliable VLSI circuits. The peak current current drawn by a digital filter is dependent on the filter coefficients and the inputs to the multipliers in the filter. This input dependence makes the estimation of peak current for a digital filter a hard problem. We present a technique to estimate the maximum current drawn by a digital filter. The approach consists of: (1) building peak current macro-models for multipliers in terms of the input data transitions and the coefficient, and (2) using these models in a graph based formulation for finding the peak current of the digital filter. The peak current macro-models for multipliers are validated by comparisons with SPICE simulations. We also present the application of the technique for estimating the peak current of digital filters in a 51.84 Mb/s 16-CAP receiver.
Selecting V&V Technology Combinations: How to Pick a Winner?
Authors: Paul Strooper, Margaret A. Wojcicki
Venue: Proceedings of the 12th IEEE International Conference on Engineering Complex Computer Systems (2007)

Numerous software verification and validation (V&V) techniques and tools exist to analyse requirements, designs and implementations of software systems. These V&V technologies range from relatively lightweight ones, such as inspection and testing, to more heavyweight technologies based on formal methods and theorem proving. For complex systems, a significant part of the cost and effort for development and maintenance is associated with V&V activities, and this almost always involves selecting and applying a mix of V&V technologies. Unfortunately, little is known about the cost-effectiveness of individual technologies or how to derive the most cost-effective combination. As such, combinations for particular projects are typically selected in an ad-hoc way. In this paper, several issues related to the selection and evaluation of combinations of V&V technologies are explored, based on personal experiences with the V&V of concurrent Java components. A V&V method is presented that was systematically derived through an analysis of the possible failures that can occur in concurrent Java components. This method combines inspection, static analysis, and dynamic testing. In addition, empirical methods that use analysis of fault data and experiments to evaluate V&V combinations are presented. Finally, ideas are presented for an iterative method that can be used to assist with both the selection and evaluation of cost-effective V&V combinations in a given context.
Testing Dynamic Adaptation in Distributed Systems
Authors: Karun N. Biyani, Sandeep S. Kulkarni
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Many software systems undergo dynamic adaptation in response to change in requirements or frequent changes in their usage context. Before adaptation, the system satisfies the behavior of the old program (i.e., program before adaptation), and after adaptation the system satisfies the behavior of the new program (i.e., program after adaptation). During adaptation, the behavior of the old program and the behavior of the new program may overlap. Existing algorithms to test distributed systems do not deal with adaptive systems. In this paper, we discuss testing of system during adaptation using predicate detection techniques.
Massively distributed systems: design issues and challenges
Authors: Dan Nessett
Venue: Proceedings of the Workshop on Embedded Systems on Workshop on Embedded Systems (1999)

The forty year trend in the computing industry is away from centralized, high unit cost, low unit volume products toward distributed, low unit cost, high unit volume products. The next step in this process is the emergence of massively distributed systems. These systems will penetrate even more deeply into the fabric of society and become the information power grids of the 21st century. They will be ubiquitous. Most will operate outside the normal cognizance of the people they serve and most will be based on embedded systems that present non-traditional computing interfaces to their users. They will be engineered to operate as distributed utilities, much like the energy, water, transportation and media broadcast businesses do today. The first deployment of massively distributed systems is likely to occur as support structures for these industries. Massively distributed systems will differ from existing distributed systems in important ways. Such systems eventually will interconnect billions of nodes. This will necessitate changes in the way nodes interact with one another. One-to-many communications will be the norm, rather than one-to-one. The size of on-line application communities will necessitate the use of statistically correct rather than deterministic algorithms for resource accounting, fault detection and correction, and system management. These communities will coalesce and dissolve rapidly in order to host events that are of interest to groups formed specifically for this purpose. This will require new approaches to naming, routing, security and privacy, resource management and synchronization. Heterogeneity will be even more of a factor in the design, implementation and operation of massively distributed systems. This paper explores the nature and characteristics of massively distributed systems by proposing some examples and then using them to characterize nine major design issues. Seven of these are drawn from seminal work in the area of distributed systems. Two others are based on experience in distributed system design and implementation subsequent to that work.
Project E-96-experiences from the process of implementing of a new curriculum for electrical engineering
Authors: K. O. Jeppso
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

We present experiences from the process of implementing a new electrical engineering curriculum at Chalmers University of Technology. The reform was the result of our participation in two curriculum evaluations, one international (European) and one national (Swedish). Features of the new curriculum are flexibility and variation, indicating a high degree of freedom for students to use elective courses to compose individual profiles focusing either on breadth or depth. 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
Quantitative method for modeling context in concatenative synthesis using large speech database
Authors: W. Hamza
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

Modeling phonetic context is one of the key points to get natural sounding in concatenativc speech synthesis. In this paper, a new quantitative method to model context is proposed. In the proposed method, the context is measured as the distance between leafs of the top-down likelihood-based decision trees that have been grown during the construction of acoustic inventory. Unlike other context modeling methods, this method allows the unit selection algorithm to borrow unit occurrences from other contexts when their context distances are close. This is done by incorporating the measured distance as an element in the unit selection cost function. The motivation behind this method is that it reduces the required speech modification by using better unit occurrences from near context. This method also makes it easy to use long synthesis units, e.g. syllables or words, in the same unit selection framework.
Detecting Obfuscated Viruses Using Cosine Similarity Analysis
Authors: Abhishek Karnik, Suchandra Goswami, Ratan Guha
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

Virus writers are getting smarter by the day. They are coming up with new, innovative ways to evade signature detection by anti-virus software. One such evasion technique used by polymorphic and metamorphic viruses is their ability to morph code so that signature based detection techniques fail. These viruses change form such that every new infected file has different strings, rendering string based signature detection practically useless against such viruses. Our work is based on the premise that given a variant of morphed code, we can detect any obfuscated version of this code with high probability using some simple statistical techniques. We use the cosine similarity function to compare two files based on static analysis of the portable executable (PE) format. Our results show that for certain evasion techniques, it is possible to identify polymorphic/metamorphic versions of files based on cosine similarity.
Multiplex conversations afforded by technology
Authors: Therese Ornberg Berglund
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This article presents results from a small-scale pilot study investigating linguistic production and structural patterns while multitasking and interrelating these findings with communicative context (Field, Tenor and Mode). The explorative microanalysis shows that whereas the language used by the informant seems to be influenced by all three contextual variables, Field, Tenor and Mode, the navigation between channels in this specific multiplex communication situation strongly correlates to the affordances of the Mode of conversation and more specifically to the ways in which the informant receives indications that her reply is requested. The article includes design considerations and a discussion concerning methodology and ethics. This study and the findings presented here are considered a first building block in constructing a theory for explaining communicative choices when multitasking.
Book Review: Grid Technology Concepts from A to Z
Authors: Milan Lathia
Venue: IEEE Distributed Systems Online (2006)

A review of The Grid: Core Technologies by Maozhen Li and Mark Baker
Understanding CIO Role Effectiveness: The Antecedents and Consequents
Authors: Daniel Q. Chen, David S. Preston
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This research-in-progress paper describes the development of a research model exploring the antecedents and consequents of CIO role effectiveness. Specifically, we argue that CIO managerial discretion (the latitude of actions available to CIOs), CIO capability (business knowledge, IT knowledge, political savvy, and communication skill), and CIO/CEO shared understanding of IT role in the organization are important antecedents of CIO role effectiveness. In addition, we posit that an effective CIO will increase the contribution of IS function to the firm in terms of strategic, operational and financial impacts. The paper also outlines a proposed CIO/CEO matched-pair field survey method to test the research model.
An Efficient Code Generation Algorithm for Non-orthogonal DSP Architecture
Authors: Yi-Hsuan Lee, Cheng Chen
Venue: Journal of VLSI Signal Processing Systems (2007)

To meet strict speed and power requirements for embedded applications, many high-end digital Signal Processors (DSPs) commonly employ non-orthogonal architectures that are typically characterized by irregular data paths, heterogeneous registers, and multiple memory banks. Obviously to harvest the benefits provided by this non-orthogonal architecture sufficient compiler support is necessary and important. However, the complexity of such architectures presents a great challenge to compiler design and the usual compilation techniques for general-purpose CPUs do not adapt well to the irregularity of DSP. The entire code generation process must include the following phases: intermediate representation, code compaction, instruction scheduling, memory bank assignment (or variable partition), and register/accumulator assignment. Much related research only considers some phases, which is inadequate. In this paper, we present an effective code generation algorithm named Rotation Scheduling with Spill Codes Predicting (RSSP) to maximally exploit the benefits of non-orthogonal architectures. It contains six parts that cover almost the entire phases of the code generation process. As well as introducing the detailed principles and algorithms of the proposed RSSP, we use an analytic model to evaluate its preliminary performance. Evaluation results clearly demonstrate the effectiveness of the proposed method. Furthermore, we also present some preliminary ideas to generalize RSSP, which can make it more practicable and suit various DSPs with similar architectural features.
Tagging data in the network stack: mbuf_tags
Authors: Angelos D. Keromytis
Venue: Proceedings of the BSD Conference 2003 on BSD Conference (2003)

We describe the mbuf_tag API, a mechanism for tagging data as they flow through the network stack. Originally introduced in OpenBSD, mbuf_tags were initially intended for use by the IPsec stack. The API has matured enough to be used by several other kernel components, and formed the basis for the FreeBSD mbuf_tags. We present the API, discuss its various uses in the OpenBSD network stack, and describe some plans for future work. Our goal is to demonstrate the flexibility of this relatively simple mechanism and expose it to other kernel developers.
Approximate Covering Detection among Content-Based Subscriptions Using Space Filling Curves
Authors: Zhenhui Shen, Srikanta Tirthapura
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems (2007)

We consider a problem that arises during the propagation of subscriptions in a content-based publish-subscribe system. Subscription covering is a promising optimization that reduces the number of subscriptions propagated, and hence, the size of routing tables in a content-based publishsubscribe system. However, detecting covering relationships among subscriptions can be an expensive computational task that potentially reduces the utility of covering as an optimization. We introduce an alternate approach approximate subscription covering, which provide much of the benefits of subscription covering at a fraction of its cost. By forgoing an exhaustive search for covering subscriptions in favor of an approximate search, it is shown that the time complexity of covering detection can be dramatically reduced. The trade off between efficiency of covering detection and the approximation error is demonstrated through the analysis of indexes for multi-attribute subscriptions based on space filling curves.
Uniformity by Construction in the Analysis of Nondeterministic Stochastic Systems
Authors: Holger Hermanns, Sven Johr
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

Continuous-time Markov decision processes (CTMDPs) are behavioral models with continuous-time, nondeterminism and memoryless stochastics. Recently, an efficient timed reachability algorithm for CTMDPs has been presented [2], allowing one to quantify, e. g., the worst-case probability to hit an unsafe system state within a safety critical mission time. This algorithm works only for uniform CTMDPs -- CTMDPs in which the sojourn time distribution is unique across all states. In this paper we develop a compositional theory for generating CTMDPs which are uniform by construction. To analyze the scalability of the method, this theory is applied to the construction of a fault-tolerant workstation cluster example, and experimentally evaluated using an innovative implementation of the timed reachability algorithm. All previous attempts to model-check this seemingly well-studied example needed to ignore the presence of nondeterminism, because of lacking support for modelling and analysis.
Co-channel interference cancellation for HDTV receivers
Authors: M. Ghosh
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

A new method of co-channel interference rejection for digital television receivers is presented that uses a different rejection filter from the comb filter that was used in the prototype built by Zenith. This filter is optimized for rejection of co-channel NTSC interference in the presence of white noise and hence suffers a penalty of only 0.4 dB in AWGN as compared to 3.5 dB with the comb. The receiver structure with this filter, including required equalizer and trellis decoder modifications is presented, along with simulation results showing the improvement in performance in co-channel-plus-AWGN interference and hence in coverage area. 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
Graduate Digital Forensics Education at the Air Force Institute of Technology
Authors: G. L. Peterson, R. A. Raines, R. O. Baldwin
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The Department of Electrical and Computer Engineering (AFIT/ENG) at the Air Force Institute of Technology (AFIT), currently offers a graduate-level introductory course in digital forensics. Students are introduced and exposed to several challenges and topics in the digital forensics course. The course addresses the ethical and legal procedures as well as basic forensic science principles in only the most general manner. A larger percentage of lecture and lab time is spent discussing the technical details of incident response and media analysis. The detail into the network forensics and digital device analysis topics start to breach technical details but not to the level of attempting mastery. This course provides our students with real world digital forensics experience to prepare them for the challenges they may face in post-graduate employment.