ppxscal/embedding_network huggingface dataset:
First term probation: models for identifying high risk students
Authors: A. Scalise
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

EC 2000 has heightened awareness among engineering faculty about the importance of student retention, especially the retention of first-year students. Previous research found that students placed on academic probation after their first term have a high probability of leaving engineering prior to graduation. Using five years of data, we examine the influence of the student's initial preparedness, attitude toward his/her chosen career, and self-assessed confidence in areas such as study habits and communication skills, on first term probation and retention. Logistic regression approaches were used to develop models that have enabled us to determine the factors that most influence first term probation and to better identify students who require early interventions if they are going to successfully complete the engineering curriculum.
Mining longest repeating subsequences to predict world wide web surfing
Authors: James Pitkow, Peter Pirolli
Venue: Proceedings of the 2nd conference on USENIX Symposium on Internet Technologies and Systems - Volume 2 (1999)

Modeling and predicting user surfing paths involves tradeoffs between model complexity and predictive accuracy. In this paper we explore predictive modeling techniques that attempt to reduce model complexity while retaining predictive accuracy. We show that compared to various Markov models, longest repeating subsequence models are able to significantly reduce model size while retaining the ability to make accurate predictions. In addition, sharp increases in the overall predictive capabilities of these models are achievable by modest increases to the number of predictions made.
Optimistic lookup of whole NFS paths in a single operation
Authors: Dan Duchamp
Venue: Proceedings of the USENIX Summer 1994 Technical Conference on USENIX Summer 1994 Technical Conference - Volume 1 (1994)

VFS lookup code examines and translates path names one component at a time, checking for special cases such as mount points and symlinks. VFS calls the NFS lookup operation as necessary. NFS employs caching to reduce the number of lookup operations that go to the server. However, when part or all of a path is not cached, NFS lookup operations go back to the server. Although NFS's caching is effective, component-by-component translation of an uncached path is inefficient, enough so that lookup is typically the operation most commonly processed by servers. We study the effect of augmenting the VFS lookup algorithm and the NFS protocol so that a client can ask a server to translate an entire path in a single operation. The preconditions for a successful request are usually but not always satisfied, so the algorithm is optimistic. This small change can deliver substantial improvements in client latency and server load.
The design and fabrication of polymerase chain reaction platform
Authors: Chao-Heng Chien, Hui-Min Yu
Venue: Microsystem Technologies (2007)

Thermalcycler was extensively used machine for amplify DNA sample. One of the major problems in the working time was that it spent most of time for cooling and heating. In order to improve the efficient, the study presented a novel method for amplify DNA sample. For this concept, the DNA sample in the silicon chamber which was pushed by a tappet through the three temperature regions around a center and then the DNA segments could be amplified rapidly after 30 cycles. The polymerase chain reaction (PCR) platform was composed of the thin-film heaters, Cu plates, DC powers, and temperature controllers. The photolithography and bulk etching technologies were utilized to construct the thin-film heater and DNA reaction chambers. Finally, 1&#x00a0;&#x03bc;l 100&#x00a0;bp DNA segment of Escherichia coli K12 was amplified successfully within 36&#x00a0;min on this PCR platform.
Modelling the effects of reservoir construction on tidal hydrodynamics and suspended sediment distribution in Danshuei River estuary
Authors: Wen-Cheng Liu
Venue: Environmental Modelling Software (2007)

A vertical (laterally integrated) two-dimensional numerical model was implemented to study the hydrodynamics, saltwater intrusion, and suspended sediment in the Danshuei River-Tahan Stream due to the Shihmen Reservoir construction in the upriver reaches. The construction of the reservoir and water diversion in the upper reaches of the river system significantly reduces the freshwater inflow and drastically changes the river bathymetry. The model was calibrated and verified with the available hydrographic data measured in 1977, 1978, and 1999 as well as measured salinity and suspended sediment concentration in 1999. The overall performance of the model is in reasonable agreement with the field data. The validated model was then used to investigate the change in hydrodynamics, saltwater intrusion, suspended sediment distribution, and flushing time as a result of reservoir construction in upper river of Tahan Stream. The model simulations indicate that more tidal energy propagates into the estuarine system after reservoir construction because of the substantial increase in river cross-sections. The limits of saltwater intrusion after reservoir construction extended farther inland 2-3km than those after reservoir construction. The modelling results also reveal that the suspended sediment concentration before reservoir construction was higher than that after reservoir construction along the river mouth to Kuan-Du due to the significant bathymetric change after the reservoir construction. The calculated estuary flushing time was strongly dependent on river flow and reduced 2.3-25h under different river discharges after reservoir construction due to the change in river bathymetry.
Hardware efficient FIR filter structures from linear program design constraints
Authors: K. Sienski
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

Hardware efficient structures for high decimation filters have received much attention due to the explosion in digital communications. However, they do not address wideband digital receiver applications that require processing channels as wide as the input bandwidth. Digital filters that offer decimation ranges from 1 to 64 present a hardware design challenge. This paper presents a novel filter design technique that generates FIR structures with no multipliers. The design process exploits linear programming techniques to constrain the filter coefficients during the optimization process. The technique has been applied to the design of a single-chip sub-band tuner that can continuously process a 100 Msps (40 MHz bandwidth) input data rate.
Fast and Efficient Strategies for Cubic and Non-Cubic Allocation in Hypercube Multiprocessors
Authors: Debendra Das Sharma, Dhiraj K. Pradhan
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

A new approach for dynamic processor allo cation in hypercube multiprocessors which sup ports a multi-user environment is proposed. A dynamic binary tree is used for processor allo cation along with an array of free lists. Two al gorithms are proposed based on this approach that are capable of handling cubic as well as non-cubic allocation efficiently. The time com plexities for both allocation and deallocation are shown to be polynomial; orders of mag nitude improvement over the existing expo nential and even super-exponential algorithms. Unlike the existing strategies, the proposed strategies are best-fit strategies and do not ex cessively fragment the hypercube. Simulation results indicate that the proposed strategies outperform the existing ones in terms of pa rameters such as average delay in honoring a request, average allocation time and average deallocation time.
The design and evaluation of a shared object system for distributed memory machines
Authors: Daniel J. Scales, Monica S. Lam
Venue: Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation (1994)

This paper describes the design and evaluation of SAM, a shared object system for distributed memory machines. SAM is a portable run-time system that provides a global name space and automatic caching of shared data. SAM incorporates mechanisms to address the problem of high communication overheads on distributed memory machines; these mechanisms include tying synchronization to data access, chaotic access to data, prefetching of data, and pushing of data to remote processors. SAM has been implemented on the CM-5, Intel iPSC/860 and Paragon, IBM SP1, and networks of workstations running PVM. SAM applications run on all these platforms without modification. This paper provides an extensive analysis on several complex scientific algorithms written in SAM on a variety of hardware platforms. We find that the performance of these SAM applications depends fundamentally on the scalability of the underlying parallel algorithm, and whether the algorithm's communication requirements can be satisfied by the hardware. Our experience suggests that SAM is successful in allowing programmers to use distributed memory machines effectively with much less programming effort than required today.
Polyphase scalable complete complementary sets of sequences
Authors: Xiaojing Huang, Yunxin Li
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

Extended from their biphase counterparts, biphase scalable complete complementary sets of sequences are discovered in this paper. Starting from biphase scalable complete complementary sets of sequences, the notions of Golay-paired matrix, Golay-paired Hadamard matrix and mutually orthogonal Golay-paired matrices are reviewed and extended to their respective polyphase ones. Synthesis methods, including recursive procedure and closed-form formula, for constructing these polyphase scalable complete complementary sets of sequences represented by mutually orthogonal polyphase Golay-paired Hadamard matrices are also proposed accordingly. Finally, the polyphase cover code and its synthesis methods are discussed and illustrated, which provides the linkage between biphase and polyphase scalable complete complementary sets of sequences.
Speech analysis and coding using a multi-resolution sinusoidal transform
Authors: D. V. Anderson
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

The sinusoidal transform, as developed by Quatieri and McAulay (1986), provides a sparse representation for speech signals by taking advantage of psychoacoustic masking. The currently reported work takes the sinusoidal transform one step further by considering the frequency resolution abilities of the human auditory system in more detail. The new transform is based on the wavelet principle of variable resolution in time/frequency analysis. Specifically, a sinusoidal transform is developed which uses quadrature mirror filter (QMF) banks to obtain better time resolution at high frequencies and better frequency resolution at low frequencies. This naturally provides a perceptually improved allocation of the sinusoids. The new transform matches the human auditory system better than its predecessor and it also matches speech signals well, both fricative sounds and voiced speech. The QMF based ST is then shown to be equivalent to a more efficient FFT based implementation.
Visuo-haptic collaborative augmented reality ping-pong
Authors: Benjamin Knoerlein, Gábor Székely, Matthias Harders
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

In our current work we examine the development of visuohaptic augmented reality setups and their extension to collaborative experiences in entertainment settings. To this end, an expandable system architecture supporting multiple users is one of the most indispensable prerequisites. In addition, system stability, low latency, accurate calibration and stable overlay of the virtual objects have to be assured. In this paper we provide an overview of our framework and present our collaborative example application, an augmented reality visuo-haptic ping-pong game for two players. The users play with a virtual ball in a real environmentwhile, by using virtual bats colocated with haptic devices, they are able to feel the impact of the simulated ball on the bat.
Multimodal Home Monitoring of Elderly People--First Results from the LASS Study
Authors: Michael Marschollek, Wolfram Ludwig, Ines Schapiewksi, Elin Schriever, Rainer Schubert, Hartmut Dybowski, Hubertus Meyer zu Schwabedissen, Juergen Howe, Reinhold Haux
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

Monitoring elderly or disabled people in smart home environments is a major area of research because it allows for controlling chronic diseases and promises cost reduction. Context recognition and in particular activity recognition is of key importance as it facilitates the interpretation of data from medical monitoring devices. In our study with five elderly or disabled people we used data from multi-sensor wearable devices to generate intra- and interindividual machine-learned classifier models to determine activity patterns. Furthermore we computed the relative relevance of each parameter measured, and assessed the acceptance of computerized questionnaires in computer-illiterate people. The mean classification accuracy was 91.4% for the intraindividual classifiers and 53.7% for the interindividual ones. The most relevant parameters for activity classifications were those derived from accelerometric data, the least relevant one was galvanic skin response. Both the sensor device and the computerized questionnaires were well-received by the study participants. Individually-trained machine-learned classifiers used on data from a wearable device are an adequate means to determine context in elderly or disabled people.
2007 Special Issue: Multi-objective evolutionary optimization for constructing neural networks for virtual reality visual data mining: Application to geophysical prospecting
Authors: Julio J. Valdés, Alan J. Barton
Venue: Neural Networks (2007)

A method for the construction of virtual reality spaces for visual data mining using multi-objective optimization with genetic algorithms on nonlinear discriminant (NDA) neural networks is presented. Two neural network layers (the output and the last hidden) are used for the construction of simultaneous solutions for: (i) a supervised classification of data patterns and (ii) an unsupervised similarity structure preservation between the original data matrix and its image in the new space. A set of spaces are constructed from selected solutions along the Pareto front. This strategy represents a conceptual improvement over spaces computed by single-objective optimization. In addition, genetic programming (in particular gene expression programming) is used for finding analytic representations of the complex mappings generating the spaces (a composition of NDA and orthogonal principal components). The presented approach is domain independent and is illustrated via application to the geophysical prospecting of caves.
Stochastic Formal Methods: An Application to Accuracy of Numeric Software
Authors: Marc Daumas, David Lester
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This paper provides a bound on the number of numeric operations (fixed or floating point) that can safely be performed before accuracy is lost. This work has important implications for control systems with safety-critical software, as these systems are now running fast enough and long enough for their errors to impact on their functionality. Furthermore, worst-case analysis would blindly advise the replacement of existing systems that have been successfully running for years. We present here a set of formal theorems validated by the PVS proof assistant. These theorems will allow code analyzing tools to produce formal certificates of accurate behavior. For example, FAA regulations for aircraft require that the probability of an error be below 10-9 for a 10 hour flight.
Integrating data and text mining processes for digital library applications
Authors: Robert Sanderson, Paul Watry
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

This paper explores the integration of text mining and data mining techniques, digital library systems, and computational and data grid technologies with the objective of developing an online classification service exemplar. We discuss the current research issues relating to the use of data mining algorithms and toolkits for textual data; the necessary changes within the Cheshire3 Information Framework to accommodate analysis workflows; the outcomes of a demonstrator based on the National Library of Medicine's Medline dataset; and the provision of comparable metrics for evaluation purposes. The prototype has resulted in extremely accurate online classification services and offers a novel method of supporting text mining and data mining within a highly scaled computational environment, integrated seamlessly into the digital library architecture.
Knowledge Sharing Behavior from Game Theory and Socio-Psychology Perspectives
Authors: Hanan M. Samieh, Khaled Wahba
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Many researches have studied the factors that hinder knowledge sharing from technological or organizational perspectives. However, limited research attention has been given to the individual's salient beliefs about knowledge sharing. This paper aims to study the role of individual's attitude towards knowledge sharing, from a socio-psychological perspective, and how it drives the decision to share knowledge. The paper proposes that an individual's knowledge sharing behavior is driven by a set of salient beliefs that are not unlike the notion of payoff in game theory. Using the case of a telecommunication company in Egypt (will be referred to as company X in this paper), the paper employed multi-person game theoretic structure to determine the game played by the employees. The researcher found that the perceived payoff of knowledge sharing can be characterized by a multi-person game and that drivers of individual's behavior are self esteem, expected association, expected contribution, self consistency, level of understanding, time to share, and self interest.
Shelah's proof of the Hales-Jewett theorem revisited
Authors: Pierre Matet
Venue: European Journal of Combinatorics (2007)

We present a variant of Shelah's proof of the Hales-Jewett theorem.
Perils of transitive trust in the domain name system
Authors: Venugopalan Ramasubramanian, Emin Gün Sirer
Venue: Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement (2005)

The Domain Name System, DNS, is based on nameserver delegations, which introduce complex and subtle dependencies between names and nameservers. In this paper, we present results from a large scale survey of DNS, and show that these dependencies lead to a highly insecure naming system. We report specifically on three aspects of DNS security: the properties of the DNS trusted computing base, the extent and impact of existing vulnerabilities in the DNS infrastructure, and the ease with which attacks against DNS can be launched. The survey shows that a typical name depends on 46 servers on average, whose compromise can lead to domain hijacks, while names belonging to some countries depend on a few hundred servers. An attacker exploiting well-documented vulnerabilities in DNS nameservers can hijack more than 30% of the names appearing in the Yahoo and DMOZ.org directories. And certain nameservers, especially in educational institutions, control as much as 10% of the namespace.
Service configurator: a pattern for dynamic configuration of services
Authors: Prashant Jain, Douglas C. Schmidt
Venue: Proceedings of the 3rd conference on USENIX Conference on Object-Oriented Technologies (COOTS) - Volume 3 (1997)

This paper describes the Service Configurator pattern, which decouples the implementation of services from the time when they are configured. This pattern increases the flexibility and extensibility of applications by enabling their constituent services to be configured at any point in time. The Service Configurator pattern is widely used in application environments (e.g., to configure Java applets into WWW browsers), operating systems (e.g., to configure device drivers), and distributed systems (e.g., to configure standard Internet communication services).
uEyes: A Ubiquitous Care-Support Service Based on Multiple Contexts Coordination
Authors: Hideyuki Takahashi, Yoshikazu Tokairin, Kazuhiro Yamanaka, Takuo Suganuma, Tetsuo Kinoshita, Kenji Sugawara, Norio Shiratori
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet (2007)

In this paper we propose a gentle system for watching over for ubiquitous care-support services that fulfill users' actual requirements. In traditional systems of this domain, only the location information of a user on "one" side of the watching site or the watched site is considered. In this work, we cope not only with the user's location but also all the detailed situations (contexts) of associated entities such as devices, software, networks, and users, in "both" sides. To do this, we propose a ubiquitous watching over system "uEyes". In uEyes, autonomous decision making ability and cooperative behavior are introduced to each entity. Based on the advanced feature of the entities, live video streaming system is dynamically constructed according to the contexts of the entities, on both sides in runtime. As a result, watching over service that fulfills detailed users' requirements can be effectively provided. We implemented a prototype of uEyes for watching over elderly people, and performed some experiments based on several scenarios. For instance, we assumed a scenario that a son, who is taking care of his ailing father, wanted to see his facial color and expression in high quality video. We confirmed that the live video streaming system involving high resolution camera and display devices is dynamically configured in run-time.
Optimal ladder-based biorthogonal coder
Authors: See-May Phoong
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

A novel minimum noise structure is introduced for ladder-based biorthogonal filter banks. The proposed minimum noise ladder-based biorthogonal (MINLAB) coder ensures that the noise gain of the quantizers is unity, even though the system is not orthonormal. The coding gain of the optimal MINLAB coder is always greater than unity. For both the AR(1) and MA(1) processes, the MINLAB coder with 2 taps outperforms the optimal orthonormal coders of any number of taps. In addition to its superior coding performance, the optimal biorthogonal coder has a very low design and implementational cost. Moreover the proposed coder enjoys many advantages that make it an attractive choice for lossy/lossless data compression.