ppxscal/embedding_network huggingface dataset:
A New Semantic Expression Method for Web Pages Based on OCDB
Authors: Zhengyu Zhu, Qingshen Zhu, Yukun Cao
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

Designing Web pages by HTML documents brings us many questions such as maintaining data uniformity, reusing a part of a page and searching information from the page. Semantic Web is an important area and is very useful to search information from the Web resources. There is much work in the area such as the Resource Description Framework (RDF) and the eXtensible Markup Language (XML). This paper presents a new semantic expressionmethod for Web pages. By introducing the concepts of the Original Content Database (OCDB) and the Extended Tag Graph (ETG), we give out another method based on graphrepresentation to a Web Page. A page will be given indirectly by its Virtual Web Page (VWP) but not by its HTML document. The VWP contains only the structure of the page without any actual content in it. The actual contents of all pages on a Web are centralized in the OCDB of the Web. This new technique is useful to solve the problems mentioned above. As its application we have discussed the blocked design technique for Web Pages.
A general method for constructing left-continuous t-norms
Authors: Sándor Jenei, Franco Montagna
Venue: Fuzzy Sets and Systems (2003)

A new method for constructing (left-continuous) t-norms is introduced and analyzed in this paper. We shall construct via embedding a left-continuous t-norm from any countable residuated totally and densely ordered commutative integral monoid. Moreover, we can construct a left-continuous t-norm from any countable, totally ordered, commutative integral monoid which is not necessarily densely ordered and residuated. A special case, the embedding of such monoids on lexicographic product spaces is investigated in detail, and several examples are demonstrated. The results shed some light to Chang's MV-algebra, to a recently proposed 'extraordinary' t-norm, and to the standard semantics of the recently introduced logic II-MTL of Hájek.
Multi-Output Galois Field Sum of Products Synthesis with New Quantum Cascades
Authors: Mozammel H. A. Khan, Marek A. Perkowski, Pawel Kerntopf
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

Galois Field Sum of Products (GFSOP) leads toefficient multi-valued reversible circuit synthesis usingquantum gates. In this paper, we propose a newgeneralization of ternary Toffoli gate and another newgeneralized reversible ternary gate with discussion of theirquantum realizations. Algorithms for synthesizing ternaryGFSOP using quantum cascades of these gates areproposed. In both the synthesis methods, 5 ternary shiftoperators and ternary swap gate are used. We also proposequantum realizations of 5 ternary shift operators andternary swap gate. In the cascades of the new ternary gates,local mirrors, variable ordering, and product orderingtechniques are used to reduce the circuit cost. Experimentalresults show that the cascade of the new ternary gates ismore efficient than the cascade of ternary Toffoli gates.
A generalized phase relaxation model with hysteresis
Authors: F. Luterotti, G. Schimperna, U. Stefanelli
Venue:  (2002)

A nonlinear system of PDE''s describing a phase transition phenomenon is introduced. The energy balance equation takes into account the action of the interior dissipative forces driven by the microscopic movements of particles. Moreover, it is assumed that the phase transition process is characterized by some hysteresis effect; this gives rise to a particular form of the kinetic equation for the order parameter. The existence of a local in time solution to the coupled system is proved via a Schauder fixed point argument. Global existence holds under suitable monotonicity, contractivity, and boundedness properties of the hysteresis operators characterizing the process. It is worthy noting that such assumptions are fulfilled in the physically relevant case. The extension argument relies on maximum principle techniques together with a comparison procedure.
Collaboration during conceptual design
Authors: L. D. Catledge, C. Potts
Venue: Proceedings of the 2nd International Conference on Requirements Engineering (ICRE '96) (1996)

Conceptual design involves requirements analysis, functional specification, and architectural design. It remains informal and poorly understood. We studied the conceptual design activities of a representative industrial software project, Centauri, for three months with follow up observations and discussions over the following six months. Our goal was to understand how patterns of collaboration and communication in project teams affect the convergence of the project on a common vision and a documented specification. We present our research methodology, our findings, and their implications for process and tool support. The following observations stand out. First, convergence on a common system vision was painfully slow. The major impediment to faster progress was the difficulty that the project team had in making critical allocation and interface design decisions. Second, Centauri project members repeatedly raised certain issues and failed to reach closure on key problems. Finally, we observed a persistent tension between the desire on behalf of nearly all project members to follow a prescriptive development process and the urgency of delivering a working product.
Dynamic Internet overlay deployment and management using the X-Bone
Authors: J. Touch
Venue: Proceedings of the 2000 International Conference on Network Protocols (2000)

The X-Bone dynamically deploys and manages Internet overlays to reduce their configuration effort and increase network component sharing. The X-Bone discovers, configures, and monitors network resources to create overlays over existing IP networks. Overlays are useful for deploying overlapping virtual networks on a shared infrastructure and for simplifying topology. The X-Bone extends current overlay management by adding dynamic resource discovery, deployment, and monitoring and allows simultaneous participation in multiple overlays. Its two-layer IP in IP tunneled overlays support existing applications and unmodified routing, multicast, and DNS services in unmodified operating systems. This two-layer scheme uniquely supports recursive overlays, useful for fault tolerance and dynamic relocation. The X-Bone uses multicast to simplify resource discovery, and provides secure deployment as well as secure overlays. This paper presents the X-Bone architecture, and discusses its components and features, and their performance impact.
Using fault injection to assess software engineering standards
Authors: J. M. Voas, K. W. Miller
Venue: Proceedings of the 2nd IEEE Software Engineering Standards Symposium (1995)

Standards for quality software are increasingly important, especially for critical systems. Development standards and practices must be subjected to quantitative analyses; it is no longer adequate to encourage practices because they "make sense" or "seem reasonable." Process improvement must be demonstrated by a history of improved products. Fault-injection methods can be used to assess the quality of software itself and to demonstrate the effectiveness of software processes. Fault-injection techniques can help developers move beyond the practical limitations of testing. Fault-injection techniques focus on software behavior, not structure; process-oriented techniques cannot measure behavior as precisely. Fault-injection methods are dynamic, empirical, and tractable; as such, they belie the notion that measuring the reliability of critical software is futile. Before focusing too narrowly on the assessment of software development processes, we should further explore the measurement of software behaviors.
Simple Error Recovery Scheme for Optimized LR-Parsers
Authors: Jerzy S. Krol
Venue:  (1981)

A new, simple and effective method for syntactic error recovery in optimized (reduced) LR-parsers is presented. This method, called the Simple Recovery and Correction scheme, is phrase oriented and performs local and some form of global contect correction. The error handling mechanism is driven by information obtainable from an LR-parser decision table. The formal basis for the method is the concept of synchronizing triple. A theoretical characterization of synchronizing triples is given and algorithms for direct extraction of recovery control information are presented. As a part of the SRC scheme a simplified method for the organization of LR-parser forward moves is introduced. In the last part of the paper the performance of the SRC scheme is illustrated in a specific case and implementation problems are discussed.
Formal Type Soundness for Cyclone''s Region System
Authors: Dan Grossman, Greg Morrisett, Trevor Jim, Mike Hicks, Yanling Wang, James Cheney
Venue:  (2001)

Cyclone is a polymorphic, type-safe programming language derived from C\@. The primary design goals of Cyclone are to let programmers control data representations and memory management without sacrificing type-safety. In this paper, we focus on the region-based memory management of Cyclone and its static typing discipline. The design incorporates several advancements, including support for region subtyping and a coherent integration with stack allocation and a garbage collector. To support separate compilation, Cyclone requires programmers to write some explicit region annotations, but uses a combination of default annotations, local type inference, and a novel treatment of region effects to reduce this burden. As a result, we integrate C idioms in a region-based framework. In our experience, porting legacy C to Cyclone has required altering about 8\% of the code; of the changes, only 6\% (of the 8\%) were region annotations. This technical report is really two documents in one: The first part is a paper submitted for publication in November, 2001. The second part is the full formal language and type-safety proof mentioned briefly in the first part. If you have already read a version of, ``Region-Based Memory Management in Cyclone'''', then you should proceed directly to Section 9.
Bibliography of Research in Natural Language Generation
Authors: Mark Kantrowitz
Venue:  (1993)

This document provides a 1200+ entry bibliography of natural language generation research. The BibTeX sources for the bibliography are available by anonymous ftp.
Finding Critical Sets
Authors: W D Loveland
Venue:  (1985)

Several algorithms are given for finding a critical subset $S$ determined by a binary monotonic set function over a given set $U$. A set $S$ is critical iff $f(T)~=~1$ for all $T$ such that $S~ \subseteq ~T$ and $f(R)~=~0$ for all $R$ such that $R~ \subset ~ S$. Upper bounds on the worst case times for the algorithms, determined by the number of calls to the binary set function, vary downwards from $2r \lceil lg _ {_ 2} n \rceil $ function calls. Here $n$ is the size of $U$ and $r$ is the size of the critical set found. We find that the conceptually easiest algorithm is not the easiest to program and also that the algorithms with better upper bounds fare more poorly in practice, based on a small sample of random trials. Although finding one critical set is easy we also show that it can quickly get very difficult to find additional critical sets, simply because it can be hard to separate known critical sets from further possible critical sets.
Practical Solutions for Calibration of Optical See-Through Devices
Authors: Yakup Genc, Mihran Tuceryan, Nassir Navab
Venue: Proceedings of the 1st International Symposium on Mixed and Augmented Reality (2002)

Registration is a crucial task in a see-through augmented reality (AR) system. The importance stems not only from the fact that registration requires careful calibration but also from the necessity that any calibration procedure should take into account the users. [14] proposed a general method for calibrating a see-through device based on dynamic alignment of virtual and real points. Although a powerful tool, our experiments showed that users find alignment of many points overwhelming.We introduce improvements to simplify the calibration process and increase the success rate. We first identified the causes why calibration parameters differ from user to user that can be prevented by adopting particular configurations for the tracker sensor and the display. This allowed us to re-use the existing calibrations. Furthermore, we have introduced a simpler model for the calibration that requires less number of user inputs, typically four, to calibrate the system.
Camel Sequences and Quadratic Residues
Authors: Gurvich V., Sheng Li
Venue:  (1999)

Given an even cyclic $(+1,-1)$ sequence $s = (s_0,..., s_{2n-1})$ which consists of $n$ plus ones and $n$ minus ones, let us compute $i + j \ (mod\ 2n)$ for all $n^2$ $(+1,-1)$-pairs $(s_i,s_j)$ and distribute obtained $n^2$ numbers between $2n$ "boxes" $1,2,...,2n-1,2n=0 \ (mod\ 2n)$. The average cardinality of a box is $\frac{n^2}{2n}=\frac{n}{2}$. Some sequences have quite remarkable box-distributions, "almost average everywhere with two big humps". For example, $n=5, s = (+1+1-1-1+1-1+1-1-1+1),\ B = (3333133330) = (3^4 1 \, 3^4 0)\ $ $n=7, s = (+1+1+1-1+1-1-1-1+1+1-1+1-1-1),\ B = (33333363333337) = (3^6 6 \, 3^6 7)$. In general, given an {\em odd} $n$, the box-distributions $(\lfloor\frac{n}{2}\rfloor^{n-1} \ (n-1) \\lfloor\frac{n}{2}\rfloor^{n-1} \ n)$ and $(\lceil\frac{n}{2}\rceil^{n-1} \ 1 \ \lceil\frac{n}{2}\rceil^{n-1} \ 0)$ as well as the sequences, which generate them, will be called the {\em camel distributions} and {\em camel sequences}, respectively {\em up-camel} and {\em down-camel}. For example, the first sequence above is down-camel, and the second one is up-camel. Camel sequences have applications in extremal graph theory. Here we prove that there are infinitely many ''camels'' of both types. More precisely, for every prime $n=4j-1$ we construct an up-camel sequence and for every prime $n=4j+1$ a down-camel one. In both cases these sequences are related to quadratic residues and non-residues modulo $n$. We conjecture that there are no other camel sequences. Key Words: quadratic residues, camel sequences, maximin, minimax, extremal graph theory, vertex-enumerated graphs.
Formal Derivation of Multilayered Hardware/Software Structures
Authors: Toomas P. Plaks
Venue: Proceedings of the 3rd IEEE International Conference on Formal Engineering Methods (2000)

This paper presents a formal method for synthesizing multilayered regular processor arrays from algorithm specification. Multilayered array is a structure where 2-D sub-arrays are connected into 3-D array only by one edge and thus, fits, for example, the structure of motherboard with FPGA daughter-boards. Synthesis of multilayered structures needs extensive use of algebraic transformations that is not possible using the classical regular array theory. We will apply the Iso-plane method that was developed for mapping reductions into regular arrays. In this paper we develop further the Iso-plane method and use it in a more general case - for decomposing a problem into parallel, loosely coupled parts (layers); provide the conditions for regular increasing the degree of parallelism in problem specification; introduce partial lexicographic orders for data propagation and provide the conditions for mapping data propagation structures onto arrays.
Kleene Algebra with Tests: Completeness and Decidability
Authors: Dexter Kozen, Frederick Smith
Venue:  (1996)

Kleene algebras with tests provide a rigorous framework for equational specification and verification. They have been used successfully in basic safety analysis, source-to-source program transformation, and concurrency control. We prove the completeness of the equational theory of Kleene algebra with tests and *-continuous Kleene algebra with tests over language-theoretic and relational models. We also show decidability. Cohen''s reduction of Kleene algebra with hypotheses of the form $r=0$ to Kleene algebra without hypotheses is simplified and extended to handle Kleene algebras with tests.
Development of Quantum Functional Devices for Multiple-Valued Logic Circuits
Authors: Toshio Baba
Venue: Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic (1999)

Quantum functional devices exhibiting unique current-voltage characteristics are reported for the application of multiple-valued logic circuits. Multiple negative-differential- resistance (NDR) characteristics in drain current-voltage characteristics are demonstrated by using multiple-junction surface tunnel transistors (MJ-STTs). Some multiple-valued logic gates such as inverter and literal are implemented using the MJ-STTs. Oscillatory characteristics of drain current under gate modulation are shown by single electron transistors. Nonvolatile multiple-valued memory devices utilizing these unique characteristics are described, and the fundamental operation of write and read of stored electrons are demonstrated.
The Automated Design of Parts Orienters
Authors: B. K. Natarajan
Venue:  (1986)

This paper concerns the design of parts orienters the dual to the motion planning problem. Three particular paradigms are considered and their abstractions to the computational domain lead to interesting problems in graph pebbling and function composition on finite sets. Polynomial time algorithms are developed for the abstracted problems.
Cooperation Protocols for Multimedia Communication Network based on ADIPS Framework
Authors: Takuo Suganuma, Tetsuo Kinoshita, Kenji Sugawara, Norio Shiratori
Venue: Proceedings of the 1998 International Conference on Parallel Processing Workshops (1998)

The growth of both the computer communication suchas the Internet, and the computational power of computersmakes the multimedia applications possible for commonuse. However, some significant problems are still remainedunsolved, e.g., the efficient use of resources and thedynamic control of applications for satisfying the users'required QoS. To solve these problems, we have proposedan agent-based approach to realize the flexible multimediacommunication based on ADIPS Framework. In this paper,we explain the cooperation protocols used in our flexiblevideoconference system and also demonstrate theflexibility in terms of QoS control achieved by agents'cooperation.
Understanding Some Software Quality Aspects from Architecture and Design Models
Authors: Lars Bratthall, Claes Wohlin
Venue: Proceedings of the 8th International Workshop on Program Comprehension (2000)

Software systems evolve over time and it is often difficult to maintain them. One reason for this is often that it is hard to understand the previous release. Further, even if architecture and design models are available and up to date, they primarily represent the functional behavior of the system. To evaluate whether it is possible to also represent some non-functional aspects, an experiment has been conducted. The objective of the experiment is to evaluate the cognitive suitability of some visual representations that can be used to represent a control relation, software component size and component external and internal complexity. Ten different representations are evaluated in a controlled environment using 35 subjects. The results from the experiment show that it is possible to also represent some non-functional aspects. It is concluded that the incorporation of these representations in architecture and design descriptions is both easy and probably worthwhile. The incorporation of the representations should enhance the understanding of previous releases and hence help software developers in evolving and maintaining complex software systems.
Old Theories, New Technologies: Cumulative Clutter Effects Using Augmented Reality
Authors: A. W. Stedmon, C. A. Cook
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

This paper investigates human cognitive performance when information is presented via Augmented Reality (AR) and overlaid upon a primary display. Initial results support traditional experimental paradigms of human memory [1] and comprehension of information [2], and have been used to compare AR and standard display formats when used in isolation. Results from these experiments provide a fundamental baseline for cognitive performance with a see-through AR headset. Furthermore the results lay the foundations for more comprehensive trials later in the research programme when the display formats are combined to provide a full AR facility. Consideration is given to the specific effects of cumulative clutter and two experiments are outlined that investigate the effects on target identification. Although the data are still being analysed, further consideration is given to key points addressed in the experimental design. Details of a dedicated website are provided where information will be consolidated and provide a basis for developing guidelines for the future development and application of AR technology.
Interactive Information Visualization of a Million Items
Authors: Jean-Daniel Fekete, Catherine Plaisant
Venue: Proceedings of the IEEE Symposium on Information Visualization (InfoVis'02) (2002)

Existing information visualization techniques are usually limited to the display of a few thousand items. This article describes new interactive techniques capable of handling a million items (effectively visible and manageable on screen). We evaluate the use of hardware-based techniques available with newer graphics cards, as well as new animation techniques and non-standard graphical features such as stereovision and overlap count. These techniques have been applied to two popular information visualizations: treemaps and scatter plot diagrams; but are generic enough to be applied to other 2D representations as well.
Alis: a light-weight logic synthesis for digital signal processing of audio visual
Authors: T. Yatani, K. Sato, M. Niizato
Venue: Proceedings of the 4th IEEE International Verilog HDL Conference (1995)

We have developed a high-speed, light-weight logic synthesis system, called Alis, with a high-level library of mathematical operation circuits for signal processing. Instead of minimizing circuit logic, we have concentrated on synthesizing better operation circuits using optimal cells of the target ASIC library because most of digital AV signal processing circuits are mathematical operation circuits. As a result, our system can synthesize circuits at least 10 times faster than conventional commercial synthesis systems.
Partial Pivoting Strategies for Symmetric Matrices
Authors: James R. Bunch
Venue:  (1972)

Partial pivoting strategies for the decomposition of symmetric matrices are discussed for solving symmetric (indefinite) systems of linear equations and for calculating the signature of symmetric matrices, in both the full and the sparse band cases. Keywords: diagonal pivoting, symmetric, indefinite, linear equations, signature, sparse, band.
Direct Annotation: A Drag-and-Drop Strategy for Labeling Photos
Venue: Proceedings of the International Conference on Information Visualisation (2000)

Annotating photos is such a time-consuming, tedious and error-prone data entry task that it discourages most owners of personal photo libraries. By allowing users to drag labels such as personal names from a scrolling list and drop them on a photo, we believe we can make the task faster, easier and more appealing. Since the names are entered in a database, searching for all photos of a friend or family member is dramatically simplified. We describe the user interface design and the database schema to support direct annotation, as implemented in our PhotoFinder prototype.