ppxscal/embedding_network huggingface dataset:
Open-domain question: answering
Authors: John Prager
Venue: Foundations and Trends in Information Retrieval (2006)

The top-performing Question-Answering (QA) systems have been of two types: consistent, solid, well-established and multi-faceted systems that do well year after year, and ones that come out of nowhere employing totally innovative approaches and which out-perform almost everybody else. This article examines both types of system in depth. We establish what a "typical" QA-system looks like, and cover the commonly used approaches by the component modules. Understanding this will enable any proficient system developer to build his own QA-system. Fortunately there are many components available for free from their developers to make this a reasonable expectation for a graduate-level project. We also look at particular systems that have performed well and which employ interesting and innovative approaches.
Energy and length in a topological planar quadrilateral
Authors: Sa'ar Hersonsky
Venue: European Journal of Combinatorics (2008)

We provide bounds for the product of the lengths of distinguished shortest paths in a finite network induced by a triangulation of a topological planar quadrilateral.
Fast Buffered Delay Estimation Considering Process Variations
Authors: Tien-Ting Fang, Ting-Chi Wang
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

Advanced process technologies impose more significant challenges especially when manufactured circuits exhibit substantial process variations. Consideration of process variations becomes critical to ensure high parametric timing yield. During the design stage, fast estimation of the achievable buffered delay can navigate more accurate and efficient wire planning and timing analysis in floorplanning or global routing. In this paper, we derive approximated first-order canonical forms for buffered delay estimation which considers the effect of process variations and the presence of buffer blockages. We empirically show that an existing deterministic delay estimation method is over-pessimistic and thus result in unnecessary design rollback. The experimental results also show that our method can estimate buffered delay with 4% average error but achieve up to 149 times speedup when compared to a state-of-the-art statistical buffer insertion method.
Celebrating Peopleware's 20th Anniversary
Authors: Ed Yourdon
Venue: IEEE Software (2007)

The 2007 International Conference on Software Engineering celebrated the 20th anniversary of the publication of Peopleware with a panel session featuring Tom DeMarco and Tim Lister (the book's authors) and Barry Boehm, Fred Brooks, Linda Rising, and Ed Yourdon.
Quantum Authentication Using Orthogonal Product States
Authors: Dexi Zhang, Xiaoyu Li
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

In this paper we provide a quantum authentication protocol. It is based on the nonlocality of the orthogonal product states of a two-particle system. The two parties share a sequence of two-particle systems as the authentication key. To authenticate each other, they only need to create auxiliary particles and exchange them. No one without the authentication key can pass the authentication process. So the protocol is secure. The authentication key is reusable because it doesn't change after the authentication process. The protocol is more practicable because it needn't entangled states and complex operations but product states and measurement which are easier to carry out in practice.
Research on \delta-radius Based Generalization of Corner Classification
Authors: Zhenya Zhang, Hongmei Cheng
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Feed forward neural network based on corner classification (CC neural network, CC) can classify document instantly with cosine similarity as criteria. Usually the number of hidden neuron in a CC network equal to the number of sample documents. That is the prime shortcoming of a CC network because too much hidden neuron in a CC network will decrease its efficiency on classification instantly. TextCC is a CC network for document classification with cosine as similarity as criteria. To reduce the number of hidden neurons in TextCC, GenTextCC, the generalization of TextCC, is presented in this paper. In GenTextCC, \delta- radius for each sample document is introduced and the number of hidden neurons is decreased steeply comparing to the number of TextCC's hid-den neuron. Experimental results show that GenTextCC can classify document faster than TextCC can do while the classification precision of GenTextCC is much near the classification precision of TextCC.
Harvesting Wiki Consensus: Using Wikipedia Entries as Vocabulary for Knowledge Management
Authors: Martin Hepp, Katharina Siorpaes, Daniel Bachlechner
Venue: IEEE Internet Computing (2007)

Vocabularies that provide unique identifiers for conceptual elements of a domain can improve precision and recall in knowledge-management applications. Although creating and maintaining such vocabularies is generally hard, wiki users easily manage to develop comprehensive, informal definitions of terms, each one identified by a URI. Here, the authors show that the URIs of Wikipedia entries are reliable identifiers for conceptual entities. They also demonstrate how Wikipedia entries can be used for annotating Web resources and knowledge assets and give precise estimates of the amount of Wikipedia URIs in terms of the popular Proton ontology's top-level concepts.
A Resource Information Management System for RAM Grid
Authors: Rui Chu, Nong Xiao, Xicheng Lu
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

RAM Grid is a novel grid system to share the distributed memory resources across the wide area network, and provides disk cache for other nodes which are short of memory. The resource information management system, which monitors and manages the resources in grid environment, takes a key role for RAM Grid. Under the special requirements of RAM Grid, we propose a grid resources management system GridEye, the architecture and mechanism are also discussed. In order to improve the performance, a new caching strategy optimized for RAM Grid is proposed. We have verified the effectiveness of the proposed method through analysis and experiments on the implemented prototype system.
Fast Implementation of Dual Clustering Algorithm for Spatial Data Mining
Authors: Jiaogen Zhou, Fuling Bian, Jihong Guan
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

Many applications scenarios require spatial clustering results in which a cluster has not only high proximity in geometrical domain but also high similarity in non-geometrical domain. Such clustering problem is called dual clustering. We proposed a new algorithm for solving such problem. We first implemented density-based sampling on spatial dataset to reduce data size, and then we partitioned the sample to different clusters in such a way that each cluster forms a compact region in geometrical domain while has the similarity in non-geometrical domain. The experimental results show our algorithm is very effective and efficient.
Vibration Soccer: Tactile Rendering of Football Game on Mobiles
Authors: Shafiq ur-Rehman, Li Liu, Haibo Li
Venue: Proceedings of the The 2007 International Conference on Next Generation Mobile Applications, Services and Technologies (2007)

Vibrotactile sensations to sight and sound cues on mobile handsets make content more realistic, fun and operation more intuitive. In this paper, we propose a new method of rendering live football game on mobile phones by vibration, which offers the better and more entertaining user communications and/or interaction by focusing on the vibrotactile functionality of the mobile. The mobile phone is "synchronized" with the ball in the real-time football game. By holding the phone, users will be able to experience dynamic movements of the ball, to know attacking directions and which team is leading the attack. We examine the possible vibrotactile communication using mobile vibration as a medium alone. The user studies are performed on 36-adult subjects and results are discussed. Finally, the potentials of the tactile channel communications are demonstrated.
Strongly typed genetic programming
Authors: David J. Montana
Venue: Evolutionary Computation (1995)

Genetic programming is a powerful method for automatically generating computer programs via the process of natural selection (Koza, 1992). However, in its standard form, there is no way to restrict the programs it generates to those where the functions operate on appropriate data types. In the case when the programs manipulate multiple data types and contain functions designed to operate on particular data types, this can lead to unnecessarily large search times and/or unnecessarily poor generalization performance. Strongly typed genetic programming (STGP) is an enhanced version of genetic programming that enforces data-type constraints and whose use of generic functions and generic data types makes it more powerful than other approaches to type-constraint enforcement. After describing its operation, we illustrate its use on problems in two domains, matrix/vector manipulation and list manipulation, which require its generality. The examples are (1) the multidimensional least-squares regression problem, (2) the multidimensional Kalman filter, (3) the list manipulation function NTH, and (4) the list manipulation function MAPCAR.
A Mobile Learning System Based on Bluetooth
Authors: Yanhui Zhang, Wu Li, Yingzi Fu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

In order to improve learning flexibility and efficiency, and break the constraints of time and space, a mobile learning system based on Bluetooth was proposed and realized in the paper. The mobile learning system used Bluetooth technology as the communication media. To accommodate with the characteristic of portable devices, the system was designed for low power consumption and low learning cost. With the help of the system, a teacher can receive instant feedback from the students and check students' performance at any time. The students can actively participate in the class and answer the teacher's questions in an easier way. The system architecture, security issues, and key techniques on establishing the communication between cell phones and computers using Bluetooth on Java 2 platform were also explained in the paper.
Facilitating cross-cultural learning through collaborative skypecasting
Authors: Anthony Chan, Mark Frydenberg, Mark J. W. Lee
Venue: Proceedings of the 8th ACM SIGITE conference on Information technology education (2007)

The authors were involved in an international project in which first year (freshman) students studying comparable IT courses at two universities, one in the United States and the other in Australia, formed virtual teams and engaged in collaborative learning and content creation via the Internet. Each team was tasked with jointly producing a short "Skypecast" (an audio podcast recorded over Skype), in which team members from each institution participated in conversations on topics related to technology and culture. The students had to overcome issues related to cross-cultural communication, as well as other challenges that arose from working with people whom they were unable to meet face-to-face, across disparate time zones. This paper presents an analysis of the views and experiences of the students from both institutions, elicited through surveys and focus group interviewing. The findings suggest that in addition to developing their technology skills and enhancing their understanding of the course material, the exercise provided the students with exposure to diverse perspectives from their peers on the topics studied. It also fostered the development of generic skills in research, interpersonal communication, and teamwork essential to the 21st Century knowledge worker. In the absence of the need to produce tangible objects of shared activity (Skypecasts) and without the explicit articulation of common goals within each team, the students may not have used the available technology to engage in the processes of collaborative dialog and problem solving that were evident in their reflective self-reports. In addition to its successes, the problems encountered and lessons learned from the experience are discussed, before outlining the authors' future plans. It is hoped that the paper will be of value to other educators wishing to undertake similar efforts, and make a contribution to the development of best practice in the area of Internet-mediated, cross-institutional collaborative learning.
Fast convergence for spectral clustering
Authors: M. Aiello, F. Andreozzi, E. Catanzariti, F. Isgro, M. Santoro
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

Over the last years computer vision researchers have shown great interest for the so called spectral clustering, where the data are clustered analysing the first few eigenvectors (i.e., the ones relative to the first eigenvalues) of a the Laplacian matrix, derived directly from the data-set. Note that for the purpose of data clustering the eigenvectors need not to be determined accurately. When clustering (segmenting) images the dimension of this matrix is large (e.g., an image as small as 100 × 100 results in a 10000×10000 matrix), and standard diagonalisation algorithms such Lanczos, necessary for determining the eigenvectors, do require a certain number of iterations: typically in the order of pn step for n × n matrices, and may take some iterations for getting close to the solutions. Here we report the first attempt using a recent diagonalisation algorithm (named APL) borrowed from the nuclear physics literature, that, among other properties, has the main advantage of obtaining in a small number of iteration steps eigenvectors, that even if not accurate, are good enough for performing a reasonable segmentation. In this sense we talk of fast convergence of spectral clustering. The experimental results obtained support this claim, and open the way to further work exploiting further detail of the algorithm not included in this study.
L-fuzzy numbers and their properties
Authors: Han-Liang Huang, Fu-Gui Shi
Venue: Information Sciences: an International Journal (2008)

In this paper, the notions of L-fuzzy convex sets and L-fuzzy numbers are introduced where L is a completely distributive lattice. The notions of [0,1]-fuzzy convex sets and [0,1]-fuzzy numbers are generalized. Furthermore their properties and characterizations are presented in terms of cut sets of L-fuzzy sets.
Dispensability of Bias for Three-layer Max-min Fuzzy Neural Networks
Authors: Jie Yang, Long Li, Yan Liu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

It is well-known that a conventional feedforward neural network always has bias (threshold) terms, which is necessary for it to solve classification or approximation problems. But for fuzzy neural networks (FNNs), it seems not quite clear yet whether the bias is dispensable or not. Some authors introduce the bias, while the others do not. We consider a three layers max-min FNNs, and prove that the bias indeed can be useless in certain cases specified in this paper.
Example-Based Learning for Face Image Recognition
Authors: Hongzhou Zhang, Yongping Li, Lin Wang, Chengbo Wang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

Appearance-based face recognition was extended into across poses scenarios in this paper. Information related with pose rotation was discarded in traditional multi-view works but was learned from sample face images in present. Face recognition was implemented by reconstructing frontal view features using transformation matrix. Experiments proved that the proposed method was a much effective approach for recognition across poses. Compared with model-based approaches in face recognition, the proposed work is not dependent on heavy computation and has merit of easy implementing in real conditions. Popular feature extractions, least square (LS) and total least square (TLS) solution were compared as well.
Spreadability and vulnerability of distributed parameter systems
Authors: A. Bernoussi
Venue: International Journal of Systems Science (2007)

In this article we focus on the mathematical development of vulnerability concept and vulnerability index and analyze the dependence of the vulnerability concept definition on that of spreadability [A. El Jai and K. Kassara, "Spreadable distributed systems", Mathem. and Comp. model., 20, pp. 47-64, 1994; A. Bernoussi and A. El Jai, "New approach of spreadability", Journal of Mathematical and Computer Modelling 31, pp 93-109, 2000; A. Bernoussi, A. El Jai and A. J. Pritchard, "Spreadability and evolving interfaces", Inter. J. Syst. Sci., 32, pp. 1217-1232, 2001]. It is found that the mathematical approach of the vulnerability concept is rather attractive and can be applied to many engineering problems. To illustrate this, some examples and applications are considered.
Interest estimation based on dynamic bayesian networks for visual attentive presentation agents
Authors: Boris Brandherm, Helmut Prendinger, Mitsuru Ishizuka
Venue: Proceedings of the 9th international conference on Multimodal interfaces (2007)

In this paper, we describe an interface consisting of a virtual showroom where a team of two highly realistic 3D agents presents product items in an entertaining and attractive way. The presentation flow adapts to users' attentiveness, or lack thereof, and may thus provide a more personalized and user-attractive experience of the presentation. In order to infer users' attention and visual interest regarding interface objects, our system analyzes eye movements in real-time. Interest detection algorithms used in previous research determine an object of interest based on the time that eye gaze dwells on that object. However, this kind of algorithm is not well suited for dynamic presentations where the goal is to assess the user's focus of attention regarding a dynamically changing presentation. Here, the current context of the object of attention has to be considered, i.e., whether the visual object is part of (or contributes to) the current presentation content or not. Therefore, we propose a new approach that estimates the interest (or non-interest) of a user by means of dynamic Bayesian networks. Each of a predefined set of visual objects has a dynamic Bayesian network assigned to it, which calculates the current interest of the user in this object. The estimation takes into account (1) each new gaze point, (2) the current context of the object, and (3) preceding estimations of the object itself. Based on these estimations the presentation agents can provide timely and appropriate response.
Special Feature A VLSI Geometry Processor For Graphics
Authors: J. Clark
Venue: Computer (1980)

Emphasizing ease of scaling and sharing of design tools, a new approach to VLSI systems design may deliver inexpensive specialized hardware. 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
Adding learning to the cellular development of neural networks: Evolution and the baldwin effect
Authors: Frédéric Gruau, Darrell Whitley
Venue: Evolutionary Computation (1993)

A grammar tree is used to encode a cellular developmental process that can generate whole families of Boolean neural networks for computing parity and symmetry. The development process resembles biological cell division. A genetic algorithm is used to find a grammar tree that yields both architecture and weights specifying a particular neural network for solving specific Boolean functions. The current study particularly focuses on the addition of learning to the development process and the evolution of grammar trees. Three ways of adding learning to the development process are explored. Two of these exploit the Baldwin effect by changing the fitness landscape without using Lamarckian evolution. The third strategy is Lamarckian in nature. Results for these three modes of combining learning with genetic search are compared against genetic search without learning. Our results suggest that merely using learning to change the fitness landscape can be as effective as Lamarckian strategies at improving search.
The International Technology Alliance in Network and Information Sciences
Authors: Alun Preece, Winston R. Sieck
Venue: IEEE Intelligent Systems (2007)

The International Technology Alliance offers an open research environment in which leading US and UK companies and universities can collaborate. It will also fuse the best aspects of the US Army's Collaborative Technology Alliances and UK Ministry of Defense Defense Technology Centres on an international scale. A key ITA goal is to perform basic research in network-centric coalition decision making across four technical areas, one of which is distributed coalition planning and decision making. Intelligent systems will likely play a big role in this area.
Building an Ecologically valid, Large-scale Diagram to Help Developers Stay Oriented in Their Code
Authors: Mauro Cherubini, Gina Venolia, Rob DeLine
Venue: Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing (2007)

This paper presents the creation, deployment, and evaluation of a large-scale, spatially-stable, paper-based visualization of a software system. The visualization was created for a single team, who were involved systematically in its initial design and subsequent design iterations. The evaluation indicates that the visualization supported the "onboarding" scenario but otherwise failed to realize the research team's expectations. We present several lessons learned, and cautions to future research into largescale, spatially-stable visualizations of software systems.
Study on Immunized Ant Colony Optimization
Authors: Wei Gao
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

Ant Colony Optimization (ACO) is a new natural computation method from mimic the behaviors of ant colony.It is a very good combination optimization method. To extend the ant colony optimization, some continuous Ant Colony Optimizations have been proposed. To improve the searching performance, the principles of evolutionary algorithm and artificial immune algorithm have been combined with the typical continuous Ant Colony Optimization, and one new Immunized Ant Colony Optimization is proposed here. In this new algorithm, the ant individual is transformed by adaptive Cauchi mutation and thickness selection. To verify the new algorithm, the typical functions, such as Schaffer function and "Needle-in-a-haystack" function, are all used. And then, the results of Immunized Ant Colony Optimization are compared with that of continuous Ant Colony Optimization. The results show that, the convergent speed and computing precision of new algorithm are all very good.