ppxscal/embedding_network huggingface dataset:
MCAD Developing and Implementing Web Applications Visual C#.NET and Microsoft Visual Studio.NET Exam Cram 2 (Exam Cram 70-315)
Authors: Hausman, Ed Tittel
Venue:  (2003)

:This certification exam measures the ability to develop and implement Windows-based applications with Web forms, ASP.NET, and the Microsoft .NET Framework. This exam counts as a core credit toward the new MCAD (Microsoft Certified Application Developer) certification as well as a core credit toward the MCSD .NET certification. Readers preparing for this exam find the best-selling Exam Cram 2 series to be the smartest, most efficient way to become certified. Under the direction of Series Editor Ed Tittel, the leading authority on certification and the founder of The Exam Cram Method™ series, this book focuses exactly on what readers need to get certified now - featuring test-taking strategies, time-saving study tips, and a special Cram Sheet that includes tips, acronyms, and memory joggers that are not available anywhere else. After review by a panel of experts, Exam Cram 2 has received the distinction of Cramsession Approved Study Material. The accompanying CD-ROM features PrepLogic Practice Tests!
Qualitative Probabilities for Image Interpretation
Authors: Allan Jepson, Richard Mann
Venue: Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2 (1999)

Two basic problems in image interpretation are: a) determining which interpretations are the most plausible amongst many possibilities; and b) controlling the search for plausible interpretations. We address these issues using a Bayesian approach, with the plausibility ordering and search pruning based on the posterior probabilities of interpretations. However, due to the need for detailed quantitative prior probabilities and the need to evaluate complex integrals over various conditional distributions, a full Bayesian approach is currently impractical except in tightly constrained domains.To circumvent these difficulties we introduce the notion of qualitative probabilistic analysis. In particular, given spatial and contrast resolution parameters, we consider only the asymptotic order of the posterior probability for any interpretation as these resolutions are made finer. We introduce this approach for a simple card-world domain, and present computational results for blocks-world images.
Universes of Fuzzy Sets - A Short Survey
Authors: Siegfried Gottwald
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

For classical sets one has their cumulative hierarchy,and also the category SET of all sets and mappings asstandard approaches toward the universe of all sets.We discuss the corresponding situation for fuzzy settheory and give is a (concise) survey of a lot of suchapproaches which have been offered in the past approximately35 years.
A phase field model with temperature dependent constraint
Authors: Pierluigi Colli, Nobuyuki Kenmochi, Masahiro Kubo
Venue:  (2000)

This paper is concerned with a phase-field model with temperature dependent constraint for the order parameter. In the kinetic equation of the order parameter, we take account of diffusion as well as undercooled/superheated state which is modelled by means of a hysteresis input-output relation; the input is the temperature field and the output is the order parameter. In this paper we shall show that there exists a solution ``globally'''' in time in a physically reasonable sense, when the coefficient of interfacial energy is sufficiently small.
An Unconstrained Optimization Algorithm Which Uses Function and Gradient Values
Authors: John E. Dennis,  Jr., Howell H Mei
Venue:  (1975)

A new method for unconstrained optimization is presented. It consists of a modification of Powell''s 1970 dogleg strategy with the approximate Hessian given by Davidson''s 1975 updating scheme which uses the projections of $\triangle x$ and $\triangle g$ in updating H and G and optimizes the condition number of $H^{-1}H_{+}$. This new algorithm performs well without Powell''s special iterations and singularity safeguards. Only symmetric and positive definite updates to the Hessian are used.
A Unified Process for the Integration of Large-scale, Distributed, Object-Oriented, Real-time Systems in Layered Architectures
Authors: M. Mortazavi, J. Connell
Venue: Proceedings of the 2nd IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (1999)

Over the past few decades a great deal of research has been devoted to the development of real-time components and systems. Examples include real-time operating systems, real-time schedulers, real-time object models and real-time object brokers. Nevertheless, efforts to build such large scale systems have lagged behind due to interoperability problems, programming paradigms which are difficult to use, an absence of a standard QoS specification language, a general lack of maturity in software engineering processes involved, and logistic difficulties of building large-scale, distributed, real-time systems within reasonable expenditure of resources. This paper focuses on the initial phases of a recent effort (the QUITE project) to build a large-scale, QoS-aware, real-time system based on the integration of research technologies that have received funding from the Defense Advanced Research Project Agency's Quorum program. It emphasizes the process aspects of the QUITE integration effort.
Fast Out-of-Core Sorting on Parallel Disk Systems
Authors: Matthew D. Pearson
Venue:  (1999)

This paper discusses our implementation of Rajasekaran''s (l,m)-mergesort algorithm (LMM) for sorting on parallel disks. LMM is asymptotically optimal for large problems and has the additional advantage of a low constant in its I/O complexity. Our implementation is written in C using the ViC* I/O API for parallel disk systems. We compare the performance of LMM to that of the C library function qsort on a DEC Alpha server. qsort makes a good benchmark because it is fast and performs comparatively well under demand paging. Since qsort fails when the swap disk fills up, we can only compare these algorithms on a limited range of inputs. Still, on most out-of-core problems, our implementation of LMM runs between 1.5 and 1.9 times faster than qsort, with the gap widening with increasing problem size.
An evolutionary framework for studying behaviors of economic agents
Authors: Wolfgang Ketter, Alexander Babanov, Maria Gini
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

We propose an evolutionary framework for studying agents that interact in electronic marketplaces and describe how to use the framework to study the dynamics of interaction and evolution of agent strategies. We present experimental results from a simulated market, where service providers compete for customers using multiple strategies. The results show how service providers of different strategies adapt to occupy distinct niches in the market.
On Lower Bound of the Number of Channels for Deadlock-Free Whormhole Routing
Authors: Sheng Li, Wu Jie
Venue:  (1999)

Libeskind-Hadas recently provided a tight lower bound on the number of channels required by a broad class of deadlock-free wormhole routing algorithm. Given an interconnection network represented by a digraph $G=(N,C)$, where each vertex in $N$ represents a node and each directed link in $C$ represents a unidirectional channel, Libeskind-Hadas showed that $|C|\ge 2|N|-2$ is the tight lowered on the number of Channels required for Deadlock-Free Whormhole Routing. In this short note, we show a simpler proof of this tight lower bound.
Parallel Constraint Graph Generation
Authors: John E. Savage, Markus G. Wloka
Venue:  (1988)

In this paper we present a parallel algorithm for computing the {\em transitive reduction of an interval DAG}. This is equivalent to a parallel algorithm for computing a minimum-distance constraint DAG from a VLSI layout. An intermediate result developed during the execution of the above algorithm is a parallel algorithm for constructing a {\em tiling} or {\em corner stitching}, a geometrical data structure used in the Magic VLSI layout system. All these computations take time $O(\log ^ 2 n)$ using $O(n / \log n)$ processors on an EREW PRAM, so their processor-time product is optimal. The algorithm can easily be implemented on a practical parallel machine.
A High Performance Implementation of Prolog
Authors: Michael O. Newton
Venue:  (1987)

We discuss an efficient implementation of the Warren Abstract Machine (WAM) [12] in detail. Special attention is given to data formats, memory layout, WAM optimizations and code generation techniques. A final section describes some hardware considerations for even higher performance execution. Currently the compiler produces code that runs at approximately 900,000 logical inferences per second (LIPS) on a single processor of an IBM 3090 using the naive reverse benchmark. Using several of the yet unimplemented optimizations, we expect this figure to top one million LIPS. 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
Efficient Code Certification
Authors: Dexter Kozen
Venue:  (1998)

We introduce a simple and efficient approach to the certification of compiled code. We ensure a basic but nontrivial level of code safety, including control flow safety, memory safety, and stack safety. The system is designed to be simple, efficient, and (most importantly) relatively painless to incorporate into existing compilers. Although less expressive than the proof carrying code of Necula and Lee or typed assembly language of Morrisett et al., our certificates are compact and relatively easy to produce and to verify. Unlike JAVA bytecode, our system operates at the level of native code; it is not interpreted and no further compilation is necessary.
Environment for Multiprocessor Simulator Development
Authors: T. Horita, M. Wakabayashi
Venue: Proceedings of the 2000 International Symposium on Parallel Architectures, Algorithms and Networks (2000)

Performance estimation is essential for designing andinvestigating of new architectures including multiprocessors. Software simulation is one of the most common methods,since there is no limitation on device technology nor hardwareconfiguration. Although lots of software simulators have been developed and used, they must be modified for each distinct target system. For designers of newarchitectures, it is often a cumbersome job. ISIS, an architecture independent simulation kit for multiprocessors, is developed so as to reduce such designers load. It includes various small simulators called "Units" corresponding to processors, buses, memories, caches and I/0 devices. ISIS users can build simulators for their original target architectures only by connecting "Units" each other. The implementation cost is much reduced with little runtime overhead. A sample instruction-level multiprocessor simulatorwhich has 4 processors can be executed 40,000 to 70,000 steps per second. This paper also reports experimental results of ISIS in various research projects.
Reliability Analysis of Systems Based on Software and Human Resources
Authors: A. Pasquini, G. Pistolesi, S. Risuleo, A. Rizzo, V. Veneziano
Venue: Proceedings of the Eighth International Symposium on Software Reliability Engineering (1997)

Safety-critical systems require an assessment activity to verify that they are able to perform their functions in specified use environments. This activity would benefit from evaluation methodologies that consider these systems as a whole and not as the simple sum of their parts. Indeed, analysis of accidents involving such systems as shown that they are rarely due to the simple failure of one from their components. Accidents are the outcome of a composite causal scenario where human, software and hardware failures combine in a complex pattern. On the contrary, dependability analysis and evaluation of safety critical systems are based on techniques and methodologies that concern human and computer separately, and whose results can hardly be integrated. The analogies between the processes of: (1) software reliability growth due to testing and the related fault removal; (2) improvement of man-machine interface due to preliminary operative feedback; (3) improvement of the operator performances due to his learning activity; suggest an effort for a common evaluation approach. Only the first one of these processes is currently modelled by using mathematical methods. This paper considers extending these methods to study the reliability growth process of other system components, i.e. the operator and the man-machine interface. To study the feasibility of the approach, the paper analyses the results of an experiment in which the reliability of a system is evaluated using trend analysis. The evaluation concerns: the graphic man-machine interface and the operators, and could easily be extended to the software control system.
Wearable Location Mediated Telecommunications: A First Step Towards Contextual Communication
Authors: J. Bowskill, M. Billinghurst, B. Crabtree, N. Dyer, A. Loffler
Venue: Proceedings of the 3rd IEEE International Symposium on Wearable Computers (1999)

Wearable computers provide constant access to computing and communications resources. In this paper we describe how the computing power of wearables can enhance computer-mediated communications, with a focus upon collaborative working. In particular we describe the idea of contextual communication, where contextual cues collected by the wearable computer are used to establish and enhance communication links. We describe the hardware and software technology we have developed to support contextual communication and two experimental contextual communication systems. The first, a wearable conferencing tool uses the user's physical location to select the on line conference which they connect to. The second, MetaPark, is a mixed reality educational experiment which explores communications, data retrieval and recording, and navigation techniques within and across real and virtual environments.
Decidable Pairing Functions
Authors: Richard L Tenney
Venue:  (1972)

In Chapter I of this paper we show that the usual, textbook pairing functions have decidable first-order theories. This will be done by exhibiting an infinite axiomatization of certain pairing functions which we characterize as ``acyclic except for $\triangle$''''. This condition is satisfied by the usual pairing functions. We then use a technique of Ehrenfeucht and Fraisse to show that the decision problem for such a pairing function is effectively reduced to the decision problem for the function restricted to $\triangle$. In contrast to the decidability of the first-order theories of certain pairing functions, we show that the weak second-order and monadic second-order theories of these pairing functions are undecidable. In Chapter II we show how to extend the first-order Ehrenfeucht game to a second-order game. Using this extended game, we show that the monadic second-order theory of an equivalence relation is decidable. Some of the results of Chapter I were announced in [16].
Constructing big trees from short sequences
Authors: Peter L. Erdos, Michael A. Steel, Laszlo A. Szekely, Tandy J. Warnow
Venue:  (1997)

The construction of evolutionary trees is a fundamental problem in biology, and yet methods for reconstructing evolutionary trees are not reliable when it comes to inferring accurate topologies of large divergent evolutionary trees from realistic lengh sequences. We address this problem and present a new polynomial time algorithm for reconstructing evolutionary trees called the Short Quartets Method which is consistent and which has greater statistical power than other polynomial time methods, such as Neighbor-Joining and the 3-approximation algorithm by Agarwala et al. (and the "Double Pivot" variant of the Agarwala et al. algorithm by Cohen and Farach) for the $L_{\infty}$-nearest tree problem. Our study indicates that our method will produce the correct topology from shorter sequences than can be guranteed using these other methods.
Modeling and Implementation of a Packet Routing Switch for Satellite Communications
Authors: Daniel S. Kaye
Venue:  (1993)

The principal component needed to model a satellite communications network node is a high-speed packet routing switch. The design and testing of routing switches utilizing Transputer networks has been examined extensively in the literature. One such implementation by Khan and Ward made use of cooperating processes scheduled by the Transtech Genesys operating system. The performance of this system was unacceptable with problems attributed to packet duplication and process contention. In this report, we examine an alternate approach using cooperating Occam processes without the overhead associated with an operating system. The routing switch permits dynamic updates to its routing tables from a host computer. Library functions are provided to host processes to offer this service. However, accommodating these updates influences the design of the underlying Transputer network. Allowances must be made not only for expedient routing of messages within the Transputer network but also for rapid and efficient routing table updates within the Transputer network. Results discussed in this report reflect the design and performance of the routing switch. Throughput efficiency under a variety of test conditions is also provided. 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
Improving the Characterization of p-Valued Threshold Functions
Authors: Claudio Moraga
Venue: Proceedings of the 32nd International Symposium on Multiple-Valued Logic (2002)

Renewed interest in multiple-valued threshold logic in recent years,from the point of view of neural networks, motivates the return todeepen research on multiple-valued threshold logic. Realizations ofthreshold logic are based on a partition of the set of multiple-valuedfunctions of a given arity and tables of characterizing parameters ofeach block of the equivalence relation. Any improvement on theequivalence relation contributes to reduce the size of the table. Thepaper strengthens the idea of semidual functions introduced in the earlyseventies for symmetric ternary threshold logic; extends it to p-valuedlogic and shows that semiduality reduces the size of realization tablesby ca. 50%.
Generalized satisfiability problems: minimal elements and phase transitions
Authors: Nadia Creignou, Hervé Daudé
Venue: Theoretical Computer Science (2003)

We develop a probabilistic model on the generalized satisfiability problems defined by Schaefer (in: Proceedings of the 10th STOC, San Diego, CA, USA, Association for Computing Machinery, New York, 1978, pp. 216-226) for which the arity of the constraints is fixed in order to study the associated phase transition. We establish new results on minimal elements associated with such generalized satisfiability problems. These results are the keys of the exploration we conduct on the location and on the nature of the phase transition for generalized satisfiability. We first prove that the phase transition occurs at the same scale for every reasonable problem and we provide lower and upper bounds for the associated critical ratio. Our framework allows one to get these bounds in a uniform way, in particular, we obtain a lower bound proportional to the number of variables for k-SAT without analyzing any algorithm. Finally, we reveal the seed of coarseness for the phase transition of generalized satisfiability: 2-XOR-SAT.
Starving to Death on $200 Million: The Short, Absurd Life of The Industry Standard
Authors: James Ledbetter
Venue:  (2003)

:"Starving to Death on $200 Million is James Ledbetter's mock-heroic chronicle of the magazine that lived large and died young - the wild dreams, the sudden success, the wanton excesses, the fatal hemorrhage. From his vantage point as one of The Standard's top editors, he saw up close how it succumbed to the same gold-rush fever as the Internet businesses it was supposed to be chronicling, realizing too late that he had been infected as well." But the excesses need not have been fatal; other lavish media organizations have thrived for years despite their spendthrift ways. But as Ledbetter pursued the whys and wherefores of The Standard's demise, he found himself pulled into the business equivalent of a detective story: Did the magazine die because it was reckless - as in an overdose? Or did it die because someone wanted it dead - as in a murder? 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
3D Ray-Tracing on PC Networks using TCP/IP
Venue: Proceedings of the 1999 International Conference on Information Visualisation (1999)

This paper presents a 3D graphics rendering algorithm for photo realistic ray tracing operating over a network of personal computers. The implementation incorporates partitioning methodologies for both memory and workload to achieve efficient execution on a distributed personal computer, PC, network. Experimental results that compare algorithm efficiency in dual processor machines and TCP/IP networks with respect to execution on a single processor are discussed.
Towards Formalized Software Architectures
Authors: Robert Allen, David Garlan
Venue:  (1992)

An important goal in software engineering is to describe complex software systems at an architectural level of abstraction. While there are many useful architectural paradigms (pipes, blackboards, etc.) they are typically understood only idiomatically and applied in an ad hoc fashion. We show how a formal model allows us to say precisely what we mean by a software architecture, explore its properties, and systematically describe instances of the architecture. We illustrate the approach using the well-known example of pipe-filter architectures.
Forwarding in a content-based network
Authors: Antonio Carzaniga, Alexander L. Wolf
Venue: Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications (2003)

This paper presents an algorithm for content-based forwarding, an essential function in content-based networking. Unlike in traditional address-based unicast or multicast networks, where messages are given explicit destination addresses, the movement of messages through a content-based network is driven by predicates applied to the content of the messages. Forwarding in such a network amounts to evaluating the predicates stored in a router's forwarding table in order to decide to which neighbor routers the message should be sent. We are interested in finding a forwarding algorithm that can make this decision as quickly as possible in situations where there are numerous, complex predicates and high volumes of messages. We present such an algorithm and give the results of studies evaluating its performance.