ppxscal/embedding_network huggingface dataset:
MVL circuit design and characterization at the transistor level using SUS-LOC
Authors: E. Kinvi-Boh, M. Aline, O. Sentieys, Edgar D. Olson
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

This paper deals with design and performance estimationof typical ternary functions using SUS-LOC concepts.Experimental models of the transistors needed for SUS-LOCstructures are presented. A created characterizationprocess allows to extract the delay and the energy consumptioninformation from each cell which is simulatedat the transistor level. Finally, VHDL is used to obtainperformances modelling and architectural-level simulation.Some characterization results are presented for basic logicternary functions and a comparison between binary andternary circuits is given for two adder structures.
A Comparison of Heuristics for Scheduling DAGs on Multiprocessors
Authors: C. L. McCreary, J. J. Thompson, D. H. Gill, T. J. Smith, Y. Zhu, A. A. Khan, J. Thompson, M. E. McArdle
Venue:  (1993)

Effective and efficient automated parallelization of code is an objective of much research in parallel computing. One of the steps in going from serial source code to parallel executable code is scheduling -- the assignment of tasks to processors. Researchers often use a graphical intermediate representation of the program such as a program dependence graph (PDG) to help identify groups of tasks that can be executed in parallel and tasks that are to be scheduled on the same processor. Because the scheduling problem is NP-hard, many heuristic solutions have been proposed. This research is a comparison of some of the proposed solutions for the scheduling problem.
eBusiness Essentials, 2 edition
Authors: Mark Norris, Steve West
Venue:  (2002)

:eBusiness is growing rapidly and new issues are emerging in this global and real-time activity. This new edition to the hugely successful eBusiness Essentials explores the increasingly important area of mobile data access. In addition, it shows how eBusiness is evolving and how technology can be progressively used to build more sophisticated solutions. Balancing its technical depth with a clear and practical analysis of market models it enables the reader to deploy the available and emerging technology effectively and appropriately.In addition to the established yet equally important features such as security, payment and trust, supply chain integration and customer to supplier trade it includes:- mBusiness covering key issues such as roving and roaming access and the technologies GPRS, UMTS and WAP- Help for readers to formulate their own eBusiness strategy by drawing out some general principles- Virtual mobile network operators: data extensions to the mobile switch, home and visitor location- Analysis and real world examples of mobile services- The technical options, impact, integration, mechanics and implications of evolving eBusinessPrimarily aimed at planners, engineers, managers and developers in the IT, multimedia and on-line industries. Recommended reading for students in computer science electrical & electronic engineering, IT and telecommunications.
Agent driven policy management for securing open services
Authors: Juan Jim Tan, Stefan Poslad, Leonid Titkov
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

Open agent services exist as heterogeneous technologies in large scale interoperable networks. The openness of such services is aggregated into multi-heterogeneous domains where it is exposed to security threats. There are also issues of various domain control privileges and security requirements specification represented over different domains. This results in the need for managing domain specific requirements in a horizontal approach where diverse domains can interact seamlessly during runtime. Hence the use of a dynamic policy model is developed to address interactions in a Multi Agent Multi Domain (MAMD) environment. This paper investigates the use of policy specifications to provide core security for access control, and communication services and domains. Besides, a fundamental attribute of the architecture, is the use of loosely coupled security and policy management mechanisms that supports the specification, representation and control of security requirements and policies. As a result, a security policy model was defined in relation to the authors' on-going work on abstract security model and mechanisms.
A Comparative Evaluation of a Natural Language Exploration Tool within a Hypermedia Environment
Authors: Mark A. Edwards, Heather Powell, Dominic Palmer-Brown.
Venue: Proceedings of the 8th International Conference on Tools with Artificial Intelligence (1996)

This paper examines the pedagogical effectiveness of a natural language exploratory tool developed to supplement a hypermedia learning environment. The learning environment includes an authoring tool with which the relationships between entities can be easily expressed. These relationships are utilized directly by a natural language interface to engage the learner. By closely analyzing the activities of learners using the tool, this study compares natural language exploration with the basic interaction provided by hypermedia environments. To facilitate this study, extensive data was compiled using both qualitative and quantitative techniques. Analysis of learner interactions revealed differences in their interactive behavior. The group engaged in a discourse was more likely to be examining a coherent set of entities at any one time, and was less likely to experience feelings of disorientation. It is concluded that the natural language tool supports a wide range of learning styles.
Steel Battalion Offical Strategy Guide
Authors: Brady Games, Phillip Marcus
Venue:  (2002)

:BradyGames' Steel Battalion Official Strategy Guide features a complete walkthrough of every mission with all strategically significant locations identified on our maps! Plus, tactical notes on the alternate scenario campaign. Technical readouts provide details on all 18 Vertical Tanks, as well as the complete arsenal of weaponry at a player's disposal. Controller coverage ensures that gamers know what each critical control affects, as they face a daunting array of switches, buttons, and knobs in their virtual cockpit.
The formal semantics of SDL-2000: status and perspectives
Authors: U. Glässer, R. Gotzhein, A. Prinz
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

In November 1999, the current version of specification and description language (SDL), commonly referred to as SDL-2000, passed through ITU-T. In November 2000, the formal semantics of SDL- 2000 was officially approved to become part of the SDL language definition. It covers both the static and the dynamic semantics, and is based on the formalism of abstract state machines (ASMs). To support executability, the formal semantics defines, for each SDL specification, reference ASM code, which enables an SDL-to-ASM-compiler.In this paper, we briefly survey and compare existing approaches to define the semantics of SDL formally. The ITU-T approach is then outlined in more detail, addressing the following steps: (1) mapping of non-basic language constructs to the core language, (2) checking of static semantics conditions, (3) definition of the SDL abstract machine (SAM), and (4) definition of the SDL virtual machine (SVM). The paper concludes with experiences from the SDL-to-ASM-compiler project. It is proposed that the SDL-2000 semantics can be adapted and extended to formally define the meaning of UML 2.0 class, composite structure, and statechart diagrams.
A Dialogue Game Protocol for Agent Purchase Negotiations
Authors: Peter Mcburney, Rogier M. Van Eijk, Simon Parsons, Leila Amgoud
Venue: Autonomous Agents and Multi-Agent Systems (2003)

We propose a dialogue game protocol for purchase negotiation dialogues which identifies appropriate speech acts, defines constraints on their utterances, and specifies the different sub-tasks agents need to perform in order to engage in dialogues according to this protocol. Our formalism combines a dialogue game similar to those in the philosophy of argumentation with a model of rational consumer purchase decision behaviour adopted from marketing theory. In addition to the dialogue game protocol, we present a portfolio of decision mechanisms for the participating agents engaged in the dialogue and use these to provide our formalism with an operational semantics. We show that these decision mechanisms are sufficient to generate automated purchase decision dialogues between autonomous software agents interacting according to our proposed dialogue game protocol.
Mutual Exclusion in a Token Ring in CC++
Authors: Ulla Binau
Venue:  (1992)

This report describes a first attempt at using UNITY to verify reactive Compositional C++ (CC++) programs. We propose a distributed solution to the mutual exclusion problem using partially synchronous communication channels. The solution is described as a CC++ program, from which a small set of "basic" properties is derived. Using UNITY, we proof mutual exclusion and progress of the solution based on the set of properties derived from the code.
Resolution Search
Authors: V. Chvatal
Venue:  (1995)

Branch-and-bound is one of the most popular ways of solving difficult problems such as integer and mixed-integer linear programming problems; when the branching is done on zero-one valued variables, the resulting variant of branch-and-bound is called implicit enumeration. Efficiency of branch-and-bound and implicit enumeration algorithms depends heavily on the branching strategy used to select the next variable to branch on and its value. We propose an alternative to implicit enumeration. Our algorithm, which we call resolution search, seems to suffer less from inappropriate branching strategies than implicit enumeration does. 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
ATACOBOL: A COBOL Test Coverage Analysis Tool and Its Applications
Authors: Sam K. S. Sze, Michael R. Lyu
Venue: Proceedings of the 11th International Symposium on Software Reliability Engineering (2000)

A coverage-testing tool ATACOBOL (Automatic Test Analysis for COBOL) that applies data flow coverage technique is developed for software development on IBM System/390 mainframe. We show that the data flow coverage criteria can identify possible problematic paths that maps to the actual testing semantic required by Y2K compliance software testing. However, the mainframe environment lacks testing tools that equip the data flow coverage measure. Up to the current implementation, ATACOBOL is able to perform block coverage, decision coverage and all-uses measures. We extend the rules of data flow coverage criteria to adapt data structures that modern high-level languages usually employ.
A Scalable Parallel Subspace Clustering Algorithm for Massive Data Sets
Authors: Harsha S. Nagesh, Alok Choudhary, Sanjay Goil
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

Clustering is a data-mining problem, which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. Clustering algorithms need to scale with the data base size and with the large dimensionality of the data set. Further, these algorithms need to explore the embedded clusters in a subspace of a high dimensional space. However, the time complexity of the algorithm to explore clusters in subspaces is exponential in the dimensionality of the data and is thus extremely compute intensive. Thus, parallelization is the choice for discovering clusters for large data sets. In this paper, we present a scalable parallel subspace-clustering algorithm, which has both data and task parallelism embedded in it. We also formulate the technique of adaptive grids and present a truly unsupervised clustering algorithm requiring no user inputs. Our implementation shows near linear speedups with negligible communication overheads. The use of adaptive grids results in two orders of magnitude improvement in the computation time of our serial algorithm over current methods with much better quality of clustering. Performance results on both real and synthetic data sets with very large number of dimensions on a 16 node IBM SP2 demonstrate our algorithm to be a practical and scalable clustering technique.
IT Project Management: On Track from Start to Finish
Authors: Joseph Phillips
Venue:  (2002)

:Complete IT projects on time and within budget using the expert advice and valuable insight contained in this book. Find out how to best use your skills to keep your team motivated and address challengesincluding changing business needs,budget restrictions,technical barriers,and even office politics. Contains handy worksheets and project files on the CD-ROM to help you practice what you've just learned. Expert advice to help you complete IT projects on time and within budgetLearn how to effectively manage and complete an IT project using the valuable insight contained in this book. This expert resource provides you with a precise roadmap for keeping your IT projects on trackthrough every phase from inception to completionand outlines critical strategies for finishing on time and within budget. You'll find out how to use your skills to keep your team motivated and learn to address challenges along the wayincluding changing business needs,budget restrictions,technical barriers,and even office politics. Know how to put together a plan to meet your IT project goalsfrom establishing a vision to communicating with management and tracking progress. Use the worksheets and project files on the CD-ROM to complete chapter exercises,and then confirm what you've learned with end-of-chapter quizzes. And,a simulated exam will help you prepare for CompTIA's career-advancing IT Project+ certification. Written by an experienced IT consultant and trainer,and filled with interviews with leading IT project managers explaining how they get their jobs done,this authoritative guide shows you what you need to steer an IT project to successfulcompletion. Define a project goal and pinpoint a date for completion Establish a priority list and obtain budget dollars Work with management and define management's role Determine project expensesincluding estimating required hours Create realistic timetables and establish inter-departmental communication channels Organize a project teamassess internal skills as well as utilize external resources Delegate responsibilities and manage project schedules Resolve disagreementsas well as address delays and budget increases Track progress and implement quality testing Maintain leadership and keep team focused on success 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
Access Revocation and Prevention of False Repudiation in Secure Email Exchanges
Authors: Li Bai, Ramasubramaniam Achuthanandam, Moshe Kam
Venue: Proceedings of the Fifth International Symposium on Autonomous Decentralized Systems (2001)

A secure email protocol (SEP) is introduced to provide a decentralized means of revoking trust access and preventing false repudiation. Verification of the exchange of a message between sender and recipient is accomplished through an identification cookie (IC) and an encryption key (EK) handled by Verification and Authentication Agents (VAAs). The communicated narrative is encrypted by the EK. The augmented message is then encrypted again using one of the widely available encryption algorithms, such as the Pretty Good Privacy (PGP) scheme, and sent to the addressee. The extracted IC serves as a label which the addressee uses to obtain the EK from the sender's VAA. Once the addressee possesses the message's EK, s/he is able to decrypt the narrative, verify that the IC is correct, and the process is complete. Quick revocation of access privileges and cancellation of old messages is achieved by deleting ICs not requested by the addressee. The structure of the message body is written in the eXtensive Markup Language (XML) to take advantage of the language's extendibility and compatibility features.
Monitoring Distributed Real-Time Activities in DCOM
Authors: Michael Mock, Martin Gergeleit, and Edgar Nett
Venue: Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (2000)

Object-oriented frameworks have become a key element in the design of distributed systems. They make the existence of the physical and operating system level resources transparent to the designer and provide the abstract view of the distributed systems as a set of objects that interact by invoking well-defined interfaces of each other.Easy reuse of existing components, location transparency and implementation hiding are the main ingredients of such frameworks that simplify the task of designing distributed systems drastically. It is desirable to take advantage of these benefits when designing distributed real-time systems, too. However, this goal conflicts with the essential need to consider the allocation of system resources when real-time requirements must be met. Here, system level resource issues such as execution times on CPUs, thread switches, occurrence of interrupts, and message delays are of primary interest. Our approach to solve this dilemma is to allow and support the designer of distributed real-time object-oriented applications to become aware of system level resources.In this paper, we present a monitoring tool JewelDC that allows monitoring of distributed activities (i.e. nested sequences of object invocations) in a distributed object-oriented framework. Distributed activities are visualized at the abstract object level while simultaneously revealing their use of system level re-sources. The tool has been implemented for DCOM on Microsoft Windows NT 4.0.
Proposal of Four-Valued MRAM based on MTJ/RTD Structure
Authors: Tetsuya UEMURA, Masafumi YAMAMOTO
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

We proposed a novel four-valued magnetic random accessmemory (MRAM), that uses a double barrier magnetotunnel junction (MTJ) and a resonant tunneling diode(RTD) connected in series. The double barrier MTJ in theform FM1/I/FM2/I/FM1, where FM1 and FM2 representferromagnetic materials with different coercive forces andI represents an insulator, respectively, can take four distinctresistance values, depending on the direction of magnetizationof each ferromagnetic layer. The RTD can increase thetunneling magneto-resistance (TMR) ratio of the MTJ withoutarea penalty due to the nonlinear nature of the NDRcharacteristics and compactness. The SPICE simulationshowed that the RTD with its peak-to-valley current ratioof 12 could increase the effective TMR ratio from 15 % tomore than 100 %. The cell area per bit is 2F2/bit, which issuitable for an ultra-high density memory.
The Specification of Dynamic Distributed Component Systems
Authors: Joseph R. Kiniry
Venue:  (1998)

Modern computing systems are terribly complicated - so complex that most system designers and developers can only hope to understand their small piece of the larger project. The primary technologies that help system builders manage this complexity are object-oriented and/or component-centric, and the primary tools are those that assist in system modeling and specification. It is my belief that the next stage in managing system complexity comes in the form of system specification through formal methods. Only with precise, complete, and consistent descriptions of our systems and their components can we hope to understand the hyper-complex engineering that has become prevalent in computing today. But, only through the introduction of some middle-ground, semi-formal technique can modeling and specification break through into the mainstream. Such a specification methodology can''t be too hard to use, but need to be formal enough that it will help system designers and tools check the consistency and completeness of the system and its components. This thesis is the first step on the road toward formal specification of dynamic, emergent, distributed component systems, and addresses all of the requirements mentioned above. I introduce DESML: a set of new modeling constructs which can be used as a thin layer on top of most modeling languages. DESML is a variant of the Unified Modeling Language (UML), not an extension. I have redefined the the core metamodel, thus the new language is no longer compatible at the meta-level with UML. Note that such a modification is not necessary it is only a convenience in the definition of our new language. The reader should be familiar with the Unified Modeling Language and at least one formal specification language. Suggested references include [42] and [50, Chapter 2] for UML, and [20, Chapter 6] for a specification language (in this case, Z [152]).
Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
Authors: Georg Gottlob, Nicola Leone, Francesco Scarcello
Venue: Journal of Computer and System Sciences (2003)

In a previous paper (J. Comput. System Sci. 64 (2002) 519), the authors introduced the notion of hypertree decomposition and the corresponding concept of hypertree width and showed that the conjunctive queries whose hypergraphs have bounded hypertree width can be evaluated in polynomial time. Bounded hypertree width generalizes the notions of acyclicity and bounded treewidth and corresponds to larger classes of tractable queries. In the present paper, we provide natural characterizations of hypergraphs and queries having bounded hypertree width in terms of game-theory and logic. First we define the Robber and Marshals game, and prove that a hypergraph H has hypertree width at most k if and only if k marshals have a winning strategy on H, allowing them to trap a robber who moves along the hyperedges. This game is akin the well-known Robber and Cops game (which characterizes bounded treewidth), except that marshals are more powerful than cops: They can control entire hyperedges instead of just vertices. Kolaitis and Vardi (J. Comput. System Sci. 61 (2000) 302) recently gave an elegant characterization of the conjunctive queries having treewidth < k in terms of the k-variable fragment of a certain logic L (= existential-conjunctive fragment of positive FO). We use the Robber and Marshals game to derive a surprisingly simple and equally elegant characterization of the class HW[k] of queries of hypertree width at most k in terms of guarded logic. In particular, we show that HW[k] = GFk(L), where GFk(L) denotes the k-guarded fragment of L. In this fragment, conjunctions of k atoms rather than just single atoms are allowed to act as guards. Note that, for the particular case k = 1, our results provide new characterizations of the class of acyclic queries. We extend the notion of bounded hypertree width to nonrecursive stratified Datalog and show that the k-guarded fragment GFk(FO) of first-order logic has the same expressive power as nonrecursive stratified Datalog of hypertree width at most k.