ppxscal/embedding_network huggingface dataset:
Spectral Modular Exponentiation
Authors: Gokay Saldamli, Cetin K. Koc
Venue: Proceedings of the 18th IEEE Symposium on Computer Arithmetic (2007)

We describe a new method to perform the modular exponentiation operation, i.e., the computation of c = me mod n, where c, m, e and n are large integers. The new method uses the discrete Fourier transform over a finite ring, and relies on new techniques to perform multiplication and reduction operations. The method yields efficient and highly parallel architectures for hardware realizations of publickey cryptosystems requiring the modular exponentiation as the core computation, such as the RSA and Diffie-Hellman algorithms.
Making connections through publications [engineering college marketing]
Authors: M.-A. Bloss
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

This is the third in a series of six companion papers that address the marketing of the College of Engineering at the University of Arkansas, Fayetteville, USA. While valuable as an independent resource, the content of this document should be considered within the context of all six papers. Traditional publications have long been the way colleges of engineering have maintained contact with their audiences. But just as the times have changed, so have methods of communicating. No longer can the only thrust be the traditional ink and paper. Engineers must be able to get their message out through the different formats with which the audience is most comfortable. But regardless of the method, the most important element of connecting with audiences is maintaining a consistent voice. 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
A corporate approach to the introduction of flexible delivery education
Authors: F. Payne
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

There are many examples where individuals and groups have embraced new technology to enhance learning and capture new markets. Invariably difficulties arise from infrastructure requirements, lack of standards and the inertia of faculty and student populations to change. RMIT University recognising the need to change and the threat of inaction have developed and implemented a corporate strategy. This paper describes how the change has been achieved through: a corporate teaching and learning strategy focused on student centred approaches; a conscious identification of flexible delivery and assessment through the use of computers; the need to define and deliver graduate attributes consistent with professional practice and accrediting bodies. The Information Technology Alignment Program (ITAP) and the Distributed Learning System (DLS) have been established to provide a standard university wide infrastructure and interface for program development and delivery. Changes of this magnitude and nature are not possible over a very short period. Progress and experience to date are described, including processes adopted in the Faculty of Engineering to involve all faculty staff and their resulting response. What we believe is unique, is the resolve and resources that the university has committed (5% of budget, approximately A$16 M) to meet this educational challenge in a corporate way in an environment where individual academic practices has dominated.
A Distributed Algorithm for Joins in Sensor Networks
Authors: Alexandru Coman, Mario A. Nascimento
Venue: Proceedings of the 19th International Conference on Scientific and Statistical Database Management (2007)

Given their autonomy, flexibility and large range of functionality, wireless sensor networks can be used as an effective and discrete means for monitoring data in many domains. Typical sensor nodes are very constrained, in particular regarding their energy and memory resources. Thus, any query processing solution over these devices should consider their limitations. We investigate the problem of processing join queries within a sensor network. Due to the limited memory at nodes, joins are typically processed in a distributed manner over a set of nodes. Previous approaches have either assumed that the join processing nodes have sufficient memory to buffer the subset of the join relations assigned to them, or that the amount of available memory at nodes is known in advance. These assumptions are not realistic for most scenarios. In this context we propose and investigate DIJ, a distributed algorithm for join processing that considers the memory limitations at nodes and does not make a priori assumptions on the available memory at the processing nodes. At the same time, our algorithm still aims at minimizing the energy cost of query processing.
CODEF: a system level design space exploration tool
Authors: M. Auguin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

The increasing complexity of embedded applications combined with the advances in chip integration make the design process a very challenging task. Due to this rising complexity, the design under performance, area and consumption constraints of a system-on-a-chip (SOC) composed of mixed software-hardware units, becomes increasingly intricate. This paper presents a method and an associated tool (CODEF) which allow the designer to do an automatic and/or interactive system design space exploration in order to construct cost effective embedded real-time architectures dedicated to complex signal processing applications. The method is based on a recursive partitioning algorithm followed by a communication synthesis procedure.
The decomposition of large problems using single-sided subbanding
Authors: J. P. Reilly
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

In this paper, we show that an NPR M-channel filter bank with a diagonal system inserted between the analysis and synthesis filterbanks, with appropriately chosen analysis and synthesis filters, may be used to decompose an arbitrary FIR system of O(L) into M FIR complex subband components each of O(L/K), where K is the downsampling rate. This decomposition is at the expense of using complex arithmetic for the subband processing. The proposed filter bank structure has application in the identification and equalization of long channels, (such as those that occur in reverberative environments) where existing algorithms may be intractable. By reducing the order of the problem in the subbands, such problems become computationally feasible. The improved performance and reduced computational requirements afforded by the proposed method are verified using the acoustic echo cancellation (AEC) problem as an example.
Using writing to enhance collaborative learning in engineering courses
Authors: E. Wheeler
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 01 (1998)

Many educators use collaborative learning in engineering courses. After detailing their efforts to employ collaborative efforts in their classrooms, the authors argue that these efforts can be enhanced and augmented by the thorough integration of writing. They give specific classroom examples of their recent efforts toward this end in three engineering courses-circuit analysis, solid state devices and senior design. They explore writing in general terms as a process that allows collaborative learning to be more efficient and effective. They argue the use of writing, both as a learning tool and as a means of communication, can result in a qualitative improvement in collaborative efforts, that it is useful for addressing problems of students with a variety of learning styles, and that it is a flexible learning tool in developing critical thinking. Writing can be used to allow students adverse to group work and those who communicate poorly to participate more fully in collaborative activities. Frequent use of writing in engineering courses can both deepen students' understanding of technical content and allow the inclusion of topics which contribute breadth. All the while, writing allows students to develop a variety of skills vital for professional success.
Dynamic Service Composition in Pervasive Computing
Authors: Swaroop Kalasapur, Mohan Kumar, Behrooz A. Shirazi
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

Service-oriented architectures (SOAs) promise to provide transparency to resource access by exposing the resources available as services. SOAs have been employed within pervasive computing systems to provide essential support to user tasks by creating services representing the available resources. The mechanism of combining two or more basic services into a possibly complex service is known as service composition. Existing solutions to service composition employ a template-matching approach, where the user needs are expressed as a request template, and through composition, a system would identify services to populate the entities within the request template. However, with the dynamism involved in pervasive environments, the user needs have to be met by exploiting available resources, even when an exact match does not exist. In this paper, we present a novel service composition mechanism for pervasive computing. We employ the service-oriented middleware platform called Pervasive Information Communities Organization (PICO) to model and represent resources as services. The proposed service composition mechanism models services as directed attributed graphs, maintains a repository of service graphs, and dynamically combines multiple basic services into complex services. Further, we present a hierarchical overlay structure created among the devices to exploit the resource unevenness, resulting in the capability of providing essential service-related support to resource-poor devices. Results of extensive simulation studies are presented to illustrate the suitability of the proposed mechanism in meeting the challenges of pervasive computing—user mobility, heterogeneity, and the uncertain nature of involved resources.
Cross-product algorithms for source tracking using an EM vector sensor
Authors: A. Nehorai
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

We present two adaptive cross-product algorithms for tracking the direction to a moving source using an electromagnetic vector sensor. The first is a cross-product algorithm with a forgetting factor, for which we analyze the performance and derive an asymptotic expression of the variance of angular estimation error. We find the optimal forgetting factor that minimizes this variance. The second is a Kalman filter combined with the cross-product algorithm, which is applicable when the angular acceleration of the source is approximately constant.
Neptune: scalable replication management and programming support for cluster-based network services
Authors: Kai Shen, Tao Yang, Lingkun Chu, JoAnne L. Holliday, Douglas A. Kuschner, Huican Zhu
Venue: Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3 (2001)

Previous research has addressed the scalability and availability issues associated with the construction of cluster-based network services. This paper studies the clustering of replicated services when the persistent service data is frequently updated. To this end we propose Neptune, an infrastructural middleware that provides a flexible interface to aggregate and replicate existing service modules. Neptune accommodates a variety of underlying storage mechanisms, maintains dynamic and location-transparent service mapping to isolate faulty modules and enforce replica consistency. Furthermore, it allows efficient use of a multi-level replica consistency model with staleness control at its highest level. This paper describes Neptune's overall architecture, data replication support, and the results of our performance evaluation.
Output synchronization of networked passive systems
Authors: Mark W. Spong
Venue:  (2006)

In this thesis we study the problem of output synchronization for a class of multi-input/multi-output nonlinear networked systems (agents, for short) whose dynamics are input-output passive. The agents are said to output synchronize if their outputs are asymptotically pairwise convergent. The agents exchange information over a network whose topology is described by an interconnection graph. We present synchronization results for both fixed and arbitrarily switching graphs. We treat both linear interconnections on balanced, directed graphs and nonlinear interconnections on undirected graphs. We also treat the realistic case of time delay in the communication of information among agents. We show that the passivity assumption allows synchronization for arbitrary constant (bounded) time delays in communication. Our results unify several existing results from the literature on multi-agent systems. We next apply our results to the problem of synchronization of Kuramoto oscillators. The traditional Kuramoto model, which consists of N oscillators with possibly distinct natural frequencies and all-to-all connectivity, is said to synchronize if the angular frequencies of all oscillators converge to the mean natural frequency of the group. Our main result demonstrates exponential oscillator synchronization to the mean frequency in the Kuramoto model with distinct natural frequencies. Our results are also used to address the general problem of synchronization of multiple Lagrangian systems. The problems of multi-robot coordination and of bilateral teleoperation with time delay are shown to be special cases of our general results.
The use of portfolios for outcomes assessment [engineering education]
Authors: B. M. Olds
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

As the ABET Engineering Criteria 2000 become a reality, many engineering educators are exploring new ways to assess their students' learning. In this paper, the author discusses one flexible and useful method of outcomes assessment-portfolios.
A unified approach to hierarchical classification
Authors: D. H. Kil
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

This paper examines a novel approach to hierarchical classification by coupling feature optimization and classifier design with feature pruning at each classification stage. We denote this method as a hierarchical sequential pruning classification (HiSPruC) strategy. The backbone of this algorithm is a recursive application of feature ranking and designing a classifier that matches the underlying good feature distribution derived from the surviving tokens. At each stage, we prune training tokens that fall into easily separable regions. We illustrate the advantage of this approach with a number of examples derived from an active sonar echo classification problem.
Teaching digital communications using MC68340 microprocessor
Authors: J. Joseph
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

This paper presents a novel way of teaching digital communication through hardware. The course is divided into several phases. In Phase I, students learn to program MC68340, the main programmable hardware of this course. MC68340 is an integrated processor with CPU32, Timer, DMA, Serial and Parallel Ports on an integrated circuit. CPU32 and M68000 have similar programmers models. Phase II introduces the concepts of asynchronous and synchronous communication techniques with several hardware assignments. Phase III is the final phase of this course in which students learn various network architectures. At this stage, students are ready to be introduced to the various layers in the ISO model, viz. application layer, presentation layer, session layer, transport layer, network layer data link layer and physical layer. Students apply the concepts that they have gained thus far to design and implement a simple digital communication network for the laboratory 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
Using Bayesian Belief Networks to Predict Change Propagation in Software Systems
Authors: Siavash Mirarab, Alaa Hassouna, Ladan Tahvildari
Venue: Proceedings of the 15th IEEE International Conference on Program Comprehension (2007)

During software evolution, developers modify various modules to handle new requirements or to fix existing bugs. Such changes usually propagate to related modules throughout the system. Program comprehension techniques are able to predict this change propagation phenomenon. In this paper, we introduce a novel approach that predicts the possible affected system modules, given a change in the system. We use Bayesian Belief Networks as a probabilistic tool to make such predictions in a systematic way. This novel technique mainly relies on two sources of information: dependency metrics (calculated using static analysis) and change history extracted from a version control repository. We evaluate our approach by examining all significant revisions of Azureus2, an open-source Java system. The results show that the predicted change probabilities reflect actual module changes even in the early stages of the software development.
QoS management in heterogeneous home networks
Authors: Jiann-Liang Chen, Ming-Chiao Chen, Yi-Ru Chian
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2007)

An OSGi (Open Services Gateway Initiative) home gateway system manages the integration of heterogeneous home networks protocols and devices to develop ubiquitous applications. Wired and wireless heterogeneous home networks have different QoS concerns. For instance, jitter and latency are important concerns in web phones, while packet loss ratio is important in on-line video. This study adopts UPnP QoS specification version 1.0 to design an adaptive QoS management mechanism based on the RMD (Resource Management in DiffServ) architecture. This study monitors real-time network traffic, and adaptively controls the bandwidth, to satisfy the minimum but most important quality for each application in home network congestion. Simulation results indicate that the average jitter, latency and packet loss are reduced by 0.1391ms, 0.0066s, and 5.43%, respectively. The packet loss ratio is reduced by 4.53%, and the throughput is increased by 1.2% in high definition video stream; the packet loss ratio is reduced by 1.89% for standard definition video stream, and in VoIP (Voice over IP) the jitter and latency are reduced to 0.0407ms and 0.0209s, respectively.
A new maximum Doppler frequency estimation algorithm in frequency domain
Authors: Goohyun Park, Dongkyu Heo, Daesik Hong, Changeon Kang
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

A novel maximum Doppler spread estimation algorithm for mobile communication systems is proposed. The proposed algorithm uses a fast Fourier transform (FFT) of received pilot signals, which are related with the maximum Doppler frequency f/sub D/. The proposed algorithm does not need to know any other channel information such as signal to noise ratio(SNR) because of using only the distribution of a fading channel power spectrum. Especially, the proposed algorithm shows good performance over wide a Doppler frequency in low SNR (
Reconfigurable system-on-chip data processing units for space imaging instruments
Authors: B. Fiethe, H. Michalik, C. Dierker, B. Osterloh, G. Zhou
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Individual Data Processing Units (DPUs) are commonly used for operational control and specific data processing of scientific space instruments. To overcome the limitations of traditional rad-hard or fully commercial design approaches, a System-on-Chip (SoC) solution based on state-of-the-art FPGA is introduced. This design has been successfully demonstrated in space on Venus Express. From this, a reconfigurable DPU design for future advanced imaging sensors is derived using embedded processing cores. In addition, a SoC design variant is presented based on recently available FPGA technology with integrated hardwired processor, which is capable to support also high end payload applications.
Modifying transients for efficient coding of audio
Authors: R. Vafin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

We propose a method for efficient representation of transients in audio signals. We estimate the transient component of an original audio signal and modify the locations of the transients in such a way that the transients can occur only at locations defined by a relatively coarse time grid. This procedure allows an efficient representation of transients with damped sinusoids. We also verify that the introduced modifications do not result in a perceptual difference between the original and the modified audio signals.
One sketch for all: fast algorithms for compressed sensing
Authors: A. C. Gilbert, M. J. Strauss, J. A. Tropp, R. Vershynin
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

Compressed Sensing is a new paradigm for acquiring the compressible signals that arise in many applications. These signals can be approximated using an amount of information much smaller than the nominal dimension of the signal. Traditional approaches acquire the entire signal and process it to extract the information. The new approach acquires a small number of nonadaptive linear measurements of the signal and uses sophisticated algorithms to determine its information content. Emerging technologies can compute these general linear measurements of a signal at unit cost per measurement. This paper exhibits a randomized measurement ensemble and a signal reconstruction algorithm that satisfy four requirements: 1. The measurement ensemble succeeds for all signals, with high probability over the random choices in its construction. 2. The number of measurements of the signal is optimal, except for a factor polylogarithmic in the signal length. 3. The running time of the algorithm is polynomial in the amount of information in the signal and polylogarithmic in the signal length. 4. The recovery algorithm offers the strongest possible type of error guarantee. Moreover, it is a fully polynomial approximation scheme with respect to this type of error bound. Emerging applications demand this level of performance. Yet no otheralgorithm in the literature simultaneously achieves all four of these desiderata.
Non-adaptive and adaptive filter implementation based on sharing multiplication
Authors: Jongsun Park
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

FIR filtering can be expressed as multiplication of a vector by scalars. We present high-speed implementations for adaptive and nonadaptive filters based on a computation sharing multiplier which specifically targets computation re-use in vector-scalar products. The performance of the proposed implementation is compared with implementations based on carry save and Wallace tree multipliers in 0.6 /spl mu/ technology. We show that the sharing multiplier scheme improves speed by approximately 30% and 21% with respect to the Wallace tree multiplier based implementation for non-adaptive and adaptive filters, respectively.