ppxscal/embedding_network huggingface dataset:
Verifying and decoding in constant depth
Authors: Shafi Goldwasser, Dan Gutfreund, Alexander Healy, Tali Kaufman, Guy N. Rothblum
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

We develop a general approach for improving the efficiency of a computationally bounded receiver interacting with a powerful and possibly malicious sender. The key idea we use is that of delegating some of the receiver's computation to the (potentially malicious) sender. This idea was recently introduced by Goldwasser et al. [14] in the area of program checking. A classic example of such a sender-receiver setting is interactive proof systems. By taking the sender to be a (potentially malicious) prover and the receiver to be a verifier, we show that (p-prover) interactive proofs with k rounds of interaction are equivalent to (p-prover) interactive proofs with k+O(1) rounds, where the verifier is in NC0. That is, each round of the verifier's computation can be implemented in constant parallel time. As a corollary, we obtain interactive proof systems, with (optimally) constant soundness, for languages in AM and NEXP, where the verifier runs in constant parallel-time. Another, less immediate sender-receiver setting arises in considering error correcting codes. By taking the sender to be a (potentially corrupted) codeword and the receiver to be a decoder, we obtain explicit families of codes that are locally (list-)decodable by constant-depth circuits of size polylogarithmic in the length of the codeword. Using the tight connection between locally list-decodable codes and average-case complexity, we obtain a new, more efficient, worst-case to average-case reduction for languages in EXP.
Dual-workfactor encrypted key exchange: efficiently preventing password chaining and dictionary attacks
Authors: Barry Jaspan
Venue: Proceedings of the 6th conference on USENIX Security Symposium, Focusing on Applications of Cryptography - Volume 6 (1996)

Password-based key-server protocols are susceptible to password chaining attacks, in which an enemy uses knowledge of a user's current password to learn all future passwords. As a result, the exposure of a single password effectively compromises all future communications by that user. The same protocols also tend to be vulnerable to dictionary attacks against user passwords. Bellovin and Merrit[1] presented a hybrid of symmetric- and public-key cryptography called Encrypted Key Exchange (EKE) that cleanly solves the dictionary attack problem. This paper presents an extension of their ideas called dual-workfactor encrypted key exchange that preserves EKE's strength against dictionary attacks but also efficiently prevents passive password-chaining attacks.
Adaptive mesh compression in 3D computer graphics using multiscale manifold learning
Authors: Sridhar Mahadevan
Venue: Proceedings of the 24th international conference on Machine learning (2007)

This paper investigates compression of 3D objects in computer graphics using manifold learning. Spectral compression uses the eigenvectors of the graph Laplacian of an object's topology to adaptively compress 3D objects. 3D compression is a challenging application domain: object models can have > 105 vertices, and reliably computing the basis functions on large graphs is numerically challenging. In this paper, we introduce a novel multiscale manifold learning approach to 3D mesh compression using diffusion wavelets, a general extension of wavelets to graphs with arbitrary topology. Unlike the "global" nature of Laplacian bases, diffusion wavelet bases are compact, and multiscale in nature. We decompose large graphs using a fast graph partitioning method, and combine local multiscale wavelet bases computed on each subgraph. We present results showing that multiscale diffusion wavelets bases are superior to the Laplacian bases for adaptive compression of large 3D objects.
Prerendered user interfaces for higher-assurance electronic voting
Authors: Ka-Ping Yee, David Wagner, Marti Hearst, Steven M. Bellovin
Venue: Proceedings of the USENIX/Accurate Electronic Voting Technology Workshop 2006 on Electronic Voting Technology Workshop (2006)

We propose an electronic voting machine architecture in which the voting user interface is prerendered and published before election day. The prerendered user interface is a verifiable artifact-an electronic sample ballot-enabling public participation in the review, verification, usability testing, and accessibility testing of the ballot. Preparing the user interface outside of the voting machine dramatically reduces the amount and difficulty of software verification required to assure the correctness of the election result. We present a design for a high-assurance touchscreen voting machine that supports a wide range of user interface styles and demonstrate its feasibility by implementing it in less than 300 lines of Python code.
The role of pseudo-wires for layer 2 services in intelligent transport networks: Research Articles
Authors: Dieter Stoll, Wolfgang Thomas, Martin Belzner
Venue: Bell Labs Technical Journal (2007)

Pseudo-wire emulation edge-to-edge over multiprotocol label switching (MPLS) is a promising technology for layer 2 transparent service support in metro networks. It supports Ethernet private line applications such as virtual private wire services (VPWS), multipoint local area network (LAN) applications such as virtual private LAN services (VPLS), frame relay, asynchronous transfer mode (ATM), and even the emulation of time division multiplexing (TDM) services. In the case of Ethernet, this technology circumvents the disadvantages of native Ethernet-based services, such as the need for spanning trees. In combination with traffic engineered label-switched paths (LSPs), it promises support for quality of service (QoS) differentiation and traffic engineering for high-value business services. MPLS is currently viewed as the technology that could satisfy this need, but because it serves so many other purposes as well, it entails complex control plane protocols and relatively high cost. This is in opposition to operator demand for low capital expenditure (CAPEX) and operational expenditure (OPEX) cost when introducing new services. This paper presents an analysis of how TDM-based transport networks can evolve, maximizing the benefit of established transport technologies, while supporting existing layer 2 transport services as well as new services such as Internet Protocol television (IPTV) and video on demand. The paper identifies which of the mechanisms that are underlying MPLS-based pseudo-wire services are truly essential, and which could be implemented by other means and thus offer new possibilities for migration and convergence. Besides conceptual considerations, the network efficiency of alternative implementation options is analyzed and compared. &copy; 2007 Alcatel-Lucent.
Non-Threshold based Event Detection for 3D Environment Monitoring in Sensor Networks
Authors: Mo Li, Yunhao Liu, Lei Chen
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems (2007)

Event detection is a crucial task for wireless sensor network applications, especially environment monitoring. Existing approaches for event detection are mainly based on some predefined threshold values, and thus are often inaccurate and incapable of capturing complex events. For example, in coal mine monitoring scenarios, gas leakage or water osmosis can hardly be described by the overrun of specified attribute thresholds, but some complex pattern in the full-scale view of the environmental data. To address this issue, we propose a non-threshold based approach for the real 3D sensor monitoring environment. We employ energy- efficient methods to collect a time series of data maps from the sensor network and detect complex events through matching the gathered data to spatio-temporal data patterns. Finally, we conduct trace driven simulations to prove the efficacy and efficiency of this approach on detecting events of complex phenomena from real-life records.
Impact of Peer Churning in Trusted Gossiping for P2P Information Sharing
Authors: Arindam Mitra, Muthucumaru Maheswaran
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

In a recent study we proposed a trusted gossip protocol for rumor resistant information sharing in peer-to-peer networks. Experiments using trace data collected from social networks like Flickr and other data sets showed that the trusted protocol can achieve significant reductions in rumor spreading with reasonable message and processing overheads. The study, however, did not consider node churn - a continuous process of node arrival and departure. In this paper, we show through experiments that the trusted gossip protocol can continue to perform equally well with churning nodes as in no-churn situations. We examine the trusted gossip protocol using synthetic and real traces for node churning collected from the Myspace social network. Our experiments show that the trusted protocol performance is considerably resilient even to extreme churning conditions.
Applying neural networking techniques to improve performance and turnover prediction
Authors: Michael J. Zickar
Venue:  (2006)

Neural networking techniques were compared with standard regression techniques in a selection context. Neural networking models were hypothesized to outperform standard regression techniques in predicting turnover and six objective job performance metrics using a standard pre-employment assessment battery. Seven inputs, representing all independent variables, and seven outputs, representing the dependent variables, were assessed. A field sample (N = 1632) from the telecommunications industry was used. For regression models, ordinary least squares and logistic regression were used. A wide range of neural network models were tested. All neural network models examined in this study were supervised feedforward models with backpropagation of error. The number of hidden units in the neural networks were varied from 1 to 14. Three learning parameters of the networks were examined: .1, .2, and .3. Epochs of 100, 500, 1000, and 5000 were run on ten sub-samples, leading to a total of 1680 neural network analyses. Results indicated that neither regression techniques nor neural networking techniques consistently predicted turnover or job performance.
Architecture Assessment Model for System Evolution
Authors: Sutirtha Bhattacharya, Dewayne E. Perry
Venue: Proceedings of the Sixth Working IEEE/IFIP Conference on Software Architecture (2007)

Even though there has been some research on system evolution, there is no well defined vocabulary to indicate deviation of a system from desired goals. Further, there are no objective measures to indicate whether changes incorporated into a system as part of its evolution violates the integrity of the architectural design. Also, little research has been done to categorize the aspects of a software system that is subject to deviation as the system evolves. In this paper we develop a model for tracking software evolution and propose measures that will objectively indicate the extent of deviation or divergence in a software system. We also categorize the different aspects of software, changes to which can significantly impact usability as well as conceptual coherence.
Fine-Resolution Global Sea-Ice/Ocean Modeling and Data Assimilation
Authors: Julie L. McClean, Detelina Ivanova, Benjamin Giese, James Carton, Elizabeth Hunke, Mathew Maltrud
Venue: Proceedings of the HPCMP Users Group Conference (2006)

In the past two decades the rate at which the world's fastest computers perform floating point operations (flops) has increased by a factor of 10,000. This increase in computing capability has lead to advancements in short-term ocean state forecasting. Increasingly realistic model physics, advancements in the parameterizations of under-and un-resolved ocean processes, and the use of increasingly fine resolution all contribute to improvements in the veracity of the ocean model. As well, ocean data assimilation schemes have become more rigorous. These algorithms may be broadly divided into variational adjoint methods based on control theory and sequential estimation based on stochastic estimation theory.
Dynamic SMP Clusters with Communication on the Fly in SoC Technology Applied for Medium-Grain Parallel Matrix Multiplication
Authors: M. Tudruj, L. Masko
Venue: Proceedings of the 15th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (2007)

The paper presents a study of medium and coarse grain numerical computations in a new cluster-based shared memory parallel architecture oriented into implementation in "Systems on Chip" (SoC) technology. The assumed architecture is based on dynamic processor clusters, organized around shared memory modules. Fast shared data transfers between processors from different clusters are performed through communication on the fly, which is a synergy of processor switching between clusters and intracluster data reads on the fly. Dynamic processor clusters are implemented inside SoC modules additionally connected by a global inter-cluster network. The paper discusses speedup and parallelization efficiency of parallel matrix multiplication estimated by symbolic execution of program graphs. Simulation results are presented for algorithms with two kinds of data decomposition: recursive division of matrices into quadrants and division of matrices into stripes. In the quadrant-based method, elementary square sub-matrix multiplications are performed using the serial Strassen method and the communication on the fly is applied. The experiments reveal much higher efficiency of the proposed quadrant-based matrix multiplication method than that of the "stripe method, considered very efficient in conventional parallel shared memory systems.
Surfacing the Philosophical Assumptions of KM Frameworks
Authors: Jim Sheffield, Edward Lau
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

The importance of Knowledge Management in relation to the knowledge economy is well-recognised. However, successful development of KM will rely on resolving the lack of cumulativeness and conceptual integration which characterises the discipline at present. This papers addresses this research problem by developing a simple three-dimensional framework based on three "knowledge interests' found in Habermas' Knowledge and Human Interests and then applying the framework to surface the philosophical assumptions of a sample of knowledge management frameworks. Based on this analysis, implications for the use of these frameworks in both research and practice are then discussed.
Remote Visual Servoing of a Robot Manipulator via Internet2
Authors: Carmen Monroy, Rafael Kelly, Marco Arteaga, Eusebio Bugarin
Venue: Journal of Intelligent and Robotic Systems (2007)

Visual servoing is a powerful approach to enlarge the applications of robotic systems by incorporating visual information into the control system. On the other hand, teleoperation --- the use of machines in a remote way --- is increasing the number of applications in many domains. This paper presents a remote visual servoing system using only partial camera calibration and exploiting the high bandwidth of Internet2 to stream video information. The underlying control scheme is based on the image-based philosophy for direct visual servoing --- computing the applied torque inputs to the robot based in error signals defined in the image plane --- and evoking a velocity field strategy for guidance. The novelty of this paper is a remote visual servoing with the following features: (1) full camera calibration is unnecessary, (2) direct visual servoing does not neglect the robot nonlinear dynamics, and (3) the novel velocity field control approach is utilized. Experiments carried out between two laboratories demonstrated the effectiveness of the application.
Issues in designing a neutral genotype-phenotype mapping
Authors: R. Shipman, M. Shackleton
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

This paper discusses issues that arise when a redundant genotype-phenotype mapping is used in the context of a real-world application. Previous studies have suggested that a redundant mapping, which introduces neutrality into the search space, can provide a beneficial role. Many of the studies to date have concentrated on relatively abstract search spaces. In this paper we consider these issues in the context of a specific real-world application. We show that redundancy can indeed be useful, but that it must be carefully introduced with due consideration to details of the application being considered, and its associated search space. Although the details of the redundant encoding are specific to the application, we seek to deduce some heuristics that are likely to prove useful for designing genetic encodings for other problems to facilitate search for fitter phenotypes.
A Bayesian Network Hybrid Model for Representing Accident and Emergency Waiting Times
Authors: Adele H. Marshall, Louise Burns
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

The paper introduces a new modeling approach that represents the waiting times in an Accident and Emergency (A&E) Department in a UK based National Health Service (NHS) hospital. The technique uses Bayesian networks to capture the heterogeneity of arriving patients by representing how patient covariates interact to influence their waiting times in the department. Such waiting times have been reviewed by the NHS as a means of investigating the efficiency of A&E departments (Emergency Rooms) and how they operate. As a result activity targets are now established based on the patient total waiting times with much emphasis on trolley waits.
Time-Step-Size-Independent Conditioning and Sensitivity to Perturbations in the Numerical Solution of Index Three Differential Algebraic Equations
Authors: Carlo L. Bottasso, Olivier A. Bauchau, Alberto Cardona
Venue: SIAM Journal on Scientific Computing (2007)

We propose a simple preconditioning for the equations of motion of constrained mechanical systems in index three form. The scaling transformation is applied to the displacement-velocity-multiplier and to the reduced displacement-multiplier forms. The analysis of the transformed system shows that conditioning and sensitivity to perturbations become independent of the time step size, as in the case of well-behaved ordinary differential equations. The new scaling transformation is simple to implement and does not require the rewriting of the system equations as other approaches do. The theoretical analysis is confirmed by numerical examples.
Propagating collaboration: an instructional methodology for artists and engineers
Authors: Elif E. Ayiter, Selim S. Balcisoy, Murat Germen, Selcuk Artut
Venue: Proceedings of the 6th ACM SIGCHI conference on Creativity cognition (2007)

This paper reports on a transdisciplinary undergraduate university course designed to bring together fine art/visual communication design and computer science students for the creation and implementation of collaborative visual/audial projects that draw upon the specialised knowledge of both these disciplines. While an overview of syllabus and teaching methodologies is undertaken in the introduction, the focus of the paper concentrates upon an in-depth discussion and analysis of 3 specific projects that were developed by 3 distinct teams of students comprised of one artist/designer and one engineer.
Corporate leadership and the perceptions of chief executive officer computer-mediated communication effectiveness
Authors: Melissa M. Spirek
Venue:  (2006)

Chief executive officers (CEOs) spend the majority of their time in organizations communicating. Mintzberg's (1973) seminal work reported that CEOs spend up to 80% of their time communicating. It is not surprising then to find that selecting the most appropriate media channel to communicate to internal and external constituencies in the media rich environment of the 21st century is one of the greatest challenges CEOs currently face (Zeller Spirek, 2003). Although Rice noted in 1984 that the CEO is an actor interacting and providing leadership utilizing computer-mediated communication channels with varying media rich channels, the complexity of this use for the CEO and his or her organization has increased exponentially over the past two decades. Specifically this investigation responds to this predicament. This dissertation explores when, where, what and how CEOs utilize multimedia channels across a media rich continuum. The results generated with the CEOs demonstrate that media richness theory (Daft Lengel, 1984) is a fruitful framework. Findings indicate that the CEOs are stressed and these leaders seek information to conduct this communication effectively given the host of media-rich channels now available. The majority of the 60 CEO interviewees emphasized computer-mediated communication was important or absolutely necessary as a powerful communication channel. Adding to this complexity is the CEOs' personal communication needs as well. Put simply, the effective and efficient use of computers across a host of scenarios is difficult. When, where, and how to utilize computer-mediated communication in combination with other communication channels was recognized as a difficult decision-making process with salient implications for selecting one medium over another. The self-reports repeatedly document that CEOs' medium choices were associated with the degree of success in creating a shared meaning with his or her intended audience. Based upon the current investigation's findings, future research should consider responding to media richness theory's contribution to the field of communication. The findings underscore Rice (1984) and Williams, Rice, and Rogers' (1988) challenge that the skills of leadership utilizing new media communication channels must include an understanding of the user's attitude and experience, be it CEO, stakeholder, or employee.
A computer systems engineering perspective on a multi-disciplinary engineering design project
Authors: W. T. Neumann
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

The Virtual Corporation is a research initiative at Arizona State University that introduces multidisciplinary, concurrent-design techniques into the undergraduate engineering curriculum. Sponsored by the ARPA Technology Reinvestment Program and supported by industrial partners, the Virtual Corporation offers participants a unique opportunity to work with students from several academic disciplines in the design and development of a commercially-oriented product in a simulated industrial setting. For the past two academic years, the Department of Computer Science and Engineering has offered this program to upper-division students as an option to the traditional senior capstone project. This paper considers how this inter-disciplinary design approach differed from the traditional computer science capstone course and how software design paradigms were applied to other engineering disciplines in this multi-disciplinary design project. We also consider how differing perceptions of the adaptability of mechanical, electronic, and software designs affected the system design in this concurrent development environment.