ppxscal/embedding_network huggingface dataset:
The design and synthesis of a synchronous and distributed MAC protocol for wireless network-on-chip
Authors: Yi Wang, Dan Zhao
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

To bridge the widening gap between computation requirements and communication efficiency faced by gigascale heterogeneous SoCs in the upcoming ubiquitous era, a new on-chip communication system, dubbed Wireless Network-on-Chip (WNoC), is introduced by using the recently developed CMOS proximity wireless interconnection technology. In this paper, a synchronous and distributed medium access control (SD-MAC) protocol is designed and implemented. Tailored for WNoC, SD-MAC employs a binary countdown approach to resolve channel contention between RF nodes. The receiver_select_sender mechanism and hidden terminal elimination scheme are proposed to increase the throughput and channel utilization of the system. Our simulation study shows the promising performance of SD-MAC in terms of throughput, latency, and network utilization. As a major component of simple and compact RF node design, a MAC unit implements the proposed SDMAC that guarantees correct operation of synchronized frames while keeping overhead low. The synthesis results demonstrate several attractive features such as high speed, low power consumption, nice scalability and low area cost.
Performance Study of CSMA/CA over Spectrum Pooling Environment for Cognitive Radios
Authors: Athanassios V. Adamis, Philip Constantinou
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

Spectrum Pooling and unlicensed spectrum access by Cognitive Radios can compensate for spectrum scarcity, caused by static licensing policies, by utilizing spectrum op- portunities. In this work 1 we modify CSMA/CA MAC proto- col for operation over a spectrum pooling environment and for secondary, overlay, distributed Cognitive Radio Net- works. New performance limits and design - tradeoffs are discovered. Moreover, a new MAC protocol is proposed to improve CSMA/CA throughput over spectrum pooling. All MAC protocols are evaluated through extensive simu- lations.
On the behavior of Shannon's sampling series for bounded signals with applications
Authors: Holger Boche, Ullrich J. Mönich
Venue: Signal Processing (2008)

In this paper we discuss the interplay between discrete-time and continuous-time signals and the question, whether certain properties of the signal in one domain carry over to the other domain. The Shannon sampling series and the more general Valiron interpolation series are the appropriate means to obtain the continuous-time, bandlimited signal out of its samples, i.e., the discrete-time signal. We study the effects of the projection operator, that projects the discrete-time signal on the positive time axis and, closely related, the differences in the convergence behavior of the symmetric and asymmetric Shannon sampling series. It is well known, that the space of discrete-time signals with finite energy and the space of continuous-time, bandlimited signals with finite energy are isomorphic. Thus, discrete-time and continuous-time, bandlimited signals with finite energy can be used interchangeably. This interchangeability is not restricted to finite energy signals. It is valid for a considerably larger class, but, as we show by stating an explicit example, not for the space of bounded signals: Even if the discrete-time signal is bounded, the corresponding bandlimited interpolation can be unbounded. In addition to the fact that the Shannon sampling series diverges for this signal, we prove that for this signal there is no bounded, bandlimited interpolation at all. Furthermore, by using the Banach-Steinhaus theorem we show that in a certain sense ''almost all'' signals have this property. Finally, some implications for practical applications are discussed.
Predictive Queries Algorithm Based on Probability Model over Data Streams
Authors: Guohui Li, Hui Chen, Bing Yang, Gang Chen, Jun Xiang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Mining the evolving trends of an online data stream and forecasting the data values in the future can provide important support for the decision-making in many time-sensitive applications. This paper models an online data stream as a continuous state transitions process by mapping the possibly infinite stream data into finite states, and uses State Transition disGraph (STG) to maintain the track of the state transactions. By studying the statistic information of the history state transitions, the future values can be predicted based on the Theory of Markov Chain. Extensive simulation experiments are conducted and show that the predictive performance of our method is preferable to that of the existing analogous algorithms.
The kinetics of the IPSC, the heterogeneity and the noise affect the firing coherence of a population of inhibitory interneurons
Authors: Angelo Di Garbo, Alessandro Panarese, Michele Barbi, Santi Chillemi
Venue: Neurocomputing (2007)

The Fast Spiking interneurons are coupled by both inhibitory and electrical synapses and the experimental findings suggest they operate as clockworks affecting the neural information processing. At present, the functional role of the electrical synapses in a network of inhibitory interneurons is not well understood. In this paper, this issue is investigated by using a single compartment biophysical interneuron model of a Fast Spiking cell. In particular, the parameter values leading to the emergence of synchronous regimes in a network model of inhibitory interneurons coupled by chemical and electrical synapses are determined theoretically in the weak-coupling limit. Moreover, the effects on the firing coherence, arising from heterogeneity and noise, are studied by means of numerical simulations, both for a pair of Fast Spiking cells and for larger size networks.
Scheduling of genetic algorithms in a noisy environment
Authors: Akiko N. Aizawa, Benjamin W. Wah
Venue: Evolutionary Computation (1994)

In this paper, we develop new methods for adjusting configuration parameters of genetic algorithms operating in a noisy environment. Such methods are related to the scheduling of resources for tests performed in genetic algorithms. Assuming that the population size is given, we address two problems related to the design of efficient scheduling algorithms specifically important in noisy environments. First, we study the durution-scheduling problem that is related to setting dynamically the duration of each generation. Second, we study the sample-allocation problem that entails the adaptive determination of the number of evaluations taken from each candidate in a generation. In our approach, we model the search process as a statistical selection process and derive equations useful for these problems. Our results show that our adaptive procedures improve the performance of genetic algorithms over that of commonly used static ones.
Software Hut: A Computer Program Engineering Project in the Form of a Game
Authors: J. J. Horning
Venue: IEEE Transactions on Software Engineering (1977)

The Software Hut (a small software house) is a course project designed for a graduate-level course in computer program engineering. This paper describes the Software Hut project and discusses the authors' experience using it in graduate courses at the University of Toronto. Suggestions for improvements in the project are given.
Evaluation of retrieval effectiveness with incomplete relevance data: Theoretical and experimental comparison of three measures
Authors: Per Ahlgren, Leif Grönqvist
Venue: Information Processing and Management: an International Journal (2008)

This paper investigates two relatively new measures of retrieval effectiveness in relation to the problem of incomplete relevance data. The measures, Bpref and RankEff, which do not take into account documents that have not been relevance judged, are compared theoretically and experimentally. The experimental comparisons involve a third measure, the well-known mean uninterpolated average precision. The results indicate that RankEff is the most stable of the three measures when the amount of relevance data is reduced, with respect to system ranking and absolute values. In addition, RankEff has the lowest error-rate.
Fast Schedulability Analysis Using Commodity Graphics Hardware
Authors: Jimin Feng, Samarjit Chakraborty, Bertil Schmidt, Weiguo Liu, Unmesh D. Bordoloi
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

In this paper we explore the possibility of using commodity graphics processing units (GPUs) to speedup standard schedulability analysis algorithms. Our long-term goal is to exploit GPUs to accelerate common electronic design automation algorithms, most of which tend to be computationally expensive. Our main contribution in this paper is a reformulation of a standard demand bound criteria-based schedulability analysis algorithm as a streaming algorithm expressed in terms of computer graphics primitives. This allows the algorithm to be efficiently implemented on a GPU, thereby resulting in very attractive speedups.
Approximate unions of lines and minkowski sums
Authors: Marc van Kreveld, A. Frank van der Stappen
Venue: Algorithmica (2006)

We study the complexity of, and algorithms to construct, approximations of the union of lines and of the Minkowski sum of two simple polygons. We also studythick unions of lines and Minkowski sums, which are inflated with a small disc. Letb=D/&#x025b; be the ratio of the diameter of the region of interest and the maximum distance (or error) of the approximation. An approximate union of lines or Minkowski sum has complexity &#x0398; (b 2) in the worst case. The thick union ofn lines has complexity &#x03a9;(n+b 2) andO(n +b&#x221a;bn), and thick Minkowski sums have complexity &#x03a9;(n 2+b2) andO((n+b)n&#x221a;blogn+n 2 logn) in the worst case. We present algorithms that run inO(n+n 2/3+&#x03b4; b 4/3 andO(min(bn,n 4/3+&#x03b4; b 2/3)) time (any &#x03b4;>0) for approximate and thick arrangements. For approximate Minkowski sums, the running time isO(min(b 2 n,n 2 +b 2 + (nb)4/3+&#x03b4;); thick Minkowski sums takeO(n 8/3+&#x03b4; b 2/3) time to compute.
A Flexible Non-linear PCA Encoder for Still Image Compression
Authors: Chuanfeng Lv, Zhiwen Liu, Qiangfu Zhao
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

The main hindrance to develop a principal component analysis (PCA) encoder for image compression is the poor generalization ability of PCA. In this paper, we present a flexible semi-universal image encoder based on the recently proposed non-linear PCA framework. Unlike other PCA techniques with a fixed order of principal components, the proposed encoder can flexibly determine which component is more significant to the quality of compression according to the characteristics of the sub-image block to encode. The proposed encoder is used to compress still gray level images, and experimental results indicate that it can provide very good generalization ability as well as high compression ratio.
Multirate Timestepping Methods for Hyperbolic Conservation Laws
Authors: Emil M. Constantinescu, Adrian Sandu
Venue: Journal of Scientific Computing (2007)

This paper constructs multirate time discretizations for hyperbolic conservation laws that allow different timesteps to be used in different parts of the spatial domain. The proposed family of discretizations is second order accurate in time and has conservation and linear and nonlinear stability properties under local CFL conditions. Multirate timestepping avoids the necessity to take small global timesteps (restricted by the largest value of the Courant number on the grid) and therefore results in more efficient algorithms. Numerical results obtained for the advection and Burgers' equations confirm the theoretical findings.
The Electronics Engineer's Design Station
Authors: R. M. Shectman
Venue: IEEE Computer Graphics and Applications (1981)

A prototype graphics system at Lawrence Livermore National Laboratory takes advantage of menu-driven, interactive techniques to simplify the tasks of electronics designers.
Modeling and Integrating Aspects into Component Architectures
Authors: Lydia Michotte, Robert B. France, Franck Fleurey
Venue: Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (2007)

Dependable software systems are difficult to develop because developers must understand and address several interdependent and pervasive dependability concerns. Features that address pervasive dependability concerns such as error detection and recovery tend to crosscut application architecture and thus understanding and changing their descriptions can be difficult. Separating these features at the architectural level allows one to better understand and reuse them and thus can lead to better analysis and evolution of the features during design. In this paper we illustrate how an Aspect Oriented Modeling (AOM) technique can be used to model dependability aspects of component architectures separately from other aspects. The AOM architectural model used to illustrate the approach in this paper consists of a component primary view describing the base architecture and a component template aspect model describing a fault tolerance feature that provides error detection and recovery services.
It's about time: an affective and desirable alarm clock
Authors: Kristin Klauser, Vanessa Walker
Venue: Proceedings of the 2007 conference on Designing pleasurable products and interfaces (2007)

Transcending form, everyday objects evoke emotions and have meaning beyond their physical form. A successful design is dependent on the emotional relationship created between the object and the user and incorporates influential social and cultural concerns. The author presents an affective and desirable process that demonstrates how layers, forming the aesthetics of interaction, create engaging everyday designs. No.21 is an alarm clock designed in order to test the process model for desirable and affective designs. It is a system which promotes longevity by appealing to the needs of the user thus leading to the discovery of interaction.
Synergistic Face Detection and Pose Estimation with Energy-Based Models
Authors: Margarita Osadchy, Yann Le Cun, Matthew L. Miller
Venue: The Journal of Machine Learning Research (2007)

We describe a novel method for simultaneously detecting faces and estimating their pose in real time. The method employs a convolutional network to map images of faces to points on a low-dimensional manifold parametrized by pose, and images of non-faces to points far away from that manifold. Given an image, detecting a face and estimating its pose is viewed as minimizing an energy function with respect to the face/non-face binary variable and the continuous pose parameters. The system is trained to minimize a loss function that drives correct combinations of labels and pose to be associated with lower energy values than incorrect ones. The system is designed to handle very large range of poses without retraining. The performance of the system was tested on three standard data sets---for frontal views, rotated faces, and profiles---is comparable to previous systems that are designed to handle a single one of these data sets. We show that a system trained simuiltaneously for detection and pose estimation is more accurate on both tasks than similar systems trained for each task separately.
Extending q-grams to estimate selectivity of string matching with low edit distance
Authors: Hongrae Lee, Raymond T. Ng, Kyuseok Shim
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

There are many emerging database applications that require accurate selectivity estimation of approximate string matching queries. Edit distance is one of the most commonly used string similarity measures. In this paper, we study the problem of estimating selectivity of string matching with low edit distance. Our framework is based on extending q-grams with wildcards. Based on the concepts of replacement semi-lattice, string hierarchy and a combinatorial analysis, we develop the formulas for selectivity estimation and provide the algorithm BasicEQ. We next develop the algorithm Opt EQ by enhancing BasicEQ with two novel improvements. Finally we show a comprehensive set of experiments using three benchmarks comparing Opt EQ with the state-of-the-art method SEPIA. Our experimental results show that Opt EQ delivers more accurate selectivity estimations.
Searching for Tables in Digital Documents
Authors: Y. Liu, K. Bai, P. Mitra, C. Giles
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

Tables are ubiquitous. In scientific documents, tables are widely used to present experimental results or statisti- cal data in a condensed fashion. Current search engines do not allow the end-user to search for relevant tables. In this paper, we describe TableSeer, an automatic table extraction and search engine system. TableSeer crawls scientific docu- ments, identifies documents with tables, extracts tables from documents, indexes them and enables end-users to search for tables. We also propose an extensive set of medium- independent metadata for tables representation. Given a query, TableSeer ranks the returned results using an inno- vative ranking algorithm TableRank. Our results show that TableSeer outperforms popular search engines, such as Google Scholar when the end-user seeks for tables.
Eon: a language and runtime system for perpetual systems
Authors: Jacob Sorber, Alexander Kostadinov, Matthew Garber, Matthew Brennan, Mark D. Corner, Emery D. Berger
Venue: Proceedings of the 5th international conference on Embedded networked sensor systems (2007)

Embedded systems can operate perpetually without being connected to a power source by harvesting environmental energy from motion, the sun, wind, or heat differentials. However, programming these perpetual systems is challenging. In response to changing energy levels, programmers can adjust the execution frequency of energy-intensive tasks, or provide higher service levels when energy is plentiful and lower service levels when energy is scarce. However, it is often difficult for programmers to predict the energy consumption resulting from these adjustments. Worse, explicit energy management can tie a program to a particular hardware platform, limiting portability. This paper introduces Eon, a programming language and runtime system designed to support the development of perpetual systems. To our knowledge, Eon is the first energy-aware programming language. Eon is a declarative coordination language that lets programmers compose programs from components written in C or nesC. Paths through the program ("flows") may be annotated with different energy states. Eon's automatic energy management then dynamically adapts these states to current and predicted energy levels. It chooses flows to execute and adjusts their rates of execution, maximizing the quality of service under available energy constraints. We demonstrate the utility and portability of Eon by deploying two perpetual applications on widely different hardware platforms: a GPS-based location tracking sensor deployed on a threatened species of turtle and on automobiles, and a solar-powered camera sensor for remote, ad-hoc deployments. We also evaluate the simplicity and effectiveness of Eon with a user study, in which novice Eon programmers produced more efficient efficient energy-adaptive systems in substantially less time than experienced C programmers.
Context of Problem-Solving Systems
Authors: L. R. Symes
Venue: IEEE Transactions on Software Engineering (1977)

Considerable effort has been expanded in attempts to combine the power found in algorithmic languages with the power found in program libraries. However, most of these attempts to construct problem-solving systems for a particular class of users have failed to achieve their objective of providing the user with the potential benefits inherent in such systems. This paper attempts to define and place problem-solving systems in a general context, and thereby shows when the potential for failure or success is high.
Interactive Isosurface Ray Tracing of Time-Varying Tetrahedral Volumes
Authors: Ingo Wald Heiko Friedrich Aaron Knoll Charles D. Hansen
Venue: IEEE Transactions on Visualization and Computer Graphics (2007)

We describe a system for interactively rendering isosurfaces of tetrahedral finite-element scalar fields using coherent ray tracing techniques on the CPU. By employing state-of-the art methods in polygonal ray tracing, namely aggressive packet/frustum traversal of a bounding volume hierarchy, we can accomodate large and time-varying unstructured data. In conjunction with this efficiency structure, we introduce a novel technique for intersecting ray packetswith tetrahedral primitives. Ray tracing is flexible, allowing for dynamic changes in isovalue and time step, visualization of multiple isosurfaces, shadows, and depth-peeling transparency effects. The resulting system offers the intuitive simplicity of isosurfacing, guaranteed-correct visual results, and ultimately a scalable, dynamic and consistently interactive solution for visualizing unstructured volumes.
Competitive Analysis of Static-Priority Partitioned Scheduling on Uniform Multiprocessors
Authors: Bjorn Andersson, Eduardo Tovar
Venue: Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2007)

Consider the problem of scheduling a set of sporadically arriving tasks on a uniform multiprocessor with the goal of meeting deadlines. A processor p has the speed Sp. Tasks can be preempted but they cannot migrate between processors. On each processor, tasks are scheduled according to rate-monotonic. We propose an algorithm that can schedule all task sets that any other possible algorithm can schedule assuming that our algorithm is given processors that are. 3.41 times faster. No such guarantees are previously known for partitioned static-priority scheduling on uniform multiprocessors.
Transport in Protein Crystals, Part II: Diffusion Simulation and Chiral Recognition
Authors: Kourosh Malek
Venue: Computing in Science and Engineering (2007)

This second of a two-part series focuses on diffusion simulation and explores the role of chiral recognition during solute transport in cross-linked protein crystals.
Quality analysis of medical device vigilance reports
Authors: Harri Sievänen, Petri Pommelin
Venue: Technology and Health Care (2003)

The quality of the notifications issued within the European Medical Device Vigilance system were retrospectively reviewed and the adequacy of the recommended guidelines evaluated. The study material comprised all 589 vigilance notifications the Finnish competent authority received from manufacturers and other national competent authorities during 1997, 1999, and 2001. The number of vigilance reports, particularly the reports issued by national competent authorities, has increased from 82 in 1997 up 166 in 2001 while the proportion of reports with demonstrated bearing on health risk has decreased from about 40% down to 20% during the last five years. The number of manufacturers' reports has also increased from 28 in 1997 up to 98 in 2001 while the information given in the reports have become somewhat more incoherent. The time needed to close a device-related incident has increased, too. It is obvious that the present vigilance guidelines provide adequate guidance for both the manufacturers and competent authorities to manage vigilance cases efficiently and appropriately. It is crucial that all pertinent parties should adopt the recommended procedures and act accordingly. The vigilance system underpinned with high quality notifications only assures the continuous enhancement of patient safety, the bottom line.