ppxscal/embedding_network huggingface dataset:
Checking system rules using system-specific, programmer-written compiler extensions
Authors: Dawson Engler, Benjamin Chelf, Andy Chou, Seth Hallem
Venue: Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4 (2000)

Systems software such as OS kernels, embedded systems, and libraries must obey many rules for both correctness and performance. Common examples include "accesses to variable A must be guarded by lock B," "system calls must check user pointers for validity before using them," and "message handlers should free their buffers as quickly as possible to allow greater parallelism." Unfortunately, adherence to these rules is largely unchecked. This paper attacks this problem by showing how system implementors can use meta-level compilation (MC) to write simple, system-specific compiler extensions that automatically check their code for rule violations. By melding domain-specific knowledge with the automatic machinery of compilers, MC brings the benefits of language-level checking and optimizing to the higher, "meta" level of the systems implemented in these languages. This paper demonstrates the effectiveness of the MC approach by applying it to four complex, real systems: Linux, OpenBSD, the Xok exokernel, and the FLASH machine's embedded software. MC extensions found roughly 500 errors in these systems and led to numerous kernel patches. Most extensions were less than a hundred lines of code and written by implementors who had a limited understanding of the systems checked.
Efficient Computation of Iceberg Cubes by Bounding Aggregate Functions
Authors: Xiuzhen Zhang Pauline Lienhua Chou Guozhu Dong
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

The iceberg cubing problem is to compute the multidimensional group-by partitions that satisfy given aggregation constraints. Pruning unproductive computation for iceberg cubing when nonantimonotone constraints are present is a great challenge because the aggregate functions do not increase or decrease monotonically along the subset relationship between partitions. In this paper, we propose a novel bound prune cubing (BP-Cubing) approach for iceberg cubing with nonantimonotone aggregation constraints. Given a cube over n dimensions, an aggregate for any group-by partition can be computed from aggregates for the most specific n--dimensional partitions (MSPs). The largest and smallest aggregate values computed this way become the bounds for all partitions in the cube. We provide efficient methods to compute tight bounds for base aggregate functions and, more interestingly, arithmetic expressions thereof, from bounds of aggregates over the MSPs. Our methods produce tighter bounds than those obtained by previous approaches. We present iceberg cubing algorithms that combine bounding with efficient aggregation strategies. Our experiments on real-world and artificial benchmark data sets demonstrate that BP-Cubing algorithms achieve more effective pruning and are several times faster than state-of-the-art iceberg cubing algorithms and that BP-Cubing achieves the best performance with the top-down cubing approach.
Democracy's downfall: is the computing technology for electronic voting secure and reliable enough for national use?
Authors: Joshua Gaines
Venue: ACM SIGCAS Computers and Society (2006)

Our Founding Fathers wanted to live in a country of freedom. To serve the people, democracy was born as our government. Electing whom they want to represent them in office, the people have the power to vote for a candidate of their choosing. However, this power is disintegrating due to the extreme errors caused by electronic voting machines. In the year 2000, one out of every nine voting precincts used electronic voting machines (Fisher "Election" 4). Tadayoshi Kohno says, "Our analysis shows that this voting system is far below even the most minimal security standards applicable in other contexts" (Kohno 1). The sum of all the errors caused by these machines greatly threatens our democracy. Direct recording electronic voting machines (DRE's) are not ready for national use.
XCML: A Runtime Representation for the Context Modelling Language
Authors: Ricky Robinson, Karen Henricksen, Jadwiga Indulska
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

The Context Modelling Language (CML), derived from Object Role Modeling (ORM), is a powerful approach for capturing the pertinent object types and relationships between those types in context-aware applications. Its support for data quality metrics, context histories and fact type classifications make it an ideal design tool for context-aware systems. However, CML currently lacks a suitable representation for exchanging context models and instances in distributed systems. A runtime representation can be used by context-aware applications and supporting infrastructure to exchange context information and models between distributed components, and it can be used as the storage representation when relational database facilities are not present. This paper shows the benefits of using CML for modelling context as compared to commonly used RDF/OWL-based context models, shows that translations of CML to RDF or OWL are lossy, discusses existing techniques for serialising ORM models, and presents an alternative XML-based representation for CML called XCML.
Fracture behaviour of single crystal silicon microstructures
Authors: F. F. Meroni, E. Mazza
Venue: Proceedings of the Symposium on Design, Test, Integration and Packaging of MEMS/MOEMS (2003)

The fracture behaviour of single crystal silicon (SCSi) microstructures is analysed based on micromechanical torsional and tensile experiments. The uniaxial testpieces are characterised by the presence of sharp notches at the gauge length extremities. The critical loading conditions are reproduced in a finite element model in order to identify the analogies of the failure conditions in tension and torsion. The stress field in the vicinity of the notch tip (were cracks originate) is analyzed, and fracture mechanics parameters are determined. In the finite element model a crack, reproducing the failure process observed in the experiments, is included. The crack area is incrementally increased and the energy release rate for the critical loading conditions in tension and torsion is calculated based on these results a failure criterion is formulated along with a procedure for the mechanical integrity analysis of SCSi microstructures of arbitrary shape and loading conditions.
Tactile Perception of Rotational Sliding
Authors: William R. Provancher, Brandt D. Erickson, Federico Barbagli, Hong Z. Tan
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

We present a new tactile display for rendering rotational friction at the fingertips. To inform the design and control of this device, we have conducted an initial set of perceptual experiments to investigate perceptual thresholds for rates of rotational slipping at the fingertips. It was found that humans can discriminate a change in rotational sliding rate of 4.13-28.04 rad/sec from a reference rate of 1.57-25.13 rad/sec. An initial device design and prototype are presented. The device utilizes a small friction disk housed in a thimble, driven remotely from a motor worn on the user's wrist. The device directly integrates with a robotic force feedback arm, preserving the force feedback functionality while adding the tactile information on frictional sliding. Insights from the presented psychophysical experiments and initial device prototype will be utilized in the design of the next generation of rotation friction devices that will be used in multi-finger grasp studies.
WCET analysis of instruction caches with prefetching
Authors: Jun Yan, Wei Zhang
Venue: Proceedings of the 2007 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems (2007)

Instruction prefetching is an effective technique to reduce the instruction cache miss latency for improving the average-case performance. For real-time systems, however, the use of instruction prefetching will only besuitable if a reasonably tight worst-case performance of programs using instruction prefetching can be predicted. This paper presents an approach to modeling and computing the worst-case instruction cache performance with prefetching. Our experimental results indicate that instruction prefetching can benefit both the average-case and worst-case performance; however, the degree of the worst-case performance improvement due to instruction prefetching is less than that of the average-case performance, thus leading to increased time variation for real-time computing. Also, we find that the prefetching distance can significantly impact the worst-case performance analysis with instruction prefetching. Particularly, when the prefetching distance is equal to the L1 miss penalty, the worst-case execution time with instruction prefetching is minimized (i.e., optimal).
An Improved Wavelet-based Watermarking Method Using the Mathematical Morphology
Authors: Kasemsuk Sepsirisuk, Kiyoaki Atsuta, Shozo Kondo
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

In this paper, we propose an improved waveletbased watermarking method using the mathematical morphology. The wavelet coefficients of host image are firstly selected as the significant coefficients by a statistical predetermined threshold. The mathematical operations are then performed to tame some small perturbations on the selected coefficients caused by the manipulations or attacks. Moreover, the pixel-wise masking model which exploits the characteristics of Human Visual System is employed for improving watermark invisibility and robustness. The experimental results verify that our method is more robust and effective than the existing method.
Modeling assessment for re-use of traditional and new types of assessment
Authors: Desirée Joosten-ten Brinke, Jan van Bruggen, Henry Hermans, Jan Burgers, Bas Giesbers, Rob Koper, Ignace Latour
Venue: Computers in Human Behavior (2007)

In the new learning approach assessment is integrated in learning and instruction and addresses complex traits (the abilities, the characteristics in a specific domain) of students. To match this new approach, new types of assessment are developed, like peer assessment or competence assessment. The development of these new assessments is an expensive and intensive activity. Exchange initiatives promise to reduce those efforts by the re-use of materials. But they also raise questions: is it a complete assessment or are there specific parts of an assessment that can be re-used? And is re-use limited to particular item formats? In order to support the re-use of both new and traditional assessment types an educational model for assessment is developed. In this article we present this model. The model is validated against [Stiggins, R. J. (1992). Het ontwerpen en ontwikkelen van performance-assessment toetsen [Design and development of performance assessments]. In J. W. M. Kessels, & C. A. Smit (Eds.). Opleiders in organisaties/Capita Selecta (pp. 75-91). Deventer: Kluwer (afl. 10)] guidelines for the development of performance assessments, the four-process framework of [Almond, R. G., Steinberg, L., & Mislevy, R. J. (2001). A sample assessment using the four-process framework. CSE Report 543. Center for study of evaluation, University of California, Los Angeles. Retrieved November 15, 2005 from http://www.cse.ucla.edu/cresst/reports/tech543.pdf; Almond, R. G., Steinberg, L., & Mislevy, R. J. (2003). A four-process architecture for assessment delivery, with connections to assessment design. CSE Report 616. Center for study of evaluation. University of California, Los Angeles], a specification for the exchange and interoperability of assessments and performance assessment as a new type of assessment. The educational model for assessment gives new input to the alignment of the teaching, learning and assessment.
TXT-2-LRN: improving students' learning exper ience in the classroom through interactive SMS
Authors: Eusebio Scornavacca, Stephen Marshall
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The increasing sophistication and rapid uptake of mobile phones among university students is providing an unprecedented platform for the development of classroom interaction systems. This paper describes the development of a SMS-based classroom interaction system and explores the impact that this application can have on students' learning experience. The findings indicate that instructors and students perceive a number of benefits from the additional channel of communication in the classroom. The paper concludes with a summary and recommendations for future practice and research.
Performance analysis of the FH/CPFSK system under partial-band jamming
Authors: Won-Sub Kim, Kenu-Yeol Jeon, Kyung-Sik Kang
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

A performance analysis of the FH/CPFSK system was conducted in consideration of thermal noise, partial-band noise jamming, and interference between symbols of adjacent 8-bit patterns. Bit rate and frequency modulation were used as parameters for the performance analysis of the FH/CPFSK system. Also, this study presents the optimal receiving correlation function using differential detection and performs comparative evaluation between the FH/CPFSK system and the FH/BFSK system. As a result, it was found that bit error probabilities for the approximate expression and actual expression were almost consistent in noise ratio of the high signal-to-noise ratio. As for performance according to the jamming rate, the FH/CPFSK system, which used a differential detector, was lower by 3dB compared to the FH/CPFSK that used a limiter-discriminator. However, the performance of the FH/CPFSK system was higher by 2 dB than that of the FH/BFSK system.
A Fast, Partially Parallelizable Algorithm for Predicting Execution Time of EQL Rule-Based Programs
Authors: Jeng-Rung Chen, Albert Mo Kim Cheng
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 03 (1994)

Real-time expert systems are embedded decision systems which must respond to changes in the environments within stringent timing constraints. A major problem impeding the use of rule-based expert systems in real-time environments is the difficulty in predicting the response time of these rule-based systems. In this paper, we tackle this problem with a fast, partially parallelizable response time analysis algorithm for a class of EQL rule-based programs with constant assignments in the action parts of the rules.
On inequalities between mutual information and variation
Authors: V. V. Prelov
Venue: Problems of Information Transmission (2007)

We continue studying the relationship between mutual information and variational distance started in Pinsker's paper [1], where an upper bound for the mutual information via variational distance was obtained. We present a simple lower bound, which in some cases is optimal or asymptotically optimal. A uniform upper bound for the mutual information via variational distance is also derived for random variables with a finite number of values. For such random variables, the asymptotic behaviour of the maximum of mutual information is also investigated in the cases where the variational distance tends either to zero or to its maximum value.
Scalable defect mapping and configuration of memory-based nanofabrics
Authors: Chen He, M. F. Jacome, G. de Veciana
Venue: Proceedings of the High-Level Design Validation and Test Workshop, 2005. on Tenth IEEE International (2005)

Producing reliable nanosystems requires effectively addressing the high defect densities projected for nanotechnologies. Defect avoidance methodologies based on reconfiguration offer a promising solution to achieve defect tolerance. The idea is to start by obtaining a defect map of the target nanofabric, and then configure the desired functionality 'around' its defective components. In this paper, we argue for the suitability of memory-based computing nanofabrics, address the level of granularity at which defect mapping and configuration should be performed on such fabrics, and discuss the role of hierarchy towards controlling complexity. We then propose a group testing method to enable self-testing and self-configuration for appropriately architected memory-based nanofabrics. The proposed testing method is scalable and simple, in that it enables the entire fabric to be tested and configured using a relatively small number of easily configurable triple-module-redundancy (TMR) test tiles executing concurrently on different regions of the target nanofabric. Our experimental results demonstrate the effectiveness of the proposed method for a representative set of benchmark kernels.
Protocol independence using the sockets API
Authors: Craig Metz
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (2000)

The BSD sockets API provides abstractions and other features that help applications be protocol-independent. Unfortunately, not all of the API is abstract and generic, and many programs do not use the APIs in a protocol-independent way. This means that most network programs, in practice, only work with one layered set of communications protocols - usually TCP over IP. This hinders compatibility with older protocols and deployment of new ones, and is making IP a victim of its own success. During the course of next-generation IP development, implementors worked to convert protocol-dependent applications into protocol-independent applications. Along the way, they defined new interfaces to fix some problems and they found a number of usage problems that lead to protocol dependencies. This paper explains many of the problems encountered, using examples from freely available software, and how to solve them. It also explains many of the new protocol-independent interfaces.
Time series prediction via neural network inversion
Authors: Lian Yan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

In this work, we propose neural network inversion of a backward predictor as a technique for multi-step prediction of dynamic time series. It may be difficult to train a large network to capture the correlation that exists in some dynamic time series represented by small data sets. The new approach combines an estimate obtained from a forward predictor with an estimate obtained by inverting a backward predictor to more efficiently capture the correlation and to achieve more accurate predictions. Inversion allows us to make causal use of prediction backward in time. Also a new regularization method is developed to make neural network inversion less ill-posed. Experimental results on two benchmark time series demonstrate the new approach's significant improvement over standard forward prediction, given comparable complexity.
Fighting Information Overflow with Personalized Comprehensive Information Access: A Proactive Job Recommender
Authors: Danielle H. Lee, Peter Brusilovsky
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

Searching for jobs online is an information intensive activity, because thousands of jobs are posted on the Web daily and it takes a great deal of effort to find the right position. Job search sites require recommender systems to meet diversified information needs: Job seekers who have well-defined careers try to focus on relevant open positions while students who have general and evolving interests want to follow the dominant trends of the job market in order to plan their career path. In this paper, we introduce a comprehensive job recommender system. From the user's perspective, four different kinds of recommendations are implemented. Users of this system can retrieve open jobs with different methods, ranging from exploring to searching.
Towards Dynamic Interorganizational Business Process Management
Authors: Paul Grefen
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

In the modern day business world, we see more and more complex collaboration scenarios in which multiple autonomous organizations work together. From a business perspective, we distinguish between horizontal and vertical relationships. We argue that the concept of business process is central in both forms of collaboration. From a technical perspective, we find that multiple technology classes must be combined. In this paper, we choose process management technology, agent technology and (web) service technology as an important example combination. We show that the choice of specific technologies and their combination into platform topologies is not trivial.
Analysis of IEEE 802.11e for Delay Sensitive Traffic in Wireless LANs
Authors: Anna Shklyaeva, David Kubanek, Vit Novotny
Venue: Proceedings of the Sixth International Conference on Networking (2007)

Mechanisms providing quality of services (QoS) in wireless LAN networks based on the 802.11e standard are described. OPNET software was used to model equivalent networks with and without QoS support. The resulting parameters of both networks, such as media access delay, end-to-end delay, packet queue size, queuing delay or bit error rate were compared. The influence of introducing the QoS mechanism on these parameters is discussed.
Using an Architecture Reasoning Tool to Teach Software Architecture
Authors: John D. McGregor, Felix Bachman, Len Bass, Philip Bianco, Mark Klein
Venue: Proceedings of the 20th Conference on Software Engineering Education & Training (2007)

The Architecture Expert (ArchE) is a software architecture design assistant under development at the Software Engineering Institute (SEI). It embodies knowledge of quality attributes and the relation between the achievement of quality attribute requirements and architecture design. In this paper, we describe the use of ArchE in a graduate level software architecture class at Clemson University. The discussion combines aspects of using ArchE as a tool to produce architectures and using ArchE to teach about architecting. The students were positive about the use of ArchE although critical of ArchE's immaturity. The instructor was also positive about the use of ArchE.
Scalability of Parallel Algorithms for Matrix Multiplication
Authors: Anshul Gupta, Vipin Kumar
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 03 (1993)

A number of parallel formulations of dense matrix multiplication algorithm have been developed. For arbitrarily large number of processors, any of these algorithms or their variants can provide near linear speedup for sufficiently large matrix sizes and none of the algorithms can be clearly claimed to be superior than the others. In this paper we analyze the performance and scalability of a number of parallel formulations of the matrix multiplication algorithm and predict the conditions under which each formulation is better than the others.