ppxscal/embedding_network huggingface dataset:
A study of the relationships among cryptographic primitives
Authors: Yael Gertner
Venue:  (2003)

Over the years, cryptographic research has proposed solutions to many security problems. The security of these solutions was proven under a growing number of (unproven) computational assumptions which imply that P &ne; NP. Therefore, for most cryptographic protocols, unconditional proofs of security seem well beyond the reach of complexity theory. Nevertheless, it might be possible that many of these assumptions are related to one another. Exploring the relationship between these assumptions, and determining those that are integral to cryptography as building blocks, would thus greatly clarify our understanding of the cryptographic world, and is considered to be one of the most fundamental goals of research in cryptography. Once the relationship between primitives is established, an equally important goal is to determine whether the protocols constructed using certain cryptographic building blocks are efficient. We use the oracle separation model [IR89, GT00] to study the relationships among some of the most fundamental primitives and protocols in cryptography: public-key encryption, oblivious transfer (which is equivalent to general secure multi-party computation), trapdoor functions, and key agreement. We show rather surprising separations between public key encryption and oblivious transfer. This two-sided separation implies that in fact public key encryption and oblivious transfer are incomparable with respect to black-box reductions, which makes it a unique situation. Furthermore, we show that trapdoor functions are not necessary for public key encryption. Among our additional results are positive implications in special cases, corollaries separating oblivious transfer and key agreement, and separating trapdoor permutations from public key encryption and oblivious transfer. We show that the efficiency of known encryption schemes is optimal: for public-key encryption when constructed using trapdoor permutations, and private-key encryption when constructed using one-way permutations. We also show lower bounds on the efficiency of the verification algorithm for digital signature schemes based on one-way permutations.
A collaborative design appraisal system for water treatment engineering projects
Authors: M. Sun, N. Bakis, G. Aouad
Venue: Advances in Engineering Software (2003)

Water treatment projects usually involve large capital investment. Design appraisal is crucial to ensure project quality and cost effectiveness. The aim of design appraisal is to give the design team an opportunity to evaluate a proposed solution at the design stage when the benefits for change are high and cost is low. Design appraisal is a collaborative decision-making process that requires good communication and knowledge sharing between all the team members. Unfortunately, at present in practice there are many communication bottlenecks that result in decisions being made without proper evaluation and appraisal. The paper describes the development of a collaborative design appraisal system, which facilitates a remotely located design team to work in collaboration, carry out what-if analysis and optimise the design of water treatment projects.
Visualization in medicine: VIRTUAL reality or ACTUAL reality?
Authors: Christian Roux, Jean Louis Coatrieux, Jean-Louis Dillenseger, Elliot K. Fishman, Murray Loew, Hans-Peter Meinzer, Justin D. Pearlman
Venue: Proceedings of the conference on Visualization '94 (1994)

This panel will discuss and debate the role played by 3D visualization in Medicine as a set of methods and techniques for displaying 3D spatial information related to the anatomy and the physiology of the human body.
Zigzag: a new algorithm for mining large inclusion dependencies in databases
Authors: Fabien De Marchi, Jean-Marc Petit
Venue: Proceedings of the Third IEEE International Conference on Data Mining (2003)

In the relational model, inclusion dependencies (INDs)convey many information on data semantics. They generalizeforeign keys, which are very popular constraints inpractice. However, one seldom knows the set of satisfiedINDs in a database. The IND discovery problem in existingdatabases can be formulated as a data-mining problem.We underline in this article that the exploration of IND expressionsfrom most general (smallest) INDs to most specific(largest) INDs does not succeed whenever large INDshave to be discovered. To cope with this problem, we introducea new algorithm, called Zigzag , which combinesthe strength of levelwise algorithms (to find out some smallestINDs) with an optimistic criteria to jump more or lessto largest INDs. Preliminary tests, on synthetic databases,are presented and commented on. It is worth noting that themain result of this paper is general enough to be appliedto other data-mining problems, such as maximal frequentitemsets mining.
Hierarchical video indexing based on changes of camera and object motions
Authors: JungHwan Oh, Maruthi Thenneru, Ning Jiang
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Since an entire video stream is too coarse as a level of abstraction, it is decomposed into a number of shots in general. A shot, which is defined as a collection of frames recorded from a single camera operation, is a basic unit for indexing video data. The existing video indexing models try to index these shots using either low-level (i.e., color, motion), or high-level (i.e., human interpretations) features. Recently, hybrid approach to combine these low-level and high-level features for indexing purpose has been proposed to take advantages from both of them. In this paper, we extend our previous works for shot boundary detecting and indexing, and propose a new shot indexing technique to be fit into the hybrid environment. It supports in-depth classification of various kinds of shots according to camera motions and object movements. The results from preliminary experiments can confirm the effectiveness of the proposed techniques.
Application of Shannon's entropy to classify emergent behaviors in a simulation of laser dynamics
Authors: J. L. Guisado, F. Jiménez-Morales, J. M. Guerra
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

Laser dynamics simulations have been carried out using a cellular automata model. The Shannon's entropy has been used to study the different emergent behaviors exhibited by the system, mainly the laser spiking and the laser constant operation. It is also shown that the Shannon's entropy of the distribution of the populations of photons and electrons reproduces the laser stability curve, in agreement with the theoretical predictions from the laser rate equations and with the experimental results.
Symbolic implication in test generation
Authors: S. Kundu, I. Nair, L. Huisman, V. Iyengar
Venue: Proceedings of the conference on European design automation (1991)

All test generation algorithms make use of symbolic algebra. The symbolic value that most test generators use is 'X', to denote the unknown/do not care logic value. The other end of the spectrum is to shade each X differently to fully exploit the information contained in them. This is impractical due to combinatorial explosion that results from such coloring. In this paper, we explore use of limited symbolic evaluation in test generation. The symbolic evaluation greatly improves test generation compared with the usual 5-valued simulation. Also, and in contrast with other established techniques in test pattern generation such as static learning and dynamic learning, it requires no preprocessing and almost no additional memory.
Sets of Steiner triple systems of order 9 revisited
Authors: T. S. Griggs, A. Rosa
Venue: DESIGNS 2002: Further computational and constructive design theory (2003)

We determine all minimal large sets of 8 Steiner triple systems of order 9 (STS(9)); there are precisely four pairwise nonisomorphic solutions. We also classify all maximal sets of STS(9) which mutually intersect in the same number of triples (uniformly intersecting sets).
Policy based handover in wireless and mobile networks
Authors: Hakima Chaouchi
Venue: Network control and engineering for Qos, security and mobility II (2003)

Wireless networks bring a new market to service providers and terminal manufacturers. In fact after the success of the wired internet, wireless and mobile internet arrives with the ambition of providing new services to Internet users. However wireless networks face important challenging issues before attaining a similar or better success than the wired Internet. These issues are mainly related to the classical QoS, mobility, security problems, and the wireless specific problems such as the radio resource characteristics. In this article we are interested by the mobility problem and particularly the handover management problem. We introduce a policy based handover and we propose to combine the mobility management with the policy based architecture in order to achieve policy based handovers that are triggered not only on the signal strength basis, but also on policy constraints such as cost, resource availability or load balancing. The policy based architecture will provide the handover triggering mechanism and the decision support related to the best next cell where the mobile node will move. We also introduce mobility parameters in the Service Level Specification (SLS) that specifies the handover type, the accepted handover packet loss, and the accepted handover delay. Based on these SLS mobility parameters, the QoS service classes can be mapped to the smooth (minimum packet loss), the fast handover (minimum delay), or the seamless handover (fast and smooth).
New Solutions for Substation Sensing, Signal Processing and Decision Making
Authors: M. Kezunovic, Henry Taylor
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 2 - Volume 2 (2004)

This paper describes a new solution for integrating substation sensing, signal processing and decision making for more efficient monitoring, control and protection applications. The paper points out deficiencies of the existing approach and sets the requirements for the new approach. Once an architecture of the new solution is defined, further description of each of the elements of the new solution, namely optical sensor multiplexed network, distributed signal processing, and neural network based decision making are discussed. At the end, a concept of how all the mentioned components of the solution can be integrated is given.
Clock independent timing verification of level-sensitive latches
Authors: Robert Tjärnström
Venue: Proceedings of the conference on European design automation (1991)

This paper presents a method to automatically handle level-sensitive latches in timing analysis/verification. Timing specifications, including delays and timing constraints, are automatically generated for the cells in the design. The generated timing specifications are independent of clocking strategy, since clock and data are treated equally. Conditional constraints and paths are used to capture the transparent property of latches. The constraint rules are based on electrical/physical laws instead of assumptions about design styles. Timing errors due to clock skew and improper design are detected.
Improving automatic interface generation with smart templates
Authors: Jeffrey Nichols, Brad A. Myers, Kevin Litwack
Venue: Proceedings of the 9th international conference on Intelligent user interfaces (2004)

One of the challenges of using mobile devices for ubiquitous remote control is the creation of the user interface. If automatically generated designs are used, then they must be close in quality to hand-designed interfaces. Automatically generated interfaces can be dramatically improved if they use standard conventions to which users are accustomed, such as the arrangement of buttons on a telephone dial-pad or the conventional play, stop, and pause icons on a media player. Unfortunately, it can be difficult for a system to determine where to apply design conventions because each appliance may represent its functionality differently. Smart Templates is a technique that uses parameterized templates in the appliance model to specify when such conventions might be automatically applied in the user interface. Our templates easily adapt to existing appliance models, and interface generators on different platforms can apply appropriate design conventions using templates.
Finding strong pseudoprimes to several bases. II
Authors: Zhenxiang Zhang, Min Tang
Venue: Mathematics of Computation (2003)

Define ψm to be the smallest strong pseudoprime to all the first m prime bases. If we know the exact value of ψm, we will have, for integers n > ψm, a deterministic efficient primality testing algorithm which is easy to implement. Thanks to Pomerance et al. and Jaeschke, the ψm are known for 1 ≤ m ≤ 8. Upper bounds for ψg, ψ10 and ψ11 were first given by Jaeschke, and those for ψ10 and ψ11 were then sharpened by the first author in his previous paper (Math. Comp. 70 (2001), 863-872).In this paper, we first follow the first author's previous work to use biquadratic residue characters and cubic residue characters as main tools to tabulate all strong pseudoprimes (spsp's) n > 1024 to the first five or six prime bases, which have the form n = pq with p,q odd primes and q - 1 = k(p-1), k = 4/3, 5/2, 3/2, 6; then we tabulate all Carmichael numbers > 1020, to the first six prime bases up to 13, which have the form n = q1q2q3 with each prime factor qi ≡ 3 mod 4. There are in total 36 such Carmichael numbers, 12 numbers of which are also spsp's to base 17; 5 numbers are spsp's to bases 17 and 19; one number is an spsp to the first 11 prime bases up to 31. As a result the upper bounds for ψ9, ψ10 and ψ11 are lowered from 20- and 22-decimal-digit numbers to a 19-decimal-digit number: ψ9 ≤ ψ10 ≤ ψ11 ≤ Q11 = 3825 12305 65464 13051 (19 digits) = 149491 ċ 747451 ċ 34233211. We conjecture that ψ9 = ψ10 = ψ11 = 3825 12305 65464 13051, and give reasons to support this conjecture. The main idea for finding these Carmichael numbers is that we loop on the largest prime factor q3 and propose necessary conditions on n to be a strong pseudoprime to the first 5 prime bases. Comparisons of effectiveness with Arnault's, Bleichenbacher's, Jaeschke's, and Pinch's methods for finding (Carmichael) numbers with three prime factors, which are strong pseudoprimes to the first several prime bases, are given.
Toward a deeper understanding of the adoption decision for interorganizational information systems (ios): an investigation of internet edi (i-edi)
Authors: Zhenyu Huang
Venue:  (2003)

In the last few years, people have witnessed phenomenal growth in the business activities on the Internet. By taking advantage of the unique characteristics of the Internet, a new generation of IOS provides great efficiency for B2B business transactions and is much more affordable than traditional ones. Little systematic research has been conducted to study the adoption of new IOS systems. Moreover, a paucity of literature exists that has attempted to contribute insightful theories or comprehensive models to this area. To partially fill this void, this research intends to investigate the adoption phenomenon of IOS. To facilitate this study, Internet EDI (I-EDI) is used as an exemplar IOS technology to examine multiple factors impacting IOS adoption. Innovation Diffusion Theory, Organizational Climate Theory, Transaction Cost Economy Theory, Social Exchange Theory, and Trust theories are extended for studying the adoption of IOS. The extension will explain a large portion of the factors that lead to an organization's adoption of IOS. This research utilizes the field survey as the primary research methodology. Results from an online survey of 219 organizational respondents indicate that the proposed theoretical model is able to explain and predict organizational adoption of IOS substantially well. In addition to providing new theoretical grounds for studying the IOS adoption phenomena, this dissertation also supplies new measurement instruments for organizational constructs and interorganizational factors. The dissertation concludes with a discussion of the implications of this work to both researchers and practitioners.
The effectiveness of groups recognizing patterns
Authors: Stephen C. Hayne, C. A. P. Smith, Dan Turk
Venue: International Journal of Human-Computer Studies (2003)

An experiment was conducted in which groups made resource allocation decisions while physically dispersed and supported with a shared virtual work surface (What You See Is What I See--WYSIWIS). The task required groups to recognize patterns of information and collaborate to allocate their resources appropriately. The experimental treatment involved the use of a tool specifically designed to minimize the cognitive effort required to recognize and share patterns among group members. Dependent measures included outcome quality, time-to-decision, consensus of pattern recognition, and the number of resource allocation moves required to reach consensus. All groups received significant financial rewards in direct proportion to their outcome quality. Groups supported with the patternsharing tool had significantly higher outcome quality and significantly less resource movements. These results extend the theory of Recognition-Primed Decision-Making by applying it to groups.
Next Generation Application Integration: Challenges and New Approaches
Authors: Ian Gorton, Dave Thurman, Judi Thomson
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Integrating multiple heterogeneous data sources intoapplications is a time-consuming, costly and error-proneengineering task. Relatively mature technologies existthat make integration tractable from an engineeringperspective. These technologies, however, have manylimitations, and hence present opportunities forbreakthrough research. This paper briefly describes someof these limitations, and enumerates a subset of thegeneral open research problems. It then describes theData Concierge research project and prototype that isattempting to provide solutions to some of theseproblems.
Incremental Transformation of Procedural Systems to Object Oriented Platforms
Authors: Ying Zou, Kostas Kontogiannis
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Over the past years, the reengineering of legacy softwaresystems to object oriented platforms has receivedsignificant attention. In this paper, we present a genericre-engineering source code transformation framework tosupport the incremental migration of such procedurallegacy systems to object oriented platforms. First, asource code representation framework that uses a genericdomain model for procedural languages allows for therepresentation of Abstract Syntax Trees as XMLdocuments. Second, a set of transformations allow for theidentification of object models in specific parts of thelegacy source code. In this way, the migration process isapplied incrementally on different parts of the system. Aclustering technique is used to decompose a program intoa set of smaller components that are suitable for theincremental migration process. Finally, the migrationprocess gradually composes the object models obtained atevery stage to generate an amalgamated object model forthe whole system. . A case study for the migration of amedium size C system to C++ is discussed as a proof ofconcept.
Some variants in communication of parallel communicating pushdown automata
Authors: M. Sakthi Balan, Kamala Krithivasan, Mutyam Madhu
Venue: Journal of Automata, Languages and Combinatorics (2003)

We consider automata systems consisting of several pushdown automata working in parallel and communicating the contents of their stacks by request. We show that centralized non-returning parallel communicating pushdown automata systems with three components recognize all recursively enumerable languages. We also show that centralized returning pushdown automata systems accept non-ET0L languages. We study two variants of communication: one uses filters in communication and in the other only specified number of symbols are communicated. We prove that all these systems accept the family of recursively enumerable languages both in the centralized and in the non-centralized strategies and in both returning and non-returning communication modes with only two components.
Towards optimizing global MinCut partitioning
Authors: Achim G. Hoffmann
Venue: Proceedings of the conference on European design automation (1991)

MinCut algorithms have received much attention in the past for treating the placement problem in layout synthesis. The paper introduces a new class of Min-Cut partitioning algorithms (SQP) meeting global minimization requirements. The new class of algorithms in its different variations is empirically compared with the classical MinCut procedures as well as with recent extensions. The new algorithms have shown a significant (10 to 40%) improvement in the overall netlength compared with known algorithms. Moreover, the new class of algorithms is proved to have a linear time complexity.
Assertions in programming languages
Authors: Richard N. Taylor
Venue: ACM SIGPLAN Notices (1980)

The notion of embedding assertions in applications programs to aid in program verification and testing is not at all new; yet programming language designers seem loath to provide them, at least in useful ways. The Department of Defense language Ada is a case in point. The use of assertions is briefly reviewed, suggestions for their incorporation in languages is given, and an example of how they have been provided for the language HAL/S is shown.
An XML Description Language for Web-Based Network Simulation
Authors: R. Canonico, D. Emma, G. Ventre
Venue: Proceedings of the Seventh IEEE International Symposium on Distributed Simulation and Real-Time Applications (2003)

Simulation of large scale network scenarios is a challenging task and requires a great amount of computational power. Hence, realizing web-accessible simulation servers is a key step for the success of network simulation as a useful instrument in the context of network administration and capacity planning. This paper presents an XML-based description language for describing network simulation scenarios. For the proposed language, we also present an XSL translation process that can be used to automatically translate a simulation scenario into a simulation script for a well known network simulator. This work is part of a larger project, aimed at implementing a cluster-based network simulation server to be integrated in a distributed system for QoS monitoring, SLA validation and measurement-basedmodeling in an inter-domain environment.