ppxscal/embedding_network huggingface dataset:
Case libraries in support of design education: the DesignMuse experiences
Authors: N. Hari Narayanan, J. L. Kolodner
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

A major part of the reasoning designers do involves accessing old cases and using the lessons learned in those situations to address new problems. DesignMuse is a shell for creating online case libraries with built in browsing capabilities that make cases available to design students in a natural way while they are designing. Archie-2 is the most extensive case library built with DesignMuse, and has been used in Georgia Tech's design studios. Archie-2 provides flexible access to multimedia case representations of buildings: libraries, courthouses and skyscrapers. Susie is a student built library containing cases about sustainable technology and development. These two case libraries illustrate the two ways in which we believe case libraries can enhance learning in the classroom: (1) by using the case library to search for analyze, compare and contrast cases that are similar to the problems students are solving, which will improve their problem solving skills; and (2) by constructing cases and building a library after doing research in a domain, which will help them learn domain knowledge. The paper describes classroom experiences with these two DesignMuse based case libraries and work in progress on enhancing various functionalities of these libraries based on feedback from students and informal classroom observations.
A secure javaTM virtual machine
Authors: Leendert van Doorn
Venue: Proceedings of the 9th conference on USENIX Security Symposium - Volume 9 (2000)

The JavaTM Virtual Machine is viewed by many as inherently insecure despite all the efforts to improve its security. In this paper we take a different approach to Java security and describe the design and implementation of a system that provides operating system style protection for Java code. We use hardware protection domains to separate Java classes, provide access control on cross domain method invocations, efficient data sharing between protection domains, and memory and CPU resource control. These security measures, when they do not violate the policy, are all transparent to the Java programs, even when a subclass is in one domain and its superclass is in another. To reduce the performance impact we group classes and share them between protection domains and map data on demand as it is being shared.
Speaker verification using mixture likelihood profiles extracted from speaker independent hidden Markov models
Authors: A. R. Setlur
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

In this paper, we present a new approach for speaker verification, termed mixture decomposition discrimination (MDD). MDD is based on the idea that, when modeling speech using speaker independent continuous density hidden Markov models (HMM), different speakers speaking the same word would activate different HMM mixture components. One can therefore construct a "mixture profile" of a speaker speaking a given word or phrase. This mixture profile is incorporated into a discriminative training procedure to discriminate between a true speaker and imposters. The effectiveness of MDD is seen when it is incorporated into a hybrid verification system that also includes speaker dependent HMMs with cohort normalization. Experimental results show that the hybrid system reduces the average equal error rate (EER) by 52% when compared with a stand alone cohort-normalized speaker dependent HMM verifier. It is also shown that the computational and model storage requirements needed to incorporate MDD into the hybrid system are relatively small.
A hierarchical neural model with time windows in long-term electrical load forecasting
Authors: Ot&#x00e1;vio A. S. Carpinteiro, Isa&#x00ed;as Lima, Rafael C. Leme, Antonio C. Zambroni de Souza, Edmilson M. Moreira, Carlos A. M. Pinheiro
Venue: Neural Computing and Applications (2007)

A novel hierarchical hybrid neural model to the problem of long-term electrical load forecasting is proposed in this paper. The neural model is made up of two self-organizing map nets: one on top of the other, and a single-layer perceptron. It has application into domains which require time series analysis. The model is compared to a multilayer perceptron. Both the hierarchical and the multilayer perceptron models are endowed with time windows in their input layers. They are trained and assessed on load data extracted from a North-American electric utility. The models are required to predict once every week the electric peak-load and mean-load for the next 2&#x00a0;years. The results are presented and evaluated in the paper.
An Accounting Model for Dynamic Virtual Organizations
Authors: Matthias Gohner, Martin Waldburger, Fabian Gubler, Gabi Dreo Rodosek, Burkhard Stiller
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

The provisioning of remote and composed services in support of various application areas has dramatically increased over recent times. Thus, the concept of Grids has evolved, in the sense of a common platform for electronic service provisioning in multi-domain environments. While, traditionally, Grids have seen a quite static existence, many new service compositions have to take place on-demand and for certain periods of time only. To tackle those issues the concept of Virtual Organizations (VO) delivers a highly suitable representation of such dynamic Grids. However, one important open problem at this stage is the lack of applicable, distributed, and efficient accounting schemes for commercial resource and service consumptions. Even for simple management purposes, e.g., sampling or archiving, this functionality is essential. Therefore, a comprehensive model for Grid accounting has been developed and suitable accountable units have been defined, in which an underlying activity- and resource-based accounting model covers economic cost theory. Furthermore, this work is based on a service model proposed for service provisioning in dynamic VOs, overcoming the typically static nature of traditional Grids.
Two new DSP teaching tools: DigiFilter and DSPlus
Authors: Hen-Geul Yeh
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

Two window-based new digital signal processing (DSP) software packages, namely, DigiFilter and DSPlus are used as teaching tools at California State University, Long Beach (CSULB), DSP laboratory in conjunction with DSK31 of TI. First, DigiFilter is a digital filter design and processing software. The uniqueness of this package is that it is not only design digital filters, but also supports DSK31 for real-time filtering. Second, DSPlus is a data acquisition and processing software which supports DSK31 for real-time FFT and can be used as a digital scope. These two packages are employed as computer-aided design and analysis tools for DSP courses.
Tilt Perception by Constant Tactile and Constant Proprioceptive Feedback through a Human System Interface
Authors: Franziska K. B. Freyberger, Martin Kuschel, Berthold Farber, Martin Buss, Roberta L. Klatzky
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

Tilt perception through a haptic human system interface is experimentally investigated. Tactile feedback is provided by vibration motors and proprioceptive feedback by the Cybergrasp exoskeleton. Enriching mere vibrotactile feedback by additional constant force feedback has not been found to influence human tilt perception. Participants' verbal and haptic estimations of the displayed tilt were highly accurate. As expected, tilt estimations depend on the actual tilt.
Minimizing Response Time for Quorum-System Protocols over Wide-Area Networks
Authors: Florian Oprea, Michael K. Reiter
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

A quorum system is a collection of sets (quorums) of servers,where any two quorums intersect. Quorum- based protocols underly modern edge-computing archi- tectures and throughput-scalable service implementa- tions. In this paper we propose new algorithms for plac- ing quorums in wide-area networks and tuning which quorums clients access, so as to optimize clients' aver- age response time in quorum-based protocols. We ex- amine scenarios in which the service is lightly loaded and hence network latency is the dominant delay, and in which client-induced load contributes significantly to the delay that clients observe.In each case,we eval- uate our algorithms on topologies ranging from 50 to over 150 wide-area locations.
Generation of threshold functions of high-order satisfying monotonicities
Authors: Yukihiro Kamada, Kiyonori Miyasaki
Venue: Systems and Computers in Japan (2007)

This paper presents a generation procedure for high-order threshold functions, considering the high-order neighbor vector and the monotonic property. Specifically, it is first shown that the high-order neighbor vector can be derived from an input vector which is noncomparable by the high-order threshold function. Then, it is shown that a monotonic function of a high-order variable can easily be generated from the given monotonic function. Based on the generation process for the monotonic function, the generation procedure for high-order threshold functions is derived. It is also shown that if a given high-order threshold function preserves monotonicity, the generated high-order threshold function also preserves monotonicity, and also the high-order terms. &copy; 2007 Wiley Periodicals, Inc. Syst Comp Jpn, 38(9): 63&ndash;73, 2007; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20243
HANNAH: A Vivid and Flexible 3D Information Visualization Framework
Authors: Katja Einsfeld, Achim Ebert, Jurgen Wolle
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

In this paper we describe an adaptable multi-purpose 3D user interface for complex heterogeneous information. The framework allows to create visualization instruments by hierarchically combining small visualization widgets. We integrate well known 3D visualization tools in our system and also present new metaphors like the RotaryDiagram. Due to the modular architecture and the underlying ontology we are able to build intuitive visualizations that allow direct manipulation, that directly and vividly respond to user actions and adopt to changing needs. The visualizations provide the user with multiple perspectives on the data and semantic relations between items of various perspectives. The effectiveness of our proposed concepts for 3D information visualization systems is being proven by applying them to an user interface for monitoring, controlling, and optimization of a complex wastewater treatment plant.
Multiresolution segmentation-based image coding with hierarchical data structures
Authors: H. R. Rabiee
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

This paper presents two multiresolution segmentation-based algorithms for low bit rate image compression using hierarchical data structures. The segmentation is achieved with quadtree and binary space partitioning tree hierarchical data structures and the encoding is performed by using the projection pursuit (matching pursuit) with a finite dictionary of spline functions with various degrees of smoothness. Comparison with JPEG at rates below 0.5 bit/pixel shows superior performance both in terms of peak signal-to-noise ratio (PSNR) and subjective image quality.
Time-frequency distributions based on Teager-Kaiser energy function
Authors: Wei Lin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

Recently, Kaiser (1990) proposed a new definition for the energy of a discrete-time signal, based on the physical energy of the signal producing system. In this paper, we extend this concept to the time-frequency plane. We derive and show that the Teager-Kaiser energy based time-frequency distribution has a very simple relation to the Wigner distribution, which is based on the classical Euclidean energy for signals. It turns out that the new distribution does not have any DC-cross terms, found in the Wigner distribution of real signals.
Security and the open source model
Authors: Michael H. Warfield
Venue: Proceedings of the 3rd annual conference on Atlanta Linux Showcase - Volume 3 (1999)

We've heard it all before. "How can something be secure when all the source is in the open for hackers to read?" or, "Open source means hackers can find all the bugs." Even though conventional wisdom or "common sense" may lead some to the conclusion that "open source equals not secure," reality tells a different story. Some of the most secure systems available are based on the open source model. But that security is not inherent or automatic with open source software either. Attempts to trojan open source packages reminds us that diligence is in order for all of us.
Characterizing unstructured overlay topologies in modern P2P file-sharing systems
Authors: Daniel Stutzbach, Reza Rejaie, Subhabrata Sen
Venue: Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement (2005)

During recent years, peer-to-peer (P2P) file-sharing systems have evolved in many ways to accommodate growing numbers of participating peers. In particular, new features have changed the properties of the unstructured overlay topology formed by these peers. Despite their importance, little is known about the characteristics of these topologies and their dynamics in modern file-sharing applications. This paper presents a detailed characterization of P2P overlay topologies and their dynamics, focusing on the modern Gnutella network. Using our fast and accurate P2P crawler, we capture a complete snapshot of the Gnutella network with more than one million peers in just a few minutes. Leveraging more than 18,000 recent overlay snapshots, we characterize the graph-related properties of individual overlay snapshots and overlay dynamics across hundreds of back-to-back snapshots. We show how inaccuracy in snapshots can lead to erroneous conclusions--such as a power-law degree distribution. Our results reveal that while the Gnutella network has dramatically grown and changed in many ways, it still exhibits the clustering and short path lengths of a small world network. Furthermore, its overlay topology is highly resilient to random peer departure and even systematic attacks. More interestingly, overlay dynamics lead to an "onion-like" biased connectivity among peers where each peer is more likely connected to peers with higher uptime. Therefore, long-lived peers form a stable core that ensures reachability among peers despite overlay dynamics.
Geometric and Timing Calibration for Unsynchronized Cameras Using Trajectories of a Moving Marker
Authors: Mami Noguchi, Takekazu Kato
Venue: Proceedings of the Eighth IEEE Workshop on Applications of Computer Vision (2007)

For 3D measurement of moving objects, timing calibration is important to compensate lags in shutter timing between cameras as well as calibrating 3D positions and poses of them. This paper presents a new method for calibrating the geometric relationship and the lags in shutter timing between unsynchronized cameras from trajectories of a moving marker. We call it geometric and timing calibration. Geometric calibration generally requires many point correspondences between images of the calibration objects. It is, however, difficult to obtain stable point correspondences from images. Our method does not require point correspondences. It uses, instead, a pair of trajectories of a freely moving maker. Our method estimates a fundamental matrix and a lag in shutter timing simultaneously by analyzing the gap between the trajectories. In experiments, our method has attained accuracy of mean errors within 0.8 pixels in image coordinates and timing errors within 0.3 milliseconds. Another experiment using a radiocontrolled helicopter has shown that it works well for flying objects in the sky.
Robust Dissolve Detection Using Local Feature Tracking
Authors: San Ko, J. G. Jeong, S. K. Kim, J. Y. Kim
Venue: Proceedings of the Eighth IEEE Workshop on Applications of Computer Vision (2007)

In this paper we propose a novel dissolve detection algorithm which overcomes the defects of previously suggested algorithms. Differentiating dissolve from the effect aroused by camera motion or objects movement has long been a problem irritating the researchers and not settled thoroughly yet. In our approach, feature points are tracked so that inter-frame comparison can be executed between the exactly corresponding local features. This method reduces the false alarm caused by motions and improves the acuity of inter-frame comparison greatly. The experimental result shows the superiority of local feature comparison method to that of global feature.
On the relation of image restoration and template matching: application to block-matching motion estimation
Authors: Mungi Choi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

In this paper, we investigate the relation between the image restoration and the template matching problems. We present a new formulation for template matching that establishes the duality between these two problems. According to this formulation the restored template is used to ascertain its location. An alternative formulation is also suggested which is based on the observation that template matching can be viewed as an image restoration problem where the degraded image is blurred by a linear point spread function-the template. It is shown that, unlike image restoration, all second order statistics required for the implementation of linear minimum mean-square error (LMMSE) template matching can be accurately estimated. LMMSE template matching is subsequently applied to the block-matching based motion estimation from degraded image sequences. Our experimental results indicate that LMMSE template matching is superior to traditional block-matching.
PRISMA - A Multidimensional Information Visualization Tool Using Multiple Coordinated Views
Authors: Paulo Igor A. Godinho, Bianchi Serique Meiguins, Aruanda Simoes Goncalves Meiguins, Ricardo M. Casseb do Carmo, Marcelo de Brito Garcia, Leandro Hernandez Almeida, Rodrigo Lourenco
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

Information Visualization techniques have been successfully used to build visual and interactive analysis of data and data relationships. However, dimensionality, volume and diversity make it difficult for a single technique to completely solve the problem. Information visualization tools that support multiple coordinated views allow the user to better understand the dataset by providing different perspectives based on the same set of data items. These tools support the correlation between data views and the coordinated real-time interaction mechanisms. The goal of this paper is to present the PRISMA information visualization tool that explores the use of multiple coordinated views. PRISMA provides usability, portability and extensibility. Initial usability essays are discussed.
A formal-numerical approach to solve 3D geometric constraints systems
Authors: Arnaud Fabre, Pascal Schreck
Venue: Proceedings of the Geometric Modelling and Imaging (2007)

In Computer-Aided Design, solvers generally use a geometric avatar of the "divide and conquer" paradigm to cope with their complexity. However, this scheme often fails in the case of 3D geometric constraints systems since they are hardly decomposable. We have studied a new method which uses jointly two solvers, a symbolic one and a numerical one, in order to solve a system S: system S is transformed into a parametric system S "almost" equivalent to S and such that system S is symbolically solvable and the numerical solver computes solution of S from solutions of S.
An integrated, project-based, introductory course in calculus, physics, English, and engineering
Authors: R. Roedel, M. Kawski, B. Doak, M. Politano, S. Duerden, M. Green, J. Kelly, D. Linder
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

Describes the development of an integrated introductory course delivered to freshman engineering students at Arizona State University in the Fall '94 semester as a part of the Foundation Coalition program. The course combined and integrated material from introductory courses in calculus, physics, English composition and engineering, normally taught in a stand-alone format. The calculus used in this course was based on the Harvard reform model. The physics was mechanics-based. What differentiated this integrated package from versions found at other institutions in the Coalition was (a) the inclusion of English composition, and (b) the project-based introduction to engineering. In this integrated course, the students learned to organize and develop ideas for both technical and general audiences. In addition, they learned the use of rhetorical principles with readings from the philosophy of science, engineering case studies, and so on. The overarching framework for the class was the use of engineering projects to teach design and modeling principles. The three projects incorporated the calculus and physics that had been learned to date in the class. The first utilized kinematics and curve-fitting to functions to design and build a simple projectile launcher; the second employed dynamics and numerical integration to design and build a bungee drop system; and the third used rotational motion concepts and a data acquisition system to identify the shape and material of a hidden object. The integrated course also employed considerable use of computers in an active learning environment that stressed teaming and other quality tools.
Analysis of Web Services Secure Conversation with Formal Methods
Authors: Llanos Tobarra, Diego Cazorla, Fernando Cuartero, Gregorio Diaz
Venue: Proceedings of the Second International Conference on Internet and Web Applications and Services (2007)

Web Services Secure Conversation extends Web Services Trust to provide mechanisms for establishing security contexts. A security context is an abstract concept that refers an authenticated state where the participants have derived secure session keys for multiples request/response exchanges. In this paper we model this protocol with the HLPSL language and we analyse it with the AVISPA toolbox.
Security through publicity
Authors: Eric Osterweil, Dan Massey, Batsukh Tsendjav, Beichuan Zhang, Lixia Zhang
Venue: Proceedings of the 1st USENIX Workshop on Hot Topics in Security (2006)

Current large-scale authentication and non-repudiation systems offer various security measures, but do not meet the needs of today's Internet-scale applications. Though several designs exist, there have been no significant deployments of Internet-scale security infrastructures. In this paper we propose a novel concept called the public-space that makes complete information of digital entities' actions publicly available to every user. It is a structured framework that maintains a large number of entities, their actions, relationships, and histories. Posting such information in public does not endorse the information's correctness, but it does provide users with a quantifiable set of information that enables them to detect faults and make informed security decisions. Combined with traditional cryptographic techniques, the public-space system can support the intrinsic heterogeneity of user security requirements in Internetscale infrastructures and applications.