ppxscal/embedding_network huggingface dataset:
A matrix-splitting method for symmetric affine second-order cone complementarity problems
Authors: Shunsuke Hayashi, Takahiro Yamaguchi, Nobuo Yamashita, Masao Fukushima
Venue: Journal of Computational and Applied Mathematics (2005)

The affine second-order cone complementarity problem (SOCCP) is a wide class of problems that contains the linear complementarity problem (LCP) as a special case. The purpose of this paper is to propose an iterative method for the symmetric affine SOCCP that is based on the idea of matrix splitting. Matrix-splitting methods have originally been developed for the solution of the system of linear equations and have subsequently been extended to the LCP and the affine variational inequality problem. In this paper, we first give conditions under which the matrix-splitting method converges to a solution of the affine SOCCP. We then present, as a particular realization of the matrix-splitting method, the block successive overrelaxation (SOR) method for the affine SOCCP involving a positive definite matrix, and propose an efficient method for solving subproblems. Finally, we report some numerical results with the proposed algorithm, where promising results are obtained especially for problems with sparse matrices.
Power Saving in Regular Interconnection Networks Built with High-Degree Switches
Authors: Marina Alonso, Juan-Miguel Martinez, Vicente Santonja, Pedro Lopez, Jose Duato
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Nowadays, high-degree switches are available as building blocks of the interconnection network of clusters of PCs. An alternative to take advantage of the high number of switch ports is to connect every pair of switches through not only one but several links (this is known as link trunking in other environments). This extra connectivity can be exploited by using adaptive routing algorithms, thus improving network throughput and reducing network congestion. However with low traffic loads, all the links that compose the trunk link will not be utilized, but this idle links continue consuming power. Power consumption reduction techniques are being applied everywhere in computer systems and the interconnection network is not an exception, as its contribution is not negligible. In this paper, we present a mechanism that dynamically switches on and off network links as a function of traffic. It is specially targeted to those networks where trunk links are used. The mechanism can switch off any link, provided that network connectivity is guaranteed, (i.e. every pair of switches should be connected through at least one active link). Indeed, this restriction makes possible to use the same routing algorithm regardless the power saving actions taken, thus simplifying router design. Our simulation results show that the network power consumption can be greatly reduced, at the expense of some increase in latency. Nevertheless, it is shown that the power reduction is always higher that this latency increase.
Intelligent search strategies based on adaptive Constraint Handling Rules
Authors: Armin Wolf
Venue: Theory and Practice of Logic Programming (2005)

The most advanced implementation of adaptive constraint processing with Constraint Handling Rules (CHR) allows the application of intelligent search strategies to solve Constraint Satisfaction Problems (CSP). This presentation compares an improved version of conflict-directed backjumping and two variants of dynamic backtracking with respect to chronological backtracking on some of the AIM instances which are a benchmark set of random 3-SAT problems. A CHR implementation of a Boolean constraint solver combined with these different search strategies in Java is thus being compared with a CHR implementation of the same Boolean constraint solver combined with chronological backtracking in SICStus Prolog. This comparison shows that the addition of &ldquo;intelligence&rdquo; to the search process may reduce the number of search steps dramatically. Furthermore, the runtime of their Java implementations is in most cases faster than the implementations of chronological backtracking. More specifically, conflict-directed backjumping is even faster than the SICStus Prolog implementation of chronological backtracking, although our Java implementation of CHR lacks the optimisations made in the SICStus Prolog system.
Splat: A Network Switch/Port Configuration Management Tool
Authors: Cary Abrahamson, Michael Blodgett, Adam Kunen, Nathan Mueller, David Parter
Venue: Proceedings of the 17th USENIX conference on System administration (2003)

We present the design and implementation of Splat, a tool for managing network edge switch ports and port-to-host configurations. We discuss the need for such a tool as part of a major network upgrade, and our discovery that most existing tools ignore this area or approach it from a core network point of view.Important design considerations include the current procedures and habits of our system administration team, using open source components, and the tool's incremental development and deployment. In particular, the requirement for accurate configuration information in a database proves to be an effective means of enforcing correct procedures.Splat enables us to administer an increasingly complex network by providing a simple interface for routine tasks as well as better diagnostics, reporting, and monitoring. Its reliable configuration management enhances the security and performance of our network.
Fast eigenvalue calculations on the CDC 6000-7000 computers
Authors: Paul J. Nikolai
Venue: ACM SIGNUM Newsletter (1972)

For computing a relatively small sample of the eigenvalues of an hermitian matrix, the bisection method is justifiably popular. The procedure has been widely implemented in many programming languages for a great number of machines. In this note we show how to implement the Sturm sequence procedure, the heart of the bisection method, in ANSI FORTRAN which on a computer with a highly parallel central processing unit can yield major savings in execution time. We illustrate using FORTRAN Extended, Optimization Level 2, for the CDC 6600 for which the method is especially appropriate.
Transaction commit protocols for mobile environment: a first study
Authors: Christophe Bobineau, Cyril Labbé, Claudia Roncancio, Patricia Serrano-Alvarado
Venue: Proceedings of the 1st French-speaking conference on Mobility and ubiquity computing (2004)

We present first results on the comparison of transactional commit protocols for mobile context (2PC, UCM and CO2PC).
Behavior of the Laplacian of Gaussian Extrema
Authors: S. A. Tabbone, L. Alonso, D. Ziou
Venue: Journal of Mathematical Imaging and Vision (2005)

This paper analyses the behavior in scale space of linear junction models (L, Y and X models), nonlinear junction models, and linear junction multi-models. The variation of the grey level is considered to be constant, linear or nonlinear in the case of linear models and constant for the other models. We are mainly interested in the extrema points provided by the Laplacian of the Gaussian function. Moreover, we show that for infinite models the Laplacian of the Gaussian at the corner point is not always equal to zero.
Opportunistic Scheduling with Quantized Feedback in Wireless Networks
Authors: Yahya Al-Harthi, Ahmed Tewfik, Mohamed-Slim Alouini
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Wireless scheduling algorithm can extract multiuser diversity (MUDiv) via prioritizing the users with best current channel condition. One drawback of MUDiv is the required feedback carrying the instantiations channel rate from all active users to the access point base station. This paper shows that this feedback load is, for the most part, unjustified. To alleviate this problem, we propose an optimal discrete rate switchbased multi-user diversity system (DSMUDiv) that allows reducing the feedback load while preserving the essential of the scheme performance. We examine DSMUDiv scheme using an absolute signal-to-noise ratio (SNR)-based scheduling mechanism, assuming all users are independent identical distributed (i.i.d.). We provide a theoretical analysis of the feedback load and the spectral efficiency for the DSMUDiv scheme and compare it with the optimal (full feedback load) selective diversity scheme. Slow Rayleigh fading is assumed. Our results show a reduction in the feedback load.
The splitting concept applied to the OIL family of codes (abstract)
Authors: W. E. Johnson
Venue: ACM SIGNUM Newsletter (1975)

The genesis of the OIL code is the original Particle-in-Cell code written by Dr. Francis Harlow at the Los Alamos Scientific Laboratory (Ref. 1). The OIL code (Ref. 2) was then developed by replacing the discrete particle mass transport by a continuum, resulting in a near infinite particle representation. The TOIL code (Ref. 3) was then developed by extending the technique to two materials.
A Multi-View Approach on Modular PCA for Illumination and Pose Invariant Face Recognition
Authors: Praveen Sankaran, Vijayan Asari
Venue: Proceedings of the 33rd Applied Imagery Pattern Recognition Workshop (2004)

A modified approach on Modular PCA for face recognition is presented in this paper. The proposed changes aim to improve the recognition rates for modular PCA for face images with large variation in light and facial expression. The eyes form one of the most invariant regions on the face. A sub-image from this region is considered. Weight vectors from this region are appended to the existing weight vector for Modular PCA. The accuracies for the modified method, the original method and PCA method are evaluated under conditions of varying pose, illumination and expressions using standard face databases.
Factors limiting academic participation in the development of large mathematical software packages
Authors: Robert B. Kelman
Venue: ACM SIGNUM Newsletter (1976)

The December 1975 SIGNUM meeting of Software for Partial Differential Equations seemed to formalize a trend which over the past few years has become ever more evident. Namely, the the development of medium and large scale software packages, say anything more than five hundred statements, is a project which can no longer be carried out in a university. Such projects are now almost wholly within the province of industrial and governmental laboratories. As can be seen from the program of the meeting (ACM SIGNUM Newsletter 10, 1975; No. 4, pp. 2-3), only two our of seventeen papers came from universities and one of these two papers concerned itself with a modest size algorithm for solving systems of linear algebraic equations. The reasons for this state of affairs are not hard to find. It is expensive to develop such software, and it is not altogether appropriate in a university to tie up manpower and money in such extensive undertakings. After all, departments of mechanical engineering do not build boilers, or perhaps, since new program development involves much innovation, a more accurate analogy would be to say that departments of aeronautical engineering do not build new jetliners. Also, because of tight money and excess personnel, pressures on faculty to "Produce" have increased and producing means publishing. 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
Automated identification of technologically similar organizations: Book Reviews
Authors: Anthony Breitzman
Venue: Journal of the American Society for Information Science and Technology (2005)

This article introduces and validates a method for identifying technologically similar organizations, industries, or regions by applying the techniques from information science for term similarity to international patent classifications. Several applications of the method are explored, including identifying hidden competitive threats, finding potential acquisition targets, locating university expertise within a technology, identifying competitor strategy shifts, and more. One advantage of the method is that it is size invariant, meaning, for example, that it is possible for a huge corporation to identify smaller firms in its space before they become significant competitors. Another advantage is that technologically similar organizations can be identified on a large scale without any particular knowledge of the technology or business of either source organizations or target organizations. &copy; 2005 Wiley Periodicals, Inc.
Reconfigurable Sequential Consistency Algorithm
Authors: Christiane V. Pousa, Luis F. W. Goes, Dulcineia O. Da Penha, Carlos A. P. S. Martins
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

In this paper, we propose, implement and analyze the performance of a Reconfigurable Sequential Consistency Algorithm (RSCA) using simulation. Extending the concepts of reconfigurable devices to the algorithmic level, we model RSCA that is a reconfigurable sequential consistency algorithm for asynchronous distributed systems that manage concurrent objects stating. As our main results, we present that, on average, the performance of RSCA was 36% better than the traditional sequential consistency algorithms. The main contributions of this paper are: the definition, proposal, implementation and performance analysis of RSCA.
Skeletal Parameter Estimation from Optical Motion Capture Data
Authors: Adam G. Kirk, James F. O'Brien, David A. Forsyth
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

In this paper we present an algorithm for automatically estimating a subjectýs skeletal structure from optical motion capture data. Our algorithm consists of a series of steps that cluster markers into segment groups, determine the topological connectivity between these groups, and locate the positions of their connecting joints. Our problem formulation makes use of fundamental distance constraints that must hold for markers attached to an articulated structure, and we solve the resulting systems using a combination of spectral clustering and nonlinear optimization. We have tested our algorithms using data from both passive and active optical motion capture devices. Our results show that the system works reliably even with as few as one or two markers on each segment. For data recorded from human subjects, the system determines the correct topology and qualitatively accurate structure. Tests with a mechanical calibration linkage demonstrate errors for inferred segment lengths on average of only two percent. We discuss applications of our methods for commercial human figure animation, and for identifying human or animal subjects based on their motion independent of marker placement or feature selection.
Solution of large Hermitian eigenproblems on virtual and cache memory computers
Authors: Roy L. Streit
Venue: ACM SIGNUM Newsletter (1981)

The impact of cache and virtual memories on the performance of state-of-the-art software has not yet been fully explored. This letter documents the truth of this statement by presenting the results of a computational experiment performed on the VAX 11/780 (a computer possessing both these features) with well established and documented FORTRAN subroutines designed for high accuracy numerical solution of the ordinary Hermitian eigenproblem Az = &lambda; z. Easily implemented changes in the storage allocation of the complex matrix A resulted in roughly half an order of magnitude improvement in both elapsed CPU and wall clock time, as well as in significantly improved overall system throughput. These changes do not affect the numerical algorithm in any way.
Computation scheduling in multiprocessor real-time automatic control systems with constrained processor memory
Authors: D. S. Guz, M. G. Furugyan
Venue: Automation and Remote Control (2005)

For the automatic control systems with tight real time, construction of feasible schedules under the given job execution deadlines was considered, and in addition the constraints on processor memory were taken into consideration. Two methods were developed to solve this problem. The first method is based on reducing the original problem to the search of a multi-commodity flow in a special network. The second method offers a fast algorithm to determine a feasible schedule for the uniprocessor case.
Challenges of Model Interoperation in Military Simulations
Authors: Marko A. Hofmann
Venue: Simulation (2004)

The need for interoperability between different military simulation systems is growing fast, as the complexity of modern war fighting rises above the handling capacity of monolithic models. The development of consistent model federations has therefore become as important as the development of new (interoperable) models. However, complex military simulation systems belong to the class of model-based information systems, and the paramount aspects of such information systems are abstraction and idealization from reality. Experiments with the high-resolution combat simulation system, COSIMAC, and some modules implementing basic command and control functionality have shown that there are pressing challenges for coupling model-based information systems above the currently manageable levels. The results of this contribution indicate that technical, syntactic, and obvious semantic (lexicographic) coupling preconditions are not sufficient to guarantee a successful interaction.
Review of "Creativity in Invention and Design: Computational and Cognitive Explorations of Technological Originality by Subrata Dasgupta", Cambridge University Press, 1994.
Authors: Duane Dunkerson
Venue: ACM SIGART Bulletin (1998)

This brief book will not be much help to the day-to-day AI practitioner but could be used as a point of departure. The author is Distinguished Professor of Computer Science at the Center for Advanced Computer Studies of the University of Southwestern Louisiana. He has written four previous books about computer science. I am in sympathy with the author's intent, but I found that he cracked the concrete of his conceptual support and then left a flabby interior of amorphous specifics to be gutted by rather too sharp conclusions. The author states that creativity, especially in technology, can be discussed within a computational framework. Specifically, he concerns himself with a plausible explanation of Wilkes' invention of microprogramming in 1951. In general, the author puts forth hypotheses related to the specific which corroborate findings by others that creativity is not significantly differing from other everyday mental processes. 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
Optimized Dynamic Grid-Based DDM Protocol for Large-Scale Distributed Simulation Systems
Authors: Azzedine Boukerche, Kaiyuan Lu
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 15 - Volume 16 (2005)

Data Distribution Management (DDM) is one of the six services provided by HLA/RTI as complementarities of Declaration/Interests Management to provide a flexible and extensive mechanism for further throttling the data placed on the network and delivered to federates based on simulated entities' interests of data. DDM is of essential importance especially for large scale distributed simulations. In the past a few years, two main types of DDM protocols have been developed, named region-based methods and grid-based methods. However, all of these techniques have their obvious drawbacks, which affect their deployment in most applications that require high performance and low overhead. In our previous work, we have proposed a dynamic grid-based DDM scheme that shows a great potential when compared to both region-based and grid-based approaches. In this paper, we wish to improve our previous scheme, which we refer to as optimized dynamic grid-based DDM, to further reduce irrelevant data that might be received by simulated entites.
Secure One-Round Tripartite Authenticated Key Agreement Protocol from Weil Pairing
Authors: Chu-Hsing Lin, Hsiu-Hsia Lin
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

In 2000, Joux proposed a one-round protocol for tripartite Diffie-Hellman. In 2003, Shim presented an efficient one-round tripartite authenticated key agreement protocol based on Weil pairing to resist the man-in-the-middle attack appears in Jouxý s. In this paper, we show that Shimý s protocol still cannot withstand the insider attack and the key-compromise impersonation attack. We propose a secure one-round tripartite authenticated key agreement protocol to solve the existed problems.
Exploring Wakeup-Free Instruction Scheduling
Authors: Jie S. Hu, N. Vijaykrishnan, Mary Jane Irwin
Venue: Proceedings of the 10th International Symposium on High Performance Computer Architecture (2004)

Design of wakeup-free issue queues is becoming desirable due to the increasing complexity associated with broadcast-based instruction wakeup. The effectiveness of most wakeup-free issue queue designs is critically based on their success in predicting the issue latency of an instruction accurately. Consequently, the goal of this paper is to explore the predictability of instruction issue latency under different design constraints and to identify the impediments to performance in such wakeup-free architectures. Our results indicate that structural problems in promoting instructions to the head of the instruction queue from where they are issued in wakeup-free architectures, the limited number of candidate instructions that can be considered for instruction issue, and the resource conflicts due to non-availability of issue ports all have a significant impact in degrading the performance of broadcast free architectures. Based on these observation, we explore an architecture that attempts to overcome the structural limitations by employing traditional selection logic and by using pre-check logic to reduce the impact of resource conflicts while still employing a wakeup-free strategy based on predicted instruction issue latencies. Finally, we improve this technique by limiting the selection logic to a small segment of the issue queue.
Concept-based discovery of mobile services
Authors: Chara Skouteli, George Samaras, Evaggelia Pitoura
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

In this paper, we consider semantic service discovery in a global computing environment. We propose creating a dynamic overlay network by grouping together semantically related services. Each such group of services is termed a community. Communities are organized in a global taxonomy whose nodes are related contextually. The taxonomy can be seen as an expandable distributed semantic index over the system services, which aims at improving service discovery. Our performance results indicate that in certain cases, our service discovery mechanism outperforms even the case in which service indexes are fully replicated at all system sites.