ppxscal/embedding_network huggingface dataset:
DT-an automated theorem prover for multiple-valued first-order predicate logics
Authors: S. Gerberding
Venue: Proceedings of the 26th International Symposium on Multiple-Valued Logic (1996)

We describe the automated theorem prover "Deep Thought" (DT). The prover can be used for arbitrary multiple-valued first-order logics, provided the connectives can be defined by truth tables and the quantifiers are generalizations of the classical universal resp. existential quantifiers. DT has been tested with many interesting multiple-valued logics as well as classical first-order predicate logic. DT uses a free-variable semantic tableau calculus with generalized signs. For the existential tableau-rules two liberalized versions are implemented. The system utilizes a static index to control the application of axioms as wells as the search for applicable rules. A dynamic lemma generation strategy and various heuristics to control the tableau expansion and branch closure are integrated into DT. Theoretically, contradiction sets of arbitrary size can be discovered to close a branch.
An information-theoretic approach for argument interpretation in a conversational setting
Authors: Sarah George, Ingrid Zukerman, Mark George
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

We describe an information-theoretic argument-interpretation mechanism embedded in an interactive system. Our mechanism applies the Minimum Message Length principle to evaluate candidate interpretations and select the best candidate. It receives as input an argument entered through a web interface, and produces an interpretation in terms of its underlying knowledge representation -- a Bayesian network. The results of our preliminary evaluations are encouraging, with the system generally producing plausible interpretations of users' arguments.
Error Detection and DEM Fusion Using Self-Consistency
Authors: Howard Schultz, Edward M. Riseman, Frank R. Stolle, Dong-Min Woo
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

The ability to efficiently and robustly recover accurate 3D terrain models from sets of stereoscopic images is important to many civilian and military applications. Our long-term goal is to develop an automatic, multi-image 3D reconstruction algorithm that can be applied to these domains. To develop an effective and practical terrain modeling system, methods must be found for detecting unreliable elevations in digital elevation maps (DEMs), and for fusing several DEMs from multiple sources into an accurate and reliable result.This paper focuses on two key factors for generating robust 3D terrain models, (1) the ability to detect unreliable elevations estimates, and (2) to fuse the reliable elevations into a single optimal terrain model . The techniques discussed in this paper are based on the concept of using self-consistency to identify potentially unreliable points. We apply the self-consistency methodology to both the two-image and multi-image scenarios.We demonstrate that the recently developed concept of self-consistency can be effectively employed to determine the reliability of values in a DEM. Estimates with a reliability below an error threshold can be excluded from further processing. We test the effectiveness of the methodology, as well as the relationship between error rate and scene geometry by processing both real and photo-realistic simulations.
A Wearable Cross-language Communication Aid
Authors: Jani Patokallio, Nigel Ward
Venue: Proceedings of the 5th IEEE International Symposium on Wearable Computers (2001)

This paper presents a wearable device, the Yak, that aids cross-language communication. The Yak produces utterances in the native's langauge at the user's command. The use of a heads-up display allows the user to operate the device while maintaining eye contact with the native and sending and receiving non-verbal signals. This paper describes requirements for a communication aid, the Yak's user interface, the Yak's current hardware configuration and scripting language, and the results of the first round of experiments.
The Minimum Spanner Problem on Butterfly Graphs
Authors: S.-C. Hwang, G.-H. Chen
Venue: Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks (2000)

Given a connected graph G, a spanning subgraph G' of Gis called a t-spanner if every pair of two adjacent verticesin G has a distance of at most t in G! A t-spanner of agraph G is minimum if it contains minimum number ofedges among all t-spanners of G. Finding minimumspanners for general graphs is rather difficult. Most ofprevious results were obtained for some particular graphs,e.g., butterfly graphs, cube-connected cycles, de Bruijngraphs, Kautz graphs, complete bipartite graphs, andpermutation graphs. The butterfly graphs were originallyintroduced as the underlying graphs of FFT networkswhich can perform the fast Fourier transform (FFT) veryeficiently. In this paper, we successfully construct most ofthe minimum t-spanners for the k-ary r-dimensionalbutterfly graphs for 2 \leq t \leq 6 and t = 8.
Some Results Concerning the Ends of Minimal Cuts of Simple Graphs
Authors: Ning Jia, Xiaofeng Jia
Venue:  (1997)

Let S be a cut of a simple connected graph G.If S has no proper subset that is a cut, we say S is a minimal cut of G. To a minimal cut S, a connected component of G-S is called a fragment. And a fragment with no proper subset that is also a fragment is called an end. We characterized ends in our discussions and proved that to a connected graph G=(V,E), the number of its ends>=|V(G)|.
Computer simulations in solid-state NMR. II. implementations for static and rotating samples
Authors: Mattias Edén
Venue: Concepts in Magnetic Resonance: an Educational Journal (2003)

In the first article in this series (Concepts Magn Reson Part A 17A: 117-154, 2003), we outlined a theoretical framework for calculating solid-state NMR time-domain signals and frequency-domain spectra. This article explains how the theory may be implemented on a computer for simulating NMR signals from a single crystal in a static and rotating sample. The general building blocks of a computer program for numerically calculating NMR signals are discussed. Computer algorithms for carrying out the simulations are presented as flowcharts and implemented in C/C++ code.
A multidisciplinary collaborative design system for civil engineering projects
Authors: M. Sun, G. Aouad, N. Bakis
Venue: Proceedings of the sixth international conference on Application of artificial intelligence to civil & structural engineering (2001)

Water treatment projects usually involve large capital investment. Design appraisal is crucial to ensure project quality and cost effectiveness. It gives the design team opportunity to evaluate every aspect of a proposed design solution at the design stage when the benefits for change are high and cost is low. Unfortunately, due to the communication bottleneck between the often remotely located design team members, the design appraisal process is usually very time consuming. As a result, design decisions are often made without thorough evaluation and appraisal. The paper describes a multidisciplinary collaborative design system that enables a design team to work in collaboration, carry out what-if analysis and optimise the design for water treatment projects.
System-Level Design: Designers' Wish List vs. Reality
Authors: Daniel Gajski, Reinaldo Bergamaschi
Venue: Proceedings of the 12th international symposium on System synthesis (1999)

System level design has brought together a number of formidable challenges, such as methodology, software and hardware design and design automation, to name a few. More than ever, the successful design of a system requires all these challenges to be addressed - by both the designers and the design automation tools.Designers, better and anyone else, know what the problems are. Design automation companies claim to know how to solve them and have the products to prove it. Is this really true? Are the design automation tools really solving the hard problems or skimming over the real challenges. This panel addresses exactly that by confronting the views of distinguished designers and tools developers.The panelists belong to two teams. The designer team will present the main problems in doing system design including verification, IP use, integration and synthesis among others, and try to show that many of the real problems are not being addressed by current tools. The tools team will explain how the tools are indeed tackling the real problems and how the designers can make the best use out of them.The attendees can expect a very interesting, informative and technical debate. At the end, the audience will be the judge and a verdict will be passed on what the real problems are, which ones can be solved with existing tools, and what needs to be done in the future to address the system design challenges.
The Use of Nonlinear Elimination in Steady-State Circuit \& Device Simulation
Authors: J D Rose, Paul Lanzkron, James Wilkes, Stephan Muller, Wolfgang Fichtner
Venue:  (1992)

Certain problems in steady-state circuit and device simulation demonstrate slow convergence using global Newton''s method. We introduce a method that has been shown to be effective in solving these types of problems. The method is based on nonlinear elimination. We will outline how to implement the method and give various examples from both circuit and device simulation in which the method converges.
A study on the effect of architecture on maintainability of object-oriented systems
Authors: P. Hsia, A. Gupta, C. Kung, J. Peng, S. Liu
Venue: Proceedings of the International Conference on Software Maintenance (1995)

Software development techniques have seen significant progress since the 1960s. Most research accomplishments have been in software development but not in software maintenance. This is also true for the object-oriented paradigm. We believe that the features of object-oriented approach have a significant impact on maintainability. We report an incipient study indicating that the architecture of an object-oriented system indeed affects its maintainability. This is attributed to the structure of its inheritance hierarchy, among other factors. We also attempt to provide some rationale behind this phenomenon. The possible tension between object reuse and the maintainability of its product is also discussed in the paper.
Distributed checkpointing based on influential messages
Authors: K. Tanaka, M. Takizawa
Venue: Proceedings of the 1996 International Conference on Parallel and Distributed Systems (1996)

In distributed applications, a group of multiple objects are cooperated to achieve some objectives. The computation on the objects are based on the massage passing, i.e. remote procedure call. The objects may suffer from different kinds of faults. In the presence of the object faults, the states of the objects in the system have to be kept consistent. If some object o is faulty, o is rolled back to the checkpoint and objects which have received messages from o are also required to be rolled back. In this paper, we define influential messages whose receivers are required to be rolled back from the application point of view if the senders are rolled back on the basis of the message semantics. By using the influential messages, we would like to define a significant checkpoint which denotes a consistent global state of the system but might be inconsistent from the traditional definition. We would like to present protocols for taking the significant checkpoint and for rolling back the objects by using the influential messages.
Synchronization of communicating processes
Authors: A. Nico Habermann
Venue: ACM SIGOPS Operating Systems Review (1972)

Formalization of a well-defined synchronization mechanism can be used to prove that concurrently running processes of a system communicate correctly. This is demonstrated for a system consisting of many sending processes which deposit messages in a buffer and many receiving processes which remove messages from that buffer. The formal description makes it very easy to prove that the buffer will neither overflow nor underflow, that senders and receivers will never operate on the same message frame in the buffer nor will they run into a deadlock.
Efficient Restoration of Multicolor Images with Independent Noise
Authors: Yuri Boykov, Olga Veksler, Ramin Zabih
Venue:  (1998)

We consider the problem of maximum a posteriori (MAP) restoration of multicolor images where each pixel has been degraded by independent arbitrary noise. We assume that the prior distribution is given by a Markov random field with pairwise site interactions. We concentrate on two classes of site interactions: two-valued site interactions, which form a generalized Potts model; and linear site interactions. We give efficient algorithms based on graph cuts for both classes. The MAP estimate for a generalized Potts model can be computed by solving a multiway minimum cut problem on a graph. While this graph problem is computationally intractable, there are fast algorithms for computing provably good approximations. These algorithms can be generalized to compute an efficient approximation for a nearly arbitrary pairwise site interaction. The exact MAP estimate with linear site interactions can be computed efficiently by solving a minimum cut problem on a graph.
Developing the Theory of Optical ESR and NMR for Ultra High Resolution Investigations of Proteins and Other Complex Materials
Authors: M. W. Evans
Venue:  (1990)

A circularly polarised pump laser produces magnetisation, and has the effect of enriching and shifting to higher frequencies a conventional ESR and NMR spectrum. A mediating property in these effects is the gyroptic ratio, which links the appropriate angular momenta to the appropriate imaginary part of the dynamic atomic or molecular polarisability. The gyroptic ratio is analogous with the gyromagnetic ratio of conventional ESR, and the nuclear gyromagnetic ratio of conventional NMR. The gyroptic ratios are developed in this paper in terms of fundamental quantities. The electronic gyroptic ratio is found to be proportional to the effective electronic orbital area, inversely proportional to the magnitude of the electronic angular momentum, proportional to the circularly polarised pump laser frequency, and becomes infinite at resonance, when the pump laser is tuned exactly to a transition frequency. These properties determine the optimum conditions for maximum effect in laser ESR, and analogous results are obtained for laser NMR. The theory is developed to encompass, within the contexts of both laser ESR and NMR, chemical shifts and shielding constants, shielding by neighboring groups, the g value, spin spin coupling, hyperfire interaction, and the potential development of optical imaging NMR and ESR using magnetic and electromagnetic field gradients.
WME: towards a web for mathematics education
Authors: Paul S. Wang, Norbert Kajler, Yi Zhou, Xiao Zou
Venue: Proceedings of the 2003 international symposium on Symbolic and algebraic computation (2003)

Reported is an approach for Web-based Mathematics Education (WME). The WME framework is a distributed system that aims to create a Web for mathematics education. Components of the WME framework include the Mathematics Education Markup Language (MeML) for page markup, regular Web servers to deliver pages, WME Page Processors to enable common Web browsers to receive MeML pages, and a variety of WME services (mathematical and educational) to supply power and interactivity to MeML pages. The MeML language supports the creation of efficient, effective, and dynamic mathematics education content. The WME architecture is designed so that mathematics education contents (static and/or dynamic) and remote WME services can be built independently, maintained independently, deployed easily, and still interoperate and reinforce one another on a global scale.
Authoring human figure animation in a multimedia system
Authors: Palamidese Patrizia, Giorgetti Daniela
Venue:  (1999)

Designing and simulating complex scenes which include multiple actors and other elements such as lighting, speech, and music is a complex task which requires specialized software and experienced animators. This report addresses the issue to get approximate but rapid design of animated scenes to concretize and preview possible ideas without spending too much time specifying all the details. A user-priented approach relying on a building block basis is proposed, which applies to all the elements in a scene including human figure animations. Animations are generated by adapting existing key framed motion data. This is a general strategy which is applicable to all movements and speeds up considerably the composition of complex animated scenes. It is extended to generate cyclic movements such as walking and running. A tool to design and edit a scene interactively and display the simulation in real time on a standard PC is used to test this approach.
Handwritten Digit Recognition Using State-of-the-Art Techniques
Authors: Cheng-Lin Liu, Kazuki Nakashima, Hiroshi Sako, Hiromichi Fujisawa
Venue: Proceedings of the Eighth International Workshop on Frontiers in Handwriting Recognition (IWFHR'02) (2002)

This paper presents the latest results of handwritten digit recognition on well-known image databases using state-of-the-art featur e extr action and classic action techniques.The tested databases are CENPARMI, CEDAR, and MNIST. On the test dataset of each database, 56 recognition accuracies are given by combining 7 classifiers with 8 feature vectors. All the classifiers and feature vectors give high accuracies. Among the features, the chaincode feature and gradient feature show advantages, and the profile structure feature shows efficiency as a complementary feature. In comparison of classifiers, the support vector classifier with RBF kernel (SVC-rbf) gives the highest accuracy but is extremely expensive in storage and computation. Among the non-SV classifiers, the polynomial classifier (PC) performs best, followed by a learning quadratic discriminant function (LQDF) classifier. The results are competitive compared to previous ones and they provide a baseline for evaluation of future works.
The Word-Level Models for Efficient Computation of Multiple-Valued Functions. PART 2: LWL Based Model
Authors: Anna M. Tomaszewska, Svetlana N. Yanushkevich, Vlad P. Shmerko
Venue: Proceedings of the 32nd International Symposium on Multiple-Valued Logic (2002)

This paper is a continuation of the study of Neural-Like Networks (NLNs) for computation of Multiple-Valued Logic (MVL) functions. NLN is defined as a feedforward network with no learning.In contrast to classical neural network with Threshold Gates(TGs), theproposed NLN built of so-called Neuron-Like Gates (NLGs). It wasshown in our previously study that NLG is modelled by a Linear Arithmetical expression(LAR). In this paper we show even more simple NLG model. We have developed two word-levelmodels, Linear Weighted Logic expression (LWL) and a corresponding set ofLinearDecision Diagrams (LDDs).We compare the LWL- and LAR-based NLNs. The experimental study on large MVL circuits shows that the number of nodes in the LDD derived from LWLs is four times less in average compared to those derived from LARs. They are also 2-7times more compact (require less memory to storethe terminal values).
Optimal Feedback Control for ABR Service in ATM
Authors: Paolo Narvaez, Kai-Yeung Siu
Venue: Proceedings of the 1997 International Conference on Network Protocols (ICNP '97) (1997)

The efficient support of data traffic over ATM networks requires congestion control, whose objectives include maximizing throughput, minimizing switch buffer requirement, and obtaining a fair bandwidth allocation. With available bit rate (ABR) service in ATM, congestion control is achieved by requiring data sources to adjust their rates based on the feedback from the network. The difficulties in providing effective ABR service are caused by the burstiness of data traffic, the dynamic nature of the available bandwidth, as well as the feedback delay. Using a new design methodology described in our previous paper, we design a congestion control algorithm that is provably stable and is optimal in the sense that it has the shortest possible transient response time. Moreover, our algorithm achieves fair bandwidth allocation among contending connections and maximizes network throughput. It also delivers good performance for switches that use a FIFO queuing discipline. Essentially, the algorithm implicitly measures the round-trip delay using resource management cells, and establishes an observer (in the control theoretic sense) to control the flow of data in the network. Rigorous analysis as well as simulation results are presented to substantiate our claims.
Numerical deconvolution by a Monte Carlo approach with application to dynamic cardiac perfusion Tc-99m SPECT
Authors: Koon-Pong Wong, Steven R. Meikle, David Dagan Feng, Michael J. Fulham
Venue: Proceedings of the Pan-Sydney area workshop on Visual information processing - Volume 11 (2001)

Accurate determination of the input function is essential for absolute quantification of physiological parameters in PET and SPECT imaging but it requires an invasive and tedious procedure of blood sampling that is impractical in clinical studies. We previously proposed a technique that simultaneously estimates kinetic parameters and the input function from the tissue impulse response functions and which, requires only two blood samples. A nonlinear least squares method was used to estimate all the parameters in the impulse response functions and the input function but it fails occasionally due to high noise levels in the data causing an ill-conditioned cost function. This study investigates the feasibility of applying a Monte Carlo method called simulated annealing to estimate kinetic parameters in the impulse response functions and the input function. Time-activity curves of teboroxime, which is very sensitive to changes in the input function, were simulated based on published data obtained from a canine model. The equations describing the tracer kinetics in different regions were minimised simultaneously by simulated annealing and nonlinear least squares. We found that the physiological parameters obtained with simulated annealing are more accurate and the estimated input function more closely resembled the simulated curve. We conclude that simulated annealing reduces bias in the estimation of physiological parameters and determination of the input function.
Characterizing the Current Degradation of Abnormally Structured MOS Transistors Using a 3D Poisson Solver
Authors: Chang-Sub Lee, Gi-Young Yang
Venue: Proceedings of the 3rd International Symposium on Quality Electronic Design (2002)

An efficient modeling methodology for abnormally structured MOS transistors, which have irregular contacts, polygonal diffusion areas, or curved gate patterns, is presented. The DC Performances of the abnormal transistors are worse compared to those of normal transistors in general. Therefore, it is important for designers to model the current degradation effects of the abnormal transistors with keeping the physical meaning at the circuit simulation stage. Contrary to the previous method utilizing a 3D device simulator which needs a sophisticated calibration work and long simulation times, only the 3D Poisson solver is employed to characterize the current degradation effects by extracting the parasitic source and drain resistances, and the effective transistor width of the abnormal transistors. In this paper, overall flow of the proposed method, which needs no calibration work and short simulation time, is discussed. Applications to the abnormal transistors with U-shaped and tilted gates in the 0.17 um DRAM design are performed and the validity of the proposed methodology is examined experimentally. We expect that the easiness of the proposed method guarantees an efficient reflection of the current degradation effect, even with frequent layout modifications in the VLSI designs.