ppxscal/embedding_network huggingface dataset:
Improving a Pittsburgh Leant Fuzzy Rule Base using Feature Subset Selection
Authors: Pablo A. D. de Castro, Daniel M. Santoro, Heloisa A. Camargo, Maria C. Nicoletti
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

This paper investigates the problem of feature subset selection as a pre-processing step to a method which learns fuzzy rule bases using genetic algorithm (GA) implementing the Pittsburgh approach. Four feature subset selection methods are investigated in the context of learning fuzzy rule bases. Two of them are filter methods namely, the Relief-E and the C-Focus. The other two are wrapper methods using GA as their search process; one implements the instance-based method 1-NN and the other, the constructive neural network algorithm DistAl. Results of the experiments conducted in three domains are presented and discussed; they show that methods which learn fuzzy rule bases can benefit from feature subset selection methods.
GIPSE: Streamlining the Management of Simulation on the Grid
Authors: J. M. Wozniak, A. Striegel, D. Salyers, J. A. Izaguirre
Venue: Proceedings of the 38th annual Symposium on Simulation (2005)

Although the grid allows the researcher to tap a vast amount of resources, the complexity involved in utilizing this power can make it unwieldy and time-consuming. The Grid Interface for Parameter Sweeps and Exploration (GIPSE) 1 toolset aims to solve this issue by freeing users from script debugging, storage issues, and other minutiae involved in managing simulations on the grid. GIPSE, which interacts seamlessly with existing grid software, abstracts interactions with the grid to present a research-centric view of the process rather than the typical task-centric view. GIPSE offers an alternative interface to the grid that removes the need for application specific wrappers around parameter-driven simulations and provides an interface to build data sets for visualization. In this paper, we discuss how GIPSE bridges a critical gap between existing tools and management of the overarching data result.
An Empirical Study of the Use of Friends in C++ Software
Authors: Michael English, Jim Buckley, Tony Cahill, Kristian Lynch
Venue: Proceedings of the 13th International Workshop on Program Comprehension (2005)

A commonly held belief is that the friend construct in C++ is a violation of encapsulation. However, little empirical analysis of its use has taken place to provide evidence to support this claim. This paper presents a study which assesses the design implications of including friendship in a system. A number of hypotheses are investigated based on previous work in this area by Counsell and Newson. Our initial findings suggest that classes declared as friends are coupling hotspots, that the more friends a class has the more protected and private members it will contain and that friendship is not used to access inherited protected members.
New algorithms for carry propagation
Authors: Johannes Grad, James E. Stine
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

This paper presents the analysis and implementation of different algorithms for carry propagation in binary adders. Besides traditional AND-OR-Invert based adders, NAND-type and NOR-type adders with single-gate delay per bit are studied as well. A unified classification based on work by Ling and Doran is presented. The new techniques are applied to ripple-carry adders, carry-skip adders and conditional-sum adders. Transistor level implementations in static and dynamic CMOS logic, as well as simulation results using a 90nm technology are presented.
Less visible and wireless: two experiments on the effects of microphone type on users' performance and perception
Authors: QianYing Wang, Clifford Nass
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

When devices become less visible and recede to the background, what kinds of influences would they have on users'? This paper presents two experiments (N=48 and N=96) that examine the effects of four different types of microphones (and voice vs. text output) on user's behaviors and attitudes. The microphones differ with respect to their visibility and users' mobility. Participants performed two different tasks: a standard creativity task and a standard disclosure task. Mobility facilitated creativity and disclosure of personal information. Recording reminder discouraged creativity and disclosure. Output modality had no significant effect. Implications for ubiquitous computing and voice user interfaces are discussed.
Graph Embedding: A General Framework for Dimensionality Reduction
Authors: Shuicheng Yan, Dong Xu, Benyu Zhang, Hong-Jiang Zhang
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

In the last decades, a large family of algorithms ¿. supervised or unsupervised; stemming from statistic or geometry theory..have been proposed to provide different solutions to the problem of dimensionality reduction. In this paper, beyond the different motivations of these algorithms, we propose a general framework, graph embedding along with its linearization and kernelization, which in theory reveals the underlying objective shared by most previous algorithms. It presents a unified perspective to understand these algorithms; that is, each algorithm can be considered as the direct graph embedding or its linear/kernel extension of some specific graph characterizing certain statistic or geometry property of a data set. Furthermore, this framework is a general platform to develop new algorithm for dimensionality reduction. To this end, we propose a new supervised algorithm, Marginal Fisher Analysis (MFA), for dimensionality reduction by designing two graphs that characterize the intra-class compactness and inter-class separability, respectively. MFA measures the intra- class compactness with the distance between each data point and its neighboring points of the same class, and measures the inter-class separability with the class margins; thus it overcomes the limitations of traditional Linear Discriminant Analysis algorithm in terms of data distribution assumptions and available projection directions. The toy problem on artificial data and the real face recognition experiments both show the superiority of our proposed MFA in comparison to LDA.
Mathematical models of array dynamics in the vicinity of extended underground structures at the action of moving loadings
Authors: L. A. Alexeyeva, G. K. Kaishybaeva
Venue: Mathematics and Computers in Simulation (2004)

To simulate media dynamics in the vicinities of tunnels of deep dispositions by the dynamic disturbances of different nature, the stationary boundary value problems of elastodynamics in cylindrical domains are considered when their boundaries are subjected to the action of loads running at constant speed. There are three kinds of loads running at subsonic, transonic or supersonic speed. Fundamental solutions and boundary integral equations are constructed for all these cases in terms of distribution theory.
On the quasi-Newton training method for feed-forward neural networks
Authors: Nikolai Stanevski, Dimiter Tsvetkov
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

The quasi-Newton training method is the most effective method for feed-forward neural networks with respect to the training precision. This method is well-known and popularly described in the neural networks literature. Nevertheless its implementation contains some difficulties because of the specific shape of the cost function and the large amount of variables. Here we give in sufficient details an example of a program implementation of the quasi-Newton method. This implementation (as a Borland Delphi application) seems to work well with various examples.
Discriminative Training for Object Recognition Using Image Patches
Authors: Thomas Deselaers, Daniel Keysers, Hermann Ney
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

We present a method for automatically learning discriminative image patches for the recognition of given object classes. The approach applies discriminative training of log-linear models to image patch histograms. We show that it works well on three tasks and performs significantly better than other methods using the same features. For example, the method decides that patches containing an eye are most important for distinguishing face from background images. The recognition performance is very competitive with error rates presented in other publications. In particular, a new best error rate for the Caltech motorbikes data of 1.5% is achieved.
Reason 3 Ignite!
Authors: Catherine Karayanis
Venue:  (2005)

Coverage includes- Eric D. Grebler is an IT professional, author, and certified trainer who has demystified the world of computers for thousands of people. Originally from Ottawa, he currently resides in Toronto, Canada. Grebler has developed curriculum and resource material on a wide range of technical topics, including desktop publishing, graphics, XML, and operating systems. He is also the author of Lindows Fast & Easy (Premier Press, 1-59200-060-6) and Windows XP Media Center Edition Fast & Easy (Premier Press, 1-59200-083-5). Chris Hawkins has been working with computer music production both professionally and personally for 13 years. Hawkins is a graduate of Columbia Academy's Recording Arts program in Vancouver, Canada, and currently resides in Nagoya, Japan. He is the founder/publisher of Streamworks Audio-The Online Magazine for Recording Professionals and Hobbyists (www.streamworksaudio.com) Hawkins was also a member of the Steinberg support team on their online Cubase community forums, helping with end-user support issues. In addition to Streamworks Audio, he is the managing director of SWA Video (www.swavideo.com)-an online video tutorial site for audio/MIDI applications. Hawkins is also the author of Reason 2.5 Ignite! from Thomson Course Technology PTR. He runs a small recording studio that he uses to produce his own material. Perfect for beginners, this book contains easy-to-follow explanations of features that would typically confuse readers. Contains many large screenshots with numbered callouts that explain what is happening in the illustration. The book flows in a manner that acts like building blocks for the readers making sure they know enough before moving on to the next step. Stays directly on topic, explaining how to learn Reason quickly and use it to become more productive immediately. This guide, the second edition of the very successful title "Reason 2.5 Ignite!" (1-59200-147-5), covers the newest version of Reason.
Response to Keith Wayland's observation in the last sentence of his letter to H. K. Hodge
Authors: Vincent Koehler
Venue: ACM SIGSMALL/PC Notes (1990)

This is in response to Keith Wayland's observation in the last sentence of his letter to H. K. Hodge that if N has K non-zero bits in binary form then N! has N-K trailing binary zeros. Here is a proof of that statement, by induction of course. 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
Principle-Based Parsing: Computation and Psycholinguistics Edited by Robert C. Berwick, Steven P. Abney, and Carol Tenny (Kluwer Academic Publishers Boston/Dordrecht/London, 1991)
Venue: ACM SIGART Bulletin (1992)

Principle-based parsing is parsing in which the rules of grammar are not stated explicitly, but rather inferred from more general principles. In practice this means Government and Binding (GB) theory (Chomsky 1982). Readers unfamiliar with GB theory will find it largely demystified by Berwick's introductory article; Sells (1985) gives a good concise overview.
Scaling a Global File System to the Greatest Possible Extent, Performance, Capacity, and Number of Users
Authors: Phil Andrews, Bryan Banister, Patricia Kovatch, Chris Jordan, Roger Haskin
Venue: Proceedings of the 22nd IEEE / 13th NASA Goddard Conference on Mass Storage Systems and Technologies (2005)

We investigate here, both theoretically and by demonstration, scaling file storage to the very widest possible extents. We use IBM's GPFS file system, with extensions developed by the San Diego Supercomputer Center in collaboration with IBM. Geographically, the file system extends across the United States, including Pittsburgh, Illinois, and San Diego, California, with the TeraGrid 40 Gb/s backbone providing the Wide Area Network connectivity. We show the results from two demonstrations, at each of the past two Supercomputing conferences, SC03 in Phoenix, Arizona, and SC04 in Pittsburgh, Pennsylvania. The second demonstration was purposely designed to presage an intended production facility across the National Science Foundation's TeraGrid.
Distributed Blinding for Distributed ElGamal Re-Encryption
Authors: Lidong Zhou, Michael A. Marsh, Fred B. Schneider, Anna Redz
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

A protocol is given to take an ElGamal ciphertext encrypted under the key of one distributed service and produce the corresponding ciphertext encrypted under the key of another distributed service, but without the plaintext ever becoming available. Each distributed service comprises a set of servers and employs threshold cryptography to maintain its service private key. Unlike prior work, the protocol requires no assumptions about execution speeds or message delivery delays. The protocol also imposes fewer constraints on where and when various steps are performed, which can bring improvements in end-to-end performance for some applications (e.g., a trusted publish/subscribe infrastructure.) Two new building blocks employed ¿ a distributed blinding protocol and verifiable dual encryption proofs ¿ could have uses beyond re-encryption protocols.
Pseudo-Surface Based Network Camera Smart Control
Authors: Aiguo He, Zixue Cheng, Tongjun Huang, Yue Zhao
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

Network camera is widely used in a lot of fields, such as remote monitoring, video conference. However, in almost network camera systems, the camera remote control is realized by using a remote controller or a personal computer with a crude user interface. This kind of control methods are not effective in the situation such as real time distance class where a smart operation is needed for the teacher. This article proposes a Pseudo-Surface Based Control method for network camera remote control. This method can improve the operativeness of the network camera control without using special devices other than a control computer. The effectiveness of this method was proven by a simulation system. In this article the principle of this method is described, and several examples of it are introduced.
Is AI planning now?
Authors: Leo Hartman, Louis Hoebel
Venue: ACM SIGART Bulletin (1998)

The current state of domain independent planning allows for a variety of levels of sophistication for describing world behavior and goals or objectives that the planner is to satisfy. Planners have become very efficient at searching the combinatorial spaces implicitly defined by these descriptions. On the results of the AIPS-98 planning competition, Yale University Professor and AIPS Planning Competition Chair, Drew McDermott states, "It is hard to draw any conclusion from these data, except to note that all of these planners performed very well, compared to the state of the art a few years ago. Many of the plans found were 30 or 40 steps long, and some were longer than 100 steps." [1, 10]
Average probability of packet error with diversity reception over arbitrarily correlated fading channels: Research Articles
Authors: Fadel F. Digham, Mohamed-Slim Alouini
Venue: Wireless Communications Mobile Computing (2004)

Closed form expressions for the average probability of packet error (PPE) are presented for no diversity, maximum ratio combining (MRC), selection combining (SC) and switch and stay combining (SSC) diversity schemes. The average PPE for the no diversity case is obtained in two alternative expressions assuming arbitrarily correlated Nakagami and Rician fading channels. For the MRC case, L diversity branches are considered and the channel samples are assumed to follow Nakagami distribution and to be arbitrarily correlated in both time and space. For the SC diversity scheme with L diversity branches, two bounds on the average PPE are derived for both slow and fast fading channels. The average PPE in this case is obtained in an infinite integral form for Nakagami channels while it is reduced to a closed form expression for the Rayleigh case. The average PPE is also derived in the case of SSC diversity with dual branches for both slow and fast Rayleigh fading channels. The new formulas are applicable for all modulation schemes where the conditional probability of error has an exponential dependence on the signal-to-noise ratio. The average PPE is then used to obtain a modified expression for the throughput for network protocols. In general, the diversity gain exhibits a little diminishing effect as the number of diversity branches increases. In addition, the system is found to be more sensitive to the space correlation than to the time correlation. The effects of different system parameters and diversity schemes are studied and discussed. Specific figures about the system performance are also provided. Copyright &copy; 2004 John Wiley & Sons, Ltd.This work was presented in part in the IEEE Vehicular Technology Conference (VTC'02 Fall), Vancouver, B.C., Canada, September 2002 and in part in the IEEE Globecom conference (GLOBECOM'02), Taipei, Taiwan, November 2002.
Epsim
Authors: Matt Brock, Eric Jastram, Robert Parkhurst
Venue: Journal of Computing Sciences in Colleges (2004)

The project "Epsim" involves the development of software for the purposes of simulating the biological process of electrophoresis. This project was developed under the specifications of the TLU Biology Department. Software has been developed to simulate the process of digesting strands of DNA with restriction enzymes and sorting out the resulting DNA fragments by molecular weight in a virtual gel. The algorithms and equations allow for a very quick and accurate representation of gel electrophoresis.
How to incorporate the social and professional issues component of the ACM 2001 computing curriculum into a computer science degree program
Authors: John P. Buerck
Venue: Journal of Computing Sciences in Colleges (2004)

This tutorial will outline and describe two methods for incorporating the social and professional issues component of the ACM 2001 Computing Curriculum into a computer science degree program. The first method is to develop a new stand-alone course traditionally titled "Computing and Society". The second method is to develop modularized mini-lessons and activities that address the social, professional and ethical issues of computing professionals. These mini-lessons and activities can then be incorporated into existing courses required for Computer Science students.
Unisys: description of the Unisys system used for MUC-3
Authors: Carl Weir, Tim Finin, Robin McEntire, Barry Silk
Venue: Proceedings of the 3rd conference on Message understanding (1991)

This paper describes the Unisys MUC-3 text understanding system, a system based upon a three-tiered approach to text processing in which a powerful <u>knowledge-based</u> form of information retrieval plays a central role. This knowledge-based form of information retrieval makes it possible to define an effective level of text analysis that falls somewhere between what is possible with standard keyword-based information retrieval techniques and deep linguistic analysis.
Unit testing and debugging with aspects
Authors: John Stamey, Bryan Saunders
Venue: Journal of Computing Sciences in Colleges (2005)

Aspect-Oriented Programming (AOP) may be used to implement non-invasive debugging for Java Programs whereby target code (code to be debugged) is not altered. This paper illustrates techniques for tracing the execution of loops, methods and constructors using AOP. The use of aspects to implement debugging can also eliminate the need to install and learn new debugging packages for code tracing.
Adaptive Real-Time Update Dissemination in Distributed Virtual Simulation Environments
Authors: Fang Chen, Vana Kalogeraki
Venue: Proceedings of the Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2005)

In this work we propose and evaluate a framework for efficient and real-time dissemination of dynamic data in distributed simulation virtual environments in a scalable fashion. A peer-to-peer overlay is used to create self-organizing groups of participants. Filters that combine application-level knowledge are utilized to control the message propagations and minimize the end-to-end delays. Our approach enables nodes to trade-off processing overhead for consistency precision. Our simulation results illustrate that our techniques meet the consistency requirements of the participants, while minimizing the data transmissions and the message delays.
Proceedings of the 5th conference on Message understanding
Venue: Message Understanding Conference (1993)

This volume documents the proceedings of the Fifth Message Understanding Conference MUC-5), which was held on 25-27 August, 1993, in Baltimore, Maryland. The conference was sponsored by the Advanced Research Projects Agency, Software and Intelligent Systems Technology Office (Thomas Crystal, Program Manager) and was organized by the MUC-5 program committee: Beth Sundheim, chair (NCCOSC/NRaD), Sean Boisen (BBN), Lynn Carlson (DoD), Nancy Chinchor (SAIC), Jim Cowie (CRL/NMSU), Ralph Grishman (NYU), Jerry Hobbs (SRI), Joe McCarthy (UMass), Mary Ellen Okurowski (DoD), Boyan Onyshkevych (DoD), Lisa Rau (GE), and Carl Weir (UNISYS).The topic of the conference was performance assessment of text analysis software systems designed to extract information from free text. Prior to the conference, systems were developed and tested on information extraction performance in the domains of joint business ventures and/or microelectronic chip fabrication in English and/or Japanese. The conference was attended by representatives of organizations that participated in the evaluation, Government representatives, and other invited guests. Sessions included a tutorial on information extraction offered by Ralph Grishman (NYU), introductions to the information extraction evaluation tasks by Boyan Onyshkevych and Mary Ellen Okurowski (DoD), a paper describing a generic" information extraction system by Jerry Hobbs (SRI), papers on systems and test results given by the participating organizations in the evaluation, system demonstrations, presentations on the evaluation design and overviews of the test results by Beth Sundheim NCCOSCINRaD), Nancy Chinchor (SAIC), Mary Ellen Okurowski (DoD), Boyan Onyshkevych DoD), and Craig Will (IDA), workshops on special topics with presentations by some of the evaluation participants, and discussion meetings to critique the evaluation and make recommendations for future evaluations.MUC-5 was closely associated with phase one of the ARPA Tipster Text Program. Some of the papers in this volume appear also in a published report on Tipster. Those papers are identified in this volume at the beginning of the section in which they appear. 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