ppxscal/embedding_network huggingface dataset:
Computers on the College Rodeo Circuit
Authors: J. Shechter
Venue: Computer (1978)

Leaping from the saddle of a speeding horse onto a 500-pound steer and wrestling it to the ground may seem to have little to do with science or computers. Yet "bulldogging," as this event is known, as well as the sport of rodeo as a whole, depends increasingly on computer techniques. Today's rodeo athletes learn their skills in high school and college rodeos, and they perfect their abilities in private schools taught by specialists. Even the events in which these serious riders and ropers compete are likely to be scheduled, scored, and administered by computer. 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
The Valuations of the Near Octagon H4
Authors: B. De Bruyn, P. Vandecasteele
Venue: Graphs and Combinatorics (2007)

Let Hn, n &ge; 2, be the near 2n-gon on the 2-factors of a complete graph with 2n + 2 vertices. In this paper, we classify the valuations of the near octagon H4. We use this classification to study isometric full embeddings of H4 into DQ(8,2) and DH(7,4). We show that there is up to isomorphism a unique isometric full embedding of H4 into each of these dual polar spaces. Further applications are expected in the classification of dense near polygons with lines of size 3.
Critical massess: augmented virtual experiences and the xenoplastic at Australia's cold war and nuclear heritage sites
Authors: Mick Broderick, Mark Cypher, Jim Macbeth
Venue: Proceedings of the 2nd international conference on Digital interactive media in entertainment and arts (2007)

CRITICAL MASSES is a multidisciplinary pilot project that seeks to graphically represent and mediate the histories, spaces and narratives informing former nuclear installations within central Australia. These include the abandoned British atomic test sites at Emu Field and Maralinga, the ICBM/IRBM rocket launchers at Woomera, and the decommissioned US National Security Agency early-warning satellite base at Nurrungar. Significantly, each of these Cold War sites are situated in either hazardous, remote, secure and/or culturally sensitive areas and require sophisticated analysis and negotiation in order to best render their complexity for both online access and on-site tourism. A multi-tiered approach (re)creating these locations is being modeled across platforms for diverse audiences. Digital materials are being authored and designed for stand-alone DVDs, online interactive sites and archives, an immersive/simulated space for interpretation centres, and augmented/enhanced reality interfaces via GPS and mobile/handheld devices in-situ at key sites. In this presentation Murdoch University team members will demonstrate strategies for presenting audio-visual archives, remote topographies and oral histories for both virtual and physical tourists accessing these 'compromised' locales.
A Novel Method for Leader Election Algorithm
Authors: Mehdi Mirakhorli, Amir Azim Sharifloo, Maghsoud Abbaspour
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

In many distributed systems, we need a leader for coordinating other's members. In this structure, when the leader is crashed, other nodes must elect another leader. Many algorithms for leader election have proposed. In this paper, we introduce a new algorithm for leader election that reduces number of messages rather than other algorithms.
Organizational Modeling from Event logs
Authors: Tao Jin, Jianmin Wang, Lijie Wen
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

Many process mining approaches have been published, which would be helpful to process modeling, but little attempt has been made for role mining used for organizational modeling. In this paper, a method of role mining using event logs as input is introduced. We adopt cosine metrics as the similarity measurement to deduce flat organizational model by clustering people base on their similar skills. In contrast to traditional techniques (e.g., questionnaire), our approach is objective and efficient. This paper also points out some challenges for future research.
Assurance and evaluation: what next?
Authors: Steven B. Lipner
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

This talk presents some observations on the nature of system security and security assurance, and on processes that attempt to evaluate assurance. Over the past forty years, approaches to assuring software security have evolved from "penetrate and patch" through attempts to prove security to application of automated tools that help developers detect and remove potential vulnerabilities. A review of that evolution leads to some observations on the effectiveness and practicality of various approaches and to the conclusion that the most theoretically appealing approaches may not be the most practical or likely to succeed. The talk then considers the processes by which user organizations, primarily governments, have attempted to evaluate product security. A review of historic approaches to evaluation supports the conclusion that past evaluation regimes have achieved limited success. The talk suggests some attributes of approaches to evaluation better suited to the realities of processes that achieve security assurance and more likely to provide valuable information to end users.
Generalized Hypercube and Hyperbus Structures for a Computer Network
Authors: L. N. Bhuyan
Venue: IEEE Transactions on Computers (1984)

A general class of hypercube structures is presented in this paper for interconnecting a network of microcomputers in parallel and distributed environments. The interconnection is based on a mixed radix number system and the technique results in a variety of hypercube structures for a given number of processors N, depending on the desired diameter of the network. A cost optimal realization is obtained through a process of discrete optimization. The performance of such a structure is compared to that of other existing hypercube structures such as Boolean n-cube and nearest neighbor mesh computers.
Characterization of Connection Assignment of Diagnosable Systems
Authors: S. L. Hakimi
Venue: IEEE Transactions on Computers (1974)

Preparata, Metze, and Chien [1] gave necessary conditions for identification of all faulty units in a system S capable of automatic fault diagnosis. We show that these conditions are sufficient if in S no two units test each other. Necessary and sufficient conditions are also obtained for the general case when no such restriction is placed on S.
Semi-markov decision processes: Nonstandard criteria
Authors: M. Baykal-Gürsoy, K. Gürsoy
Venue: Probability in the Engineering and Informational Sciences (2007)

Considered are semi-Markov decision processes (SMDPs) with finite state and action spaces. We study two criteria: the expected average reward per unit time subject to a sample path constraint on the average cost per unit time and the expected time-average variability. Under a certain condition, for communicating SMDPs, we construct (randomized) stationary policies that are ε-optimal for each criterion; the policy is optimal for the first criterion under the unichain assumption and the policy is optimal and pure for a specific variability function in the second criterion. For general multichain SMDPs, by using a state space decomposition approach, similar results are obtained.
A Space Efficient Clustered Visualization of Large Graphs
Authors: Mao Lin Huang, Quang Vinh Nguyen
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

This paper proposes a new technique for visualizing large graphs of several ten thousands of vertices and edges. To achieve the graph abstraction, a hierarchical clustered graph is extracted from a general large graph based on the community structures which are discovered in the graph. An enclosure geometrical partitioning algorithm is then applied to achieve the space optimization. For graph drawing, we technically use the combination of a spring-embbeder algorithm and circular drawings that archives the goal of optimization of display space and aesthetical niceness. We also discuss an associated interaction mechanism accompanied with the layout solution. Our interaction not only allows users to navigate hierarchically up and down through the entire clustered graph, but also provides a way to navigate multiple clusters concurrently. Animation is also implemented to preserve users' mental maps during the interaction.
A Hybrid RST and GA-BP Model for Chinese Listed Company Bankruptcy Prediction
Authors: Ying Sai, Chenjian Zhong, Peiyao Nie
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Bankruptcy is a worldwide economic and social problem with high costs. And the high social costs associated with bankruptcy have spurred searches for better theoretical understanding and prediction capability. In this paper, we suggest a hybrid approach to Chinese listed company bankruptcy prediction, using a GA-BP (genetic algorithm and back propagation) model to construct a bankruptcy prediction model with variables derived by rough set theory (RST). An example is given to validate this model. The results show our hybrid model has higher prediction accuracy and less execution time in bankruptcy prediction when compared against GA-BP algorithm.
Readings in Scheme
Authors: Ozan S. Yigit
Venue: ACM SIGPLAN Lisp Pointers (1988)

In this edition of Readings in Scheme, there are twelve additions to the bibliography. Although there are also some corrections, I have chosen to include only the additions, rather than a complete re-print of the bibliography. Another complete re-print will take place sometime next summer. By then, I expect the bibliography to double in size.
Multiple Moving Prey Pursuit Algorithm Based on the Changeable Alliance
Authors: Yue-hai Wang, Meng-meng Zhang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

Multiple Moving Preys Cooperative Pursuit (MMPCP) problem was discussed where exists multiple random moving preys, each kind of which need different number of pursuers to circle to capture. Following the idea of "ally first, capture later", the pursuer first allies itself to others with same will and then capture the selected prey cooperatively. But in the existing algorithms the alliance, which was formed using a simple algorithm that consider the prey value only, cannot be broken once it has been established no matter how difficult the capture turn out to be and how much time has been consumed. For this problem, the concepts of assistant decision matrix, alliance cohesion, and fine are introduced. Based on these concepts, a changeable alliance based cooperative capture algorithm was proposed that improved both alliance-forming procedure and capturing procedure by allowing pursuer secede from a low-reward alliance to form other possible high-reward one. Simulation results show the feasibility and validity of the given algorithm.
Panoramic mosaicing optimization
Authors: Lionel Robinault, Stephane Bres, Serge Miguet
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

Motorized dome-type cameras, also called PTZ camera, allow the creation of panoramas. These panoramas represent the whole of the scene seen by the camera. In the case of a PTZ camera and with certain constraints, the scene seen by the camera can be considered as a sphere. The creation of a panorama consists in traversing a sphere in an exhaustive way. The acquired images are then projected on unspecified support which can be a cylinder, a cube or others. The projection of the rectangular images onto a sphere inevitably involves partial overlap between images. These overlaps lead to useless calculations. In order to limit the number of images we propose the calculation of an optimal trajectory for the camera according to intrinsic and extrinsic constraints.
Forward looking Nash equilibrium for keyword auction
Authors: Tian-Ming Bu, Xiaotie Deng, Qi Qi
Venue: Information Processing Letters (2008)

We introduce the concept of forward looking Nash equilibrium for the position auction (also called the generalized second price auction), a widely studied protocol for Internet advertisement bidding processes. We show that it has a unique solution for the position auction. Most importantly, the cost each bidder pays and the revenue of the auctioneer under the equilibrium are all equal to those under VCG mechanism. As the position auction is not an incentive compatible protocol, the fact that the forward looking Nash equilibrium results in the same payoff for everyone as in the VCG protocol justifies the practical protocol.
Mining modal scenario-based specifications from execution traces of reactive systems
Authors: David Lo, Shahar Maoz, Siau-Cheng Khoo
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Specification mining is a dynamic analysis process aimed at automatically inferring suggested specifications of a program from its execution traces. We describe a novel method, framework, and tool, for mining inter-object scenario-based specifications in the form of a UML2-compliant variant of Damm and Harels Live Sequence Charts (LSC). LSC extends the classical partial order semantics of sequence diagrams with temporal liveness and symbolic class level lifelines, in order to generate compact and expressive specifications. The output of our algorithm is a sound and complete set of statistically significant LSCs (i.e., satisfying given thresholds of support and confidence), mined from an input execution trace. We locate statistically significant LSCs by exploring the search space of possible LSCs and checking for their statistical significance. In addition, we use an effective search space pruning strategy, specifically adapted to LSCs, which enables efficient mining of scenarios of arbitrary size. We demonstrate and evaluate the utility of our work in mining informative specifications using a case study on Jeti, a popular, full featured messaging application
Video Transmission over Ad Hoc Networks Using Multiple Description Coding and Clustering-based Multiple Paths
Authors: Yuan Chen, Shengsheng Yu, Jingli Zhou, Jun Fan
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Ad hoc networks are characterized with frequent link failures and network topology change. These features result in a great challenge to transmit video over ad hoc networks. We propose a novel scheme for robust video transmission over ad hoc networks. Video stream is coded by using multiple description coding strategy and then a clustering-based multiple paths algorithm is applied for routing over ad hoc networks. The paper describes the general issues of multiple description coding and the principle of clustering-based multiple paths algorithm. Simulation results clearly demonstrate the effectiveness of this scheme for supporting error resilient video transmission over ad hoc networks.
Glyph-based Overviews of Large Datasets in Structural Bioinformatics
Authors: Aneesh Karve, Michael Gleicher
Venue: Proceedings of the 11th International Conference Information Visualization - Supplements (2007)

The exponential growth of structural bioinformatics data implies a need for visualization tools that provide informative overviews of large datasets. Nevertheless, online query interfaces and domain-specific visualization tools have neglected to provide suitable overviews. We identify four functional goals for large-scale overviews. We apply these goals to create glyph-based visualizations of query results from the Protein Data Bank.
An e-Learning collaborative RIA environment for Web Application Modeling and Code Generation
Authors: Sara Comai, Juan Carlos Preciado, Marino Linaje, Rober Morales, Fernando Sanchez
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

In the last years different methodologies have been proposed to systematize the Web development processes. Some of them are supported by CASE tools that help the user in all or in part of the phases of the application development. A number of these tools are used with didactic aims, for teaching the development process of Web applications. 4evertheless, to our knowledge, none of the currently available CASE tools neither supports the online cooperative design, nor allows the modelling of a process with the supervision of a teacher. Our technological solution is based on Rich Internet Applications (RIAs), i.e., Web applications with multimedia, high levels of interactivity, and collaborative work support. This document presents a Rich Internet application for the automatic code generation of Web applications that allows different modellers to design Web applications in a cooperative and supervised way, as well as to automatically generate its code. This work is inspired by the Web modelling language WebML.
A Fast and Secure Elliptic Curve Based Authenticated Key Agreement Protocol For Low Power Mobile Communications
Authors: Pierre E. ABI-CHAR, Abdallah MHAMED, Bachar EL-HASSAN
Venue: Proceedings of the The 2007 International Conference on Next Generation Mobile Applications, Services and Technologies (2007)

The increasing progress in wireless mobile communication has attracted an important amount of attention on the security issue. To provide secure communication for mobile devices, authenticated key agreement protocol is an important primitive for establishing session key. So far, several protocols have been proposed to provide robust mutual authentication and key establishment for wireless local area network (WLAN). In this paper we present a fast and Secure Authenticated Key Agreement (EC-SAKA) protocol based on Elliptic Curve Cryptography. Our proposed protocol provides secure mutual authentication, key establishment and key confirmation over an untrusted network. The new protocol achieves many of the required security and performance properties. It can resist dictionary attacks mounted by either passive or active networks intruders. It can resist Man-In-The Middle attack. It also offers perfect forward secrecy which protects past sessions and passwords against future compromise. In addition, it can resist knownkey and resilience to server attack. Our proposed protocol uses ElGamal signature techniques (ECEGS). We show that our protocol meets the above security attributes under the assumption that the elliptic curve discrete logarithm problem is secure. Our proposed protocol offers significantly improved performance in computational and communication load over comparably many authenticated key agreement protocols such as B-SPEKE, SRP, AMP, PAK-RY, PAK-X, SKA, LR-AKE and EC-SRP.
Document retrieval for question answering: a quantitative evaluation of text preprocessing
Authors: Gracinda Carvalho, David Martins de Matos, Vitor Rocio
Venue: Proceedings of the ACM first Ph.D. workshop in CIKM (2007)

Question Answering (QA) has been an area of interest for researchers, in part motivated by the international QA evaluation forums, namely the Text REtrieval Conference (TREC), and more recently, the Cross Language Evaluation Forum (CLEF) through QA@CLEF, that since 2004 includes the Portuguese language. In these forums, a collection of written documents is provided, as well as a set of questions, which are to be answered by the participating systems. Each system is evaluated by its capacity to answer the questions, as a whole, and there are relatively few results published that focus on the performance of its different components and their influence on the overall system performance. That is the case of the Information Retrieval (IR) component, which is broadly used in QA systems. Our work concentrates on the different options of preprocessing Portuguese text before feeding it to the IR component, evaluating their impact on the IR performance in the specific context of QA, so that we can make a sustained choice of which options to choose. From this work we conclude the clear advantage of the basic preprocessing techniques: case folding and removal of punctuation marks. For the other techniques considered, stop word removal enhanced the performance of the IR system but that was not the case as far as Stemming and Lemmatization are concerned.
Performance Evaluation of a Temporal Sequence Learning Spiking Neural Network
Authors: T. Ichishita, R. H. Fujii
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

The performance evaluation of a temporal sequence learning spiking neural network was carried out. Neural network characteristics that were evaluated included: long temporal sequence length recognition, factors that affect size of the neural network, and network robustness against random input noise. Music melodies of various lengths were used as temporal sequential input data for the evaluation. Results have shown that the spiking neural network can be made to learn inter-spike time sequences comprised of as many as 900 inter-spike times. The size of the neural network was influenced by the amount and type of random noise used during the supervised learning phase. The spiking neural network system performance was approximately 90% accurate in recognizing sequences even in the presence of various types of random noise.
News Briefs
Venue: IT Professional (2007)

CIOs Project Hiring Increase in Third Quarter
Sound reasoning about unchecked exceptions
Authors: Bart Jacobs, Peter Muller, Frank Piessens
Venue: Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods (2007)

In most software development projects, it is not feasible for developers to handle explicitly all possible unusual events which may occur during program execution, such as arithmetic overflow, highly unusual environment conditions, heap memory or call stack exhaustion, or asynchronous thread cancellation. Modern programming languages provide unchecked exceptions to deal with these circumstances safely and with minimal programming overhead. However, reasoning about programs in the presence of unchecked exceptions is difficult, especially in a multithreaded setting where the system should survive the failure of a subsystem. We propose a static verification approach for multithreaded programs with unchecked exceptions. Our approach is an extension of the Spec# verification methodology for object-oriented programs. It verifies that objects encapsulating shared resources are always ready to be disposed of, by allowing ownership transfers to other threads only through well-nested parallel execution operations. Also, the approach prevents developers from relying on invariants that may have been broken by a failure. We believe the programming style enforced by our approach leads to better programs, even in the absence of formal verification. The proposed approach enables developers using mainstream languages to gain some of the benefits of approaches based on isolated sub-processes. We believe this is the first verification approach that soundly verifies common exception handling and locking patterns in the presence of unchecked exceptions.