ppxscal/embedding_network huggingface dataset:
Quality factor of micro cantilevers transduced by piezoelectric lead zirconate titanate film
Authors: Jian Lu, Tsuyoshi Ikehara, Takeshi Kobayashi, Ryutaro Maeda, Takashi Mihara
Venue: Microsystem Technologies (2007)

The quality factors (Q-factor) of micro cantilevers transduced by piezoelectric lead zirconate titanate (PZT) film under atmospheric pressure conditions were investigated and discussed. It was found that Q-factors increased with thicker PZT film. Due to air damping, shorter cantilevers resulted in preferred larger Q-factors. The Q-factor was found to be as high as 450 for a 150-&#x03bc;m long PZT cantilever when using 1.04-&#x03bc;m thick PZT film as the electromechanical conversion medium. Differences in the measured Q-factors when using integrated PZT film self-excitation and external PZT vibrator actuation indicate that energy dissipation induced by the electromechanical coupling in PZT thin films was noteworthy even under atmospheric pressure conditions. Moreover, the mechanical properties of the PZT film were found contribute significantly to decreases of the Q-factor.
Error correction for speaker-independent isolated word recognition through likelihood compensation using phonetic bigram
Authors: H. Matsuo
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

We propose an error correction technique for speaker-independent isolated word recognition by compensating for a word's likelihood. The likelihood is compensated for by the likelihood calculated by a phonetic bigram. The phonetic bigram is a phoneme model expressing the frame correlation within an utterance. A speaker-independent isolated word recognition experiment showed that our proposed technique reduces the recognition error compared to conventional techniques. The proposed technique achieves a performance almost equal to that without speaker adaptation compared to the conventional phoneme model adapted using several words.
Perl, python, zope
Authors: Gisle Aas, Dick Hardt, Paul Everitt
Venue: Proceedings of the 4th annual Linux Showcase & Conference - Volume 4 (2000)

The Perl For Zope project by ActiveState and Digital Creations lets Perl code and Python code run in the same process, focused on making Perl an alternative scripting language for the Zope Open Source application server.
Soft Error Rate Analysis for Combinational Logic Using An Accurate Electrical Masking Model
Authors: Feng Wang, Yuan Xie, R. Rajaraman, B. Vaidyanathan
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

Accurate electrical masking modeling represents a significant challenge in soft error rate analysis for combinational logic circuits. In this paper, we use table lookup MOSFET models to accurately capture the nonlinear properties of submicron MOS transistors. Based on these models, we propose and validate the transient pulse generation model and propagation model for soft error rate analysis. The pulse generated by our pulse generation model matches well with that of HSPICE simulation, and the pulse propagation model provides nearly one order of magnitude improvement in accuracy over the previous models. Using these two models, we propose an accurate and efficient block-based soft error rate analysis method for combinational logic circuits.
Effects of Physical Environment on the Stress Levels of Hemodialysis Nurses in Ankara Turkey
Authors: Sultan Uğur, Ahmet M. Acuner, Bayram Göktaş, Birdal Şenoğlu
Venue: Journal of Medical Systems (2007)

This study has been planned and executed as a field study for identifying the effect of physical environment on the stress levels of hemodialysis nurses who work in the official and private hemodialysis centers in the capital city of Turkey, Ankara (n¿=¿161). According to the results obtained from the study, it has been seen that "education level" and "institution of employment" of the hemodialysis nurses are significantly related with the stress levels of the hemodialysis nurses. Nurses' age, marital status, number of children, occupational seniority, years of working, employment status, husbands' occupation and husbands' educational levels are not significantly related with their stress levels.
Digital Forensics: Validation and Verification in a Dynamic Work Environment
Authors: Jason Beckett, Jill Slay
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Many forensic computing practitioners work in a high workload and low resource environment. With the move by the discipline to seek ISO 17025 laboratory accreditation, practitioners are finding it difficult to meet the demands of validation and verification of their tools and still meet the demands of the accreditation framework. Many agencies are ill-equipped to reproduce tests conducted by organizations such as NIST since they cannot verify the results with their equipment and in many cases rely solely on an independent validation study of other peoples' equipment. This creates the issue of tools in reality never being tested. Studies have shown that independent validation and verification of complex forensic tools is expensive and time consuming, and many practitioners also use tools that were not originally designed for forensic purposes. This paper will explore the issues of validation and verification in the accreditation environment and propose a paradigm that will reduce the time and expense required to validate and verify forensic software tools.
U-DRM: A Framework of Digital Rights Management Based on Ubiquitous Computing
Authors: Jong-hwan Suh, Jae-Hoon Jin, Sung-Je Park, Soon-Young Bae, Sang-Chan Park
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

In the Internet, the digital format of most contents has led to its increased piracy because of the ease of copying and sharing the digital contents. Moreover, the advent of new technologies such as ubiquitous computing seems to cause problems of piracy even more than before. Therefore, we guess it's going to be a more critical issue to control and manage rights of digital contents. In this paper, we propose a framework of U-DRM to control and manage rights of digital contents on the basis of the ubiquitous computing. The framework consists of two methods based on digital mediums and digital contents. And with a step ahead, we discuss ways for the application of usage data collected from the proposed framework.
Adaptive noise cancellation schemes for magnetic flux leakage signals obtained from gas pipeline inspection
Authors: M. Afzal
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

Nondestructive evaluation of the gas pipeline system is most commonly performed using magnetic flux leakage (MFL) techniques. A major segment of this network employs seamless pipes. The data obtained From MFL inspection of seamless pipes is contaminated by various sources of noise, including seamless pipe noise due to material properties of the pipe, lift-off variation of MFL sensor due to motion of the pipe and system noise due to on-board electronics. The noise can considerably reduce the detectability of defect signals in MFL data. This paper presents a new technique for improving the signal-to-noise-ratio in MFL data obtained from seamless pipes. The approach utilizes normalized least mean squares adaptive noise filtering coupled with wavelet shrinkage denoising to minimize the effects of various sources of noise. Results from application of the approach to data from field tests are presented. It is shown that the proposed algorithm is computationally efficient and data-independent.
Insights into the Sensitivity of the BRAIN (Braided Ring Availability Integrity Network)--On Platform Robustness in Extended Operation
Authors: Michael Paulitsch, Brendan Hall
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

Low-cost fault-tolerant systems design presents a continual trade-off between improving fault-tolerant properties and accommodating cost constraints. With limited hardware options and to justify the system design rationale, it is necessary to formulate a fault hypothesis to bound failure assumptions. The system must be built on a foundation of real-world relevance and the assumption of coverage of the fault hypothesis. This paper discusses a study that examines the sensitivity of a BRAIN (braided ring availability integrity network) design to different fault types and failure rates in a safety-relevant application. It presents a Markov-based model (using ASSIST, SURE, and STEM analysis tools) and a series of experiments that were run to analyze the overall dependability of the BRAIN approach. The study evaluates the mission reliability and safety in the context of a hypothetical automotive integrated x-by-wire architecture on top of the BRAIN. Drawing from experience in the aerospace domain, the authors investigate the possibility of continued operation for a limited period after a detected critical electronic failure. Continued operation would allow a driver to reach repair facilities rather than stopping the vehicle to call for roadside assistance or "limping home."
Coupled Hidden Semi Markov Models for Activity Recognition
Authors: Pradeep Natarajan, Ramakant Nevatia
Venue: Proceedings of the IEEE Workshop on Motion and Video Computing (2007)

Recognizing human activity from a stream of sensory observations is important for a number of applications such as surveillance and human-computer interaction. Hidden Markov Models (HMMs) have been proposed as suitable tools for modeling the variations in the observations for the same action and for discriminating among different actions. HMMs have come in wide use for this task but the standard form suffers from several limitations. These include unrealistic models for the duration of a sub-event and not encoding interactions among multiple agents directly. Semi- Markov models and coupled HMMs have been proposed in previous work to handle these issues. We combine these two concepts into a coupled Hidden semi-Markov Model (CHSMM). CHSMMs pose huge computational complexity challenges. We present efficient algorithms for learning and decoding in such structures and demonstrate their utility by experiments with synthetic and real data.
Building and Running Application Codes on the ARL Linux Networx Cluster (JVN)
Authors: George Petit
Venue: Proceedings of the HPCMP Users Group Conference (2006)

Porting, building and running application codes in the high-performance Linux cluster environment are different than the traditional high-performance computing environment with which many users are familiar. There are multiple compiling environments to choose from, along with their associated MPICH environments and optimized scientific libraries. Determining which of these environments is best suited to a user's application is not always apparent, as is defining the user's environment to properly access the chosen compiler and libraries during the build process. After successfully building an application, creating LSF batch run scripts that will successfully and efficiently run these newly built applications to solve user-defined problems has its own unique requirements inherent to the Linux environment. The objective of this paper is to provide the information necessary for new users to the Linux cluster to determine the most appropriate compiling environment for their application, as well as the means to access the compiler and associated libraries to successfully build and, if necessary, debug the desired application. Usage of the LSF batch system to submit batch jobs that will successfully and efficiently run on Linux cluster compute nodes will also be addressed. A discussion of each compiler's characteristics will provide a basis for users to determine which compiling system is most appropriate for their application. An introduction to the use of software "modules" will provide a way for users to easily tailor their environment to use the desired compiling environment for code development/building. Finally, LSF batch script examples will be used to demonstrate correct script usage. By better understanding the ARL Linux Networx cluster environment, new users will be able to become effective and productive users of the system more quickly. By minimizing the time required by users to port their codes onto a new platform and begin production jobs, the overall efficacy of the cluster's capability as a research tool is enhanced thereby increasing its overall value to the program.
A fast rendering method for a scene with participating media of anisotropic scattering property
Authors: Y. Tokuyoshi, M. Maruyama
Venue: Proceedings of the Computer Graphics International 2005 (2005)

This paper presents an efficient technique for global illumination rendering of a scene with participating media. The rendering handling participating media is performed by ray marching method, which requires sampling along each view direction. The step size of the ray marching must be taken short to generate a high quality image and thus leads to very long computational time. One possible method to improve the computational cost is to exploit importance sampling. In this paper, we propose a method to determine the step size based on the importance sampling technique. For efficient sampling, the probability density function which is "close" to the radiance distribution is required. In our method, 3D space is divided into a set of uniform grids. The radiance distribution is approximated using the grid structure. To deal with the participating media which has anisotropic scattering property, we use spherical harmonics to represent directional dependence of radiance distribution. Using this grid-based representation, fast calculation of good approximation of desirable probability density is made possible. Using this probability, high quality image can be rendered with fewer number of sampling compared to the conventional methods.
Handling document expressions for capturing conceptual query&ndash;document relations
Authors: Makoto Nakashima, Tetsuro Ito
Venue: Systems and Computers in Japan (2007)

If keywords or key phrases that characterize a query or a document are replaced and expressed by identifiers within a conceptual hierarchy such as a thesaurus, excellent searches can be expected by taking conceptual query-document relations of the identifiers into consideration. If, however, judgments to check for matches in the extracted documents take time, the efficiency of the entire system will decrease. In order to deal with this problem, a method is required to easily understand what type of relations exist between the queries and document as well as what the document is referring to. This paper will initially discuss how to handle document expressions that can clearly point out the manner in which the conceptual relations between the queries and documents generate while contributing to improvements in the retrieval efficiency. A method will then be shown that simplifies document expressions when there are many identifiers within a document expression. The effectiveness of this proposed method was ascertained through experiments using test collections for retrievals. &copy; 2007 Wiley Periodicals, Inc. Syst Comp Jpn, 38(9): 97&ndash;106, 2007; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10349
Hashing, searching, sketching
Authors: Rajeev Motwani
Venue:  (2006)

The Information Age has enabled the search for information in ways never imagined before. The simplest search function may be an exact search where the input query is expected to exactly match the search object. But some search criteria are fuzzy---for instance image search, news search, and similar document search---making the search problem much harder. One common approach is to convert such a search object into a mathematical representation such as a point (vector) in a high dimensional space. The search for a similar object then becomes a nearest neighbor search in a high dimensional space. Hashing is a simple and effective method for exact search that uses a random hash function to map items into buckets, often viewed as throwing balls into bins. A variant of hashing called locality-sensitive hashing that tends to map similar objects to the same hash bucket, can be used to perform nearest neighbor search. A related notion is sketching that is used to transform a large complex object into a small sketch---often a tiny bitmap---so that similarity between the sketches can be used to estimate the similarity between the original objects. In this thesis we study algorithms for different kinds of search using hashing and sketching, and some fundamental limits of what can be realized using some of these approaches. For exact search, we will see how variants of balls-and-bins processes can be used to derive space efficient methods for maintaining hash tables. For similarity search, we will see a variant of locality-sensitive hashing that uses linear space and how the underlying ideas can be used in the kd-tree data structure for improved performance. We will also probe the fundamental limits of some of these approaches by showing lower bounds on their performance.
An algorithm for anomaly-based botnet detection
Authors: James R. Binkley, Suresh Singh
Venue: Proceedings of the 2nd conference on Steps to Reducing Unwanted Traffic on the Internet - Volume 2 (2006)

We present an anomaly-based algorithm for detecting IRC-based botnet meshes. The algorithm combines an IRC mesh detection component with a TCP scan detection heuristic called the TCP work weight. The IRC component produces two tuples, one for determining the IRC mesh based on IP channel names, and a sub-tuple which collects statistics (including the TCP work weight) on individual IRC hosts in channels. We sort the channels by the number of scanners producing a sorted list of potential botnets. This algorithm has been deployed in PSU's DMZ for over a year and has proven effective in reducing the number of botnet clients.
Using Games in Software Engineering Education to Teach Risk Management
Authors: Gil Taran
Venue: Proceedings of the 20th Conference on Software Engineering Education & Training (2007)

An innovative board game was developed at Carnegie Mellon University's Master in Software Engineering Program to teach risk management concepts. Piloted in two separate courses dealing with software project risk management, the goal of the game was to enhance practical learning and decision making through simulating a software development project. This activity was then compared to others used in the class, specifically lectures and case discussions, to assess its effectiveness in meeting learning objectives. The results clearly demonstrate the advantages of using a game method in teaching software engineering concepts. Findings will discuss how the game compares to other teaching activities in the classroom in terms of conveying relevant information, help in concept understanding and learning enjoyment.
Exploiting Lustre File Joining for Effective Collective IO
Authors: Weikuan Yu, Jeffrey Vetter, R. Shane Canon, Song Jiang
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

Lustre is a parallel file system that presents high aggregated IO bandwidth by striping file extents across many storage devices. However, our experiments indicate excessively wide striping can cause performance degradation. Lustre supports an innovative file joining feature that joins files in place. To mitigate striping overhead and benefit collective IO, we propose two techniques: split writing and hierarchical striping. In split writing, a file is created as separate subfiles, each of which is striped to only a few storage devices. They are joined as a single file at the file close time. Hierarchical striping builds on top of split writing and orchestrates the span of subfiles in a hierarchical manner to avoid overlapping and achieve the appropriate coverage of storage devices. Together, these techniques can avoid the overhead associated with large stripe width, while still being able to combine bandwidth available from many storage devices. We have prototyped these techniques in the ROMIO implementation of MPI-IO. Experimental results indicate that split writing and hierarchical striping can significantly improve the performance of Lustre collective IO in terms of both data transfer and management operations. On a Lustre file system configured with 46 object storage targets, our implementation improves collective write performance of a 16-process job by as much as 220%.
Initializing K-means Batch Clustering: A Critical Evaluation of Several Techniques
Authors: Douglas Steinley, Michael J. Brusco
Venue: Journal of Classification (2007)

K-means clustering is arguably the most popular technique for partitioning data. Unfortunately, K-means suffers from the well-known problem of locally optimal solutions. Furthermore, the final partition is dependent upon the initial configuration, making the choice of starting partitions all the more important. This paper evaluates 12 procedures proposed in the literature and provides recommendations for best practices.
Middleware-Induced Architectural Style Modelling for Architecture Exploration
Authors: Simon Giesecke, Johannes Bornhold, Wilhelm Hasselbring
Venue: Proceedings of the Sixth Working IEEE/IFIP Conference on Software Architecture (2007)

The MIDARCH Method is a software design method for exploring software architecture alternatives that use different middleware platforms. First, candidate architectures are modelled based on different architectural styles that are induced by the respective middleware platforms. Candidate styles are chosen using a taxonomy of such styles. The goal is the evaluation of candidate architectures with respect to a goal/question/metric quality model. We illustrate the modelling approach using the Apache Cocoon Web component framework and related technologies, and a taxonomy of their associated styles.
Orthogonal matched filter detection
Authors: Y. C. Eldar
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

We consider the generic problem of detecting a transmitted signal when one of M known signals is transmitted. Instead of using a classical matched filter (MF) detector, matched to the transmitted signals, we propose using an orthogonal matched filter (OMF) detector, which is matched to a set of orthogonal signals that are closest in a least-squares sense to the transmitted signals. We show that this approach is equivalent to optimally whitening the output of the MF demodulator, and then basing the detection on the whitened output. We provide simulation results which suggest that, in many cases, the OMF detector outperforms the MF detector.
Porting the SGI XFS file system to Linux
Authors: Jim Mostek, Bill Earl, Steven Levine, Steve Lord, Russell Cattelan, Ken McDonell, Ted Kline, Brian Gaffey, Rajagopal Ananthanarayanan
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (2000)

The limitations of traditional Linux file systems are becoming evident as new application demands for Linux file systems arise. SGI has ported the XFS file system to the Linux operating system to address these constraints. This paper describes the major technical areas that were addressed in this port, specifically regarding the file system interface to the operating system, buffer caching in XFS, and volume management layers. In addition, this paper describes some of the legal issues surrounding the porting of the XFS file system, and the encumbrance review process that SGI performed.