ppxscal/embedding_network huggingface dataset:
Computer Organization and Architecture and the Laboratory Sequence
Authors: O. Garcia
Venue: Computer (1977)

In November of 1976, the Computer Society's Model Curricula Subcommittee issued a report on "A Curriculum in Computer Science and Engineering." Two subject areas of that curriculum are summarized here: computer organization and architecture, and the associated laboratory sequence. The ensuing paragraphs provide some insight into the rationale which governed the committee's choice of topics and courses, taking into account the diverse opinions of its contributors and, in particular, the thorny question of how to bridge the hardware/software gap. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Computer Graphics, Interactive Techniques, and Image Processing 1970-1975: A Bibliography
Authors: U. W. Pooch
Venue: Computer (1976)

Computer graphics, interactive techniques, and image processing are among the developments in the constantly evolving computer science field that impact the potential user ever more rapidly. This bibliography attempts to compile all articles, books, conference papers, and technical reports about computer graphics and man-machine interaction that have been published in English from 1970 to 1975. Because the literature pertaining to computer graphics and man-machine interaction is immense, this bibliography will no doubt be incomplete. Suggestions and contributions for future supplements to the bibliography should be sent to the compiler.
Frameworks for Enterprise Architecture
Authors: Hanifa Shah, Mohamed El Kourdi
Venue: IT Professional (2007)

Enterprise architecture addresses the double challenge of increasing IT efficiency while continuing business innovation. Organizations can use enterprise architecture frameworks to manage system complexity and align business and IT resources.
A scalable and flexible web services authentication model
Authors: Pedro Felix, Carlos Ribeiro
Venue: Proceedings of the 2007 ACM workshop on Secure web services (2007)

The WS-* specification set defines a message authentication model for web services. This model targets the authentication of messages exchanges in large scale decentralized systems, composed by different authentication domains. However, it has scalability and flexibility limitations: the acquirement of identity claims requires online interactions with security token services, which introduces communication overhead and creates performance bottlenecks; the services' policies, containing its requirements, must directly point to the issuing security token services, limiting the flexibility of the trust relations. We present a new model, addressing these limitations, using two concepts from the trust management paradigm: credentials for claim inference and claim-based issuer references (attribute based delegation). We show how credentials are used both to increase the scalability, reducing the number of online token requests, and to increase the flexibility by allowing indirect trust relations, namely claim based delegation. We also show how the simultaneous usage of security tokens and credentials results in several advantages of our model, when compared to credential only trust management models. The proposed model fits nicely into the WS-* framework, namely into its message security model and policy language. We illustrate this with the implementation of an extension to the Windows Communication Foundation - a commercial grade web services platform - that provides support for this model.
Fractional partial differential equations and modified Riemann-Liouville derivative new methods for solution
Authors: Guy Jumarie
Venue: Journal of Applied Mathematics and Computing (2007)

The paper deals with the solution of some fractional partial differential equations obtained by substituting modified Riemann-Liouville derivatives for the customary derivatives. This derivative is introduced to avoid using the so-called Caputo fractional derivative which, at the extreme, says that, if you want to get the first derivative of a function you must before have at hand its second derivative. Firstly, one gives a brief background on the fractional Taylor series of nondifferentiable functions and its consequence on the derivative chain rule. Then one considers linear fractional partial differential equations with constant coefficients, and one shows how, in some instances, one can obtain their solutions on bypassing the use of Fourier transform and/or Laplace transform. Later one develops a Lagrange method via characteristics for some linear fractional differential equations with nonconstant coefficients, and involving fractional derivatives of only one order. The key is the fractional Taylor series of non differentiable function f(x+h) = Eα (hαDαx) f(x).
A GA Retransmission Model for Energy-Efficient Reliable Delivery in Wireless Sensor Networks
Authors: Zhang Xi-yuan, Zhao Hai, Sun Pei-gang, Zhu Jian, Cheng Dawei, Zhu Siyuan
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

How to satisfy the requirement of high reliability and actualize energy-efficient data transmission in wireless sensor networks is an important problem. After analyzing traditional reliable transfer model of MAC layer, a new Group-based Acknowledgement model, which is efficiency centric, is brought forward to guarantee reliable transfer. Theory analysis shows that this model can reduce redundant information in the data transfer effectively and improve the utilization efficiency of the whole network, which will save lots of energy. And the performance of Group-based Acknowledgement model has been tested through experiment on Micaz platform, which proves that the new model is more suitable for the application of resource limited sensor networks.
Approximate personal name-matching through finite-state graphs
Authors: Carmen Galvez, Félix Moya-Anegón
Venue: Journal of the American Society for Information Science and Technology (2007)

This article shows how finite-state methods can be employed in a new and different task: the conflation of personal name variants in standard forms. In bibliographic databases and citation index systems, variant forms create problems of inaccuracy that affect information retrieval, the quality of information from databases, and the citation statistics used for the evaluation of scientists' work. A number of approximate string matching techniques have been developed to validate variant forms, based on similarity and equivalence relations. We classify the personal name variants as nonvalid and valid forms. In establishing an equivalence relation between valid variants and the standard form of its equivalence class, we defend the application of finite-state transducers. The process of variant identification requires the elaboration of: (a) binary matrices and (b) finite-state graphs. This procedure was tested on samples of author names from bibliographic records, selected from the Library and Information Science Abstracts and Science Citation Index Expanded databases. The evaluation involved calculating the measures of precision and recall, based on completeness and accuracy. The results demonstrate the usefulness of this approach, although it should be complemented with methods based on similarity relations for the recognition of spelling variants and misspellings. &copy; 2007 Wiley Periodicals, Inc.
Timing Accuracy in Modern ATE
Authors: Mark Barber, Walter Satre
Venue: IEEE Design Test (1987)

LSI test systems built in the 1970s had compact, 60-pin test heads that presented devices under test with open wires leadingto lumped-capacitive loads. Today's VLSI testers have 256-pin test heads with transmission lines leading from the DUTs todriver-comparator circuits that are as far away as 50 cm. Even though these automatic testers are adjusted to subnanosecondaccuracy, reflections within the transmission lines can cause timing measurement errors up to 10 ns for MOS devices whoseoutput impedances are not matched to the transmission lines. The authors offer the Advice circuit simulator (an AT&T proprietaryversion of SPICE) as one way to analyze errors due to transmission line problems before testing. They also discuss ways tocorrect timing errors. Finally, they recommend that very high speed ICs be designed to drive transmission lines that are terminatedwith matched resistors at the comparators.
The Depth-Variant Image Restoration Based on Hopfield Neural Network
Authors: Yu Wang, Xiaohai He, Huazhang Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

In this paper we presented a full-parallel Hopfield neural network based on a new model of the three-dimensional (3D) Gaussian point spread function (PSF) to restore the microscopic optical slices. As the result of the diffraction of the microscope's objective, the imaging model in three-dimensional optical-sectioning microscopy incorporates spherical aberration that worsens with increasing depth under the coverslip and changes in the PSF. Two-dimensional image restoration and three-dimensional serial images restoration are used to analyze the capability of the network, and the performance shows that the continuous Hopfield network can restore the blurred images of the depth-variant microscopic image.
An operator-theoretic approach to invariant integrals on quantum homogeneous SUn,1-spaces
Authors: Klaus-Detlef Kürsten Elmar Wagner
Venue: Publications of the Research Institute for Mathematical Sciences (2007)

An operator-theoretic approach to invariant integrals on non-compact quantum spaces is introduced on the examples of quantum ball algebras. In order to describe an invariant integral, operator algebras are associated to the quantum space which allow an interpretation as "rapidly decreasing" functions and as functions with compact support. If an operator representation of a first order differential calculus over the quantum space is known, then it can be extended to the operator algebras of integrable functions. The important feature of the approach is that these operator algebras are topological spaces in a natural way. For suitable representations and with respect to the bounded and weak operator topologies, it is shown that the algebra of functions with compact support is dense in the algebra of closeable operators used to define these algebras of functions and that the infinitesimal action of the quantum symmetry group is continuous.
Municipal broadband wireless networks
Authors: Munir Mandviwalla, Abhijit Jain, Julie Fesenmaier, Jeff Smith, Paul Weinberg, Greg Meyers
Venue: Communications of the ACM (2008)

"...people lack many things: jobs, shelter, food, health care and drinkable water. Today, being cut off from basic telecommunications services is a hardship almost as acute as these other deprivations, and may indeed reduce the chances of finding remedies to them."---UN Secretary General, Kofi Annan, in a keynote address to the International Telecommunication Union, Oct. 9, 1999.
B75-2 Systems Simulation
Authors: S. Gorenstein
Venue: IEEE Transactions on Computers (1975)

This boook deals primarily with the simulation of hardware systems such as those found in the aeronautical and aerospace industries where differential equations represent the system dynamics. Usually there are known representations of such systems, and because of the nonlinearities, or the need for system identification, simulation must he used to see how components interact and to design them to achieve a desired performance. For such systems, this book provides a distillation of the many years of valuable experience of the authors with engineering systems and provides a view of simulation not found in other books the use of simulation for control purposes in addition to design. This should be the most, important goal of simulations, but it is rarely sought after or achieved. So the orientation here is useful and practical, and in a certain sense, novel. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
An Evaluation Method for Requirements Engineering Approaches in Distributed Software Development Projects
Authors: Michael Geisser, Tobias Hildenbrand, Franz Rothlauf, Colin Atkinson
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

The distribution of software engineering tasks is becoming ever more common. Requirements engineering, as the most critical phase, therefore requires methods and tools to support distributed teams. However, nearly all requirements engineering methods have originally been designed for collocated scenarios. Before applying these methods in distributed settings in practice and for scientific rigor, proper evaluation has to be conducted. Hence, we developed a methodologically sound and cost-effective evaluation method for distributed requirements engineering methods as well as the corresponding tool infrastructure for conducting evaluation projects.
A Supervised Algorithm for Fuzzy Multi-criteria Decision Making
Authors: Chi Zhang, Wei Li, Xumei Song, Jianming Wang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

This paper attempts to develop a model for fuzzy multi- criteria decision making under the supervision of subjective preference information. A supervised algorithm, which amalgamates the subjective and objective weights into optimization, and can simultaneously determine the index weights and relative membership degrees, is developed under the supervision of decision makers' experience and preference. A case study is followed to demonstrate the applicability of the proposed algorithm.
Utilizing Binary Rewriting for Improving End-Host Security
Authors: Yougang Song, Brett D. Fleisch
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

Conventional methods supporting Java binary security mainly rely on the security of the hosts Java Virtual Machine (JVM). However, malicious Java binaries keep exploiting the vulnerabilities of JVMs, escaping their sandbox restrictions and allowing attacks on end user systems. Administrators must confront the difficulties and dilemmas brought on by security upgrades. On the other hand, binary rewriting techniques have been advanced to allow users to enforce security policies directly on mobile code. They have the advantage of supporting a richer set of security policies and self-constrained written code. However, the high administrative and performance overhead caused by security configuration and code rewriting have prevented rewriters from becoming a practical security tool.In this paper, we address these problems by integrating binary code rewriters with web caching proxies and build the security system called PB-JARS, a Proxy-based JAva Rewriting System. PB-JARS works as a complimentary system to existing JVM security mechanisms by placing another line of defense between users and their end user systems. It gives system administrators centralized security control and management for mobile code and security policies. We evaluated PB-JARS using a real Java binary traffic model derived from analyzing real web trace records. Our results show that adding binary rewriting to web caching system can be very efficient in improving end host security at low cost.
Integrating bioinformatics, distributed data management, and distributed computing for applied training in high performance computing
Authors: Michael D. Kane, John A. Springer
Venue: Proceedings of the 8th ACM SIGITE conference on Information technology education (2007)

The utilization of multi-core and multi-node parallel high performance computing (HPC) systems is growing rapidly to meet computational demands in the scientific computing arena. For example, the exponential growth of genomic data has outpaced increases in single CPU clock speeds by 15-fold over the last 20 years, placing great value on the use of parallel processing systems in bioinformatics. Fortunately, increased demand for multi-node architectures has resulted in decreased costs for distributed computing components making these architectures more affordable to organizations and institutions. As the demand for HPC computer architectures grows, so does the demand for professionals skilled in the implementation, utilization and administration of these systems. With the goal of training undergraduate and graduate students to meet this demand, a model HPC training module has been developed and implemented that integrates bioinformatics, distributed data management and distributed computing. In this HPC training module bioinformatics provides exposure to applied scientific computing as well as the rationale for multi-processor computing to overcome large computational problems. In addition, the parallelization of computing is explored from the classic divide-and-conquer approach, as well as the distributed data management perspective, which places emphasis on the network bandwidth and disk paging as detractors to HPC performance. Students participate in the HPC module through hands-on interactions with three different HPC cluster types: (1) Beowulf, (2) blade servers, and (3) multi-processor shared memory systems. The results of this training module include exploratory student projects to determine mathematical relationships between HPC performance and (1) processing nodes, (2) cluster type, (3) database size and segmentation methods, (4) bioinformatics application type, (5) RAM per node, and (6) network bandwidth. The outcome of this training module is hands-on training in HPC across multiple cluster types, and across multiple computer and information technology perspectives.
Stochastic Syntax-Directed Translation Schemata for Correction of Errors in Context-Free Languages
Authors: M. G. Thomason
Venue: IEEE Transactions on Computers (1975)

A formal method of correcting errors of changed, deleted, and inserted terminals in the strings of a context-free language is considered. Grammars generating strings containing these errors are first constructed from a known grammar for the language; these new grammars are then used to specify simple syntax-directed translation schemata which can parse both correct strings and strings with errors and simultaneously produce output strings in the original language. Stochastic aspects of productions and of errors are incorporated into the correction model to assign probabilities to translations produced.
OVSF-CDMA Code Assignment in Wireless Ad&#x00a0;Hoc&#x00a0;Networks
Authors: Peng-Jun Wan, Xiang-Yang Li, Ophir Frieder
Venue: Algorithmica (2007)

Orthogonal Variable Spreading Factor (OVSF) CDMA code consists of an infinite number of codewords with variable rates, in contrast to the conventional orthogonal fixed-spreading-factor CDMA code. Thus, it provides a means of supporting of variable rate data service at low hardware cost. However, assigning OVSF-CDMA codes to wireless ad hoc nodes posts a new challenge since not every pair of OVSF-CDMA codewords are orthogonal to each other. In an OVSF-CDMA wireless ad hoc network, a code assignment has to be conflict-free, i.e., two nodes can be assigned the same codeword or two non-orthogonal codewords if and only if their transmission will not interfere with each other. The throughput (resp., bottleneck) of a code assignment is the sum (resp., minimum) of the rates of the assigned codewords. The max-throughput (resp., max-bottleneck) conflict-free code assignment problem seeks a conflict-free code assignment which achieves the maximum throughput (resp., bottleneck). In this paper, we present several efficient methods for conflict-free code assignment in OVSF-CDMA wireless ad hoc networks. Each method is proved to be either a constant-approximation for max-throughput conflict-free code assignment problem, or a constant-approximation for max-bottleneck conflict-free code assignment problem, or constant-approximations for both problems simultaneously.
Three voting protocols: ThreeBallot, VAV, and twin
Authors: Ronald L. Rivest, Warren D. Smith
Venue: Proceedings of the USENIX Workshop on Accurate Electronic Voting Technology (2007)

We present three new paper-based voting methods with interesting security properties. Our goal is to achieve the same security properties as recently proposed cryptographic voting protocols, but using only paper ballots and no cryptography. From a security viewpoint we get reasonably close, particularly for short ballots. However, our proposals should probably be considered as more "academic" than "practical." In these proposals, not only can each voter verify that her vote is recorded as intended, but she gets a "receipt" she can take home that can be used later to verify that her vote is actually included in the final tally. But her receipt does not allow her to prove to anyone else how she voted. All ballots cast are scanned and published in plaintext on a "public bulletin board" (web site), so anyone may correctly compute the election result. In ThreeBallot, each voter casts three paper ballots, with certain restrictions on how they may be filled out. These paper ballots are of course "voter-verifiable." A voter receives a copy of one of her ballots as her "receipt", which she may take home. Only the voter knows which ballot she copied for her receipt. The voter is unable to use her receipt to prove how she voted or to sell her vote, as the receipt doesn't reveal how she voted. A voter can check that the web site contains a ballot matching her receipt. Deletion or modification of ballots is thus detectable; so the integrity of the election is verifiable. VAV is like ThreeBallot, except that the ballot-marking rules are different: one ballot may "cancel" another (VAV = Vote/Anti-Vote/Vote). VAV is better suited to - i.e. yields better security properties for - Plurality and preference (Borda, Condorcet, IRV) voting, while ThreeBallot is better suited for Approval and Range voting. Finally, we introduce "Floating Receipts," wherein voters may take home a copy of another voter's ballot. (She doesn't know whose ballot, though.) Floating Receipts are well-tuned to the security requirements of ThreeBallot-like schemes, and we examine protocols for achieving them. Our final voting system, Twin, is based almost entirely on Floating Receipts. Each voter casts a single ballot and takes home a single receipt. Twin is quite simple and close to being practical.
A New Model of Printer Color Management Based on Legendre Neural Network
Authors: Li Xinwu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

Color management for the printer is one of the key techniques in the color image reproduction. A New color management model is presented based on analyzing the printer color rendering principle. First, the paper takes standard color target for experimental sample, and substitutes color blocks in color shade district for complete color space. Second, data collecting method is introduced and some data bases for deducing the model are created. Then, BP network model is corrected to speed up model's convergence and a new model for printer color management based on the legendre neural network is deduced and analyzed. Finally the experimental results show that the model can improve printer color management accuracy and can be used in its color management practically.