ppxscal/embedding_network huggingface dataset:
Senior-level undergraduate student team teaching of an entire engineering elective course
Authors: J. Adams
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

A case study has been conducted at the University of Nevada Reno (UNR), USA, in collaboration with the Stanford Learning Laboratory, to investigate the advantages and disadvantages of student peer teaching of an entire course. This effort has included two senior-level Mechanical Engineering elective courses at the University of Nevada Reno. The first course was Thermodynamics II (Spring 2000) and the second was Manufacturing Processes (Fall 2000). The objective of this study was to explore the hypothesis that senior mechanical engineering students can effectively teach an elective class to each other with only the coaching of an instructor. Effectiveness was measured with student surveys, tests and observation. A comparison of the first and second course taught with this method, the lessons learned, faculty and student reactions, and recommendations for future courses are presented.
Overfitting avoidance in genetic programming of polynomials
Authors: N. Nikolaev, L. M. de Menezes, H. Iba
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

This paper proposes several techniques for avoiding overfitting in the genetic programming (GP) of polynomials. The model specification flexibility is increased by: (1) a polynomial block reformulation, which reduces the statistical bias, and, (2) complexity tuning using local ridge regression and regularized weight subset selection, which reduce the statistical variance. Another contribution is the designed fitness function for search navigation towards highly predictive models. Experimental results on time-series forecasting show that these techniques help GP to find accurate, less complex and better forecasting polynomials than traditional Koza-style GP (J.R. Koza, 1992) and the previous Stroganoff system (H. Iba et al., 1994, 2001).
Mobile Agents and the Deus Ex Machina
Authors: Shane Balfe, Eimear Gallery
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

This paper aims to examine the benefits the intro- duction of trusted computing can bring to the mobile agent paradigm, with a specific emphasis on mobile agent security.
A set of QVT relations to transform PIM to PSM in the Design of Secure Data Warehouses
Authors: Emilio Soler, Juan Trujillo, Eduardo Fernandez-Medina, Mario Piattini
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Security represents a crucial aspect in the development of Data Warehouses (DWs), since they contain confidential data. It becomes therefore necessary to specify security and audit requirements for the multidimensional modelling, that cannot be directly transferred to the relational model of the DW. The standard framework for software development Model Driven Architecture (MDA) allows us to define transformations between models by proposing Query/View/Transformations (QVT). This proposal allows the definition of formal, elegant and unequivocal transformations between Platform Independent Model (PIM) and Platform Specific Model (PSM). This paper employs QVT to establish a set of relations that allows us to transform security information embedded in the DW's multidimensional conceptual model to a relational logical scheme.
The Cost of Preserving Privacy: Performance Measurements of RFID Pseudonym Protocols
Authors: Jens Mache, Chris Allick
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

The purpose of RFID tags is to provide identifying information; the problem is that tags may radiate identifying information to any RFID reader anywhere. Encryption alone does not help: even encrypted IDs are static, and can be identified as unique to a particular object, and are thus vulnerable to tracking. To preserve privacy, pseudonym protocols have been proposed. Using cryptography and pseudonyms, unauthorized entities cannot even link two sightings of the same tag. In this paper, we measure the cost of running treebased pseudonym protocols. Pseudonym protocols require random numbers, cryptographic operations and writing to onboard memory (in case time-limited delegation is enabled), which we implement using TinyOS system software. For MicaZ hardware, we measure voltage drop with an oscilloscope. Our results show that one SkipJack block cipher (part of the pseudonym encryption process) costs more energy than generating ten random numbers. Therefore, when configuring the tree of secrets, it is more energyefficient to have a wider rather than a deeper tree.
Neural network boundary refining for automatic speech segmentation
Authors: D. T. Toledano
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

This work is an extension of a previous work in which an automatic speech segmentation and labeling system was proposed based on a hidden Markov model (HMM) speech recognizer followed by a fuzzy-logic boundary correction system. In this paper we explore the possibility of substituting that difficult to design fuzzy-logic system by a neural network (NN) based system that can be automatically trained. First, the whole fuzzy-logic boundary correction system, which used different rule sets for each kind of phonetic transition, has been substituted by a single NN. Results show that this single NN outperforms the complete fuzzy-logic system. Then, the possibility of using different NNs specialized in each kind of phonetic transition has been explored. Results are again clearly better than the results obtained with the fuzzy-logic system, but not clearly better than the results obtained with just one NN.
Using UML Diagrams to Model Real-Time Web Services
Authors: M. Emilia Cambronero, Gregorio Diaz, J. Jose Pardo, Valentin Valero
Venue: Proceedings of the Second International Conference on Internet and Web Applications and Services (2007)

In this paper we show how we can use a classical UML diagram, the sequence diagram, for the description of business process behavior based onWeb Services with time constraints. More specifically, we see how these diagrams can capture the main elements of the Web Services Business Process Execution Language (WS-BPEL), and then, how we can translate these diagrams into Web Services Business Process Execution Language.
Deduction, Strategies, and Rewriting
Authors: Steven Eker, Narciso Martí-Oliet, José Meseguer, Alberto Verdejo
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

Automated deduction methods should be specified not procedurally, but declaratively, as inference systems which are proved correct regardless of implementation details. Then, different algorithms to implement a given inference system should be specified as strategies to apply the inference rules. The inference rules themselves can be naturally specified as (possibly conditional) rewrite rules. Using a high-performance rewriting language implementation and a strategy language to guide rewriting computations, we can obtain in a modular way implementations of both the inference rules of automated deduction procedures and of algorithms controling their application. This paper presents the design of a strategy language for the Maude rewriting language that supports this modular decomposition: inference systems are specified in system modules, and strategies in strategy modules. We give a set-theoretic semantics for this strategy language, present its different combinators, illustrate its main ideas with several examples, and describe both a reflective prototype in Maude and an ongoing C++ implementation.
Frames in rotated time-frequency planes
Authors: A. Bultan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

Weyl-Heisenberg frames are complete signal representations corresponding to rectangular tiling of the time-frequency plane. Extensions of these frames are obtained in the rotated time-frequency planes by using the fractional Fourier transformation. It is shown that rotation does not affect the frame bounds. For some specific angles, lattices in rotated coordinates will map to the lattices in the Cartesian coordinates. The rotated Weyl-Heisenberg frames obtained are more suitable for chirp-like signal analysis and synthesis.
Minitrack: Genres of Digital Documents
Authors: Dmitri Roussinov, Kevin Crowston, Carina Ihlstrom
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The four papers included in the conference proceedings for this year's minitrack on Genres of Digital Documents demonstrate wide range of research questions dealing with genre theories and models as well as the genres themselves their nature and their function in communication, society, and work, as well as our ability to exploit genre information for enhancing the representation and retrieval of digital documents.
Domino arrangements
Authors: David Ginat
Venue: ACM SIGCSE Bulletin (2007)

The current issue's new challenge involves the development of elegant recursive formulas. Recursive formulation requires the specification of a task instance by smaller task instances. Suitable and insightful points of view may yield elegant and concise specifications. The challenge requires such points of view, in three levels of difficulty.
Blue/green luminescence based on Zn(S)Se/GaAs heterostructures
Authors: N. Hizem, A. Kalboussi, R. Adhiri, A. Souifi
Venue: Microelectronics Journal (2007)

Substantial advances have been realized in the aim to achieve blue-green light emitting devices based on Zn(S)Se wide band gap II-VI semi-conductor materials. Two light emitting diodes p on n and n on p heterostructures were grown on GaAs substrate by molecular beam epitaxy. The active layer was a single ZnCdSe quantum well, with ZnSSe guiding layers and ZnSe cladding layers. p-GaInP, p-AlGaAs and p-CdZnSe buffer layers were deposited at the p-ZnSe/GaAs interface to reduce the valence band offset in the case of n on p heterostructures. Electrical and optical properties were investigated using current voltage, capacitance voltage, electroluminescence, photoluminescence and photocurrent measurements at room temperature. Blue-green luminescence centered at 516.7nm is observed. The highest luminescence intensity is observed under 7V forward bias. Photoluminescence spectrum shows two wide peaks at 2.2 and 1.9eV energies. These energies are attributed to the transitions between ZnSe and GaAs conduction bands and the deep level at E"v-0.6eV. Absorption process from ZnSe and ZnSSe conduction bands to the shallow nitrogen acceptor level (2.6 and 2.8eV, respectively) have been observed using photocurrent measurements. From these results we present a band alignment diagram which confirms the presence of the two levels at 0.1 and 0.6eV from the valence band of ZnSe.
Geometric particle swarm optimisation on binary and real spaces: from theory to practice
Authors: Cecilia Di Chio, Alberto Moraglio, Riccardo Poli
Venue: Proceedings of the 2007 GECCO conference companion on Genetic and evolutionary computation (2007)

Geometric particle swarm optimization (GPSO) is a recently introduced formal generalization of traditional particle swarm optimization (PSO) that applies naturally to both continuous and combinatorial spaces. In previous work we have developed the theory behind it. The aim of this paper is to demonstrate the applicability of GPSO in practice. We demonstrate this for the cases of Euclidean, Manhattan and Hamming spaces and report extensive experimental results.
Appearance-based 3D face tracker: an evaluation study
Authors: F. Dornaika, A. D. Sappa
Venue: Proceedings of the 14th International Conference on Computer Communications and Networks (2005)

The ability to detect and track human heads and faces in video sequences is useful in a great number of applications. In this paper, we present our recent 3D face tracker that combines online appearance models with an image registration technique. This monocular tracker runs in real-time and is drift insensitive. We introduce a scheme that takes into account the orientation of local facial regions into the registration technique. Moreover, we introduce a general framework for evaluating the developed appearance-based tracker. Precision and usability of the tracker are assessed using stereo-based range facial data from which ground truth 3D motions are inferred. This evaluation quantifies the monocular tracker accuracy, and identifies its working range in 3D space.
Modelling electropherogram data for DNA sequencing using variable dimension MCMC
Authors: N. M. Haan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

DNA sequencing may be considered as a two stage process: the generation of noisy data indicative of DNA sequence by using advanced chemical techniques; and the interpretation of that data. We present an algorithm for interpretation, or "base calling", which accurately models the underlying process, and is able to incorporate most of the prior information we possess in a mathematically tractable and minimally ad-hoc manner. Our algorithm is framed within a fully Bayesian probabilistic framework, thereby allowing representation of the random nature of the generative process, using a Reversible Jump Metropolis Hastings algorithm (1970) and the Gibbs sampler to traverse the variable dimension parameter space. The techniques used to construct our algorithm are feasible for use in such applications, due to their inherent computational requirements.
Course Assessment and Proposal Report (CAPR)
Authors: A. S. Ruocco
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

One of the primary keys to accreditation under EC2000 criteria is the ability to show a process for assessment of courses within a given program. Assessment must be cyclic, that is it must identify the current state of a course, identify a plan for improvement and then indicate whether or not that plan succeeded. Assessment must also be documented. Today's environment makes it possible to track a great deal of data on almost any aspect of a course, yet it takes time to convert that data into meaningful information. If too much data is collected, then time to do subsequent assessment is lost to sifting out relevant facts from collected data. With time at a premium, the Department of Electrical Engineering and Computer Science at USMA developed a document that captures key information in a format that is inherently cyclic. This document is called the Course Assessment and Proposal Report (CAPR). It was designed in August 1999 and was used for several courses during the academic year of 1999-2000. It has been expanded and is being used for all courses within the department for academic year 2000-2001. The format of the document is evolutionary in nature and will change over time to best suit the overall needs of the department. The Course Assessment and Proposal Report has five basic sections, and a series of annexes which provide detailed information. The various sections and annexes are designed such that they can be easily extracted from the CAPR and used to support a variety of other requirements. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Lease-Based Resource Management in Smart Spaces
Authors: Marko Jurmu, Mikko Perttunen, Jukka Riekki
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

We present a lease-based method for managing various resources in smart spaces. We argue that leases introduce a flexible way of utilizing context information in the management, and thus facilitate the optimization of resource usage. This work-in-progress paper presents our initial concept and methodology, along with ideas for further development.
Finding Articulation Points and Bridges of Permutation Graphs
Authors: Oscar H. Ibarra, Qi Zheng
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 03 (1993)

We show that articulation points and bridges of permutation graphs can be found in O(logn) time using O(n/logn) processors on an EREW PRAM. The algorithms are optimal with respect to the time-processor product.
Establishing the genuinity of remote computer systems
Authors: Rick Kennell, Leah H. Jamieson
Venue: Proceedings of the 12th conference on USENIX Security Symposium - Volume 12 (2003)

A fundamental problem in distributed computing environments involves determining whether a remote computer system can be trusted to autonomously access secure resources via a network. In this paper, we describe a means by which a remote computer system can be challenged to demonstrate that it is genuine and trustworthy. Upon passing a test, it can be granted access to distributed resources and can serve as a general-purpose host for distributed computation so long as it remains in contact with some certifying authority. The test we describe is applicable to consumer-grade computer systems with a conventional network interface and requires no additional hardware. The results of the test can be conveyed over an unsecured network; no trusted human intermediary is needed to relay the results. We examine potential attacks and weaknesses of the system and show how they can be avoided. Finally, we describe an implementation of a genuinity test for a representative set of computer systems.
On Socialization of Personal Computing
Authors: Gaku Hagiwara, Kokolo Ikeda, Mikihiko Mori, Tetsutaro Uehara, Kyoto Hajime Kita
Venue: Proceedings of the Fifth International Conference on Creating, Connecting and Collaborating through Computing (2007)

Education is a typical activity of collaboration, i.e., collaboration among instructors and students. While there have been vast amount of trials using computers in the classroom, their success is quite limited compared with total activities done in school education. The reasons of the limited success may be the cost of introducing computers into the classroom, lack of adequate software, or lack of specialists. In this paper, the authors would like to propose another hypothetical reason. That is, limit of the "personal computing' as a media in the context of classroom where peoples' activities are more social and collaborative using rich media such as verbal and non-verbal communication in the face-to-face environment. Based on this hypothesis, the authors propose a research plan of extending the concept of personal computing to more social media that matches collaboration in the face-to-face environment.
Randomly coloring planar graphs with fewer colors than the maximum degree
Authors: Thomas P. Hayes, Juan C. Vera, Eric Vigoda
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

We study Markov chains for randomly sampling k-colorings of a graph with maximum degree δ. Our main result is a polynomial upper bound on the mixing time of the single-site update chain knownas the Glauber dynamics for planar graphs when k=Ω(δ/logδ). Our results can be partially extended to the more general case where the maximum eigenvalue of the adjacency matrix of the graphis at most δ1-ε, for fixed ε > 0. The main challenge when k ≤ δ + 1 is the possibility of "frozen" vertices, that is, vertices for which only one coloris possible, conditioned on the colors of its neighbors. Indeed, when δ = O(1), even a typical coloring canhave a constant fraction of the vertices frozen.Our proofs rely on recent advances in techniquesfor bounding mixing time using "local uniformity" properties.
Dynamic Verifying The Properties of The Simple Subset of PSL
Authors: Naiyong Jin, Chengjie Shen
Venue: Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (2007)

PSL is a standard specification language(IEEE-1850) for hardware and embedded system design. The simple subset of PSL(PSLSimple) conforms to the notion of monotonic advancement of time, which in turn ensures that formulas within the subset can be simulated easily. Dynamic verifiers consider only finite executions which may be too short to assure their satisfaction to some formulas. In this paper, we work on the theories and methods for designing dynamic verifiers for PSLSimple. We first study the formalism for the formula satisfaction strengths over finite words. Then, we explore the combinational laws of finite words with respect to strong satisfaction, weak satisfaction and strong violation. That contributes acceptance conditions for automata to recognize not just violating, but also strongly satisfying and pending words for all PSLsimple structures. In the end, we propose the Local-variable-enhanced Alternating Finite Automata( LAFA) as the run time checkers for PSLSimple. The size of a LAFA is linear to the size of its PSLSimple formula.
Mutually visible agents in a discrete environment
Authors: Joel Fenwick, V. Estivill-Castro
Venue: Proceedings of the thirtieth Australasian conference on Computer science - Volume 62 (2007)

As computer controlled entities are set to move and explore more complex environments they need to be able to perform navigation tasks, like finding minimal cost routes. Much work has been done on this problem with a single entity in a continuous environment. However these entities may be in teams and their actions may be constrained by the need to consider the actions of other entities. We consider the case of two entities wishing to reach their destinations while travelling the minimum distance and remaining in sight of each other. A version of this problem in continuous space has been addressed previously; however, the problem of minimum length paths does not only exist in continuous space. Robots may have restricted orientations in movement. Also, domains such as circuit design and computer games require discrete movements and restricted orientation. The restricted orientation and the fact that (even in genus zero environments) minimal length paths may not be unique present some challenges. This paper investigates the problem of two entities in a discrete setting, moving to preserve visibility and provides algorithms for computing schedules that minimise the total distance travelled.
Built-in current sensor for IDDQ test
Authors: Bin Xue, D. M. H. Walker
Venue: Proceedings of the 2004 IEEE International Workshop on Defect Based Testing (2004)

A practical built-in current sensor (BICS) design is described in This work. This sensor system is able to monitor the IDDQ at a resolution level of 10 /spl mu/A. This system can translate the current level into a digital signal, with scan chain readout. There is no system performance degradation for this sensor and its power dissipation is kept at a very low level. With the help of a self-calibration circuit, the sensor can maintain its accuracy and achieve a clock rate of over 1 GHz, for a measurement time of a few milliseconds.