ppxscal/embedding_network huggingface dataset:
Building Secure Microsoft ASP.NET Applications
Authors: Microsoft Corporation, Danielle Voeller Bird
Venue:  (2003)

:Your guide to authentication, authorization, and secure communication. Building secure distributed Web applications can be challenging. It usually involves integrating several different technologies and productsyet your complete application will only be as secure as its weakest link. This guide presents a practical, scenario-driven approach to designing and building security-enhanced ASP.NET applications for Microsoft&reg; Windows&reg; 2000 and version 1.1 of the Microsoft .NET Framework. It focuses on the key elements of authentication, authorization, and secure communication within and across the tiers of distributed .NET Web applications.This guide focuses on:  Authenticationto identify the clients of your application Authorizationto provide access controls for those clients Secure communicationto help ensure that messages remain private and are not altered by unauthorized partiesWho should read this guide: Middleware developers and architects who build or plan to build .NET Web applications using ASP.NET, XML Web Services, Enterprise Services (COM+), .NET Remoting, or Microsoft ADO.NETAbout Patterns and Practices:Patterns & Practices contain specific recommendations illustrating how to design, build, deploy, and operate architecturally sound solutions to challenging business and technical scenarios. The technical guidance is reviewed and approved by Microsoft engineering teams, consultants, and Product Support Services, and by partners and customers.Note: Includes complete sample on the Web.
3D analysis of the influence of specimen dimensions on fretting stresses
Authors: M. Tur, J. Fuenmayor, J. J. Ródenas, E. Giner
Venue: Finite Elements in Analysis and Design (2003)

In this paper, the contact conditions and stresses that arise in a fretting test have been analyzed by means of a three-dimensional finite element model of the contact between a sphere and a flat surface. At h-adaptive process, based on element subdivision, has been used in order to obtain a low discretization error at a reasonable computational cost. The influence of finite dimensions of the specimen in the stress fields has been evaluated. The results have been compared with the classical Cattaneo-Mindlin solution.
Interfacing online bibliographic databases with Z39.50
Authors: A. Ludwig, P. Becker, U Guntzer
Venue: Proceedings of the 1997 International Symposium on Database Engineering & Applications (1997)

Many online databases are available on the Internet, each one with its own access procedures and a special user interface and query language. The Z39.50 protocol standard offers a solution to this situation of diversity and lacking interoperability. However the majority of online databases do not yet support Z39.50. We describe a system that interfaces online bibliographic databases with Z39.50 clients, if the databases are accessible via TELNET and have a line-oriented interface. Our system thus acts as a gateway or middleware. One part of it is a Z39.50 server which can be accessed by every Z39.50 client. The client's requests are translated into commands of the database's query language, which are then sent to the database via TELNET. The results received from the database are analyzed, transformed into the appropriate Z39.50 protocol data units and sent back to the Z39.50 client. The system is highly configurable and can be adapted to the different features and parameters of online bibliographic databases.
Performance of LAMS-DLC, a Protocol for Low Altitude Satellite Networks
Authors: Christopher Ward, Cheong H. Choi
Venue:  (1992)

This paper introduces a new data link control protocol appropriate for communication in low altitude satellite networks. A low altitude satellite network is assumed to be a system of satellites in the range 1000 to 15000 km, such that satellites may exchange messages while they are in line of sight with one another. In this environment data rates are expected to be Mbps, propagation delays are measured in ms, and SWAP (size weight and power) constraints restrict buffer size. The proposed data link control protocol is called LAMS-DLC (low altitude multiple satellite data link control). Unlike traditional ARQ schemes, LAMS-DLC uses negative acknowledgement to provide a lossless packet stream without guaranteeing delivery of packets in sequence. Throughput and buffer size metrics are computed and compared with Selective Repeat HDLC, a typical acknowledgement-based ARQ protocol.
Access Descriptor based Locality Analysis for Distributed-Shared Memory Multiprocessors
Authors: Angeles G. Navarro, Rafael Asenjo, Emilio L. Zapata, David Padua
Venue: Proceedings of the 1999 International Conference on Parallel Processing (1999)

Most of today's multiprocessors have a Distributed-Shared Memory (DSM) organization, which enables scalability while retaining the convenience of the shared-memory programming paradigm. Data locality is crucial for performance in DSM machines, due to the difference in access times between local and remote memories.In this paper, we present a compile-time representation that captures the memory locality exhibited by a program in the form of a graph known as Locality-Communication Graph (LCG). In the LCG, each node represents a DO loop nest which can have at most one level of parallelism. Not all loops need to be represented within a node and, therefore, the LCG may contain cycles.Our representation works whether the loops represented by the nodes are perfectly nested or not, and the subscript expressions and loop limits can be affine or non-affine expressions of the loop indices. The LCG provides essential information that a parallelizing compiler can use to automatically choose a good iteration/data distribution and to schedule the communication operations required during program execution.
On Complete Problems for NP$\cap$CoNP
Authors: Juris Hartmanis, Neil Immerman
Venue:  (1985)

It is not known whether complete languages exist for $NP\cap CoNP$, and Sipser has shown that there are relativizations so that $NP\cap CoNP$ has no $\leq ^{P}_{m}$-complete languages. In this paper we show that $NP\cap CoNP$ has $\leq ^{P}_{m}$-complete languages if and only if it has $\leq ^{P}_{T}$-complete languages. Furthermore, we show that if a complete language $L_{0}$ exists for $NP\cap CoNP$ and $NP\cap CoNP \neq NP$ then the reduction of $L(N_{i}) \in NP\cap CoNP$ cannot be effectively computed from $N_{i}$. We extend the relativization results by exhibiting an oracle $E$ such that $P^{E} \neq NP^{E} \cap CoNP^{E} \neq NP^{E}$ and for which there exist complete languages in the intersection. For this oracle the reduction to a complete language can be effectively computed from complementary pairs of machines $(N_{i}, N_{j})$ such that $L(N_{i})= \overline{L(N_{j})}$. On the other hand, there also exist oracles $F$ such that $P^{F} \neq NP^{F} \cap CoNP^{F} \neq NP^{F}$ for which the intersection has complete languages, but the reductions to the complete language cannot be effectively computable from the complementary pairs of machines. In this case, the reductions can be computed from $(N_{i}, N_{j}$, Proof that $L(N_{i})= \overline{L(N_{j})}).$
A pattern language for porting micro-kernels
Authors: M. de Champlain
Venue: Proceedings of the 5th International Workshop on Object Orientation in Operating Systems (IWOOOS '96) (1996)

Micro-kernels are difficult to port to a new hardware platform. During the initial phases of a port, much time and effort is lost on debugging critical machine-dependent subsystems. These subsystems are generally very tightly coupled and cannot be tested in an incremental fashion. Tight coupling occurs because the subsystems share many global variables forcing them to be debugged with the complete micro-kernel code. The problem of organizing and documenting new micro-kernel ports has so far received little attention, and the work described in the paper is an attempt to fill this gap. The paper describes a set of patterns (pattern language) which captures the design decisions of the initial porting procedure of micro-kernels for embedded systems in a systematic and incremental fashion. The problem, context, and solution behind major design patterns is presented along with an outline of their consequences, constraints and applicability to the port. In the course of several iterations, this pattern language has been refined through their use in porting of existing embedded micro-kernels to different hardware platforms.
A Unified Approach to Dynamic Point Location, Ray Shooting and Shortest Paths in Planar Maps
Authors: Yi Chiang, Franco P. Preparata, Roberto Tamassia
Venue:  (1992)

We describe a new technique for dynamically maintaining the trapezoidal decomposition of a planar map $\cal M$ with $n$ vertices, and apply it to the development of a unified dynamic data structure that supports point-location, ray-shooting, and shortest-path queries in $\cal M$. The space requirement is $O(n\log n)$. Point-location queries take time $O(\log n)$. Ray-shooting and shortest-path queries take time $O(\log^3 n)$ (plus $O(k)$ time if the $k$ edges of the shortest path are reported in addition to its length). Updates consist of insertions and deletions of vertices and edges, and take $O(\log^3 n)$ time (amortized for vertex updates).
Large-Scale Sorting in Uniform Memory Hierarchies
Authors: Jeffrey S Vitter, Mark H. Nodine
Venue:  (1992)

We present several efficient algorithms for sorting on the uniform memory hierarchy (UMH), introduced by Alpern, Carter, and Fei, and its parallelization P-UMH. We give optimal and nearly-optimal algorithms for a wide range of bandwidth degradations, including a parsimonious algorithm for constant bandwidth. We also develop optimal sorting algorithms for all bandwidths for other versions of UMH and P-UMH, including natural restrictions we introduce called RUMH and P-RUMH, which more closely correspond to current programming languages.
Model of Knowledge for Intelligent Systems of Designing
Authors: Igor V. Grechin
Venue: Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02) (2002)

We have the task of designing, expert knowledge for solution of this complicated problem is rather difficult for presenting for usage by the expert systems. The article describes questions of usage of various models of knowledge and application of this knowledge for solution of the task of designing. The special attention is pointed on usage frame-based model of knowledge for construction of the module of designing in the hybrid expert systems. 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
Everquest Box Set
Venue:  (2003)

:Four Guides in One Box Get full coverage of EverQuest worlds Ruins of Kunark and Shadows of Lucin (character creation, city maps, enemy stats), plus the EverQuest Players Guide, which will start every player off on the right foot. As a bonus, you even get the all new EverQuest Spell Book, which covers every spell in this massive world. No player should be without it!This box set includes the following: ·EverQuest Player's Guide ·Shadows of Lucin: Prima's Official Strategy Guide ·Ruins of Kunark: Prima's Official Strategy Guide ·EverQuest Spell BookAuthor Biography: 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
Some Notes on Rational Spaces
Authors: Allan Cheng, Dexter Kozen
Venue:  (1996)

Set constraints are inclusions between expressions denoting set of ground terms over a finitely ranked alphabet $\Sigma$. Rational spaces are topological spaces obtained as spaces of runs of topological $\Sigma$-hypergraphs. They were introduced by Kozen in \cite{K95a}, where the topological structure of the spaces of solutions to systems of set constraints was given in terms of rational spaces. In this paper we continue the investigation of rational spaces. We give a Myhill-Nerode like characterization of rational points, which in turn is used to re-derive results about the rational points of finitary rational spaces. We define congruences on $\Sigma$-hypergraphs, investigate their interplay with the Myhill-Nerode characterization, and finally we determine the computational complexity of some decision problems related to rational spaces.
New Partitioning Schemes for Parallel Modified Gram-Schmidt Orthogonalization
Authors: Suely Oliveira, Takako Soma
Venue: Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (1997)

In this paper we are concerned with parallel implementation of row-oriented Gram-Schmidt orthogonalization. For the data partitioning four types of columnwise partitioning schemes were considered: column (1-col), block, cyclic and block-cyclic (b-c) partitioning. Analytical models for parallel execution time required by these implementations are derived and compared with numerical results. The best partitioning scheme is shown theoretically and by numerical results.
A Method of Embedded Memory Access Time Measurement
Venue: Proceedings of the 2nd International Symposium on Quality Electronic Design (2001)

The memory access time is the vital factor for embedded memory because the access time dominates the embedded memory performance. To characterize the accurate access time in tester for embedded memory is a big issue and an important topic that needs to research. The traditional method to measure the embedded memory access time is not accurate enough for the deep sub-micron environment. Moreover, the traditional method also needs the engineer to repeat many times and try-and-error by hand in test machine. This paper presents a new method to measure the embedded memory access time. It uses the BIST (Build-In Self Test) circuitry and revised the March C+ algorithm so that this circuitry can automatically characterize the embedded memory access time in tester. Moreover, this method can measure the maximum access time for each bit and each address in embedded memory. This method can guarantee that the access time measured from the tester is the worst condition in the embedded memory.
Source-Channel Coding of Video Signals for Transmissions in Heterogeneous Network with Collisions
Authors: A. Santana T. Gustavo, S. Adriana Viveros
Venue: Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00) (2000)

The problem of data transmission in a heterogeneous network environment involves many considerations, among these: the design and selection of coding schemes and transmissions techniques are the most relevant. Recently, the interest in mobile multimedia networks has stimulated the researches in this field. Significant progress has been made in this technology. The problem becomes more relevant if we desire to transmit signal in wireline and wireless networks. Progressive transmission is very useful for sending video and, in general, multimedia data over band-limited channels; although it presents problems over noisy channels due to it uses variable length coding. So it requires high quality methods to avoid channels noises.One approach is to merge the above-mentioned progressive transmission with VQ 2-D-CELP of video over fading channels approach that extends the concept of CELP for Speech Coding. This technique employs an inverse error predictor filter, an iterative clustering method to design the predictor's form an initial array and an algorithm to determine the block size. We state the general design problem, decompose it into simpler sub-problems and discuss the solutions to these sub-problems.
Minimizing the Input/Output Bottleneck
Authors: Mark H Nodine
Venue:  (1992)

In this thesis, we examine ways of ameliorating the input/output (I/O) bottleneck through developing special-purpose algorithms tailored to specific I/O environments. We give provably optimal deterministic algorithms for sorting on parallel disks and in parallel memory hierarchies. The memory hierarchies considered are the Hierarchical Memory Model (HMM), the Block Transfer model (BT), and the Uniform Memory Hierarchy (UMH). We give an algorithm for sorting that is simultaneously optimal in terms of I/Os and internal processing time in a model where we have $D$ disks and $P$ processors, as long as $P$ does not exceed $M \log \min \{M/B,\log M\}/\log M$. We give the first known algorithms for sorting efficiently in single Uniform Memory Hierarchies. We show how to achieved optimal I/O performance of VLSI implementations of lattice computations by transferring less information, and give matching upper and lower bounds. Finally, we show how to use blocking efficiently for external graph searching.
Combining individual and cooperative learning for multi-agent negotiations
Authors: Leen-kiat Soh, Juan Luo
Venue: Proceedings of the second international joint conference on Autonomous agents and multiagent systems (2003)

In this paper, we propose a distributed multi-strategy learning methodology based on case-based reasoning in which an agent conducts both individual learning by observing its environment and cooperative learning by interacting with its neighbors. Cooperative learning is generally more expensive than individual learning due to the communication and processing overhead. Thus, our methodology employs a cautious utility-based adaptive mechanism to combine the two, an interaction protocol for soliciting and exchanging information, and the idea of a chronological casebase. Here we report on experimental results on the roles and effects of the methodology in a multiagent environment.
Family of Fast Transforms over GF(3) Logic
Authors: Bogdan J. Falkowski, Cheng Fu
Venue: Proceedings of the 33rd International Symposium on Multiple-Valued Logic (2003)

New classes of recursive transforms over GF(3) havebeen introduced here. They are based on simple recursiveequations what allows to obtain corresponding fastforward and inverse transforms and very regular butterflydiagrams. The classification is further extended intovarious transforms with horizontal and verticalpermutations. The relations between various classes ofintroduced ternary transforms are also discussed.
V-NET: a framework for a versatile network architecture to support real-time communication performance guarantees
Authors: B. Field, T. F. Znati, D. Mossé
Venue: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3 (1995)

The paper proposes a new network architecture, called the versatile network architecture (V-NET), which provides a framework for flexible support of communication requirements in real-time networks. Applications communicate over the V-NET by using simplex end-to-end network connections which support specific real-time and reliability characteristics tailored to meet the application's specified requirements. V-NET differs from other proposed architectures in that it does not assume one specific packet scheduling algorithm or a specific traffic policing mechanism. Instead, the V-NET has been designed to support a variety of packet scheduling algorithms and traffic policing mechanisms. This flexibility is an important design consideration as a real-time network architecture must accommodate existing and future multimedia applications.
A protocol-adaptive monitoring tree for efficient design of traffic monitoring probes
Authors: E. Magaña, J. Aracil, J. Villadangos
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2003)

This paper presents a novel protocol-adaptive monitoring tree (PAM-Tree) algorithm. PAM-Tree is a filtering algorithm that fulfills the needs of a general-purpose traffic monitoring system. PAM-Tree is aimed at overcoming the inefficiencies of existing stream-oriented traffic probes in traffic monitoring scenarios where large numbers of filters change dynamically. Both analytical and experimental performance evaluations show that PAM-Tree has a great potential to be an efficient filtering engine for high-speed loss-less monitoring systems.
Three Clicks Away: Advice from the Trenches of eCommerce
Authors: Michael Drapkin, Jon Lowy, Daniel Marovitz
Venue:  (2002)

:On the Web, you should never be more than 3 clicks away from the information you need3 Clicks Away delivers the collective experience of three distinguished Internet strategists who have led e-commerce initiatives for such notable firms as Gateway, Dow Jones, iVillage, Nickelodeon, and Casio. This book is a tactical guide that demonstrates how to develop e-commerce strategy, revamp the organization so that it can support e-commerce initiatives, and manage complex multidisciplinary projects. 3 Clicks Away provides the solutions and tools executives and managers need to successfully launch and maintain e-commerce sites. It provides critical information on organizational, financial, and project management tactics.
Issues and Obstacles with Multimedia Authoring
Authors: Fillia Makedon, Samuel A. Rebelsky, Matthew Cheyney, Charles B. Owen, Peter A. Gloor
Venue:  (1995)

Unlike traditional authoring, multimedia authoring involves making hard choices, forecasting technological evolution and adapting to software and hardware technology changes. It is, perhaps, an unstable field of endeavor for an academic to be in. Yet, it is important that academics are, in fact, part of this process. This paper discusses some of the common threads shared by three dissimilar cases of multimedia authoring which we have experimented with, that of multimedia conference proceedings, multimedia courseware development and multimedia information kiosks. We consider these applications from an academic point of view and review the benefits and pitfalls of academic development while sharing points of hard-learned wisdom. We draw on experiences from some of the projects run at the Dartmouth Experimental Visualization Laboratory (DEVlab), where we have been developing different types of multimedia applications.
On the difficulty of approximately maximizing agreements
Authors: Shai Ben-David, Nadav Eiron, Philip M. Long
Venue: Journal of Computer and System Sciences (2003)

We address the computational complexity of learning in the agnostic framework. For a variety of common concept classes we prove that, unless P = NP, there is no polynomial time approximation scheme for finding a member in the class that approximately maximizes the agreement with a given training sample. In particular our results apply to the classes of monomials, axis-aligned hyper-rectangles, closed balls and monotone monomials. For each of these classes, we prove the NP-hardness of approximating maximal agreement to within some fixed constant (independent of the sample size and of the dimensionality of the sample space). For the class of half-spaces, we prove that, for any ε > 0, it is NP-hard to approximately maximize agreements to within a factor of (418/415 - ε), improving on the best previously known constant for this problem, and using a simpler proof. An interesting feature of our proofs is that, for each of the classes we discuss, we find patterns of training examples that, while being hard for approximating agreement within that concept class, allow efficient agreement maximization within other concept classes. These results bring up a new aspect of the model selection problem--they imply that the choice of hypothesis class for agnostic learning from among those considered in this paper can drastically effect the computational complexity of the learning process.