ppxscal/embedding_network huggingface dataset:
Sentence Similarity Based on Semantic Nets and Corpus Statistics
Authors: Yuhua Li, David McLean, Zuhair A. Bandar, James D. O'Shea, Keeley Crockett
Venue: IEEE Transactions on Knowledge and Data Engineering (2006)

Sentence similarity measures play an increasingly important role in text-related research and applications in areas such as text mining, Web page retrieval, and dialogue systems. Existing methods for computing sentence similarity have been adopted from approaches used for long text documents. These methods process sentences in a very high-dimensional space and are consequently inefficient, require human input, and are not adaptable to some application domains. This paper focuses directly on computing the similarity between very short texts of sentence length. It presents an algorithm that takes account of semantic information and word order information implied in the sentences. The semantic similarity of two sentences is calculated using information from a structured lexical database and from corpus statistics. The use of a lexical database enables our method to model human common sense knowledge and the incorporation of corpus statistics allows our method to be adaptable to different domains. The proposed method can be used in a variety of applications that involve text knowledge representation and discovery. Experiments on two sets of selected sentence pairs demonstrate that the proposed method provides a similarity measure that shows a significant correlation to human intuition.
Multiple Description Image Coding Using Shifted Lattice Vector Quantization
Authors: Huihui Bai, Yao Zhao
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

Multiple description (MD) coding is a promising alternative for robust transmission of information over non-prioritized and unpredictable networks. In this paper, according to the geometrical structure and the spatial relationship of lattice vector quantizers, a technique called shifted lattice vector quantization (SLVQ) is employed in MD image coding to generate descriptions for unbalanced or balanced channels. Experimental results validate the effectiveness of the proposed technique with better performance than the popular MD lattice vector quantization proposed by Servetto, Vaishampayan and Sloane (known as SVS technique). Especially the presented technique can effectively alleviate the gap between the central and side distortions in SVS technique.
Kernels as features: On kernels, margins, and low-dimensional mappings
Authors: Maria-Florina Balcan, Avrim Blum, Santosh Vempala
Venue: Machine Learning (2006)

Kernel functions are typically viewed as providing an implicit mapping of points into a high-dimensional space, with the ability to gain much of the power of that space without incurring a high cost if the result is linearly-separable by a large margin ¿. However, the Johnson-Lindenstrauss lemma suggests that in the presence of a large margin, a kernel function can also be viewed as a mapping to a low-dimensional space, one of dimension only $$\tilde{O}(1/\gamma^2)$$ . In this paper, we explore the question of whether one can efficiently produce such low-dimensional mappings, using only black-box access to a kernel function. That is, given just a program that computes K(x,y) on inputs x,y of our choosing, can we efficiently construct an explicit (small) set of features that effectively capture the power of the implicit high-dimensional space? We answer this question in the affirmative if our method is also allowed black-box access to the underlying data distribution (i.e., unlabeled examples). We also give a lower bound, showing that if we do not have access to the distribution, then this is not possible for an arbitrary black-box kernel function; we leave as an open problem, however, whether this can be done for standard kernel functions such as the polynomial kernel. Our positive result can be viewed as saying that designing a good kernel function is much like designing a good feature space. Given a kernel, by running it in a black-box manner on random unlabeled examples, we can efficiently generate an explicit set of $$\tilde{O}(1/\gamma^2)$$ features, such that if the data was linearly separable with margin ¿ under the kernel, then it is approximately separable in this new feature space.
Intelligent Web Mining Model to Enhance Knowledge Discovery on the Web
Authors: Sunil Kr. Pandey, R. B. Mishra
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

The large size and the dynamic nature of the Web highlight the need for continuous support and updating of Web based information retrieval systems. Crawlers facilitate the process by following the hyperlinks in Web pages to automatically download a partial snapshot of the Web. This paper describes some details about the architecture of a fully implemented a Multi- Agent Web Search System I-Spider for the Internet. Its architecture is based on autonomous software agents and the paper is focused on the communication among them. The overall system architecture is based on a multi-agent paradigm. Agents collaborate together HTML pages from the World Wide Web and treat them in order to be able to retrieve those pages from subsequent users' queries. Crawling Agent collaboration is required in order to decide the URLs that should be first retrieved. Subsequent page treatment consists on first filtering the pages so that HTML format is transformed into XML and second indexing them so that information retrieval can be performed online.
Localized algorithm for aggregate fairness in wireless sensor networks
Authors: Shigang Chen, Zhan Zhang
Venue: Proceedings of the 12th annual international conference on Mobile computing and networking (2006)

For data-collection applications in sensor networks, it is important to ensure all data sources have equal (or weighted) access to network bandwidth so that the base stations receive a complete picture about the monitored area. We point out the fairness problem in the current design of sensor networks, which may cause extremely biased bandwidth allocations. It is a challenge to design a fully distributed fairness solution due to the lack of global knowledge about the distribution of data sources and their routing paths. This paper proposes a new aggregate fairness model and a localized algorithm (called AFA) that implements the model. AFA is designed to work with any routing protocol. In particular, it allows the packets from a data source to follow an arbitrary set of forwarding paths to the base stations. This flexibility makes it considerably harder to allocate bandwidth fairly among different data sources. AFA solves the problem with only localized operations at the sensors. It is easy to implement, which is an attractive property for sensor networks. Moreover, the algorithm automatically adjusts a sensor's forwarding rate to avoid packet drops due to downstream congestion, which helps improve energy efficiency. We perform extensive simulations, demonstrating that the proposed algorithm can effectively improve end-to-end fairness.
From Information to Knowledge: The Continuous Need to Teach AI
Authors: Antonio Sanchez, Pablo Noriega
Venue: Proceedings of the Fifth Mexican International Conference on Artificial Intelligence (2006)

The paper discusses the importance of teaching Artificial Intelligence as part of a computer science curriculum. The BRETAM model is used to study the advancement from computer systems to computing systems and it is further used to analyze the historical development of AI, as well as to put in perspective the contributions of AI to computing. Finally the paper discusses what may constitute an appealing and influential AI undergraduate course.
Proceedings of the 7th international conference on Learning sciences
Venue: International Conference on Learning Sciences (2006)

Learning sciences research explores the nature and conditions of learning as it occurs in educational environments, broadly construed. The learning sciences field draws upon multiple theoretical perspectives and research paradigms in order to understand and improve human learning, cognition, and development. Over the last two decades the learning sciences community has developed powerful technological tools, curricular interventions, theories, and methods for understanding and improving teaching and learning as it unfolds in naturalistic contexts. Learning sciences takes an interdisciplinary approach to the study of learning, cognition, and development in real-world contexts. Learning scientists believe that any investigation of teaching and learning must consider context, cognition, and learning architecture, which we treat as inextricably intertwined. All who are interested in the study of learning in context and the design of learning environments should find the work in these Proceedings to be of interest. While learning scientists can present rich accounts of learning in complex contexts, convincing policy makers, teachers, and other researchers of the theoretical and practical value of our work; it is not a straightforward process. We must show impact at the local level, while at the same time working to advance claims that have more general value. In other words, we must make clear that the learning sciences make a difference. Toward this end, the Seventh International Conference of the Learning Sciences (ICLS 2006) is explicitly focused on the theme "Making a Difference." Much of the work in these Proceedings demonstrates how our work is making a difference: to students, teachers, schools, and policy makers; to research approaches and methods; to theories and models of learning, instruction, and assessment. Each proposal in these Proceedings was blind reviewed by three independent reviewers to ensure high quality work. We hope that others will find the lessons shared in these pages relevant to their work.
Left-to-right Generalized Non-adjacent Form Recoding for Elliptic Curve Cryptosystems
Authors: Fanyu Kong, Jia Yu, Zhun Cai, Daxing Li
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

Various signed digit representations have been used to speed up point multiplication in elliptic curve cryptosystems. In this paper, we present an analysis of the left-to-right radix-r (r.2) generalized non-adjacent form (GNAF) recoding algorithm. A probability model is established to analyze the on-line efficiency of the algorithm. It is proved that the average number of scanned digits required for obtaining one GNAF recoding digit.
Comments on "A Separable Low Complexity 2D HMM with Application to Face Recognition'
Authors: Lu Yu, Lenan Wu
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

The separable low complexity 2D HMM proposed in [1] builds on the assumption of conditional independence in the relationship between adjacent blocks. The authors view this assumption as the key assumption to reduce the complexity. In this communication, we show that this key assumption is entirely unnecessary.
An efficient screening methodology for a priori assessed non-influential factors
Authors: Thomas M. Cioppa
Venue: Proceedings of the 36th conference on Winter simulation (2004)

The choice of which factors to choose to vary in a simulation to effect a change in the measure of interest is difficult. Many factors are a priori judged not to effect the measure of interest. There is often no subsequent analysis of whether this judgment is valid or not. The proposed methodology outlines a sequence of limited runs to assess the accuracy of the a priori belief of non-influential factors. These runs can either identify if an influential factor(s) has been omitted or confirm a priori beliefs. Executing these sequences of runs before focusing on the suspected influential factors can contribute to subsequent analysis by confirming that suspected non-influential factors do not significantly impact the measure of interest. An example of the methodology using an agent based model is presented.
Hierarchical handoff schemes over wireless LAN/WAN networks for multimedia applications
Authors: S. I. Ali, H. Radha
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

The objective of this paper is to study the performance of handoff procedures for an integrated wireless LAN/WAN infrastructure, both qualitatively and quantitatively. We make use of a proposed hierarchical mobility management scheme to evaluate the performance of a handoff procedure with a hierarchy level of one. Also, we propose a design and perform the analysis for a two-level hierarchy architecture that is applicable for integrated 802.11-based WLAN/WAN scenarios. The focus of our analysis is on performance measures that are suitable for real-time multimedia applications. In particular, we observe and analyze the improvement in handoff latencies and packet loss ratios that are obtained by employing hierarchical mobility schemes for UDP based traffic sessions under different network scenarios. We also study the scalability of the proposed schemes by evaluating the impact of the number of mobile nodes on the above performance measures.
Host mobility using an internet indirection infrastructure
Authors: Shelley Zhuang, Kevin Lai, Ion Stoica, Randy Katz, Scott Shenker
Venue: Wireless Networks (2005)

We propose the Robust Overlay Architecture for Mobility (ROAM) to provide seamless mobility for Internet hosts. ROAM is built on top of the Internet Indirection Infrastructure (i3). With i3, instead of explicitly sending a packet to a destination, each packet is associated with an identifier. This identifier defines an indirection point in i3, and is used by the receiver to obtain the packet.ROAM takes advantage of end-host ability to control the placement of indirection points in i3 to provide efficient routing, fast handoff, and preserve location privacy for mobile hosts. In addition, ROAM allows end hosts to move simultaneously, and is as robust as the underlying IP network to node failure. We have developed a user-level prototype system on Linux that provides transparent mobility without modifying applications or the TCP/IP protocol stack. Simulation results show that ROAM's latency can be as low as 0.25--40% of Mobile IP. Experimental results show that with soft handoff the TCP throughput decreases only by 6% when there are as many as 0.25 handoffs per second.
Using simulation to improve the patient pre-admission testing design process
Authors: Susan O'Hara, Dave Krahl, Mark Sullivan
Venue: Proceedings of the 36th conference on Winter simulation (2004)

In this case study, we demonstrate how simulation modeling affects more than healthcare design; it is a tool of hospital-wide system process change with a focus on improving patient satisfaction through a better clinical process. Some of the improvements, based on existing systems, include decreased delays, better healthcare staff utilization and tailored scheduling. In this part 2 of 2 perioperative case studies(part 1: Ambulatory Surgery Unit), we maximized and combined the experiences of three distinct, yet complimentary professions: nursing/healthcare planning, architecture, and simulation engineering to create a better way to provide a clinical service in a newly designed healthcare space.
Networking with small computers: applications for home delivery of library services
Authors: Thomas D. Harnish
Venue: ACM SIGSMALL Newsletter (1979)

Converging forces are shaping a new environment for libraries and as a consequence the present is full of opportunity. Within this new environment, one scenario ---a scenario which suggests a framework for the information industry in the 1980's---calls for establishment of libraries as <u>the</u> information source of choice. 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
Hamming hypermeshes: high performance interconnection networks for pin-out limited systems
Authors: Fernando Rodríguez-Salazar, John R. Barker
Venue: Performance Evaluation (2006)

Hypermeshes are promising candidates for the construction of high performance interconnection networks. Their main advantage is that they present a low diameter, high bandwidth, low latency network, which can naturally embed a wide range of communication patterns. Since a VLSI implementation of such a system is still far-off, we argue that any implementation is pin-out, rather than wire density limited. We will study the networks under this assumption. In this paper we introduce the Hamming hypermesh, which has a lower pin-out, in an attempt to enhance the performance of the network. It is shown both by theoretical work and simulations that this implementation outperforms previously proposed hypermeshes under the constant pin-out argument. Furthermore Hamming hypermeshes have the additional benefit of providing higher bandwidth channels and simpler switching structures. Since it has been shown that complete hypermeshes outperform the mesh, the torus, low dimensional k-ary n-cubes (with and without bypass channels), and multi-stage interconnection networks under the constant pin-out argument, it follows that incomplete hypermeshes outperform them as well.
A dual complex pole-zero cancellation frequency compensation with gain-enhanced stage for three-stage amplifier
Authors: Qiang Li, Jun Yi, Bo Zhang, Zhaoji Li
Venue: Analog Integrated Circuits and Signal Processing (2006)

A dual complex pole-zero cancellation (DCPC) frequency compensation technique with gain enhanced stage (GES) for three-stage amplifier is proposed in this paper. It uses one pair of complex zeros to cancel one pair of complex poles, resulting in feature that the frequency response of three-stage amplifier exhibits that of a single-pole system. Meanwhile, the effective transconductance of output stage can be greatly increased by several times which are equal to gain of GES, and the power dissipation can be decreased when a GES is introduced. Thus the gain-bandwidth (GBW) is expected to be increased about 10 times compared to the conventional nested miller compensation (NMC) approach. Moreover, this technique requires only one very small compensation capacitor even when driving a large load capacitor. A GBW of 1.23 MHz, DC gain of 111 dB, PM of 86° and power dissipation of 0.29 mW can be achieved for a load capacitor of 500 pF with a single Miller compensation capacitor of 14 pF at a ± 1 V supply in a standard 0.6-¿m CMOS technology.
Semantics of static pointcuts in aspectJ
Authors: Pavel Avgustinov, Elnar Hajiyev, Neil Ongkingco, Oege de Moor, Damien Sereni, Julian Tibble, Mathieu Verbaere
Venue: ACM SIGPLAN Notices (2007)

In aspect-oriented programming, one can intercept events by writing patterns called pointcuts. The pointcut language of the most popular aspect-oriented programming language, AspectJ, allows the expression of highly complex properties of the static program structure.We present the first rigorous semantics of the AspectJ pointcut language, by translating static patterns into safe ( i.e. range-restricted and stratified) Datalog queries. Safe Datalog is a logic language like Prolog, but it does not have data structures; consequently it has a straightforward least fixpoint semantics and all queries terminate.The translation from pointcuts to safe Datalog consists of a set of simple conditional rewrite rules, implemented using the Stratego system. The resulting queries are themselves executable with the CodeQuest system. We present experiments indicating that direct execution of our semantics is not prohibitively expensive.
Fusion of Summation Invariants in 3D Human Face Recognition
Authors: Wei-Yang Lin, Kin-Chung Wong, Nigel Boston, Yu Hen Hu
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

A novel family of 2D and 3D geometrically invariant features, called summation invariants is proposed for the recognition of the 3D surface of human faces. Focusing on a rectangular region surrounding the nose of a 3D facial depth map, a subset of the so called semi-local summation invariant features is extracted. Then the similarity between a pair of 3D facial depth maps is computed to determine whether they belong to the same person. Out of many possible combinations of these set of features, we select, through careful experimentation, a subset of features that yields best combined performance. Tested with the 3D facial data from the on-going Face Recognition Grand Challenge v1.0 dataset, the proposed new features exhibit significant performance improvement over the baseline algorithm distributed with the datase
A Modified Particle Swarm Algorithm Combined with Fuzzy Neural Network with Application to Financial Risk Early Warning
Authors: Fu-yuan Huang, Rong-jun Li, Han-xia Liu, Rui Li
Venue: Proceedings of the 2006 IEEE Asia-Pacific Conference on Services Computing (2006)

Particle Swarm Optimization (PSO) algorithm and Fuzzy Neural Network (FNN) system has been widely used to solve complex decision making problems in practice. However, both of them more or less suffer from the slow convergence and occasionally involve in a local optimal solution. To overcome these drawbacks of PSO and FNN, in this study a modified particle swarm optimization algorithm (MPSO) is developed and then combined with neural network to optimize the network weight training process. Furthermore, the new MPSO-FNN model has been applied to financial risk early warning problem, and the results indicate that the predictive accuracies obtained from MPSO-FNN are much higher than the ones obtained from original FNN system. To make this clearer, an illustrative example is also demonstrated in this study. It seems that the proposed new comprehensive evolution algorithm may be an efficient forecasting system in financial time series analysis.
Automatic Kinematic Chain Building from Feature Trajectories of Articulated Objects
Authors: Jingyu Yan, Marc Pollefeys
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

We investigate the problem of learning the structure of an articulated object, i.e. its kinematic chain, from feature trajectories under affine projections. We demonstrate this possibility by proposing an algorithm which first segments the trajectories by local sampling and spectral clustering, then builds the kinematic chain as a minimum spanning tree of a graph constructed from the segmented motion subspaces. We test our method in challenging data sets and demonstrate the ability to automatically build the kinematic chain of an articulated object from feature trajectories. The algorithm also works when there are multiple articulated objects in the scene. Furthermore, we take into account non-rigid articulated parts that exist in human motions. We believe this advance will have impact on articulated object tracking and dynamical structure from motion.