ppxscal/embedding_network huggingface dataset:
Circuit analog of a beam and its application to multimodal vibration damping, using piezoelectric transducers: Research Articles
Authors: M. Porfiri, F. dell'Isola, F. M. Frattale Mascioli
Venue: International Journal of Circuit Theory and Applications (2004)

In this paper we solve the synthesis problem of finding a completely passive electric circuit analog to a vibrating beam. The synthesis problem is of interest when one wants to suppress beam mechanical vibrations by using distributed piezoelectric transduction. Indeed, an effective electromechanical energy transduction is guaranteed when the electric circuit (interconnecting the transducers' terminals) is resonant at all mechanical resonance frequencies and is able to mimic all the mechanical modal shapes. The designed electric circuit behaves as an electric controller of mechanical vibrations (i.e. an electric vibration damper) once suitably endowed with a set of resistors. Because of its completely passive nature, it does not require external power units and stands as an economical means of controlling vibrations. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Integration of Digital Rights Management into Learning Content Management System
Authors: Zongkai Yang, Qingtang Liu, Kun Yan, Wanting Deng, Jing Jin
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

With the rapid increase of learning resources, the contradiction between learning content Intelligent Properties and its share and reuse becomes an outstanding event. In order to solve the problem, we probe into a way that is to integrate the DRM technologies and learning technology standards into the development of learning content management system. We also design a novel online management system for broadcasting environments of virtual classroom or courseware on demand based on a Browser/Server framework, which carries out learning content management for reuse, share, interoperation and security. We place particular emphasis on the strategies of integration of digital rights management and flexible commercial model by license services into applications, management, exchange and trade of web-based learning content and try to solve the problem between reuse and protection.
Description of the LINK system used for MUC-5
Authors: Steven L. Lytinen, Robert R. Burridge, Peter M. Hastings, Christian Huyck
Venue: Proceedings of the 5th conference on Message understanding (1993)

Over the past five years, we have developed a natural language processing (NLP) system called LINK. LINK is a unification-based system, in which all syntactic and semantic analysis is performed in a single step. Syntactic and semantic information are both represented in the grammar in a uniform manner, similar to HPSG (Pollard and Sag, 1987).
A cheap and fast way to build useful translation lexicons
Authors: Dan Tufis
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 1 (2002)

The paper presents a statistical approach to automatic building of translation lexicons from parallel corpora. We briefly describe the pre-processing steps, a baseline iterative method, and the actual algorithm. The evaluation for the two algorithms is presented in some detail in terms of precision, recall and processing time. We conclude by briefly presenting some of our applications of the multilingual lexicons extracted by the method described herein.
Incremental parser for Czech
Authors: Pavel Smrž, Vladimír Kadlec
Venue: Proceedings of the 4th international symposium on Information and communication technologies (2005)

The presented paper deals with an efficient implementation of incremental bottom-up chart parser for Czech. We shortly introduce the system based on a metagrammar that generates a context-free backbone supplemented by contextual constraints. The main part of the paper focuses on the way the pruning constraints are evaluated in the incremental parsing mode. The algorithm takes advantage of a special form of feature structures employed in our grammar, namely the limited number of values that can be produced for each type of the constraints. Instead of pruning the original packed share forest, the parser builds a new forest of values resulting from the evaluation. The described method enables efficient parsing even for extremely ambiguous grammars typical for free word order languages.
Supporting communities of practice in applied computer science studies
Authors: Ralf Klamma, Markus Rohde, Volker Wulf
Venue: ACM SIGGROUP Bulletin (2003)

The authors discuss the experience of a longitudinal study of the course "High-tech Entrepreneurship and New Media." The course design is based on socio-cultural theories of learning and considers the role of social capital in entrepreneurial networks. By integrating student teams into the communities of practice of local start-ups, we offer learning opportunities to students, companies, and academia. The student teams are connected to each other and to their supervisors in academia and practice through a community system. Moreover, the course is accompanied by a series of lectures and group discussions. So far, the course has been conducted three times at RWTH Aachen and the University of Siegen.
The Effect of Virtual Channel Organization on the Performance of Interconnection Networks
Authors: Mostafa Rezazad, Hamid Sarbazi-azad
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 14 - Volume 15 (2005)

Most of previous studies have assessed the performance issues for regular buffer and virtual channel organiza-tions and have not considered overall buffer size constraint. In this paper, the performance of mesh-based interconnection networks (mesh, torus and hypercube networks) under different traffic patterns (uniform, hotspot, and matrix-transpose) is studied. We investigate the effect of the number of virtual channels and their buffer lengths, on the performance of these topologies when the total buffer size associated to each physical channel (and thus router buffer size) is fixed. The results show that the optimal number of virtual channels and buffer length highly depends on the traffic pattern assumed.
Home Wireless Networking in a Snap
Authors: Joe Habraken
Venue:  (2005)

These days, nobody really wants to learn everything there is about their hardware and software. And even if you did, who has the time to endlessly tinker and play with it until you figure everything out? You just want a book that will quickly show you how to set up your home wireless network. Home Wireless Networking in a Snap is designed specifically for busy people like you.This book covers the things that aren't already covered in the documentation that came with your equipmentï¾ and the things you can't just figure out on your own.ï¾ It is organized into a series of well-organized, bite-sized, quickly accomplished tasks, that letsï¾ you zero right in on particular tasks you want to accomplish. Thisï¾ hands-on approach to setting-up a secure home wireless network will have your network up and running in no time.
Observations and lessons learned from automated testing
Authors: Stefan Berner, Roland Weber, Rudolf K. Keller
Venue: Proceedings of the 27th international conference on Software engineering (2005)

This report addresses some of our observations made in a dozen of projects in the area of software testing, and more specifically, in automated testing. It documents, analyzes and consolidates what we consider to be of interest to the community. The major findings can be summarized in a number of lessons learned, covering test strategy, testability, daily integration, and best practices.The report starts with a brief description of five sample projects. Then, we discuss our observations and experiences and illustrate them with the sample projects. The report concludes with a synopsis of these experiences and with suggestions for future test automation endeavors.
Secure routing for structured peer-to-peer overlay networks
Authors: Miguel Castro, Peter Druschel, Ayalvadi Ganesh, Antony Rowstron, Dan S. Wallach
Venue: Proceedings of the 5th symposium on Operating systems design and implementationDue to copyright restrictions we are not able to make the PDFs for this conference available for downloading (2002)

Structured peer-to-peer overlay networks provide a substrate for the construction of large-scale, decentralized applications, including distributed storage, group communication, and content distribution. These overlays are highly resilient; they can route messages correctly even when a large fraction of the nodes crash or the network partitions. But current overlays are not secure; even a small fraction of malicious nodes can prevent correct message delivery throughout the overlay. This problem is particularly serious in open peer-to-peer systems, where many diverse, autonomous parties without preexisting trust relationships wish to pool their resources. This paper studies attacks aimed at preventing correct message delivery in structured peer-to-peer overlays and presents defenses to these attacks. We describe and evaluate techniques that allow nodes to join the overlay, to maintain routing state, and to forward messages securely in the presence of malicious nodes.
Center for the study of reading: BBN branch
Authors: Bertram Bruce
Venue: Issue 79 (January 1982) (1982)

The Center for the Study of Reading (CSR) is a joint project of the University of Illinois at Urbana-Champaign and Bolt Beranek and Newman Inc. It was established in 1976 to study the problems of learning to read, with a special emphasis on the difficulties many children have with reading comprehension. The CSR draws together researchers from a variety of disciplines including artificial intelligence, cognitive psychology, linguistics, anthropology, and education.
Superselection Sectors, Pure States, Bose and Fermi Distributions by Completely Positive Quantum-Motions
Authors: Klaus Dietz
Venue: Open Systems Information Dynamics (2005)

The connection of the operators V, building up the Kossakowski-Lindblad generator, with the asymptotic states of the corresponding completely positive quantum-maps is discussed. Maps leading to decoherence are constructed, the importance of zero-modes in the absolute value $${\sqrt{V^{+}V}}$$ of V for the generation of pure states from arbitrary mixed states is illustrated. The universal rôle of equipartite states appears when unitary V are chosen. The `damped oscillator model' is generalized to yield Bose and Fermi distributions as asymptotic states for systems described by a Hamiltonian and other constants of motion. Calculations are performed in .nite dimensional Hilbert spaces.
Efficient testing of groups
Authors: Katalin Friedl, Gábor Ivanyos, Miklos Santha
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit distance for strings. The query complexity of the tester is polylogarithmic in the size of the set. Previous testers used Hamming type distances and had superlinear query complexity. A building block for our construction is a constant query complexity homomorphism tester for functions mapping an given finite group into an arbitrary set equipped with a binary operation.
Grid Environment for Computational Astrophysics Driven by GRAPE-6 with HMCS-G and OmniRPC
Authors: Taisuke Boku, Kenji Onuma, Mitsuhisa Sato, Yoshihiro Nakajima, Daisuke Takahashi
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 4 - Volume 05 (2005)

In computational astrophysics, the effect of gravity is essential even with very heavy computation of O(N^2 ) for N particles. Several special purpose machines have been implemented as gravity engine to handle this problem extremely fast, however there are few sites in the world to operate such systems. We have developed a grid environment to access such a system based on grid-RPC, named HMCS-G. Using HMCS-G, a multi-physical computational astrophysics simulation can be performed with the combination of a PC-cluster and the gravity engine GRAPE-6. In typical size of problems for galaxy formation, however, the computation power of PC-cluster is much weaker than that of GRAPE-6, and we need multiple sets of PC-clusters to share the power of GRAPE-6 on grid environment. We have developed such a system using OmniRPC, a grid-enabled RPC system. In this system, OmniRPC are used both to distribute jobs for parameter search on multiple PC-clusters and to access GRAPE-6 server from these clusters. We performed an actual problem to search several formations of galaxy on this system, and confirmed such a solution is useful for wide variety of computational astrophysics research.
OpenMP-oriented applications for distributed shared memory architectures: Research Articles
Authors: Ami Marowka, Zhenying Liu, Barbara Chapman
Venue: Concurrency and Computation: Practice Experience (2004)

The rapid rise of OpenMP as the preferred parallel programming paradigm for small-to-medium scale parallelism could slow unless OpenMP can show capabilities for becoming the model-of-choice for large scale high-performance parallel computing in the coming decade.The main stumbling block for the adaptation of OpenMP to distributed shared memory (DSM) machines, which are based on architectures like cc-NUMA, stems from the lack of capabilities for data placement among processors and threads for achieving data locality. The absence of such a mechanism causes remote memory accesses and inefficient cache memory use, both of which lead to poor performance.This paper presents a simple software programming approach called copy-inside&ndash;copy-back (CC) that exploits the data privatization mechanism of OpenMP for data placement and replacement. This technique enables one to distribute data manually without taking away control and flexibility from the programmer and is thus an alternative to the automat and implicit approaches. Moreover, the CC approach improves on the OpenMP-SPMD style of programming that makes the development process of an OpenMP application more structured and simpler.The CC technique was tested and analyzed using the NAS Parallel Benchmarks on SGI Origin 2000 multiprocessor machines. This study shows that OpenMP improves performance of coarse-grained parallelism, although a fast copy mechanism is essential. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Privately computing a distributed k-nn classifier
Authors: Murat Kantarcioglu, Chris Clifton
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

The ability of databases to organize and share data often raises privacy concerns. Data warehousing combined with data mining, bringing data from multiple sources under a single authority, increases the risk of privacy violations. Privacy preserving data mining provides a means of addressing this issue, particularly if data mining is done in a way that doesnt disclose information beyond the result. This paper presents a method for privately computing k-nn classification from distributed sources without revealing any information about the sources or their data, other than that revealed by the final classification result.
Decomposition techniques for the minimum toll revenue problem
Venue: Networks (2004)

The objective of the minimum toll revenue &lpar;MINREV&rpar; problem is to find tolls that simultaneously cause users to use the transportation network efficiently and minimize the total toll revenues that must be collected. This article investigates the Dantzig-Wolfe &lpar;DW&rpar; decomposition as an approach for solving the MINREV problem and establishes its relationships with a cutting plane algorithm and other proposed approaches. The article also identifies the variant of DW decomposition most suitable for implementation. Numerical experiments with real transportation networks suggest that DW decomposition is robust and should be used when the problems are too large for standard linear programming software. Although transportation planning is the application emphasized in this article, it should be noted that the MINREV problem also has applications in telecommunication network design and control. &copy; 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 44&lpar;2&rpar;, 142&ndash;150 2004
On a quadrature formula of Gori and Micchelli
Authors: Shijun Yang
Venue: Journal of Computational and Applied Mathematics (2005)

Sparked by Bojanov (J. Comput. Appl. Math. 70 (1996) 349), we provide an alternate approach to quadrature formulas based on the zeros of the Chebyshev polynomial of the first kind for any weight function w introduced and studied in Gori and Micchelli (Math. Comp. 65 (1996) 1567), thereby improving on their observations. Upon expansion of the divided differences, we obtain explicit expressions for the corresponding Cotes coefficients in Gauss-Turán quadrature formulas for I(f: w) := ∫-11f(x)w(x)dx and I (fTn; w) for a Gori-Micchelli weight function. It is also interesting to mention what has been neglected for about 30 years by the literature is that, as a consequence of expansion of the divided differences in the special case when w(x) = 1/√1-x2, the solution of the famous Turán's Problem 26 raised in 1980 was in fact implied by a result of Micchelli and Rivlin (IBM J. Res. Develop. 16 (1972) 372) in 1972. Some concluding comments are made in the final section.
Reasons women pursue a computer science career: perspectives of women from a mid-sized institution
Authors: Jennifer Kahle, Gary Schmidt
Venue: Journal of Computing Sciences in Colleges (2004)

There is not a substantial number of women in the computer science field. Even though computer science offers a great deal of professional opportunity, statistics show women have not been taking advantage of its many benefits. The purpose of this paper is to determine why women are entering the computer science field and to suggest ways to increase enrollment of female computer science majors in a specific category of learning institution. Questionnaires were given out asking open-ended questions about educational background, interest in the computer science field, and encouragement in pursuing a computer science career. The questionnaires were given out to women whom are in various stages of their computer science career. Responses were quantified into no more than four categories. Inferences were made based upon the information gathered from the responses.
A low-power memory hierarchy for a fully programmable baseband processor
Authors: Wolfgang Raab, Hans-Martin Bluethgen, Ulrich Ramacher
Venue: Proceedings of the 3rd workshop on Memory performance issues: in conjunction with the 31st international symposium on computer architecture (2004)

Future terminals for wireless communication not only must support multiple standards but execute several of them concurrently. To meet these requirements, flexibility and ease of programming of integrated circuits for digital baseband processing are increasingly important criteria for the deployment of such devices, while power consumption and area of the devices remain as critical as in the past.The paper presents the architecture of a fully programmable system-on-chip for digital signal processing in the baseband of contemporary and up-coming standards for wireless communication. Particular focus is given to the memory hierarchy of the multi-processor system and the measures to minimize the power it dissipates. The reduction of the power consumption of the entire chip is estimated to amount to 28% compared to a straightforward approach.
Spiral development of software-intensive systems of systems
Authors: Barry Boehm, Winsor Brown, Richard Turner
Venue: Proceedings of the 27th international conference on Software engineering (2005)

No abstract available
Monitoring the news: a TDT demonstration system
Authors: David Frey, Rahul Gupta, Vikas Khandelwal, Victor Lavrenko, Anton Leuski, James Allan
Venue: Proceedings of the first international conference on Human language technology research (2001)

We describe a demonstration system built upon Topic Detection and Tracking (TDT) technology. The demonstration system monitors a stream of news stories, organizes them into clusters that represent topics, presents the clusters to a user, and visually describes the changes that occur in those clusters over time. A user may also mark certain clusters as interesting, so that they can be "tracked" more easily.
Using Service Grammar to Diagnose BGP Configuration Errors
Authors: Xiaohu Qie, Sanjai Narain
Venue: Proceedings of the 17th USENIX conference on System administration (2003)

Often network components work correctly, yet end-to-end services don't. This can happen when configuration parameters of components are set to incorrect values. Configuration is a fundamental operation for logically integrating components to set up end-to-end services.Configuration errors frequently arise because transforming end-to-end service requirements into component configurations is inherently difficult. Such transformations are largely performed in a manual and localized fashion, resulting in high cost of network operations.The Service Grammar technique has been developed to solve the configuration error diagnosis problem and, more generally, to formalize the process of building complex systems via configuration. At its core is a Requirements Language that contains global, high-level constraints upon configuration parameters. These are derived from identifying the notion of "correct configuration" associated with different protocols. These notions are composed to create system-wide requirements on architecture and policies. A Diagnosis Engine checks if constraints in the Requirements Language are true given definite component configurations and recursively checks composite requirements.This paper describes an application of Service Grammar to diagnosing BGP configuration errors. As BGP architecture and policies differ widely from one network to another, it is not possible using previous techniques to check if router configurations implement the intended requirements. Our tools enable administrators to specify system-wide, network-specific requirements and check if they are correctly implemented by component configurations.
Modeling human affective postures: an information theoretic characterization of posture features: Research Articles
Authors: P. Ravindra De Silva, Nadia Bianchi-Berthouze
Venue: Computer Animation and Virtual Worlds (2004)

One of the challenging issues in affective computing is to give a machine the ability to recognize the mood of a person. Efforts in that direction have mainly focused on facial and oral cues. Gestures have been recently considered as well, but with less success. Our aim is to fill this gap by identifying and measuring the saliency of posture features that play a role in affective expression. As a case study, we collected affective gestures from human subjects using a motion capture system. We first described these gestures with spatial features, as suggested in studies on dance. Through standard statistical techniques, we verified that there was a statistically significant correlation between the emotion intended by the acting subjects, and the emotion perceived by the observers. We used Discriminant Analysis to build affective posture predictive models and to measure the saliency of the proposed set of posture features in discriminating between 4 basic emotional states: angry, fear, happy, and sad. An information theoretic characterization of the models shows that the set of features discriminates well between emotions, and also that the models built over-perform the human observers. Copyright &copy; 2004 John Wiley & Sons, Ltd.