ppxscal/embedding_network huggingface dataset:
A cache-based internet protocol address lookup architecture
Authors: Soraya Kasnavi, Paul Berube, Vincent Gaudet, José Nelson Amaral
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

This paper proposes a novel Internet Protocol (IP) packet forwarding architecture for IP routers. This architecture is comprised of a non-blocking Multizone Pipelined Cache (MPC) and of a hardware-supported IP routing lookup method. The paper also describes a method for expansion-free software lookups. The MPC achieves lower miss rates than those reported in the literature. The MPC uses a two-stage pipeline for a half-prefix/half-full address IP cache that results in lower activity than conventional caches. MPC's updating technique allows the IP routing lookup mechanism to freely decide when and how to issue update requests. The effective miss penalty of the MPC is reduced by using a small non-blocking buffer. This design caches prefixes but requires significantly less expansion of the routing table than conventional prefix caches. The hardware-based IP lookup mechanism uses a Ternary Content Addressable Memory (TCAM) with a novel Hardware-based Longest Prefix Matching (HLPM) method. HLPM has lower signaling activity in order to process short matching prefixes as compared to alternative designs. HLPM has a simple solution to determine the longest matching prefix and requires a single write for table updates.
A Danger Theory Inspired Multi-agent Fusion Model for Network Security Assessment
Authors: ZhenYu Zhou, JianJing Shen, XinPeng Zhang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

This paper presents a Danger Theory inspired multi-agent fusion model. Danger Theory is a relative new research subject in Artificial Immune System (AIS). It presents new viewpoint and explains some problems in traditional immune theory. This paper describes the principle of Danger Theory, analyzes the differences between it and traditional theory, and also constructs a multi-agent fusion model for network security assessment. It apply the concepts of Danger Theory to fusion model, such as danger signal, danger zone and Antigen Presenting Cells (APC), which are benefit for multi-agent fusion model. An example is presented to illustrate the operation process of the fusion model.
Jumble: A Hardware-in-the-Loop Simulation System for JHDL
Authors: David Castells-Rufas, Jordi Carrabina
Venue: Proceedings of the 15th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (2007)

This paper presents a new verification system for FPGA based designs described in the JHDL hardware description language. The method consists of performing hardware emulation of designer selected blocks in a co-simulation environment. Although JHDL has a Hardware execution mode it does not provide a fine control of which blocks have to be executed in Hardware and it is based on Xilinx readback technology. In this paper we present a method to extend the simulation environment to add a fine control of the Hardware emulation system, a method to instrument the design for debug, and the process that automatically creates the interface to communicate the simulator with the emulated hardware block. The resulting system does not offer 100% observability and controllability of hardware blocks. Nevertheless its interactivity provides a solid basis for incremental verification while offering the possibility of substantial simulation speedups.
Classification tree analysis using TARGET
Authors: J. Brian Gray, Guangzhe Fan
Venue: Computational Statistics Data Analysis (2008)

Tree models are valuable tools for predictive modeling and data mining. Traditional tree-growing methodologies such as CART are known to suffer from problems including greediness, instability, and bias in split rule selection. Alternative tree methods, including Bayesian CART (Chipman et al., 1998; Denison et al., 1998), random forests (Breiman, 2001a), bootstrap bumping (Tibshirani and Knight, 1999), QUEST (Loh and Shih, 1997), and CRUISE (Kim and Loh, 2001), have been proposed to resolve these issues from various aspects, but each has its own drawbacks. Gray and Fan (2003) described a genetic algorithm approach to constructing decision trees called tree analysis with randomly generated and evolved trees (TARGET) that performs a better search of the tree model space and largely resolves the problems with current tree modeling techniques. Utilizing the Bayesian information criterion (BIC), Fan and Gray (2005) developed a version of TARGET for regression tree analysis. In this article, we consider the construction of classification trees using TARGET. We modify the BIC to handle a categorical response variable, but we also adjust its penalty component to better account for the model complexity of TARGET. We also incorporate the option of splitting rules based on linear combinations of two or three variables in TARGET, which greatly improves the prediction accuracy of TARGET trees. Comparisons of TARGET to existing methods, using simulated and real data sets, indicate that TARGET has advantages over these other approaches.
Formal Specification and Verification of Distributed Systems
Authors: Bo-Shoe Chen
Venue: IEEE Transactions on Software Engineering (1983)

Computations of distributed systems are extremely difficult to specify and verify using traditional techniques because the systems are inherently concurrent, asynchronous, and nondeterministic. Furthermore, computing nodes in a distributed system may be highly independent of each other, and the entire system may lack an accurate global clock.
The Complexity of Polynomial-Time Approximation
Authors: Liming Cai, Michael Fellows, David Juedes, Frances Rosamond
Venue: Theory of Computing Systems (2007)

In 1996 Khanna and Motwani proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental problems might provide insight into characterizing the class of optimization problems that admit a polynomial-time approximation scheme (PTAS). The main contribution of this paper is to explore this program from the point of view of parameterized complexity. Problems of optimization are naturally parameterized by the parameter k = 1/¿. An optimization problem admits a PTAS if and only if there is an algorithm ¿, that, given an input of size n, and a parameter value k = 1/¿, produces a solution that is within a multiplicative factor of (1+ ¿) of optimal, in a running time that is polynomial for every fixed value of ¿. This definition admits the possibility that the degree of the polynomial that bounds the running time of ¿ may increase, even quite dramatically, as a function of k = 1/¿. In fact, amongst the PTASs that are currently known, for an error of 20%, polynomial-time bounds no better than O(n2000) are quite common. Viewing k = 1/¿ as a problem parameter, in the sense of parameterized complexity, leads naturally to the question of whether an efficient PTAS (EPTAS) might be possible for a given optimization problem. An EPTAS is simply a fixed-parameter tractable algorithm with respect to this parameter. We offer a number of results concerning the problems Planar TMIN, Planar TMAX and Planar MPSAT defined by Khanna and Motwani: (1) We show that each of these problems of approximation, naturally parameterized by k = 1/¿, is hard for W[1], and thus it is highly unlikely that they admit EPTASs. (One could also interpret this as indicating that PTASs for these problems are unlikely to be a useful way of coping with intractability in the sense of Garey and Johnson.) (2) We show that there are EPTASs for some subproblems described by syntactic restrictions, and establish some limits on how far these positive results can be extended.
Research in Design Automation for VLSI Layout
Authors: Tokinori Kozawa, Hidekazu Terai
Venue: IEEE Design Test (1985)

Since Japanese R&D efforts began in the late 1960s, advances in LSI circuit design automation have made possible the designof custom logic VLSI circuits with up to 10,000 gates. Automatic placement and routing programs have become essential DA toolsin both master-slice LSI circuit design, and the custom design of VLSI circuits with up to 100,000 gates. Algorithms for VLSIDA systems include automatic floor planning, automatic cell placement, and automatic routing. Hierarchical design is an efficientapproach to the layour of huge numbers of transistors; a VLSI circuit with 74,000 transistors and 17,000 gates was designedusing such an approach. The layout design effort required less than 10 man-months, and the chip was fabricated with no erroron the first design.
Teaching programming using visualization
Authors: Andrew Rudder, Margaret Bernard, Shareeda Mohammed
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

Teaching computer programming to young students is a major challenge. This paper describes a web-based course for teaching programming using visualization and a gaming theme. Concepts are taught using real world examples that the target students can identify with; in this way some of the problems related to understanding abstract concepts are alleviated and learning occurs in context. The full range of multimedia technology including animation, sound and video are used to immerse the student in an environment where learning is fun and visual display of the concepts reinforce learning. A gaming theme is used for formative assessment. Students are provided with 'game' activities such as "spot the error", "predict the output" and "put in order". These enhance critical thinking. They test comprehension and knowledge as well as higher order thinking skills.
Crayon lighting: sketch-guided illumination of models
Authors: Amit Shesh, Baoquan Chen
Venue: Proceedings of the 5th international conference on Computer graphics and interactive techniques in Australia and Southeast Asia (2007)

An interactive and intuitive way of designing lighting around a model is desirable in many applications. In this paper, we present a tool for interactive inverse lighting in which a model is rendered based on sketched lighting effects. To specify target lighting, the user freely sketches bright and dark regions on the model as if coloring it with crayons. Using these hints and the geometry of the model, the system efficiently derives light positions, directions, intensities and spot angles, assuming a local point-light based illumination model. As the system also minimizes changes from the previous specifications, lighting can be designed incrementally. We formulate the inverse lighting problem as that of an optimization and solve it using a judicious mix of greedy and minimization methods. We also map expensive calculations of the optimization to graphics hardware to make the process fast and interactive. Our tool can be used to augment larger systems that use point-light based illumination models but lack intuitive interfaces for lighting design, and also in conjunction with applications like ray tracing where interactive lighting design is difficult to achieve.
The Use of Floating-Point and Interval Arithmetic in the Computation of Error Bounds
Authors: D. W. Lozier
Venue: IEEE Transactions on Computers (1983)

Three forms of interval floating-point arithmetic are defined in terms of absolute precision, relative precision, and combined absolute and relative precision. The absolute-precision form corresponds to the centered form of conventional rounded-interval arithmetic. The three forms are compared on the basis of the number of floating-point operations needed to generate error bounds for inner-product accumulation.
Bearing Localized Fault Detection Based on Hilbert-Huang Transformation
Authors: Hui Li, Yuping Zhang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

The Hilbert-Huang transform and its marginal spectrum are applied to bearing fault diagnosis of ball bearing. The principle of Empirical mode decomposition (EMD), Hilbert-Huang transformation (HHT) and marginal spectrum is introduced. Firstly, the vibration signals of bearing fault are separated into several intrinsic mode functions (IMFs) using EMD method. Secondly, the marginal spectrum of each IMF is calculated. In the end, according to the marginal spectrum, the localized fault in a ball bearing can be detected and faults patterns can be identified. The experimental results show that the proposed method can provide not only an increase in the spectral resolution but also reliability for the faults diagnosis of ball bearing.
Concerned About Present or Future EDP Needs
Authors: L. Amdahl
Venue: Computer (1972)

Bring your data processing problems to the 1972 Spring Joint Computer Conference. Whether it's hardware or software, personnel or performance, management or marketing, you'll leave Atlantic City with new information, insights, ideas. 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
Metaphors of human thinking for usability inspection and design
Authors: Erik Frøkjær, Kasper Hornbæk
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2008)

Usability inspection techniques are widely used, but few focus on users' thinking and many are appropriate only for particular devices and use contexts. We present a new technique (MOT) that guides inspection by metaphors of human thinking. The metaphors concern habit, the stream of thought, awareness and associations, the relation between utterances and thought, and knowing. The main novelty of MOT is its psychological basis combined with its use of metaphors to stimulate inspection. The first of three experiments shows that usability problems uncovered with MOT are more serious and more complex to repair than problems found with heuristic evaluation. Problems found with MOT are also judged more likely to persist for expert users. The second experiment shows that MOT finds more problems than cognitive walkthrough, and has a wider coverage of a reference collection of usability problems. Participants prefer using MOT over cognitive walkthrough; an important reason being the wider scope of MOT. The third experiment compares MOT, cognitive walkthrough, and think aloud testing, in the context of nontraditional user interfaces. Participants prefer using think aloud testing, but identify few problems with that technique that are not found also with MOT or cognitive walkthrough. MOT identifies more problems than the other techniques. Across experiments and measures of usability problems' utility in systems design, MOT performs better than existing inspection techniques and is comparable to think aloud testing.
On Detecting Packets Droppers in MANET: A Novel Low Cost Approach
Authors: Tarag Fahad, Djamel Djenouri, Robert Askwith
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

One of the commonest threats that mobile ad hoc networks are vulnerable to is data packet dropping, which is caused either by malicious or selfish nodes. Most of the existing solutions to solve such misbehaviour rely on the watchdog technique, which suffers from many drawbacks, particularly when using the power control technique. To overcome this problem with a moderate communication overhead, this paper introduces a new approach for detecting misbehaving nodes that drop data packets in MANET. It consists of two stages the monitoring stage in which each node monitors its direct neighbours with respect to forwarding data packets of a traffic session in the network, and the decision stage, in which direct neighbouring nodes decide whether the monitored node misbehave or not. Our new approach is able to detect the misbehaviour in case of power control employment, with a low communication overhead compared to the existing approaches.
A simulated-annealing-based approach for simultaneous parameter optimization and feature selection of back-propagation networks
Authors: Shih-Wei Lin, Tsung-Yuan Tseng, Shuo-Yan Chou, Shih-Chieh Chen
Venue: Expert Systems with Applications: An International Journal (2008)

The back-propagation network (BPN) can be used in various fields. Nevertheless, different problems may require different parameter settings for network architectures. Rule of thumb or ''trial and error'' methods are usually used to determine them. However, these methods may lead worse parameter settings for network architectures. On the other hand, although a dataset may contain many features, not all features are beneficial for classification in BPN. Therefore, a simulated-annealing-based approach, denoted as SA+BPN, is proposed to obtain the optimal parameter settings for network architectures of BPN, and to select the beneficial subset of features which result in a better classification. In order to evaluate the proposed SA+BPN approach, datasets in UCI Machine Learning Repository are used to evaluate the performance of the proposed approach. The experimental results show that the parameter settings for network architectures obtained by the proposed approach are better than those of other approaches. When the feature selection is taken into consideration, the classification accuracy rates of most datasets are increased. Therefore, the developed approach can be utilized to find out the optimal parameter settings for network architectures of BPN, and discover the useful features effectively.
HW/SW Co-Design and Implementation of Multi-Standard Video Decoding
Authors: Liu Feng, Guo Rui, Shi Shu, Cheng Xu
Venue: Proceedings of the 2006 IEEE/ACM/IFIP Workshop on Embedded Systems for Real Time Multimedia (2006)

In this paper, we present a design and implementation of multi-standard video decoder, which adopts the principle of HW/SW cooperation to achieve real time video decoding process. Based on the profiling of MPEG-1/2/4 video decoding algorithms, the computational intensive IDCT and sub-pixel interpolation are figured out to implement with hardware, and the dedicated DMA channels are provided to fulfil the high throughput of MC processing. The remained decoding functions are realized with software based on a RISC CPU. The design shares the advantage of high flexibility to fulfil multi-standard processing. With the assistant hardware accelerating, the proposed video decoder can achieve the MPEG-1/2/4 D1 size (720times480) video decoding at 30 fps
A Synchronization of Secure Sensor terminal by GPS time information
Authors: Janghong Yoon
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

If syncrhronization is lost in synchronous stream ciphers, the output of the decryptor is unintelligible to the receiver and synchronization has to be regained. To reduce the risk of synchronization loss (SL), fixed resynchronization (FR) is used in some cases. FR achieves resynchronization at fixed timesteps by inserting a synchronization pattern (SP) and a session key (SK) in the ciphertext, to make the internal state of keystream generators in the encryptor and the decryptor identical at fixed timesteps[3]. But there are problems associated with this method. In this paper, we propose a new resynchronization method to solve the problems of FR. In the proposed method, the encryptor and the decryptor achieve resynchronization by using the time-information from GPS satellite. It make resynchronization at fixed timesteps, without inserting an SP and an SK. The proposed method is very effective for resynchronization in noisy secure sensor network.
Information carrying identity proof trees
Authors: Wiliam H. Winsborough, Anna C. Squicciarini, Elisa Bertino
Venue: Proceedings of the 2007 ACM workshop on Privacy in electronic society (2007)

In open systems, the verification of properties of subjects is crucial for authorization purposes. Very often access to resources is based on policies that express (possibly complex) requirements in terms of what are referred to variously as identity properties, attributes, or characteristics of the subject. In this paper we provide an approach that an entity called a verifier can use to evaluate queries about properties of a subject requesting resources that are relevent deciding whether the requested action is authorized. Specifically, we contribute techniques that enable reuse of previously computed query results. We consider issues related to temporal validity as well as issues related to confidentiality when one entity reuses query results computed by another entity. We employ constraint logic programming as the foundation of our policy rules and query evaluation. This provides a very general, flexible basis, and enable our work to be applied more or less directly to several existing policy frameworks. The process of evaluation of a query against a subject identity is traced through a structure, referred to as identity proof tree, that carries all information proving that a policy requirement is met.
From Paper Drawings to Computer-Aided Design
Authors: Medhat Karima, Kuldip Sadhal, Tim McNeil
Venue: IEEE Computer Graphics and Applications (1985)

A Canadian feasibility study shows that the key to reliable and cost-effective automatic reading of drawings is detailed planning of an operator-assisted system.
Load shedding in a data stream manager
Authors: Nesime Tatbul, Uğur Çetintemel, Stan Zdonik, Mitch Cherniack, Michael Stonebraker
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

A Data Stream Manager accepts push-based inputs from a set of data sources, processes these inputs with respect to a set of standing queries, and produces outputs based on Quality-of-Service (QoS) specifications. When input rates exceed system capacity, the system will become overloaded and latency will deteriorate. Under these conditions, the system will shed load, thus degrading the answer, in order to improve the observed latency of the results. This paper examines a technique for dynamically inserting and removing drop operators into query plans as required by the current load. We examine two types of drops: the first drops a fraction of the tuples in a randomized fashion, and the second drops tuples based on the importance of their content. We address the problems of determining when load shedding is needed, where in the query plan to insert drops, and how much of the load should be shed at that point in the plan. We describe efficient solutions and present experimental evidence that they can bring the system back into the useful operating range with minimal degradation in answer quality.
PADL-2: A Technical Summary
Authors: C. M. Brown
Venue: IEEE Computer Graphics and Applications (1982)

Academia, business, and government joined forces to produce PADL-2, a flexible, extensible geometric solid modeling system. P2/MM is its current implementation; an improved version is under development.