ppxscal/embedding_network huggingface dataset:
GTE's Text Interpretation Aid (TIA): MUC-3 test results and analysis
Authors: Charles T. Taylor
Venue: Proceedings of the 3rd conference on Message understanding (1991)

GTE has actively participated in the Third Annual Message Understanding Conference (MUC-3) sponsored by the Naval Ocean System Center (NOSC) for the past 7 months using its natural language processing system, TIA (Text Interpretation Aid)[5]. During this period, TIA system development consisted of two tasks: (1) lexicon tool development, and (2) tailoring TIA to meet the specific needs of the MUC-3 domain, i.e., terrorism in Latin American countries. Lexicon tool development facilitates system (lexicon) adaptation to new domains (terrorism, drug interdiction, third world launchings, etc.) by semi-automating the manual task of entering words/phrases into TIA's lexicons. Tailoring the existing TIA system to parse and extract MUC-3 domain messages, has allowed GTE to participate in the MUC-3 conference tasks.
Architectural design and analysis of learnable self-feedback ratio-memory cellular nonlinear network (SRMCNN) for nanoelectronic systems
Authors: Jui-Lin Lai, Peter Chung-Yu Wu
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2004)

In this paper, a learnable cellular nonlinear network (CNN) with space-variant templates, ratio memory (RM), and modified Hebbian learning algorithm is proposed and analyzed. By integrating both the modified Hebbian learning algorithm with the self-feedback function and a ratio memory into CNN architecture, the resultant ratio-memory (RMCNN) is called the self-feedback RMCNN (SRMCNN) which can serve as the associative memory. It can generate the absolute weights and then transform them into the ratioed A-template weights as the ratio memories for recognizing noisy input patterns. Simulation results have shown that with the stronger feature enhancement effect, the SRMCNN under constant leakage current can store and recognize more patterns than the RMCNN. For 18 × 18 SRMCNN, 93 noisy patterns with a uniform distribution noise level of 0.8 and a variance of normal distribution noise of 0.3 can be learned, stored, and recognized with 100% success rate. The SRMCNN has greater learning and recognition capability when the learned patterns are simpler and the noise is lower. For the learning and recognition of complicated patterns, the allowable pattern number is decreased for a 100% success rate. Simulation results have successfully verified the correct functions and better performance of SRMCNN in the pattern recognition. With high integration capability and excellent pattern association performance, the proposed SRMCNN can be applied to nanoelectronic associative-memory systems for image processing applications.
Competitive routing in multicast communications
Authors: Thomas Boulogne, E. Altman
Venue: Networks (2005)

We consider competitive routing in multicast networks from a noncooperative game theoretical perspective. There are N users sharing a network, and each has to send a quantity of packets to a different set of addressees (each address must receive the same packets). To do this the user has only to send one copy of a packet, the network making the duplications of the packets at appropriate nodes (depending on the chosen trees). The routing choice of a user is how to split its flow between different multicast trees. We present different criteria for optimization of this type of game. We treat two specific networks and establish the uniqueness of the Nash equilibrium in these networks, as well as the uniqueness of link utilization at Nash equilibria for specific cost functions in networks with general topology. We also present a result for convergence to equilibria from an initial nonequilibrium state. &copy; 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 46(1), 22&ndash;35 2005
hp-Interpolation of Nonsmooth Functions and an Application to hp-A posteriori Error Estimation
Authors: J. M. Melenk
Venue: SIAM Journal on Numerical Analysis (2005)

The quasi-interpolation operators of Clément and Scott--Zhang type are generalized to the setting of the hp-FEM (finite element method). New polynomial lifting and inverse estimates are presented. The classical residual based a posteriori error estimator is generalized to the hp-FEM.
University service projects involving multiple users
Authors: Lizeth Roque, Robert Burch
Venue: Journal of Computing Sciences in Colleges (2004)

This poster describes the creation of software to support two service projects that involved the input of multiple users in the development process. The purpose of the first project is to create a prototype student resume bank. The project is created using Microsoft Visual Basic 6.0 and Microsoft Access 2002 on Windows Operating System. Dr. Michael Harris, an associate professor of accounting at Saint Edward's University, will utilize this prototype to convince the school that a resume bank can be used as a job placement tool for students and as way to connect hiring companies to job-seeking students.
Duplexing, resource allocation and inter-cell coordination: design recommendations for next generation wireless systems: Research Articles
Authors: A. Alexiou, D. Avidor, P. Bosch, S. Das, P. Gupta, B. Hochwald, T. E. Klein, J. Ling, A. Lozano, T. L. Marzetta, S. Mukherjee, S. Mullender, C. B. Papadias, R. A. Valenzuela, H. Viswanathan
Venue: Wireless Communications Mobile Computing (2005)

Coexistence of different access technologies, hierarchical cellular deployment, a wide variety of data services, requirements for transparent operation across different technologies, adaptivity to varying network conditions and mobility and quality of service (QoS) constraints introduce a number of challenges in the design of future generation systems and the specification of new air interfaces, such as efficiency and flexibility in the utilization of spectrum, dynamic resource allocation and exploitation of the multiuser diversity and reconfigurable interference management and inter-cell coordination. In this paper, three critical issues for the design of next generation systems are addressed: (i) duplexing, (ii) scheduling and resource allocation and (iii) interference and inter-cell coordination. A number of research directions are presented, which constitute promising potential candidates for next generation systems specification. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Kinematic Variables Estimation using Eye-in-Hand Robot Camera System
Authors: Siddharth Verma, Inna Sharf, Gregory Dudek
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

Vision-based motion variable estimation has been an area of intensive interest, especially for emerging applications in space robotics such as satellite maintenance, refueling and the removal of space debris. For each of these tasks, accurate kinematic motion estimates of an object are required before a robot can approach or interact with the object. In this paper, a technique is presented for autonomous identification of an object against a cluttered background and simultaneous estimation of kinematic variables of the object undergoing general 3D motion using an eye-in-hand robot camera system. The object and marker identification strategy has been partially validated by using a spherical balloon with circular markers and a stationary camera. While the validation of the kinematic variables estimation algorithm has been completed against simulated data.
Multi-channel-based dissemination of e-learning systems: a reference process model for the design of applications, technologies, methods, and organisations
Authors: Jan vom Brocke
Venue: Proceedings of the 4th international symposium on Information and communication technologies (2005)

New technologies offer promising opportunities for the improvement of world-wide learning processes. However, the appropriate dissemination of both e-learning technologies and applications has not taken place yet. Academic research has brought up innovative approaches that are partly implemented in some leading countries. Yet, these approaches fail to be used in practice world-wide. With this paper, I take an information-systems perspective on this problem. Against the setting of a comprehensive framework for the design of e-learning applications, special requirements for dissemination processes are being analysed. Then a multi-channel-based approach for the design of e-learning systems will be presented that highly supports the dissemination of e-learning applications. On the basis of a process model for the multi-channel-based dissemination of e-learning systems is derived. The model shows major tasks for the dissemination with respect to applications, technology, methods, and organisations.
Marcinkiewicz multiplier theorem and the Sunouchi operator for Ciesielski-Fourier series
Authors: Ferenc Weisz
Venue: Journal of Approximation Theory (2005)

Some classical results due to Marcinkiewicz, Littlewood and Paley are proved for the Ciesielski-Fourier series. The Marcinkiewicz multiplier theorem is obtained for Lp spaces and extended to Hardy spaces. The boundedness of the Sunouchi operator on Lp and Hardy spaces is also investigated.
RC-BLAST: Towards a Portable, Cost-Effective Open Source Hardware Implementation
Authors: Krishna Muriki, Keith D. Underwood, Ron Sass
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 7 - Volume 08 (2005)

Basic Local Alignment Search Tool (BLAST) is a standard computer application that molecular biologists use to search for sequence similarity in genomic databases. This report describes the implementation of an FPGAbased hardware implementation designed to accelerate the BLAST algorithm. FPGA-based custom computing machines, more widely known as Reconfigurable Computing, are supported by a number of vendors and the basic cost of FPGA hardware is dramatically decreasing. Hence, the main objective of this project is to explore the feasibility of using this new technology to realize a portable, Open Source FPGA-based accelerator for the BLAST Algorithm. The present design is targeted to an AceIIcard and the design is based on the latest version of BLAST available from NCBI. Since the entire application does not fit in hardware, a profile study was conducted that identifies the computationally intensive part of BLAST. An FPGA hardware component has been designed and implemented for this critical segment. The portability and cost-effectiveness of the design are discussed.
Incremental dependency parsing based on headed context-free grammar
Authors: Yoshihide Kato, Shigeki Matsubara, Katsuhiko Toyama, Yasuyoshi Inagaki
Venue: Systems and Computers in Japan (2005)

This paper proposes the incremental dependency parsing method based on the context-free grammar with dependency information. In the proposed method, the reachability, which represents the relation between categories, is used. In parallel to the inputting of sentence, the dependency, which is the relation between the modifying word and the modified word, is computed. In the proposed method, the parse tree to cover the inputted fragment of the sentence is not needed. Consequently, the method can compute the dependency more efficiently than the method that computes the dependency from the parse tree. As a result of a parsing experiment using ATIS corpus, the proposed method utilizing the reachability is demonstrated to be effective in reducing the parsing time. &copy; 2005 Wiley Periodicals, Inc. Syst Comp Jpn, 36(2): 63&ndash;77, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10524
Grid-Enabling the Global Geodynamics Project: The Introduction of an XML-Based Data Model
Authors: L. Ian Lumb, Keith D. Aldridge
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

The Global Geodynamics Project (GGP) provides a reasonable representation of the scientific collaboration evident in small-to-medium-scale initiatives. GGP also provides data management challenges that are different from those typically expressed by other areas of the physical sciences - e.g., High Energy Physics. These distinctions make GGP an interesting candidate for assessing the challenges and opportunities associated with technically enabling collaborative science via Grid Computing. Emphasis is placed here on the introduction of an XML-based data model into the GGP. Although it is concluded that Earth Sciences Markup Language (ESML) is highly effective and efficient in introducing a new data model, and paves the way for structural transformations on data, challenges and opportunities are also identified. Metadata (data about data) provides the gravest concern and therefore the most-important focus for further research.
Improving branch prediction accuracy with parallel conservative correctors
Authors: Chunrong Lai, Shih-Lien Lu, Yurong Chen, Trista Chen
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

In this paper we discuss how a confidence mechanism is integrated into the branch prediction correctors to improve the accuracy of a primary predictor in the prediction process. A corrector reverses the decision of the primary predictor when it is confident that the primary predictor may be wrong. Using correctors to improve prediction accuracy is efficient because correctors only need to remember the information on branches that the primary predictor has problems with. Each corrector maintains its own "confidence" value. In our proposed design, these confidence values are judged conservatively so that a corrector will only reverse the predicted direction of the primary predictor when it is confident about the reversal. Moreover, to further increase the accuracy of the prediction, we use multiple correctors working together, each having a particular "expertise". In this paper we present three correctors: the interval corrector, the bimodal corrector, and the two-level corrector. Simulation experiments on a common evaluation framework show that correctors with an additional 2 KB (i.e., 8 KB totally) of storage can reduce mis-predicted branches by 18% over a primary predictor that has only 6 KB of storage. The total prediction accuracy of this 8 KB predictor is 28.4% better than a Gshare predictor with the same size. We also discuss some design issues such as the critical path and show how correctors can be easily implemented into these designs
Review of "The Elements of C++ Style by Trevor Misfeldt, Gregory Bumgardner, and Andrew Gray"; Cambridge University Press: Cambridge, &copy;2004, 0-521-89308-9
Authors: Haoyang Che
Venue: ACM SIGSOFT Software Engineering Notes (2005)

When we first write an article, generally speaking, we may not pay a lot of attention to the style. However, after a few more pieces, we will gradually find that these articles need polishing not only in the contents, but also in the styles, so we turn to Struck and White's The Elements of Style for help. Similarly, in the field of computer languages, there have many books (The Elements of Java Style, The Elements of C++ Style, The Elements of UML Style) furnishing a set of rules for writing in a certain language like C++ or Java. To some extent, conforming to style is a symbol of specialty. Consistent style facilitates communication and will be honored by other members in the same team.
Parallel linear congruential generators with Sophie-Germain moduli
Authors: Michael Mascagni, Hongmei Chi
Venue: Parallel Computing (2004)

Monte Carlo simulations are thought to be very easy to parallelize; however, the quality of these parallel Monte Carlo computations depends greatly on the quality of the parallel random number generators used. Linear congruential generators (LCGs), the most common number-theoretic pseudorandom number generators, with both power-of-two and prime moduli are used in many popular implementations of pseudorandom number generators. Recently, one of the authors of this paper [M. Mascagni, Parallel linear congruential generators with prime moduli, Parallel Comput. 24 (1998) 923-936] developed an explicit parameterization of prime modulus LCGs for use in parallel computations. This approach was based on an explicit enumeration of all the primitive roots modulo the prime modulus for use as unique multipliers in each parallel LCG. In that paper, only Mersenne prime moduli were considered because of the existence of a fast modular multiplication algorithm for primes close to powers-of-two. In the current paper, we investigate the nature of the trade-off implicitly made in the choice of Mersenne primes by comparing them to parameterized Sophie-Germain prime modulus LCGs. While the choice of Mersenne primes trades off initialization time for generation time, the choice of Sophie-Germain primes not only largely reduces initialization time but also provides competitive generation time when an appropriately chosen Sophie-Germain primes are used. The resulting Sophie-Germain prime modulus LCGs have been tested, and incorporated into the Scalable Parallel Random Number Generators SPRNG library [SPRNG. Scalable parallel random number generators, http://sprng.fsu.edu], a widely used random number generation suite for parallel, distributed, and grid-based Monte Carlo computations [M. Mascagni, A. Srinivasan, Computational infrastructure for parallel, distributed, and grid-based Monte Carlo computations, Lect. Notes Comput. Sci. 2907 (2004) 39-52].
Infusing active learning into introductory programming courses
Authors: Keith J. Whittington
Venue: Journal of Computing Sciences in Colleges (2004)

Since ancient times, it has been known that the best learning takes place when the students are actively involved in the learning process and are critically thinking. As an old Chinese proverb states:"I hear and I forget. I see and I remember. I do and I understand".This paper discusses several specific active learning activities that were applied to introductory programming courses. An active and highly interactive classroom was created using these activities. Several of the problems with active learning cited in the literature were also overcome. The effectiveness of these activities was supported by increased student retention, grades, self-confidence, and student surveys.
The role of the author in topical blogs
Authors: Scott Carter
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Web logs, or blogs, challenge the notion of authorship. Seemingly, rather than a model in which the author's writings are themselves a contribution, the blog author weaves a tapestry of links, quotations, and references amongst generated content. In this paper, I present a study of the role of the author plays in the construction of topical blogs, in particular focusing on how blog authors make decisions about what to post and how they judge the quality of posts. To this end, I analyzed the blogs and blogging habits of eight participants using a quantitative analysis tool that I developed, a diary study, and interviews with each participant. Results suggest that authors of topical blogs often do not create new content but strive to, often follow journalistic conventions, use the content of their blogs as a reference tool for other work practices, and are connected as a community by a set of source documents. Results also show that Instant Messaging is useful as an interview medium when questions center around online content.
Global eponential stability of cellular neural networks with time-varying coefficients and delays
Authors: Haijun Jiang, Zhidong Teng
Venue: Neural Networks (2004)

In this paper, a class of cellular neural networks with time-varying coefficients and delays is considered. By constructing a suitable Liapunov functional and utilizing the technique of matrix analysis, some new sufficient conditions on the global exponential stability of solutions are obtained. The results obtained in this paper improve and extend some of the previous results.
Towards a standard for pointing device evaluation, perspectives on 27 years of Fitts' law research in HCI
Authors: R. William Soukoreff, I. Scott MacKenzie
Venue: International Journal of Human-Computer Studies (2004)

This paper makes seven recommendations to HCI researchers wishing to construct Fitts' law models for either movement time prediction, or for the comparison of conditions in an experiment. These seven recommendations support (and in some cases supplement) the methods described in the recent ISO 9241-9 standard on the evaluation of pointing devices. In addition to improving the robustness of Fitts' law models, these recommendations (if widely employed) will improve the comparability and consistency of forthcoming publications. Arguments to support these recommendations are presented, as are concise reviews of 24 published Fitts' law models of the mouse, and 9 studies that used the new ISO standard.
PC Upgrading and Troubleshooting QuickSteps, 1 edition
Authors: Kirk Steers
Venue:  (2005)

This low-priced, fast reference uses color screenshots and brief instructions show and explain how to fix all kinds of PC problems. Each chapter¿s ¿How to¿ list and color coded tabs make it easy to flip straight to specific tasks, such as routine maintenance, start-up issues, drive, monitor, and peripheral problems, Internet connections, upgrading, and more. Useful tips, reminders, shortcuts, and cautions are displayed in the margins so they don¿t break the flow of the book. Learn instantly from the step-by-step graphics that cover:. . Desktop and laptop PCs. Windows XP. Multimedia and gaming functions. Printers, monitors, CD and DVD drives.
An experimental study on large-scale web categorization
Authors: Tie-Yan LIU, Yiming YANG, Hao WAN, Qian ZHOU, Bin GAO, Hua-Jun ZENG, Zheng CHEN, Wei-Ying MA
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Taxonomies of the Web typically have hundreds of thousands of categories and skewed category distribution over documents. It is not clear whether existing text classification technologies can perform well on and scale up to such large-scale applications. To understand this, we conducted the evaluation of several representative methods (Support Vector Machines, k-Nearest Neighbor and Naive Bayes) with Yahoo! taxonomies. In particular, we evaluated the effectiveness/efficiency tradeoff in classifiers with hierarchical setting compared to conventional (flat) setting, and tested popular threshold tuning strategies for their scalability and accuracy in large-scale classification problems.
Improving text categorization by resolving semantic ambiguity
Authors: Hiroshi Uejima, Takao Miura, Isamu Shioya
Venue: Systems and Computers in Japan (2005)

In this investigation, we propose a new method for text categorization (TC) based on a Bayesian approach with resolution of ambiguity. TC assigns weights to words whose meanings are ambiguous in the sense of synonymy and polysemy. We give weights to articles by examining dictionaries of thesaurus type and use dimensionality reduction to improve the quality of TC. We also utilize WordNet as a lexical reference tool and present some experiments to illustrate the effectiveness of our approach. &copy; 2005 Wiley Periodicals, Inc. Syst Comp Jpn, 36(4): 1&ndash;8, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20191