ppxscal/embedding_network huggingface dataset:
Margin-Based Active Learning and Background Knowledge in Text Mining
Authors: Catarina Silva, Bernardete Ribeiro
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

Text mining, also known as intelligent text analysis, text data mining or knowledge-discovery in text, refers generally to the process of extracting interesting and non-trivial information and knowledge from text. One of the main problems with text mining and classification systems is the lack of labeled data, as well as the cost of labeling unlabeled data (Kiritchenko and Matwin 2001). Thus, there is a growing interest in exploring the use of unlabeled data as a way to improve classification performance in text classification. The ready availability of this kind of data in most applications makes it an appealing source of information. In this work we evaluate the benefits of introducing unlabeled data in a support vector machine automatic text classifier. We further evaluate the possibility of learning actively and propose a method for choosing the samples to be learned.
Exploring the potentials of combining photo annotating tasks with instant messaging fun
Authors: Yuechen Qian, Loe M. G. Feijs
Venue: Proceedings of the 3rd international conference on Mobile and ubiquitous multimedia (2004)

The combination of photo annotation tasks and with instant messaging fun offers great potentials to both end-users and researchers. In this paper, we first describe our prototype system that allows users to share and annotate digital photos over the Internet while they are chatting online. In addition to manual annotation, our system can extract information from conversations to generate extra annotations. The advantage of using our system is that the boring and tedious task of annotating photos is turned into an essential part of an attractive fun activity, viz. online chatting. Extracting meaningful information from instant messages is challenged by abbreviations, pronouns, jargon, ellipsis, grammatical errors, ambiguities and asynchrony, all of which frequently appear in message conversations. In the paper we provide a roadmap, i.e. a systematic analysis of linguistic aspects of automated interpretation of message conversations.
A chart-parsing algorithm for efficient semantic analysis
Authors: Pascal Vaillant
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 1 (2002)

In some contexts, well-formed natural language cannot be expected as input to information or communication systems. In these contexts, the use of grammar-independent input (sequences of uninflected semantic units like e.g. language-independent icons) can be an answer to the users' needs. However, this requires that an intelligent system should be able to interpret this input with reasonable accuracy and in reasonable time. Here we propose a method allowing a purely semantic-based analysis of sequences of semantic units. It uses an algorithm inspired by the idea of "chart parsing" known in Natural Language Processing, which stores intermediate parsing results in order to bring the calculation time down.
Characterizing computer input with Fitts' law parameters: the information and non-information aspects of pointing
Authors: Shumin Zhai
Venue: International Journal of Human-Computer Studies (2004)

Throughput (TP), also known as index of performance or bandwidth in Fitts' law tasks, has been a fundamental metric in quantifying input system performance. The operational definition of TP is varied in the literature. In part thanks to the common interpretations of International Standard ISO 9241-9, the "Ergonomic requirements for office work with visual display terminals-- Part 9: Requirements for non-keyboard input devices", the measurements of throughput have increasingly converged onto the average ratio of index of difficulty (ID) and trial completion time (MT), i.e. TP=ID/MT. In lieu of the complete Fitts' law regression results that can only be represented by both slope (b) and intercept (a) (or MT=a+b ID), TP has been used as the sole performance characteristic of input devices, which is problematic. We show that TP defined as ID/ MT is an ill-defined concept that may change its value with the set of ID values used for the same input device and cannot be generalized beyond specific experimental target distances and sizes. The greater the absolute value of a is, the more variable TP (=ID/MT) is. ID/MT only equals a constant 1/b when a = 0. We suggest that future studies should use the complete Fitts' law regression characterized by (a, b) parameters to characterize an input system, a reflects the noninformational aspect and b the informational aspect of input performance. For convenience, 1/b can be named as throughput which, unlike ID/MT, is conceptually a true constant.
Voronoi diagrams of moving points in the plane and of lines in space: tight bounds for simple configurations
Authors: Amit Weisman, L. Paul Chew, Klara Kedem
Venue: Information Processing Letters (2004)

The combinatorial complexities of (1) the Voronoi diagram of moving points in 2D and (2) the Voronoi diagram of lines in 3D, both under the Euclidean metric, continues to challenge geometers because of the open gap between the Ω (n2) lower bound and the O(n3+ε) upper bound. Each of these two combinatorial problems has a closely related problem involving Minkowski sums: (1') the complexity of a Minkowski sum of a planar disk with a set of lines in 3D and (2') the complexity of a Minkowski sum of a sphere with a set of lines in 3D. These Minkowski sums can be considered "cross-sections" of the corresponding Voronoi diagrams. Of the four complexity problems mentioned, problems (1') and (2') have recently been shown to have a nearly tight bound: both complexities are O(n2+ε) with lower bound Ω(n2).In this paper, we determine the combinatorial complexities of these four problems for some very simple input configurations. In particular, we study point configurations with just two degrees of freedom (DOFs), exploring both the Voronoi diagrams and the corresponding Minkowski sums. We consider the traditional versions of these problems to have 4 DOFs. We show that even for these simple configurations the combinatorial complexities have upper bounds of either O(n2) or O(n2+ε) and lower bounds of Ω(n2).
Feasibility demonstration of an automated design system
Authors: Alan A. Ross
Venue: ACM SIGDA Newsletter (1977)

M. N. Matelan recently developed an abstract model for the control system design process (Matelan, 1976). Several features of this CSD model make it an attractive structure for an automated design system. These features include a method of stating the design problem independant of any realization technology and an approach which divides the design problem into a series of contingencies to be tested, related tasks to be performed as necessary, and a monitor strategy which controls the time sequencing of these contingency/task pairs. The concept of hardware binding is also introduced, which facilitates the simultaneous development of hardware and software.
Distances and diversity: sources for social creativity
Authors: Gerhard Fischer
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

The power of the unaided, individual mind is highly overrated: The Renaissance scholar no longer exists. Although creative individuals are often thought of as working in isolation, the role of interaction and collaboration with other individuals is critical to creativity. Creative activity grows out of the relationship between individuals and their work, and from the interactions between an individual and other human beings. Because complex problems require more knowledge than any single person possesses, it is necessary that all involved stakeholders participate, communicate, collaborate, and learn from each other. Distances (across spatial, temporal, and technological dimensions) and diversity (bringing stakeholders together from different cultures) are important sources for social creativity.This paper describes conceptual frameworks and socio-technical environments (derived from the systems that we have developed over the last decade) in which social creativity can come alive.
Maximum-Revenue Multicast Routing and Partial Admission Control for Multirate Multimedia Distribution
Authors: Hsu-Chen Cheng, Frank Yeong-Sung Lin
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

In this paper, we intend to solve the problem of maximum-revenue multicast routing with a partial admission control mechanism for multirate multimedia distribution. Specifically, for a given network topology, a given link capacity, the destinations of a multicast group, and the bandwidth requirement of each destination, we attempt to find a feasible routing solution to maximize the revenue of the multicast trees. The partial admission control mechanism means that the admission policy of the multicast group will not be based on a traditional "all or none" strategy. Instead it considers accepting of partial portions of destinations for the requested multicast group. Firstly, we model this problem as an optimization problem. Then, we propose a simple heuristic algorithm and an optimization based heuristic to solve this problem. The methodology taken for solving the problem is Lagrangean relaxation. Computational experiments have been performed on regular networks, random networks, and scale-free networks.
Pedestrian Detection in Nighttime Driving
Authors: Q. M. Tian, Y. P. Luo, D. C. Hu
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

This paper presents an approach for pedestrian detection in the nighttime driving with a normal camera. Bright objects in the video are extracted with an adaptive thresholding segmentation algorithm at first. Then the size, position and shape of each object are analyzed to judge whether it is a pedestrian. A tracking module is used to verify the result at last. Experimental results show that the proposed method can detect 71.26% pedestrians.
The effectiveness of request redirection on CDN robustness
Authors: Limin Wang, Vivek Pai, Larry Peterson
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)

It is becoming increasingly common to construct network services using redundant resources geographically distributed across the Internet. Content Distribution Networks are a prime example. Such systems distribute client requests to an appropriate server based on a variety of factors---e.g., server load, network proximity, cache locality---in an effort to reduce response time and increase the system capacity under load. This paper explores the design space of strategies employed to redirect requests, and defines a class of new algorithms that carefully balance load, locality, and proximity. We use large-scale detailed simulations to evaluate the various strategies. These simulations clearly demonstrate the effectiveness of our new algorithms, which yield a 60--91% improvement in system capacity when compared with the best published CDN technology, yet user-perceived response latency remains low and the system scales well with the number of servers.
Shape Matching and Object Recognition Using Low Distortion Correspondences
Authors: Alexander C. Berg, Tamara L. Berg, Jitendra Malik
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

We approach recognition in the framework of deformable shape matching, relying on a new algorithm for finding correspondences between feature points. This algorithm sets up correspondence as an integer quadratic programming problem, where the cost function has terms based on similarity of corresponding geometric blur point descriptors as well as the geometric distortion between pairs of corresponding feature points. The algorithm handles outliers, and thus enables matching of exemplars to query images in the presence of occlusion and clutter. Given the correspondences, we estimate an aligning transform, typically a regularized thin plate spline, resulting in a dense correspondence between the two shapes. Object recognition is then handled in a nearest neighbor framework where the distance between exemplar and query is the matching cost between corresponding points. We show results on two datasets. One is the Caltech 101 dataset (Fei-Fei, Fergus and Perona), an extremely challenging dataset with large intraclass variation. Our approach yields a 48% correct classification rate, compared to Fei-Fei et alýs 16%. We also show results for localizing frontal and profile faces that are comparable to special purpose approaches tuned to faces.
NaviGaze: Enabling Access to Digital Media for the Profoundly Disabled
Authors: Ryan O'Grady, Charles J. Cohen, Glenn Beach, Gary Moody
Venue: Proceedings of the 33rd Applied Imagery Pattern Recognition Workshop (2004)

Graphical interfaces have become dominant in today's computer environment. These interfaces typically consist of windows, icons, menus, and buttons that require the use of some continuous-input pointing device. Common examples of these devices include mice, styli, trackballs, touchpads, and joysticks. However, all of these devices are designed to be controlled by the user's hands. This places people who can't use their hands (amputees, quadriplegics, those with muscular disorders) at a serious disadvantage in using the computer. Therefore, there is a need for systems capable of controlling the mouse pointer without requiring hand manipulation. Because many disabled people still have significant control of their head motion, head tracking is a logical choice. We have developed a non-intrusive head tracking system for cursor control, coupled with eye blink recognition to emulate mouse clicking. The system, called NaviGaze, still allows the use of a standard mouse and keyboard, making it ideal for use in public computing environments.
Understanding Software Patching
Authors: Joseph Dadzie
Venue: Queue (2005)

Developing and deploying patches is an increasingly important part of the software development process. Software patching is an increasingly important aspect of today's computing environment as the volume, complexity, and number of configurations under which a piece of software runs have grown considerably. Software architects and developers do everything they can to build secure, bug-free software products. To ensure quality, development teams leverage all the tools and techniques at their disposal. For example, software architects incorporate security threat models into their designs, and QA engineers develop automated test suites that include sophisticated code-defect analysis tools.
Watermark Extraction by Magnifying Noise and Applying Global Minimum Decoder
Authors: Zhigeng Pan, Li Li, Mingmin Zhang, David Zhang
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

For the classical watermark embedment model I=I + ¿W, the corresponding watermark detection has its limitation in its need of a fixed parameter for extracting watermarks. If the extraction parameter is too large, we cannot extract the watermark from the image that contains watermarks; if it is too small, the extracted watermarks may be blurred. This paper proposes a novel watermark extraction method. First, we treat the watermark information as noise for the watermarked image in its spatial domain. We then magnify the noise before detection. Next, we recover the watermark information by adjusting the extracted data from the frequency domain according to our global minimum method. Experimental results show that our watermark extraction method is more valid and accurate than the classical method. It can greatly reduce extraction errors.
Incentive-based modeling and inference of attacker intent, objectives, and strategies
Authors: Peng Liu, Wanyu Zang, Meng Yu
Venue: ACM Transactions on Information and System Security (TISSEC) (2005)

Although the ability to model and infer attacker intent, objectives, and strategies (AIOS) may dramatically advance the literature of risk assessment, harm prediction, and predictive or proactive cyber defense, existing AIOS inference techniques are ad hoc and system or application specific. In this paper, we present a general incentive-based method to model AIOS and a game-theoretic approach to inferring AIOS. On one hand, we found that the concept of incentives can unify a large variety of attacker intents; the concept of utilities can integrate incentives and costs in such a way that attacker objectives can be practically modeled. On the other hand, we developed a game-theoretic AIOS formalization which can capture the inherent interdependency between AIOS and defender objectives and strategies in such a way that AIOS can be automatically inferred. Finally, we use a specific case study to show how attack strategies can be inferred in real-world attack--defense scenarios.
Efficient incremental maintenance of frequent patterns with FP-tree
Authors: Xiu-Li Ma, Yun-Hai Tong, Shi-Wei Tang, Dong-Qing Yang
Venue: Journal of Computer Science and Technology (2004)

Mining frequent patterns has been studied popularly in data mining area. However, little work has been done on mining patterns when the database has an influx of fresh data constantly. In these dynamic scenarios, efficient maintenance of the discovered patterns is crucial. Most existing methods need to scan the entire database repeatedly, which is an obvious disadvantage. In this paper, an efficient incremental mining algorithm, Incremental-Mining (IM), is proposed for maintenance of the frequent patterns when new incremental data come. Based on the frequent pattern tree (FP-tree) structure, IM gives a way to make the most of the things from the previous mining process, and requires scanning the original data once at most. Furthermore, IM can identify directly the differential set of frequent patterns, which may be more informative to users. Moreover, IM can deal with changing thresholds as well as changing data, thus provide a full maintenance scheme. IM has been implemented and the performance study shows it outperforms three other incremental algorithms: FUP, DB-tree and re-running frequent pattern growth (FP-growth).
Cooperative architectures and algorithms for discovery and transcoding of multi-version content
Authors: Claudia Canali, Valeria Cardellini, Michele Colajanni, Riccardo Lancellotti, Philip S. Yu
Venue: Web content caching and distribution: proceedings of the 8th international workshop (2004)

A clear trend of the Web is that a variety of new consumer devices with diverse processing powers, display capabilities, and network connections is gaining access to the Internet. Tailoring Web content to match the device characteristics requires functionalities for content transformation, namely transcoding, that are typically carried out by the content provider or by some proxy server at the edge. In this paper, we propose an alternative solution consisting of an intermediate infrastructure of distributed servers which collaborate in discovering, transcoding, and delivering multiple versions of Web resources to the clients. We investigate different algorithms for cooperative discovery and transcoding in the context of this intermediate infrastructure where the servers are organized in hierarchical and flat peer-to-peer topologies. We compare the performance of the proposed schemes through a flexible prototype that implements all proposed mechanisms.
MITRE-Bedford ALEMBIC: MUC-4 test results and analysis
Authors: John Aberdeen, John Burger, Dennis Connolly, Susan Roberts, Marc Vilain
Venue: Proceedings of the 4th conference on Message understanding (1992)

This note embodies our analyses of the performance of the ALEMBIC system in the MUC-4 evaluation task. These analyses have provided us with a reasonably good understanding of the principal factors contributing to the system's correct responses and to its errors. This understanding is based in part on interpretations of the performance measures provided by the MUC-4 scoring software; in addition, we performed a number of qualitative and quantitative investigations into linguistic aspects of the messages that underly the system's performance.
Attention-based design of augmented reality interfaces
Authors: Leonardo Bonanni, Chia-Hsun Lee, Ted Selker
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

The objects and surfaces of a task-based environment can be layered with digital interfaces to make them easier and safer to use. Once information can be projected anywhere in the space, it becomes crucial to design the information to make optimal use of users' attention. We have prototyped and evaluated a real-world augmented reality kitchen where user-centered interfaces and displays can be projected anywhere in the space to improve its usability. The augmented environment is designed to support the activities of a variety of people in diverse kitchen environments.This paper presents five intelligent kitchen systems that layer useful interfaces onto the refrigerator, range, cabinets, countertops and sink. The interface design is driven by human factors, especially attention theory and user evaluations. By projecting interfaces where they require the least cognitive load, we hope to improve the performance and confidence of users. The design employs cueing and search principles from attention theory. We present the results of pilot studies and future directions for our work.
Identical approximative sequence for various notions of Universality
Authors: G. Costakis, V. Vlachou
Venue: Journal of Approximation Theory (2005)

In this paper, we examine various notions of universality, which have already been proved generic. Our main purpose is to prove that generically they occur simultaneously with the same approximative sequence.
Quadratic forms on graphs
Authors: Noga Alon, Konstantin Makarychev, Yury Makarychev, Assaf Naor
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We introduce a new graph parameter, called the Grothendieck constant of a graph G=(V,E), which is defined as the least constant K such that for every A:E→R,supf:V→S|V|-1 Σ(u,v) ∈ E A(u,v) · ‹f(u),f(v)› ≤ K supf:V→(-1,+1) Σ(u,v)∈ E A(u,v) · f(u)f(v).The classical Grothendieck inequality corresponds to the case of bipartite graphs, but the case of general graphs is shown to have various algorithmic applications. Indeed, our work is motivated by the algorithmic problem of maximizing the quadratic form ∑u,v∈EA(u,v)f(vover all f: V →-1,1, which arises in the study of correlation clustering and in the investigation of the spin glass model. We give upper and lower estimates for the integrality gap of this program. We show that the integrality gap is O(log θḠ)) where θ(Ḡ) is the Lovász Theta Function of the complement of G, which is always smaller than the chromatic number of G. This yields an efficient constant factor approximation algorithm for the above maximization problem for a wide range of graphs G. We also show that the maximum possible integrality gap is always at least Ω(log ω(G)), where Ω(G) is the clique number of G. In particular it follows that the maximum possible integrality gap for the complete graph on n Θ vertices with no loops is ⏷(log n ). More generally, the maximum possible integrality gap for any perfect graph with chromatic number n is ⏷(log n). The lower bound for the complete graph improves a result of Kashin and Szarek on Gram matrices of uniformly bounded functions, and settles a problem of Megretski and of Charikar and Wirth.