ppxscal/embedding_network huggingface dataset:
STRIDER: A Black-box, State-based Approach to Change and Configuration Management and Support
Authors: Yi-Min Wang, Chad Verbowski, John Dunagan, Yu Chen, Helen J. Wang, Chun Yuan, Zheng Zhang
Venue: Proceedings of the 17th USENIX conference on System administration (2003)

We describe a new approach, called Strider, to Change and Configuration Management and Support (CCMS). Strider is a black-box approach: without relying on specifications, it uses state differencing to identify potential causes of differing program behaviors, uses state tracing to identify actual, run-time state dependencies, and uses statistical behavior modeling for noise filtering. Strider is a state-based approach: instead of linking vague, high-level descriptions and symptoms to relevant actions, it models management and support problems in terms of individual, named pieces of low-level configuration state and provides precise mappings to user-friendly information through a computer genomics database. We use troubleshooting of configuration failures to demonstrate that the Strider approach reduces problem complexity by several orders of magnitude, making root cause analysis possible.
Indirect information exchange
Authors: Gamal Atallah
Venue: Netnomics (2004)

The goal of this paper is to show that when agents can engage in second-hand trading of information, some agents may not be able to exchange their information with other agents. With three agents, such foreclosure is possible only when agents can refuse to exchange information. With four or more players, foreclosure is possible even when players cannot abstain from or refuse to trade, but it does not constitute a subgame perfect equilibrium. Players can avoid being foreclosed by choosing what to trade and with whom. The results can be applied to formal and informal information sharing, file sharing systems and peer-to-peer networks.
Pose Estimation in Conformal Geometric Algebra Part I: The Stratification of Mathematical Spaces
Authors: Bodo Rosenhahn, Gerald Sommer
Venue: Journal of Mathematical Imaging and Vision (2005)

2D-3D pose estimation means to estimate the relative position and orientation of a 3D object with respect to a reference camera system. This work has its main focus on the theoretical foundations of the 2D-3D pose estimation problem: We discuss the involved mathematical spaces and their interaction within higher order entities. To cope with the pose problem (how to compare 2D projective image features with 3D Euclidean object features), the principle we propose is to reconstruct image features (e.g. points or lines) to one dimensional higher entities (e.g. 3D projection rays or 3D reconstructed planes) and express constraints in the 3D space. It turns out that the stratification hierarchy [11] introduced by Faugeras is involved in the scenario. But since the stratification hierarchy is based on pure point concepts a new algebraic embedding is required when dealing with higher order entities. The conformal geometric algebra (CGA) [24] is well suited to solve this problem, since it subsumes the involved mathematical spaces. Operators are defined to switch entities between the algebras of the conformal space and its Euclidean and projective subspaces. This leads to another interpretation of the stratification hierarchy, which is not restricted to be based solely on point concepts. This work summarizes the theoretical foundations needed to deal with the pose problem. Therefore it contains mainly basics of Euclidean, projective and conformal geometry. Since especially conformal geometry is not well known in computer science, we recapitulate the mathematical concepts in some detail. We believe that this geometric model is useful also for many other computer vision tasks and has been ignored so far. Applications of these foundations are presented in Part II [36].
Viva la brickOS
Authors: Christopher Hundersmarck, Charles Mancinelli, Michael Martelli
Venue: Journal of Computing Sciences in Colleges (2004)

With the Lego Mindstorm Robotics Command eXplorer (RCX) and the brickOS operating system as our development environment we developed various programs using C/C++ for our Real-Time Systems course at the University. The RCX is a microcomputer equipped with motors, and a variety of sensors, including (but not limited to) light, touch, sound, and temperature.
Parallel Computing for Sheet Metal Strain Analysis
Authors: Hau-L. Chan, Allan D. Spence, Matt P. Sklad
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

This paper describes an application of high performance computing for industrial sheet metal strain analysis. A grid pattern of small circles is first electrochemically etched on the surface of a sheet metal blank. The blank is then formed into the desired shape. After forming, a laser digitizer scans on the surface of the sheet metal part and collects ( X, Y, Z) coordinate points with the laser beam reflected intensity data. The scan resolution is 10,000 points per square centimetre. Using parallel data processing, each deformed circle is extracted, grouped and fitted. The strains are computed by comparing the fitting result to the original grid element dimensions.
Integrating Grid with Intrusion Detection
Authors: Fang-Yie Leu, Jia-Chun Lin, Ming-Chang Li, Chao-Tung Yang, Po-Chi Shih
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

In recent years, Distributed Denial-of-Service (DDoS) and Denial-of-Service (DoS) are the most dreadful network threats. Single-node IDS often suffers from losing its detection effectiveness and capability when processing enormous network traffic. To solve the drawbacks, we propose a Grid-based IDS, called Grid Intrusion Detection System (GIDS), which uses Grid computing resources to detect intrusion packets. For balancing detection load, Score Subtraction Approach (SSA) and Score Addition Approach (SAA) are deployed. Furthermore, to effectively detect intrusions, a two-phase packet detection process is proposed. The first phase detects logical and momentary attacks. Chronic attacks are detected in the second phase. Experiments are also performed and the results show that GIDS is truly an outstanding system in detecting attacks.
Interaction and Collaboration Using an Intelligent Collaborative Learning Environment
Authors: Robert M. Aiken, Marie-Noelle Bessagnet, Judith Israel
Venue: Education and Information Technologies (2005)

The goal of this research is to design and prototype an intelligent collaborative learning environment. Within this environment, we study synchronous interaction among group members (students) working on a problem/project. Students use an Intelligent Collaborative Support System (ICSS) and a shared activity space: the Tulka Whiteboard. Two main interaction spaces have been implemented: a planning-communication space and a production space. Dialogue and negotiation are supported through the ICSS permitting exchange and evaluation of free-text communication messages that are initiated by students choosing sentence openers from a menu. Using the whiteboard, a virtual room is dedicated to a group of students who share documents, annotations on documents, drawing tools, and text tools. Each group is provided a dynamic assessment of their collaborative skills based on a communication skills model.
An Attitude Based Cooperative Negotiation Model
Authors: Madhu Goyal
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

In multi-agent setting agent teams often encounter conflicts in agents' plans and actions. This paper presents a cooperative negotiation model (ABCON) that allows agents in a team to appropriately negotiate various options in a hostile and dynamic fire world. It shows that negotiations explore the attitudes and behaviors that help agents to manage conflict constructively. It says that cooperative negotiation is guided by the agents' dynamic assessment of alternative actions given the different scenario conditions.
Dealing with predictive-but-unpredictable attributes in noisy data sources
Authors: Ying Yang, Xindong Wu, Xingquan Zhu
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

Attribute noise can affect classification learning. Previous work in handling attribute noise has focused on those predictable attributes that can be predicted by the class and other attributes. However, attributes can often be predictive but unpredictable. Being predictive, they are essential to classification learning and it is important to handle their noise. Being unpredictable, they require strategies different from those of predictable attributes. This paper presents a study on identifying, cleansing and measuring noise for predictive-but-unpredictable attributes. New strategies are accordingly proposed. Both theoretical analysis and empirical evidence suggest that these strategies are more effective and more efficient than previous alternatives.
Coupled PDEs for Non-Rigid Registration and Segmentation
Authors: Gozde Unal, Greg Slabaugh
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

In this paper we present coupled partial differential equations (PDEs) for the problem of joint segmentation and registration. The registration component of the method estimates a deformation field between boundaries of two structures. The desired coupling comes from two PDEs that estimate a common surface through segmentation and its non-rigid registration with a target image. The solutions of these two PDEs both decrease the total energy of the surface, and therefore aid each other in finding a locally optimal solution. Our technique differs from recently popular joint segmentation and registration algorithms, all of which assume a rigid transformation among shapes. We present both the theory and results that demonstrate the effectiveness of the approach.
NetSolve/D: A Massively Parallel Grid Execution System for Scalable Data Intensive Collaboration
Authors: Micah Beck, Jack Dongarra, James S. Plank
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 10 - Volume 11 (2005)

The persistent mood of exhilaration in the research community over exponential increases in the capacity of computational resources has been tempered recently by the realization that a torrential influx of data from instruments, sensors and simulations is growing even faster than the resources needed to analyze it. The impact of this "data deluge," challenging enough by itself, is exacerbated by the fact that many data intensive projects today involve teams of collaborators spread out across geographically and organizationally distinct sites. A system that addresses these conditions must enable a community of collaborators, distributed throughout the wide area, to get responsive answers to dynamic queries and analyses applied to terascale or larger data sets. In this paper we describe the NetSolve/D system architecture which is designed to achieve this goal of data intensive on-line computing.
Software product proposals in a computer science course for non-majors
Authors: Clifton Kussmaul
Venue: Journal of Computing Sciences in Colleges (2004)

Proposals for software products can be used to structure and motivate a variety of topics in an introductory computer science course for non-majors. This concept was inspired by the author's experiences in industry and in developing a capstone project course. This paper begins by discussing some of the challenges presented by courses for non-majors. It then outlines a written proposal for a software product. Finally, it describes ways in which this concept could be integrated into different types of courses.
The Anatomy of Nanometer Timing Failures
Authors: Chuck Hawkins, Jaume Segura
Venue: Proceedings of the 10th IEEE European Symposium on Test (2005)

Timing failures have been with CMOS ICs forever. Initially, timing failures were comparatively minor, but are now are a plague in many products. This article will summarize the timing properties of the subcircuits that together affect overall timing performance. We then discuss the subtleties of real failures. Test engineers must understand the design issues to deal with IC timing failures.
Dynamic loop pipelining in data-driven architectures
Authors: Joäo M. P. Cardoso
Venue: Proceedings of the 2nd conference on Computing frontiers (2005)

Data-driven array architectures seem to be important alternatives for coarse-grained reconfigurable computing platforms. Their use has provided performance improvements over microprocessors and shorter programming cycles than FPGA-based platforms. As with other architectures, in data-driven architectures loop pipelining plays an important role to improve performance. Usually this kind of pipelining can be achieved using the dataflow software pipelining technique or other software pipelining approaches. Although performance improvements are achieved, those techniques heavily depend on the insertion of pipelining stages and thus require complex balancing efforts. Furthermore, those techniques statically define the pipelining and do not take fully advantage of the dynamic scheduling attainable by the data-driven concept. This paper presents a novel scheme to pipeline loops in data-driven architectures, orchestrated by a handshaking protocol. Using the new approach, self loop pipelining is naturally achieved. The scheme is based on duplicating cyclic hardware structures, in order they are autonomously executed, with synchronization being achieved by the data flow. It can be applied to nested loops, requires less aggressive pipeline balancing efforts than usual software pipelining techniques, and innermost loops with conditional structures can be pipelined without conservative pipelining implementationsWe show results of using the proposed technique when mapping algorithms in imperative programming languages to the PACT eXtreme Processing Platform (XPP). The results confirm improvements over the use of conventional loop pipelining techniques. Better performance and fewer resources are achieved in a number of cases.
Knowledge Discovery with SOM Networks in Financial Investment Strategy
Authors: Shu-Ching Kuo, Sheng-Tun Li, Yi-Chung Cheng, Men-Hsieu Ho
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

Recently, the recession of the global economy induces the coming of a new era of low interest-rates, which resulted in the stock market as an alternative investment channel for investors. The diversity and complication of domain knowledge existing in the stock market enhance its importance for developing a decision support system which can gather real-time pricing information for supporting decision-making in financial investment. In this study, we tackle these challenges by proposing an integrated solution on the basis of K-chart analysis and the over-whelming self-organizing map neural networks. We not only endeavor to improve the accuracy of uncovering trading signals, but also to maximize the profits of trading. The resulting decision model can help investment decision-makers of national stable funds make the most profitable decisions. In addition, financial experts can benefit from the ability of verifying or refining their tacit investment knowledge offered by the uncovered knowledge.
Robocode: using games to teach artificial intelligence
Authors: Ken Hartness
Venue: Journal of Computing Sciences in Colleges (2004)

This paper describes a game called Robocode that allows the development of virtual robots using the Java language. By incorporating an enjoyable game into an artificial intelligence class and providing students with tools for developing practical versions of the algorithms discussed in class, the students should be able to better appreciate the theory and develop greater confidence in their understanding of it.
On the Localization of Straight Lines in 3D Space from Single 2D Images
Authors: Vincenzo Caglioti, Simone Gasparini
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

The reconstruction of 3D scenes constituted by straight lines can find many applications both in Computer vision and in Mobile robotics. Most of the approaches to this problem involve either stereo-vision or the analysis of a sequence of images taken from different viewpoints: in both cases, the solution of the correspondence problem is required. This paper studies the localization of straight lines in 3D space from single 2D images, acquired by a catadioptric camera. In general, using a noncentral camera, the viewing rays starting from the points of a straight line constitute a non-planar surface: if this non-planar surface only contains one straight line, other than the viewing rays, then the straight line can univocally be localized. Some conditions for the univocal localization of straight lines are derived. A simple technique for the straight line localization is presented, and some preliminary experimental results are discussed.
Combining Variable Selection with Dimensionality Reduction
Authors: Lior Wolf, Stan Bileschi
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

This paper bridges the gap between variable selection methods (e.g., Pearson coefficients, KS test) and dimensionality reduction algorithms (e.g., PCA, LDA). Variable selection algorithms encounter difficulties dealing with highly correlated data, since many features are similar in quality. Dimensionality reduction algorithms tend to combine all variables and cannot select a subset of significant variables. Our approach combines both methodologies by applying variable selection followed by dimensionality reduction. This combination makes sense only when using the same utility function in both stages, which we do. The resulting algorithm benefits from complex features as variable selection algorithms do, and at the same time enjoys the benefits of dimensionality reduction.
Automatic PC board routing cleanup procedures
Authors: R. J. Smith, R. N. Castleton, W. J. Kaminsky
Venue: ACM SIGDA Newsletter (1976)

Automatic routing programs produce layouts which contain features that could be improved. This paper describes straightforward techniques for layout improvement that are routing algorithm independent.
Analytically Solving Radial Distortion Parameters
Authors: Simone Graf, Tobias Hanning
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

Most camera calibration algorithms consider parameters that define the lens distortion mapping. The usual way to determine these parameters is to minimize a nonlinear optimization problem in the final step of a calibration algorithm. This neglects the fact that given the projection matrix and the calibration data the parameters of a radial distortion can be determined analytically. In this article we show that the problem can be solved in a closed form. We present an algorithm in which this is done and compare it to classic approaches.
Reviews of "LISPcraft by Robert Wilensky", W. W. Norton & Company Inc, 1984.
Authors: D. Sriram
Venue: Issue 90 (October 1984) (1984)

Traditionally, LISP has been the language for AI researchers, It has a number of unique features for the kind of programming that AI demands. However, till recently its use in the industry was restricted because the language is not standardized and many variations of the language exists. The MACLISP and INTERLISP versions were extensively used in earlier AI work. With the increasing popularity of the UNIX operating system, FranzLISP is currently being used in a number of projects.
A 5 dof Haptic Interface for Pre-operative Planning of Surgical Access in Hip Arthroplasty
Authors: N. G. Tsagarakis, D. G. Caldwell
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

The sense of touch is crucial for medical training. Generic haptic devices such as the Impulse engine and the PHANToM device have been used in various medical simulations particularly in minimally invasive surgery (MIS) applications. Each of these instruments forms a useful first step in providing haptic feedback for surgical simulation but mostly their facilities are currently limited to MIS. In this paper we present the application of a desktop haptic interface in the pre-operative planning of the open surgery procedure for total hip replacement (THR) with particular focus on the planning of the incision position and size required to gain the access to the hip joint.
Double covers of cubic graphs with oddness 4
Authors: Roland Häggkvist, Sean McGuinness
Venue: Journal of Combinatorial Theory Series B (2005)

We prove that a cubic 2-connected graph which has a 2-factor containing exactly 4 odd cycles has a cycle double cover.
Analysis of Design Considerations for Optimizing Multi-Channel MPI over InfiniBand
Authors: Lei Chai, Sayantan Sur, Hyun-Wook Jin, Dhabaleswar K. Panda
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 9 - Volume 10 (2005)

Modern day MPI implementations provide several communication channels for optimizing performance. To obtain the best performance for the most demanding contemporary applications, it becomes critical to manage these communication channels efficiently. Various issues related to overhead for message discovery and thresholds for choosing different channels need to be considered for designing the MPI layer. It is not a trivial task to choose these parameters since application characteristics and demands from the MPI layer vary widely. In this paper we try to address these issues. We propose several different schemes such as static priority and dynamic priority to efficiently implement channel polling. Our results indicate that we can reduce intranode latency by up to 12% and message discovery time up to 45%. Further, we explore several different methodologies to choose appropriate thresholds for different channels.
Automatic generation of symbolic model for parameterized synchronous systems
Authors: Wei-Wen Xu
Venue: Journal of Computer Science and Technology (2004)

With the purpose of making the verification of parameterized system more general and easier, in this paper, a new and intuitive language PSL (Parameterized-system Specification Language) is proposed to specify a class of parameterized synchronous systems. From a PSL script, an automatic method is proposed to generate a constraint-based symbolic model. The model can concisely symbolically represent the collections of global states by counting the number of processes in a given state. Moreover, a theorem has been proved that there is a simulation relation between the original system and its symbolic model. Since the abstract and symbolic techniques are exploited in the symbolic model, state-explosion problem in traditional verification methods is efficiently avoided. Based on the proposed symbolic model, a reachability analysis procedure is implemented using ANSI C++ on UNIX platform. Thus, a complete tool for verifying the parameterized synchronous systems is obtained and tested for some cases. The experimental results show that the method is satisfactory.