ppxscal/embedding_network huggingface dataset:
Iterative Corner Extraction and Matching for Mosaic Construction
Authors: S. Alkaabi, F. Deravi
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

A rapid and automatic iterative corner extraction and matching for 2D mosaic construction is presented. This new system progressively estimates the geometric transformation parameters between two misaligned images. It combines corner extraction, matching, and transformation parameters estimation into an iterative scheme. By aligning the images in successive iterations, accuracy improves significantly. The accurately aligned images are used to re-extract new features, which are subsequently matched to select correspondences used to estimate a transformation with n-degrees of freedom. The false correspondences are suppressed progressively to achieve an accurate transformation estimate. The system is used to construct a mosaic from two misaligned images. The performance of the system is demonstrated experimentally using various images of differing complexity.
Conveying taxonomy context for topic-focused Web search: Research Articles
Authors: Said Mirza Pahlevi, Hiroyuki Kitagawa
Venue: Journal of the American Society for Information Science and Technology (2005)

Introducing context to a user query is effective to improve the search effectiveness. In this article we propose a method employing the taxonomy-based search services such as Web directories to facilitate searches in any Web search interfaces that support Boolean queries. The proposed method enables one to convey current search context on taxonomy of a taxonomy-based search service to the searches conducted with the Web search interfaces. The basic idea is to learn the search context in the form of a Boolean condition that is commonly accepted by many Web search interfaces, and to use the condition to modify the user query before forwarding it to the Web search interfaces. To guarantee that the modified query can always be processed by the Web search interfaces and to make the method adaptive to different user requirements on search result effectiveness, we have developed new fast classification learning algorithms. &copy; 2005 Wiley Periodicals, Inc.
Detection of phishing webpages based on visual similarity
Authors: Liu Wenyin, Guanglin Huang, Liu Xiaoyue, Zhang Min, Xiaotie Deng
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

An approach to detection of phishing webpages based on visual similarity is proposed, which can be utilized as a part of an enterprise solution for anti-phishing. A legitimate webpage owner can use this approach to search the Web for suspicious webpages which are visually similar to the true webpage. A webpage is reported as a phishing suspect if the visual similarity is higher than its corresponding preset threshold. Preliminary experiments show that the approach can successfully detect those phishing webpages for online use.
Out-of-Order Commit Processors
Authors: Adrian Cristal, Daniel Ortega, Josep Llosa, Mateo Valero
Venue: Proceedings of the 10th International Symposium on High Performance Computer Architecture (2004)

Modern out-of-order processors tolerate long latency memory operations by supporting a large number of in-flight instructions. This is particularly useful in numerical applications where branch speculation is normally not a problem and where the cache hierarchy is not capable of delivering the data soon enough. In order to support more in-flight instructions, several resources have to be up-sized, such as the Reorder Buffer (ROB), the general purpose instructions queues, the Load/Store queue and the number of physical registers in the processor. However, scaling-up the number of entries in these resources is impractical because of area, cycle time, and power consumption constraints. In this paper we propose to increase the capacity of future processors by augmenting the number of in-flight instructions. Instead of simply up-sizing resources, we push for new and novel microarchitectural structures that achieve the same performance benefits but with a much lower need for resources. Our main contribution is a new checkpointing mechanism that is capable of keeping thousands of in-flight instructions at a practically constant cost. We also propose a queuing mechanism that takes advantage of the differences in waiting time of the instructions in the flow. Using these two mechanisms our processor has a performance degradation of only 10% for SPEC2000fp over a conventional processor requiring more than an order of magnitude additional entries in the ROB and instruction queues, and about a 200% improvement over a current processor with a similar number of entries.
Achieving fair rates with ingress policing
Authors: John Musacchio, Jean Walrand
Venue: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2005)

We study a simple ingress policing scheme for a stochastic queuing network that uses a round-robin service discipline, and derive conditions under which the flow rates approach a max-min fair share allocation. The scheme works as follows: Whenever any of a flow's queues exceeds a policing threshold, the network discards that flow's arriving packets at the network ingress, and does so until all of that flow's queues fall below their thresholds. To prove our results, we use previously known results relating the stability of a queuing system to the stability of its fluid limit and extend these results to relate the flow rates of the stochastic system to those of a corresponding fluid model. In particular, we consider the fluid limit of a sequence of queuing networks with increasing thresholds. Using a Lyapunov function derived from the fluid limits, we find that as the policing thresholds are increased the state of the stochastic system is attracted to a relatively smaller and smaller neighborhood surrounding the equilibrium of the fluid model. We then show how this property implies that the achieved flow rates approach the max-min rates predicted by the fluid model.
The Livny and Plank-Beck Problems: Studies in Data Movement on the Computational Grid
Authors: Matthew S. Allen, Rich Wolski
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

Over the last few years the Grid Computing research community has become interested in developing data intensive applications for the Grid. These applications face significant challenges because their widely distributed nature makes it difficult to access data with reasonable speed. In order to address this problem, we feel that the Grid community needs to develop and explore data movement challenges that represent problems encountered in these applications. In this paper, we will identify two such problems that we have dubbed the Livny Problem and the Plank-Beck Problem. We will also present data movement scheduling techniques that we have developed to address these problems.
Hybrid Soft Categorization in Conceptual Spaces
Authors: Ickjai Lee
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

Understanding the process of categorization is of great importance for building intelligent agents. Formulated categories help agents find information easier and understand the external world better. Instance-based categorization and prototype-based categorization have been two dominant approaches in the AI community. However, they share some drawbacks in common. First, they are crisp boundarybased hard categorizations (similar to classification). Second, they are not well-suited for dynamic category learning and formation. In this paper, we propose a hybrid soft categorization in the conceptual level that overcomes these drawbacks. The hybrid soft categorization merges the two popular hard categorizations and provides a robust fuzzy boundary-based soft categorization.
Optimal coteries for rings and related networks
Authors: Toshihide Ibaraki, Hiroshi Nagamochi, Tsunehiko Kameda
Venue: Distributed Computing (1995)

Let a distributed system be represented by a graph G = (V, E), where V is the set of nodes and E is the set of communication links. A coterie is defined as a family, C, of subsets of V such that any pair of subsets in C has at least one node in common and no subset in C contains any other subset in C. Assuming that each node vi ∈ V (resp. link ej ∈ E) is operational with probability Pi (resp. rj), the availability of a coterie is defined as the probability that the operational nodes and links of G connect all nodes in at least one subset in the coterie. Although it is computationally intractable to find an optimal coterie that maximizes availability for general graph G, we show in this paper that, if G is a ring, either a singleton coterie or a 3-majority coterie is optimal. Therefore, for any ring, an optimal coterie can be computed in polynomial time. This result is extended to the more general graphs, in which each biconnected component is either an edge or a ring.
On some properties of suboptimal colorings of graphs
Venue: Networks (2004)

Starting from the trivial observation that, in any optimal coloring of a graph, there always exists a node v such that its neighborhood N&lpar;v&rpar; contains all colors, we examine related properties in suboptimal colorings &lpar;i.e., those using more than &chi;&lpar;G&rpar; colors, where &chi;&lpar;G&rpar; is the chromatic number&rpar;. In particular, we show that, in any &lpar;&chi;&lpar;G&rpar; &plus; p&rpar;-coloring of G, there is a node v such that its generalized neighborhood Nq&lpar;v&rpar; with q &equals; max&lcub;2p - 1, 2&rcub; contains &chi;&lpar;G&rpar; colors for p &ge; 1. Additional properties of &lpar;&chi;&lpar;G&rpar; &plus; p&rpar;-colorings are also given. &copy; 2004 Wiley Periodicals, Inc.
Stability of information equilibrium in reflexive games
Authors: D. A. Novikov, A. G. Chkhartishvili
Venue: Automation and Remote Control (2005)

For the reflexive game where the agents' decisions rely on a hierarchy of beliefs about essential parameters, beliefs about beliefs, and so on, consideration was given to stability of its information equilibrium. Stability lies in that the expected result of the game is observed precisely by each participant, be it real and phantom, that is, existing in the belief of other real or phantom participants.
Accurate Motion Layer Segmentation and Matting
Authors: Jiangjian Xiao, Mubarak Shah
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

Given a video sequence, obtaining accurate layer segmentation and alpha matting is very important for various applications. However, when a non-textured or smooth area is present in the scene, the segmentation based on only single motion cue usually cannot provide satisfactory results. Conversely, the most matting approaches require a smooth assumption on foreground and background to obtain a good result. In this paper, we combine the merits of motion segmentation and alpha matting technique together to simultaneously achieve high-quality layer segmentation and alpha mattes. First, we explore a general occlusion constraint and design a novel graph cuts framework to solve the layer-based motion segmentation problem for the textured regions using multiple frames. Then, an alpha matting technique is further used to refine the segmentation and resolve the non-textured ambiguities by determining proper alpha values for the foreground and background respectively.
The LINK system: MUC-4 test results and analysis
Authors: Steven L. Lytinen, Sayan Bhattacharyya, Robert R. Burridge, Peter M. Hastings, Christian Huyck, Karen A. Lipinsky, Eric S. McDaniel, Karenann K. Terrell
Venue: Proceedings of the 4th conference on Message understanding (1992)

The University of Michigan's natural language processing system, called LINK, was used in the Fourth Message Understanding System Evaluation (MUC-4). LINK's performance on MUC-4's two test corpora is summarized in figure 1.
Comparison of two approaches to dynamic programming
Authors: Pim van den Broek, Joost Noppen
Venue: ACM SIGACT News (2004)

Both in mathematics and in computer science Dynamic Programming is a well known concept. It is an algorithmic technique, which can be used to write efficient algorithms, based on the avoidance of multiple executions of identical subcomputations. Its definition in both disciplines is however quite different. The aim of this paper is to compare both definitions. It is shown that the computer science approach is more efficient, since it avoids the execution of unneeded subcomputations, whereas the mathematical approach has greater possibilities of reducing memory requirements.
iCheck Series: Microsoft Office 2003, Introductory, Student Edition, 1 edition
Venue:  (2005)

Microsoft Office 2003 Real World Applications — Introductory is the first of this new, two-volume series. This introduction to Office 2003 covers Microsoft Office Specialist objectives for Word 2003, Excel 2003, Access 2003, and PowerPoint 2003. Microsoft Office 2003 Real World Applications — Introductory was written specifically for high school students. It is age-level and interest-level appropriate. The student edition also integrates basic language arts and mathematics skills. The Online Learning Center provides support for teachers and enrichment for students. To access the Online Learning Center click here. Table of contentsTABLE OF CONTENTSUnit 1 - Word 2003: Business and Personal CommunicationLesson 1: Creating a DocumentLesson 2: Formatting ContentLesson 3: Using Word ToolsLesson 4: Formatting and Managing DocumentsLesson 5: Columns, Tables, and GraphicsLesson 6: Collaborating With OthersUnit 2 - Excel 2003: Business and Personal FinanceLesson 1: Excel BasicsLesson 2: Creating Data and ContentLesson 3: Formatting Data and ContentLesson 4: Analyzing DataLesson 5: Managing WorkbooksUnit 3 - Access 2003: Using DatabasesLesson 1: Access BasicsLesson 2: Structuring DatabasesLesson 3: Entering and Organizing DataLesson 4: Managing DatabasesUnit 4 - PowerPoint©: The Power of PresentationsLesson 1: PowerPoint© BasicsLesson 2: Creating Content and Collaborating with OthersLesson 3: Formatting ContentLesson 4: Managing and Delivering PresentationsUnit 5 - Integrating ApplicationsLesson 1: Word IntegrationLesson 2: Excel IntegrationLesson 3: Access IntegrationLesson 4: PowerPoint© Integration
Book review: An Introduction to Default Logic by Philippe Besnard (Springer Verlag, New York, 1989)
Venue: ACM SIGART Bulletin (1991)

One of Hubert Dreyfus's more biting criticisms of Artificial Intelligence has been that its success stories have been largely confined to toy environments. Some researchers are unperturbed by this criticism, apparently believing that an accretion of little success stories will eventually reward us with a cumulative global success story. Others have turned to renewed efforts to understand what Herbert Simon calls "weak methods" of inference, that is methods of inference which do not presuppose specific knowledge of a domain. I too believe that knowledge-poor methods of inference offer greater long-term promise for the development of AI. Philippe Besnard's book is a codification of efforts to formalize one species (genus?) of knowledge-poor reasoning, what has been variously called default, defeasible, and nonmonotonic reasoning.
Hierarchical MADM with fuzzy integral for evaluating enterprise intranet web sites
Authors: Gwo-Hshiung Tzeng, Yu-Ping Ou Yang, Chin-Tsai Lin, Chie-Bein Chen
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2005)

In the real world, most criteria have inter-dependent or interactive characteristics so they cannot be evaluated by conventional additive measures. Thus, to approximate the human subjective evaluation process, it would be more suitable to apply a fuzzy integral model, in which it is not necessary to assume additivity and independence. This research proposes an effective algorithm to determine the λ-value using the input data of fuzzy densities and the fuzzy integral based on λ-fuzzy measure to determine the overall evaluation. This research also gives an example of evaluating enterprise intranet web sites with illustrations of the hierarchical structure of λ-fuzzy measure for a Choquet integral model. The results show that the fuzzy integral is more suitable than a traditional multicriteria evaluation method for human subjective evaluation, or when criteria are not mutually independent.
TCP Nice: a mechanism for background transfers
Authors: Arun Venkataramani, Ravi Kokku, Mike Dahlin
Venue: Proceedings of the 5th symposium on Operating systems design and implementationDue to copyright restrictions we are not able to make the PDFs for this conference available for downloading (2002)

Many distributed applications can make use of large background transfers - transfers of data that humans are not waiting for -- to improve availability, reliability, latency or consistency. However, given the rapid fluctuations of available network bandwidth and changing resource costs due to technology trends, hand tuning the aggressiveness of background transfers risks (1) complicating applications, (2) being too aggressive and interfering with other applications, and (3) being too timid and not gaining the benefits of background transfers. Our goal is for the operating system to manage network resources in order to provide a simple abstraction of near zero-cost background transfers. Our system, TCP Nice, can provably bound the interference inflicted by background flows on foreground flows in a restricted network model. And our microbenchmarks and case study applications suggest that in practice it interferes little with foreground flows, reaps a large fraction of spare network bandwidth, and simplifies application construction and deployment. For example, in our prefetching case study application, aggressive prefetching improves demand performance by a factor of three when Nice manages resources; but the same prefetching hurts demand performance by a factor of six under standard network congestion control.
A rate control mechanism for energy efficient many-to-one communication
Authors: Vartika Bhandari, Nitin H. Vaidya
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2005)

The many-to-one communication paradigm is extremely relevant in the emerging contexts of hybrid wireless networks as well as data gathering sensor networks. In this model of communication the point of data-convergence (base-station) becomes a bottleneck, thereby imposing a trivial upper bound of W on achievable aggregate capacity [1] where W is the maximum transmission rate possible. Some earlier work on many-to-one communication has considered hierarchical schemes wherein nodes are organized into clusters and intra-cluster communication occurs over a different channel than cluster-head to base-station (BS) communication [1], [2]. However we observe that even within the constraint of a single channel, it is possible to harness the potential for spatial re-use available in the network to obtain greater energy-efficiency while maintaining the same aggregate rate. We envisage a mechanism that exploits the non-linearity inherent in Shannon's equation: W = B log (1 + SINR), and improves on energy consumption by replacing a single high rate transmission with many spatially spread out low rate ones.
Mean Buffer Contents in Discrete-Time Single-Server Queues with Heterogeneous Sources
Authors: Tetsuya Takine
Venue: Queueing Systems: Theory and Applications (2005)

We consider discrete-time single-server queues fed by independent, heterogeneous sources with geometrically distributed idle periods. While being active, each source generates some cells depending on the state of the underlying Markov chain. We first derive a general and explicit formula for the mean buffer contents in steady state when the underlying Markov chain of each source has finite states. Next we show the applicability of the general formula to queues fed by independent sources with infinite-state underlying Markov chains and discrete phase-type active periods. We then provide explicit formulas for the mean buffer contents in queues with Markovian autoregressive sources and greedy sources. Further we study two limiting cases in general settings, one is that the lengths of active periods of each source are governed by an infinite-state absorbing Markov chain, and the other is the model obtained by the limit such that the number of sources goes to infinity under an appropriate normalizing condition. As you will see, the latter limit leads to a queue with (generalized) M/G/¿ input sources. We provide sufficient conditions under which the general formula is applicable to these limiting cases.
Automatic video production of lectures using an intelligent and aware environment
Authors: Michael Bianchi
Venue: Proceedings of the 3rd international conference on Mobile and ubiquitous multimedia (2004)

This paper makes the case that much of the promise of ubiquitous multimedia depends on the availability of valued material. In business and academic environments the "presentation in a lecture room with laptop graphics" is a common way of communicating, but making a presentation readily available outside of the room is still a challenge because of the complexities of capturing and distributing the material. The AutoAuditorium&trade; System creates a multi-camera video program of a lecture in real time, without any human control beyond turning the system on and off. The system reduces the opportunity costs of making such a program to the point that it gets used for events previously not seen as candidates for video. Thus an event does not need nearly as many viewers to be considered worth capturing and many more events are seen by many more people.This paper presents a quick overview of the AutoAuditorium System technology and operational characteristics, a history of it's ancestry, development and use, and some usage experiences that demonstrate its current utility and future potential.The AutoAuditorium System is an example of an "intelligent and aware environment." In particular, it is:intelligent - about creating multi-camera television programs of lectures, in real time, with one or more people on a stage using projected visuals.aware - of the motion and gesturing of the people on stage.- of changes in the projected visuals.Originally created in the early- and mid-1990s as a research project [1] at Bellcore (Bell Communications Research, now Telcordia Technologies), it has been available as a commercial product from Foveal Systems since 1999.
Histograms of Oriented Gradients for Human Detection
Authors: Navneet Dalal, Bill Triggs
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

We study the question of feature sets for robust visual object recognition, adopting linear SVM based human detection as a test case. After reviewing existing edge and gradient based descriptors, we show experimentally that grids of Histograms of Oriented Gradient (HOG) descriptors significantly outperform existing feature sets for human detection. We study the influence of each stage of the computation on performance, concluding that fine-scale gradients, fine orientation binning, relatively coarse spatial binning, and high-quality local contrast normalization in overlapping descriptor blocks are all important for good results. The new approach gives near-perfect separation on the original MIT pedestrian database, so we introduce a more challenging dataset containing over 1800 annotated human images with a large range of pose variations and backgrounds.