ppxscal/embedding_network huggingface dataset:
Geometric Optimization of the Evaluation of Finite Element Matrices
Authors: Robert C. Kirby, L. Ridgway Scott
Venue: SIAM Journal on Scientific Computing (2007)

This paper continues earlier work on mathematical techniques for generating optimized algorithms for computing finite element stiffness matrices. These techniques start from representing the stiffness matrix for an affine element as a collection of contractions between reference tensors and an element-dependent geometry tensor. We go beyond the complexity-reducing binary relations explored in [R. C. Kirby, A. Logg, L. R. Scott, and A. R. Terrel, SIAM J. Sci. Comput., 28 (2006), pp. 224-240] to consider geometric relationships between three or more objects. Algorithms based on these relationships often have even fewer operations than those based on complexity-reducing relations.
Fraud/Privacy Protection in Anonymous Auction
Authors: Hassan Kazem, Qadeer Hasan, Rafiqul Zaman Khan
Venue: Proceedings of the Second International Conference on Internet Monitoring and Protection (2007)

Most of current technologies that enable secure information sharing assume that entities that share information are mutually trustworthy. However, in recent applications this assumption is not realistic. As applications become sophisticated, information systems are required to share information securely even among untrustworthy entities. The problem is to keep the entities' credit card information confidential while ensuring fraud protection. This paper discusses one kind of problem about information sharing among untrustworthy entities, i.e. fraud protection in anonymous auctions.
Fuzzy System for DOA Estimation in Mobile Communications using a FPGA
Authors: Alberto Rochin Garcia, Alejandro Diaz Mendez, Jose Luis Vazquez Gonzalez
Venue: Proceedings of the 17th International Conference on Electronics, Communications and Computers (2007)

In this work, a fuzzy logic system for improve the resolution in the estimation of the direction of arrival (DOA) in mobile communications, implemented on FPGA is proposed. The DOA estimation is based on a linear sensor array and a low resolution algorithm known as periodogram. The application is focused on mobile scenarios when two sources interfere between them in a spatial way over the sensor array. In order to gain robustness, system is trained based on the ANFIS architecture and a set of training data obtained from a channel model which take into account multipath effects and SNR variations in the signals detected by the sensors.
Protocol Design and Optimization for Delay/Fault-Tolerant Mobile Sensor Networks
Authors: Yu Wang, Hongyi Wu, Feng Lin, Nian-Feng Tzeng
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems (2007)

While extensive studies have been carried out in the past several years for many sensor applications, they cannot be applied to the network with extremely low and intermittent connectivity, dubbed the Delay/Fault-Tolerant Mobile Sensor Network (DFT-MSN). Without end-to-end connections due to sparse network density and sensor node mobility, routing in DFT-MSN becomes localized and ties closely to medium access control, which naturally calls for merging Layer 3 and Layer 2 protocols in order to reduce overhead and improve network efficiency. DFT-MSN is fundamentally an opportunistic network, where the communication links exist only with certain probabilities and become the scarcest resource. At the same time, the sensor nodes in DFT-MSN have very limited battery power like those in other sensor networks. Clearly, there is a tradeoff between link utilization and energy efficiency. To address this tradeoff, we develop a cross-layer data delivery protocol for DFT-MSN, which includes two phases, i.e., the asynchronous phase and the synchronous phase. In the first phase, the sender contacts its neighbors to identify a set of appropriate receivers. Since no central control exists, the communication in the first phase is contention-based. In the second phase, the sender gains channel control and multicasts its data message to the receivers. Furthermore, several optimization issues in these two phases are identified, with solutions provided to reduce the collision probability and to balance between link utilization and energy efficiency. Our results show that the proposed cross-layer data delivery protocol for DFT-MSN achieves a high message delivery ratio with low energy consumption and an acceptable delay.
Reproducing kernel structure and sampling on time-warped Kramer spaces
Authors: S. Azizi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

Given a signal space of functions on the real line, a time-warped signal space consists of all signals that can be formed by composition of signals in the original space with an invertible real-valued function. Clark's (1985) theorem shows that signals formed by warping bandlimited signals admit formulae for reconstruction from samples. This paper considers time warping of more general signal spaces in which Kramer's (1959) generalized sampling theorem applies and observes that such spaces admit sampling and reconstruction formulae. This observation motivates the question of whether Kramer's theorem applies directly to the warped space, which is answered affirmatively by introduction of a suitable reproducing kernel Hilbert space structure. This result generalizes one of Zeevi (1993), who pointed out that Clark's theorem is a consequence of Kramer's.
The role of industry in forming a distance learning engineering management program
Authors: E. R. Ladd
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

The Engineering Management Program (EMP) at Washington State University (WSU) is a state-wide program currently serving industries at WSU branch campuses in Tri-Cities, Vancouver and Spokane, and in-house industry at The Boeing Company, Seattle. There is a constant demand to expand the program to other locations, such as local-area industries in other cities as well as direct industry sponsorship, with the major limitation being resources (faculty, classrooms and communications). The program is delivered via live, closed-circuit, two-way interactive television. The students are working engineers with an average age of 35 and 10 years' experience. With the advent of virtual technologies, the EMP is moving more toward a 'virtual education' program. The EMP is thus formed to serve a variety of industries in a setting of branch campuses and private industry sponsorship. This admixture brings together a special set of forces on the program to form a leading-edge engineering management program. These forces create a critical industry role informing the EMP within a distance learning environment. This paper addresses the advantages, pitfalls and ramifications of such a program.
A Novel Approach to the Design of Scalable Shared-Memory Multiprocessors
Authors: Honda Shing, Lionel M. Ni
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 01 (1993)

This paper presents the Conflict-Free Mem ory (CFM) architecture for designing scalable sharedmemory multiprocessors. For a single-level CFM archi tecture, the architecture improves multiprocessor perfor mance by eliminating memory and interconnection net work contention and reducing network latency. A hierar chical CFM architecture is introduced in this paper, which presents a new approach in implementing scalable sharedmemory multiprocessors. An invalidation-based write-back cache protocol is proposed for the CFM architecture. This cache coherence protocol preserves the low storage overhead of snoopy cache protocols, while it offers the high scalability of directory-based protocols. Furthermore, with the CFM cache protocol, efficient synchronization operations can be implemented.
Gene Ontology-Based Annotation Analysis and Categorization of Metabolic Pathways
Authors: Ali Cakmak, Mustafa Kirac, Marc R. Reynolds, Zehra M. Ozsoyoglu, Gultekin Ozsoyoglu
Venue: Proceedings of the 19th International Conference on Scientific and Statistical Database Management (2007)

Functional characterizations of pathways provide new opportunities in defining, understanding, and comparing existing biological pathways, and in helping discover new ones in different organisms. In this paper, we present and evaluate computational techniques for categorizing pathways, based upon the Gene Ontology (GO) annotations of enzymes within metabolic pathways. Our approach is to use the notion of functionality templates, GO-functional graphs of pathways. Pathway categorization is then achieved through learning models built on different characteristics of functionality templates. We have experimentally evaluated the accuracy of automated pathway categorization with respect to different learning models and their parameters. Using KEGG metabolic pathways, the pathway categorization tool reaches to 90% and higher accuracy.
Environment-independent continuous speech recognition using neural networks and hidden Markov models
Authors: Dong-Suk Yuk
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

Environment-independent continuous speech recognition is important for the successful development of speech recognizers in real world applications. Linear compensation methods do not work well if the mismatches between training; and testing environments are not linear. In this paper, a neural network compensation technique is explored to mitigate the distortion resulting from additive noise, distant-talking, or telephone channels. The advantage of the neural network compensation method is that retraining of a speech recognizer for each particular application is avoided. Furthermore, since neural networks are trained to transform distorted speech feature vectors to those corresponding to clean speech, it may outperform a retrained speech recognizer trained on distorted speech. Three experiments are conducted to evaluate the capability of the neural network compensation method; recognition of additive noisy speech, distant-talking speech, and telephone speech.
A compiler cost model for speculative parallelization
Authors: Jialin Dou, Marcelo Cintra
Venue: ACM Transactions on Architecture and Code Optimization (TACO) (2007)

Speculative parallelization is a technique that allows code sections that cannot be fully analyzed by the compiler to be aggressively executed in parallel. However, while speculative parallelization can potentially deliver significant speedups, several overheads associated with this technique can limit these speedups in practice. This paper proposes a novel compiler static cost model of speculative multithreaded execution that can be used to predict the resulting performance. This model attempts to predict the expected speedups, or slowdowns, of the candidate speculative sections based on the estimation of the combined runtime effects of various overheads, and taking into account the scheduling restrictions of most speculative execution environments. The model is based on estimating the likely execution duration of threads and considers all the possible permutations of these threads. This model also produces a quantitative estimate of the speedup, which is different from prior heuristics that only qualitatively estimate the benefits of speculative multithreaded execution. In previous work, a limited version of the framework was evaluated on a number of loops from a collection of SPEC benchmarks that suffer mainly from load imbalance and thread dispatch and commit overheads. In this work, an extended framework is also evaluated on loops that may suffer from data-dependence violations. Experimental results show that prediction accuracy is lower when loops with violations are included. Nevertheless, accuracy is still very high for a static model: the framework can identify, on average, 45&percnt; of the loops that cause slowdowns and, on average, 96&percnt; of the loops that lead to speedups; it predicts the speedups or slowdowns with an error of less than 20&percnt; for an average of 28&percnt; of the loops across the benchmarks and with an error of less than 50&percnt; for an average of 80&percnt; of the loops. Overall, the framework often outperforms, by as much as 25&percnt;, a naive approach that attempts to speculatively parallelize all the loops considered, and is able to curb the large slowdowns caused in many cases by this naive approach.
A Linear--time Tissue P System Based Solution for the 3--coloring Problem
Authors: Daniel Díaz-Pernil, Miguel A. Gutiérrez-Naranjo, Mario J. Pérez-Jiménez, Agustín Riscos-Núòez
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

In the literature, several examples of the efficiency of cell-like P systems regarding the solution of NP-complete problems in polynomial time can be found (obviously, trading space for time). Recently, different new models of tissue-like P systems have received important attention from the scientific community. In this paper we present a linear-time solution to an NP-complete problem from graph theory, the 3-coloring problem, and we discuss the suitability of tissue-like P systems as a framework to address the efficient solution to intractable problems.
Parallel implementation of a class of algorithms linking NLMS and block RLS
Authors: M. Moonen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

First a brief review is given of a fully pipelined algorithm for recursive least squares (RLS) estimation, based on so-called 'inverse updating'. Then a specific class of (block) RLS algorithms is considered, which embraces normalized LMS as a special case (with block size equal to one). It is shown that such algorithms may be cast in the 'inverse-updating RLS' framework. This allows one to achieve any degree of pipelining, by performing algorithmic transformations which eliminate critical feedback loops in the original algorithms.
Secure group key establishment revisited
Authors: Jens-Matthias Bohli, Mar&#x00ed;a Isabel Gonz&#x00e1;lez Vasco, Rainer Steinwandt
Venue: International Journal of Information Security (2007)

We examine the popular proof models for group key establishment of Bresson et&#x00a0;al. (LNCS 2248: 290&#x2013;309, 2001; Proceedings of the 8th ACM conference on computer and communications security (CCS-8), 2001) and point out missing security properties addressing malicious protocol participants. We show that established group key establishment schemes from CRYPTO 2003 and ASIACRYPT 2004 do not fully meet these new requirements. Next to giving a formal definition of these extended security properties, we prove a variant of the explored proposal from ASIACRYPT 2004 secure in this stricter sense. Our proof builds on the Computational Diffie Hellman (CDH) assumption and the random oracle model.
A posteriori error estimators for locally conservative methods of nonlinear elliptic problems
Authors: Kwang Y. Kim
Venue: Applied Numerical Mathematics (2007)

In this article we present a unified analysis of some implicit and explicit error estimators for a general class of locally conservative methods applied to nonlinear elliptic problems. The implicit error estimator is computed by solving local Neumann problems, like the Bank-Weiser type, where the Neumann data are provided in a natural way by the locally conservative methods. This can be considered as the equilibrated residual method extended to locally conservative methods which are typically based on discontinuous approximation spaces. We also derive some explicit error estimators of residual type by bounding the implicit error estimator further from above. Our analysis is based on a proper decomposition of the error itself, and seems more direct than other approaches based on the Helmholtz decomposition of the gradient of the error.
Supporting Knowledge Transfer through Decomposable Reasoning Artifacts
Authors: William Pike, Richard May, Alan Turner
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Technology to support knowledge transfer and cooperative inquiry must offer its users the ability to effectively interpret knowledge structures produced by collaborators. Communicating the reasoning processes that underlie a finding is one method for enhancing interpretation, and can result in more effective evaluation and application of shared knowledge. In knowledge management tools, interpretation is aided by creating knowledge artifacts that can expose their provenance to scrutiny and that can be transformed into diverse representations that suit their consumers' perspectives and preferences. We outline the information management needs of inquiring communities characterized by hypothesis generation tasks, and propose a model for communication, based in theories of hermeneutics, semiotics, and abduction, in which knowledge structures can be decomposed into the lower-level reasoning artifacts that produced them. We then present a proof-of-concept implementation for an environment to support the capture and communication of analytic products, with emphasis on the domain of intelligence analysis.
Communication-Centric SoC Debug Using Transactions
Authors: Bart Vermeulen, Kees Goossens, Remco van Steeden, Martijn Bennebroek
Venue: Proceedings of the 12th IEEE European Test Symposium (2007)

The growth in System-on-Chip complexity puts pressure on system verification. Due to limitations in the pre-silicon verification process, errors in hardware and software slip through to the stage when silicon and the complete software stack are first brought together. Finding the remaining errors at this stage is becoming increasing difficult. We propose that debugging should be communication-centric at first and based on transactions. We combine run-time, on-chip abstraction of system data to the transaction level, with system-level debug control over the communication infrastructure. We prove our concepts and architecture with a gate-level implementation that includes a Network-on- Chip, breakpoint monitors, clock and reset control (all programmable through an IEEE 1149.1 TAP), and give a quantification of the associated hardware cost.
A Runtime and Analysis Framework Support for Unit Component Testing in Distributed Systems
Authors: Jun Li, Keith Moore
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This paper presents a test framework to support unit component testing in distributed component-based systems that are built upon component technologies like CORBA, COM/.NET, J2EE/RMI. The framework exploits automatic code instrumentation at the stubs and the skeletons of the calls in order to monitor a global call session. The calls can be cross-thread, cross-process and cross-processor. We further define certain testing-related interfaces for driver components in the component test harness and extend the IDL compiler, such that at runtime, test-related attributes can be automatically embedded in the call session identifier and propagated system-wide. As a result, various support for unit component testing can be enabled, including behavior coordination for stub components, collaborator component determination from historical execution, selective regression testing, and crash site pinpointing.
Java-based instructional materials for introductory logic design courses
Authors: S. Wood
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

Introductory logic design is one of the fundamental topics in the lower division curriculum in computer engineering, computer science, and electrical engineering. Since it provides a basic foundation for a large portion of the undergraduate curriculum in ASIC design, data acquisition and signal processing systems, graphics controllers, and architectures for general purpose computing and communication systems, it is important that students learn the material well. The range of backgrounds and preferred learning styles of today's students can make it difficult to effectively convey these concepts. This paper describes the structure and content of a set of Web-based tutorials to supplement the spectrum of other learning experiences offered by the typical introductory logic design course. It also presents comments on selection and design of Java classes for such tutorials.
On assuring QoS in Ethernet access network
Authors: Robert Janowski, Piotr Krawiec, Wojciech Burakowski
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

This paper deals with the problem of assuring strict QoS guarantees for the end to end connections that originate from Ethernet access network. It shows that despite high link capacities in some cases Ethernet network might be the reason of QoS deterioration. The primary reason is the lack of appropriate QoS differentiation and traffic isolation mechanisms. The shared buffers and priority schedulers available in most of Ethernet switches appear to be not sufficient to guarantee strict QoS. For these cases new solution is proposed which relies on additional traffic control mechanisms available in other network elements. Only additional mechanism supporting typical functionality of Ethernet switch can provide strict QoS guarantees what was verified in simulations studies.
Use of higher level linguistic structure in acoustic modeling for speech recognition
Authors: I. Shafran
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

Current speech recognition systems perform poorly on conversational speech as compared to read speech, largely because of the additional acoustic variability observed in conversational speech. Our hypothesis is that there are systematic effects, related to higher level structures, that are not being captured in the current acoustic models. In this paper we describe a method to extend standard clustering to incorporate such features in estimating acoustic models. We report recognition improvements obtained on the Switchboard task over triphones and pentaphones by the use of word- and syllable-level features. In addition, we report preliminary studies on clustering with prosodic information.
Iterative Algorithms for Nash Equilibrium of an Extended OSNR Game
Authors: Yan Pan, Lacra Pavel
Venue: Proceedings of the Sixth International Conference on Networking (2007)

This paper addresses the problem of optical signal-to-noise ratio (OSNR) optimization problem in optical networks. Based on the extended OSNR Nash game formulation that includes power capacity constraints in [10], the Nash equilibrium (NE) solution is analytically intractable and highly nonlinear. We investigate the properties of the NE solution and based on these, we develop iterative algorithms to compute the NE solution: a parallel update algorithm (PUA) and a relaxed parallel update algorithm (r- PUA). We study their convergence with different conditions, both theoretically and numerically.