ppxscal/embedding_network huggingface dataset:
Dirac's map-color theorem for choosability
Authors: T. Böhme, B. Mohar, M. Stiebitz
Venue: Journal of Graph Theory (1999)

It is proved that the choice number of every graph G embedded on a surface of Euler genus ε &ge; 1 and ε &ne; 3 is at most the Heawood number $H(\epsilon)= \lfloor(7+\sqrt{24\epsilon+1})/2\rfloor$ and that the equality holds if and only if G contains the complete graph KH(ε) as a subgraph. &copy; 1999 John Wiley & Sons, Inc. J Graph Theory 32: 327&ndash;339, 1999
Verified enforcement of stateful information release policies
Authors: Nikhil Swamy, Michael Hicks
Venue: Proceedings of the third ACM SIGPLAN workshop on Programming languages and analysis for security (2008)

Many organizations specify information release policies to describe the terms under which sensitive information may be released to other organizations. This paper presents a new approach for ensuring that security-critical software correctly enforces its information release policy. Our approach has two parts. First, an information release policy is specified as a security automaton written in a new language called AIR. Second, we enforce an AIR policy by translating it into an API for programs written in LAIR, a core formalism for a functional programming language. LAIR uses a novel combination of dependent, affine, and singleton types to ensure that the API is used correctly. As a consequence we can certify that programs written in LAIR meet the requirements of the original AIR policy specification.
On the power of small-depth threshold circuits
Authors: J. Hastad, M. Goldmann
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

The power of threshold circuits of small depth is investigated. In particular, functions that require exponential-size unweighted threshold circuits of depth 3 when the bottom fan-in is restricted are given. It is proved that there are monotone functions f/sub k/ that can be computed on depth k and linear size AND, OR circuits but require exponential-size to be computed by a depth-(k-1) monotone weighted threshold circuit.
Software engineering practice and educationan international view
Authors: J Barrie Thompson
Venue: Proceedings of the 2008 international workshop on Software Engineering in east and south europe (2008)

A framework for professionalism produced by the International Federation for Information Processing is used to identify progress and challenges with regard to practice and education in Software Engineering. Finally recommendations are made with respect to opportunities that could be relevant in East and Southern Europe
Learning from labeled features using generalized expectation criteria
Authors: Gregory Druck, Gideon Mann, Andrew McCallum
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

It is difficult to apply machine learning to new domains because often we lack labeled problem instances. In this paper, we provide a solution to this problem that leverages domain knowledge in the form of affinities between input features and classes. For example, in a baseball vs. hockey text classification problem, even without any labeled data, we know that the presence of the word puck is a strong indicator of hockey. We refer to this type of domain knowledge as a labeled feature. In this paper, we propose a method for training discriminative probabilistic models with labeled features and unlabeled instances. Unlike previous approaches that use labeled features to create labeled pseudo-instances, we use labeled features directly to constrain the model's predictions on unlabeled instances. We express these soft constraints using generalized expectation (GE) criteria --- terms in a parameter estimation objective function that express preferences on values of a model expectation. In this paper we train multinomial logistic regression models using GE criteria, but the method we develop is applicable to other discriminative probabilistic models. The complete objective function also includes a Gaussian prior on parameters, which encourages generalization by spreading parameter weight to unlabeled features. Experimental results on text classification data sets show that this method outperforms heuristic approaches to training classifiers with labeled features. Experiments with human annotators show that it is more beneficial to spend limited annotation time labeling features rather than labeling instances. For example, after only one minute of labeling features, we can achieve 80% accuracy on the ibm vs. mac text classification problem using GE-FL, whereas ten minutes labeling documents results in an accuracy of only 77%
Collage - The Carnuntum Scenario
Authors: Manfred Lohr, Elisabeth Wallinger
Venue: Proceedings of the Fifth IEEE International Conference on Wireless, Mobile, and Ubiquitous Technology in Education (2008)

In our paper we describe our pedagogical and technological approach to the design of learning activities that can be conducted outside the classroom during excursions by using PDAs. We realized our ideas by developing a role-play applied in the collaborative and mobile learning platform COLLAGE, which was developed in the framework of an EU project. The game-like scenario enriched the field experience during an outdoor excursion in the Archaeological site of Carnuntum.
Aspect-oriented requirements engineering: a roadmap
Authors: Awais Rashid, Ruzanna Chitchyan
Venue: Proceedings of the 13th international workshop on Early Aspects (2008)

It has been five years since a Vision Paper at the Requirements Engineering Conference in 2002 laid out an initial vision for As-pect-Oriented Requirements Engineering (AORE). This vision included objectives such as offering better means to identify and manage conflicts arising due to tangled representations and identifying the mapping and influence of crosscutting requirements on architecture, design and implementation artefacts. Since then a number of AORE techniques have been proposed in literature. In this paper, we review these techniques and discuss whether and how effectively the original AORE vision from RE 2002 has been realised so far. We also discuss how the original vision needs to be extended given our improved understanding of AORE challenges and present a roadmap for the next five years as a chal-lenge to both existing AORE researchers and those planning to pursue work in this area.
A new multineuron spike train metric
Authors: Conor Houghton, Kamal Sen
Venue: Neural Computation (2008)

The Victor-Purpura spike train metric has recently been extended to a family of multineuron metrics and used to analyze spike trains recorded simultaneously from pairs of proximate neurons. The metric is one of the two metrics commonly used for quantifying the distance between two spike trains; the other is the van Rossum metric. Here, we suggest an extension of the van Rossum metric to a multineuron metric. We believe this gives a metric that is both natural and easy to calculate. Both types of multineuron metric are applied to simulated data and are compared.
Exploiting sequential dependencies for expert finding
Authors: Pavel Serdyukov, Henning Rode, Djoerd Hiemstra
Venue: Proceedings of the 31st annual international ACM SIGIR conference on Research and development in information retrieval (2008)

We propose an expert finding method based on assumption of sequential dependence between a candidate expert and the query terms in the scope of a document. We assume that the strength of relation of a candidate to the document's content depends on its position in this document with respect to the positions of the query terms. The experiments on the official Enterprise TREC data demonstrate the advantage of our method over the method based on independence of query terms and persons in a document.
Delaunay triangulations of polyhedral surfaces, a discrete Laplace-Beltrami operator and applications
Authors: Alexander I. Bobenko
Venue: Proceedings of the twenty-fourth annual symposium on Computational geometry (2008)

A simplicial surface provides its carrier with a natural triangulation whose vertex set includes the cone points and the corners of the boundary. However, this triangulation is not intrinsically distinguished from other triangulations with the same vertex set, it is not preserved under isometric deformations of the surface. Delaunay tessellations of polyhedral surfaces are defined intrinsically in terms of empty discs on surfaces. The edges of Delaunay tessellations are geodesics on the original polyhedral surface (and not necessarily straight edges in the 3-space). For any polyhedral surface there exists a unique Delaunay tessellation. It is not necessarily strongly regular, i.e. the intersection of two closed cells may not be a single closed cell. For discretization of notions of Riemannian geometry it is natural to deal with intrinsic tessellations. We define a discrete Laplace-Beltrami operator for simplicial surfaces. It depends only on the intrinsic geometry of the surface and its edge weights are positive. The intrinsic Laplace-Beltrami operator is based on an intrinsic Delaunay triangulation of the surface. We describe an incremental flipping algorithm to construct such triangulations together with an overlay structure which captures the relationship between the extrinsic and intrinsic triangulations. We demonstrate some numerical benefits of the intrinsic Laplace-Beltrami operator. This talk is based on the original results obtained in [1] and [2].
Progressive lossy to lossless compression of ROI in mammograms: Effects on microcalcification detection
Authors: Imad Zyout, Ikhlas Abdel-Qader, Hazem Al-Otum
Venue: Integrated Computer-Aided Engineering (2008)

Progressive lossy to lossless image compression of region-of-interest (ROI) in digital mammograms ensures receiving data of high quality at early stages of the transmission process which can be very useful for handling mammograms in Picture Archiving and Communication Systems (PACS) and teleradiology systems. In this paper, ROI images corresponding to clustered microcalcification in digitized mammogram are compressed using wavelet based progressive lossy to lossless image compression scheme. The coding scheme is optimized by a proper selection of the combination of reversible wavelet transform filters' and starting bitplane level. The proposed algorithm is implemented and tested using several mammograms from the Mammographic Image Analysis Society (MIAS) database. The experimental results show that ROI- based image compression offers a high visual quality of compressed images at a very low bit rate (0.05 bpp), and the combination of the 2/6 integer wavelet transform and the starting of ROI coding at moderate bitplanes represents an optimal selection. For example, high compression (0.05 bpp) using the 2/6 transform with ROI coding starting at moderate bitplane produced compression results with a lower mean-square-error (MSE) than those obtained from the same transform with ROI coding starting at lower and higher bitplanes. Also, the visual quality of its compression results was better than those of the other transforms.
Vertex pancyclic in-tournaments
Authors: Meike Tewes, Lutz Volkmann
Venue: Journal of Graph Theory (2001)

An in-tournament is an oriented graph such that the negative neighborhood of every vertex induces a tournament. The topic of this paper is to investigate vertex k-pancyclicity of in-tournaments of order n, where for some 3&thinsp;&le;&thinsp;k&thinsp;&le;&thinsp;n, every vertex belongs to a cycle of length p for every k&thinsp;&le;&thinsp;p&thinsp;&le;&thinsp;n. We give sharp lower bounds for the minimum degree such that a strong in-tournament is vertex k-pancyclic for k&thinsp;&le;&thinsp;5 and k&thinsp;&ge;&thinsp;n&thinsp;-&thinsp;3. In the latter case, we even show that the in-tournaments in consideration are fully (n&thinsp;-&thinsp;3)-extendable which means that every vertex belongs to a cycle of length n&thinsp;-&thinsp;3 and that the vertex set of every cycle of length at least n&thinsp;-&thinsp;3 is contained in a cycle of length one greater. In accordance with these results, we state the conjecture that every strong in-tournament of order n with minimum degree greater than ${{9(n-k-1)}\over{5+6k+(-1)^k2^{-k+2}}}+1$ is vertex k-pancyclic for 5&thinsp;<&thinsp;k&thinsp;<&thinsp;n&thinsp;-&thinsp;3, and we present a family of examples showing that this bound would be best possible. &copy; 2001 John Wiley & Sons, Inc. J Graph Theory 36: 84&ndash;104, 2001
Nonlinear attitude and gyroscope's bias estimation for a VTOL UAV
Authors: J. M. Pflimlin, T. Hamel, P. Souères
Venue: International Journal of Systems Science (2007)

This paper addresses the problem of attitude and heading restitution for a VTOL UAV (Vertical Take Off and Landing Unmanned Aerial Vehicle). In a first step, we propose an observation strategy to restore the attitude starting from a measure of the orientation matrix and angular rate readings polluted by an unknown bias vector. In the second step, we detail the implementation of this algorithm in the HoverEye, a ducted fan VTOL UAV developed by Bertin Technologies, equipped with an inertial measurement unit (IMU) and magnetometers. A measured orientation matrix is calculated from the gravity and the earth's magnetic field. Then, an estimated orientation is built by integration of gyroscopic readings, and corrected by the measured ones. The proposed observer, directly designed in the special orthogonal group SO(3), is as efficient as classical Extended Kalman Filtering based observers, but easier to implement in real time. Experiments achieved on the HoverEye illustrate the concept.
Clustering multidimensional sequences in spatial and temporal databases
Authors: Ira Assent, Ralph Krieger, Boris Glavic, Thomas Seidl
Venue: Knowledge and Information Systems (2008)

Many environmental, scientific, technical or medical database applications require effective and efficient mining of time series, sequences or trajectories of measurements taken at different time points and positions forming large temporal or spatial databases. Particularly the analysis of concurrent and multidimensional sequences poses new challenges in finding clusters of arbitrary length and varying number of attributes. We present a novel algorithm capable of finding parallel clusters in different subspaces and demonstrate our results for temporal and spatial applications. Our analysis of structural quality parameters in rivers is successfully used by hydrologists to develop measures for river quality improvements.
Composing software services in the pervasive computing environment: Languages or APIs?
Authors: Jon Robinson, Ian Wakeman, Dan Chalmers
Venue: Pervasive and Mobile Computing (2008)

The pervasive computing environment will be composed of heterogeneous services. In this work, we have explored how a domain specific language for service composition can be implemented to capture the common design patterns for service composition, yet still retain a comparable performance to other systems written in mainstream languages such as Java. In particular, we have proposed the use of the method delegation design pattern, the resolution of service bindings through the use of dynamically adjustable characteristics and the late binding of services as key features in simplifying the service composition task. These are realised through the Scooby language, and the approach is compared to the use of APIs to define adaptable services.
Design of Phase Locked-Loop for Very Slow Sine-Wave Signals
Authors: J. Haze, R. Vrba, R. Prokop
Venue: Proceedings of the Third International Conference on Systems (2008)

The paper describes the design procedure of phase-locked loop (PLL). This PLL is used in measurement chain with pressure sensor and band-pass sigma-delta modulator to synchronize the input slow sine-wave signal from sensor with driving clock (signal from PLL) of modulator. The frequency of input sine-wave signal is 15,625 kHz. The PLL output (voltage controlled-oscillator) has to generate 62,5 kHz square driving signal. The paper shows design process of most important stages in CMOS 0.7 μm AMIS technology and it also presents simulation results, which confirm the design process of these blocks.
Epic: An Open Mote Platform for Application-Driven Design
Authors: Prabal Dutta, David Culler
Venue: Proceedings of the 7th international conference on Information processing in sensor networks (2008)

We present Epic, an open mote platform for application-driven design. Sensornet platforms, like most embedded systems, are tightly coupled to their applications. This coupling can make it difficult for general-purpose platforms to address application-specific needs, forcing platform designers to repeatedly reimplement functionality. Inspired by the hierarchical nature of software and integrated circuit design, we propose sensornet platforms be composed hierarchically from a family of modular components. This approach makes platform development accessible to a much wider community; developers do not need to be analog, sensor, or radio frequency experts, and can instead reuse components that encapsulate the needed functionality.
A Feature Model of E-Government Systems Integrated with Formal Specifications
Authors: Narayan Debnath, Laura Felice, Germán Montejano, Daniel Riesco
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Feature modeling has become one of the most popular methods for representing variabilities and commonalities in software product families. In this paper we describe the feature model for e-government systems. In addition, we present a first approach to integrate formal specifications with feature models in order to produce guidelines to be used in the context of specifications reuse. We show that RSL language can adequately capture relations introducing semantics to the feature model of a system
First Experiments Using the UML Profile for MARTE
Authors: Sébastien Demathieu, Frédéric Thomas, Charles André, Sébastien Gérard, François Terrier
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

A UML profile for Modeling and Analysis of Real-Time and Embedded systems (MARTE) has been recently standardized by the OMG. This initiative meets the needs of several Thales divisions (e.g., aerospace, land and joint and air systems), which develop real-time and embedded systems. CEA LIST, INRIA and Thales have been the main contributors to the MARTE standard through the ProMARTE consortium. To foster the deployment of MARTE in Thales divisions, we have launched the development of a case study related to a real-time and embedded system using the MARTE adopted specification. As a first step of this study, we make use of a fictive system—the Josefil challenge—to evaluate whether the profile is applicable to the Thales current systems andsoftware engineering practices. The purpose of this paper is to report on this first stage and outline the next scheduled activities.
3-D semiconductor's: more from Moore
Authors: Ted Vucurevich
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

Over the past 40 years, the semiconductor industry has exponentially driven cost per function down following the oft stated Moores Law. It is becoming increasingly difficult to scale as we move into the 32nm and beyond process nodes due both to physics and economics. A lower cost alternative method of scaling is becoming more available in the form of vertical chip integration. Many manufacturers now offer a range of package level integration solutions from traditional planar approaches to commonly used die stacking and recently introduced die level 3-D integration. With the introduction of 3-D integration, designers and system integrators can now consider physical design optimizations which include functional stacking, through silicon interconnect to reduce power and signal latency, and optimized manufacturing cost. To enable design teams to take advantage of the benefits available with this technology, new capabilities must be developed to support the design and implementation process. This support must start at the architectural level where issues of robustness, reliability, testability and power must be thoroughly studied. Support must continue through to manufacturing, packaging, and final test development. In this presentation we will explore how existing design technology and methods can be practically evolved to support the powerful scaling capabilities inherent in 3-D integration technology. Specifically we will cover Architectural design space exploration, functional partitioning, physical planning, and timing/SI/thermal/yield analysis for 3-D structures.
Best utilization of a ZF-precoded multiuser MIMO broadcast channel
Authors: Min Lee, Seong Keun Oh
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

We propose a best zero-forcing (ZF) precoding methodology that utilizes best a multiple-input multiple-output broadcast (MIMO-BC) channel. To utilize best a ZF-precoded MIMO-BC channel, we would select the best subset of users for ZF-precoding within a given set of users, so that the maximum sum capacity could be achieved under the given set of users and associated channel condition. We also propose a simple and accurate best-user grouping algorithm that selects a proper subset of users for ZF-precoding without a noticeable loss in the sum capacity. The ZF-precoding methodology based on best-user grouping might improve significantly the sum capacity through pre-exemption of some poor and/or highly correlated users prior to ZF-precoding, rather than simple ZF-precoding followed by a simple water-filling power allocation to all the users considered. Simulation results show that the proposed methodology based on best-user grouping provides a much higher sum capacity than the original one does. The proposed best-user selection algorithm works quite well without noticeable complexity increase and provides the highest sum capacity for ZF-precoding in almost all cases. The performance improvement of the proposed methodology becomes more significant as the number of transmit antennas and associated number of users increases and/or the signal-to-noise ratio (SNR) gets low.
Complexity lower bounds for computation trees with elementary transcendental function gates
Authors: D. Grigoriev, N. Vorobjov
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

We consider computation trees which admit as gate functions along with the usual arithmetic operations also algebraic or transcendental functions like exp, log, sin, square root (defined in the relevant domains) or much more general, Pfaffian functions. A new method for proving lower bounds on the depth of these trees is developed which allows to prove a lower bound /spl Omega/(/spl radic/(log N)) for testing membership to a convex polyhedron with N facets of all dimensions, provided that N is large enough. This method differs essentially from the previous approaches adopted for algebraic computation trees.
Protocol Specification for Conflict Free MANET Address Allocation Mechanisms
Authors: Sudath Indrasinghe, Rubem Pereira, John Haggerty
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

A Mobile Ad-hoc Network (MANET) is a group of mobile hosts communicating with each other via wireless links without infrastructure. Dynamic and distributed network operations are desirable for deploying MANETs due to host mobility. Many schemes have been proposed for address generation and configuration but these are without their problems. In this paper we evaluate the mechanisms of our conflict free address configuration protocol in comparison to other existing MANET auto configuration protocols. Also, we present the main distributed algorithm for new host address configuration and MANETs merging. Finally, we evaluate the protocol to demonstrate the applicability of the approach.