ppxscal/embedding_network huggingface dataset:
Extending a marking tool with simple support for testing
Authors: Guy Tremblay, Louise Laforest, Aziz Salah
Venue: Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education (2007)

Oto is a customizable and extensible marking tool which aims at providing timely feedback to students. Based on simple test cases description formats, Oto also includes operations that help students easily test-even "mark"-their own programs.
A Virtual Garment Design and Simulation System
Authors: Funda Durupynar, Ugur Gudukbay
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

In this paper, a 3D graphics environment for virtual garment design and simulation is presented. The proposed system enables the three dimensional construction of a garment from its cloth panels, for which the underlying structure is a mass-spring model. The garment construction process is performed through automatic pattern generation, posterior correction, and seaming. Afterwards, it is possible to do fitting on virtual mannequins as if in a real life tailor's workshop. The system provides the users with the flexibility to design their own garment patterns and make changes on the garment even after the dressing of the model. Furthermore, rendering alternatives for the visualization of knitted and woven fabric are presented.
A Framework for Adaptive e-Learning Systems in Higher Education with Information Visualization
Authors: Mariko Sasakura, Susumu Yamasaki
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

E-learning systems have become important in higher education, especially in universities. An adaptive e-learning system, which dynamically generates suitable courses for each student, is one of the most remarkable research fields. In this paper, we propose a general framework for adaptive e-learning systems, and discuss the role of information visualization in adaptive e-learning systems.
Experimental Comparison of Automatic Tools for the Formal Analysis of Cryptographic Protocols
Authors: M. Cheminod, I. Cibrario Bertolotti, L. Durante, R. Sisto, A. Valenzano
Venue: Proceedings of the 2nd International Conference on Dependability of Computer Systems (2007)

The tools for cryptographic protocols analysis based on state exploration are designed to be completely automatic and should carry out their job with a limited amount of computing and storage resources, even when run by users having a limited amount of expertise in the field. This paper compares four tools of this kind to highlight their features and ability to detect bugs under the same experimental conditions. To this purpose, the ability of each tool to detect known flaws in a uniform set of well-known cryptographic protocols has been checked.
Modelling of Biochemical Reactions by Stochastic Automata Networks
Authors: Verena Wolf
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

This paper presents a stochastic modelling framework based on stochastic automata networks (SANs) for the analysis of complex biochemical reaction networks. Our approach takes into account the discrete character of quantities of components (i.e. the individual populations of the involved chemical species) and the inherent probabilistic nature of microscopic molecular collisions. Moreover, as for process calculi that have recently been applied to systems in biology, the SAN approach has the advantage of a modular design process being adequate for abstraction purposes. The associated composition operator leads to an elegant and compact representation of the underlying continuous-time Markov chain in form of a Kronecker product. SANs have been extensively used in performance analysis of computer systems and a large variety of numerical and simulative analysis algorithms exist. We illustrate that describing a biochemical reaction network by means of a SAN offers promising opportunities to get insight into the quantitative behaviour of systems in biology while taking advantage of the benefits of a compositional modelling approach.
A Theoretical Framework for End-to-End Video Quality Prediction of MPEG-based Sequences
Authors: Harilaos Koumaras, Anastasios Kourtis, Cheng-Han Lin, Ce-Kuen Shieh
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

This paper presents a novel theoretical framework for end-to-end video quality prediction of MPEG-based video sequences. The proposed framework encloses two discrete models: i) A model for predicting the video quality of an encoded signal at a pre-encoding stage and ii) A model for mapping QoSsensitive network parameters (i.e. packet loss) to video quality degradation. The efficiency of both the discrete models is experimentally validated, proving by this way the accuracy of the proposed framework.
Transient fault prediction based on anomalies in processor events
Authors: Satish Narayanasamy, Ayse K. Coskun, Brad Calder
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Future microprocessors will be highly susceptible to transient errors as the sizes of transistors decrease due to CMOS scaling. Prior techniques advocated full scale structural or temporal redundancy to achieve fault tolerance. Though they can provide complete fault coverage, they incur significant hardware and/or performance cost. It is desirable to have mechanisms that can provide partial but sufficiently high fault coverage with negligible cost. To meet this goal, we propose leveraging speculative structures that already exist in modern processors. The proposed mechanism is based on the insight that when a fault occurs, it is likely that the incorrect execution would result in abnormally higher or lower number of mispredictions (branch mispredictions, L2 misses, store set mispredictions) than a correct execution. We design a simple transient fault predictor that detects the anomalous behavior in the outcomes of the speculative structures to predict transient faults.
An approach for mining services in database oriented applications
Authors: Concettina Del Grosso, Massimiliano Di Penta, Ignacio Garcia-Rodriguez de Guzman
Venue: Proceedings of the 11th European Conference on Software Maintenance and Reengineering (2007)

The diffusion of service oriented architectures is slowed down by the lack of enough services available for satisfying service integrator needs. Nevertheless, many features desired by service integrators have already been implemented in existing software systems. To this aim, approaches able to identify potential services into a legacy system source code are highly desirable. This paper proposes an approach to identify, from database - oriented applications, pieces of functionality to be potentially exported as services. The identification is performed by clustering, through formal concept analysis, queries dynamically extracted by observing interactions between the application and the database. The approach has been assessed by identifying potential services in two Java software systems.
gCitizen: Using Grids for Creating an Integrated View of the Citizen in an eGovernment Framework
Authors: Carlos de Alfonso, Miguel Caballer, Jose V. Carrion, Vicente Hernandez
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

From the point of view of the Administration, a citizen is the aggregation of the pieces of information belonging to each of the administrative organizations that compose it. By now this data management has been carried out storing and managing documents in paper. Recently, the governments have invested effort to use the ICT as a substitute of the paper in their procedures. This kind of initiatives has been traditionally denominated as eGovernment, and makes possible a lot of information to be online. This paper reviews the technological tendencies in the Public Administration, and proposes the usage of Grid technology as an information integration method to provide an homogeneous vision of the information about the citizens. It has been used the Globus Toolkit 4 WSRF technology to design gCitizen, a Grid middleware for the transparent management of the information about citizens, which takes advantages of the features provided by the toolkit, and introduces new services to improve it.
Decision Tools for Reducing Congestion at Locks on the Upper Mississippi River
Authors: James F. Campbell, L. Douglas Smith, Donald C. II Sweeney, Ray Mundy, Robert M. Nauss
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This paper describes the development of tools to support better scheduling and sequencing of barge tows on a congested portion of the Upper Mississippi River. Our study section covers 100 miles and includes five 600-foot long locks that handle commercial tows up to 1200 feet long. Due to the varying nature of the traffic and lockage times (especially the need to split long tows to pass through smaller locks), long queues may form at the locks. This paper provides an overview of our research, including evaluation of lock and traffic management policies, development of a detailed multi-lock simulation model, evaluation of decision rules for sequencing vessels in queues, and development of a prototype GIS-based vessel tracking system. Our findings suggest that better sequencing of vessels at locks would provide small improvements at current traffic levels, but may reduce waiting time by as much as 25% with increasing levels of demand.
Powered by the wind and the sun, Baltimore High School students get a jump start on college
Authors: T. M. Regan, L. Fritzche
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

Summary form only given. In an innovative pilot program, students at Baltimore's prestigious technology magnet school are designing, manufacturing, assembling and testing solar-powered cookers and windmills alongside first-year students at the University of Maryland's A. James Clark School of Engineering. This cooperative venture, called "PracticUM", gives seniors at Baltimore Polytechnic Institute experience in college-level design classes, in addition to college credit. They spend the entire semester learning computer-aided design, spreadsheet skills, team work, customer requirements, design, manufacturing, cost constraints, and engineering sciences. They use these skills to design devices with real-world applications. This "hands-on" method of learning engineering is an outgrowth of the extraordinarily successful "Introduction to Engineering Design" freshmen program at the University of Maryland.
I1)-Musika: Mobile Interface Musical Expression (MIME)
Authors: Lin Hsin Hsin
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

Consider mobility and flexibility to be part of musical instrument design architecture and playing the instrument as a choreography with 3D installation. I-Musika:MIME (Mobile Interface Musical Expression) is a multidimensional interface that seeks to integrate at least three "disjoint neighborhoods" or entities: "keys, instruments and players". Based on the frequency resonating structures modeling paradigm, I-Musika:MIME transfigures the properties and geometry of musical instrument and unifies the excitation methods for different instruments, thus offering multiple (distinct) designs for a single instrument or a single design for multiple (distinct) instruments via an interface that provides contact free playing. As such, not only it transforms the keys-instruments-players relationship and creates new performing style that is insensitive to posture, hand and finger positioning, it creates a new audience-player-instrument profile. Harnessing the properties of this interface, I-Musika:MIME, the new instrument is portable with an artistic physical appearance or visual representation as desired. It can be modified and achieved as you pleased to add another dimension to musical pleasure.
An Accurate Analytical SNM Modeling Technique for SRAMs Based on Butterworth Filter Function
Authors: Qikai Chen, Arjun Guha, Kaushik Roy
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

With the impact of process variations becoming increasingly pronounced in the sub-90nm regime, the stability of SRAM cells is considerably degraded. Static noise margin (SNM) is popularly used for SRAM stability measurement. Therefore, efficient techniques to estimate SNM are required for robust SRAM design. In this paper, we have proposed an analytical SRAM SNM modeling technique based on Butterworth function and coordinate transformation. The accuracy of the SNM model has been verified by changing of the SRAM design parameters, such as the relative sizes of the 6 transistors and device doping. With a wide range of design parameter change, less than 8% of estimation error is achieved by the proposed SNM model. The proposed SNM model has been applied to analyze the impact of process variations on SRAM SNM distribution. Also, the distribution of read SNM has been estimated for a range of design parameter variations.
(Almost) Tight bounds and existence theorems for single-commodity confluent flows
Authors: Jiangzhuo Chen, Robert D. Kleinberg, László Lovász, Rajmohan Rajaraman, Ravi Sundaram, Adrian Vetta
Venue: Journal of the ACM (JACM) (2007)

A flow of a commodity is said to be confluent if at any node all the flow of the commodity leaves along a single edge. In this article, we study single-commodity confluent flow problems, where we need to route given node demands to a single destination using a confluent flow. Single- and multi-commodity confluent flows arise in a variety of application areas, most notably in networking; in fact, most flows in the Internet are (multi-commodity) confluent flows since Internet routing is destination based. We present near-tight approximation algorithms, hardness results, and existence theorems for minimizing congestion in single-commodity confluent flows. The maximum edge congestion of a single-commodity confluent flow occurs at one of the incoming edges of the destination. Therefore, finding a minimum-congestion confluent flow is equivalent to the following problem: given a directed graph G with k sinks and non-negative demands on all the nodes of G, determine a confluent flow that routes every node demand to some sink such that the maximum congestion at a sink is minimized. The main result of this article is a polynomial-time algorithm for determining a confluent flow with congestion at most 1 &plus; ln(k) in G, if G admits a splittable flow with congestion at most 1. We complement this result in two directions. First, we present a graph G that admits a splittable flow with congestion at most 1, yet no confluent flow with congestion smaller than Hk, the kth harmonic number, thus establishing tight upper and lower bounds to within an additive constant less than 1. Second, we show that it is NP-hard to approximate the congestion of an optimal confluent flow to within a factor of (log2k)/2, thus resolving the polynomial-time approximability to within a multiplicative constant. We also consider a demand maximization version of the problem. We show that if G admits a splittable flow of congestion at most 1, then a variant of the congestion minimization algorithm yields a confluent flow in G with congestion at most 1 that satisfies 1/3 fraction of total demand. We show that the gap between confluent flows and splittable flows is much smaller, if the underlying graph is k-connected. In particular, we prove that k-connected graphs with k sinks admit confluent flows of congestion less than C &plus; dmax, where C is the congestion of the best splittable flow, and dmax is the maximum demand of any node in G. The proof of this existence theorem is non-constructive and relies on topological techniques introduced by Lov&aacute;sz.
Automatic Testing Tool for OSCAR Using System-level Virtualization
Authors: Geoffroy Vallee, Thomas Naughton, Wesley Bland, Stephen L. Scott
Venue: Proceedings of the 21st International Symposium on High Performance Computing Systems and Applications (2007)

To ensure quality, software development has to include testing mechanisms. OSCAR today supports several Linux distributions and several architectures. In such a context, the release cycle suffers of a important overhead created by the testing and stabilization phase. To address this issue, an approach is to implement a tool for automatic testing. This paper presents such a tool which is based on the OSCAR command line interface. This tool, based on systemlevel virtualization techniques, creates a virtual cluster to perform the test. This approach has the benefit of not corrupting the system of the physical machine and guarantee that the environment used for testing has not been corrupted before testing.
Geographical Mashups
Authors: Kevin Curran
Venue: IEEE Distributed Systems Online (2007)

A review of "Google Maps Hacks" by Rich Gibson and Schuyler Erle
Offline recognition of omnifont Arabic text using the HMM ToolKit (HTK)
Authors: M. S. Khorsheed
Venue: Pattern Recognition Letters (2007)

This paper presents a cursive Arabic text recognition system. The system decomposes the document image into text line images and extracts a set of simple statistical features from a narrow window which is sliding a long that text line. It then injects the resulting feature vectors to the Hidden Markov Model Toolkit (HTK). HTK is a portable toolkit for speech recognition system. The proposed system is applied to a data corpus which includes Arabic text of more than 600 A4-size sheets typewritten in multiple computer-generated fonts.
Dynamic UEP of embedded image bit streams over noisy channels
Authors: M. Zhao
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

We present a dynamic unequal error protection (UEP) framework for the embedded image bit streams over noisy channels. A general source model for M-rate UEP schemes is derived and an optimization algorithm for 2-rate dynamic UEP schemes is developed. To facilitate the design and implementation of UEP schemes, we also derived a necessary condition and an upper bound for UEP gains. Simulation results demonstrate about 0.3 dB improvements over equal error protection (EEP) schemes at the price of negligible overheads while the progressiveness of the original bit streams is still kept.
A Max-Min Approach for Hiding Frequent Itemsets
Authors: George V. Moustakides, Vassilios S. Verykios
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

In this paper we are proposing a new algorithmic approach for sanitizing raw data from sensitive knowledge in the context of mining of association rules. The new approach (a) relies on the maxmin criterion which is a method in decision theory for maximizing the minimum gain and (b) builds upon the border theory of frequent itemsets.
Montana smart pointers: they're smart, and they're pointers
Authors: Jennifer Hamilton
Venue: Proceedings of the 3rd conference on USENIX Conference on Object-Oriented Technologies (COOTS) - Volume 3 (1997)

The Montana C++ programming environment provides an API interface to the compiler, which allows the compilation process to be extended through programmer-supplied tools. This paper investigates the feasibility of that interface, using smart pointers as an example. Smart pointers are a powerful feature of the C++ language that enable a variety of applications, such as garbage collection, persistence, and distributed objects. However, while smart pointers can be used in much the same way as built-in pointers, they are not interchangeable. Using the Montana API, smart pointer functionality can be introduced for built-in pointers, thus enabling built-in pointers that act like smart pointers. We provide an overview of the Montana programming environment and describes how smart pointers can be implemented using the Montana API.
Low Shift and Capture Power Scan Tests
Authors: Santiago Remersaro, Xijiang Lin, Sudhakar M. Reddy, Irith Pomeranz, Janusz Rajski
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

Supply current and power dissipation during scan based test may be much higher than during normal circuit operation due to larger switching activity caused by the tests. Higher peak current demands may cause supply voltage droops causing good chips to fail at-speed tests. Higher average switching activity causes higher power dissipation and chip temperature that may cause hot spots and damage circuits under test. Several works have proposed methods to derive tests with lower peak and average switching activity during test response capture or during scan shifts. Some of these methods require additional hardware and modifications to the scan chains. In this paper we investigate a method to derive tests with reduced switching activity both during scan shifts and during test response captures. The method does not require additional hardware or modifications to the scan chains. The proposed method accepts a given test set and returns a test set of the same or smaller size with reduced switching activity. Experimental results on benchmark and industrial circuits are given.
A Proposal and Initial Design of the Morph Packaging System
Authors: Kentaro TAKEMURA, Yasuo SHIRAI, Tetsuo OGINO, Hideyuki TAKADA, Tsuneo JOZEN
Venue: Proceedings of the Fifth International Conference on Creating, Connecting and Collaborating through Computing (2007)

In these days, the number of educators who use Squeak in their education is increasing. However, most of them do not have enough experience in teaching with Squeak and are looking for how to educate children with it. We introduce a new system, which helps us to generate new specialized morph kits. This system helps educators to create and share good methods of Squeak education by the specialized kits. We held a workshop using a specialized kit, "Animation Morph", and found that the specialized kit was effective in Squeak education. We also compare existing Squeak systems and consider what is important for the new system.