ppxscal/embedding_network huggingface dataset:
Modal Logic as a Design Notation
Authors: Carlos Areces, Miguel Felder, Dan Hirsch, Daniel Yankelevich
Venue: Proceedings of the 9th international workshop on Software specification and design (1998)

A notation to describe software system designs is given together with the means to verify properties over them. Designs are considered as models of a modal logic. The procedure to derive the modal model associated to a design, the algorithm to check properties over a model, the method to define new relations and the method of model filtration are presented. The proposed logic KPI a poly-modal logic with inverse operators) is used as a property specification language verified through a model checking algorithm. The methods provided proved to be effective and simple to implement. A prototype tool has been developed in SML-NJ covering all functionalities described.
Creation of Classifier Ensembles for Handwritten Word Recognition Using Feature Selection Algorithms
Authors: Simon Günter, Horst Bunke
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

The study of multiple classifier systems has become an area of intensive research in pattern recognition recently. Also in handwriting recognition, systems combining several classifiers have been investigated. In this paper new methods for the creation of classifier ensembles based on feature selection algorithms are introduced. Those new methods are evaluated and compared to existing approaches in the context of handwritten word recognition, using a hidden Markov model recognizer as basic classifier.
Optimality of size-width tradeoffs for resolution
Authors: Maria Luisa Bonet, Nicola Galesi
Venue: Computational Complexity (2002)

This paper is concerned with the complexity of proofs and of searching for proofs in resolution. We show that the recently proposed algorithm of Ben-Sasson & Wigderson for searching for proofs in resolution cannot give better than weakly exponential performance. This is a consequence of our main result: we show the optimality of the general relationship called size-width tradeoff in Ben-Sasson & Wigderson. Moreover we obtain the optimality of the size-width tradeoff for the widely used restrictions of resolution: regular, Davis-Putnam, negative, positive.
A Proof Procedure for the Logic of Hereditary Harrop Formulas
Authors: Gopalan Nadathur
Venue:  (1992)

A proof procedure is presented for a class of formulas in intuitionistic logic. These formulas are the so-called {\em goal formulas} in the theory of hereditary Harrop formulas. Proof search in intuitionistic logic is complicated by the non-existence of a Herbrand-like theorem for this logic: formulas cannot in general be preprocessed into a form such as the clausal form and the construction of a proof is often sensitive to the order in which the connectives and quantifiers are analyzed. An interesting aspect of the formulas we consider here is that this analysis can be carried out in a relatively controlled manner in their context. In particular, the task of finding a proof can be reduced to one of demonstrating that a formula follows from a set of assumptions with the next step in this process being determined by the structure of the conclusion formula. An acceptable implementation of this observation must utilize unification. However, since our formulas may contain universal and existential quantifiers in mixed order, care must be exercised to ensure the correctness of unification. One way of realizing this requirement involves labelling constants and variables and then using these labels to constrain unification. This form of unification is presented and used in a proof procedure for goal formulas in a first-order version of hereditary Harrop formulas. Modifications to this procedure for the relevant formulas in a higher-order logic are also described. The proof procedure that we present has a practical value in that it provides the basis for an implementation of the logic programming language $\lambda$ Prolog.
A corrected version of the Duchet Kernel Conjecture
Authors: E. Boros, V. Gurvich
Venue:  (1996)

In 1980 Piere Duchet conjectured that odd directed cycles are the only edge minimal kernel-less connected digraphs i.e. in which after the removal of any edge a kernel appears. Although this conjecture was disproved recently by Apartsin, Ferapontova and Gurvich (1996), the following modification of Duchet''s conjecture still holds: odd holes (i.e. odd non-directed chordless cycles of length 5 or more) are the only connected graphs which are not kernel-solvable but after the removal of any edge the resulting graph is kernel-solvable.
Predicting Unseen Triphones with Senones
Authors: Mei Hwang, Xuedong Huang, Fileno Alleva
Venue:  (1993)

In large-vocabulary speech recognition, the decoder often encounters triphones that are not covered in the training data. These unseen triphones are usually represented by corresponding diphones or context independent monophones. We propose to use decision-tree based senones to generate needed senonic baseforms for unseen triphones. A decision tree is built for each individual Markov state of each phone, and the leaves of the trees constitute the senone codebook. To find the senone a Markov state of any triphone is associated with, we traverse the corresponding tree until we reach a leaf node, where a senone is represented. We used the DARPA 5,000-word speaker-independent Wall Street Journal dictation task to evaluate the proposed method. The word error rate was reduced by 11% when unseen triphones were modeled by the decision-tree based senones. When there were at least 5 unseen triphones in each test utterance, the error rate could be reduced by more than 20%.
FileMaker Pro 6 Advanced for Windows and Macintosh: Visual QuickPro Guide
Authors: Cyndi Baron, Dan Peck
Venue:  (2003)

:Feel as if you've done all that you can do with FileMaker? FileMaker Pro 6 Advanced for Windows and Macintosh: Visual QuickPro Guide will help you do more. It's the most efficient way for smart, creative, busy professionals like yourself to learn how to build custom databases using scripts and templates, and to share and manage information with your colleagues in the next cubicle, over an intranet, or on the Web. Updated to include all of the new features in FileMaker 6, FileMaker Pro 6 Advanced for Windows and Macintosh: Visual QuickPro Guide covers advanced techniques for working with digital photos, taking advantage of the program's new XML support, using advanced querying features, and working with the program's improved style sheet management tools to design Web pages even faster and easier than before. This handy guide combines a visual approach with straightforward, step-by-step instructions, concise explanations of database techniques, and task-based learning. Taking the highly accessible instructional format of the popular QuickStart Guides to a more advanced level, the book guides readers through all the intricacies and new features of this top-selling database application.
On approximate irreducibility of polynomials in several variables
Authors: Erich Kaltofen, John May
Venue: Proceedings of the 2003 international symposium on Symbolic and algebraic computation (2003)

We study the problem of bounding a polynomial away from polynomials which are absolutely irreducible. Such separation bounds are useful for testing whether a numerical polynomial is absolutely irreducible, given a certain tolerance on its coefficients. Using an absolute irreducibility criterion due to Ruppert, we are able to find useful separation bounds, in several norms, for bivariate polynomials. We also use Ruppert's criterion to derive new, more effective Noether forms for polynomials of arbitrarily many variables. These forms lead to small separation bounds for polynomials of arbitrarily many variables.
Enabling Implicit Human Computer Interaction: A Wearable RFID-Tag Reader
Authors: Albrecht Schmidt, Hans-W. Gellersen, Christian Merz
Venue: Proceedings of the 4th IEEE International Symposium on Wearable Computers (2000)

Implicit human computer interaction is based on the concept of using user activity in the real world as input to computers. Implicit HCI can help to reduce the problem of user input to wearable computers. In this paper, we report on wearable RFID technology that facilitates applications that are triggered by handling tagged physical objects. We also report on a case study in which the technology was integrated with an enterprise resource planning system to optimize work processes that involve physical objects.
Extensible Query Processing in an Object-Oreinted Database
Authors: Gail A Mitchell
Venue:  (1993)

In this thesis we address the problem of providing efficient processing of queries in the extensible environment induced by object-oriented databases. We define a framework for query processing in an object-oriented database and develop designs for major components of this framework. The framework encompasses an object-oriented data model, an algebra to query over that model, transformation rules for the algebra, an internal representation for queries expressed in the algebra, a cost model for analyzing query expressions, and an architecture for an extensible query optimizer. The major contributions of this thesis are an algebra and transformation rules, a representation, and an architecture for extensible query optimization. We show how these components fit into the framework and interact with each other. The EQUAL query algebra presented in this thesis is the first query algebra for object-oriented database systems to be completely consistent with data abstraction, and one of the few to propose operations for the creation and manipulation of objects with identity. We present transformation rules for this algebra, and a theory of equivalence for query expressions involving object-building operations. We also define an internal representation for query expressions that is annotated with information that can be used during query optimization, and can be extended to represent new operations and annotations. We present Epoq, a novel approach to extensible query optimization. An Epoq optimizer integrates diverse strategies for controlling the optimization of a query and adapts to the addition of new strategies for control. We give a formal basis for this approach and specify an architecture that embodies the approach. We define the control problem for extensible query optimization and present a solution to this problem that is based on planning the optimization process. The planning-based control can combine the optimization strategies in different ways depending on the characteristics of the query being processed. The architecture and control are illustrated with an extensive example optimizer that integates optimization strategies described in the literature with strategies developed specifically for EQUAL.
Analysis of mixed finite elements for laminated composite plates
Authors: Ferdinando Auricchio, Carlo Lovadina, Elio Sacco
Venue:  (1999)

The approximation to the solution of a laminated plate problem is considered. The main result consists in proving that a performant scheme can be obtained by simply coupling a standard membrane element for the in-plane dispacements with a robust method for plate bending problem in the case of homogeneous material. A rigorous convergence analysis is developed for the case of clamped boundary conditions. Numerical results are presented, showing the accordance between the theoretical results and the actual computations. EMAIL:: lovadina@ing.unitn.it
WebDAV: Next Generation Collaborative Web Authoring
Authors: Lisa B. Dusseault
Venue:  (2003)

:The definitive guide to WebDAV authoring, management, and publishing.Web-based Distributed Authoring and Versioning (WebDAV) is the IETF standard protocol for Web site authoring and wide area collaboration. WebDAV's document sharing and management services make it the ideal platform for Internet file and data management applications. This comprehensive book covers the WebDAV protocol from bits on the wire all the way to custom application design and implementation.Experienced WebDAV implementer Lisa Dusseault describes how WebDAV is supposed to behave but also illustrates that behavior with numerous examples and protocol traces from real clients and servers. The author covers each protocol feature, first explaining how it works and then illustrating its use in a live implementation. In each case, the author describes not only how the protocol was supposed to work, but how it actually does, with attention to the steps required to make a working implementation.This book delivers crucial details needed by application designers, software engineers, and information managers:Complete coverage of the protocol and popular implementations.Practical design rules for quickly designing and deploying any WebDAV-based applicationReal-world application case studies, including online calendaring and photo albumsTwo chapters on building custom WebDAV applications, including ready-to-run examples compatible with Internet ExplorerCoverage of the new Versioning and Access Control standards
Embedded Linux Outlook in the PostPC Industry
Authors: Seongsoo Hong
Venue: Proceedings of the Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2003)

This paper presents an analysis of the future of Embedded Linux in the PostPC industry. This analysis is carried out by first examining the current forces at work in the PostPC market and how they effect Linux. Next, we look at the future trends in the PostPC market for the many types of devices we see in the market now and will see in the future and how well these trends can be addressed by Embedded Linux and other RTOSes in the marketplace. The third step in this analysis is to examine the qualities of Linux itself and what gives it an advantage in the marketplace as well as the challenges that accompany using Linux as an embedded platform.We address the challenges that Embedded Linux faces by proposing the need for the standardization of Embedded Linux. This means building a core standard for a kernel that is optimized for embedded systems, standard middleware profiles for powering different applications, and a standard for addressing intellectual property and software components.
Incorporating System Resource Information into Flow Control
Authors: Takako M. Hickey, Robbert Van Renesse
Venue:  (1995)

Upcall-based distributed systems have become widespread in recent years. While upcall-based systems provide some obvious advantages, experiences with these systems have exposed unanticipated problems of unpredictability and inefficiency. Incorporating system resources information into flow control is essential in solving these problems. Variants of window-based flow control suitable for distributed systems are investigated. Next, message packing, which improves network bandwidth usage efficiency, and, consequently, message throughput, is presented. Finally, a back pressure mechanism which controls admission of messages into the system by blocking applications at high load is presented. The combination of the window mechanism and the back pressure mechanism provides end-to-end management of system resources. The former manages network resources, while the latter manages operating system resources. The combination maintains good throughput even under high load.
The War Between Mice and Elephants
Authors: Liang Guo, Ibrahim Matta
Venue:  (2001)

Abstract Recent measurement based studies reveal that most of the Internet connections are short in terms of the amount of traffic they carry (mice), while a small fraction of the connections are carrying a large portion of the traffic (elephants). A careful study of the TCP protocol shows that without help from an Active Queue Management (AQM) policy, short connections tend to lose to long connections in their competition for bandwidth. This is because short connections do not gain detailed knowledge of the network state, and therefore they are doomed to be less competitive due to the conservative nature of the TCP congestion control algorithm. Inspired by the Differentiated Services (Diffserv) architecture, we propose to give preferential treatment to short connections inside the bottleneck queue, so that short connections experience less packet drop rate than long connections. This is done by employing the RIO (RED with In and Out) queue management policy which uses different drop functions for different classes of traffic. Our simulation results show that: (1) in a highly loaded network, preferential treatment is necessary to provide short TCP connections with better response time and fairness without hurting the performance of long TCP connections; (2) the proposed scheme still delivers packets in FIFO manner at each link, thus it maintains statistical multiplexing gain and does not misorder packets; (3) choosing a smaller default initial timeout value for TCP can help enhance the performance of short TCP flows, however not as effectively as our scheme and with the risk of congestion collapse; (4) in the worst case, our proposal works as well as a regular RED scheme, in terms of response time and goodput.
An algorithm for drum storage management in time-sharing systems
Authors: Mark L. Greenberg
Venue: ACM SIGOPS Operating Systems Review (1972)

An algorithm for efficiently managing the transfer of pages of information between main and secondary memory is developed and analyzed. The alogorithm applies to time-shared computer systems that use rotatlng magnetic drums as secondary storage devices. The algorithm is designed to provide efficient system performance when referenced pages are predominantly pre-loaded. However, the algorithm also provides optimum results for systems where all pages are loaded on demand. The nature of the improved performance which can be derived from page pre-loading strategy is discussed. Simulation results are presented which plot system performance as a function of main memory size.
Cascade Realizations of Two-valued Input Multiple-Valued Output Functions using Decomposition of Group Functions
Authors: Tsutomu Sasao
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

This paper considers a method to realize a two-valued inputthree-valued output function f : {0; 1}n \to {0,1,2}by using a cascade of four-input cells. Decomposition ofa group function is used to find a canonical form. Weshow that the Walsh spectrum specifies the canonical form,and the number of non-zero coefficients in the spectrumis proportional to the number of cells in the cascade. Finally,we show a design algorithm for a p-valued functionf : {0,1}n \to {0,1,...,p-1}. The designed cascadesare reversible and conservative.
A Randomized Error Recovery Algorithm for Reliable Multicast
Authors: Zhen Xiao, Ken Birman
Venue:  (2000)

An efficient error recovery algorithm is essential for reliable multicast in large groups. Tree-based protocols (RMTP, TMTP, LBRRM) group receivers into local regions and select a repair server for performing error recovery in each region. Hence a single server bears the entire responsibility of error recovery for a region. In addition, the deployment of repair servers requires topological information of the underlying multicast tree, which is generally not available at the transport layer. This paper presents RRMP, a randomized reliable multicast protocol which improves the robustness of tree-based protocols by diffusing the responsibility of error recovery among all members in a group. The protocol works well within the existing IP multicast framework and does not require additional support from routers. Both analysis and simulation results show that the performance penalty due to randomization is low and can be tuned according to application requirements.
Building Software Quality Classification Trees: Approach, Experimentation, Evaluation
Authors: Ryouei Takahashi, Yoichi Muraoka, Yukihiro Nakamura
Venue: Proceedings of the Eighth International Symposium on Software Reliability Engineering (1997)

A methodology for constructing an optimum software quality classification tree using software complexity metrics to discriminate between high-quality modules and low-quality modules is proposed. The process of tree generation is an application of the AIC (Akaike Information Criterion) procedures to the binomial distribution. AIC procedures are based on maximum likelihood estimation and the least number of complexity metrics. It is an improvement of the software quality classification tree generation method proposed by Porter and Selby from the viewpoint the complexity metrics are minimized. The problems of their method are that the software quality prediction model is unstable because it reflects observational errors in real data too much and there is no objective criterion for determining whether the discrimination is appropriate or not at a deep nesting level of the classification tree when the number of sample modules gets smaller. To solve these problems a new metric is introduced and its validity is theoretically and experimentally verified. In our examples, complexity metrics written in C language such as lines of source code, Halstead's software science, McCabe's cyclomatic number, Henry and Kafura's fan-in/out, Howatt and Baker's s cope number and reuse-ratio, are investigated. Our experiments with a medium-sized piece of software (85 thousand lines of source code: 562 samples) show that the software quality classification tree generated by our new metric identifies the target class of the observed modules more efficiently using the minimum number of complexity metrics without any decrease of the correct classification ratio (76%->72%) than the conventional classification tree.
The Theory of Rectangular Hybrid Automata
Authors: Peter W. Kopke
Venue:  (1996)

A {\em hybrid automaton\/} consists of a finite automaton interacting with a dynamical system. Hybrid automata are used to model embedded controllers and other systems that consist of interacting discrete and continuous components. A hybrid automaton is {\em rectangular\/} if each of its continuous variables~$x$ satisfies a nondeterministic differential equation of the form $a\le\frac{dx}{dt}\le b$, where $a$ and~$b$ are rational constants. Rectangular hybrid automata are particularly useful for the analysis of communication protocols in which local clocks have bounded drift, and for the conservative approximation of systems with more complex continuous behavior. We examine several verification problems on the class of rectangular hybrid automata, including reachability, temporal logic model checking, and controller synthesis. Both dense-time and discrete-time models are considered. We identify subclasses of rectangular hybrid automata for which these problems are decidable and give complexity analyses. An investigation of the structural properties of rectangular hybrid automata is undertaken. One method for proving the decidability of verification problems on infinite-state systems is to find finite quotient systems on which analysis can proceed. Three state-space equivalence relations with strong connections to temporal logic are bisimilarity, similarity, and language equivalence. We characterize the quotient spaces of rectangular hybrid automata with respect to these equivalence relations.