ppxscal/embedding_network huggingface dataset:
Modular units
Authors: William Duke
Venue:  (2006)

This dissertation is based upon the discovery of a particular family of modular units that arise naturally from functional solutions to higher order q-recurrence equations given by Selberg in his work generalizing the Rogers-Ramanujan identities. Arising in this way, these units are by nature of interest for their many analytic properties. An objective of this dissertation is to exhibit various fundamental roles played by these modular units, many of which are algebraic in nature, thus relating two areas of study often regarded separately. In particular, these modular units give rise to a subgroup of the cuspidal divisor class group in the Jacobian of the modular curves X( N) that we describe explicitly, and include a class number formula given in terms of products of L-functions. We characterize the modular unit groups generated by these objects, both appealing to and extending the work of Kubert and Lang. Within class field theory, we offer these modular units as modular function field analogues to cyclotomic units, and within the function fields exhibit these modular units as generators. Dually, within the number fields we show how specializations of these modular units may be used to generate cyclotomic unit groups. As a corollary, using a functional equation, we solve a problem considered by Zagier and Gupta, and previously by Gauss, regarding the Gauss periods. We show that this family of modular units provides a choice of class invariants for the class fields of prime modulus when evaluated at points of complex multiplication. We note that only a single value of one such modular unit is needed, and compare the classical theory of complex multiplication. We then generalize these results to class fields of more arbitrary moduli, motivated by the work of Ramachandra, combining the theory of Kubert and Lang with that of Shimura. We devote one chapter and appendices to q-series identities, relating the work of Selberg to that of Eisenstein. A complete self-contained treatment of the q-continued fraction expansions found in Eisenstein's collected works has not yet been given, and we provide one here, motivated by the fact that although not originally presented as such, Eisenstein's identities provide continued fraction expansions for classical modular forms. We provide proofs of Eisenstein's identities, not given by Eisenstein himself, employing only standard methods to do so. In the final chapter, we make explicit one such modular unit group UC11 constructed from the Selberg equations, and show how this group may be used to give a modular interpretation of the invariants given by Klein for the fifth smallest non-Abelian simple group of order 660.
Validation in Internet Survey Research: Reviews and Future Suggestions
Authors: Hui-Chih Wang, Her-Sen Doong
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

In recent years, Internet surveys have been widely used by researchers and companies as a means of data collection. However, few IS studies have discussed the validation of Internet survey research. From the perspective of the positivist and quantitative research, studies that fail to organize a scientific and rigorous research design will harm their finding's validity, reliability and generalizability. In turn; their contributions to the literature and implications for business are limited. Building on a review of past marketing research studies which were well-developed in Internet survey methodological validation, this study illustrated nine issues for IS researchers to re-consider in their empirical Internet surveys. Alternative ways to enhance the necessary rigor of the survey quality in term of the Internet survey types, population, and pros./cons. of each survey type were also proposed. This paper should serve as a useful guide for IS researchers in the planning and execution of an Internet survey, or in judging the inferential ability of other Internet survey research.
Frequency dependence of perceived intensity of steering wheel vibration: effect of grip force
Authors: Miyuki Morioka, Michael J. Griffin
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

Vehicle drivers receive haptic feedback in response to their movement of the steering wheel and tactile feedback from various sources of vibration of the steering wheel, with the sensations varying depending on the frequency and the magnitude of the movements. From an experiment with 12 subjects, equivalent comfort contours were determined for vertical vibration of the hands with three grip forces. The perceived intensity of vibration on a rigid steering wheel was determined using the method of magnitude estimation at seven frequencies (4 to 250 Hz) over a range of vibration magnitudes (0.1 to 1.58 ms-2 r.m.s). The comfort contours strongly depended on vibration magnitude, indicating that a frequency weighting for predicting sensation should be dependent on vibration magnitude. At low magnitudes, increased grip force increased sensitivity at high frequencies and enhanced the frequency-dependence of the equivalent comfort contours. The results may be explained by the characteristics of the Pacinian and non-Pacinian tactile channels in the glabrous skin of the hand.
Modeling the relative fitness of storage
Authors: Michael P. Mesnier, Matthew Wachs, Raja R. Sambasivan, Alice X. Zheng, Gregory R. Ganger
Venue: ACM SIGMETRICS Performance Evaluation Review (2007)

Relative fitness is a new black-box approach to modeling the performance of storage devices. In contrast with an absolute model that predicts the performance of a workload on a given storage device, a relative fitness model predicts performance differences between a pair of devices. There are two primary advantages to this approach. First, because are lative fitness model is constructed for a device pair, the application-device feedback of a closed workload can be captured (e.g., how the I/O arrival rate changes as the workload moves from device A to device B). Second, a relative fitness model allows performance and resource utilization to be used in place of workload characteristics. This is beneficial when workload characteristics are difficult to obtain or concisely express (e.g., rather than describe the spatio-temporal characteristics of a workload, one could use the observed cache behavior of device A to help predict the performance of B. This paper describes the steps necessary to build a relative fitness model, with an approach that is general enough to be used with any black-box modeling technique. We compare relative fitness models and absolute models across a variety of workloads and storage devices. On average, relative fitness models predict bandwidth and throughput within 10-20% and can reduce prediction error by as much as a factor of two when compared to absolute models.
Analysis of a maximum likelihood digital receiver using a time-frequency transform
Authors: I. Sharfer
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

This paper presents an analysis of a novel synchronization algorithm that jointly estimates amplitude, phase and delay parameters and performs data demodulation in a passband digital communication channel. The scheme is based on a maximum likelihood (ML) iterative estimator that was presented in Sharfer and Hero (1999) and applies to a variety of linear modulation formats and shaping pulses. The algorithm uses an expansion of the received signal on a time-frequency (TF) localized basis. The analysis shows that in the limit of large observation time and signal to noise ratio (SNR) the algorithm converges to a fixed point at the true parameters and it achieves global maximization of the likelihood function. In addition, a gradient descent version of the algorithm is developed that allows joint parameter tracking and data recovery in a time varying environment. 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
The Cooperation Behaviors of Multiple Intelligent Virtual Agents Based on the Situation Calculus
Authors: Yisong Liu, Gang Wang, Lili Dong, Yamin Sun
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

The Behaviors of Intelligent Virtual Agents displayed in Virtual Reality should be derived from theirs "intelligence". So we extend ConGolog to EConGolog by formalizing the belief and intention of agents under the framework of Situation Calculus and adding communication actions in the earlier ConGolog. Meanwhile, we propose a novel cooperation model of Requirement/Service and corresponding cooperation Semantics for multi-agent system based on EConGolog. We give a case of the multi-agent system to achieve the cooperation based on reason about action and performance of action among agents in the dynamic and incompletely known environment. In addition, we develop an animation description language ECGADL based on EConGolog. It can implement the animation of various complex behaviors of the agents more conveniently and flexibly.
Discrimination and Classification of Thermophilic and Mesophilic Proteins
Authors: Todd J. Taylor, Iosif I. Vaisman
Venue: Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering (2007)

There has been considerable interest in the physical basis for the increased thermostability of thermophilic proteins with respect to their mesophilic counterparts since the discovery of highly heat tolerant organisms. We have systematically studied several large sets of protein structures in order to find those properties with the most power to discriminate mesophilic proteins from their thermophilic orthologs and then to classify proteins based on sequence and structural properties. Most of the structure-based descriptors used in our discrimination and classification experiments were derived from the Delaunay tessellations of the protein structures
Automated time table generation using multiple context reasoning for university modules
Authors: D. Srinivasan
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

Finding a feasible lecture/tutorial timetable in a large university department is a challenging problem faced continually in educational establishments. This paper presents an evolutionary algorithm (EA) based approach to solving a heavily constrained university timetabling problem. The approach uses a problem-specific chromosome representation. Heuristics and context-based reasoning have been used for obtaining feasible timetables in a reasonable computing time. An intelligent adaptive mutation scheme has been employed for speeding up the convergence. The comprehensive course timetabling system presented in this paper has been validated, tested and discussed using real world data from a large university.
Assessing student preparedness for professional engineering practice: a professional advice task
Authors: J. Turns
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

One goal of engineering education is to prepare students for professional engineering practice. Assessing such preparedness can be difficult. At the Center for Engineering Learning and Teaching, we have been exploring the development of an authentic assessment task in Civil and Environmental Engineering-the professional advice task. We have been using this task to gain insight into students' preparedness relative to ABET outcomes B (data analysis) and D (teamwork), as well as their preparedness more broadly (i.e., when they generate the list of issues, how broad are these issues). However, the format of the task is sufficiently generic that it could be used for almost any ABET outcome.
Extracting Communities from Complex Networks by the k-dense Method
Authors: Kazumi Saito, Takeshi Yamada
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

To understand the structural and functional properties of large-scale complex networks, it is crucial to efficiently extract a set of cohesive subnetworks as communities. There have been proposed several such community extraction methods in the literature, including the classical k-core decomposition method and, more recently, the k-clique based community extraction method. The k-core method, although computationally efficient, is often not powerful enough for uncovering a detailed community structure and it produces only coarse-grained and loosely connected communities. The k-clique method, on the other hand, can extract fine-grained and tightly connected communities but requires a substantial amount of computational load for large-scale complex networks. In this paper, we present a new notion of a subnetwork called k-dense, and propose an efficient algorithm for extracting k-dense communities. We applied our method to the two different types of networks assembled from real data, namely, from blog trackbacks and word associations, demonstrated that the k-dense method could extract communities almost as efficiently as the k-core method, while the qualities of the extracted communities are comparable to those obtained by the k-clique method.
Admission Control in Optical Label Switched Networks: A Dynamic QoS-Based Approach
Authors: Yassine Khlifi, Noureddine Boudriga, Mohammad S. Obaidat, Sihem Guemara-ElFatmi
Venue: Proceedings of the 40th Annual Simulation Symposium (2007)

Optical Label Switching (OLS) is a promising technology that can provide ressource provisioning and quality of service (QoS) support. In OLS networks, admission control can be implemented using control protocols that handle signaling tasks, resource provision, and QoS requirements satisfaction. In this paper, we use a core node architecture to build a call admission control protocol using dynamic QoS performance parameters. We also develop a theoretical model for evaluating the performance of the proposed protocol by means of a conservation law and a queuing network model. Finally, we verify the performance of our approach using simulation analysis.
Program committee chairs' message
Authors: J. Heidemann, L. Krishnamurthy
Venue: Proceedings of the 2nd IEEE workshop on Embedded Networked Sensors (2005)

While sensor network research has made significant strides in the past few years, the literature has relatively few examples of papers that have evaluated and validated a complete experimental system. In this paper, we discuss our deployment experiences and evaluate the performance of a multi-hop wireless data acquisition system (called Wisden) for structural health monitoring (SHM) on a large seismic test structure used by civil engineers. Our experiments indicate that, with the latest sensor network hardware, Wisden can reliably deliver time-synchronized tri-axial structural vibration data reliably across multiple hops with low latencies for sampling rates up to 200 Hz. This performance was achieved by iteratively refining the system design using a series of test deployments. Our experiences suggested the need for careful onset detection in order to preserve the fidelity of the structure's frequency response. Furthermore, the high damping characteristics of large structures motivated an exploration of the processing, sampling, and communication limits of current platforms.
An integrated framework for image classification
Authors: Xuling Luo
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

This paper presents a novel method for classifying an image into one of predefined classes in a data bank by applying mutual information to a representation of the Fourier amplitude domain. Template and test images are made translation and rotation invariant through the Fourier-Mellin transform. While mutual information could be employed here, we choose instead to apply it to the lower dimension phase spectrum generated by the complex multiresolution wreath product transform of the Fourier-Mellin amplitude spectrum. The phase information of this transform adequately preserves edges even at lower resolutions while permitting at the same time, a reduction in the computational burden. Brodatz textures and ORL faces are used to demonstrate the capability of this algorithm.
High Dynamic Range Images: Evolution, Applications and Suggested Processes
Authors: Ahmad Rafi, Musstanser Tinauli, Mohd Izani
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

Three dimensional (3D) and Computer Graphics (CG) industries nowadays require "instant' realism and extreme special effects while imposing the balance in cost, time and solution acceptance standard. It has been known that realistic rendering is time consuming, difficult to use, complex, expensive and often produces insufficient digital output to predict particularly in the early visualization process. This paper focuses on one of the emerging technologies, High Dynamic Range Image (HDRI) and how it can be developed in achieving effective solution, while maintaining "realism' or required result based on a specific application. We firstly introduce the overall HDRI processes before continue to present a framework of captured Low Density Range Image (LDRI) source sequence effectively in HDRI environment. This paper concludes with discussions and lists the application of HDRI.
Cascaded generic XCS to learn about reminding preferences
Authors: Nadine Richard, Samuel Tardieu, Seiji Yamada
Venue: Proceedings of the 2007 GECCO conference companion on Genetic and evolutionary computation (2007)

We are developing an adaptive reminding system, which learns when and how to present notifications. In this paper, we focus on our XCS-based model, composed of two cascaded sets of classifiers: the first one learns a categorization of calendar data, while the second selects the appropriate forms of combinable reminders depending on the user and device contexts. After describing the characteristics of the input data, we present the extensions we propose to provide a generic XCS architecture, which seems suitable for processing those specific inputs. Finally, we describe our user feedback mechanism, and the according reward system.
On the Role and Place of Computation in Science and Engineering
Authors: Martin Berzins, Bradley A. Shadwick, Denis Donnelly
Venue: Computing in Science and Engineering (2007)

Associate editor in chief, Denis Donnelly, invited two luminaries from different institutions to discuss the role of computation in science and engineering.
A survey on modeling issues using the machine description language LISA
Authors: A. Hoffmann
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

This paper presents a survey on modeling issues of programmable architectures using the machine description language LISA. Various architectures presenting diverse architectural characteristics are presented and the feasibility of automatically generating simulator, assembler, linker and graphical debugger frontend discussed. The presented approach is not limited to a fixed abstraction level-case studies of the Texas Instruments C62/spl times/ and C54/spl times/, the Analog Devices ADSP2101 as well as the ARM7 show the applicability of the methodology from cycle/phase to instruction accurate models.
Reactivity-Based Quality of Service Strategies for Web Applications
Authors: Leonardo Silva, Adriano Pereira, Wagner Meira Jr.
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet (2007)

The great success of the Internet has raised new challenges in terms of applications and user satisfaction. Web applications demand requirements, such as performance and scalability, in order to guarantee quality of service (QoS) to users. Due to these requirements, QoS has become a special topic of interest and many mechanisms to provide it have been proposed. Those mechanisms fail to consider aspects related to reactivity, i.e., how the users react to variable server response time. This work addresses the use of reactivity to provide new strategies. We design and evaluate a reactivity-based scheduling mechanism that gives priority according to user behavior. We also propose a hybrid admission control and scheduling mechanism that combines both reactive approaches. The results show benefits in terms of response time and user satisfaction.
A neural network based transcoder for MPEG2 video compression
Authors: H. C. Fu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

We propose a neural network method for the high efficiency requatization in the design of a transcoder. In our design, there are two types of video bit rate control in the proposed transcoder. One is the global adjustment of the quantizer scales in which the adjustment is based on the complication of the whole frame, the other is the adaptive adjustment of the quantizer scales, where the adjustment results in a complication of the current macroblock. From the experimental results, the prototype transcoder can achieve a desirable bit rate (1.5 Mbps) with an acceptable image quality. In addition, we constructed a video multiplexer for pay per view (PPV) or near video on demand (NVOD) applications on the proposed transcoder.
StoryBank: an indian village community digital library
Authors: Matt Jones, Will Harwood, George Buchanan, Mounia Lalmas
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

This paper considers information access styles for a community digital library in an Indian village. We present our impressions of the community gathered during a field-study and show how these have influenced the interaction design. The prototype aims to overcome low-textual literacy and lack of computing experience by combining touch-based interaction, engaging visual presentations and drawing on villagers' familiarity with radio listening.
Confidential multimedia communication in IP networks
Authors: L. Lo Iacono, C. Ruland
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

Communication in open packet-based networks like the Internet must be considered including security aspects. Different approaches exist to realize e.g. confidentiality in IP networks: IPSec at the network layer, TLS/SSL residing on the transport layer and security extensions for applications. Real-time-oriented Internet applications cause different demands on security protocols compared to their counterparts like e.g. HTTP does. It is questionable if the existing mechanisms are suitable for securing multimedia communication. This paper gives an overview of multimedia communication over the Internet. It describes available approaches for enabling confidentiality and analyzes the usability in real-time-oriented environments. Since currently all multimedia applications use RTP to packetize the media stream the newly proposed Internet Draft Secure Real-time Transport Protocol (SRTP) is analyzed as well. SRTP is presented in more detail and an extension to the H.323 protocol family to support SRTP is introduced. This approach enables on the one hand H.323 terminals to use the security services provided by SRTP and on the other hand the application of SRTP even in heterogenous signaling environments. Furthermore our SRTP implementation and its integration into the OpenH323 project is described.