ppxscal/embedding_network huggingface dataset:
Decentralized detection of global threshold crossings using aggregation trees
Authors: Fetahi Wuhib, Mads Dam, Rolf Stadler
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2008)

The timely detection that a monitored variable has crossed a given threshold is a fundamental requirement for many network management applications. A challenge is the detection of threshold crossing of network-wide variables, which are computed from device counters across the network, using aggregation functions such as SUM, MAX and AVERAGE. This paper contains a detailed description and a comprehensive evaluation of TCA-GAP, a protocol for detecting threshold crossings of network-wide aggregates in a distributed way. Elements of its design include tree-based incremental aggregation for estimating the value of aggregates, a local hysteresis mechanism to reduce overhead and dynamic recomputation of local thresholds to ensure correctness. The protocol is evaluated through extensive simulation using real traces in scenarios with network sizes up to 5232 nodes. From the measurements, we conclude that the protocol is efficient in the sense that the overhead is negligible when the aggregate is far from the threshold. It is scalable as the protocol overhead is independent of the system size for the network sizes and scenario configurations considered. We demonstrate that the local hysteresis parameter can be used to control the tradeoff between protocol overhead and detection delay. We further report on results on how node failures impact overhead and detection quality of the protocol.
Mathematical theory of the h- and g-index in case of fractional counting of authorship
Authors: Leo Egghe
Venue: Journal of the American Society for Information Science and Technology (2008)

This article studies the h-index (Hirsch index) and the g-index of authors, in case one counts authorship of the cited articles in a fractional way. There are two ways to do this: One counts the citations to these papers in a fractional way or one counts the ranks of the papers in a fractional way as credit for an author. In both cases, we define the fractional h- and g-indexes, and we present inequalities (both upper and lower bounds) between these fractional h- and g-indexes and their corresponding unweighted values (also involving, of course, the coauthorship distribution). Wherever applicable, examples and counterexamples are provided. In a concrete example (the publication citation list of the present author), we make explicit calculations of these fractional h- and g-indexes and show that they are not very different from the unweighted ones. &copy; 2008 Wiley Periodicals, Inc.
Specify-explore-refine (SER): from specification to implementation
Authors: A. Gerstlauer, J. Peng, D. Shin, D. Gajski, A. Nakamura, D. Araki, Y. Nishihara
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Driven by increasing complexity and reliability demands, the Japanese Aerospace Exploration Agency (JAXA) in 2004 commissioned development of ELEGANT, a complete SpecC-based environment for electronic system-level (ESL) design of space and satellite electronics. As integral part of ELEGANT, the Center for Embedded Computer System (CECS) has developed and supplied the SER tool set. Following a Specify-Explore-Refine methodology, SER supports system-level design space exploration, interactive platform development and automatic model refinement and model generation. The SER engine has been successfully integrated into ELEGANT. With SER at its core, ELEGANT provides a seamless tool chain for modeling verification and synthesis from top-level specification down to embedded HW/SW implementation. ELEGANT and SER have been succesfully delivered to JAXA and its suppliers. Tools are currently being deployed in companies like NEC Toshiba Space Systems. Evaluation results prove the feasibility of the approach for design space exploratoin, rapid virtual prototyping and system synthesis resulting in tremendous productivity and reliability gains. In addition, ELEGANT has been commercialized for general market availability. The SER component has been licensed to InterDesign Technologies, Inc. (IDT) and it is available from, sold and supported by IDT.
Intelligent modulation type identification using GA-SVM based on WPA
Authors: Ataollh Ebrahimzadeh, Seyed Alireza Seyedin
Venue: Proceedings of the 7th WSEAS International Conference on Evolutionary Computing (2006)

Automatic digital modulation identification through signal processing has found many applications such wireless communication system, nowadays. This paper proposes an Intelligent Digital Modulation Identifier (IDMI) that is new in this area. IDMI includes three main pats: wavelet packet analysis (WPA), support vector machines (SVM) and genetic algorithm (GA). WPA extracts features from received signal. SVM classifies according to extracted features. GA finds the best kernel parameter for SVM also does features selection. IDMTI is used to separate PSK2 and PSK4. Simulation result show IDMI has high performance comparable other methods even in low SNR.
Parity-based inference control for multi-dimensional range sum queries
Authors: Lingyu Wang, Yingjiu Li, Sushil Jajodia, Duminda Wijesekera
Venue: Journal of Computer Security (2007)

This paper studies the inference control of multi-dimensional range (MDR) sum queries. We show that existing inference control methods are usually inefficient for MDR queries. We then consider parity-based inference control that restricts users to queries involving an even number of sensitive values. Such a restriction renders inferences significantly more difficult, because an even number is closed under addition and subtraction, whereas inferences target at one value. However, more sophisticated inferences are still possible with only even MDR queries. We show that the collection of all even MDR queries causes inferences if and only if a special collection of sum-two queries (that is, the summation of exactly two values) does so. The result leads to an inference control method with an improved computational complexity O(mn) (over the previous result of O(m 2n)) for m MDR queries over n values. We show that no odd MDR queries can be answered without causing inferences. We show how to check non-MDR queries for inferences in linear time. We also show how to find large inference-free subsets of even MDR queries when they do cause inferences.
Further developments in MacMahon's partition analysis (abstract only)
Authors: George E. Andrews, Peter Paule
Venue: ACM Communications in Computer Algebra (2008)

P.A. MacMahon developed a calculus for producing generating functions of partitions constrained by linear inequalities relating the various parts of the partitions. Recently we have used MacMahon's method to find new classes of partitions whose generating functions are modular forms (Acta Arith., 126(2007), 281-294), and we have retrieved MacMahon's original project which was to prove his generating function formula for plane partitions. We shall report briefly on these topics and indicate new areas for exploration. In particular, we shall consider the modification of MacMahon's methods in which the inequalities relating the various parts of the partition take into account congruence constraints on the parts.
Sequential Monte Carlo methods for joint detection and tracking of multiaspect targets in infrared radar images
Authors: Marcelo G. S. Bruno, Rafael V. Araújo, Anton G. Pavlov
Venue: EURASIP Journal on Advances in Signal Processing (2008)

We present in this paper a sequential Monte Carlo methodology for joint detection and tracking of a multiaspect target in image sequences. Unlike the traditional contact/association approach found in the literature, the proposed methodology enables integrated, multiframe target detection and tracking incorporating the statistical models for target aspect, target motion, and background clutter. Two implementations of the proposed algorithm are discussed using, respectively, a resample-move (RS) particle filter and an auxiliary particle filter (APF). Our simulation results suggest that the APF configuration outperforms slightly the RS filter in scenarios of stealthy targets.
Combining ITIL, COBIT and ISO/IEC 27002 in Order to Design a Comprehensive IT Framework in Organizations
Authors: Shamsul Sahibudin, Mohammad Sharifi, Masarat Ayat
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Several frameworks, tools and standards have been included in IT management systems, in organizations. However, on their own, they are not comprehensive enough to serve as efficient IT management system. This paper reviews two established frameworks, i.e. ITIL, COBIT and a standard, ISO/IEC 27002 focusing on their similarities and differences. It then proposes a comprehensive framework by integrating the three general framework and standards into an IT framework that could be used in every company.
PuzzledDelightful graph theory
Authors: Peter Winkler
Venue: Communications of the ACM (2008)

Welcome to the new puzzle column. Each column will present three puzzles. The first two will have known (and usually elegant) solutions that will appear in the next issue of Communications. The third will be an open problem; good luck with that one. Readers are encouraged to submit prospective puzzles for future columns to puzzled@cacm.acm.org. We start with three delightful graph-theoretic puzzles. Here we go.
Low-latency factorization architecture for algebraic soft-decision decoding of Reed-Solomon codes
Authors: Jun Ma, Alexander Vardy, Zhongfeng Wang
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

Bivariate polynomial factorization is an important stage of algebraic soft-decision decoding of Reed-Solomon (RS) codes and contributes to a significant portion of the overall decoding latency. With the exhaustive search-based root computation method, factorization latency is dominated by the root computation step, especially for RS codes defined over very large finite fields. The root-order prediction method proposed by Zhang and Parhi only improves average latency, but does not have any effect on the worst-case latency of the factorization procedure. Thus, neither approach is well-suited for delay-sensitive applications. In this paper, a novel architecture based on direct root computation is proposed to greatly reduce the factorization latency. Direct root computation is feasible because in most practical applications of algebraic soft-decision decoding of RS codes, enough decoding gain can be achieved with a relatively low interpolation cost, which results in a bivariate polynomial with low Y-degree. Compared with existing works, not only does the new architecture have a significantly smaller worst-case decoding latency, but it is also more area efficient since the corresponding hardware for routing polynomial coefficients is eliminated.
Multi-index hashing for information retrieval
Authors: D. Greene, M. Parnas, F. Yao
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

We describe a technique for building hash indices for a large dictionary of strings. This technique permits robust retrieval of strings from the dictionary even when the query pattern has a significant number of errors. This technique is closely related to the classical Turan problem for hypergraphs. We propose a general method of multi-index construction by generalizing certain Turan hypergraphs. We also develop an accompanying theory for analyzing such hashing schemes. The resulting algorithms have been implemented and can be applied to a wide variety of recognition and retrieval problems.
INCREMENTAL EXTRACTION OF ASSOCIATION RULES IN APPLICATIVE DOMAINS
Authors: Arianna Gallo, Roberto Esposito, Rosa Meo, Marco Botta
Venue: Applied Artificial Intelligence (2007)

In recent years, the KDD process has been advocated to be an iterative and interactive process. It is seldom the case that a user is able to answer immediately all his questions on date with a single query. On the contrary, the work-flow of the typical user consists of several steps in which he/she iteratively refines the extracted knowledge by inspecting previous results and posing new queries. Given this view of the KDD process, in order to reduce the computational effort, it becomes crucial to have KDD systems that are able to exploit past results. This is especially true in environments in which the system knowledge base is the result of many discoveries on data made separately by the collaborative effort of different users. In this paper, we consider the problem of mining frequent association rules from database relations. We first model a general, constraint-based, mining language for this task. Then, we propose an algorithm that answers such queries reusing past results. In particular, this solution is effective for a new class of constraints, called context dependent, which are more difficult than the traditionally studied item dependent constraints. Nevertheless, we show that some typical queries of important application domains, such as market stock trading, analysis of web log, and gene microarrays in bioinformatics, have context-dependent constraints. We show with a set of experiments in these application domains that the proposed solution with an incremental approach is both effective and viable.
Instantaneous Transitions in Esterel
Authors: Olivier Tardieu, Stephen A. Edwards
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

Esterel is an imperative synchronous programming language for the specification of deterministic concurrent reactive systems. While providing the usual control-flow constructs-sequences, loops, conditionals, and exceptions-its lack of a goto instruction makes the programming of arbitrary finite state machines awkward and hinders the design of source-to-source program transformations. We previously introduced to Esterel a non-instantaneous gotopause instruction, which prevents the synchronous execution of code before and code after the transition. Here, we tackle instantaneous transitions. Concurrency demands we assign scopes and priorities to gotos, so we extend Esterel's exception handling mechanism to allow exception handlers in arbitrary locations. We advocate for and formalize the resulting language. We observe that instantaneous gotos complement but do not replace non-instantaneous gotopauses.
Aspects of mobile continuous monitoring systems: optimized image compression algorithm
Authors: Ciprian Racuciu, Nicolae Jula, Florin-Marius Pop
Venue: Proceedings of the 2nd WSEAS International Conference on Circuits, Systems, Signal and Telecommunications (2008)

Mobile continuous monitoring systems start to grow in every modern army. They are also known as UAV (Unmanned Air Vehicle) and probably in few years almost every army will be equipped with UAVs. The goal of this paper is to present an algorithm that compress images captured from the UAV and transmitted to the ground. This paper focuses on the image compression algorithm presenting simple techniques that can be combined for a high compression ratio, with low resources and a good quality.
Gauging the OpenSourceMark Benchmark in Measuring CPU Performance
Authors: Fadi N. Sibai
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

We analyze COSBI’s Open Source Mark (OSMark) benchmark [1] in measuring CPU performance in desktop personal computers. We select and focus on selected tests of the benchmark targeting the CPU which we also profile. We run the benchmark on two personal computers with single and dual cores. We then collect performance event counts for the selected tests to characterize the benchmark’s workload and we correlate the performance event counts with the CPI. The results reveal that although this benchmark provides a nice and convenient alternative to existing commercial benchmarks [2-7], it falls behind in total instruction coverage and application coverage, and does not stress enough multi-core processors as well as competing benchmarks.
A Randomized Greedy Algorithm for the Pattern Fill Problem for DFM Applications
Authors: Maharaj Mukherjee, Kanad Chakraborty
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

This work deals with the dummy fill and negative fill insertion problem with constraints on the minimum and maximum pattern density within a moving rectangular window. It is shown that the general class of such problems is at least NP-hard. A greedy randomized algorithm for this problem is proposed, and its proof of convergence and some experimental results are presented. More detailed account of our implementation and results are available in [7].
Constraint Logic Programming for program analysis
Authors: Joxan Jaffar
Venue: Proceedings of the thirty-first Australasian conference on Computer science - Volume 74 (2008)

Constraint Logic Programming (CLP) has been traditionally applied to the modelling of complex problems, especially combinatorial problems, and to model knowledge bases. In this presentation, we focus on using CLP for program analysis and verification. First we consider the representation of program behavior: the rules and constraints of CLP provides for a natural specification of programs as a symbolic guarded transition system. The CLP execution model can then capture the symbolic traces of the underlying program, and these traces, in turn, divulge the properties that we seek. Secondly, we use the CLP formalism for the formal specification of complex properties of data structures. Here the CLP execution model can be used as a theorem-prover to dispense with the proof obligations arising from the program and its specifications. The traditional CLP execution model, however, is not automatically practical for these purposes. We shall present two refinements to CLP: one for reducing the number of symbolic traces that are needed to prove a property, and one to efficiently deal with data structure properties.
EventScript: an event-processing language based on regular expressions with actions
Authors: Norman H. Cohen, Karl Trygve Kalleberg
Venue: Proceedings of the 2008 ACM SIGPLAN-SIGBED conference on Languages, compilers, and tools for embedded systems (2008)

EventScript is a simple but powerful language for programming reactive processes. A stream of incoming events is matched against a regular expression. Actions embedded within the regular expression are executed in response to the matching of patterns of events. These actions include assigning computed values to variables and emitting output events. The definition of EventScript presented a number of novel and interesting language-design choices. EventScript has an efficient implementation, and has been used in a development environment for complex event-based applications. We have used EventScript to program both small examples and large industrial applications. Readers of EventScript programs find them easy to understand, and are comfortable with the familiar model of matching regular expressions.
An exact confidence set for two binomial proportions and exact unconditional confidence intervals for the difference and ratio of proportions
Authors: Jen Reiczigel, Zsolt Abonyi-Tóth, Júlia Singer
Venue: Computational Statistics Data Analysis (2008)

An exact joint confidence set is proposed for two binomial parameters estimated from independent samples. Its construction relies on inverting the minimum volume test, a two-dimensional analogue of Sterne's test for a single probability. The algorithm involves computer-intensive exact computation based on binomial probabilities. The proposed confidence set has good coverage properties and it performs much better than the likelihood-based confidence set for the same problem. Applying the principle of intersection-union tests, the method can be used to derive exact tests and confidence intervals for functions of the two binomial parameters. Based on this, new exact unconditional two-sided confidence intervals are proposed for the risk difference and risk ratio. The performance of the new intervals is comparable to that of certain well-known confidence intervals in small samples. Extension of the methods described to two hypergeometric or two Poisson variables is straightforward.
Extending a partial nowhere-zero 4-flow
Authors: Hong-Jian Lai
Venue: Journal of Graph Theory (1999)

In [J Combin Theory Ser B, 26 (1979), 205&ndash;216], Jaeger showed that every graph with 2 edge-disjoint spanning trees admits a nowhere-zero 4-flow. In [J Combin Theory Ser B, 56 (1992), 165&ndash;182], Jaeger et al. extended this result by showing that, if A is an abelian group with |A| = 4, then every graph with 2 edge-disjoint spanning trees is A-connected. As graphs with 2 edge-disjoint spanning trees are all collapsible, we in this note improve the latter result by showing that, if A is an abelian group with |A| = 4, then every collapsible graph is A-connected. This allows us to prove the following generalization of Jaeger's theorem: Let G be a graph with 2 edge-disjoint spanning trees and let M be an edge cut of G with |M| &ge; 4. Then either any partial nowhere-zero 4-flow on M can be extended to a nowhere-zero 4-flow of the whole graph G, or G can be contracted to one of three configurations, including the wheel of 5 vertices, in which cases certain partial nowhere-zero 4-flows on M cannot be extended. Our results also improve a theorem of Catlin in [J Graph Theory, 13 (1989), 465&ndash;483]. &copy; 1999 John Wiley & Sons, Inc. J Graph Theory 30: 277&ndash;288, 1999
PERLA: A Data Language for Pervasive Systems
Authors: Fabio A. Schreiber, Romolo Camplani, Marco Fortunato, Marco Marelli, Filippo Pacifici
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

A language is presented for managing data in highly pervasive systems made of very different devices as to their technology and functional capabilities. Functional and nonfunctional requirements are dealt with in a transparent mode by a SQL like interface. In this paper the most relevant features of the language, the related data structures and some query examples are briefly introduced.
SQAK: doing more with keywords
Authors: Sandeep Tata, Guy M. Lohman
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

Today's enterprise databases are large and complex, often relating hundreds of entities. Enabling ordinary users to query such databases and derive value from them has been of great interest in database research. Today, keyword search over relational databases allows users to find pieces of information without having to write complicated SQL queries. However, in order to compute even simple aggregates, a user is required to write a SQL statement and can no longer use simple keywords. This not only requires the ordinary user to learn SQL, but also to learn the schema of the complex database in detail in order to correctly construct the required query. This greatly limits the options of the user who wishes to examine a database in more depth. As a solution to this problem, we propose a framework called SQAK1 (SQL Aggregates using Keywords) that enables users to pose aggregate queries using simple keywords with little or no knowledge of the schema. SQAK provides a novel and exciting way to trade-off some of the expressive power of SQL in exchange for the ability to express a large class of aggregate queries using simple keywords. SQAK accomplishes this by taking advantage of the data in the database and the schema (tables, attributes, keys, and referential constraints). SQAK does not require any changes to the database engine and can be used with any existing database. We demonstrate using several experiments that SQAK is effective and can be an enormously powerful tool for ordinary users.