ppxscal/embedding_network huggingface dataset:
Memory Management Strategies for Data Serving with RDMA
Authors: Dennis Dalessandro, Pete Wyckoff
Venue: Proceedings of the 15th Annual IEEE Symposium on High-Performance Interconnects (2007)

Using remote direct memory access (RDMA) to ship data is becoming a very popular technique in network architectures. As these networks are adopted by the broader computing market, new challenges arise in transitioning existing code to use RDMA APIs. One particular class of applications that map poorly to RDMA are those that act as servers of file data. In order to access file data and send it over the network, an application must copy it to user-space buffers, and the operating system must register those buffers with the network adapter. Ordinary sockets-based networks can achieve higher performance by using the "sendfile" mechanism to avoid copying file data into user-space buffers. In this work we revisit time-honored approaches to sending file data, but adapted to RDMA networks. In particular, both pipelining and sendfile can be used, albeit with modifications to handle memory registration issues. However, memory registration is not wellintegrated in current operating systems, leading to difficulties in adapting the sendfile mechanism. These two techniques make it feasible to create RDMA-based applications that serve file data and still maintain a high level of performance.
A Study of Volatile Information Collection of Computer Forensics System for Computer Emergency Based on Ubiquitous Computing
Authors: Se-Min Oh, Young-Mo Kim, Jae-Hyeok Jang, Byoung-Soo Koh, Yong-Rak Choi
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

In Ubiquitous Computing Environment (UCE), volatile information such as register, cache memory, and network information are hard to make certain of a real-time collection because such volatile information are easily modified or disappeared. Thus, a collection of volatile information is one of important step for computer forensics system on ubiquitous computing. In this paper, we propose a volatile information collection module, which collects variable volatile information of server system based on memory mapping in real-time. In addition, the proposed module ensure the integrity of collected information, thus, the collected information have legal force.
MEMS-Assisted Cryptography for CPI Protection
Authors: Jennifer English, David Coe, Rhonda Gaede, David Hyde, Jeffrey Kulick
Venue: IEEE Security and Privacy (2007)

The authors present a concept for an anti-tamper (AT) system that dynamically generates a cryptographic key derived from microelectromechanical systems (MEMS) arrays encapsulated within a protected system in a single package. The system provides protection in active and passive states with no battery backup.
Automatic Document Logo Detection
Authors: G. Zhu, D. Doermann
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

Automatic logo detection and recognition continues to be of great interest to the document retrieval community as it enables effective identification of the source of a document. In this paper, we propose a new approach to logo detec- tion and extraction in document images that robustly classi- fies and precisely localizes logos using a boosting strategy across multiple image scales. At a coarse scale, a trained Fisher classifier performs initial classification using fea- tures from document context and connected components. Each logo candidate region is further classified at succes- sively finer scales by a cascade of simple classifiers, which allows false alarms to be discarded and the detected region to be refined. Our approach is segmentation free and lay- out independent. We define a meaningful evaluation met- ric to measure the quality of logo detection using labeled groundtruth. We demonstrate the effectiveness of our ap- proach using a large collection of real-world documents.
Effective Service Decision Using Ambient-Based HHMM in Smart Home System
Authors: Jiyong Park, Dohoon Kim, Taek Lee, Hoh Peter In
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

In ubiquitous computing environments, smart home system is the one of major applications that offers appropriate service reacting user's specific activity intelligently. Therefore, in contrast to a traditional system, the intelligent service device in smart home system needs various user data and the information about the environment. However, it is difficult for the device to obtain the information including user's intention sufficiently. Additionally, the system demands the decision making method which provides the proper selection in intelligent devices. In this paper, we propose the smart home system applied situation awareness and the effective decision making method based on the hierarchical hidden Markov model applied to users ambient under the collected user authority and environment information. We demonstrate our approach through a simulation in the smart home system.
Experienced and Accomplishments with Structured Programming
Authors: E. K. Gordon
Venue: Computer (1975)

The two projects described here were developed at aine, Farber & Gordon, Inc. using structured programming, although neither project represents a first attempt on our part at using these techniques. (We began using SP techniques in 1970.) 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
Support Vector Machines with PSO Algorithm for Soil Erosion Evaluation and Prediction
Authors: Dianhui Mao, Zhiyuan Zeng, Cheng Wang, Weihua Lin
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Soil erosion is a very complicated process, and influenced by many correlatively factors, so it is hard to evaluate and predict the condition of soil erosion, especially in those regions where there have not sufficiently observation date. To solve the above problem, this paper proposed a new assessment model based on the support vector machines (SVM), In order to improve the accuracy of the model, the algorithm of particle swarm optimization (PSO) is used to hunt the optimum solution of the parameters \sigma , penalty factor C and \xi-insensitive loss function of SVM. The model is carried out in Shiqiaopu catchment of Hubei province, the results of training and validation have shown that the model has higher forecasting accuracy, compared with the algorithm of BP artificial neural network model. Thus, the model based on SVM provides a new method for evaluating and predicting the condition of soil erosion.
Improved Voltage Selector and Cascade Multiplier Circuits
Authors: A. Nathan, J. Molcho
Venue: IEEE Transactions on Computers (1968)

Abstract Generally applicable accurate diode voltage selectors are described as well as means for the reduction of static errors in cascade multipliers and in multiplier input converters. An analysis of static errors is given.
Fast Human Detection by Boosting Histograms of Oriented Gradients
Authors: Hui-Xing Jia, Yu-Jin Zhang
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

In this paper, a novel real-time human detection system based on Viola's face detection framework and Histograms of Oriented Gradients (HOG) features is presented. Each bin of the histogram is treated as a feature and used as the basic building element of the cascade classifier. The system keeps both the discriminative power of HOG features for human detection and the real-time property of Viola's face detection framework. Experiments on DaimlerChrysler pedestrian benchmark data set and INRIA human database demonstrate that this framework is more powerful than Viola's object detection framework on human detection.
Noise-Direct: A Technique for Power Supply Noise Aware Floorplanning Using Microarchitecture Profiling
Authors: F. Mohamood
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

This paper proposes noise-direct, a design methodology for power integrity aware floorplanning, using microarchitectural feedback to guide module placement. Stringent power constraints have led microprocessor designers to incorporate aggressive power saving techniques such as clock-gating, that place a significant burden on the power delivery network. While the application of extensive clock-gating can effectively reduce power consumption, unfortunately, it can also induce large inductive noise (di/dt), resulting in signal integrity and reliability issues. To combat these problems, processors are usually designed for the worst-case current consumption scenario using adequate supply voltage and decoupling capacitances. To tackle high-frequency inductive noise and potential IR drops, we propose a novel design methodology that integrates microarchitectural profiling feedback into the floorplanning process. We present two microarchitectural metrics to quantify the noise susceptibility of a module:self weighting and correlation weighting. By using these metrics in a force-directed floorplanning algorithm to assign power pin affinity to modules, we can quickly converge to a design for average-case current consumption. By designing for the average-case and employing dynamic di/dt control for the worst-case, we can ensure that a chip is noise-tolerant without exceeding decap budget constraints. Our observations showed that certain functional modules in a processor exhibit consistent and highly correlated switching activity, that can be used to guide module placement distance from power pins. The experimental results demonstrate that the force-directed floorplanning technique can effectively suppress supply noise experienced by modules, reduce the total number of supply-noise margin violations, and achieve a floor-plan with considerably lower IR drop, as compared to a wire-length driven floorplan.
Comparative Study on Foreground Detection Algorithms for Human Detection
Authors: Y. Benezeth, B. Emile, C. Rosenberger
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

The objective of this paper is to develop an approach to objectively evaluate foreground detection algorithms. The purpose of the desired application is human detection in images sequences. This paper presents in a first part the state of the art on foreground detection algorithms. In a second part, we use realistic synthetic videos to perform our evaluation. This kind of videos is very interesting for the evaluation study because it permits to evaluate the influences of some artifacts (changing light, video quality, shadow). We use a common metric to quantify the efficiency of the 11 selected algorithms. Time computation is also considered.
Two-way interactive refinement of segmented medical volumes
Authors: Alberto Signoroni, Riccardo Leonardi
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

For complex medical image segmentation tasks which also require high accuracy, prior information must usually be generated in order to initialize and confine the action of the computational tools. This can be obtained by task oriented specialization layers operating within automatic segmentation techniques or by advanced exploitation of userdata interaction, in this case the segmentation technique can conserve generality and results can be inherently validated by the user itself, in the measure he is allowed to effectively steer the process towards the desired result. In this paper we present a highly accurate and still general morphological 3D segmentation system where rapid convergence to the desired result is guaranteed by a two-way interactive segmentation-refinement loop, where the flow of prior information is inverted (from computing tools to the user) in the refinement phase in order to help the user to quickly select most effective refinement strategies.
Energy-efficient on-demand reprogramming of large-scale sensor networks
Authors: Mark D. Krasniewski, Rajesh Krishna Panta, Saurabh Bagchi, Chin-Lung Yang, William J. Chappell
Venue: ACM Transactions on Sensor Networks (TOSN) (2008)

As sensor networks operate over long periods of deployment in difficult to reach places, their requirements may change or new code may need to be uploaded to them. The current state-of-the-art protocols (Deluge and MNP) for network reprogramming perform the code dissemination in a multihop manner using a three-way handshake where metadata is exchanged prior to code exchange to suppress redundant transmissions. The code image is also pipelined through the network at the granularity of pages. In this article we propose a protocol called Freshet for optimizing the energy for code upload and speeding up the dissemination if multiple sources of code are available. The energy optimization is achieved by equipping each node with limited nonlocal topology information which it uses to determine the time when it can go to sleep since code is not being distributed in its vicinity. The protocol to handle multiple sources provides a loose coupling of nodes to a source and disseminates code in waves each originating at a source with a mechanism to handle collisions when the waves meet. The protocol's performance with respect to reliability, delay, and energy consumed is demonstrated through analysis, simulation, and implementation on the Berkeley mote platform.
Incorporating System Overhead in Queuing Network Models
Authors: P. S. Kritzinger
Venue: IEEE Transactions on Software Engineering (1980)

Multiclass queuing network models of multiprogramming computer systems are frequently used to predict the performance of computing systems as a function of user workload and hardware configuration. This paper examines three different methods for incorporating operating system overhead in multiclass queuing network models. The goal of the resultant model is to provide an accurate account of the processing performance and the system CPU overhead of each of the several different types of jobs (batch, timesharing, transaction processing, etc.) that together make up the multiprogramming workload. The first method introduces an operating sysbtm workload consisting of a fixed number of jobs to represent system CPU overhead processing. The second method extends the jobs' CPU service requests to include explicitly the CPU overhead necessary for system processing. The third method employs a communicating set of user and system job classes so that the CPU overhead can be modeled by switching jobs from user to system class whenever they require system CPU service. The capabilities and accuracy of the three methods are assessed and compared against performance and overhead data measured on a Univac 1110 computer.
Interconnection Networks
Authors: Chuan-lin Wu
Venue: Computer (1981)

Interconnection networks are a natural result of advances in computer technology that brought about demands for improved system performance. As computer systems evolved from the batch-processing models of the 1960's to the time-sharing models of the 1970's, their evolution was basically confined within the von Neumann architectural model, with hardware costs being a significant limiting factor. However, contemporary IC technology is creating an entirely new atmosphere; it is now economically feasible to construct a multiple-processor computer system by interconnecting a large number of off-the-shelf processor and memory modules. In addition, because of today's increased performance requirements, the number of functional modules (homogeneous or heterogeneous) in the multiple-processor system normally keeps rising as the domain of applications grows. Trying to counter this trend presents quite a challenge to computer architects. 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
R70-5 The Effect of IC's on the Design of Analog Computers
Authors: G. Grado
Venue: IEEE Transactions on Computers (1970)

This paper reviews the impact of solid-state technology on the design and implementation of analog computers. Eight figures show the effects of transistors and medium-scale integrated circuits in the various phases of computer development. Basically, the use of integrated circuits is divided into two areas: logic and linear. Logic, or digital, circuits have been used for the control and address selection in the analog computer. Contrary to the author's claim that electromechanical devices used in the 1958 vintage machines were reliable with proper maintenance, transistor control logic was introduced specifically to improve the reliability and speed of the analog computer. (I do not believe that anyone who had to maintain stepping switches would disagree with me.) The introduction of patchable logic combined with the transistor control logic was a big step forward in increasing flexibility for the computer operator. As integrated circuits became practical from the viewpoint of cost per function, the control and patchable logic changed over to integrated circuits with additional features and flexibility. 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
Increasing data-bandwidth to instruction-set extensions through register clustering
Authors: Kingshuk Karuri, Anupam Chattopadhyay, Manuel Hohenauer, Rainer Leupers, Gerd Ascheid, Heinrich Meyr
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

The conflicting requirements of performance and flexibility in today's embedded system market are forcing system designers to use more and more of the so called Configurable or Customizable processor cores. Such processors tend to meet the demanding performance constraints by accommodating application specific Instruction-Set Extensions (ISEs) which have, naturally, become a vital component of current processor customization flows. One major bottleneck in maximizing ISE performance is the limitation on the data-bandwidth between the General Purpose Register(GPR) file and the ISEs. For improved performance, it is desirable to have a large data-bandwidth from the GPRs to ISEs. However, the tight area constraints of modern embedded processors often restrict the GPR I/O of ISEs to save port area of the register files. This paper presents a novel approach to increase the GPR I/O of ISEs without significantly increasing the size of the GPR files. This is achieved by applying the concept of register clustering, common in many VLIW architectures, to single-issue processors with high performance ISEs. Such clustering often causes extra register moves in compiled code. This work also presents an algorithm to minimize such register moves. The benchmark results presented in this paper show that our solution can significantly reduce the area overhead of many-port GPR files without sacrificing the performance improvements through ISEs.
Rough Derivatives in Rough Function Model and Their Application
Authors: Yun Wang, Yanyong Guan, Hongkai Wang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

On the theory and application of rough derivatives in rough function model, the notion of generalized rough functions is defined to improve the definition of higher order rough derivatives Pawlak proposed, and analyze the functional features of roughly derived functions and higher order roughly derived functions. The rough extremum definition of discrete functions is given, Fermat theorem and Rolle theorem of roughly smooth discrete functions are proposed and proved, which complete and perfect the theoretical foundation of rough derivatives application in rough function model. The concepts that are rough monotone and rough convexity of discrete functions are defined. By comparing with the derivative application of real continuous function, a series of theorems are put forward which are the relation theorem of rough derivatives and rough monotone, the two sufficient conditions of rough extrema, the two relation theorems of rough derivatives and rough convexity. Moreover, some new results are achieved such as the sufficient condition of rough smoothing of discrete functions, etc.
Game on: an interview with Seamus Blackley
Authors: Chris Davison
Venue: Computers in Entertainment (CIE) (2008)

Seamus Blackley is head of the Games Department at Creative Artists Agency (CAA), where his role is to define and execute CAA's global strategy for representing many of the world's most respected and successful game creators. Under Blackley's leadership, the Games Department specializes in securing and negotiating game production deals with publishers, financiers, film and television studios, and networks, as well as building and advising development companies to give game designers greater creative and financial control. I interviewed Seamus in December 2007 to discuss physics, social networking, in-game advertising and convergence.
An EBNF grammar for Wiki Creole 1.0
Authors: Martin Junghans, Dirk Riehle, Rama Gurram, Matthias Kaiser, Mario Lopes, Umit Yalcinalp
Venue: ACM SIGWEB Newsletter (2007)

Today's wiki engines are not interoperable. This is an unfortunate consequence of the lack of rigorously specified standards. This technical report presents a complete and validated EBNF-based grammar for Wiki Creole, a community standard for wiki markup. Wiki Creole is also the only standard currently available. Wiki Creole is being specified using prose, leading to inconsistencies and ambiguities. Our grammar uncovered those ambiguities which we fed back into the specification process. The Wiki Creole grammar presented in this report makes the creation of Wiki Creole parsers simple using parser generators, ANTLR in our case. Using a precise specification of wiki markup lets us decouple wiki editors from wiki storage from further wiki processing tools. Based on this decoupling layer we expect innovation on these different parts to proceed independently and at a faster pace than before.
Covering array sampling of input event sequences for automated gui testing
Authors: Xun Yuan, Myra Cohen, Atif M. Memon
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

This paper describes a new automated technique to generate test cases for GUIs by using covering arrays (CAs). The key motivation is to generate long GUI event sequences that are systematically sampled at a particular coverage strength. CAs, to date, have not been effectively used in sampling event driven systems such as GUIs which maintain state. We leverage a "stateless" abstraction of GUIs that allows us to use CAs. Once the CAs have been generated, we reuse the abstractions to reinsert ordering relationships between GUI events, thereby creating executable test cases. A feasibility study on a well-studied GUI-based application shows that the new technique is able to detect a large number of previously undetected faults
The Larch Family of Specification Languages
Authors: J. V. Guttag
Venue: IEEE Software (1985)

Larch specifications are two-tiered. Each one has a component written in an algebraic language and another tailored to a programming language.