ppxscal/embedding_network huggingface dataset:
The Craft of System Security
Authors: Sean Smith, John Marchesini
Venue:  (2007)

"I believe The Craft of System Security is one of the best software security books on the market today. It has not only breadth, but depth, covering topics ranging from cryptography, networking, and operating systems--to the Web, computer-human interaction, and how to improve the security of software systems by improving hardware. Bottom line, this book should be required reading for all who plan to call themselves security practitioners, and an invaluable part of every university's computer science curriculum." --Edward Bonver, CISSP, Senior Software QA Engineer, Product Security, Symantec Corporation"Here's to a fun, exciting read: a unique book chock-full of practical examples of the uses and the misuses of computer security. I expect that it will motivate a good number of college students to want to learn more about the field, at the same time that it will satisfy the more experienced professional." --L. Felipe Perrone, Department of Computer Science, Bucknell UniversityWhether you're a security practitioner, developer, manager, or administrator, this book will give you the deep understanding necessary to meet today's security challenges--and anticipate tomorrow's. Unlike most books, The Craft of System Security doesn't just review the modern security practitioner's toolkit: It explains why each tool exists, and discusses how to use it to solve real problems.After quickly reviewing the history of computer security, the authors move on to discuss the modern landscape, showing how security challenges and responses have evolved, and offering a coherent framework for understanding today's systems and vulnerabilities. Next, they systematically introduce the basic building blocks for securing contemporary systems, apply those building blocks to today's applications, and consider important emerging trends such as hardware-based security.After reading this book, you will be able to Understand the classic Orange Book approach to security, and its limitations Use operating system security tools and structures--with examples from Windows, Linux, BSD, and Solaris Learn how networking, the Web, and wireless technologies affect security Identify software security defects, from buffer overflows to development process flaws Understand cryptographic primitives and their use in secure systems Use best practice techniques for authenticating people and computer systems in diverse settings Use validation, standards, and testing to enhance confidence in a system's security Discover the security, privacy, and trust issues arising from desktop productivity tools Understand digital rights management, watermarking, information hiding, and policy expression Learn principles of human-computer interaction (HCI) design for improved security Understand the potential of emerging work in hardware-based security and trusted computing
Evolutionary algorithms, homomorphous mappings, and constrained parameter optimization
Authors: Slawomir Koziel, Zbigniew Michalewicz
Venue: Evolutionary Computation (1999)

During the last five years, several methods have been proposed for handling nonlinear constraints using evolutionary algorithms (EAs) for numerical optimization problems. Recent survey papers classify these methods into four categories: preservation of feasibility, penalty functions, searching for feasibility, and other hybrids. In this paper we investigate a new approach for solving constrained numerical optimization problems which incorporates a homomorphous mapping between n-dimensional cube and a feasible search space. This approach constitutes an example of the fifth decoder-based category of constraint handling techniques. We demonstrate the power of this new approach on several test cases and discuss its further potential.
Technology in the Real World
Authors: M. H. Eklund
Venue: Computer (1975)

The IEEE Computer Society Computer Elements Technical Committee has been tracking the progress of new technology for many years. The December 1974 workshop in Phoenix once again focused on the impact of semiconductor LSI, but papers and discussions ranged from social problems of the world to that last uncertain electron tipping a flip-flop out of its metastable state. The various factors in the success of emerging technologies were identified, with technical novelty far down the list-no surprise to the older committee members, but often a disappointment to the young innovator. 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
ROX: relational over XML
Authors: Alan Halverson, Vanja Josifovski, Guy Lohman, Hamid Pirahesh, Mathias Mörschel
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

An increasing percentage of the data needed by business applications is being generated in XML format. Storing the XML in its native format will facilitate new applications that exchange business objects in XML format and query portions of XML documents using XQuery. This paper explores the feasibility of accessing natively-stored XML data through traditional SQL interfaces, called Relational Over XML (ROX), in order to avoid the costly conversion of legacy applications to XQuery. It describes the forces that are driving the industry to evolve toward the ROX scenario as well as some of the issues raised by ROX. The impact of denormalization of data in XML documents is discussed both from a semantic and performance perspective. We also weigh the implications of ROX for manageability and query optimization. We experimentally compared the performance of a prototype of the ROX scenario to today's SQL engines, and found that good performance can be achieved through a combination of utilizing XML's hierarchical storage to store relations "pre-joined" as well as creating indices over the remaining join columns. We have developed an experimental framework using DB2 8.1 for Linux, Unix and Windows, and have gathered initial performance results that validate this approach.
A Class of Algorithms for Collision Resolution with&#x00a0;Multiplicity&#x00a0;Estimation
Authors: Petar Popovski, Frank H. P. Fitzek, Ramjee Prasad
Venue: Algorithmica (2007)

The wireless connectivity in pervasive computing has ephemeral character and can be used for creating ad hoc networks, sensor networks, connection with RFID (Radio Frequency Identification) tags etc. The communication tasks in such wireless networks often involve an inquiry over a shared channel, which can be invoked for: discovery of neighboring devices in ad hoc networks, counting the number of RFID tags that have a certain property, estimating the mean value contained in a group of sensors etc. Such an inquiry solicits replies from possibly large number of terminals&#x00a0;n. This necessitates the usage of algorithms for resolving batch collisions (conflicts) with unknown conflict multiplicity&#x00a0;n. In this paper we present a novel approach to the problem of collision resolution for batch conflicts. We show how the conventional tree algorithms for collision resolution can be used to obtain progressively accurate estimation of the multiplicity. We use the estimation to propose a more efficient binary tree algorithm, termed Estimating Binary Tree (EBT) algorithm. The EBT algorithm is suited for implementation when the conflicting nodes are passive, such as e.g. RFID tags. We extend the approach to design the Interval Estimation Conflict Resolution (IECR) algorithm. For n&#x2192;&#x221e; we prove that the efficiency achieved by IECR for batch arrivals is identical with the efficiency that Gallager&#x2019;s FCFS algorithm achieves for Poisson packet arrivals. For finite n, the simulation results show that IECR is, to the best of our knowledge, the most efficient batch resolution algorithm reported to&#x00a0;date.
Levels of formality in diagram presentation
Authors: Louise Yeung, Beryl Plimmer, Brenda Lobb, Douglas Elliffe
Venue: Proceedings of the 19th Australasian conference on Computer-Human Interaction: Entertaining User Interfaces (2007)

The incremental beautification of hand-drawn diagrams is a process that is poorly understood. Thus implementation of beautification techniques in computer-based sketch tools is ad hoc, with most only supporting the ends of the spectrum: hand-drawn and fully formalized. Hand-drawn diagrams are more effective for early design and review but users are more satisfied with formal designs. This suggests that there may be applications for intermediate levels of formality. By understanding the attributes of visual formality it is possible to beautify a diagram progressively, thereby achieving visually consistent intermediate levels of formality. Here we present a taxonomy of the attributes of visual formality and the implementation of this taxonomy into a sketch tool.
Heuristics for the selection of weights in sequential feed-forward neural networks: An experimental study
Authors: Enrique Romero, René Alquézar
Venue: Neurocomputing (2007)

The selection of weights of the new hidden units for sequential feed-forward neural networks (FNNs) usually involves a non-linear optimization problem that cannot be solved analytically in the general case. A suboptimal solution is searched heuristically. Most models found in the literature choose the weights in the first layer that correspond to each hidden unit so that its associated output vector matches the previous residue as best as possible. The weights in the second layer can be either optimized (in a least-squares sense) or not. Several exceptions to the idea of matching the residue perform an (implicit or explicit) orthogonalization of the output vectors of the hidden units. In this case, the weights in the second layer are always optimized. An experimental study of the aforementioned approaches to select the weights for sequential FNNs is presented. Our results indicate that the orthogonalization of the output vectors of the hidden units outperforms the strategy of matching the residue, both for approximation and generalization purposes.
Parallel Algorithms for Bayesian Indoor Positioning Systems
Authors: Konstantinos Kleisouris, Richard P. Martin
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

We present two parallel algorithms and their Unified Parallel C implementations for Bayesian indoor positioning systems. Our approaches are founded on Markov Chain Monte Carlo simulations. We evaluated two basic partitioning schemes: inter-chain partitioning which distributes entire Markov chains to different processors, and intra-chain which distributes a single chain across processors. Evaluations on a 16-node symmetric multiprocessor, a 4-node cluster comprising of quad processors, and a 16 single-processor- node cluster, suggest that for short chains intrachain scales well on the first two platforms with speedups of up to 12. On the other hand, inter-chain gives speedups of 12 only for very long chains, sometimes of up to 60,000 iterations, on all three platforms. We used the LogGP model to analyze our algorithms and predict their performance. Model predictions for inter-chain are within 5% of the actual execution time, while for intra-chain they are 7%-25% less due to load imbalance not captured in the model.
A Development of HL7 Middleware for Medical Device Communication
Authors: Tung Tran, Hwa Sun Kim, Hune Cho
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

An efficient middleware has been developed to support medical device communication. HL7 is known to be best international standard to facilitate clinical device data transfer to information systems in hospital. In this study, we developed a middleware with capability of receiving data from mCare 300 Vital signs monitoring device and converting to HL7 data type format.
Method for Soil Resistivity Measurement Based on Neural Network
Authors: Yanmin Song, Zhongwei Bi, Kun Liu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

During the cathodic protection of underground metal constructions, the soil resistivity measurement is mostly important to determine the position of sacrificial anodes. However, the measurement data are inevitably influenced by temperature variations and power fluctuations. In order to reduce these adverse impacts and enhance the accuracy of measurement, this paper introduces a novel application of neural network algorithm and data fusion, which adopts multi-dimensional calibration experimental data as its study samples. The experiment result shows that under the same condition of working temperature variation and power fluctuation, the measurement accuracy has been significantly enhanced after data fusion process.
Topology Preserving Marching Cubes-like Algorithms on the Face-Centered Cubic Grid
Authors: Robin Strand, Peer Stelldinger
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

The well-known marching cubes algorithm is modified to apply to the face-centered cubic (fcc) grid. Thus, the local configurations that are considered when extracting the local surface patches are not cubic anymore. This paper presents three different partitionings of the fcc grid to be used for the local configurations. The three candidates are evaluated theoretically and experimentally and compared with the original marching cubes algorithm. It is proved that the reconstructed surface is topologically equivalent to the surface of the original object when the surface of the original object that is digitized is smooth and a sufficiently dense fcc grid is used.
The benefits of immersion for spatial understanding of complex underground cave systems
Authors: Philip Schuchardt, Doug A. Bowman
Venue: Proceedings of the 2007 ACM symposium on Virtual reality software and technology (2007)

A common reason for using immersive virtual environments (IVEs) in visualization is the hypothesis that IVEs should provide a higher level of spatial understanding for complex 3D structures, such as those found in underground cave systems. Therefore, we aimed to explore the use of IVEs for visualization of underground caves, and to determine the benefits of immersion for viewing such models. We ran an experiment in which domain experts answered questions with two different levels of immersion. The results show that for certain tasks the more immersive system significantly improved accuracy, speed, and comprehension over the non-immersive environment, and that 3D visualization overall is a good match for the underground cave data.
Software Engineering: Process, Principles, and Goals
Authors: D. T. Ross
Venue: Computer (1975)

This paper attempts to define the principles and goals that affect the practice of software engineering. Its intent is to organize these aspects of software engineering into a framework that rationalizes and encourages their proper use, while placing in perspective the diversity of techniques, methods, and tools that presently comprise the subject of software engineering.
A Smart Digital-Readout Circuit for a Capacitive Microtransducer
Authors: Ernst Habekotte, Stefan Cserveny
Venue: IEEE Micro (1984)

By incorporating on-chip signal preprocessing, this CMOS switched-capacitor-based A/D converter improves the speed and accuracy with which a microprocessor system can sense physical forces such as pressure and acceleration.
Managing data from high-throughput genomic processing: a case study
Authors: Toby Bloom, Ted Sharpe
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Genomic data has become the canonical example of very large, very complex data sets. As such, there has been significant interest in ways to provide targeted database support to address issues that arise in genomic processing. Whether genomic data is truly a special case, or just another application area exhibiting problems common to other domains, is an as yet unanswered question. In this abstract, we explore the structure and processing requirements of a large-scale genome sequencing center, as a case study of the issues that arise in genomic data managements, and as a means to compare those issues with those that arise in other domains.
High-Speed Monolithic Multipliers for Real-Time Digital Signal Processing
Authors: S. Waser
Venue: Computer (1978)

Real-time digital signal processing requires very fast multiplication, which is now becoming possible using mathematical techniques to take advantage of single-chip multipliers.
Designing the ground for pleasurable experience
Authors: Charles Lenay, Indira Thouvenin, Anne Guénand, Olivier Gapenne, John Stewart, Barthelemy Maillet
Venue: Proceedings of the 2007 conference on Designing pleasurable products and interfaces (2007)

In this article we present a theoretical framework and some models for assisting the conception of tactile communication devices. In order to propose relevant concepts and successful innovative products, designers need to anticipate as early as possible the user experience that will emerge from actual use of the product they are developing. The way the designer imagines the qualities of the product has strong consequences for the possible experience that will be available to the user. However, it is very difficult to accurately anticipate the actual experience of the user; and the lack of knowledge concerning the final user is particularly drastic in the case of high-technology applications, where the potentialities of the technology are hugely superior to the acceptability of the final users. In order to remedy this difficulty, this article presents research from the fields of design, cognitive science and Virtual Reality, in order to understand how lived experience is constituted by the use of a technological device. The aim of this research is to provide guidelines for anticipating user experience in the design process. We found that there are two kinds of perception over time: perceiving the other as part of environment, versus perceiving the activity of other perceiving me. It is by switching between these two kinds of perception that it becomes possible for one subject to understand the position from which the other subject perceives the scene. We call this process the constitution of a &laquo; point of view &raquo;. From this ability to constitute a system of "points of view", the feeling of sharing a common space with another intentional being can emerge. Finally, we present the application of these considerations to the design of devices for interindividual interaction.
What's with This Blog Thing?
Authors: Robert L. Glass
Venue: IEEE Software (2007)

Do blogs and wikis help or hinder the communication of software engineering knowledge?
A Standard Pattern for Sequential File Maintenance
Authors: N. D. Peterson
Venue: Computer (1971)

The author explores the possibilities of ready-made logic in developing programs and, as an illustration, proposes a standard or prototype approach to file maintenance. The approach illustrated is defined by an annotated program logic chard and a series of checklists, cross-referenced to each other. 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
Optimization Model Based on IAHP for Protective Actions in Nuclear Accidents
Authors: Dengyou Xia, Jing Xin
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

Optimization model of protective actions is discussed in nuclear accidents. Optimizing alternative protective actions is a multi-objective system. On the basis of establishing multi-layer structure, a model in optimizing protective actions in nuclear accidents is developed based on interval analytic hierarchy process (IAHP). The model can make comparisons among alternative protective actions quantified, and the optimum protective action is selected out, which solved the uncertain and fuzzy problem of judgments by experts in nuclear accidents. Case study shows that the optimization result is much more reasonable, impersonal and reliable than subjective judgments, and it could be feasible references for nuclear accidents emergency.
New methods for competitive coevolution
Authors: Christopher D. Rosin, Richard K. Belew
Venue: Evolutionary Computation (1997)

We consider “competitive coevolution,” in which fitness is based on direct competition among individuals selected from two independently evolving populations of “hosts” and “parasites.” Competitive coevolution can lead to an “arms race,” in which the two populations reciprocally drive one another to increasing levels of performance and complexity. We use the games of Nim and 3-D Tic-Tac-Toe as test problems to explore three new techniques in competitive coevolution. “Competitive fitness sharing” changes the way fitness is measured; “shared sampling” provides a method for selecting a strong, diverse set of parasites; and the “hall of fame” encourages arms races by saving good individuals from prior generations. We provide several different motivations for these methods and mathematical insights into their use. Experimental comparisons are done, and a detailed analysis of these experiments is presented in terms of testing issues, diversity, extinction, arms race progress measurements, and drift.
An integrated architecture for trusted computing for java enabled embedded devices
Authors: Kurt Dietrich
Venue: Proceedings of the 2007 ACM workshop on Scalable trusted computing (2007)

This paper presents a concept for enhancing mobile and embedded devices with trusted computing (TC)technology. It outlines a new architecture focusing on SUN's J2ME platform, including the design for a Mobile Trusted Module (MTM) to be used as a trusted computing base. The proposed architecture combines all software components required for accessing an MTM and shows how TC functionality can be provided for mobile applications. Moreover, different deployment scenarios of the architecture and its components are discussed. In order to prove that an implementation of the concept is feasible, a prototype of the architecture has been developed. For the design of the new architecture, special attention was turned to reusing currently existing technology and hardware rather than designing new hardware. By using already existing components, this paper also gives an answer to the question of how a mobile trusted-computing-enhanced system could be implemented with currently available technology
Distributed, Automatic File Description Tuning in Peer-to-Peer File-Sharing Systems
Authors: Dongmei Jia, Wai Gen Yee, Linh Thai Nguyen, Ophir Frieder
Venue: Proceedings of the Seventh IEEE International Conference on Peer-to-Peer Computing (2007)

Peers in peer-to-peer file-sharing systems cannot effectively share their files if they are poorly described. Terms one user employs to describe an instance of a file may not be those that are commonly associated with the file, making this instance difficult to locate. To alleviate this problem, a server can ask its peers for help in improving the description of files they have in common. We consider the design of a fully distributed, automatic system for the exchange of descriptive metadata. Experimental results show that the proposed techniques are effective in improving search accuracy with reasonable cost.