ppxscal/embedding_network huggingface dataset:
Probabilistic Concurrent Error Compensation in Nonlinear Digital Filters Using Linearized Checksums
Authors: Muhammad M. Nisar, Maryam Ashouei, Abhijit Chatterjee
Venue: Proceedings of the 13th IEEE International On-Line Testing Symposium (2007)

Soft errors due to alpha particles, neutrons and environmental noise are of serious concern in highly scaled CMOS circuits. This mandates the use of error/noise tolerance mechanisms in circuit design. Prior work has addressed error correction and compensation techniques for linear digital systems using checksum codes. However no low-cost checksum based technique is found in the literature for nonlinear digital signal processing systems. The problem of error detection and compensation in nonlinear systems is harder due to difficulties in encoding nonlinear operations and correcting for errors in the same. This paper presents a checksum based technique for error compensation in nonlinear digital filters using the time-freeze linearization method. The technique uses distance-two linearized checksum error detection codes for SNR improvement using probabilistic error compensation instead of deterministic error removal. It is shown that by careful checksum code design, significant filter SNR improvement can be obtained in the presence of soft errors.
Minimum mean square error estimation for a class of chaotic systems
Authors: D. F. Drake
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

We develop the Bayesian maximum a posteriori (MAP) and minimum mean square error (MMSE) estimators for sequences generated by a class of discrete-time chaotic systems. This class (of which the sawtooth map, an archetype of chaotic behavior, is a member) consists of maps of the unit interval whose dynamics are precisely equivalent to the output of a first order, anticausal filter excited by independent, identically distributed Bernoulli noise. This linear formulation reduces the MAP estimation procedure to an M-ary hypothesis testing problem and simplifies the computation of the conditional expectation that represents the MMSE estimate. Estimator performance is evaluated on two systems from the class and compared with the Bayesian linear minimum mean square error estimator.
Generation of optimum signature base sequences for speech signals
Authors: B. S. Yarman
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

In previous publications, we proposed a novel method to represent signals in terms of, so called, "signature base functions-SBF" which were extracted from the physical features of the waveform under consideration. SBF were determined in ad-hoc manner, which requires tedious search process, and they were not orthogonal. Furthermore, optimality of SBF was in question. In this work however, we suggest a well-organised procedure to generate "optimum orthogonal signature base functions-OSBF" for selected waveforms, which in turn provides excellent means for signal representations. It is shown that the new method of signal representation, which is based on OSBF, requires less computation time with substantial signal compression and results in efficient speaker dependent recognition.
Evolutionary algorithms using a neural network like migration scheme
Authors: Thomas Villmann
Venue: Integrated Computer-Aided Engineering (2002)

We introduce a multiple subpopulation approach for parallel evolutionary algorithms the migration scheme of which follows a neural network learning like dynamic. It is adapted from the approach of collective learning in self-organizing maps with a more and more separation during time. We succesfully apply this approach to clustering real world data in psychotherapy research and VLSI-design. The advantages of the approach are shown which consist in a reduced communication overhead between the subpopulations preserving a non-vanishing information flow and an improved convergence rate resulting in decreasing computational costs.
MetaTM/TxLinux: transactional memory for an operating system
Authors: Hany E. Ramadan, Christopher J. Rossbach, Donald E. Porter, Owen S. Hofmann, Aditya Bhandari, Emmett Witchel
Venue: Proceedings of the 34th annual international symposium on Computer architecture (2007)

This paper quantifies the effect of architectural design decisions onthe performance of TxLinux. TxLinux is a Linux kernel modifiedto use transactions in place of locking primitives in several key subsystems.We run TxLinux on MetaTM, which is a new hardwaretransaction memory (HTM) model.MetaTM contains features that enable efficient and correct interrupthandling for an x86-like architecture. Live stack overwrites can corrupt non-transactional stack memory and requires a smallchange to the transaction register checkpoint hardware to ensurecorrect operation of the operating system. We also propose stack based early release to reduce spurious conflicts on stack memorybetween kernel code and interrupt handlers.We use MetaTM to examine the performance sensitivity of individualarchitectural features. For TxLinux we find that Polka and SizeMatters are effective contention management policies, someform of backoff on transaction contention is vital for performance,and stalling on a transaction conflict reduces transaction restartrates, but does not improve performance. Transaction write setsare small, and performance is insensitive to transaction abort costsbut sensitive to commit costs.
Techno Teacher/Techno Kid
Authors: K. G. Spirer
Venue: Proceedings of the Frontiers in Education Conference, on 1995. Proceedings., 1995 - Volume 02 (1995)

Summary form only given. The Massachusetts Pre-Engineering Program, Inc. (MassPEP) works with urban teachers and students to design integrated mathematics, science and technology curriculum modules that focus on the practical applications of math/science in applied technology disciplines and include career awareness activities. Hands-on activities, teamwork and student competitions are key success factors in the program. Urban systemic change in math/science succeeds when students, teachers, parents and industry/community partners work together to provide financial resources, input to program planning, career counseling and mentoring. MassPEP was awarded a grant in 1994 to expand program outreach to include teachers and students in grades K-12. New curriculum modules for 1995-96 are described. MassPEP works with the targeted groups to produce activities tying exciting career/college prospects to math/science. An electronic component ties participants to peers and colleagues nationwide and facilitate student research, competition and information exchanges. Techno Teacher/Techno Kid is designed to build leadership skills, academic achievement, confidence and self-esteem. Parents gain confidence in their ability to help their children with school work. Teachers learn to break down tough math/science concepts with activities that are student-centered, inexpensive and fun. Students begin to enjoy learning and believe in their ability to succeed in school. All participants acquire the leadership skills needed to share their newly acquired skills with others, which increases the program's impact. 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
An iterative method for generalized nonlinear set-valued mixed quasi-variational inequalities with H-monotone mappings
Authors: Lu-Chuan Zeng, Sy-Ming Guu, Jen-Chih Yao
Venue: Computers Mathematics with Applications (2007)

Generalized nonlinear set-valued mixed quasi-variational inequalities with maximal monotone mappings have been studied in the literature. Since the maximal monotone operators are known as special cases of the H-monotone operators, we generalize the study for these inequality problems with H-monotone mappings in this paper. Precisely, we establish the existence of solutions for the generalized nonlinear set-valued mixed quasi-variational inequality problem with H-monotone mappings. An iterative method for finding their approximate solutions are proposed. Furthermore, a new convergence criteria for this iterative method is imposed.
HoneySpam: honeypots fighting spam at the source
Authors: Mauro Andreolini, Alessandro Bulgarelli, Michele Colajanni, Francesca Mazzoni
Venue: Proceedings of the Steps to Reducing Unwanted Traffic on the Internet on Steps to Reducing Unwanted Traffic on the Internet Workshop (2005)

In this paper, we present the design and implementation of HoneySpam, a fully operating framework that is based on honeypot technologies and is able to address the most common malicious spammer activities. The idea is that of limiting unwanted traffic by fighting spamming at the sources rather than at the receivers, as it is done by the large majority of present proposals and products. The features of HoneySpam include slowdown of the e-mail harvesting process, poisoning of e-mail databases through apparently working addresses, increased spammer traceability through the use of fake open proxies and open relays.
Joint time delay and frequency estimation of multiple sinusoids
Authors: G. Liao
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

We devise a new subspace method for estimating the differential time delay of a signal received at two separated sensors as well as the frequencies of the source signal, assuming that it consists of multiple sinusoids. The time delay and frequency estimates are related to the eigenvalues and eigenvectors of a matrix obtained from the covariances of the received signals. The effectiveness of the proposed algorithm is demonstrated via computer simulations using sinusoidal signals as well as real speech data.
SCTP performance evaluation over heterogeneous networks: Research Articles
Authors: Alberto Dainotti, Salvatore Loreto, Antonio Pescapé, Giorgio Ventre
Venue: Concurrency and Computation: Practice Experience (2007)

Since its definition in 2000, the Stream Control Transmission Protocol (SCTP) has attracted increasing interest. Several research works, often validated through analytical and simulative analysis, have attempted to evaluate the benefits of substituting TCP with SCTP, both for signaling and data transfer. In this work, we present a traffic generation and performance analysis tool to test SCTP on real networks. We study the performance of SCTP on real heterogeneous (wired&#x002F;wireless) scenarios, providing results in terms of throughput and jitter, and comparing its performance against TCP and UDP over the same conditions. Our experimental analysis shows that the current performance of SCTP (operating on a Linux platform) does not justify the use of SCTP as a simple substitute for TCP. Copyright &copy; 2007 John Wiley & Sons, Ltd. This paper represents an extended version of [1].
Ginger: control independence using tag rewriting
Authors: Andrew D. Hilton, Amir Roth
Venue: Proceedings of the 34th annual international symposium on Computer architecture (2007)

The negative performance impact of branch mis-predictions can be reduced by exploiting control independence (CI). When a branch mis-predicts, the wrong-path instructions up to the point where control converges with the correct path are selectively squashed and replaced with correct-path instructions. Instructions beyond the convergence-point-the branch's control-independent (CI) instructions-are spared from squashing. Exploiting CI requires updating the input data dependences of CI instructions to reflect the selective removal and insertion of logically older instructions and transitively re-dispatching those CI instructions whose inputs have changed. This capability is generally called out-of-order renaming. Previously proposed CI designs use out-of-order renaming schemes that either consume excessive rename/dispatch bandwidth, can only be applied in limited cases, or incur a cost even when the branch would be correctly predicted. Ginger is a CI design that is both general and bandwidth efficient. Ginger implements out-of-order renaming using tag rewriting, re-linking the input dependences of CI instructions as they sit in the window. To do this, Ginger halts the pipeline uses the idle map table read and write ports and the issue queue match lines and write lines to perform a register-tag "search-and-replace" operation. After a few cycles, the pipeline restarts and execution resumes with correct data dependences. Cycle-level simulation shows that Ginger out-performs previous CI designs, yielding geometric mean speedups over an aggressive non-CI processor of 5%, 12%, and 11%-on SPECint2000, MediaBench, and Comm-Bench-with speedups of 15% or greater on 11 of 46 programs.
Dynamic Address Allocation for Management and Control in Wireless Sensor Networks
Authors: Zheng Yao, Falko Dressler
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Several data-centric communication paradigms have been proposed in the domain of wireless sensor networks (WSN). Therefore, the principles of operation and maintenance in such networks are changing in order to control massively distributed systems. Previous addressing schemes fail or produce too much overhead even if only locally unique addresses of sensor nodes are required. In this paper, we present a dynamic address allocation scheme for localized address assignments in WSN. We developed a round-based address assignment with subsequent duplicate address detection that operates in a self-organized manner. It inherently allows busy-sleep periods and does not assumes always awake nodes. In order to verify the approach, we implemented the algorithm on Mica2 sensor motes and tested it in a WSN maintenance scenario. The results demonstrate that our method works well for operation and maintenance of WSN without prior address assignments.
Graph Use to Visualize Web Search Results: MyWish 3.0
Authors: M. Angelaccio, B. Buttarazzi, M. Patrignanelli
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

This work suggests a search tool, MyWISH 3.0, as a solution for common web search results visualization limits. This tool unifies performance standards of a stable tool with the advanced visualization ability of a Java-based, highly configurable component. The data flow of these two modules ends up in an XML interface. Moreover, because of its accurate caching techniques and its set-limited activities tracking, the tool aims to be used by communities sharing the same research objectives, making them manage various contents in a easier way. The paper starts with an overview about literature concerning visualization tools, trying to highlight present features and to suggest the deployment of some aspects. Then, it presents a test-case verified and validated implementation within a web search limited background, like a scientific community looking for information concerning European funding.
Data layouts for object-oriented programs
Authors: Martin Hirzel
Venue: ACM SIGMETRICS Performance Evaluation Review (2007)

Object-oriented programs rely heavily on objects and pointers, making them vulnerable to slow downs from cache and TLB misses. The cache and TLB behavior depends on the data layout of objects in memory. There are many possible data layouts with different impacts on performance, but it is not known which perform better. This paper presents a novel framework for evaluating data layouts. The framework both makes implementing many layouts easy, andenables performance measurements of real programs using a product Java virtual machine on stock hardware. This is achieved by sorting objects during copying garbage collection; outside of garbage collection, program performance is solely determined by the data layout that the sort key implements. This paper surveys and evaluates 10 common data layouts with 32 realistic bench mark programs running on 3 different hardware configurations. The results confirm the importance of data layouts for program performance, and show that almost all layouts yield the best performance for some programs and the worst performance for others.
Low Power Pipelined TCAM Employing Mismatch Dependent Power Allocation Technique
Authors: K. R. Viveka, Abhilasha Kawle, Bharadwaj Amrutur
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

This paper presents design of a Low power 256x72 bit TCAM in 0.13um CMOS technology. In contrast to conventional Match line (ML) sensing scheme in which equal power is consumed irrespective of match or mismatch, the ML scheme employed in this design allocates less power to match decisions involving a large number of mismatched bits. Typically, the probability of mismatch is high so this scheme results in significant CAM power reduction. We propose to use this technique along with pipelining of search operation in which the MLs are broken into several segments. Since most words fail to match in first segment, the search operation for subsequent segments is discontinued, resulting in further reduction in power consumption. The above architecture provides 70% power reduction while performing search in 3ns.
Reusing Learned Information in SAT-based ATPG
Authors: Gorschwin Fey, Tim Warode, Rolf Drechsler
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

The robustness of engines for ATPG has to be improved to cope with the growing size of circuits. Recently, SAT-based ATPG approaches have been shown to be very robust even on large industrial circuits. Here, we propose techniques to further improve the efficiency by embedding learning techniques in a SATbased ATPG engine. We provide a heuristic to apply incremental SAT when enumerating faults and a technique to apply circuit-based learning where incremental SAT is not applicable. The correctness of circuit-based learning is proven. Experimental results on large benchmarks show the efficiency.
Mathematics Bridge Program
Authors: D. Budny
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

Since 1990 the Department of Freshman Engineering has offered the Mathematics Summer Bridge Program for beginning students whose high school academic backgrounds indicate high learning potential, but also a high probability of having difficulty in completing the Freshmen Engineering mathematics curriculum. The uniqueness of the Purdue Bridge is that it is one week and only covers mathematics. The Bridge was designed to allow the student to discover his/her strengths and weaknesses in mathematics and to determine if he/she is ready for calculus. The concept is that after the bridge the student will be prepared emotionally to attack the first semester. This positive attitude will produce passing grades in her/his first semester mathematics course, a high first semester GPA, and increase the retention rate of the high risk student.
A Theoretical Perspective on Effective Interorganizational Knowledge
Authors: Nongkran Lertpittayapoom, Souren Paul, Peter Mykytyn,  Jr.
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Interorganizational knowledge sharing is critical to knowledge intensive collaborations between organizations. Despite a proliferation of literature on knowledge sharing, most studies focused on such practice within an organization. The question of how to achieve effective interorganizational knowledge sharing remains unanswered. This study intends to answer this research question using the results from a case study of a software implementation project. Collaboration between software vendors and clients in information systems development/implementation projects require considerable amount of knowledge exchange between the partners. Differences in organizational culture, knowledge domain, as well as other critical factors, pose major challenge for inter-organizational knowledge sharing. To be able to observe the impact of these critical factors on interorganizational knowledge sharing, the knowledge sharing processes between organizations should first be thoroughly explored. While effectiveness of knowledge sharing may be viewed from different theoretical disciplines, we draw our analysis based on organizational learning perspective.
An Improved Algorithm Based on Sub-Structures for Creating Virtual Plant
Authors: Wei-long Ding, Wei-tong Zhang, Xiao Zhou
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

L-systems are powerful rule-based languages for modeling fractal objects and their animation in the fields of virtual plant. But the efficiency of this parallel algorithm needs to be improved because many times rewriting will cost much time and waste lot of computer memory. In this article, an improved algorithm based on the idea of sub-structure is proposed to ameliorate L-systems. Those structures with same features that appear frequently during the process of production iteration are defined as different sub-structures. In the following repetitive process, when the same structure appears, the program will directly paste this sub-structure to the designated position instead of calculating again. Through this method, the storage size of the geometrical information can be decreased and the efficiency of modeling virtual plant can be improved.
Better-than-nothing security practices
Authors: Hal Berghel
Venue: Communications of the ACM (2007)

Security for general audiences.
Evaluation of design alternative for a cluster file system
Authors: Murthy Devarakonda, Ajay Mohindra, Jill Simoneaux, William H. Tetzlaff
Venue: Proceedings of the USENIX 1995 Technical Conference Proceedings on USENIX 1995 Technical Conference Proceedings (1995)

Based on implementation experience and measurements, this paper presents an evaluation of design alternatives to a cluster file system. The file system is targeted for IBM cluster systems, Scalable POWERparallel and AIX HACMP/600. We considered a shared disk approach where serialized, multiple instances of a single-system file system directly access file data as disk blocks, and a shared file system approach which is the conventional method of distributing file system function between a client and a server. We conclude that the shared disk approach suffers form the difficulties of metadata serialization, pooor write-sharing performance, and read throughput.
Lapped directional transform: a new transform for spectral image analysis
Authors: D. Kunz
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

We propose a new real-valued lapped transform for 2D-signal and image processing. Lapped transforms are particularly useful in block-based processing, since their intrinsically overlapping basis functions reduce or prevent block artifacts. Our transform is derived from the modulated lapped transform (MLT), which, as a real-valued and separable transform like the discrete cosine transform, does not allow to unambiguously identify oriented structures from modulus spectra. This is in marked contrast to the (complex-valued) discrete Fourier transform (DFT). The new lapped transform is real-valued, and at the same time allows unambiguous detection of spatial orientation. Furthermore, a fast algorithm for this transform exists. As an application example, we investigate the transform's performance in spectral approaches to image restoration and enhancement in comparison to the DFT.