ppxscal/embedding_network huggingface dataset:
Uncovering student values for hiring in the software industry
Authors: Donald Chinn, Tammy Vandegrift
Venue: Journal on Educational Resources in Computing (JERIC) (2008)

This article provides an analysis of student responses to an exercise used in a computer ethics and a software engineering course to raise awareness of issues related to hiring, including issues of professional responsibility and diversity. Students from two different universities were asked to evaluate four candidates for two positions in a fictitious software company. They then developed a set of criteria for evaluation and constructed an argument to support their choices. After discussing their choice with others in the class, students could change their hiring decisions. Students' hiring criteria were coded using emergent categories, inferences in the arguments were coded according to the criteria, and reasons for changing hiring decisions were coded. Students considered criteria that fell into five areas: technical skills, soft skills, personal traits, previous employment, and career/job considerations. Reasons for changing hiring choices included previous experience, diversity considerations, people skills, leadership skills, and reaching consensus. The article also reports inferences students made about the job candidates.
Cryptanalysis of the windows random number generator
Authors: Leo Dorrendorf, Zvi Gutterman, Benny Pinkas
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

The pseudo-random number generator (PRNG) used by the Windows operating system is the most commonly used PRNG. The pseudo-randomness of the output of this generator is crucial for the security of almost any application running in Windows. Nevertheless, its exact algorithm was never published. We examined the binary code of a distribution of Windows 2000, which is still the second most popular operating system after Windows XP. (This investigation was done without any help from Microsoft.) We reconstructed, for the first time, the algorithm used by the pseudo-random number generator (namely, the function CryptGenRandom). We analyzed the security of the algorithm and found a on-trivial attack: given the internal state of the generator, the previous state can be computed in O(223) work (this is an attack on the forward-security of the generator, an O(1) attack on backward security is trivial). The attack on the forward-security demonstrates that the design of the generator is flawed, since it is well known how to prevent such attacks. We also analyzed the way in which the generator is run by the operating system, and found that it amplifies the effect of the attacks. As a result, learning a single state may reveal 128 Kbytes of the past and future output of the generator. The implication of these findings is that a buffer overflow attack or a similar attack can be used to learn a single state of the generator, which can then be used to predict all random values, such as SSL keys, used by a process in all its past and future operation. This attack is more severe and more efficient than known attacks, in which an attacker can only learn SSL keys if it is controlling the attacked machine at the time the keys are used.
A Constructive Self-Organizing Network Applied to a Discrete Optimization Problem
Authors: Thiago A. S. Masutti, Leandro N. de Castro
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

Most discrete optimization problems belong to the NP-complete or NP-hard classes. A benchmark prob- lem to assess the performance of new heuristics to solve these classes of problems is the traveling sales- man problem (TSP). This paper proposes some modifi- cations on a self-organizing network, named RABNET- TSP, to solve TSP problems. The modified algorithm is compared, with encouraging results, to other propos- als from the literature on a number of different TSP instances.
A Novel Implementation Method for Addition and Subtraction in Residue Number Systems
Authors: D. K. Banerji
Venue: IEEE Transactions on Computers (1974)

This correspondence describes an implementation scheme for the operations of addition and subtraction in the residue number systems. The method is based on the property that the set of residues modulo m form a finite group under addition and subtraction (modulo m). The proposed adder/subtractor structure is very systematic and, hence, suitable for MSI/LSI realization.
A framework for efficient inconsistency detection in a grid and Internet-scale distributed environment
Authors: Yijun Lu, Hong Jiang
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

In this paper, we argue that a broad range of Internet-scale distributed applications can benefit from an underlying low-cost consistency detection framework - an alternative to inconsistency avoidance that can detect inconsistency among nodes sharing data or services in a timely manner. After introducing a framework of inconsistency detection, this paper presents the design and evaluation of a two-layer inconsistency detection module. The proposed two-layer inconsistency detection module is evaluated by both analysis and simulations. The results show that this framework can significantly reduce the time to detect inconsistency among nodes without adding much maintenance cost.
A Note on Division Algorithms Based on Multiplication
Authors: Z. Shaham
Venue: IEEE Transactions on Computers (1972)

The algorithm of division based on multiplication is well known [1]-[5]. It permits utilization of fast multiply hardware in the implementation of division. The algorithm defines an iterative process in which numerator and denominator are both multiplied by the same factor misuch that the denominator converges to 1 and the numerator to the quotient. Convergence can be speeded up by find
State-transition machines, revisited
Authors: David A. Schmidt
Venue: Higher-Order and Symbolic Computation (2007)

History and context are given regarding the development of the WNF-machine, the first example of a Krivine machine.
Applications of Symbolic Execution to Program Testing
Authors: J. A. Darringer
Venue: Computer (1978)

The advanced method of symbolic evaluation can be applied to program testing situations with results close to those of formal correctness proofs-but without the high cost.
Tunable Group Key Agreement
Authors: Rajesh Ingle, G. Sivakumar
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Secure group communication has various applications. Requirements for an application differ in various parameters such as tolerance times for join and leave, arrival rate, departure rate, staying period and group life time. Existing group key agreement protocols do not harness knowledge of application requirements. In this paper we present scheme for tunable group key agreement. We introduce an application class awareness concept, rekeying algorithms and novel key tree structure. We simulated periodic refresh mode, periodic batch mode and controlled periodic refresh mode. Simulation experiment clearly shows that controlled periodic refresh mode outperforms periodic refresh mode and periodic batch mode.
Strong convergence of the modified hybrid steepest-descent methods for general variational inequalities
Authors: Yonghong Yao, Muhammad Aslam Noor
Venue: Journal of Applied Mathematics and Computing (2007)

In this paper, we consider the general variational inequality GVI(F, g, C), where F and g are mappings from a Hilbert space into itself and C is the fixed point set of a nonexpansive mapping. We suggest and analyze a new modified hybrid steepest-descent method of type method un+1 = (1 - α + θn+1)Tun + αun - θn+1g(Tun) - λn+1µF(Tun), n ≥ 0. for solving the general variational inequalities. The sequence {xn} is shown to converge in norm to the solutions of the general variational inequality GVI(F, g, C) under some mild conditions. Application to constrained generalized pseudo-inverse is included. Results proved in the paper can be viewed as an refinement and improvement of previously known results.
Synthesis of Nonlinear Decision Boundaries by Cascaded Threshold Gates
Authors: J. A. Cadzow
Venue: IEEE Transactions on Computers (1968)

Abstract This paper presents a technique for generating a nonlinear decision surface that separates two finite classes of elements in n-dimensional real space. It incorporates the principle of cascaded threshold gates in evolving the required separation surface. At each stage of the design, an additional cascaded gate is added which will separate at least one new element. Necessary and sufficient conditions are developed whereby one may readily determine if two new elements may be properly separated by the addition of one cascaded threshold gate. The results are illustrated by means of numerical examples.
A Visual Selection Mechanism Based on Network of Chaotic Wilson-Cowan Oscillators
Authors: Marcos Quiles, Fabricio Breve, Liang Zhao, Roseli Romero
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

In this paper, a Visual Selection Mechanism based on a lattice of coupled chaotic Wilson-Cowan oscillators is pro- posed. The oscillators representing each object in a given visual scene are synchronized to produce a chaotic trajec- tory. Cooperation and competition mechanisms are also in- troduced to accelerate oscillating frequency of the salient object as well as to slow down other objects in the same scene. The model can not only discriminate each object among others in a given visual scene, but also deliver the focus of attention to the salient object. In comparison to other visual selection approaches, this model presents at least two new features. First, it is able to highlight objects in complex forms, including those that are non-linear sep- arable. Second, oscillators representing the salient object will jump from chaotic phase to periodic phase. This be- havior matches well to biological experiments on pattern recognition of rabbit. Computer simulations are performed and the results show that the proposed model is promising as a Selection Mechanism embedded in a Visual Attention System.
ASAP: An Advertisement-based Search Algorithm for Unstructured Peer-to-peer Systems
Authors: Peng Gu, Jun Wang, Hailong Cai
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

Most of existing search algorithms for unstructured peer-to-peer (P2P) systems share one common approach: the requesting node sends out a query and the query message is repeatedly routed and forwarded to other peers in the overlay network. Due to multiple hops involved in query forwarding, the search may result in a long delay before it is answered. Furthermore, some incapable nodes may be easily overloaded when the query traffic becomes intensive or bursty. In this paper, we present a novel content-pushing, Advertisement-based Search Algorithm for unstructured P2P systems called ASAP. An advertisement (ad in brief) is a synopsis of contents a peer tends to share, and appropriately distributed and selectively cached by other peers in the system. In ASAP, nodes proactively advertise their contents by delivering ads, and selectively store interesting ads received from other peers. Upon a request, a node can locate the destination nodes by looking up its local ads repository, and thus obtain a one-hop search latency with modest search cost. Comprehensive experimental results show that, compared with traditional query-based search algorithms, ASAP achieves much better search efficiency, and maintains system load 1 at a low level with small variances. In addition, ASAP works well under node churn.
A method for online analytical processing of text data
Authors: Akihiro Inokuchi, Koichi Takeda
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

There are increasingly visible demands for structured/ unstructured information integration and advanced analytics. However, conventional database technology has not been able to present a robust and practical implementation of a truly integrated architecture for such purposes. After working on several industrial applications (in particular, in the healthcare and life sciences area), we have identified fundamental issues and technical approaches to tackle the issues. In this paper, we propose data representations and algebraic operations for integrating semantic information (e.g., ontologies) into OLAP systems, which allow us to analyze a huge set of textual documents with their underlying semantic information. The performance of the prototype implementation has been evaluated using real world datasets, and the high scalability and flexibility of our approach have been confirmed with respect to the computation time.
Implementing Business Conversations with Consistency Guarantees Using Message-Oriented Middleware
Authors: Carlos Molina-Jimenez, Santosh Shrivastava, Nick Cook
Venue: Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (2007)

The paper considers distributed applications where interactions between constituent services take place via messages in an asynchronous environment with unpredictable communication and processing delays; further, interacting parties are not required to be on- line at the same time. Message-oriented middleware (MoM) is commonly used for connecting such loosely coupled distributed applications. Despite loose coupling, many service interactions have temporal and message validation constraints. A failure to deliver a valid message within its time constraint could cause mutually conflicting views of an interaction (one party regarding it as timely whilst the other party regarding it as untimely) leading to application level inconsistencies. In a loosely coupled system, such inconsistencies could remain undetected for a long time, requiring costly application level recovery procedures. This paper describes how synchronisation support providing multilateral consistency guarantees can be provided using the underlying MoM to prevent inconsistencies from reaching application level.
Automating DDoS experimentation
Authors: Jelena Mirkovic, Brett Wilson, Alefiya Hussain, Sonia Fahmy, Peter Reiher, Roshan Thomas, Stephen Schwab
Venue: Proceedings of the DETER Community Workshop on Cyber Security Experimentation and Test on DETER Community Workshop on Cyber Security Experimentation and Test 2007 (2007)

While the DETER testbed provides a safe environment and basic tools for security experimentation, researchers face a significant challenge in assembling the testbed pieces and tools into realistic and complete experimental scenarios. In this paper, we describe our work on automating experimentation for distributed denial-of-service attacks. We developed the following automation tools: (1) the Experimenter's Workbench that provides a graphical user interface, tools for topology, traffic and monitoring setup and tools for statistics collection, visualization and processing, (2) a DDoS benchmark suite that contains a set of diverse and comprehensive attack scenarios, (3) the Experiment Generator that combines chosen AS-level and edge-level topologies, legitimate traffic and a set of attacks into DETER-compatible scripts. Jointly, these tools facilitate easy experimentation even for novice users.
Personalized education planner (PIP): an online education ontology construction for personalized learning object annotation
Authors: Apple W. P. Fok, Horace H. S. Ip
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

Authoring education resources has long been a serious problem and seems to be a bottleneck of many education systems. Attracted by the huge amount of Web resources that can be potentially useful for multiple educational purposes, we have applied Semantic Web technology, to design and develop an ontology-driven Personalized Instruction Planner (PIP) based on a Personalized Education Ontology called PEOnto. The PIP is used as an effective tool for instruction design and annotation of education resources. This paper will present the design and prototyping of PIP, demonstrate the applicability and usage of PEOnto to support several typical teaching or learning tasks. Sharing and discussions of our work also serves to highlight not only possible future extension of PEOnto, but also key research directions for Personalized Education.
The case for precision sharing
Authors: Sailesh Krishnamurthy, Michael J. Franklin, Joseph M. Hellerstein, Garrett Jacobson
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Sharing has emerged as a key idea of static and adaptive stream query processing systems. Inherent in these systems is a tension between sharing common work and avoiding unnecessary work. Increased sharing has generally led to more unnecessary work. Our approach of precision sharing aims to share aggressively without unnecessary work. We show why "adaptive" tuple lineage is more generally applicable and use it for precisely shared static dataflows. We also show how "static" ordering constraints can be used for precision sharing in adaptive systems. Finally, we report an experimental study of precision sharing.
Training future software developers to acquire agile development skills
Authors: Chuan-Hoo Tan, Hock-Hai Teo
Venue: Communications of the ACM (2007)

Giving students experience developing and delivering large-scale systems under time constraints and shifting deadlines.
Distributed Coloring Algorithm for Wireless Sensor Networks and Its Applications
Authors: Ryouhei Kawano, Toshiaki Miyazaki
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

In this paper, we propose a distributed coloring algorithm that is commonly applicable to many optimization problems to realize wireless sensor networks (WSNs). After describing the algorithm in detail, two applications, namely sensing function allocation and time-slot allocation in the time division multiple access (TDMA) communication, are introduced. The experimental results for the applications show that the proposed algorithm effectively solves the problems in the applications.
Planar Receiver Placement for Unique Emitter Localization for Indoor Applications
Authors: Somaieh Beladi, Pubudu N. Pathirana, Peter D. Hodgson
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

This paper investigates two independent approaches to verify the necessary and sufficient condition to guarantee a unique solution for a passive emitter localization system based on time difference of arrival measurements from an array of sensors.
Is a learning classifier system a type of neural network?
Authors: Robert E. Smith, H. Brown Cribbs
Venue: Evolutionary Computation (1994)

This paper suggests a simple analogy between learning classifier systems (LCSs) and neural networks (NNs). By clarifying the relationship between LCSs and NNs, the paper indicates how techniques from one can be utilized in the other. The paper points out that the primary distinguishing characteristic of the LCS is its use of a co-adaptive genetic algorithm (GA), where the end product of evolution is a diverse population of individuals that cooperate to perform useful computation. This stands in contrast to typical GA/NN schemes, where a population of networks is employed to evolve a single, optimized network. To fully illustrate the LCS/NN analogy used in this paper, an LCS-like NN is implemented and tested. The test is constructed to run parallel to a similar GA/NN study that did not employ a co-adaptive GA. The test illustrates the LCS/NN analogy and suggests an interesting new method for applying GAs in NNs. Final comments discuss extensions of this work and suggest how LCS and NN studies can further benefit each other.
A polynomial rule for the problem of sharing delay costs in PERT networks
Authors: Javier Castro, Daniel Gómez, Juan Tejada
Venue: Computers and Operations Research (2008)

In this paper we define the weighted serial cost sharing rule for the cost allocation problem. We apply this new rule to the problem of sharing delay costs in a PERT network. This rule belongs to the Core and is the Weighted Shapley Value for a particular game. Furthermore, we present a characterization of this rule and a polynomial algorithm for its calculation.
Automaton segmentation: a new approach to preserve privacy in xml information brokering
Authors: Fengjun Li, Bo Luo, Peng Liu, Dongwon Lee, Chao-Hsien Chu
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

A Distributed Information Brokering System (DIBS) is a peer-to-peer overlay network that comprises diverse data servers and brokering components helping client queries locate the data server(s). Many existing information brokering systems adopt server side access control deployment and honest assumptions on brokers. However, little attention has been drawn on privacy of data and metadata stored and exchanged within DIBS. In this paper, we address privacy-preserving information sharing via on-demand information access. We propose a flexible and scalable system using a broker-coordinator overlay network. Through an innovative automaton segmentation scheme, distributed access control enforcement, and query segment encryption, our system integrates security enforcement and query forwarding while preserving system-wide privacy. We present the automaton segmentation approach, analyze privacy preservation in details, and finally examine the end-to-end performance and scalability through experiments and analysis.
A New Dynamic Threshold Secret Sharing Scheme from Bilinear Maps
Authors: Chen Wei, Long Xiang, Bai Yuebin, Gao Xiaopeng
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

In a (t, n) threshold secret sharing scheme, any t-out- of-n participants could recover the shared secret, and any less than t participants could get nothing about the shared secret. Most of the existing secret sharing schemes are not flexible enough for the fixed threshold. In this paper, a new dynamic threshold secret sharing scheme was proposed, which is based on bilinear maps. The basic idea of this scheme is as follows: The system is consisted of some participants and a dealer. Each participant holds only one permanent private key. The dealer is responsible to choose the shared secret, and to construct a system of linear equations by using the participants' public keys. The dynamic threshold is realized by adjusting the number of linear equations. Compared with most existing schemes, the proposed scheme is not dependent on any secure channel between the dealer and the participant. The analysis shows that this scheme could correctly reconstruct the shared secret, the security of the shared secret could be guaranteed, and the cheater could be identified easily. Moreover, because this scheme is constructed on elliptic curve, much computation overhead, storage overhead and bandwidth overhead are saved.