ppxscal/embedding_network huggingface dataset:
Search, stitch, view: Easing information integration in an IDE
Authors: Thomas Fritz, Gail C. Murphy
Venue: Proceedings of the 2009 ICSE Workshop on Search-Driven Development-Users, Infrastructure, Tools and Evaluation (2009)

When building a software system, software developers each contribute a flow of information that together forms the system. As they work, developers continuously consult various fragments of information to answer their questions about the system. In today's programming environments, information is kept in disparate silos, such as program code, bugs and change sets. However, to answer the variety of questions a developer faces, the interleaving of information from multiple sources is typically needed. We have implemented a prototype that allows for the composition of information fragments from different silos. We also interviewed three experienced developers to find out about cases when they need to interleave information.
Virtual locomotion system for human-scale virtual environments
Authors: Laroussi Bouguila, Masahiro Ishii, Makoto Sato
Venue: Proceedings of the working conference on Advanced visual interfaces (2002)

This paper presents a new virtual locomotion interface based on step-in-place action and a smart-turntable system. The interface provides a turntable as walking platform, on top of which users will stand at its center, and facing a large screen, to perform life-like walking actions that steer their navigation through the virtual environment. Steering actions are tracked seamlessly without attachment to the body through a set of pressure sensors embedded within the turntable and a computer vision system. For instance, in place stepping is treated as a gesture indicating the intention to move forward. Rotation about the body's vertical axis is treated as a gesture changing the walking direction. However, as large screens are usually limited in size and do not allow a surrounding projection, a large turning action may put users in a visual-less situation, which hamper considerably the effectiveness of the walking experience. To avoid such case and keep users always provided with sufficient visual feedback, the turntable will passively and smoothly rotate in opposite direction of users' turning. Rotation speed and acceleration of the turntable are well optimized to keep users well balanced and easily withstand the passive rotation. The interface is shown to be easy and simple to use in virtual environments equipped with large screen.
Constraint-based Error Diagnosis in Logic Programming
Authors: Nguyen-Thinh Le, Wolfgang Menzel
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

Using the constraint-based modeling approach, we have developed a diagnostic component, which is able to identify errors made by learners of a logic programming language when implementing a given task specification. It uses patterns to hypothesize the intention of a learner and programming techniques to model conditions on the semantic well-formedness of the program code. These conditions are expressed by means of constraints, which are evaluated on the student solution. Guiding feedback can be derived from constraint violations and is presented to the student with different degrees of informativity. The component has been integrated into a web-based tutoring system and tested on a number of exercises by the participants of an introductory course in logic programming.
Digital Photography for Dummies
Authors: Julie Adair King
Venue:  (2007)

If you're comfortable with the concept of photography but find the digital part a stumbling block, Digital Photography for Dummies will get you over the hump. Author Julie Adair King, a photographer and graphics-software specialist, deftly explains such concepts as resolution, f-stop, and compression. She is also refreshingly upfront about the differences between film-based and digital photography, spelling out the latter's shortcomings early on. Her advice on all aspects of the field is well thought out and simple without being condescending. She informs readers, for example, that you needn't use high-pixel resolutions simply for placing images on a Web page. Such tips will come as a relief to fledgling photographers on a budget, or novices who may have thought they had to use the highest-quality settings at all times. Aside from the technical concerns of working with the camera and computer, King also gives sound tips on composition and lighting. And since retouching is one of the principal benefits of digital photography, she spends a fair amount of time discussing photo-editing software. And while most of the examples are in black and white, the most important examples, gratefully, are included in a 16-page color plate section in the middle of the book. For those of you considering jumping into the world of digital photography, you'll be hard-pressed to find a better guide to getting started than Digital Photography for Dummies. --John Frederick Moore 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
Implementing lightweight reservation protocol for mobile network using crossover router & pointer forwarding scheme
Authors: Lina Yang, Abdullah Gani, Omar Zakaria, Nor Badrul Anuar
Venue: Proceedings of the 8th WSEAS international conference on Electronics, hardware, wireless and optical communication (2009)

An increasing volume of multimedia traffic carried over the Internet is rapidly demanding quality of service beyond the traditional best-effort. The Integrated Services model relies on the Resource reservation Protocol (RSVP) for signaling and resource reservation. RSVP uses a receiver-initiated reservation mechanism to set up the reservation which imposes the protocol complexity and incurs additional processing overheads on the routers. Hence, many researchers study the light reservation protocol. Sender-initiated and Mobility-support Reservation Protocol (SMRP) is a lightweight signaling protocol. SMRP path retransmission may cause extra delay with Crossover Router (COR) scheme during handoff in mobile environment. In order to make SMRP more suitable for Mobile hosts, we propose hybrid method to combine the advantages of COR scheme with Pointer Forwarding scheme. We have selected ns2 Java version network simulator to test it. Simulation result shows that the hybrid scheme reduced the delay time, drop probability and also can provide better system efficiency. SMRP will be more suitable for Mobile hosts when using hybrid scheme.
Overhearing the crowd: an empirical examination of conversation reuse in a technical support community
Authors: Derek L. Hansen
Venue: Proceedings of the fourth international conference on Communities and technologies (2009)

This paper describes a mixed method, empirical analysis of conversation reuse in an online technical support community. I find that the same characteristics that make the conversation successful (its highly personal, immediate, and socially engaging nature) make reuse of the conversation problematic. The archived discussion and wiki are reused to satisfy an immediate need, while the ongoing conversation is reused to help learn the practice. Use of the discussion archive and wiki repository are compared, showing benefits of the decontextualized, distilled wiki content for reuse. Implications of the findings on the design of "reuser friendly" tools and strategies are discussed.
Multi-objective Robust Fault Detection Filter Design in a Finite Frequency Range
Authors: Yu Cui, Xin-Han Huang, Min Wang
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III (2009)

The robust fault detection filter (RFDF) design problem for linear time invariant (LTI) system with unknown inputs is studied. The design objectives are set to minimize a combined performance index H ¿ / H ¿over the specified frequency range as well as to satisfy regional constraints on filter poles. A linear matrix inequality (LMI) based solution is proposed with the aid of the recently developed generalized KYP lemma. The advantage of the proposed solution lies in that the real values of the H ¿ , H ¿ indices over the given finite frequency range are accessible during the solving process. Based on that, an optimal solution minimizing the performance index H ¿ / H ¿ with filter poles lie in the specified region is proposed by converting the design problem to a standard LMI optimization problem. An aircraft design example demonstrates the effectiveness of the proposed solution.
MMV: a metamodeling based microprocessor validation environment
Authors: Deepak A. Mathaikutty, Sreekumar V. Kodakara, Ajit Dingankar, Sandeep K. Shukla, David J. Lilja
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

With increasing levels of integration of multiple processing cores and new features to support software functionality, recent generations of microprocessors face difficult validation challenges. The systematic validation approach starts with defining the correct behaviors of the hardware and software components and their interactions. This requires new modeling paradigms that support multiple levels of abstraction. Mutual consistency of models at adjacent levels of abstraction is crucial for manual refinement of models from the full chip level to production register transfer level, which is likely to remain the dominant design methodology of complex microprocessors in the near future. In this paper, we present microprocessor modeling and validation environment (MMV), a validation environment based on metamodeling, that can be used to create models at various abstraction levels and to generate most of the important validation collaterals, viz., simulators, checkers, coverage, and test generation tools. We illustrate the functionalities in MMV by modeling a 32-bit reduced instruction set computer processor at the system, instruction set architecture, and microarchitecture levels. We show by examples how consistency across levels is enforced during modeling and also how to generate constraints for automatic test generation.
Speeding up X.509 Certificate Path Validation
Authors: Shingo Hane, Takahiro Fujishiro, Yoko Hashimoto, Tadashi Kaji, Kondo Katsuhiko, Satoru Tezuka
Venue: Proceeding of the 2005 conference on Applied Public Key Infrastructure: 4th International Workshop: IWAP 2005 (2005)

A fast algorithm to execute path validation of the X.509 Certificate was developed. The algorithm used not only certificates and certificate revocation information but also certification path information as cached information in order to speed up transactions. The effect of it was confirmed by the experiment of the server system that had the fast algorithm of certification path validation under the private test environment.
Model-driven visualizations of constraint-based local search
Authors: Grégoire Dooms, Pascal Hentenryck, Laurent Michel
Venue: Constraints (2009)

Visualization is often invaluable to understand the behavior of optimization algorithms, identify their bottlenecks or pathological behaviors, and suggest remedial techniques. Yet developing visualizations is often a tedious activity requiring significant time and expertise. This paper presents a framework for the visualization of constraint-based local search (CBLS) algorithms. Given a high-level model and a declarative visualization specification, the CBLS visualizer systematically produces animations to visualize constraints and objectives, violations, and conflicts, as well as the temporal behavior of these measures. The visualization specification is declarative and typically composed of a triple (what,where,how) indicating what to display, where, and with which graphical objects. The visualizer architecture is compositional and extensible. It provides building blocks which can be assembled freely by the user and focuses almost exclusively on static aspects, the dynamic aspects being automated by the use of invariants. The paper highlights various functionalities of the visualizer and describes a blueprint for its implementation.
Bit vector algorithms enabling high-speed and memory-efficient firewall blacklisting
Authors: Lane Thames, Randal Abler, David Keeling
Venue: Proceedings of the 47th Annual Southeast Regional Conference (2009)

In a world of increasing Internet connectivity coupled with increasing computer security risks, security conscious network applications implementing blacklisting technology are becoming very prevalent because it provides the ability to prevent information exchange from known malicious sources. Current technology implementing blacklisting does so at the application level. However, there are numerous benefits for implementing blacklisting filters in the firewall. These benefits include reduced application workload and reduced bandwidth consumption. But, because the de facto algorithm in firewalls is based on a linear search first match principle, large blacklists are not feasible to implement in firewalls due to the O(N) timing complexity of linear search methods. This paper addresses this issue by describing techniques that solve the O(N) time complexity issue without changing the internal input-output behavior of the firewall.
Safe Family Computing with Windows Vista
Authors: Tony Loton
Venue:  (2007)

This book is not for computer geeks. It's for regular people, such as parents, who have purchased one or more personal computers for the family; and who are concerned about how those computers can be used safely on-line and off-line so that... . . Individual computer users - particularly children, but maybe your granny - are protected from illegal, immoral, pornographic, or violent content. . The computer itself is resilient to attack from viruses, spyware, and other malevolent forces resident on the Internet. The book is primarily concerned with the safety and security features of Windows Vista, which contribute towards a safer computing environment for the whole family. Since your family will likely have additional Windows XP computers, you will also find some suggestions on how similar family safety features may be applied on those computers too. 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
An approximate approach for training polynomial kernel SVMs in linear time
Authors: Yu-Chieh Wu, Jie-Chi Yang, Yue-Shi Lee
Venue: Proceedings of the 45th Annual Meeting of the ACL on Interactive Poster and Demonstration Sessions (2007)

Kernel methods such as support vector machines (SVMs) have attracted a great deal of popularity in the machine learning and natural language processing (NLP) communities. Polynomial kernel SVMs showed very competitive accuracy in many NLP problems, like part-of-speech tagging and chunking. However, these methods are usually too inefficient to be applied to large dataset and real time purpose. In this paper, we propose an approximate method to analogy polynomial kernel with efficient data mining approaches. To prevent exponential-scaled testing time complexity, we also present a new method for speeding up SVM classifying which does independent to the polynomial degree d. The experimental results showed that our method is 16.94 and 450 times faster than traditional polynomial kernel in terms of training and testing respectively.
Flow scheduling and endpoint rate control in GridNetworks
Authors: Sebastien Soudan, Bin Bin Chen, Pascale Vicat-Blanc Primet
Venue: Future Generation Computer Systems (2009)

In grid networks, distributed resources, computing or storage elements as well as scientific instruments are interconnected to support computing-intensive and data-intensive applications. To facilitate the efficient scheduling of these resources, we propose to manage the movements of massive data set between them. This paper formulates the bulk data transfer scheduling problem and presents an optimal solution to minimize the network congestion factor of a dedicated network or an isolated traffic class. The solution satisfying individual flows' time and volume constraints can be found in polynomial time and expressed as a set of multi-interval bandwidth allocation profiles. To ensure a large-scale deployment of this approach, we propose, for the data plane, a combination of a bandwidth profile enforcement mechanism with traditional transport protocols. The paper examines several solutions for implementing such a mechanism in a Linux kernel. The experimental evaluation shows that packet pacing performed at IP level offers a simple yet valuable and TCP-compatible solution for accurate bandwidth profile enforcement at very high speed.
Symmetric deformation of 3D face scans using facial features and curvatures
Authors: Jeong-Sik Kim, Soo-Mi Choi
Venue: Computer Animation and Virtual Worlds (2009)

Facial symmetry is one of the number of aesthetic traits associated with health, physical attractiveness and beauty of a person. In this paper, we present a novel method for enhancing the symmetry of a scanned 3D face automatically. To handle detailed areas of the face, we developed a new local 3D shape descriptor based on facial features and surface curvatures. Our shape descriptor can improve the accuracy when deforming a 3D face towards a symmetric configuration, because it provides accurate point pairing with respect to the plane of symmetry. It can also reduce the computational complexity by dividing the given face into partitioned slices and facial feature regions. In addition, we use point-based representation over all stages of symmetrization without generating a consistent triangle mesh or texture parameterization, which makes it much easier to support discrete processes such as symmetric deformation and to be combined with more sophisticated manipulations later such as cutting of surfaces. Finally, we performed a statistical analysis to assess subjects' preference for the symmetrized faces by our approach. Copyright &copy; 2009 John Wiley & Sons, Ltd. The pipeline of 3D face symmetrization. We present a novel method for enhancing the symmetry of a scanned 3D face automatically. We developed a new local 3D shape descriptor based on facial features and surface curvatures. Our shape descriptor can improve the accuracy when deforming a 3D face towards a symmetric configuration, because it provides accurate point pairing with respect to the plane of symmetry. In addition, we use point-based representation over all stages of symmetrization without generating a consistent triangle mesh or texture parameterization.
An anytime approach for on-line planning
Authors: Oscar Sapena, Eva Onaindía
Venue: Proceeding of the 2005 conference on Artificial Intelligence Research and Development (2005)

In this paper we present a novel planning approach, based on well-known techniques such as goal decomposition and heuristic planning, aimed at working in highly dynamic environments with time constraints. Our contribution is a domain-independent planner to incrementally generate plans under a deliberative framework for reactive domains. The planner follows the anytime principles, i.e a first solution plan can be quickly computed and the quality of the solution is improved as time is available. Moreover, the fast computation of the sequential actions allows the plan to start its execution before it is totally generated, thus giving rise to a highly reactive planning system.
Statistical learning in network architecture
Authors: Karen R. Sollins
Venue:  (2008)

The Internet has become a ubiquitous substrate for communication in all parts of society. However, many original assumptions underlying its design are changing. Amid problems of scale, complexity, trust and security, the modern Internet accommodates increasingly critical services. Operators face a security arms race while balancing policy constraints, network demands and commercial relationships. This thesis espouses learning to embrace the Internet's inherent complexity, address diverse problems and provide a component of the network's continued evolution. Malicious nodes, cooperative competition and lack of instrumentation on the Internet imply an environment with partial information. Learning is thus an attractive and principled means to ensure generality and reconcile noisy, missing or conflicting data. We use learning to capitalize on under-utilized information and infer behavior more reliably, and on faster time-scales, than humans with only local perspective. Yet the intrinsic dynamic and distributed nature of networks presents interesting challenges to learning. In pursuit of viable solutions to several real-world Internet performance and security problems, we apply statistical learning methods as well as develop new, network-specific algorithms as a step toward overcoming these challenges. Throughout, we reconcile including intelligence at different points in the network with the end-to-end arguments. We first consider learning as an end-node optimization for efficient peer-to-peer overlay neighbor selection and agent-centric latency prediction. We then turn to security and use learning to exploit fundamental weaknesses in malicious traffic streams. Our method is both adaptable and not easily subvertible. Next, we show that certain security and optimization problems require collaboration, global scope and broad views. We employ ensembles of weak classifiers within the network core to mitigate IP source address forgery attacks, thereby removing incentive and coordination issues surrounding existing practice. Finally, we argue for learning within the routing plane as a means to directly optimize and balance provider and user objectives. This thesis thus serves first to validate the potential for using learning methods to address several distinct problems on the Internet and second to illuminate design principles in building such intelligent systems in network architecture. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
Biological storytelling: a software tool for biological information organization based upon narrative structure
Authors: Allan Kuchinsky, Kathy Graham, David Moh, Annette Adler, Ketan Babaria, Michael L. Creech
Venue: Proceedings of the working conference on Advanced visual interfaces (2002)

The main task of molecular biologists seeking to understand the molecular basis of disease is identifying and interpreting the relationships of genes, proteins, and pathways in living organisms. While emerging technologies have provided powerful analysis tools to this end, they have also produced an explosion of data, which biologists need to make sense of. We have built software tools to support the synthesis activities of molecular biologists, in particular the activities of organizing, retrieving, using, sharing, and reusing diverse biological information. A key aspect of our approach, based upon the findings of user studies, is the use of narrative structure as a conceptual framework for developing and representing the "story" of how genes, proteins, and other molecules interact in biological processes. Biological stories are represented both textually and graphically within a simple conceptual model of items, collections, and stories.