ppxscal/embedding_network huggingface dataset:
Static WCET Analysis of Real-Time Task-Oriented Code in Vehicle Control Systems
Authors: Daniel Sehlberg, Andreas Ermedahl, Jan Gustafsson, Björn Lisper, Steffen Wiegratz
Venue: Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (2006)

Methods for Worst-Case Execution Time (WCET) analysis have been known for some time, and recently commercial tools have emerged. This technique is gradually being entered into industry to analyse real production codes. This article presents a case study where the aiT WCET analysis tool was used to find upper time bounds for task-oriented vehicular control code. The main purpose was to investigate the practical difficulties that arise when applying the current WCET analysis methods to this particular kind of code. In particular, we were interested in how labor-intense the analysis becomes, measured by the number of manual annotations necessary for calculating a WCET estimate. We were also interested how much tighter WCET estimates will become by manually adding extra annotations, and how much additional work that is needed to give these annotations. We also made some systematic comparisons between calculated and measured WCET estimates for the analysed system.
Secure random number agreement for peer-to-peer applications
Authors: Amy Beth Corman, Peter Schachte, Vanessa Teague
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 02 (2007)

We propose a protocol for a group of peers in a peer-to-peer network to securely generate an agreed random value without the use of a central authority. We can vary the security parameters to maintain security (to a desired probability) in the presence of a high percentage of corrupt and colluding peers. We envision using this protocol to generate random content in a peer-to-peer game. It could also be used for generating input into peer-to-peer protocols that require random values, such as group selection.
Constructing accurate fuzzy classifiers: A new adaptive method for rule-weight specification
Authors: S. M. Fakhrahmad, M. Zolghadri Jahromi
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2008)

Different approaches to design fuzzy rule-based classification systems can be grouped into two main categories: descriptive and accurate. In the descriptive category, the emphasis is on the interpretability of the resulting classifier. The classifier is usually represented by a compact set of short fuzzy rules (i.e., with a few number of antecedent conditions) that make it a suitable tool for knowledge representation. In the accurate category, the generalization ability of the classifier is the main target in the design process and no attempt is made to use understandable fuzzy rules in constructing the rule base. In this paper, we propose a simple and efficient method to construct an accurate fuzzy classification system. We use rule-weight as a simple mechanism to tune the classifier and propose a new method of rule-weight specification for this purpose. Through computer simulations on some data sets from UCI repository, we show that the proposed scheme achieves better prediction accuracy compared with other fuzzy and non-fuzzy rule-based classification systems proposed in the past.
Maintaining Packet Order in Reservation-Based Shared-Memory Optical Packet Switch
Authors: Xiaoliang Wang, Xiaohong Jiang, Susumu Horiguchi
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

Shared-Memory Optical Packet (SMOP) switch architecture is very promising for significantly reducing the amount of required optical memory, which is typically constructed from fiber delay lines (FDLs). The current reservation based scheduling algorithms for SMOP switches can effectively utilize the FDLs and achieve a low packet loss rate by simply reserving the departure time for each arrival packet. It is notable, however, that such a simple scheduling scheme may introduce a significant packets out of order problem. In this paper, we first identify the two main sources of packets out of order in the current reservation based SMOP switches. We then show that by introducing a “last-timestamp” variable and modifying the corresponding FDLs arrangement as well as the scheduling process in the current reservation-based SMOP switches, it is possible to keep packets in-sequence while still maintaining a similar delay and packet loss performance as the previous design.
How to cleverly count pattern-avoiding words (abstract only)
Authors: Lara K. Pudwell
Venue: ACM Communications in Computer Algebra (2008)

A word w contains a permutation p as a pattern if w has a subsequence that is order-isomorphic to p; otherwise, w avoids p. The study of pattern avoidance in permutations is well-studied and has been accomplished by many beautiful techniques. In 1998, Doron Zeilberger introduced the notion of prefix schemes for counting pattern-avoiding permutations. This is a divide and conquer technique driven by the pattern formed by the first few letters of the permutation. I will discuss one way of extending the method of prefix schemes to enumerate pattern-avoiding words and detail its success rate.
Fine-grained capabilities for flooding DDoS defense using client reputations
Authors: Maitreya Natu, Jelena Mirkovic
Venue: Proceedings of the 2007 workshop on Large scale attack defense (2007)

Recently proposed capability mechanisms offer one part of the answer to the DDoS problem. They empower the victim to control the traffic it receives by selectively granting access to well-behaved clients via short-lived tickets. One major question still remains unanswered: how can victims distinguish between well-behaved and ill-behaved clients during the ticket-granting process. This paper offers one possible answer to this question, while also refining the basic capability mechanism. We propose the following novel features: (1) Reputation-based ticket-granting - long-term behavior of a client influences whether future tickets will be granted, (2) Fine-grained capabilities, which authorize access to the victim at a specified priority level based on a client's prior behavior, (3) Destination-based capabilities, granted by the defense located at the victim; this reduces operational cost, and breaks dependence of tickets on routes.
A parametric linguistics based approach for cross-lingual web querying
Authors: Epaminondas Kapetanios, Vijayan Sugumaran, Diana Tanase
Venue: Data Knowledge Engineering (2008)

Developing efficient and meaningful search mechanisms for the Web is an active area of research in Information Management. With information explosion on the Internet, existing search engines encounter difficulty in accurate document positioning and retrieval. This situation is exacerbated by the language barrier for accessing web content provided in different languages. Sophisticated content-based search engines are needed for helping users find useful information quickly from multi-lingual knowledge sources on the Web. This paper presents a parametric linguistics based approach for flexible and scalable cross-lingual web querying with low complexity in query translation. The proposed methodology and the system architecture are discussed.
Additive and hereditary properties of graphs are uniquely factorizable into irreducible factors
Authors: Peter Mihók, Gabriel Semanišin, Roman Vasky
Venue: Journal of Graph Theory (2000)

A hereditary property of graphs is any class of graphs closed under isomorphism and subgraphs. Let &weierp;1, &weierp;2,&hellip;, &weierp;n be hereditary properties of graphs. We say that a graph G has property &weierp;1&deg;&weierp;2&deg;&hellip;&deg;&weierp; n if the vertex set of G can be partitioned into n sets V1, V2, , Vn such that the subgraph of G induced by Vi belongs to &weierp;i; i = 1, 2,&hellip;, n. A hereditary property is said to be reducible if there exist hereditary properties &weierp;1 and &weierp;2 such that ℛ = &weierp;1&deg;&weierp;2; otherwise it is irreducible. We prove that the factorization of a reducible hereditary property into irreducible factors is unique whenever the property is additive, i.e., it is closed under the disjoint union of graphs. &copy; 2000 John Wiley Sons, Inc. J Graph Theory 33: 4453, 2000
Detecting polynomial perfect powers (abstract only)
Authors: Daniel Roche, Mark Giesbrecht
Venue: ACM Communications in Computer Algebra (2008)

We consider the problem of determining whether a polynomial f is a perfect power of another polynomial h, i.e. whether f = hr for some integer r > 0. In particular, we seek algorithms which take advantage of the sparsity in f, and so will be fast when the input is lacunary, with only the nonzero terms represented. We give such algorithms, for polynomials with finite field or rational coefficients, after first showing that in any non-trivial case the power r must be small. An implementation is given in the C++ library NTL, and we compare our results to the fastest-known "dense" algorithm.
Reinventing EDA with manycore processors
Authors: Sachin Sapatnekar, Eshel Haritan, Kurt Keutzer, Anirudh Devgan, Desmond A. Kirkpatrick, Stephen Meier, Duaine Pryor, Tom Spyrou
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Faced with continually coping with Moore's Law, computer-aided design (CAD) for integrated circuits is used to facing challenges in our ever-evolving design problem. Increasing device complexity is a perennial challenge and has led to several discontinuities in design methodology. Over the last decade deep submicron physical effects have significantly complicated the design process and required new efforts in design for manufacturability. With the emergence of multicore and manycore microprocessor systems we face a new type of challenge: Not only will our design object (the microprocessor systems themselves) take another leap in complexity, but for the first time in our industry's history we will need to fundamentally change the way we design and implement our software solutions as well. In this panel a broad set of representatives at the front lines of addressing this challenge will outline how they plan to respond. Representative questions to the panelists include: Does your company have a similar corporate-level strategy for parallelizing CAD applications? Or is each business unit or product group left to craft its own strategy?
Temporal Logic and State Systems (Texts in Theoretical Computer Science. An EATCS Series), 1 edition
Authors: Fred Krger, Stephan Merz
Venue:  (2008)

Temporal logic has developed over the last30 years into a powerful formal setting for the specification and verification of state-based systems. Based on university lectures given by the authors, this book is a comprehensive, concise, uniform, up-to-date presentation of the theory and applications of linear and branching time temporal logic; TLA (Temporal Logic of Actions); automata theoretical connections; model checking; and related theories. All theoretical details and numerous application examples are elaborated carefully and with full formal rigor, and the book will serve as a basic source and reference for lecturers, graduate students and researchers.
Extension of higher-order HMC modeling with application to image segmentation
Authors: Lamia Benyoussef, Cyril Carincotte, Stéphane Derrode
Venue: Digital Signal Processing (2008)

In this work, we propose to improve the neighboring relationship ability of the hidden Markov chain (HMC) model, by extending the memory lengths of both the Markov chain process and the data-driven densities arising in the model. The new model is able to learn more complex noise structures, with respect to the configuration of several previous states and observations. Model parameters estimation is performed from an extension of the general iterative conditional estimation (ICE) method to take into account memories, which makes the classification algorithm unsupervised. The higher-order HMC model is then evaluated in the image segmentation context. A comparative study conducted on a simulated image is carried out according to the order of the chain. Experimental results on a synthetic aperture radar (SAR) image show that higher-order model can provide more homogeneous segmentations than the classical model, but to the cost of higher memory and computing time requirements.
Neuro-genetic non-invasive temperature estimation: Intensity and spatial prediction
Authors: César A. Teixeira, M. Graça Ruano, António E. Ruano, Wagner C. A. Pereira
Venue: Artificial Intelligence in Medicine (2008)

Objectives: The existence of proper non-invasive temperature estimators is an essential aspect when thermal therapy applications are envisaged. These estimators must be good predictors to enable temperature estimation at different operational situations, providing better control of the therapeutic instrumentation. In this work, radial basis functions artificial neural networks were constructed to access temperature evolution on an ultrasound insonated medium. Methods: The employed models were radial basis functions neural networks with external dynamics induced by their inputs. Both the most suited set of model inputs and number of neurons in the network were found using the multi-objective genetic algorithm. The neural models were validated in two situations: the operating ones, as used in the construction of the network; and in 11 unseen situations. The new data addressed two new spatial locations and a new intensity level, assessing the intensity and space prediction capacity of the proposed model. Results: Good performance was obtained during the validation process both in terms of the spatial points considered and whenever the new intensity level was within the range of applied intensities. A maximum absolute error of 0.5^oC+/-10% (0.5^oC is the gold-standard threshold in hyperthermia/diathermia) was attained with low computationally complex models. Conclusion: The results confirm that the proposed neuro-genetic approach enables foreseeing temperature propagation, in connection to intensity and space parameters, thus enabling the assessment of different operating situations with proper temperature resolution.
ROBS: A novel architecture of Reliable Optical Burst Switching with congestion control
Authors: Jiangtao Luo, Jun Huang Hao Chang Shaofeng Qiu Xiaojin Guo Zhizhong Zhang
Venue: Journal of High Speed Networks (2007)

In this paper, we propose a novel improved architecture of Optical Burst-Switched Networks, called Reliable Optical Burst Switching (ROBS), which introduces congestion control and retransmission mechanisms of TCP to OBS layer. Design issues of edge and core nodes for ROBS networks are both demonstrated. Part of its function has been implemented on ns-2 platform and its performance are evaluated by simulation.
Swelling of cross-linked polystyrene beads in toluene
Authors: R. Zhang, T. Cherdhirankorn, K. Graf, K. Koynov, R. Berger
Venue: Microelectronic Engineering (2008)

Ultraviolet light irradiation of PS microbeads can be used for controlling the solvent uptake and release upon exposure to its vapor. The irradiation leads to additional fracture and crosslinking of PS chains thus reducing the amount of solvent uptake significantly. Confocal fluorescence microscopy showed that this effect is pronounced in a shell of the PS microbeads having a thickness in the range of 1-2@mm. In addition, this shell shows considerable fluorescence when excited between 300nm and 500nm that is attributed to lower molecular weight fragments of PS. Fluorescence correlation spectroscopy studies of small tracers diffusion in a microbead core have revealed that the swelling of the core is not altered by the UV exposure, and the UV crosslinking effects are limited to the shell only. Chemically and UV cross-linked PS beads keep their shapes even after numerous swelling cycles in saturated toluene vapors.
ELIAD: efficient lithography aware detailed router with compact post-OPC printability prediction
Authors: Minsik Cho, Kun Yuan, Yongchan Ban, David Z. Pan
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

In this paper, we present ELIAD, an efficient lithography aware detailed router to optimize silicon image after optical proximity correction (OPC) in a correct-by-construction manner. We first propose a compact post-OPC litho-metric for a detailed router based on statistical characterization. We characterize the interferences among weak grids filled with one of predefined litho-prone shapes (e.g., jog-corner, via, line-end). Our litho-metric derived from the characterization shows high fidelity to total edge placement error (EPE) in large scale, compared with Calibre-OPC/ORC. As a chip itself is in the largest scale, ELIAD powered by the proposed metric can enhance the overall post-OPC printed silicon image. Experimental results on 65nm industrial circuits show that ELIAD outperforms a ripup/rerouting approach such as RADAR [17] with 8x more EPE hotspot reduction and 12x speedup. Also, compared with a conventional detailed router, ELIAD is only about 50% slower.
Lane changing using s-series clothoidal approximation and dual-rate based on Bezier points to controlling vehicle
Authors: N. Montés, J. Tornero
Venue: Proceedings of the 4th WSEAS International Conference on Systems Theory and Scientific Computation (2004)

This paper presents a fast lane changing algorithm for Intelligent Vehicle Highway Systems. The algorithm is based on the use of polinomial approximation of clothoids by using s-series. A new and accurate method that permits to obtain a polinomial with a low degree. Using this approximation we build an elementary path. We introduce a trigonometric approximation of elementary paths for the calculus of the characteristic parameter. With this, we particularize a bi elementary paths to solve lane changing, obtaining a big simplification. The second part of the paper speaks about vehicle control. Using a clothoidal path we have more advantages, Curvature Radius change regularly along the path, control of centrifugal acceleration for comfort of passengers which is achieve by the use of velocity control. Another advantage is the use of Dual-rate based on Bezier function, because is very easy obtain Bezier control points through s-series.
Building a Service-Oriented Ontology for Wireless Sensor Networks
Authors: Jeong-Hee Kim, Hoon Kwon, Do-Hyeun Kim, Ho-Young Kwak, Sang-Joon Lee
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

Wireless sensor networks (WSNs) provide various environment data in the real-world, and also WSNs's middleware is able to offer field data in real-time by user queries. For materialization of the future ubiquitous computing which enables networking with things at anytime, anywhere and any-devices, WSNs occupy the important position with RFID technologies, and it has evolved and advanced currently. This paper proposes a service-oriented sensor ontology which enables service-oriented services in future ubiquitous computing. Taking reuse of ontology into consideration, ServiceProperty, LocationProperty and PhysicalProperty classes were derived from Geography Markup Language (GML), Sensor Web Enablement (SWE), SensorML and Suggested Upper Merged Ontology (SUMO) and OntoSensor ontology, and its properties and constraints were also defined newly as service-oriented service. We presented the validation and consistency check of the proposed ontology using Protégé 3.3.1 and RACER 1.9.0, respectively, and indicated the results of service query which used the SPARQL query language.
On the security of group communication schemes
Authors: Shouhuai Xu
Venue: Journal of Computer Security (2007)

Secure group communications are a mechanism facilitating protected transmission of messages from a sender to multiple receivers, and many emerging applications in both wired and wireless networks need the support of such a mechanism. There have been many secure group communication schemes in wired networks, which can be directly adopted in, or appropriately adapted to, wireless networks such as mobile ad hoc networks (MANETs) and sensor networks. In this paper we show that the popular group communication schemes that we have examined are vulnerable to the following attack: An outside adversary who compromises a certain legitimate group member could obtain all past and present group keys (and thus all the messages protected by them); this is in sharp contrast to the widely-accepted belief that a such adversary can only obtain the present group key (and thus the messages protected by it). In order to understand and deal with the attack, we formalize two security models for stateful and stateless group communication schemes. We show that some practical methods can make a subclass of existing group communication schemes immune to the attack. An extended abstract of this paper appeared as [29].
An efficient approach to on-chip logic minimization
Authors: Seraj Ahmad, Rabi N. Mahapatra
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

Boolean logic minimization is being applied increasingly to a new variety of applications that demand very fast and frequent minimization services. These applications typically have access to very limited computing and memory resources, rendering the traditional logic minimizers ineffective. We present a new approximate logic minimization algorithm based on ternary trie. We compare its performance with Espresso-II and ROCM logic minimizers for routing table compaction and demonstrate that it is 100 to 1000 times faster and can execute with a data memory as little as 16 KB. We also found that the proposed approach can support up to 25 000 incremental updates per second. We also compare its performance for compaction of the routing access control list and demonstrate that the proposed approach is highly suitable for minimizing large access control lists containing several thousand entries. Therefore, the algorithm is ideal for on-chip logic minimization.
Synchronization power depends on the register size
Authors: Y. Aiek
Venue: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science (1993)

Though it is common practice to treat synchronization primitives for multiprocessors as abstract data types, they are in reality machine instructions on registers. A crucial theoretical question with practical implications is the relationship between the size of the register and its computational power. The authors study this question and choose as a first target the popular compare and swap operation (which is the basis for many modern multiprocessor architectures). The results of this paper suggest that a complexity hierarchy for multiprocessor synchronization operations should be based on the space complexity of synchronization registers and not on the number of so called "synchronization objects".