ppxscal/embedding_network huggingface dataset:
The state of the email address
Authors: Mike Afergan, Robert Beverly
Venue: ACM SIGCOMM Computer Communication Review (2005)

Electronic mail is an unquestionably vital component of the Internet infrastructure. While the general perception of email is that it "just works," surprisingly little data is available to substantiate this claim. While SMTP is a mature technology of over twenty years, the architecture is increasingly strained by both normal and unsolicited load. In this paper we seek to provide a greater understanding of the behavior of Internet email as a system using active measurement.In order to survey a significant, diverse, and representative set of Internet SMTP servers, to which we have no administrative access, we develop a testing methodology that provides an email "traceroute" mechanism. Using this mechanism, we measure email loss, latency, and errors over the course of a month to popular, random, and Fortune 500 domains. Our initial results are quite unexpected and include non-trivial loss rates, latencies longer than days, and significant and surprising errors. While we present plausible explanations for some of these phenomena, there are several that we cannot, as of yet, explain. By better understanding Internet protocols which lack explicit end-to-end connection semantics, our eventual hope is to derive guidelines for designing future networks and more reliable email systems.
Design and Implementation of a Robot Soccer Team Based on Omni-Directional Wheels
Authors: Nadir Ould-Khessal
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

This paper describes work currently underway in building a robotic soccer team at Vaasa Polytechnic (BOTNIA).This contribution emphasis the design and implementation of a set of five robots based on Omni-directional wheels.At the time of writing this paper, a set of five omni-directional robots have been designed and used in the testing and implementation of a cooperative robotic system for RoboCup games.
Pareto-Optimal Hardware for Substitution Boxes
Authors: Nadia Nedjah, Luiza de Macedo Mourelle
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

In this paper, we propose a methodology based on genetic programming to automatically generate hardware designs of substitution boxes necessary for many cryptosystems such as DES encryption system. We aim at evolving minimal hardware specifications, which minimise both space (i.e. required gate number), response time (i.e. encryption and decryption time) and dissipated power. We compare our results against existing and well-known designs, which were produced by human designers using conventional methods.
Analysing the Java package-access concepts in Isabelle-HOL: Research Articles
Authors: Norbert Schirmer
Venue: Concurrency and Computation: Practice Experience (2004)

Java access modifiers and packages provide a mechanism to restrict access to members and types, as an additional means of information hiding beyond the purely object-oriented concept of classes. In this paper we clarify the semantics of access modifiers and packages by adding them to our formal model of Java in the theorem prover Isabelle&sol;HOL. We analyse which properties we can rely on at runtime, provided that the program has passed the static accessibility tests. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Data scheduling for multi-item and transactional requests in on-demand broadcast
Authors: Nitin Prabhu, Vijay Kumar
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

Recent advances in mobile computing and wireless communication have enabled the deployment of broadcast based information systems such as, wireless internet, traffic information, etc. The users and research community have recognized its potential for meeting the growing information demands of the future. At present existing systems are mainly pull-based (on-demand) and their performance highly depends on the broadcast schedule they use. Previous studies in on-demand scheduling have focused mainly on single item requests to keep the investigation simple. However, scheduling algorithms for single item request are unable to manage efficiently multi-item requests which are becoming more common. In addition to this these more and more requests are becoming transactional in nature. In this paper we take into consideration these requirements and study scheduling problems arising in on-demand broadcast environment and propose an efficient algorithm. We report its performance and demonstrate that our algorithm successfully manage multi-item simple and transactional requests and significantly reduces the wait time, tuning time and avoids transaction aborts.
A simple variable step size LMS adaptive algorithm: Research Articles
Authors: Tarek I. Haweel
Venue: International Journal of Circuit Theory and Applications (2004)

A new LMS based variable step size adaptive algorithm is presented. The step size is incremented or decremented by a small positive value, whenever the instantaneous error is positive or negative, respectively. The algorithm is simple, robust and efficient. It is characterized by fast convergence and low steady state mean squared error. The performance of the algorithm is analysed for a stationary zero-mean white-Gaussian input. MC simulations are provided to demonstrate its improved performance over the conventional LMS (Proc. IEEE 1976; 64:1151&ndash;1162) and some other variable step size adaptive algorithms (IEEE Trans. Signal Process. 1992; 40:1633&ndash;1642; IEEE Trans. Signal Process. 1997; 45:631&ndash;639) within a range of statistical environments. For a non-stationary input, the proposed algorithm behaves similar to these algorithms. A modified version of the algorithm is presented to perform in the presence of abrupt changes. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Introductory-level computer science courseware
Authors: Jeremiah S. Hill, Mike O'Neal
Venue: Journal of Computing Sciences in Colleges (2005)

A goal of every computer science department is to maintain a top-notch educational program in order to prepare its graduates for successful careers in the computing field. Most programs now couple traditional educational methods with more modern techniques such as active and team-based learning environments, online course materials and computer-based laboratories. Most educators see this coalescence of traditional and modern learning techniques as critical to providing well-rounded educational experiences for its students.The goal of this paper is to present an overview of a computer-based laboratory environment, named Watson, and to compare Watson to other courseware modules that have been designed for the same target audience.Watson is used at Louisiana Tech University to support an active, team-based learning environment for first-year computer science majors, and non-majors interested in computer science. The Watson labs are an integral component of a breadth-first introduction to computing that is required of all computer science majors and open to non-majors. Watson development is an ongoing, long-term project that has been sponsored by both Louisiana Tech University and the National Science Foundation.
Symmetric (4, 4)-nets and generalized Hadamard matrices over groups of order 4
Authors: Masaaki Harada, Clement Lam, Vladimir D. Tonchev
Venue: Designs, Codes and Cryptography (2005)

The symmetric class-regular (4, 4)-nets having a group of bitranslations G of order four are enumerated up to isomorphism. There are 226 nets with G ≅ Z2 × Z2, and 13 nets with G ≅ Z4. Using a (4, 4)-net with full automorphism group of smallest order, the lower bound on the number of pairwise non-isomorphic affine 2-(64, 16, 5) designs is improved to 21,621,600. The classification of class-regular (4, 4)-nets implies the classification of all generalized Hadamard matrices (or difference matrices) of order 16 over a group of order four up to monomial equivalence. The binary linear codes spanned by the incidence matrices of the nets, as well as the quaternary and Z4-codes spanned by the generalized Hadamard matrices are computed and classified. The binary codes include the affine geometry [64, 16, 16] code spanned by the planes in AG(3, 4) and two other inequivalent codes with the same weight distribution. These codes support non-isomorphic affine 2-(64, 16, 5) designs that have the same 2-rank as the classical affine design in AG(3, 4), hence provide counter-examples to Hamada's conjecture. Many of the F4-codes spanned by generalized Hadamard matrices are self-orthogonal with respect to the Hermitian inner product and yield quantum error-correcting codes, including some codes with optimal parameters.
How oversight improves member-maintained communities
Authors: Dan Cosley, Dan Frankowski, Sara Kiesler, Loren Terveen, John Riedl
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

Online communities need regular maintenance activities such as moderation and data input, tasks that typically fall to community owners. Communities that allow all members to participate in maintenance tasks have the potential to be more robust and valuable. A key challenge in creating member-maintained communities is building interfaces, algorithms, and social structures that encourage people to provide high-quality contributions. We use Karau and Williams' collective effort model to predict how peer and expert editorial oversight affect members' contributions to a movie recommendation website and test these predictions in a field experiment with 87 contributors. Oversight increased both the quantity and quality of contributions while reducing antisocial behavior, and peers were as effective at oversight as experts. We draw design guidelines and suggest avenues for future work from our results.
Proceedings of the 14th international conference on World Wide Web
Venue: International World Wide Web Conference (2005)

Welcome to Japan and WWW2005. This is the 14th conference in the series that was started by Robert Cailliau in Geneva in 1994. It is also worth noting that the conference has now been held in each of the three major W3C host countries (USA, France, and Japan).This year's conference maintains the traditional 1:3:1 format including: a day of tutorial and workshop sessions, three days of keynotes, paper tracks and poster presentations as well as the special W3C track, and finishes with Developers' Day.Once again we are delighted to have Tim Berners-Lee deliver the opening keynote and to be followed by four internationally distinguished speakers in the other plenary session slots. This year Developers' Day also begins with a special keynote address.
NATIONAL CENTER FOR COMPUTER CRIME DATA
Authors: James A. Schweitzer
Venue: ACM SIGSAC Review (1987)

The National Center for Computer Crime Data is a research institute which studies and reports on means to facilitate the prevention, detection, investigation, and prosecution of computer crime. (Computer crime is defined broadly by the Center, and includes all crimes perpetrated through the use of computers and all crimes where damage is done to computers or their components.)
Affine Object Tracking with Kernel-Based Spatial-Color Representation
Authors: Haihong Zhang, Weimin Huang, Zhiyong Huang, Liyuan Li
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

This paper presents a new visual tracking method that can achieve accurate estimation of affine transformation and precise spatial-color representation. The estimation of transformation provides more information than translation for better motion understanding and also helps maintain the precise representation; the precise representation enables tracking objects in highly-cluttered environment. The basis of the method is a kernel-based similarity measure called affine matching that describes the relationship between image regions with respect to affine transformation parameters. Based on the similarity measure, a mathematical solution is derived for estimating the transformation parameters for moving objects in videos. Various experiments have yielded positive results.
Does spelling matter in instant messaging?: answers from measuring error correction frequency
Authors: Jeffrey D. Campbell
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Although Instant Messaging (IM) is widely perceived as a communication mode with relaxed spelling and grammar rules, three measures show that people still perceive errors and often correct them. In two usability studies with different tasks, participants on average corrected 89 and 95 percent of their typographical and grammatical errors that they identified. However, their self-correction rates were substantially lower and more variable when compared to all errors found by independent proofreaders. The results from the second measurement showed that participants were aware of their own errors. They judged their own error rate to be significantly higher than the other person's even when that was not true. Using the third measure, correction rates in IM were found to be lower than "normal" typing. The self-sensitivity to errors prompts further investigation of techniques for error detection and correction appropriate for IM's rapid pace and relaxed linguistic register.
Evaluation of Impulse Response-Based BIST Techniques for MEMS in the Presence of Weak Nonlinearities
Authors: A. Dhayni, S. Mir, L. Rufer
Venue: Proceedings of the 10th IEEE European Symposium on Test (2005)

Microsystems are usually affected by multiple failure sources. A faulty behavior caused by different types of defects and failure sources can exhibit small functional errors that are difficult to detect using structural testing. From here stems the necessity to apply specification-based functional testing on the basis of a method that carries enough information about the physical behavior of the Device Under Test (DUT). Such a method can be attained by the Impulse Response (IR) measurement of the linear DUT. In this paper we explain three existing techniques to measure the IR of Linear Time-Invariant (LTI) devices. Weak nonlinearities that can be caused by system nonidealities and measurement distortions are considered. Only simple techniques that do not require the presence of a Digital Signal Processor (DSP) on-chip are considered. A detailed comparison between these techniques is carried out to demonstrate our choice for a BIST (Built-In Self-Test) approach.
Incorporating a fault categorization and analysis process in the software build cycle
Authors: Carol Masuck
Venue: Journal of Computing Sciences in Colleges (2005)

Much research has been carried out to study the correlations between software faults and other variables including complexity, time, size, etc. Little work, however, has studied the cause of faults in software and how recognizing the type of fault can improve the quality of software code. In this paper I review a programming technique that requires programmers to both categorize and understand the reason for any faults at each iterative build. Using this technique, experiments were carried out that measured software quality along three variables: total number of faults, total time taken to write the code, and total number of builds. The data collected suggests that all three measured variables improve when programmers take the time to categorize and understand the reason for a fault at build time. The output is particularly interesting because while fault analysis in itself is a time consuming process, the act of fault analysis by the programmer allowed him/her to complete the work in less total time.
FavGene 2.0: Perl and MYSQL system for exploring a set of "favorite genes"
Authors: Steve Benz, Robert Grossman
Venue: Journal of Computing Sciences in Colleges (2004)

Genomics is an emerging interdisciplinary field comprised of researchers in biology and computer science. The computer-assisted applications to biology enable the analysis of billions of base pairs of DNA sequences from all of the various genome sequencing projects. This work presents our current software and system design efforts to allow researchers to study their "favorite genes."
Boolean operations on 3D selective Nef complexes: optimized implementation and experiments
Authors: Peter Hachenberger, Lutz Kettner
Venue: Proceedings of the 2005 ACM symposium on Solid and physical modeling (2005)

Nef polyhedra in d-dimensional space are the closure of half-spaces under boolean set operation. In consequence, they can represent non-manifold situations, open and closed sets, mixed-dimensional complexes and they are closed under all boolean and topological operations, such as complement and boundary. They were introduced by W. Nef in his seminal 1978 book on polyhedra.We presented in previous work a new data structure for the boundary representation of three-dimensional Nef polyhedra with efficient algorithms for boolean operations. These algorithms were designed for correctness and can handle all cases, in particular all degeneracies. To this extent we rely on exact arithmetic to avoid well known problems with floating-point arithmetic.In this paper, we present important optimizations for the algorithms. We describe the chosen implementations for the point-location and the intersection-finding subroutines, a kd-tree and a fast box-intersection algorithm, respectively. We evaluate this optimized implementation with extensive experiments that supplement the runtime analysis from our previous paper and that illustrate the effectiveness of our optimizations. We compare our implementation with the ACIS CAD kernel and demonstrate the power and cost of the exact arithmetic in near-degenerate situations.The implementation was released as Open Source in the CGAL release 3.1 in December 2004.
AES Power Attack Based on Induced Cache Miss and Countermeasure
Authors: Guido Bertoni, Vittorio Zaccaria, Luca Breveglieri, Matteo Monchiero, Gianluca Palermo
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

This paper presents a new attack against a software implementation of the Advanced Encryption Standard. The attack aims at flushing elements of the SBOX from the cache, thus inducing a cache miss during the encryption phase. The power trace is then used to detect when the cache miss occurs; if the miss happens in the first round of the AES then the information can be used to recover part of the secret key. The attack has been simulated using the Wattch simulation framework and a simple software implementation of AES (using a single table for the SBOX). The attack can be easily extended to more sophisticated versions of AES with more than one table. Eventually, we present a simple countermeasure which does not require randomization.
Global identification of storage objects in network attached storage
Authors: Iliya Georgiev, Kiril Boyanov, Ivo Georgiev
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

Network attached disk storage is an independent Internet node and provides geographical distribution, mutual identification and exchange of storage objects. The paper describes a method for global identification of storage objects and a structure of object registry. For the identification word-wide unique identifiers are generated by double hash transformation based on the Advanced Encryption Standard (Rijndael) with no collisions.
Mobile multimedia services
Authors: Behzad Shahraray, Wei-Ying Ma, Avideh Zakhor, Noboru Babaguchi
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

This panel will mainly focus on the role that media processing can play in creating mobile communications, information, and entertainment services. A major premise of our discussion is that media processing techniques go beyond compression and can be employed to monitor, filter, convert, and repurpose information. Such automated techniques can serve to create personalized information and entertainment services in a cost-effective way, adapt existing content for consumption on mobile devices, and circumvent the inherent limitations of mobile devices. Some examples of the applications of media processing techniques for mobile service generation will be given.
Accurate Sum and Dot Product
Authors: Takeshi Ogita, Siegfried M. Rump, Shin'ichi Oishi
Venue: SIAM Journal on Scientific Computing (2005)

Algorithms for summation and dot product of floating-point numbers are presented which are fast in terms of measured computing time. We show that the computed results are as accurate as if computed in twice or K-fold working precision, $K\ge 3$. For twice the working precision our algorithms for summation and dot product are some 40% faster than the corresponding XBLAS routines while sharing similar error estimates. Our algorithms are widely applicable because they require only addition, subtraction, and multiplication of floating-point numbers in the same working precision as the given data. Higher precision is unnecessary, algorithms are straight loops without branch, and no access to mantissa or exponent is necessary.
Amalgamation in the semantics of CASL
Authors: Lutz Schröder, Till Mossakowski, Andrzej Tarlecki, Bartek Klin, Piotr Hoffman
Venue: Theoretical Computer Science (2005)

We present a semantics for architectural specifications in the Common Algebraic Specification Language (CASL), including an extended static analysis compatible with model-theoretic requirements. The main obstacle here is the lack of amalgamation for CASL models. To circumvent this problem, we extend the CASL logic by introducing enriched signatures, where subsort embeddings form a category rather than just a preorder. The extended model functor satisfies the amalgamation property as well as its converse, which makes it possible to express the amalgamability conditions in the semantic rules in static terms. Using these concepts, we develop the semantics at various levels in an institution-independent fashion. Moreover, amalgamation for enriched CASL means that a variety of results for institutions with amalgamation, such as computation of normal forms and theorem proving for structured specifications, can now be used for CASL.
A systematic method to solve the Rubik's cube problem
Authors: Serge Abiteboul, Gerard Medioni
Venue: Issue 78 (October 1981) (1981)

We present here a method to solve the Rubik's cube problem that has the advantage of being systematic and of relying on a small set of basic transformations. It was developed independently of any other studies.
Characteristic sets for ordinary differential equations
Authors: M. V. Kondratieva, A. I. Ovchinnikov
Venue: Programming and Computing Software (2005)

In this paper, the problem of the construction of a characteristic set in the sense of Kolchin for a radical differential ideal is considered. Algorithms for constructing such sets in the ordinary case for arbitrary radical differential ideals, which are based on the estimate of the orders of their elements, are presented. These algorithms are applicable in the case of an orderly ranking on the set of the derivatives. Advantages of the regular and characteristic decompositions of radical differential ideals are discussed.