ppxscal/embedding_network huggingface dataset:
Adaptive Energy-Aware Design of a Multi-Bank Flash-Memory Storage System
Authors: Yehua Du, Ming Cai, Jinxiang Dong
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

An architectural solution to reducing energy consumption of flash-memory storage system is to take advantage of a multi-bank architecture instead of a single-bank one. Thus, allowing unused banks to be placed into low-power operating modes can help reduce energy. In this paper, an adaptive energy-aware bank assignment policy is proposed to cluster data with temporal affinity into the same bank, increasing the number of banks put into low-power modes. Then we propose an energy-aware garbage collection policy, which could keep banks in idle conditions for long durations of time to compensate for resynchronization penalties. Experiments over the prototype show the effectiveness of these policies and indicate that large energy savings can be achieved with low overhead.
Some Notes on the Linear Complexity of Sidel'nikov-Lempel-Cohn-Eastman Sequences
Authors: Wilfried Meidl, Arne Winterhof
Venue: Designs, Codes and Cryptography (2006)

We continue the study of the linear complexity of binary sequences, independently introduced by Sidel'nikov and Lempel, Cohn, and Eastman. These investigations were originated by Helleseth and Yang and extended by Kyureghyan and Pott. We determine the exact linear complexity of several families of these sequences using well-known results on cyclotomic numbers. Moreover, we prove a general lower bound on the linear complexity profile for all of these sequences.
SCOUT Contextually Organizes User Tasks
Authors: Daby Sow, Maria Ebling, Rene-Pierre Lehmann, John Davis, Lawrence Bergman
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

We explore ways to alleviate the current information explosion with an emphasis on organizing the abundance of legitimate (non-SPAM) emails that typical users receive daily. Our approach is to use information about the tasks implied by email message content along with context information about the environment of the message recipient. We focus on machine generated emails associated with work- flow processes. We validate our approach by presenting the SCOUT portal application. This paper presents an overview of the SCOUT architecture together with results from a pilot user study that we have performed to assess the strengths and weaknesses of this system.
Achieving user-oriented documentation
Authors: Hilda Standley
Venue: ACM SIGDOC Asterisk Journal of Computer Documentation (1976)

The term "user-oriented" is impossible to define in an absolute sense. At best it can be used as a relative measurement, i.e., "something is more user-oriented than something else." I will by-pass any sort of definition -- much has been said already, check lists have been constructed, etc. -- and attempt to bring this idea into some sort of workable focus. How is "it" attained? 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
Simulating a physical distribution system
Authors: Valentine M. Heier, Lorna L. Jones
Venue: ACM SIGSIM Simulation Digest (1978)

Green Giant Company, a major Corporation in the Food Processing Industry, faced a Management problem of whether or not to capitalize a proposal made by the Food Service Division to expand its physical distribution system. This paper briefly describes the Company and the proposed expansion. The paper then describes a simulation model used to evaluate the proposal along with the analysis performed using the results from the model. Finally, the paper explains the decision made by management as a result of this study.
Dynamic Template Generation for Resource Sharing in Control and Data Flow Graphs
Authors: David C. Zaretsky, Gaurav Mittal, Robert P. Dick, Prith Banerjee
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

High-level synthesis compilers often produce reoccurring patterns in intermediate CDFGs during translation. By identifying large reoccurring patterns, one may reduce area and communication overhead by efficiently reusing hardware for multiple operations. This paper presents an algorithm for dynamically generating templates of reoccurring patterns for resource sharing in CDFGs. Results show 40-80% resource reduction using small, incremental template growth, and variations within a 5% margin among varying look-ahead depths.
Study of LSP arrangement schemes in label switch networks
Authors: Yen-Wen Chen
Venue: International Journal of Network Management (2005)

Label switch paths (LSP) are regarded as the routing components of an end-to-end connection in label switching network from the traffic engineering point of view. Thus, an end-to-end connection may travel more than one LSP. The QoS of this end-to-end connection relies on the performance of each LSP it travels. Therefore, to carefully arrange LSP is an essential step towards QoS networks. Generally speaking, the capacity of a specific link is not allocated for high-priority LSP because it will cause inflexibility in the scheduling process. In this paper, the best-fit shortest path (BSP) assignment and the worst shortest path (WSP) assignment schemes are proposed for the arrangement of label switch paths. In order to provide flexibility in packet scheduling, we propose that the BSP scheme to be applied for allocation of low-priority LSP and the WSP scheme is used for the arrangement of LSP with high priority. Based on these two schemes, we extend them with elastic bandwidth allocation to prevent the bandwidth of the link from being occupied by the higher priority LSP. The experimental results indicate that, compared to the BSP-only scheme, the proposed hybrid scheme demonstrates a more efficient way of arranging prioritized LSP. Moreover, the proposed elastic constrained bandwidth allocation scheme also illustrates a rather good performance in smoothing the link utilization of high-priority LSP.
Geometric Shape Effects in Redundant Keys used to Encrypt Data Transformed by Finite Discrete Radon Projections
Authors: Andrew Kingston, Imants Svalbe
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

The Finite discrete Radon Transform (FRT) represents digital data exactly and without redundancy. Redundancy can however be injected into the FRT by reserving part of the image area to be replaced by a key that contains pixels of known, fixed values. The resulting image redundancy can be used to watermark values into the image, or as an encryption key that must be known if the image data is to be recoverable from a subset of transmitted projections. This paper looks at the affect the geometry of the selected key areas has on the interaction between the FRT projections of the key area and those of the data area. A method is proposed to measure this interaction of projected values. Results for simple key geometries are obtained. These give some insight into the design of key shapes that optimise the coupling of projected key and image values.
Geo time information visualization
Authors: Thomas Kapler, William Wright
Venue: Information Visualization (2005)

Analyzing observations over time and geography is a common task, but typically requires multiple, separate tools. The objective of our research has been to develop a method to visualize, and work with, the spatial inter-connectedness of information over time and geography within a single, highly interactive three-dimensional (3-D) view. A novel visualization technique for displaying and tracking events, objects and activities within a combined temporal and geospatial display has been developed. This technique has been implemented as a demonstrable prototype called GeoTime in order to determine potential utility. Capabilities include descriptive events and relationships, association analysis, event aggregation methods and geo-located linked charting. Initial evaluations have been with military users. However, we believe the concept is applicable to a variety of government and business analysis tasks.
Novel Service Oriented Handoffs in Heterogeneous Wireless Networks
Authors: Guangbin Fan, Xuming Lu
Venue: Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (2005)

Future wireless networks will see a combination of 3G WWANs and WLANs, which provide data services at different rates and with different coverages. New handoff management schemes are required in such heterogeneous networks to ensure the continuation of application sessions with low handoff cost. This paper proposes a novel service-oriented vertical handoff scheme between 802.11b (WLAN) and CDMA2000 (3G cellular) which reduces unnecessary handoffs while providing quality-of-service (QoS) support for applications. Different handoff processes will be performed for different service types according to QoS requirements. The analytical and simulation results both show that the proposed scheme greatly improves handoff efficiency, provides a better handoff trigger, and reduces network overhead with low handoff latency.
Denial-of-Service Attack-Detection Techniques
Authors: Glenn Carl, George Kesidis, Richard R. Brooks, Suresh Rai
Venue: IEEE Internet Computing (2006)

Denial-of-service (DoS) detection techniques--such as activity profiling, changepoint detection, and wavelet-based signal analysis--face the considerable challenge of discriminating network-based flooding attacks from sudden increases in legitimate activity or flash events. This survey of techniques and testing results provides insight into our ability to successfully identify DoS flooding attacks. Although each detector shows promise in limited testing, none completely solve the detection problem.Combining various approaches with experienced network operators will most likely produce the best results.
PerfExplorer: A Performance Data Mining Framework For Large-Scale Parallel Computing
Authors: Kevin A. Huck, Allen D. Malony
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

Parallel applications running on high-end computer systems manifest a complexity of performance phenomena. Tools to observe parallel performance attempt to capture these phenomena in measurement datasets rich with information relating multiple performance metrics to execution dynamics and parameters specific to the application-system experiment. However, the potential size of datasets and the need to assimilate results from multiple experiments makes it a daunting challenge to not only process the information, but discover and understand performance insights. In this paper, we present PerfExplorer, a framework for parallel performance data mining and knowledge discovery. The framework architecture enables the development and integration of data mining operations that will be applied to large-scale parallel performance profiles. PerfExplorer operates as a client-server system and is built on a robust parallel performance database (PerfDMF) to access the parallel profiles and save its analysis results. Examples are given demonstrating these techniques for performance analysis of ASCI applications.
Exploiting the structure of the web for spidering
Authors: Thomas Dean
Venue:  (2005)

Published experiments on searching the Web suggest that, given training data in the form of a (relatively) small subgraph of the Web containing a subset of a selected class of target pages, it is possible to conduct a directed search and find additional target pages significantly faster (i.e., with fewer page retrievals) than by performing a blind or uninformed random or systematic search such as depth- or breadth-first. An agent performing such a task is termed a spider. These experiments were carried out in specialized domains or under conditions that are difficult to replicate. We present an experimental framework in which to reexamine and resolve the basic questions in such a way that results can be replicated and built upon. We provide high-performance tools for building experimental spiders and make use of the ground truth and static nature of the WT10g TREC Web Corpus. We leverage powerful machine learning techniques within this experimental framework to learn regressions on discounted reward and navigational distance and apply these regressions to the problem of spidering. Experimental results on TREC 2001 Web ad hoc tasks show significant performance gains over blind and systematic search techniques.
Affective Aware Museum Guide
Authors: Kuderna-Iulian Benta
Venue: Proceedings of the IEEE International Workshop on Wireless and Mobile Technologies in Education (2005)

The experience of visiting an art museum is more valuable if we are guided properly. We took into consideration the affective aspects of this guidance in order to model and implement a personal affectiveand context-aware electronic guide. As the emotional states experienced by the visitors are very different and diverse, we propose considering engagement as an indirect measure of the emotion intensity felt by the visitor. We examine three levels of engagement: unengaged (detached), engage-able, and engaged. The next step is to respond to the different categories of engagement in order to scaffold the visitor to the highest level of engagement that is, for a beginner, the engagement with the artistic part using appropriate recommendation, because our aim is to help the visitors to learn more about the painting and art in a mobile manner.
Developing and Sustaining Information Assurance: The Role of Community Colleges (Part 1)
Authors: Pinny Sheoran, Oris Friesen, Barbara J. Huffman de Belon
Venue: IEEE Security and Privacy (2005)

To help address the ongoing need for security training, several US community colleges have stepped up to develop academic programs over the past several years.This article presents the case for IA training at that level, setting the stage for further examination of the particular challenges that it entails.
A provably good algorithm for high performance bus routing
Authors: M. M. Ozdal, M. D. F. Wong
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

As the clock frequencies used in industrial applications increase, the timing requirements on routing problems become tighter, and current routing tools can not successfully handle these constraints any more. We focus on the high-performance single-layer bus routing problem, where the objective is to match the lengths of all nets belonging to each bus. An effective approach to solve this problem is to allocate extra routing resources around short nets during routing; and use those resources for length extension afterwards. We first propose a provably optimal algorithm for routing nets with min-area max-length constraints. Then, we extend this algorithm to the case where minimum constraints are given as exact length bounds. We also prove that this algorithm is optimal within a constant factor. Both algorithms proposed are also shown to be scalable for large circuits, since the respective time complexities are O(A) and O(A log A), where A is the area of the intermediate region between chips.
Scalable partitioning-driven algorithms for solving complex and emerging problems in vlsi physical design automation
Authors: George Karypis
Venue:  (2005)

This dissertation presents a number of extensions and applications of multilevel hypergraph-partitioning algorithms for solving some of the emerging, as well as the existing complex problems in the physical-design-automation phase of electronic circuit fabrication. The technology used in electronic circuit fabrication evolves very rapidly, and as a result, it presents a number of challenges in automating the tasks involved. The key challenges are in (i) devising scalable algorithms to handle exponentially increasing design sizes, (ii) devising new algorithms to effectively counter undesirable but inevitable effects associated with the shrinking geometries of electronic circuit manufacturing technologies, and (iii) devising algorithms to solve new problems that arise because of the evolving architectures of pre-fabricated chips, such as FPGAs. This dissertation advocates the use of multilevel hypergraph-partitioning algorithms, as the underlying tools to accommodate scalability requirements because of their availability, near-linear scalability and other desirable properties, such as cut quality of the solutions generated and run time. This dissertation identifies two new partitioning problems; minimizing maximum subdomain degree and cut of k-way partitioning and multi-resource aware partitioning, and proposes effective algorithms for solving them. In addition, this dissertation enhances the primary application of partitioning&mdash;placement&mdash;by proposing two inventions, namely &ldquo;bounding box aware terminal propagation&rdquo; and &ldquo;perimeter-degree&rdquo;. These are used for improving the accuracy of the objective minimized in partitioning-driven placement methods and for identifying congestion prone clusters in multilevel placement algorithms, respectively.
On the Nonnormality of Subiteration for a Fluid-Structure-Interaction Problem
Authors: E. H. van Brummelen, R. de Borst
Venue: SIAM Journal on Scientific Computing (2005)

Subiteration forms the basic iterative method for solving the aggregated equations in fluid-structure-interaction problems, in which the fluid and structure equations are solved alternatingly subject to complementary partitions of the interface conditions. In the present work we establish for a prototypical model problem that the subiteration method can be characterized by recursion of a nonnormal operator. This implies that the method typically converges nonmonotonously. Despite formal stability, divergence can occur before asymptotic convergence sets in. It is shown that the transient divergence can amplify the initial error by many orders of magnitude, thus inducing a severe degradation in the robustness and efficiency of the subiteration method. Auxiliary results concern the dependence of the stability and convergence of the subiteration method on the physical parameters in the problem and on the computational time step.
A Clustering Approach to Wireless Network Intrusion Detection
Authors: Shi Zhong, Taghi M. Khoshgoftaar, Shyarn V. Nath
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

Intrusion detection in wireless networks has become an indispensable component of any useful wireless networksecurity systems, and has recently gained attention in both research and industry communities due to widespread use of Wireless Local Area Networks (WLANs). This paper focuses on detecting intrusions or anomalous behaviors in WLANs with data clustering techniques. We first explore the security vulnerabilities of 802.11 or WI-FI networks and summarize the network traffic metrics that are important to model the security of wireless networks. Based on the metric studied we propose a clustering-based intrusion detection approach and evaluate it on a real-world large wireless network traffic dataset. The evaluation results demonstrate the eflectiveness of our proposed intrusion detection approach for wireless networks.
A Learning Approach to Discovering Web Page Semantic Structures
Authors: Junlan Feng, Patrick Haffner, Mazin Gilbert
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

This paper proposes a learning approach for discovering the semantic structure of web pages. The task includes partitioning the text on a web page into information blocks and identifying their semantic categories. We employed two machine learning techniques, Adaboost and SVMs, to learn from a labeled web page corpus. We evaluated our approach on general web pages from the World Wide Web and obtained encouraging results. This work can be beneficial to a number of web-driven applications such as search engines, web-based question answering, web-based data mining as well as voice enabled web navigation.
Effective mobility in FinFET structures with HfO2 and SiON gate dielectrics and TaN gate electrode
Authors: T. Rudenko, N. Collaert, S. De Gendt, V. Kilchytska, M. Jurczak, D. Flandre
Venue: Microelectronic Engineering (2005)

In this work, the effective mobility in n-and p-channel FinFETS with silicon oxynitride and HfO2 gate dielectrics and TaN gate electrode is studied as a function of the inversion charge density using a split C-V technique. The mobility behavior in narrow-fin devices is compared to that in quasi-planar wide-fin devices, and the mechanisms responsible for the observed differences are discussed. The devices with HfO2 and silicon oxynitride gate dielectrics exhibit similar mobility behavior.
Hybrid static-dynamic attacks against software protection mechanisms
Authors: Matias Madou, Bertrand Anckaert, Bjorn De Sutter, Koen De Bosschere
Venue: Proceedings of the 5th ACM workshop on Digital rights management (2005)

Advances in reverse engineering and program analyses have made software extremely vulnerable to malicious host attacks. These attacks typically take the form of intellectual property violations, against which the software needs to be protected. The intellectual property that needs to be protected can take on different forms. The software might, e.g., consist itself of proprietary algorithms and datastructures or it could provide controlled access to copyrighted material. Therefore, in recent years, a number of techniques have been explored to protect software. Many of these techniques provide a reasonable level of security against static-only attacks. Many of them however fail to address the problem of dynamic or hybrid static-dynamic attacks. While this type of attack is already commonly used by black-hats, this is one of the first scientific papers to discuss the potential of these attacks through which an attacker can analyze, control and modify a program extensively. The concepts are illustrated through a case study of a recently proposed algorithm for software watermarking [6].
Model Checking Real-Time Component Based Systems with Blackbox Testing
Authors: Dang Van Hung, Bui Vu Anh
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

In this paper we propose a simple model for component based real-time systems using duration automata. For this simple model we propose an algorithm for solving the emptiness problem using black-box testing for components which is in the same complexity class as for solving the emptiness problem for untimed component based systems. Furthermore, the verification of behavioural real-time properties in this model can be done with techniques from Duration Calculus.
Conversion Time Analysis of Time Domain Digital Pixel Sensor in Uniform and Non-Uniform Quantizers, invited
Authors: Amine Bermak
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

This paper analyzes the conversion time of a time domain digital pixel sensor based on pulse width modulation scheme. Two quantization schemes are studied namely the Uniform Time domain (UQ) and the Non Uniform Time domain (NUQ) quantizers. It is shown that the latter scheme not only permits to linearize the non-liner response of a PWM vision sensor but also allows to significantly speed-up the conversion time particularly for wide dynamic range and lower coding resolution. The VLSI architecture of a reconfigurable DPS for variable spatial and coding resolutions is proposed in 1-poly, 5 metal CMOS 0.35µm n-well process.