ppxscal/embedding_network huggingface dataset:
Enabling MAC protocol implementations on software-defined radios
Authors: George Nychis, Thibaud Hottelier, Zhuocheng Yang, Srinivasan Seshan, Peter Steenkiste
Venue: Proceedings of the 6th USENIX symposium on Networked systems design and implementation (2009)

Over the past few years a range of new Media Access Control (MAC) protocols have been proposed for wireless networks. This research has been driven by the observation that a single one-size-fits-all MAC protocol cannot meet the needs of diverse wireless deployments and applications. Unfortunately, most MAC functionality has traditionally been implemented on the wireless card for performance reasons, thus, limiting the opportunities for MAC customization. Software-defined radios (SDRs) promise unprecedented flexibility, but their architecture has proven to be a challenge for MAC protocols. In this paper, we identify a minimum set of core MAC functions that must be implemented close to the radio in a high-latency SDR architecture to enable high performance and efficient MAC implementations. These functions include: precise scheduling in time, carrier sense, backoff, dependent packets, packet recognition, fine-grained radio control, and access to physical layer information. While we focus on an architecture where the bus latency exceeds common MAC interaction times (tens to hundreds of microseconds), other SDR architectures with lower latencies can also benefit from implementing a subset of these functions closer to the radio. We also define an API applicable to all SDR architectures that allows the host to control these functions, providing the necessary flexibility to implement a diverse range of MAC protocols. We show the effectiveness of our split-functionality approach through an implementation on the GNU Radio and USRP platforms. Our evaluation based on microbenchmarks and end-to-end network measurements, shows that our design can simultaneously achieve high flexibility and high performance.
Semantic Tree Kernels to classify Predicate Argument Structures
Authors: Alessandro Moschitti, Bonaventura Coppola, Daniele Pighin, Roberto Basili
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

Recent work on Semantic Role Labeling (SRL) has shown that syntactic information is critical to detect and extract predicate argument structures. As syntax is expressed by means of structured data, i.e. parse trees, its encoding in learning algorithms is rather complex. In this paper, we apply tree kernels to encode the whole predicate argument structure in Support Vector Machines (SVMs). We extract from the sentence syntactic parse the subtrees that span potential argument structures of the target predicate and classify them in incorrect or correct structures by means of tree kernel based SVMs. Experiments on the PropBank collection show that the classification accuracy of correct/incorrect structures is remarkably high and helps to improve the accuracy of the SRL task. This is a piece of evidence that tree kernels provide a powerful mechanism to learn the complex relation between syntax and semantics.
On the complexity of counting components of algebraic varieties
Authors: Peter Bürgisser, Peter Scheiblechner
Venue: Journal of Symbolic Computation (2009)

We give a uniform method for the two problems of counting the connected and irreducible components of complex algebraic varieties. Our algorithms are purely algebraic, i.e., they use only the field structure of C. They work in parallel polynomial time, i.e., they can be implemented by algebraic circuits of polynomial depth. The design of our algorithms relies on the concept of algebraic differential forms. A further important building block is an algorithm of Szanto computing a variant of characteristic sets. Furthermore, we use these methods to obtain a parallel polynomial time algorithm for computing the Hilbert polynomial of a projective variety which is arithmetically Cohen-Macaulay.
You must be joking...: is only getting started
Authors: Michalis Faloutsos
Venue: ACM SIGCOMM Computer Communication Review (2009)

"Don't even get me started" is a powerful and direct, yet vague and meaningless, expression. What if you reply: "By all means, please, get started". I believe that this will stun your opponent (it may be a friendly discussion, but if you don't believe the other person is an opponent, you will never win.). Then, you can quickly grab his/her nose and yell: "Twos before eights, and one bird in the bush". It can be very entertaining unless the other person is your boss or your psychiatrist. In any case, this column dares to go where no column at CCR has gone before. It is all about getting started. And by that, we mean starting start-ups. Warning: the content below is not suitable for small children or adults with common sense.
Optimization of a fertilizer spreading process
Authors: Jonas Koko, Teddy Virin
Venue: Mathematics and Computers in Simulation (2009)

An optimization method for accurate fertilizer application by centrifugal spreader is described. The cost functional is a distance between a prescribed dose and the distributed dose. The distributed dose is computed using a simplified spread pattern and the unknowns of the problem are three time-dependent parameters of the spreader: the average (distribution) center, the average (distribution) angle and the mass flow rate. In order to take into account the mechanical limits of the device, constraints are introduced in the form of bounds on the parameter functions and their time derivatives. Numerical experiments show that application errors can be significantly reduced for parallel tracks within a main field body.
Science teachers' use of online resources and the digital library for Earth system education
Authors: Lecia J. Barker
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

A three-part study of teachers' use of online resources and of the Digital Library for Earth System Education (DLESE) was conducted from 2004 through summer 2006. The first two phases were qualitative and informed a survey administered to 622 science teachers across the U.S., one-fifth of whom had used DLESE. The findings present a profile of teachers and their access to Internet-connected computers and other hardware/electronic media devices in their classrooms; and teachers' preferences for resource formats (e.g., customizability) and educational web site features (e.g., tagged reading level). Analysis of variance showed that teachers with more than one working computer and teachers with more other devices valued the Internet more highly for teaching than did their less equipped peers. DLESE users valued the Internet more highly for their teaching, had more years teaching experience, and valued customizable resources more than their non-DLESE using peers. Most believed that resources catalogued in DLESE were scientifically accurate. Teachers used DLESE most often for finding hands-on activities, still images and other visual aids, and hand-outs; they were least likely to seek people, games, or assessment tools. The findings provide guidance for developers of K12 educational resources.
CPU, SMP and GPU implementations of Nohalo level 1, a fast co-convex antialiasing image resampler
Authors: Nicolas Robidoux, Minglun Gong, John Cupitt, Adam Turcotte, Kirk Martinez
Venue: Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering (2009)

This article introduces Nohalo level 1 ("Nohalo"), the simplest member of a family of image resamplers which straighten diagonal interfaces without adding noticeable nonlinear artifacts. Nohalo is interpolatory, co-monotone, co-convex, antialiasing, local average preserving, continuous, and exact on linears. Like many edge-enhancing methods, Nohalo has two main stages: first, nonlinear interpolation is used to create a double-density version of the original image; this double-density image is then resampled with bilinear interpolation. Nohalo is especially suited for GPU computing because the nonlinear slopes can be computed once and stored in a low bit-depth texture without rounding error, because the final bilinear stage can be performed in hardware, and because monotonicity allows full use of the texture's dynamic range. Demand-driven implementations for CPU's and SMPs are more complex, and require extra work to fix bottlenecks. Efficient implementations of the minmod function are key to performance. Three implementations of Nohalo are presented and bench-marked: a CPU version in C for the graphics library GEGL, an SMP version in C++ for the graphics library VIPS and a GPU version in HLSL for DirectX. The GPU implementation is branch-free thanks to the discovery of a simple formula for the pixel values of the double density image. Branches are eliminated in the demand-driven C/C++ implementations by reflecting, if needed, Nohalo's 12-point stencil with pointer shifts. Overall, Nohalo is not much slower than standard bicubic resamplers. Compared to twenty-three alternatives in tests involving the re-enlargement of images downsampled with nearest neighbour, Nohalo gets the best PSNRs.
Super p-restricted edge connectivity of line graphs
Authors: Shangwei Lin, Shiying Wang
Venue: Information Sciences: an International Journal (2009)

Super restricted connectivity and super restricted edge connectivity are more refined network reliability indices than connectivity and edge connectivity. In this paper, we first introduce the concepts of super restricted connectivity and super restricted edge connectivity and then give a property of graphs with equal p-restricted edge connectivity and 1-p-restricted connectivity. Applying this property, we show a sufficient condition for a line graph to be super p-restricted edge-connected and a relationship between super 1-p-restricted connected graphs and super p-restricted edge-connected graphs.
Extracting MUSes
Authors: Éric Grégoire, Bertrand Mazure, Cédric Piette
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

Minimally unsatisfiable subformulas (in short, MUSes) represent the smallest explanations for the inconsistency of SAT instances in terms of the number of involved clauses. Extracting MUSes can thus prove valuable because it circumscribes the sources of contradiction in an instance. In this paper, a new heuristic-based approach to approximate or compute MUSes is presented. It is shown that it often outperforms current competing ones.
Code patterns for agent-oriented programming
Authors: Peter Novák, Wojciech Jamroga
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1 (2009)

The mainstream approach to design of BDI-inspired agent programming languages is to choose a set of agent-oriented features with a particular semantics and their subsequent implementation in the programming language interpreter. The language designer's choices thus impose strong constraints on the architecture of the implemented agents as well as only a limited toolbox of high-level language constructs for encoding the agent program. As an alternative, we propose a purely syntactic approach to designing an agent programming language. On the substrate of Behavioural State Machines (BSM ), a generic modular programming language for hybrid agents, we show how an agent designer can implement high-level agent-oriented constructs in the form of code patterns (macros). To express the semantics of agent programs in the logic-agnostic programming language of BSM, we propose LTL program annotations and subsequently introduce DCTL*, an extension of the CTL* logic with features of dynamic logic, for reasoning about traces of BSM program executions. We show how DCTL* specifications can be used to prove relevant properties of code patterns. Moreover, DCTL* allows for natural verification of BSM agent programs.
Integrating intrusion alert information to aid forensic explanation: An analytical intrusion detection framework for distributive IDS
Authors: Bon K. Sy
Venue: Information Fusion (2009)

The objective of this research is to show an analytical intrusion detection framework (AIDF) comprised of (i) a probability model discovery approach, and (ii) a probabilistic inference mechanism for generating the most probable forensic explanation based on not only just the observed intrusion detection alerts, but also the unreported signature rules that are revealed in the probability model. The significance of the proposed probabilistic inference is its ability to integrate alert information available from IDS sensors distributed across subnets. We choose the open source Snort to illustrate its feasibility, and demonstrate the inference process applied to the intrusion detection alerts produced by Snort. Through a preliminary experimental study, we illustrate the applicability of AIDF for information integration and the realization of (i) a distributive IDS environment comprised of multiple sensors, and (ii) a mechanism for selecting and integrating the probabilistic inference results from multiple models for composing the most probable forensic explanation.
Why Is Externally-Regulated Learning More Effective Than Self-Regulated Learning with Hypermedia?
Authors: Roger Azevedo, Daniel Moos, Fielding Winters, Jeffrey Greene, Jennifer Cromley, Evan Olson, Pragati Godbole Chaudhuri
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

In this study we examined the effectiveness of self-regulated learning (SRL) and externally-regulated learning (ERL) on adolescents' learning about the circulatory system with hypermedia. A total of 128 middle-school and high school students with little knowledge of the topic were randomly assigned either to the SRL or ERL condition. Learners in the SRL condition regulated their own learning, while learners in the ERL condition had access to a human tutor who facilitated their self-regulated learning. We converged product (pretest-posttest shifts in students' mental models) with process (think-aloud) data to examine the effectiveness of self-and externally-regulated learning about a science topic during a 40-minute session. Findings revealed that the ERL condition facilitated the shift in learners' mental models significantly more than did the SRL condition. Verbal protocol data indicated that learners in the ERL condition regulated their learning by activating prior knowledge, engaging in several monitoring activities, deploying several effective strategies, and engaging in adaptive help-seeking. By contrast, learners in the SRL condition regulated their learning by using fewer monitoring activities, and using several ineffective strategies. We present design principles for adaptive hypermedia learning environments designed to foster students' self-regulated learning of complex and challenging science topics.
Run-hierarchical structure of digital lines with irrational slopes in terms of continued fractions and the Gauss map
Authors: Hanna Uscka-Wehlou
Venue: Pattern Recognition (2009)

We study relations between digital lines and continued fractions. The main result is a parsimonious description of the construction of the digital line based only on the elements of the continued fraction representing its slope and containing only simple integer computations. The description reflects the hierarchy of digitization runs, which raises the possibility of dividing digital lines into equivalence classes depending on the continued fraction expansions of their slopes. Our work is confined to irrational slopes since, to our knowledge, there exists no run-hierarchical and continued fraction based description for these, in contrast to rational slopes which have been extensively examined. The description is exact (it does not use approximations by rationals). Examples of lines with irrational slopes and with very simple digitization patterns are presented. These include both slopes with periodic and non-periodic continued fraction expansions, i.e. both quadratic surds and other irrationals. We also derive the connection between the Gauss map and the digitization parameters introduced by the author in 2007.
Towards ethical aspects on artificial intelligence
Authors: Liliana Rogozea
Venue: Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases (2009)

This paper presents the role of ethics in developing artificial intelligence, and how the artificial intelligence could change our perspective, because artificial intelligence in fact is all around us. Artificial intelligence is an important part of our life, but we are sure that the possibility of acquiring the domination of AI over the humanity is only a myth. During the time, the progress helps society but also brings a number of ethical problems. In the academic society, like in real life, the process of using different kind of power are complex, and even if it is about the robots, the computer or other artificial intelligence tools, the ethical problems are not only theoretical but also practical, it is not only a concept, but it is also a practical support for our life.
3D Rigid registration by cylindrical phase correlation method
Authors: Jakub Bican, Jan Flusser
Venue: Pattern Recognition Letters (2009)

Spatial alignment is an essential step before any further processing (such as fusion and change detection) of multiframe images can be done. We present a new algorithm that aligns translated and rotated pair of 3D images by means of phase correlation method (PCM). PCM is a computationally efficient method for translation estimation. We generalize a known polar-mapping approach of 2D image registration by PCM to estimate mutual rotation of a pair of 3D images about known axis. An improvement of this technique is given to eliminate influence of noise and image differences in non-ideal conditions. Finally, an iterative optimization procedure called cylindrical phase correlation method (CPCM) is proposed which uses these techniques in rigid body registration tasks. We utilize CPCM to register 3D tomographic images of human brain and study its performance in several experiments. CPCM shows extreme robustness to noise and is able to reliably and rapidly align even highly misregistered images.
A logic of games and propositional control
Authors: Nicolas Troquard, Wiebe van der Hoek, Michael Wooldridge
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

We present a logic for reasoning about strategic games. The logic is a modal formalism, based on the Coalition Logic of Propositional Control, to which we add the notions of outcomes and preferences over outcomes. We study the underlying structure of powers of coalitions as they are expressed in their effectivity function, and formalise a collection of solution concepts. We provide a sound and complete axiomatisation for the logic, and we demonstrate its features by applying it to some problems from social choice theory.
Equation-Based Object-Oriented Languages and Tools
Authors: Peter Fritzson, David Broman, François Cellier
Venue: Object-Oriented Technology. ECOOP 2008 Workshop Reader: ECOOP 2008 Workshops Paphos, Cyprus, July 7-11, 2008 Final Reports (2008)

EOOLT'2008 was the second edition of the ECOOP-EOOLT workshop. The workshop is intended to bring researchers associated with different equation-based object-oriented (EOO) modeling languages and different application areas making use of such languages together. The aim of the workshop is to explore common grounds and derive software design principles that may make future EOO modeling languages more robust, more versatile, and more widely accepted among the various stakeholders. At EOOLT'2008, researchers with diverse backgrounds and needs came together to present and discuss fourteen different concept papers grouped into the four topic areas of integrated system modeling approaches; modeling for multiple applications; modeling language design, and equation handling, diagnosis, and modeling.
Access control in the aqualogic data services platform
Authors: Vinayak Borkar, Michael Carey, Daniel Engovatov, Dmitry Lychagin, Panagiotis Reveliotis, Joshua Spiegel, Sachin Thatte, Till Westmann
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

The AquaLogic Data Services Platform (ALDSP) is a middleware platform for building data services that integrate and provide operations over data drawn from spanning multiple heterogeneous information sources. A data service consists of an XML Schema instance, describing its information content, and a collection of XQuery functions and procedures that comprise its set of operations. This paper describes access control in ALDSP. We describe ALDSP's securable resource hierarchy, its fine-grained access control capabilities for securing portions of data service schemas, how XQuery can be used to specify data-driven security policies, and how user identity mapping is supported. We then provide an in-depth overview of how ALDSP works, including implementation techniques to keep access control checking from interacting badly with view rewriting, query optimization, and caching.
Drawing 4-Pfaffian graphs on the torus
Authors: Serguei Norine
Venue: Combinatorica (2009)

We say that a graph G is k-Pfaffian if the generating function of its perfect matchings can be expressed as a linear combination of Pfaffians of k matrices corresponding to orientations of G. We prove that 3-Pfaffian graphs are 1-Pfaffian, 5-Pfaffian graphs are 4-Pfaffian and that a graph is 4-Pfaffian if and only if it can be drawn on the torus (possibly with crossings) so that every perfect matching intersects itself an even number of times. We state conjectures and prove partial results for k>5.
Understanding negative bias temperature instability in the context of hole trapping (Invited Paper)
Authors: T. Grasser, B. Kaczer, W. Goes, Th. Aichinger, Ph. Hehenberger, M. Nelhiebel
Venue: Microelectronic Engineering (2009)

Hole trapping is often considered a parasitic component clouding the real degradation mechanism that is responsible for the negative bias temperature instability (NBTI). As such, it is often dealt with in a rather sketchy way that lacks physical rigor. We review hole trapping mechanisms that go beyond the conventional elastic tunneling mechanism by including structural relaxation and field effects. Contrary to some previous studies, it is shown that the rich spectrum of experimentally observed features of the most commonly observed defect in amorphous oxides, the E' center, is consistent with experimental data available for NBTI. In particular, we show that a full model that includes the creation of E' centers from their neutral oxygen vacancy precursors and their ability to be repeatedly charged and discharged prior to total annealing is consistent with a first stage of degradation. In a second stage, positively charged E' centers can trigger the depassivation of P"b centers at the Si/ SiO"2 interface or K"N centers in oxynitrides to create an unpassivated silicon dangling bond. We formulate a complete model and evaluate it against experimental data.