ppxscal/embedding_network huggingface dataset:
Lexicalisation Patterns in Italian: Analysis of Dictionaries and a Textual Corpus.
Authors: Antonietta Alonge
Venue:  (1994)

In this paper, we describe the methodologies used to elaborate a description of lexicalisation patterns connected with the expression of motion, change-of-state-by-cooking and visual perception in Italian. We shall show how the semantic analyses carried out on definitions of Italian verbs have been used for deriving information on various syntactic properties of the verbs themselves.
Ordered Multicast and Distributed Swap
Authors: Maurice H Tirthapura, Roger Wattenhofer
Venue:  (2000)

A multicast protocol is ordered (or totally ordered) if it ensures that messages multicast to a group of nodes are delivered in the same order at each destination node, even when those messages are generated concurrently from several sources. This paper shows how to reduce the complex problem of enforcing multicast ordering to a simpler distributed coordination problem we call distributed swap. Any distributed swap protocol can transform an unordered reliable multicast into an ordered multicast in a modular way. We introduce two novel distributed swap protocols, the arrow swap protocol (based on the arrow directory protocol) and the combining swap protocol (based on combining trees) and discuss their corresponding ordered multicast protocols. These protocols have lower latency than more obvious approaches based on distributed counting.
An Efficient Multi-Dimensional Searching Technique and itsApplications
Authors: K P Agarwal, Micha Sharir, Sivan Toledo
Venue:  (1993)

This paper describes an improved algorithm for the multi-dimensional searching problem introduced by Megiddo. As a result, we obtain a $d^{O(d)} n$ time deterministic algorithms for linear programming in $\reals^d$ with $n$ constraints, for computing the Euclidean $1$-center of a set of $n$ points in $\Re^d$, for computing the minimum enclosing ellipsoid of a set of $n$ points in $\Re^d$, etc. Our techniques also improve the running time of known algorithms for a number of parametric graph searching problems, including that of finding zero cycles in dynamic graphs.
Finding Micro-Macro Loop with Market Game
Authors: Hiroshi Sato, Akira Namatame
Venue: Proceedings of the Fourth International Conference on Computational Intelligence and Multimedia Applications (2001)

Micro-Macro Loop (MML) is a feedback loop between microstructure and macro structure.MML is an important topic for researchers on multi-agents or complex systems. However, the discussion of MML so far is extremely conceptual, it is not clear that whether MML is representable or not and that whether MML is identifiable from observed macro information.In this paper, we introduce market games for theexperiments for MML identification and formulate them as nearly decomposable system.This formulation is called Micro-Macro Dynamics.The usefulness of the market games is demonstrated through computer simulation.
Multiple Access Protocols for Mobile Communications: GPRS, UMTS and Beyond
Authors: Alex Brand, Hamid Aghvami
Venue:  (2002)

:By focusing on multiple access for mobile communication systems, with a specific interest in access arbitration through multiple access protocols at the MAC (Medium Access Control) layer, the authors explain how packet-voice and packet-data traffic can be supported efficiently in mobile communication systems. This is approached from a theoretical point of view and from the context of existing systems such as GPRS and UMTS. The evolution of mobile communications from 1G to 3.5G and possible 4G scenarios are discussed.Examines the suitable MAC strategies for the support of packet-data on shared and common channelsDescribes the physical and logical channels in GSM, HSCSD and GPRS and examines the GPRS air interface features, including EGPRS and Release 4/5 enhancementsDocuments the authors extensive research efforts on PRMA-based protocols for CDMA, hybrid CDMA/TDMA and TDMA air interfacesAnalyses the various options for packet-data support in UMTS Release 1999 on common and dedicated channels and planned enhancements in Release 5Summarises the challenges faced when wanting to support IP-based real-time and multimedia traffic efficiently in mobile communication systems and reviews how further evolutions of GPRS and UMTS attempt to meet these challengesPresents interesting research results on the benefits of channel access control in the context of reservation protocolsIf you're looking for a comprehensive discussion of multiple access protocols, taking into account the constraints and capabilities of cellular communication systems, then this is the book for you. Engineers, researchers, academics and advanced students will all find it an important and valuable reference.
RelType: Relaxed Typing for Intelligent Hypermedia Representations
Authors: Dilip K. Barman
Venue:  (1991)

RelType is a flexible typing scheme, primarily for the links of a hypermedia system, that models hypertext as an object-oriented knowledge representation (KR) medium. The typing is non-intrusive in allowing but not enforcing hypertext link (and node) type specifications. Users continue to have complete linking flexibility, but may choose to use one of a small number of predefined types with associated semantics (e.g., subsumption, explanation) or to define their own types. The ensuing structure, akin to a semantic net, is type checked and specified semantic actions executed. The structure is semantically as rich as the user wished and could, at least partially, support tractable inference. Tools also allow a RelType system to evolve semantically in a manner reflecting actual usage. Taxonomic and assertional components capture domain knowledge. An object-oriented view supports knowledge acquisition and eases extensibility, particularly through use of linked templates. RelType provides the flexibility of hypertext, combined with some of the representational power of term classification KR systems, in an efficient and usable manner.
Group Protocol for Inter-Object Communications
Authors: Youhei Timura, Katsuya Tanaka, Makoto Takizawa
Venue: Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01) (2001)

Distributed applications are realized by cooperation of a group of multiple objects. In the group cooperation,objects send and receive messages in various ways. A message is multicast to objects in the group. In addition, multiple types of messages are in parallel sent to multiple destinations. Then, an object waits for messages from all and some of the source objects.i.e. conjunctive and disjunctive ways. In this paper, we newly define a novel precedent relation on request and response messages exchanged among objects in presence of the transmission and receipt ways. We present a protocol for supporting the ordered deliveryof messages in the precedent relation.
A High Speed, Low Voltage CMOS Offset Comparator
Authors: Ayman A. Fayed, M. Ismail
Venue: Analog Integrated Circuits and Signal Processing (2003)

A high speed, low voltage offset comparator is presented. No common mode tracking circuit is used and the offset is added without compromising the high input impedance nature of the circuit. The circuit operates at 480 Mbps with 3.0&ndash;3.6 V and 1.6&ndash;2.0 V supplies and &minus;40 to 125&deg;C temperature range on a typical 0.5 &mu;m technology.
The Earth Mover's Distance under Transformation Sets
Authors: Scott Cohen, Leonidas Guibas
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

The Earth Mover's Distance (EMD) is a distance measure between distributions with applications in image retrieval and matching. We consider the problem of computing a transformation of one distribution which minimizes its EMD to another.The applications discussed here include estimation of the size at which a color pattern occurs in an image, lighting-invariant object recognition, and point feature matching in stereo image pairs. We present a monotonically convergent iteration which can be applied to a large class of EMD under transformation problems, although the iteration may converge to only a locally optimal transformation. We also provide algorithms that are guaranteed to compute a globally optimal transformation for a few specific problems, including some EMD under translation problems.
Preserving attribute values on simplified meshes by re-sampling detail textures
Authors: Paolo Cignoni, Claudio Montani, Claudio Rocchini, Roberto Scopigno, Mario Tarini
Venue:  (1998)

Many sophisticated solutions have been proposed to reduce the geometric complexity of 3D meshes. A less studied problem is how to preserve on a simplified mesh the detail (e.g. color, high frequency shape detail, scalar fields, etc.) which is encoded in the original mesh. We present a general approach for preserving detail on simpli-fied meshes which is completely independent on the simplification technique adopted to reduce mesh size. The detail (or high frequency information) lost after simplification is encoded through texture or bump maps. The original contribution is that preservation is performed after simplification, by building set of triangular texture patches that are then packed in a single texture map. Each simplified mesh face is sampled to build the associ-ated triangular texture patch; different methods for storing this set of texture patches into a standard rectangular texture are presented and discussed. The solution is very general, because it can be applied to the output of any simplification code and because it allows preservation of any attribute value defined on the high resolution mesh. Moreover, the produced mesh de-couples shape from detail (the latter is encoded with texture maps) and allows highly efficient rendering. We also describe an alternative application: the conversion of 3D models with 3D procedural textures (which generally force the use of a software renderers) into standard 3D models with 2D bitmap textures, which con-versely can be rendered on any standard HW/SWgraphics subsystem. EMAIL:: r.scopigno@cnuce.cnr.it
Distributed Parallel Computing in Mermera: Mixing Noncoherent Shared Memories
Authors: Abdelsalam Heddaya, Himanshu Sinha
Venue:  (1996)

Abstract Programmers of parallel processes that communicate through shared globally distributed data structures (DDS) face a difficult choice. Either they must explicitly program DDS management, by partitioning or replicating it over multiple distributed memory modules, or be content with a high latency coherent (sequentially consistent) memory abstraction that hides the DDS'' distribution. We present Mermera, a formalism and system that enables a smooth spectrum of noncoherent shared memory behaviors to coexist between the above two extremes. Our approach allows us to define known noncoherent memories in a new simple way, to identify new memory behaviors, and to characterize generic mixed-behavior computations. The latter are useful for programming using multiple behaviors that complement each others'' advantages, and for programming by step-wise refinement. On the practical side, we show that the large class of programs that use asynchronous iterative methods (AIM) can run correctly on slow memory, one of the weakest, and hence most efficient and fault-tolerant, noncoherence conditions. An example AIM program to solve linear equations, is developed to illustrate the need for concurrently mixing memory behaviors, and the performance gains attainable via noncoherence. Other program classes tolerate weak memory consistency by synchronizing in such a way as to yield executions indistinguishable from coherent ones. AIM computations on noncoherent memory yield noncoherent, yet correct, computations. We present performance data that illustrate the benefits of noncoherence, in terms of raw memory performance, as well as application speed.
The Analysis of Computer Systems Using Markov Reward Processes
Authors: M R Smith, S K Trivedi, F V Nicola
Venue:  (1987)

Numerous applications in the area of computer system analysis can be effectively studied with Markov reward models. These models describe the behavior of the system with a continuous-time Markov chain, where a reward rate is associated with each state. A common interpretation of the reward rates in a computer system context is computational capacity, or a related performance measure. The distribution of accumulated reward or time-averaged over a finite time interval may be determined from the solution of the appropriate Markov reward model. We illustrate the diversity of areas where Markov reward models may be used with four examples chosen from quite different application domains. The four examples are the combined evaluation of performance and reliability of multiprocessor systems, the analysis of task completion time in a failure-prone environment, the response time distribution in a queueing system with a processor sharing discipline, and the distribution of time-averaged queue length for an M/M/1 queue. We present a polynomial time numerical algorithm used to compute the distribution of accumulated reward for the examples we set forth.
Transactional Coordination Agents for Composite Systems
Authors: Heiko Schuldt, Hans-Joerg Schek, Gustavo Alonso
Venue: Proceedings of the 1999 International Symposium on Database Engineering & Applications (1999)

Composite systems are collections of autonomous, heterogeneous, and distributed software applications. In these systems, data dependencies are continuously violated by local operations and therefore, coordination processes are necessary to guarantee overall correctness and consistency. Such coordination processes must be endowed with some form of execution guarantees, which require the participating subsystems to have certain database functionality (such as atomicity of local operations, order-preservation and either compensation of operations or the deferment of their commit). However, this functionality is not present in many applications and must be implemented by a transactional coordination agent coupled with the application. In this paper, we discuss the requirements to be met by the applications and their associated transactional coordination agents. We identify a minimal set of functionality the applications must provide in order to participate in transactional coordination processes and we also discuss how the missing database functionality can be added to arbitrary applications using transactional coordination agents. Then, we identify the structure of a generic transactional coordination agent and provide an implementation example of a transactional coordination agent tailored to SAP R/3.
A Proposal for the Development of a Study to Determine the Effectiveness of a Creativity-Centered Unit of Study in the Advancement of Spatial Abilities of American and Japanese Female Engineering Students
Venue: Proceedings of the International Conference on Information Visualisation (2000)

The purpose of this project is the development, evaluation, and implementation of a creativity-centered unit of study in the advancement of spatial abilities of American and Japanese Female engineering students. This project is envisioned as a partnership between the author and colleagues in universities in Japan. The benefits will include international cooperation between Japanese universities and Purdue University in developing spatial ability research. Female engineering students will also hopefully benefit from the findings of this research. This paper will discuss the project and the theoretical foundation upon which it was based. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Optimal Adaptive Sorting
Authors: Elmasry Amr
Venue:  (2001)

We introduce Binomialsort, an adaptive sorting algorithm that is optimal with respect to the number of inversions. The number of comparisons performed by Binomialsort, on an input sequence of length n that has I inversions, is at most $2n \log{\frac{I}{n}} + O(n)$. The bound on the number of comparisons is further reduced to $\frac{3}{\log{3}} n \log{\frac{I}{n}} + O(n)$ by using a new structure, which we call trinomial queues. Experimental results show that our sorting algorithm is practical, efficient and easy to implement. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Affine Scaling Algorithms Fail for Semidefinite Programming
Authors: Masakazu Muramatsu, Robert J. Vanderbei
Venue:  (1997)

In this paper, we give an example of a semidefinite programming problem in which primal-dual affine-scaling algorithms using the XZ, MT, and AHO directions fail. We prove that each of these algorithm can generate a sequence converging to a non-optimal solution, and that, for the AHO direction, even its associated continuous trajectory can converge to a non-optimal point. In contrast with these directions, we show that the primal-dual affine-scaling algorithm using the NT direction for the same semidefinite programming problem always generates a sequence converging to the optimal solution. Both primal and dual problems have interior feasible solutions, unique optimal solutions which satisfy strict complementarity, and are nondegenerate everywhere.
MCSE Training Guide (70-220), 2 edition
Authors: Roberta Bragg
Venue:  (2002)

:MCSE Training Guide (70-220): Windows 2000 Security Services Infrastructure, Second Edition is the perfect study guide to help readers pass one of the elective exams in Microsoft's 2000 certification program. This certification exam measures the ability to analyze the business requirements for security and design a security solution that meets business requirements. Readers preparing for this exam find the Training Guide series to be the most successful self-study tool in the market. This book is their one-stop shop because of its teaching methodology, the accompanying testing software, and superior Web site support.The CD features PrepLogic™ Practice Tests, Preview Edition. This product includes one complete PrepLogic Practice Test with approximately the same number of questions found on the actual vendor exam and full, detailed explanations of correct and incorrect answers.
Flash MX Motion Graphics, 1 edition
Authors: Euna Seol, Seol Euna
Venue:  (2002)

:Flash MX Motion Graphics covers a variety of motion graphic techniques, taking you from planning and gathering materials through executing, fine-tuning, and adjusting the finished piece. It also features interviews with 10 Flash artists from around the world, including Hillman Curtis, Eric Jordan, and Todd Purgason. This book focuses on skills to harness motion graphics in Flash MX, including: Digitizing video, and capturing, saving, and editing sound Incorporating text animation and bitmap images Working around constraints such as file sizes and the limitations of the computer screen Adding interactive elements Using Photoshop and 3D programs to create background images The author's website experiments with the various interactive possibilities of Flash and motion graphics and is featured throughout the book. It's based on the concept of introducing an off-line exhibition to the Internet, which serves as a personal exhibition space for Seol Euna. About the Author Seol Euna is a world-renowned Flash artist who was a finalist in the motion graphics division of The Flash Film Festival 2001, San Francisco. She is currently acting as a judge for the Macromedia WWWhat Awards. Commercial sites by Seol Euna include the sites for the movies, My Sassy Girl and Wanee & Junal.
Theory of Reference Types
Authors: Pavel Naumov
Venue:  (1998)

Type Theory language is extended by a new constructor to deal with types, representing circular data structures. Although this constructor was designed to model Java reference types, it is general enough to represent self-referring data in many other programming languages. Informal introduction of the new reference type constructor is followed by a set of inference rules and a proof of their consistency.
About the emergence of invariances in physics: from "substantial" conservation to formal invariance
Authors: Francis Bailly
Venue: Quantum mechanics, mathematics, cognition and action: proposals for a formalized epistemology (2002)

The role and place of relativity principles and related symmetries in physics are emphasized. It is proposed to organize part of a formalized epistemology around such invariance principles.
Uniform Proofs and Disjunctive Logic Programming
Authors: Gopalan Nadathur, W D Loveland
Venue:  (1994)

One formulation of the concept of logic programming is the notion of {\em Abstract Logic Programming Language}, introduced by Miller, Nadathur, Pfenning and Scedrov. Central to that definition is {\em uniform proof}, which enforces the requirements of inference direction, including goal-directednes, and the duality of readings, declarative and procedural. This is achieved by associating logical connectives with search directives. We use this technology to investigate Disjunctive Logic Programming, an extension of traditional logic programming that permits disjunctive program clauses. This extension has been considered by some to be inappropriately identified with logic programming because the indefinite reasoning introduced by disjunction violates the goal-oriented search directionality central to logic programming. We remove this criticism by providing formula sets and proof relation more general than that of Disjuncive Logic Programming that has the uniform proof property. From this we obtain derived inference rules that are seen to capture the essence of the proof structure of Inheritance Near-Horn Prolog, one of the proof procedures earlier proposed for disjunctive logic programming. These results follow from consideration of a more general logic where classical provability coincides with intuitionistic provability; moreover, the more stringent uniform provability is realized under a modest, sound, modification of the program. A side consequence of this construct is another means of reflecting the classical calculus within the intuitionistic calculus.
Binary CSP Solving as an Inference Process
Authors: Carlos Castro
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

We describe constraint solving using a rule-based approach. The distinction made between deduction rules and strategies by computational systems allows us to improve our understanding of the existing algorithms for solving Binary CSP once they are expressed as rewriting rules coordinated by strategies.
Analysis of the structural performance of the laminated glass plate and multi-layered laminated glass plate
Authors: R. Y. Xiao, G. P. W. Chin
Venue: Proceedings of the sixth conference on Computational structures technology (2002)

Structural performance of laminated glass plate is still illusive as different researcher present different conclusions from their research. In this paper a modelling technique that simulates the structural response of laminated glass is presented. The proposed modelling technique is also expandable to model the structural response of multi-layered laminated glass plate. Using numerical technique, we looked into the contribution of structural benefit by laminated glass structure in comparison to monolithic glass plate. Interesting discoveries were found; such as structural strength of laminated glass structure is influence by the size of the plate and the contribution of membrane strength for laminated glass is significant.