ppxscal/embedding_network huggingface dataset:
Linear broadcast encryption schemes
Authors: Carles Padró, Ignacio Gracia, Sebastià Martín, Paz Morillo
Venue: Discrete Applied Mathematics (2003)

A new family of broadcast encryption schemes, which will be called linear broadcast encryption schemes (LBESs), is presented in this paper by using linear algebraic techniques. This family generalizes most previous proposals and provides a general framework to the study of broadcast encryption schemes. We present a method to construct, for a general specification structure, LBESs with a good trade-off between the amount of secret information stored by every user and the length of the broadcast message. In this way, we are able to find schemes that fit in situations that have not been considered before.
Size fair and homologous tree crossovers
Authors: WilliamB Langdon
Venue:  (1999)

Size fair and homologous crossover genetic operators for tree based genetic programming are described and tested. Both produce considerably reduced increases in program size (i.e.\ less bloat) and no detrimental effect on GP performance. GP search spaces are partitioned by the ridge in the number of program v.\ their size and depth. While search efficiency is little effected by initial conditions, these do strongly influence which half of the search space is searched. However a ramped uniform random initialisation is described which straddles the ridge. With subtree crossover trees increase about one level per generation leading to sub-quadratic bloat in program length.
Windows Server 2003 Bible
Authors: Jeffrey R. Shapiro, Jim Boyce, Brian Patterson, Marcin Policht, Scott Leathers
Venue:  (2003)

:This comprehensive reference provides you with all the information you'll need to plan, install, and configure this powerful operating system. It covers all the new features, offering an in-depth look at the latest Active Directory, networking, and communication services. It's also packed with proven techniques for ways you can improve security, handle disaster recovery, and troubleshoot problems. And it shows you how to enhance File, Print, and Web services so you can optimize your system.
Modelling of piezoelectric adaptive beam, plate and shell structures: some developments and results
Authors: A. Benjeddou
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

This paper presents some of the author and his co-workers developments and results in the field of modelling piezoelectric adaptive beam, plate and shell structures. Focus is made on the piezoelectric effect representation; mechanical, electrical and finite element modelling; and piezoelectric actuation/sensing mechanisms. Exact and approximate numerical analyses focus on the influence of the correct representation of the electromechanical coupling, the multilayer/sandwich aspect and the shell curvatures on the free-vibration characteristics and static extension- and shear-based actuation and sensing of piezoelectric adaptive beams, plates and shells. Current and future research interests are also outlined in the closure section.
Protocol Service Decomposition for High-Performance Networking
Authors: Chris Maeda, Brian N. Bershad
Venue:  (1993)

In this paper we describe a new approach to implementing network protocols that enables them to have high performance and high flexibility, while retaining complete conformity to existing application programming interfaces. The key insight behind our work is that an application''s interface to the network is distinct and separable from its interface to the operating system. We have separated these interfaces for two protocol implementations, TCP/IP and UDP/IP, running on the Mach 3.0 operating system and UNIX server. Specifically, library code in the application''s address space implements the network protocols and transfers data to and from the network, while an operating system server manages the heavyweight abstractions that applications use when manipulating the network through operations other than send and receive. On DECstation 5000/200 systems connected by 10Mb/sec Ethernet, this approach to protocol decomposition achieves TCP/IP throughput of 1088 KB/second, which is comparable to that of a high-quality in-kernel TCP/IP implementation, and substantially better than a server-based one. Our approach achieves small-packet UDP/IP round trip latencies of 1.23 ms, again comparable to a kernel-based implementation and more than twice as fast as a server-based one.
Identifying Comprehension Bottlenecks Using Program Slicing and Cognitive Complexity Metrics
Authors: Juergen Rilling, Tuomas Klemola
Venue: Proceedings of the 11th IEEE International Workshop on Program Comprehension (2003)

Achieving and maintaining high software quality is most dependent on how easily the software engineer least familiar with the system can understand the system's code. Understanding attributes of cognitive processes can lead to new software metrics that allow the prediction ofhuman performance in software development and for assessing and improving the understandability of text and code. In this research we present novel metrics based on current understanding of short-term memory performance, to predict the location of high frequenciesof errors and to evaluate the quality of a software system. We further enhance these metrics by applying static and dynamic program slicing to provide programmers with additional guidance during software inspection and maintenance efforts.
Translating Object-Z Specifications to Passive Test Oracles
Authors: Jason McDonald, Paul Strooper
Venue: Proceedings of the Second IEEE International Conference on Formal Engineering Methods (1998)

A test oracle provides a means for determining whether an implementation functions according to its specification. A passive test oracle checks the behaviour of the implementation, but does not attempt to reproduce this behaviour. This paper describes the translation of formal specifications of container classes to passive test oracles. Specifically, we use Object-Z for specifications and C++ for oracles. We discuss several practical issues for the use of formal specifications in test oracle generation. We then present the translation process and illustrate it with an example based on an integer set class. %We then present the translation process and evaluate how the derived %oracles satisfy our goals of adequacy for testing, portability between %different testing methods, and potential for automated generation. Our approach is illustrated with an example based on an integer set class.
An Environment for Formal Systems
Authors: Timothy G. Griffin
Venue:  (1987)

This report describes the Environment for Formal Systems, EFS, that allows a user to interactively define the syntax and inference rules of a formal system and to construct proofs in the defined system. The EFS supports two AUTOMATH-like formalisms for encoding logics: the Edinburgh Logical Framework and the Calculus of Constructions. Facilities are provided for the definition of notational abbreviations and the construction of goal-directed proofs. New goal-directed rules can be interactively defined and checked for validity. The EFS was implemented with the Cornell Synthesizer Generator.
A numerical method for the solution of the bi-dimensional continuous with no-tension material
Authors: S. Briccoli Bati, T. Rotunno
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

The present work proposes an efficient numerical method, based on the use of projection operators, for solving boundary problems of the elastic equilibrium of two-dimensional body not withstanding tension.Due to their high non-linearity, boundary problems involving materials with no resistance to tension, known as no-tension materials, are quite exacting to solve. Although a number of solution methods have been proposed in the literature, the approach presented herein has the advantage of circumventing the computational difficulties due to such non-linearity by resolving a sequence of linear problems, the solution to each of which is guaranteed by efficient use of the projection operator. In other words, what is proposed is an iterative procedure that, while satisfying the equilibrium conditions, makes appropriate corrections to the linear-elastic solution in order to make it converge on a final result congruent with the defined conditions of the material's lack of tensile resistance.The two-dimensional problems are studied under the hypothesis of a plane stress state, and the method applied to body discretized via three-node finite elements under constant stress. The effectiveness of the method is then demonstrated by resolving some simple example problems.
KLZ: A Prototype X Protocol Compression System
Authors: Ka Lo
Venue:  (1997)

One of the most commonly used graphics protocol is the X Protocol, enabling programs to display graphics images. When running the X Protocol over the network, a lot of structured data (messages with fields) need to be transmitted. Delays can be detected by human users when connected through a low-bandwidth network. The solution is to compress the X protocol. XRemote, a network version of the X Protocol, uses Dictionary-based compression. In XRemote, strings are recorded in the dictionary. When a string repeats, its index in the dictionary is transmitted. Higher Bandwidth X (HBX) uses statistical modeling techniques instead. A context model, which depends on the nature of the field in a particular type of message and the frequencies of the values of the field, is associated with each field. XRemote is much faster than HBX, but HBX achieves better compression than XRemote. The KLZ system is developed to take advantage of our knowledge about the fields in the XMotionNotify packet (what X sends when the mouse moves) and fast Dictionary (LZW) compression. In essence, KLZ reorders and rewrites fields in the XMotionNotify packet so that the fields will be more easily compressed by the fast LZ coder. My experiments show that KLZ compresses this packet nearly as well as HBX, and 5 times better than pure LZ. KLZ is slightly faster than pure LZ, and and 10 times faster than HBX. Since many modems already implement LZ compression, KLZ could also be used to reorder data before passing them to the modem with LZ compression for transmission. This reordering would lead to vastly improved compression almost for free. 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
Service Accelerator (SEA) System for Supplying Demand Oriented Information Services
Authors: K. Mori, S. Yamashita, H. Nakanishi, K. Hayashi, K. Ohmachi, Y. Hori
Venue: Proceedings of the 3rd International Symposium on Autonomous Decentralized Systems (1997)

An information service system is proposed to satisfy the requirements for use, provision and guarantee of service, from the standpoints of end users, service providers and network providers. The service is defined according to three views: customization (who is requesting information service), situation (where and when they request it) and quality (how important the request is). These requirements are achieved by three basic techniques: (i) discernment of the service from the three views, (ii) broad action to access the related service providers or end users on the basis of the discernment, and (iii) synchronization to integrate the multiple information provided from the broad action. This information service system, called SEA (SErvice Accelerator), is realized as a service platform in an open environment so as to coexist with conventional systems and attain flexible services.
plittings of M-Operators: Irreducibility and the Index of the Iteration Operator
Authors: Ivo Marek, B D Szyld
Venue:  (1989)

For the solution of linear systems of equations of the form $A u~=~f$ by iterations, it is customary to consider a splitting $A~=~M~-~N$ with the iterative process being $u _ {k+1}~=~Tu _ k~+~M ^ {-1}f$, $T~=~M ^ {-1}N$ and $u _ 0$ is the initial guess. In this paper we extend the theory of splittings to Banach spaces and in particular we generalize some results by Schneider, Rose and Szyld on splittings and irreducibility of $M$-matrices, and those by Schneider, Nuemann and Plemmons on the indices of $A$ and $T$. We present a new concept of cone-operator irreducibility which generalizes the usual concept of irreducibility. We also introduce the concept of $G$-compatible splittings for $M$-operators and show its relation to graph compatible splittings in the finite dimensional case. Most of our results are graph independent.
The Number of Cascade Functions
Authors: Grant Pogosyan
Venue: Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic (1999)

Cascade function is a Boolean function which can be implemented by a so-called cascade network. An n input cascade network is a circuit built with n - 1 two- input-one-output gates (i.e., dyadic operations) such that at least one input of each gate is a network input. By arranging the inputs in a proper order these networks can be presented in a "cascade" shape, which is the origin of the name.Cascade networks, and thus cascade functions have many interesting properties. Although the portion of cascades among all logic functions is small (the ratio approaches zero with growth of the number of variables), their remarkable properties and the practical significance of such networks has attracted many researchers in the fields of switching functions and logic design.There are several papers published that focus on the enumeration problem of cascade functions and networks. Asymptotic expression and a recurrence relation have been found for the number of all cascades ([12]), as well as for some subclasses (see e.g. [13, 15]). However, to the author's knowledge, until now no closed formula has been discovered which explicitly counts such functions.This paper presents an explicit formula for the number of all n-variable cascade functions.
Feature-Based Algorithms for Detecting and Classifying Scene Breaks
Authors: Ramin Zabih, Justin Miller, Kevin Mai
Venue:  (1995)

We describe a new approach to the detection and classification of scene breaks in video sequences. Our method can detect and classify a variety of scene breaks, including cuts, fades, dissolves and wipes, even in sequences involving significant motion. We detect the appearance of intensity edges that are distant from edges in the previous frame. A global motion computation is used to handle camera or object motion. The algorithms we propose withstand compression artifacts such as those introduced by JPEG and MPEG, even at very high compression rates. Experimental evidence demonstrates that our method can detect and classify scene breaks that are difficult to detect with previous approaches. An initial implementation runs at approximately 2 frames per second on a Sun workstation.
Towards a generative theory of diagram design
Authors: K. Reichenberger, T. Kamps, G. Golovchinsky
Venue: Proceedings of the 1995 IEEE Symposium on Information Visualization (1995)

We describe the theoretical background for AVE, an automatic visualization engine for semantic networks. We have a functional notion of aesthetics and therefore understand meaningfulness as a central issue for information visualization. This implies that the diagrams should communicate the characteristics of the data as effectively as possible. In this generative theory of diagram design, we include data characterization, systematic use of graphical means of expression and the combination of graphical means of expression. After giving a brief introduction and an application scenario we discuss these aspects in detail. Finally, a process model of an automatic visualization process is sketched and directions for further research are outlined.
Saturation Effects in Testing of Formal Models
Authors: Tim Menzies, David Owen, Bojan Cukic
Venue: Proceedings of the 13th International Symposium on Software Reliability Engineering (2002)

Formal analysis of software is a powerful analysis tool,but can be too costly. Random search of formal models canreduce that cost, but is theoretically incomplete. However,random search of finite-state machines exhibits an early saturationeffect, i.e., random search quickly yields all thatcan be found, even after a much longer search. Hence, weavoid the theoretical problem of incompleteness, providedthat testing continues until after the saturation point. Sucha random search is rapid, consumes little memory, is simpleto implement, and can handle very large formal models (inone experiment shown here, over 10178 states).
On the application of parallel database technology for large scale document management systems
Authors: A. Clausnitzer, M. Jaedicke, B. Mitschang, C. Nippl, A. Reiser, S. Zimmermann
Venue: Proceedings of the 1997 International Symposium on Database Engineering & Applications (1997)

Modern document management systems administer an increasing amount of data. Unfortunately traditional database technology cannot satisfy the resulting performance requirements. We report on how parallel database technology can contribute to make large and scalable document management systems work. Our discussion clearly shows that simply substituting a sequential database system for a parallel one does not necessarily lead to scalability and high performance. In contrast, detailed knowledge of the application and document management system is necessary to decide on the optimal architecture of the parallel database system, its query optimization and parallelization strategies, as well as on its data fragmentation scheme and load balancing properties. All discussions are exemplified referring to an existing document management system developed at our university that is currently migrated from a sequential database system to a parallel one.
Explicit solutions of infinite quadratic programs
Authors: K. C. Sivakumar, J. Mercy Swarna
Venue: The Korean Journal of Computational Applied Mathematics (2003)

Let H be a Hilbert space, X be a real Banach space, A : H → X be an operator with D(A) dense in H,G : H → H be positive definite, x ∈ D(A) and b ∈ H. Consider the quadratic programming problem: QP : Minimize ½〈p,x〉 + 〈x,Gx〉 subject to Ax = b In this paper, we obtain an explicit solution to the above problem using generalized inverses.
Experimental Evaluation of Augmented Reality in Object Assembly Task
Authors: Arthur Tang, Charles Owen, Frank Biocca, Weimin Mou
Venue: Proceedings of the 1st International Symposium on Mixed and Augmented Reality (2002)

This study evaluated the effectiveness of spatially overlaid instructions using augmented reality (AR) in an assembly task comparing with other traditional media. Results indicate that overlaying 3D instructions on the workspace reduce error rate by 82%, particularly cumulative errors. Measurement of mental effort also suggests some of the mental workload is offloaded to the computer.
Defining Differentiation and Integration in Z
Authors: C. J. Fidge, I. J. Hayes, B. P. Mahony
Venue: Proceedings of the Second IEEE International Conference on Formal Engineering Methods (1998)

This paper shows how familiar mathematical concepts from differential and integral calculus can be represented in the Z specification language. Digital computer systems involve hardware devices and software variables that can adopt a limited range of values only, and may be temporarily inaccessible or ill-defined. Emphasis is therefore given to supporting discrete range types and partial functions.
Efficiently Announcing Multimedia Information from Mobile Computers with the WOR Toolkit
Authors: Shigeaki Tagashira, Akira Fukuda, Keizo Saisho
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

We designed and built an information announcement basic software system that realizes a new using style, called the TAM. This style regards a mobile computer as a server as well as a client. In order to effectively announce information from a mobile computer as a server, the system uses stationary computers, called SMHs, that manages mobile computers. The effectiveness of the system has been shown. The system works well and gives a useful environment to clients. In the system, however, communications between a client and a server are always done via the SMH computer associated with the server. This communication path is redundant in some cases. The server cannot provide high quality services to the client because of the redundancy. In this paper, we design a new information announcement system, called the WOR, which is expansion of the TAM to solve the problem of the redundant path. In the WOR, we assume that a SMH is located at every network domain. The communication method uses two types of the SMH; Home SMH (HSMH) and Foreign SMH (FSMH). The HSMH is the same as the SMH in the TAM. The FSMH finds a shorter path for the mobile computer to provide the service to a client. We show the system a useful mobile computing environment to clients through implementing the system.
Guest Editor's Introduction: On Piracy and Privacy
Authors: Savitha Srinivasan
Venue: Computer (2003)

While a rich set of technologies can be used to combat content piracy, legislative policies and legal agreements dominate consumer privacy protection.
Localized Credentials for Server Assisted Mobile Wallet
Authors: Stig F. Mj"lsnes, Chunming Rong
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

We propose a fully distributed multiparty secure architecture so that you can leave most of the content of your electronic wallet in the security of your home while travelling with your mobile terminals. Emerging GSM and UMTS mobile terminals sporting both short range Bluetooth andcellular GPRS will be excellent platforms.
Minimal graphics
Authors: Ivan Herman, D. J. Duke
Venue:  (1999)

The problem of producing a photorealistic rendering of a graphical model continues to be the focus of considerable research effort in the computer graphics community. However, photorealism is not the only possible criteria for judging the value of an image. In this paper we step back from the physicallybased model that underlies many of the existing approaches to rendering, and instead consider the rendering problem from a more fundamental view: how is graphical information processed by the user? Using differences in artistic traditions as our initial motivation, we identify the need for an approach to rendering that is based fundamentally on cognitive theory. Existing work on nonphotorealistic rendering has started to take steps that address this need, but using a model of cognitive information processing we identify a significant research problem: the quest for a minimal rendering process.
Formal Analysis of Software Security System Architectures
Authors: Jeffrey J. P. Tsai, Yi Deng, Jiacun Wang
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

We present an approach for analysis of security system architecture. Constraint patterns are introduced to formally specify the generic form of security policies that all implementations of the system architecture must enforce. The analysis is driven by incrementally decomposing a system-wide constraint pattern into a set of constraint patterns of constituent components. Since there are potential many ways to partition a security system, a key element of the analysis is to verify that the component constraint patterns are collectively consistent with the global constraint pattern under the given architecture. A "consistent" component constraint is then used as the basis for analyzing possible designs of the component. We show that our approach is both flexible and scalable, which not only ensures the consistency of critical early design decisions, but also provides a framework to guide correct implementations of the design.