ppxscal/embedding_network huggingface dataset:
A path-based methodology for post-silicon timing validation
Authors: L. Lee, Li-C Wang, T. M. Mak, Kwang-Ting Cheng
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

This work presents a novel path-based methodology for post-silicon timing validation. In timing validation, the objective is to decide if the timing behavior observed from the silicon is consistent with that predicted by the timing model. At the core of our path-based methodology, we propose a framework to obtain the post-silicon path ranking from observing silicon timing behavior. Then, the consistency is determined by comparing the post-silicon path ranking and the pre-silicon path ranking calculated based on the timing model. Our post-silicon ranking methodology consists of two approaches: ranking optimization and path filtering. We discuss the applications of both approaches and their impacts on the path ranking results. For experiments, we utilize a statistical timing simulator that was developed in the past to derive chip samples and we demonstrate the feasibility of our methodology using benchmark circuits.
A feature-based approach to visualizing and mining simulation data
Authors: Raghu Machiraju
Venue:  (2005)

The physical and engineering sciences are increasingly concerned with the study of complex, large-scale evolutionary phenomena. Such studies are often based on analyzing data generated from numerical simulations at very fine spatial and temporal resolutions. The size of these simulation data significantly challenges our ability to explore and comprehend the generated data. In this thesis, the problem of developing a feature-based approach to visualizing and mining large-scale simulation data is investigated. The premise of this thesis is that for features in simulation data, a feature-based framework requires three essential components: feature detection, feature verification, and feature characterization. Feature detection is a process that automatically locates and extracts features of interest from the simulation data. Feature verification is a process that distinguishes actual features from spurious artifacts in the detection results. Feature characterization is a process that computes and quantifies the relevant properties of extracted features as determined by domain experts. To demonstrate the essential nature of each component, we have developed and analyzed algorithms for each component, and applied them to swirling features, or vortices, in computational fluid dynamics simulation data. Although the individual algorithms we have developed for these components may not useful for other types of features, the overall feature-based framework can be applied to other types of features from other types of simulations.
Ontology Support for Communicating Agents in Negotiation Processes
Authors: Maricela C. Bravo, Joaquin Perez, Victor J. Sosa, Azucena Montes, Gerardo Reyes
Venue: Proceedings of the Fifth International Conference on Hybrid Intelligent Systems (2005)

In this paper we address the problem of semantic heterogeneity among agents during the exchange of messages in negotiation process execution. Traditional negotiation systems impose several requirements on the type and format of negotiation messages, as a consequence negotiation agents have to be reprogrammed according to the protocol and message specifications. In contrast, we present a solution based on the development of a negotiation ontology, which incorporates a shared vocabulary of the terms and messages for negotiating; and a semantic disambiguation module, that is invoked when a lack of understanding among agents occurs. We designed and implemented a service oriented architecture for executing negotiations and conducted experiments incorporating different negotiation messages. The tests showed that the proposed ontology improves the execution of negotiation messages.
(t,k)-Diagnosis for Matching Composition Networks
Authors: Guey-Yun Chang, Gen-Huey Chen, Gerard J. Chang
Venue: IEEE Transactions on Computers (2006)

(t,k){\hbox{-}}{\rm diagnosis}, which is a generalization of sequential diagnosis, requires at least k faulty processors identified and replaced in each iteration provided there are at most t faulty processors, where t \ge k. This paper proposes a (t,k){\hbox{-}}{\rm diagnosis} algorithm for matching composition networks, which include many well-known interconnection networks such as hypercubes, crossed cubes, twisted cubes, and Möbius cubes. It is shown that matching composition networks of n dimensions are (\Omega({\frac{2^n*\log n}{n}}), n){\hbox{-}}{\rm diagnosable}, where n>5.
Aggregated path authentication for efficient BGP security
Authors: Meiyuan Zhao, Sean W. Smith, David M. Nicol
Venue: Proceedings of the 12th ACM conference on Computer and communications security (2005)

The Border Gateway Protocol (BGP) controls inter-domain routing in the Internet. BGP is vulnerable to many attacks, since routers rely on hearsay information from neighbors. Secure BGP (S-BGP) uses DSA to provide route authentication and mitigate many of these risks. However, many performance and deployment issues prevent S-BGP's real-world deployment. Previous work has explored improving S-BGP processing latencies, but space problems, such as increased message size and memory cost, remain the major obstacles. In this paper, we design aggregated path authentication schemes by combining two efficient cryptographic techniques---signature amortization and aggregate signatures. We propose six constructions for aggregated path authentication that substantially improve efficiency of S-BGP's path authentication on both speed and space criteria. Our performance evaluation shows that the new schemes achieve such an efficiency that they may overcome the space obstacles and provide a real-world practical solution for BGP security.
Deploying the Digital Aid Framework: A Non-Traditionalist View of the Intrinsic Nature of e-Business Solutions for Humanitarian Relief
Authors: Jason Sargent
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

Commercial Fortune 500 companies come readily to mind in any discussion or categorization of global e- Businesses. However, organizations within the international humanitarian relief sector such as UNHCR, the UN's refugee agency, are consistently over-looked or underestimated as global 'e-Biz' players. This paper acts as a primer for the principles of e-Business for humanitarian relief by presenting deployment examples of traditional e-Business processes in non-traditional contexts; refugee and Internally Displaced Person (IDP) crises. Preliminary research indicates such illustrated indicative examples detailed in the Digital Aid Framework have potential for easy adoption and integration into future humanitarian (refugee & IDP) relief interventions.
Hybrid Intelligent Systems for Predictive Toxicology - a Distributed Approach
Authors: Daniel Neagu, Marian V. Craciun, Silviu A. Stroia, Severin Bumbaru
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

The main objective of this paper is to propose a homogeneous approach to represent and process in silico models for Predictive Toxicology and also to improve the computational representation of developed models by harmonizing new trends in Predictive Data Mining. We propose to combine local and global models as ensemble experts by mixing technologies in hybrid systems in order to improve the prediction accuracy, and also to provide reasonable training response time by using parallel processing. More investigations have still to be done to develop an optimized strategy, but our approach demonstrates encouraging results.
The Asymptotic Number of Binary Codes and Binary Matroids
Authors: Marcel Wild
Venue: SIAM Journal on Discrete Mathematics (2005)

The asymptotic number of nonequivalent binary $n$-codes is determined. This is also the asymptotic number of nonisomorphic binary matroids on $n$ elements.
Generalized sweep templates for implicit modeling
Authors: Ryan Schmidt, Brian Wyvill
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

A technique is presented for generating implicit sweep objects that support direct specification and manipulation of the surface with no topological limitations on the 2D sweep template. The novelty of this method is that the underlying scalar field has global properties which are desirable for interactive implicit solid modeling, allowing multiple sweep objects to be composed. A simple method for converting distance fields to bounded fields is described, allowing implicit sweep templates to be generated from any set of closed 2D contours (including "holes"). To avoid blending issues arising from gradient discontinuities, a general distance field approximation technique is presented which preserves sharp creases on the contour but is otherwise C2 smooth. Flat endcaps are introduced into the 3D sweep formulation, which is implemented in the context of an interactive hierarchical implicit volume modeling tool.
Polymorphic regular tree types and patterns
Authors: Jérôme Vouillon
Venue: Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages (2006)

We propose a type system based on regular tree grammars, where algebraic datatypes are interpreted in a structural way. Thus, the same constructors can be reused for different types and a flexible subtyping relation can be defined between types, corresponding to the inclusion of their semantics. For instance, one can define a type for lists and a subtype of this type corresponding to lists of even length. Patterns are simply types annotated with binders. This provides a generalization of algebraic patterns with the ability of matching arbitrarily deep in a value. Our main contribution, compared to languages such as XDuce and CDuce, is that we are able to deal with both polymorphism and function types.
Cascaded Sequential Attention for Object Recognition with Informative Local Descriptors and Q-learning of Grouping Strategies
Authors: Lucas Paletta, Gerald Fritz, Christin Seifert
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

The contribution of this work is to provide a three-stage architecture for sequential attention to provide a system being capable of sensorimotor object detection in real world environments. The first processing stage provides selected foci of interest in the image based on the extraction of information theoretic saliency of local image descriptors (i-SIFT). The second stage investigates the information in the local attention window using a codebook matcher, providing local weak hypotheses about the identity of the object under investigation. The third stage then proposes a shift of attention to a next attention window. The working hypothesis is to expect a better discrimination from the integration of both the individual local FOA patterns and the geometric relation between them, providing a model of more global information representation, and feeding into a recognition state in the Markov Decision Process (MDP). A reinforcement learner (Q-learner) performs then explorative search on useful actions, i.e., shifts of attention, towards locations of salient information, developing a strategy of useful action sequences being directed in state space towards the optimization of discrimination by information maximization. The method is evaluated in experiments using the COIL-20 database (indoor imagery) and the TSG-20 database (outdoor imagery) to demonstrate efficient performance in object detection tasks, proving the method being more accurate and computationally much less expensive than standard SIFT based recognition.
Stream input/output in Fortran
Authors: Clive Page
Venue: ACM SIGPLAN Fortran Forum (2005)

Traditionally, and indeed until the advent of Fortran2003, Standard Fortran I/O has been entirely record-based. This is fine if you are reading or writing a file of records such as a text file, where each line is a record, since it means that you don't need to be concerned about the record terminators (which, depending on the platform, may be line-feeds, or carriage-returns, or both). It can, however, be a serious handicap when you want to use Fortran to read a file generated by some instrument, or produced by a package such as a spreadsheet or database system. Often these files do not have records that Fortran can recognise, or they have a more complex structure than a simple linear sequence of records, but Standard Fortran has not previously provided any means of accessing them simply as a stream of bytes or characters. Another problem is that sometimes one wants to access the records in some random order, rather than in a strict sequence. One can do this in Fortran using direct-access files, but these are restricted to files where all records have the same length. Stream I/O provides solutions to all these problems.
Books Engineers Should Read
Authors: Bob Colwell
Venue: Computer (2005)

A recommended reading list includes books that offer wisdom on how to think about the task of engineering.
Service Level Management using QoS Monitoring, Diagnostics, and Adaptation for Networked Enterprise Systems
Authors: Guijun Wang, Changzhou Wang, Alice Chen, Haiqin Wang, Casey Fung, Stephen Uczekaj, Yi-Liang Chen, Wayne Guthmiller Guthmiller, Joseph Lee
Venue: Proceedings of the Ninth IEEE International EDOC Enterprise Computing Conference (2005)

As enterprise services increasingly interconnect as networked services in a service-oriented architecture (SOA), Service Level Management (SLM) is becoming a complex problem and can no longer be handled by traditional monitoring tools like Microsoft SMS. SLM is a process managing the quality of services demanded by clients and offered by providers. This paper presents two contributions to the research of SLM. First, instead of considering monitoring as an isolated service, it incorporates monitoring as an integral part of a comprehensive QoS management framework. This framework consists of QoS management concepts and services including service level contract management, admission control, resource management, monitoring, diagnostics, and adaptation. Using this framework, clients are able to negotiate quality of service contracts with providers and providers are able to optimize system resources to meet contract requirements. The second contribution is the incorporation of diagnostic service in the QoS management framework. Based on data feed from monitoring service, diagnostic service is able to detect any condition changes and to reason about the causes of any degradation conditions in the networked enterprise system. With condition detection and situation understanding, QoS management can then proactively activate adaptation mechanisms to maximize the system¿s ability to meet QoS contract requirements of concurrent clients.
Maximum Loop Distribution and Fusion for Two-level Loops Considering Code Size
Authors: Meilin Liu, Qingfeng Zhuge, Zili Shao, Chun Xue, Meikang Qiu, Edwin H. -M. Sha
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

In this paper, we propose a technique combining loop distribution with loop fusion to improve the timing performance without increasing the code size of the transformed loops. We first develop the loop distribution theorems that state the conditions distributing any two-level nested loop in the maximum way. Based on the loop distribution theorems, we design an algorithm to conduct maximum loop distribution. Then we propose a technique of maximum loop distribution with direct loop fusion, which performs maximum loop distribution followed by direct loop fusion. The experimental results show that the execution time of the transformed loops by our technique is reduced 41.9% on average compared to the original loops without the increase of the code size.
Software support for combinatorial optimization
Authors: Roger A. Shepherd, Dave S. Hirshfeld
Venue: Issue 29 (April 1980) (1980)

The present state of development of MPS III, Ketron's general purpose mathematical programming computer system, is summarized. Two new mixed-integer programs COMBO and BLOOD-HOUND, available within MPS III, are discussed at length. Future directions of MPS III are outlined.
Structure from motion on textures: theory and application to calibration
Authors: Patrick Baker
Venue:  (2005)

This dissertation introduces new mathematical constraints that enable us, for the first time, to investigate the correspondence problem using texture rather than point and lines. These three multilinear constraints are formulated on parallel equidistant lines embedded in a plane. We choose these sets of parallel lines as proxies for Fourier harmonics embedded on a plane as a sort of &ldquo;texture atom&rdquo;. From these texture atoms we can build up arbitrarily textured surfaces in the world. If we decompose these textures in a Fourier sense rather than as points and lines, we use these new constraints rather than the standard multifocal constraints such as the epipolar or trifocal. We propose some mechanisms for a possible feedback solution to the correspondence problem. As the major application of these constraints, we describe a multicamera calibration system written in C and MATLAB which will be made available to the public. We describe the operation of the program and give some preliminary results.
A Novel Random Backoff Algorithm to Enhance the Performance of IEEE 802.11 DCF
Authors: Li Yun, Long Ke-Ping, Zhao Wei-Liang, Chen Qian-Bin
Venue: Wireless Personal Communications: An International Journal (2006)

The Probability Distribution of Slot Selection (PDoSS) of IEEE 802.11 DCF is extremely uneven, which makes the packet collision probability very high. In this paper, we propose a novel RWBO+BEB backoff algorithm for 802.11 DCF to make the PDoSS even and thus decrease the packet collision probability. A Markov model is built for analyzing RWBO+BEB's PDoSS and saturation throughput. The model's correctness is validated by simulation. The performance of RWBO+BEB is also evaluated by simulation in terms of PDoSS, saturation throughput, packet collision probability and packet delay. The simulation results indicate that RWBO+BEB can decrease the packet collision probability to a large extent, utilize the channel more efficiently, and make the packet delay jitter much lower comparing to 802.11 DCF. Moreover, we analyze the relation of saturation throughput and packet collision probability to walking probability (pd) and contention windows (w), respectively. The analysis indicates that RWBO+BEB has a remarkable feature: its saturation throughput keeps high, and packet collision probability keeps very low (which under 0.1) in a large range of pd and w, this allows us to configure pd and w more flexibly.
Congestion Targeted Reduction of Quality of Service DDoS Attacking and Defense Scheme in Mobile Ad Hoc Networks
Authors: Wei Ren, Hai Jin, Tenghong Liu
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

In the multimedia applications over the mobile ad hoc networks, the goodput and delay performance of UDP packets is very sensitive to the congestion targeted DDoS attacking. In this paper, we analyze this type of attacking in details for the first time to our knowledge. We figure out the principles of the attacking from the analysis of network capacity and classify the attacking into four categories: Pulsing attacking, Round Robin attacking, Self-whisper attacking and Flooding attacking. The defense schemes are also proposed, which includes the detection of RTS/CTS packets, signal interference frequency and retransmission time and response stage with ECN marking mechanism. Through the ns2 simulation, the basic attacking scenario is discussed and the results show that the attacking leads to the great jitter of the goodput and delay in pulsing attacking mode. The delay increasing (up to 110 times in five attacking flows) and goodput decreasing (to 77.42% in 5 attacking flows) is obvious with the addition of attacking flows.
Continuous, weighted Lorenz theory and applications to the study of fractional relative impact factors
Authors: L. Egghe
Venue: Information Processing and Management: an International Journal (2005)

This paper introduces weighted Lorenz curves of a continuous variable, extending the discrete theory as well as the non-weighted continuous model.Using publication scores (in function of time) as the weights and citation scores (in function of time) as the dependent variables, we can construct an "impact Lorenz curve" in which one can read the value of any fractional impact factor, i.e. an impact factor measured at the time that a certain fraction of the citations is obtained or measured at the time a certain fraction of the publications is obtained.General properties of such Lorenz curves are studied and special results are obtained in case the citation age curve and publication growth curve are exponential functions. If g is the growth rate and c is the aging rate we show that ln c/ln (1/g) determines the impact Lorenz curve and also we show that any two situations give rise to two non-intersecting (except in (0,0) and (1,1)) Lorenz curves. This means that, for two situations, if one fractional impact factor is larger than the other one, the same is true for all the other fractional impact factors. We show, by counterexample that this is not so for "classical" impact factors, where one goes back to fixed time periods.The paper also presents methods to determine the rates c and g from practical data and examples are given.
Branch Prediction Topologies for SMT Architectures
Authors: Guilherme Dal Pizzol, Philippe O. A. Navaux
Venue: Proceedings of the 17th International Symposium on Computer Architecture on High Performance Computing (2005)

The exploitation of instruction level parallelism in superscalar architectures is limited by data and control dependencies. Simultaneous Multi-Threaded (SMT) architectures can explore another level of parallelism, called thread-level parallelism, to fetch and execute instructions from different tasks at the same time. While a task is blocked by control or data dependencies, other tasks may continue executing, thus masking latencies caused by mispredicted branches and memory accesses, and increasing the occupation of functional units. However, the design of SMT architectures brings new challenges, such as determining the most efficient way to share resources among different threads. In this paper, we present different branch prediction topologies for SMT architectures. We show that the best results are obtained by matching the number of i-cache modules (fetch width) with the number of branch prediction modules (number of lookups and updates), while increasing the number of modules also helps increasing clock rates. Moreover, contention on branch prediction lookup and updates buses cannot be ignored on such architectures.