ppxscal/embedding_network huggingface dataset:
A family of cosine-sum windows for high-resolution measurements
Authors: H. H. Albrecht
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

Special windows are used in spectral analysis to reduce the effect of spectral leakage. Windows with low sidelobe amplitude are necessary for the detection of small signals when highly dynamic spectra are concerned. The design of a family of cosine-sum windows with minimum sidelobes is described. The coefficients and selected parameters for windows with a peak sidelobe level between 43 dB and 289 dB are stated. 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
Applying TQM in an engineering technology classroom as a method of improving the learning of adult engineering technology students
Authors: J. W. Miller
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

Describes a study applying the concepts and philosophy of total quality management (TQM) in an engineering technology classroom. The objective is to develop a process using TQM to improve teaching effectiveness and the classroom environment, resulting in increased learning by adult engineering technology students. An initial pilot study is conducted in an applied thermodynamics course. Adult students have been chosen for this study because of the additional stresses of life they face that usually interfere with the process of learning. The study is conducted using a series of student questionnaires to define both general and specific areas of teaching and the classroom environment that need improvement. From the results of the student questionnaires, the instructor develops solutions to the selected problem areas. At the conclusion of the course, the success of the process in meeting the objective is by a final student-measured questionnaire, an instructor evaluation and a comparison of present to past student performance in the course. After the initial pilot study is completed, the process is reviewed and refined. It is planned to expand the process voluntarily to other courses in the Department of Engineering Technology at the authors' institute. It is further planned that the process would be further refined and expanded in successive semesters. It is expected that this process could be used to improve the learning of adult engineering technology students at other colleges and universities through the improvement of teaching effectiveness and the classroom environment.
Towards a Science of Temporal Databases
Authors: Richard T. Snodgrass
Venue: Proceedings of the 14th International Symposium on Temporal Representation and Reasoning (2007)

Computer science has long been considered to emphasize three distinct perspectives: mathematics, science, and engineering. While the database field has some very strong mathematical and engineering work, the scientific perspective has been much less prominent. This keynote will elaborate the scientific perspective, apply it to research questions in temporal databases, and emphasize that this new way of thinking can yield new insights and deeper understanding.
Proceedingsof the 10th international workshop on Software compilers for embedded systems
Authors: Heiko Falk, Peter Marwedel
Venue: ACM International Conference Proceeding Series; Vol. 235 (2007)

This volume contains the proceedings of the 10th International Workshop on Software and Compilers for Embedded Systems (SCOPES 2007) held in Nice, France, on April 20th, 2007. One of the key characteristics of embedded software is that it heavily depends on the underlying hardware. Embedded processors are highly application specific, and embedded software thus needs to be designed such that it makes best use of a processor's features. As a consequence, embedded software design is directly related to an optimization process exploiting the characteristics of the underlying hardware under consideration of various cost functions like e. g. code size, energy consumption etc. SCOPES focuses on the software generation process for modern embedded systems. Topics of interest include all aspects of the compilation process, starting with suitable modeling and specification techniques and programming languages for embedded systems. The emphasis of the workshop lies on code generation techniques for embedded processors. The exploitation of specialized instruction set characteristics is as important as the development of new optimizations for embedded application domains. Cost criteria for the entire code generation and optimization process include runtime, timing predictability, energy dissipation, code size and others. Since today's embedded devices frequently consist of a multi-processor system-on-chip, the scope of this workshop is not limited to single-processor systems but in particular covers compilation techniques for MPSoC architectures. SCOPES 2007 is the 10th workshop in a series of workshops initially called "International Workshop on Code Generation for Embedded Processors". The name SCOPES has been used since the 4th workshop in 1999. Since then, SCOPES has been held in St. Goar, Germany in 2001; Berlin, Germany in 2002; Vienna, Austria in 2003; Amsterdam, The Netherlands in 2004; Dallas, USA in 2005; and now in Nice, France. This year, SCOPES is held as a Friday Workshop of the European Design, Automation and Test conference (DATE) for the very first time. By bringing SCOPES and DATE together, SCOPES attracts a high degree of visibility, and the DATE conference as premier European design automation event explicitly emphasizes the importance of embedded software and compilers. In response to the call for papers, 30 very strong papers were submitted from all over the world. All submitted papers were reviewed by at least three experts to ensure the quality of the workshop. In the end, the program committee selected 12 papers for presentation at the workshop. These papers are divided into the following categories: "Stream- and data-flow based computing", "Memory-aware compilation", "Multiprocessors and link-time optimization" and "Recent advances in static single-assignment representations".
Immaterial display for interactive advertisements
Authors: Ismo K. Rakkolainen, Artur K. Lugmayr
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

We present some of our experiments with the "immaterial" walk-through FogScreen for advertising. We use interactivity for creating visually compelling advertisements with the immaterial screens in mid-air. An immaterial projection screen has many advantages for advertisements and other applications. It is visually intriguing and can also be made two-sided so that the opposing viewers on each side see both their side of the screen and each other through it, and can even walk through it. The screen is unbreakable and stays always clean. Our results show that the audience stayed with the walk-through advertisement over extended periods of time and the overall comments were positive. It was generally assessed to be very captivating and inspiring. However, the whole concept of immaterial, interactive mid-air display is so new that viewers would have needed more instructions for using it, like for example a text in mid-air saying "touch me" or such. This underlines the importance of well-designed content with any media platform.
Workstation redesign for a repetitive drill press operation: A combined work design and ergonomics approach: Research Articles
Authors: Biman Das, Ashraf A. Shikdar, Troy Winters
Venue: Human Factors in Ergonomics Manufacturing (2007)

A typical or conventional workstation for a repetitive drill press operation was evaluated and subsequently redesigned by incorporating the concepts and principles of work design and ergonomics. The production task comprised of drilling four holes on a prepared steel plate. A methods&ndash;time measurement (MTM) analysis was conducted to eliminate unnecessary motions and improve the necessary (work) motions involved in task performance. The specific features of the redesigned workstation were specially designed equipment (jig, fixture, etc.), a suitable adjustable chair, proper work height, a placement of tools&#x002F;equipment within reach envelope, and a comprehensive operator training method. An experimental investigation was conducted to evaluate and test the redesigned workstation in terms of operator productivity (production quantity and quality output) and satisfaction. The increases in quantity (number of holes drilled) and quality (number of good holes drilled) output were 22 and 50&percnt;, respectively, for the redesigned workstation compared to the typical or conventional workstation. The high improvement in quality output (50&percnt;) could be attributed to the improved design of the jig and fixture and the comprehensive operator training method, which emphasizes the quality aspect of production output. The improvement in operator satisfaction (scores) were highly significant. This investigation has demonstrated the beneficial effect of a combined work design and ergonomics approach, especially for the redesign of a workstation for a repetitive drill press operation. &copy; 2007 Wiley Periodicals, Inc. Hum Factors Man 17: 395&ndash;410, 2007.
MapReduce: simplified data processing on large clusters
Authors: Jeffrey Dean, Sanjay Ghemawat
Venue: Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6 (2004)

MapReduce is a programming model and an associated implementation for processing and generating large data sets. Users specify a map function that processes a key/value pair to generate a set of intermediate key/value pairs, and a reduce function that merges all intermediate values associated with the same intermediate key. Many real world tasks are expressible in this model, as shown in the paper. Programs written in this functional style are automatically parallelized and executed on a large cluster of commodity machines. The run-time system takes care of the details of partitioning the input data, scheduling the program's execution across a set of machines, handling machine failures, and managing the required inter-machine communication. This allows programmers without any experience with parallel and distributed systems to easily utilize the resources of a large distributed system. Our implementation of MapReduce runs on a large cluster of commodity machines and is highly scalable: a typical MapReduce computation processes many terabytes of data on thousands of machines. Programmers find the system easy to use: hundreds of MapReduce programs have been implemented and upwards of one thousand MapReduce jobs are executed on Google's clusters every day.
GCA: A Coclustering Algorithm for Thalamo-Cortico-Thalamic Connectivity Analysis
Authors: Cui Lin, Shiyong Lu, Xuwei Liang, Jing Hua
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

The reciprocal connectivity between the cerebral cortex and the thalamus in a human brain is involved in consciousness and related to various brain disorders, thus, in-vivo analysis of this connectivity is critically important for brain diagnosis and surgery planning. While existing work either focuses on fiber tracking analysis or on thalamic nuclei segmentation, to our best knowledge, no techniques yet exist for performing in-vivo analysis of thalamo-corticothalamic connectivity. In this paper, (i) we propose a new partitioning paradigm, called coclustering, to model this problem. In contrast to the traditional clustering paradigm, a coclustering procedure not only simultaneously partitions cortical voxels and thalamic voxels into groups, but also identifies the corresponding strong connectivities between the two classes of groups; (ii) we develop the first coclustering algorithm, Genetic Coclustering Algorithm (GCA), to solve the coclustering problem; and (iii) we apply GCA to perform in-vivo analysis of the thalamo-cortico-thalamic connectivity and produce a strikingly clear 3-D visualization of the seven thalamic nuclei groups as well as their connectivities to the corresponding cortical regions of a human brain.
SMOCK: A Self-Contained Public Key Management Scheme for Mission-Critical Wireless Ad Hoc Networks
Authors: Wenbo He, Ying Huang, Klara Nahrstedt, Whay C. Lee
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications (2007)

Mobile ad hoc networks show great potential in emergency response and/or recovery. Such mission-critical applications demand security service be "anywhere", "anytime" and "anyhow". However, it is challenging to design a key management scheme in current wireless ad hoc networks to fulfill the required attributes of secure communications, such as data integrity, authentication, confidentiality, non-repudiation and service availability, when Sybil attacks are present. In this paper, we present a self-contained public key management scheme, called SMOCK, which is able to resist the Sybil attack, achieves zero communication overhead for authentication, and offers high service availability. In our scheme, small number of cryptographic keys are stored off-line at individual nodes before they are deployed in the network. To provide good scalability in terms of number of nodes and storage space, we utilize a combinatorial design of public-private key pairs, which means nodes combine more than one key pair to encrypt and decrypt messages. We also show that SMOCK provides controllable resilience when malicious nodes break into a limited number of nodes before key revocation and renewal.
On the convergence of He's variational iteration method
Authors: Mehdi Tatari, Mehdi Dehghan
Venue: Journal of Computational and Applied Mathematics (2007)

In this work we will consider He's variational iteration method for solving second-order initial value problems. We will discuss the use of this approach for solving several important partial differential equations. This method is based on the use of Lagrange multipliers for identification of optimal value of a parameter in a functional. This procedure is a powerful tool for solving the large amount of problems. Using the variational iteration method, it is possible to find the exact solution or an approximate solution of the problem. This technique provides a sequence of functions which converges to the exact solution of the problem. Our emphasis will be on the convergence of the variational iteration method. In the current paper this scheme will be investigated in details and efficiency of the approach will be shown by applying the procedure on several interesting and important models.
An Innocuous Visual Cryptography Scheme
Authors: Hyoung Joong Kim, Vasiliy Sachnev, Su-Jeong Choi, Shijun Xiang
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

An innocuous visual secret sharing scheme over natural images is presented in this paper. Secret sharing scheme allows a group of participants to share a secret (i.e., an image) among them. In case of (k, n) visual cryptography any group of k qualified participants among n (where k · n) can reconstruct the secret. This paper presents (n, n) visual cryptography scheme. This scheme does not apply dithering techniques to hide a secret image. Thus, it does not degrade quality of the secret image and in particular, this scheme is far from negative photo effect. Instead of dithering, this scheme spreads data by applying simple arithmetic operations. The rationale of arithmetic operations is presented.
Finger Force Direction Recognition by Principal Component Analysis of Fingernail Coloration Pattern
Authors: Yu Sun, John M. Hollerbach, Stephen A. Mascaro
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

A method based on Principal Component Analysis of the fingernail coloration pattern is presented to infer fingertip force direction during planar contact. Images from 7 subjects were registered and normalized to each other. Results show that the fingernail coloration patterns are similar for the 7 subjects, but the feature centroids vary. It is concluded that there are common features for all people. But accurate detection of fingertip force direction requires individually calibrated centroids.
The digital prolate spheroidal window
Authors: T. Verma
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

The optimal window, the time limited sequence whose energy is most concentrated in a finite frequency interval, is related to a particular discrete prolate spheroidal sequence. The optimal window is actually a family of windows with many degrees of freedom. The Kaiser (1974) window is an approximation to this optimal window. Kaiser used this approximation because the standard method employed to compute the optimal window is numerically ill-conditioned. We show the actual optimal window can be efficiently computed by using an alternative formulation of the discrete prolate spheroidal sequences. We then give a set of design formulas to generate the optimal window for the desired window length, mainlobe width, and relative peak sidelobe height.
Using Automated Fix Generation to Secure SQL Statements
Authors: Stephen Thomas, Laurie Williams
Venue: Proceedings of the Third International Workshop on Software Engineering for Secure Systems (2007)

Since 2002, over 10% of total cyber vulnerabilities were SQL injection vulnerabilities. Since most developers are not experienced software security practitioners, a solution for correctly fixing SQL injection vulnerabilities that does not require security expertise is desirable. In this paper, we propose an automated method for removing SQL injection vulnerabilities from Java code by converting plain text SQL statements into prepared statements. Prepared statements restrict the way that input can affect the execution of the statement. An automated solution allows developers to remove SQL injection vulnerabilities by replacing vulnerable code with generated secure code. In a formative case study, we tested our automated fix generation algorithm on five toy Java programs which contained seeded SQL injection vulnerabilities and a set of object traceability issues. The results of our case study show that our technique was able remove SQL injection vulnerabilities in five different statement configurations.
Realizing fine-granular Read andWrite Rights on Tree Structured Documents
Authors: Franz Kollmann
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Partial encryption of contents in tree structured documents like XML allows to define a fine-granular local access control on nodes for different users: depending on the read permissions a user gets keys and can decrypt encrypted document parts. However, this approach leads to a management of countless keys. The main goal of the presented key management scheme is to reduce the effort for the key management in tree structured documents in order to achieve a simple key retrieval. In contrast to existing approaches, write permissions are introduced allowing only authorized users valid write operations in such documents. To reduce the key storage, a derivation of read permissions from write permissions is presented, while read permissions and write permissions are inherited from parent nodes. Among read and write permissions, rights for structural modifications are included to guarantee the authenticity of such documents. Additionally the problem of key transmission, the evaluation of data overhead for a realization of this scheme, and security aspects are discussed.
Secure data deletion for Linux file systems
Authors: Steven Bauer, Nissanka B. Priyantha
Venue: Proceedings of the 10th conference on USENIX Security Symposium - Volume 10 (2001)

Security conscious users of file systems require that deleted information and its associated meta-data are no longer accessible on the underlying physical disk. Existing file system implementations only reset the file system data structures to reflect the removal of data, leaving both the actual data and its associated meta-data on the physical disk. Even when this information has been overwritten, it may remain visible to advanced probing techniques such as magnetic force microscopy or magnetic force scanning tunneling microscopy. Our project addresses this problem by adding support to the Linux kernel for asynchronous secure deletion of file data and meta-data. We provide an implementation for the Ext2 file system; other file systems can be accommodated easily. An asynchronous overwriting process sacrifices immediate security but ultimately provides a far more usable and complete secure deletion facility. We justify our design by arguing that user-level secure deletion tools are inadequate in many respects and that synchronous deletion facilities are too time consuming to be acceptable to users. Further, we contend that encrypting file information, either using manual tools or a encrypted file system, is not a sufficient solution to alleviate the need for secure data deletion.
Mechanical derivation and systematic analysis of correct linear algebra algorithms
Authors: Robert Van Geijn
Venue:  (2006)

We consider the problem of developing formally correct dense linear algebra libraries. The problem would be solved convincingly if, starting from the mathematical specification of a target operation, it were possible to generate, implement and analyze a family of correct algorithms that compute the operation. This thesis presents evidence that for a class of dense linear operations, systematic and mechanical development of algorithms is within reach. It describes and demonstrates an approach for deriving and implementing, systematically and even mechanically, proven correct algorithms. It also introduces a systematic procedure to analyze, in a modular fashion, numerical properties of the generated algorithms.
Applications of evolutionary computation in electric power systems
Authors: A. P. Alves da Silva, P. J. Abrao
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

This survey covers the broad area of evolutionary computation applications to optimization, model identification, and control in power systems. Due to space limitation, all reviewed papers have been selected since 1996, from IEEE Transactions only. A total of 85 articles are listed in this survey. It shows the development of the area and identifies current trends. The following techniques are considered under the scope of evolutionary computation: evolutionary algorithms (e.g., genetic algorithms, evolution strategies, evolutionary programming, and genetic programming), simulated annealing, tabu search, and particle swarm optimization.