ppxscal/embedding_network huggingface dataset:
Visual Zero: A persistent and interactive object-oriented programming environment
Authors: J. Baltasar García Perez-Schofield, Emilio García Roselló, Francisco Ortín Soler, Manuel Pérez Cota
Venue: Journal of Visual Languages and Computing (2008)

In this article, an ongoing research project held in the Computer Science department of the University of Vigo is described. Its main objective is to develop an interactive object-oriented environment, serving as a vehicle for learning object-oriented programming. It currently consists of a virtual machine, an assembler, compilers for two high-level programming languages, and an educational visual programming environment. Its main characteristics are (a) the support of prototype-based object orientation, which is a model of object orientation that actually wraps the class-based model; (b) the support for object persistence, which simplifies all input/output issues to the minimum, and (c) the availability of a new visual programming environment is an invaluable help. We the authors think that the combination of all of these possibilities, will lead to an interesting, useful tool that would be recommended for object-oriented teaching. The whole system has been successfully employed in a number of different courses, allowing students to concentrate on objects and their relationships from the very beginning, and thus helping them to achieve a high degree of knowledge about the object-oriented programming paradigm.
Adapting robot kinematics for human-arm motion recognition
Authors: Chee Seng Chan, Honghai Liu, David Brown
Venue: International Journal of Knowledge-based and Intelligent Engineering Systems (2007)

This paper presents a novel method to the analysis of human-arm motion, in particular improving the efficiency of conventional motion recognition algorithms. Contrary to the prior art methods, this research develops a framework for human-arm motion recognition where qualitative normalised templates (QNTs) is proposed to replace the conventional approaches. First of all, the conventional robotic model has been employed to build a generic vision model for a human-arm, that is we utilise the robot kinematics to construct a stick model. Secondly, the qualitative robotic model is adopted to learn and construct the QNTs where human-arm motion is termed as, whose execution is consistent and could be easily characterised by a definite space-time trajectory in configuration space. Finally, classification of the human-arm motion is achieved by comparing the QNTs to the parameters learnt with particle filter based motion tracking algorithm. Experimental evaluation has demonstrated the effectiveness of the proposed method in human-arm motion classification, and our future work is focused on extending the proposed method to recognise complex human motion, e.g. walking and running.
Parallelizing CAD: a timely research agenda for EDA
Authors: Bryan Catanzaro, Kurt Keutzer, Bor-Yiing Su
Venue: Proceedings of the 45th annual Design Automation Conference (2008)

The relative decline of single-threaded processor performance, coupled with the ongoing shift towards on chip parallelism requires that CAD applications run efficiently on parallel microprocessors. We believe that an ad hoc approach to parallelizing CAD applications will not lead to satisfactory results: neither in terms of return on engineering investment nor in terms of the computational efficiency of end applications. Instead, we propose that a key area of CAD research is to identify the design patterns underlying CAD applications and then build CAD application frameworks that aid efficient parallel software implementations of these design patterns. Our initial results indicate that parallel patterns exist in a broad range of CAD problems. We believe that frameworks for these patterns will enable CAD to successfully capitalize on increased processor performance through parallelism.
Resource Allocation Strategies in a 2-Level Hierarchical Grid System
Authors: Stylianos Zikos, Helen D. Karatza
Venue: Proceedings of the 41st Annual Simulation Symposium (anss-41 2008) (2008)

Efficient job scheduling in grids is challenging due to the large number of distributed autonomous resources. In this paper we study various resource allocation policies in a 2-level grid system. A simulation model is used to evaluate performance of these policies at the grid level and at the local level. Grid level policies include cases where the grid scheduler uses site information (deferred policy), a random policy, and a combination of the two (hybrid). Simulation results indicate that the hybrid performs better regardless of the local policy.
Three-dimensional delaunay refinement for multi-core processors
Authors: Andrey N. Chernikov, Nikos P. Chrisochoides
Venue: Proceedings of the 22nd annual international conference on Supercomputing (2008)

We develop the first ever fully functional three-dimensional guaranteed quality parallel graded Delaunay mesh generator. First, we prove a criterion and a sufficient condition of Delaunay-independence of Steiner points in three dimensions. Based on these results, we decompose the iteration space of the sequential Delaunay refinement algorithm by selecting independent subsets from the set of the candidate Steiner points without resorting to rollbacks. We use an octree which overlaps the mesh for a coarse-grained decomposition of the set of candidate Steiner points based on their location. We partition the worklist containing poor quality tetrahedra into independent lists associated with specific separated leaves of the octree. Finally, we describe an example parallel implementation using a publicly available state-of-the art sequential Delaunay library (Tetgen). This work provides a case study for the design of abstractions and parallel frameworks for the use of complex labor intensive sequential codes on multicore architectures.
Unravelling Prion Diseases Using Molecular Dynamics Simulations
Authors: Mohd Shahir Shamsir, Zeti Azura Hussein, Johan Sharif
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Human prion diseases such as Creutzfeldt–Jakob disease are neurodegenerative diseases and present as infectious, sporadic and genetic disorders. Association of bovine spongiform encephalopathy (BSE) or ‘madcow disease’ with human variant Creutzfeldt–Jakob disease (vCJD) have increased the attention on these diseases. Here we review and summarizes the use of molecular dynamics simulation to investigate the possible conformational transformation pathways of the prion protein (PrP) from its normal isoforms(PrPC) to a diseased scrapie isoforms (PrPSC). The review showed that although molecular dynamics simulations have been used in a variety of ways using various conditions such as pH, temperatures with diverse starting structures, the results showed consensus only on the creation of β-sheets within the flexible N terminal, which is one possible characteristic of the PrPC to PrPSC conversion. There is also a trend showing a research refocus from the flexible N terminal segment to the C terminal globular domain especially on second α-helix (H2), a segment linked to a cluster of point mutations.
New schemes for sharing points on an elliptic curve
Authors: Duo Liu, Dongping Huang, Ping Luo, Yiqi Dai
Venue: Computers Mathematics with Applications (2008)

A multiple secret sharing scheme can share a group of secrets in each sharing session; this scheme is deemed to be very useful in sharing important secrets. However, previously, no scheme on sharing points on an elliptic curve has been devised. In responding to the problem, this paper proposes a new (t,n) multi-point sharing scheme using self-pairing on an elliptic curve. The security of the proposed scheme was examined. Towards the end of the study, the researchers concluded that the new scheme was computationally secure if at least n-t+1 users in the scheme are honest, and if O(lgq) points at most are shared. Therefore, the threshold digital signature scheme on an elliptic curve can be designed and implemented easily.
An Identity-Based Group Key Agreement Protocol from Pairing
Authors: Hongji Wang, Gang Yao, Qingshan Jiang
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

In recent years, a large number of identity-based key agreement protocols from pairings have been proposed. Some of them are elegant and practical. However, using most of those protocols, the session key which users arrive is depended on the identity information. In this paper, we first propose a two-party identity-based key agreement protocol based on pairings whose security relies on the hardness of the bilinear Diffie-Hellman problem in the random oracle model, and the session key is independent of the identity information. After that we extend the protocol to an identity-based group key agreement protocol, which uses no broadcasting. The proposed key agreement protocol achieves the security attributes: known session key security, perfect forward secrecy, no key compromise impersonation, no unknown key share and no key control.
Active Contours Under Topology Control--Genus Preserving Level Sets
Authors: Florent Ségonne
Venue: International Journal of Computer Vision (2008)

We present a novel framework to exert topology control over a level set evolution. Level set methods offer several advantages over parametric active contours, in particular automated topological changes. In some applications, where some a priori knowledge of the target topology is available, topological changes may not be desirable. This is typically the case in biomedical image segmentation, where the topology of the target shape is prescribed by anatomical knowledge. However, topologically constrained evolutions often generate topological barriers that lead to large geometric inconsistencies. We introduce a topologically controlled level set framework that greatly alleviates this problem. Unlike existing work, our method allows connected components to merge, split or vanish under some specific conditions that ensure that the genus of the initial active contour (i.e. its number of handles) is preserved. We demonstrate the strength of our method on a wide range of numerical experiments and illustrate its performance on the segmentation of cortical surfaces and blood vessels.
Efficient network flow based ratio-cut netlist hypergraph partitioning
Authors: Sachin B. Patkar, Himanshu Sharma, H. Narayanan
Venue: Proceedings of the 2nd WSEAS International Conference on Electronics, Control and Signal Processing (2003)

We present a new efficient heuristic that finds good ratio-cut bipartitions of hypergraphs that model large VLSI netlists. Ratio cut measure is given by the ratio of the number of nets cut between two blocks and the product of the cardinality (size) of each block. Hypergraphs model VLSI netlists in a more natural fashion than do graphs. Our new heuristic may be considered a hybrid between the approaches of [10] and [12]. It makes use of maxflow-mincut algorithm as a subroutine that is invoked only a (small) constant number of times. Comparisons with the state-of-art partitioners such as hmetis [6](hmetis was run several times to yield min-cuts for diffently balanced bipartitions) show that the heuristic successfully finds better ratio-cut bipartitions in most of the cases. Although maxflow-mincut algorithms are theoretically slower than multilevel algorithm of hmetis the actual running times of our heuristic is found to be of the same order. The experiments have been conducted on ISPD98 benchmarks of sizes upto 200K cells.
GONE: an infrastructure overlay for resilient, DoS-limiting networking
Authors: Xiaoming Fu, Jon Crowcroft
Venue: Proceedings of the 2006 international workshop on Network and operating systems support for digital audio and video (2006)

With today's penetration in volume and variety of information flowing across the Internet, data and services are experiencing various issues with the TCP/IP infrastructure, most notably availability, reliability and mobility. Therefore, a critical infrastructure is highly desireable, in particular for multimedia streaming applications. So far the proposed approaches have focused on applying application-layer routing and path monitoring for reliability and on enforcing stateful packet filters in hosts or network to protect against Denial of Service (DoS) attacks. Each of them solves its own aspect of the problem, trading scalability for availability and reliability among a relatively small set of nodes, yet there is no single overall solution available which addresses these issues in a large scale. We propose an alternative overlay network architecture by introducing a set of generic functions in network edges and end hosts. We conjecture that the network edge constitutes a major source of DoS, resilience and mobility issues to the network, and propose a new solution to this problem, namely the General Internet Signaling Transport (GIST) Overlay Networking Extension, or GONE. The basic idea of GONE is to create a half-permanent overlay mesh consisting of GONE-enabled edge routers, which employs capability-based DoS prevention and forwards end-to-end user traffic using the GIST messaging associations. GONE's use of GIST on top of SCTP allows multi-homing, multi-streaming and partial reliability, while only a limited overhead for maintaining the messaging association is introduced. In addition, upon the services provided by GONE overlays, hosts are identified by their unique host identities independent of their topologies location, and simply require (de-)multiplexing instead of the traditional connection management and other complex functionality in the transport layer. As a result, this approach offers a number of advantages for upper layer end-to-end applications, including intrinsic provisioning of resilience and DoS prevention in a dynamic and nomadic environment.
A proposal for extending the eduroam infrastructure with authorization mechanisms
Authors: Gabriel López, íscar Cánovas, Antonio F. Gómez-Skarmeta, Manuel Sánchez
Venue: Computer Standards Interfaces (2008)

Identity federations are emerging in recent years in order to make easier the deployment of resource sharing environments among organizations. One common feature of those environments is the use of access control mechanisms based on the user identity. However, most of those federations have realized that user identity is not enough to offer more grained access-control and value-added services. Therefore, additional information, such as user attributes should be taken into account. This paper presents how one of those real and widely spread identity federations, eduroam, has been extended in order to make use of user attributes and to adopt authorization decisions during the access control process.
The Early Ground Offensives in Internet Governance
Authors: Kevin M. Rogers
Venue: International Review of Law, Computers and Technology (2007)

The second stage of the World Summit on the Information Society (WSIS) in Tunisia in November 2005 saw the long-standing debate over who should govern the Internet reach an apparent culmination. The vast majority of parties involved (over 10,000 people from over 170 countries) announced their acquiescence to the final agreement, which allowed ICANN to maintain responsibility for domain name allocation, while introducing a non-binding multi-stakeholder Internet Governance Forum (IGF) to be set up alongside.1 However, this current paper will show that the agreement provides limited assistance to the ongoing discussion and resolution on Internet Governance, and furthermore that unless the key players-particularly the USA-alter their stance, the Internet is in danger of fragmentation and gridlock, which is a genuine possibility unless the governance of the Internet moves to an International level away from exclusive US control. The conclusions made in Tunisia are not fully representative and the perception of US control has not been removed. Until this is revisited and altered, the Internet remains in considerable threat of break-up and potential gridlock.
Continuous software quality supervision using SourceInventory and Columbus
Authors: Tibor Bakota, Árpád Beszédes, Rudolf Ferenć, Tibor Gyimóthy
Venue: Companion of the 30th international conference on Software engineering (2008)

Several tools and methods for source code quality assurance based on static analysis finally reached a state when they are applicable in practice and recognized by the industry. However, most of these tools are used in an isolated manner and very rarely as organic parts of the quality assurance process. Furthermore, little or no help is provided in interpreting the outputs of these tools. This paper presents SourceInventory, a system for source code-based software quality assessment and monitoring, which is able to collect, store and present measurement data including metrics, coding problems and other kinds of data like bug numbers and test coverage information. It helps software developers, architects and managers to take control over their software's quality by performing continuous code scans, fault detection, coding style verification, architecture violation detection, and automatic report generation considering metric baselines.
Calibrating multi-projector cylindrically curved displays for "wallpaper" projection
Authors: Wei Sun, Irwin Sobel, Bruce Culbertson, Dan Gelb, Ian Robinson
Venue: Proceedings of the 5th ACM/IEEE International Workshop on Projector camera systems (2008)

This paper presents a novel algorithm for calibrating multiple casually placed projectors, via a single uncalibrated camera, to produce a "wallpaper" projection, which is equivalent to printing a single image onto a flat sheet of paper and pasting it to the screen. Based on a piecewise planar model, the method described here combines the advantages of global surface fitting and homographies to generate high accuracy geometric correction independent of the camera position and viewing angle. Experimental results validate the approach, achieving seamless displays with various multi-projector arrangements. The proposed calibration mechanism is applicable to both curved and planar screen surfaces and to single as well as multiple projector displays.
Modelling a quality assurance information system for product development projects with the UML approach
Authors: J. - W. Li
Venue: International Journal of Computer Integrated Manufacturing (2007)

To support the application of information technology in quality management, the current paper presents a case study of quality assurance information system modelling for product development projects in a small-to medium-sized enterprise. The object-oriented modelling approach of unified modelling language (UML) was employed. The graphical and well-defined symbols are ideal for modelling complex manufacturing operations. The modelling process was detailed through the depiction of examples for individual diagrams. Through the modelling process, the computerization of product development projects management was realized and a prototype for company-wide application of the approach was established. In addition, the model will provide manufacturers with guidance in comprehending the modelling techniques of UML for achieving computer-integrated manufacturing environments.
Rejewski's Catalog
Authors: Alex Kuhl
Venue: Cryptologia (2007)

When attacking the German Enigma cipher machine during the 1930s, the Polish mathematician Marian Rejewski developed a catalog of disjoint cycles of permutations generated by Enigma indicators. By comparing patterns that resulted from message indicators with his catalog, Rejewski was able to determine the ground settings. Well, not quite-the mapping from the disjoint cycles to the ground settings is not one-to-one. Rejewski's catalog no longer exists. This article reports on the output of a program that "recreates" the catalog and answers the question "How far from being one-to-one is the mapping?"
Fault Tolerant HAWAII Protocol for IP services in Wireless Networks
Authors: R. Gunasundari, S. Shanmugavel, K. Bakyalakshmi
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

The success of next generation wireless networks will rely much on advanced mechanisms for seamless mobility support among emerging heterogeneous technologies. Currently, Mobile IP is the most promising solution for mobility management in the Internet. Several IP micro mobility approaches have been proposed to enhance the performance of Mobile IP which supports quality of service, minimum packet loss, limited handoff delay and scalability. Recent efforts are focusing on providing seamless handover, fault tolerance, reliability and continuous end-to-end service connectivity on the move minimizing the delay and disruption period for real time applications and hence, failures that inhibit communications or result in loss of critical data will not be tolerated. The goal of this paper is to develop a Fault Tolerant HAWAII (FT- HAWAII) protocol and investigate the performance in Tree and partial Mesh routing topologies. Simulation results show that FT- HAWAII can effectively resolve the fault tolerant problem in domain based wireless access networks.
Degree sums and graphs that are not covered by two cycles
Authors: Akira Saito
Venue: Journal of Graph Theory (1999)

For a graph G, let &sigma;3(G) = min {degGx + degGy + degGz: {x, y, z} is an independent set in G}. Enomoto et al. [Enowoto et al., J Graph Theory 20 (1995), 419422] have proved that the vertex set of a 2-connected graph G of order n with &sigma;3(G) &ge; n is covered by two cycles, edges or vertices. Extending their result, we characterize the graphs of order n with &sigma;3(G) &ge; n - 1 whose vertex set is not covered by two cycles, edges, or vertices. &copy; 1999 John Wiley Sons, Inc. J Graph Theory 32: 5161, 1999
A Lagrangian, stochastic modeling framework for multi-phase flow in porous media
Authors: Manav Tyagi, Patrick Jenny, Ivan Lunati, Hamdi A. Tchelepi
Venue: Journal of Computational Physics (2008)

Many of the complex physical processes relevant for compositional multi-phase flow in porous media are well understood at the pore-scale level. In order to study CO"2 storage in sub-surface formations, however, it is not feasible to perform simulations at these small scales directly and effective models for multi-phase flow description at Darcy scale are needed. Unfortunately, in many cases it is not clear how the micro-scale knowledge can rigorously be translated into consistent macroscopic equations. Here, we present a new methodology, which provides a link between Lagrangian statistics of phase particle evolution and Darcy scale dynamics. Unlike in finite-volume methods, the evolution of Lagrangian particles representing small fluid phase volumes is modeled. Each particle has a state vector consisting of its position, velocity, fluid phase information and possibly other properties like phase composition. While the particles are transported through the computational domain according to their individual velocities, the properties are modeled via stochastic processes honoring specified Lagrangian statistics. Note that the conditional expectations of the particle velocities are different for different fluid phases. The goal of this paper is to present the general framework for this alternative modeling approach. Various one and two-dimensional numerical experiments demonstrate that with appropriate stochastic rules the particle solutions are consistent with a standard two-phase Darcy flow formulation. In the end, we demonstrate how to model non-equilibrium phenomena within the stochastic particle framework, which will be the main focus of the future work.