ppxscal/embedding_network huggingface dataset:
Windows Communication Foundation 3.5 Unleashed, 2 edition
Authors: Craig McMurty, Nigel Watling, Matt Winkler, Marc Mercuri
Venue:  (2008)

Windows Communication Foundation (WCF) is Microsofts dynamic technology for allowing autonomous software to communicate. Superseding earlier technologies such as COM/DCOM, .NET Remoting, ASP.NET Web Services, and the Web Services Enhancements for .NET, WCF provides a single solution that is designed to always be the best way to exchange data among software entities. It also provides the infrastructure for developing the next generation of Web Services, with support for the WS-* family of specifications, and a new serialization system for enhanced performance. In the 3.5 release, WCF has been expanded to include support for REST, JSON, and Syndication (RSS and Atom) services, further broadening the possibilities for what can be done. For information technology professionals, WCF supplies an impressive array of administration tools that enterprises and software vendors can use to reduce the cost of ownership of their solutions without writing a single line of code. Most important, WCF delivers on the promise of model-driven software development with the new software factory approach, by which one can iteratively design solutions in a modeling language and generate executables from lower-level class libraries.Windows Communication Foundation 3.5 Unleashed is designed to be the essential resource for software developers and architects working with WCF. The book guides readers through a conceptual understanding of all the facilities of WCF and provides step-by-step guides to applying the technology to practical problems.As evangelists at Microsoft for WCF, WF, and CardSpace, Craig McMurtry, Marc Mercuri, Nigel Watling, and Matt Winkler are uniquely positioned to write this book. They had access to the development team and to the product as it was being built. Their work with enterprises and outside software vendors has given them unique insight into how others see the software, how they want to apply it, and the challenges they face in doing so.--Gives you nearly 100 best practices for programming with WCF --Provides detailed coverage of how to version services that you will not find anywhere else --Delves into using WCF together with Windows Workflow Foundation (WF) and Windows CardSpace --Provides detailed coverage of the new high-performance data contract serializer for .NET --Walks you through creating secure, reliable, transacted messaging, and how to understand the available options --Introduces you to federated, claims-based security and shows you how to incorporate SAML and WS-Trust security token services into your architecture --Provides step-by-step instructions for how to customize every aspect of WCF --Shows you how to add behaviors, communication channels, message encoders, and transports --Presents options for implementing publish/subscribe solutions --Gives clear guidance on peer-to-peer communications with WCF
Gautama --- Ontology Editor Based on Nyaya Logic
Authors: G. S. Mahalakshmi, T. V. Geetha, Arun Kumar, Dinesh Kumar, S. Manikandan
Venue: Proceedings of the 3rd Indian Conference on Logic and Its Applications (2009)

Indian logic based approach of knowledge representation fundamentally classifies the world knowledge into concepts, and relations, both enriched with special qualities. To be more precise, Nyaya Sastra recommends a special categorization of world knowledge which is supposed to be elaborate in tapping the minute details in the defined knowledge units. Nyaya logics are a mechanism which defines the concept and relation elements of ontology based on the epistemology of Nyaya-Vaisheshika school of Indian logic. We have already proposed an ontology reference model based on Nyaya logic, known as NORM. To develop an ontology using Nyaya logics, one should be aware of the syntax and semantics of NORM rdf. To overcome the difficulty involved in creating NORM based ontology, in this paper, we propose Gautama, a tool for editing the ontology based on Nyaya logics. We also discuss the steps for building the ontology for a sample from `Birds' domain.
Efficient Calculation of the Transition Matrix in a Max-Plus Linear State-Space Representation
Authors: Hiroyuki Goto
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

This research considers an efficient method for calculating the transition matrix in an MPL (Max-Plus Linear) state-space representation. This matrix can be generated by applying the Kleene star operator to an adjacency matrix. The proposed method, based on the idea of a topological sort in graph theory and block splitting, is able to calculate the transition matrix efficiently.
The Economics of Iterative Software Development: Steering Toward Better Business Results, 1 edition
Authors: Walker Royce, Kurt Bittner, Michael Perrow
Venue:  (2009)

Results-Based Software Management: Achieve Better Outcomes with Finite Resources Effective software development is no longer merely an IT concern: today, it is crucial to the entire enterprise. However, most businesspeople are not ready to make informed decisions about software initiatives. The Economics of Iterative Software Development: Steering Toward Better Business Results will prepare them. Drawing on decades of software development and business experience, the authors demonstrate how to utilize practical, economics-based techniques to plan and manage software projects for maximum return on technology investments. The authors begin by dispelling widespread myths about software costs, explaining why traditional, engineering-based software management introduces unacceptable inefficiencies in todays development environments. Next, they show business and technical managers how to combine the principles of economics and iterative development to achieve optimal results with limited resources. Using their techniques, readers will learn how to build systems that enable maximum business innovation and process improvementand implement software processes that allow them to do so consistently. Highlights include How to repeatedly quantify the value a project is delivering and quickly adjust course as needed How to reduce software project size, complexity, and other project killers How to identify and eliminate software development processes that dont work How to improve development processes, reduce rework, mitigate risk, and identify inefficiencies How to create more proficient teams by improving individual skills, team interactions, and organizational capability Where to use integrated, automated tools to improve effectiveness What to measure, and when: specific metrics for project inception, elaboration, construction, and transition The Economics of Iterative Software Development: Steering Toward Better Business Results will help both business and technical managers make better decisions throughout the software development processand it will help team and project leaders keep any project or initiative on track, so they can deliver more value faster.
Strongly polynomial-time truthful mechanisms in one shot
Authors: Paolo Penna, Guido Proietti, Peter Widmayer
Venue: Theoretical Computer Science (2009)

One of the main challenges in algorithmic mechanism design is to turn (existing) efficient algorithmic solutions into efficient truthful mechanisms. Building a truthful mechanism is indeed a difficult process since the underlying algorithm must obey certain ''monotonicity'' properties and suitable payment functions need to be computed (this task usually represents the bottleneck in the overall time complexity). We provide a general technique for building truthful mechanisms that provide optimal solutions in strongly polynomial time. We show that the entire mechanism can be obtained if one is able to express/write a strongly polynomial-time algorithm (for the corresponding optimization problem) as a ''suitable combination'' of simpler algorithms. This approach applies to a wide class of mechanism design graph problems, where each selfish agent corresponds to a weighted edge in a graph (the weight of the edge is the cost of using that edge). Our technique can be applied to several optimization problems which prior results cannot handle (e.g., MIN-MAX optimization problems). As an application, we design the first (strongly polynomial-time) truthful mechanism for the minimum diameter spanning tree problem, by obtaining it directly from an existing algorithm for solving this problem. For this non-utilitarian MIN-MAX problem, no truthful mechanism was known, even considering those running in exponential time (indeed, exact algorithms do not necessarily yield truthful mechanisms). Also, standard techniques for payment computations may result in a running time which is not polynomial in the size of the input graph. The overall running time of our mechanism, instead, is polynomial in the number n of nodes and m of edges, and it is only a factor O(n@a(n,n)) away from the best known canonical centralized algorithm.
Detection Based on Per-flow Packet Count and Entropy
Authors: Xuyang Zhu, Hai Zhang
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

Portscanning is a common activity of considerable importance.It is often used by computer attackers to characterize hosts or networks which they are considering hostile activity against. Thus it is useful for system administrators and other network defenders to detect portscans as possible preliminaries to a more serious attack. Thus it is of considerable interest to attackers to determine whether or not the defenders of a network are portscanning it regularly. A major difficulty with detecting these portscans on high-speed monitoring point is that the traffic volume on high speed links can be tens of gigabits per second and can contain millions of flow and high volume of traffic. This data set is sometimes too large for us. Fortunately, samplings a typical solution for this problem. So it is usually to employ a sampling method to reduce the data set first. There have been many alternative sampling methods. In this paper, we use a simple and appropriate sampling technique for portscan detection, which we call threshold sampling. It can select large prior to small ones. Meanwhile, it can control the resources consumed by adjusting the threshold. When portscans happen in a network, the attacker always sends flows with only one packet. We hope to pick out these flows applying threshold sampling. We need to select the small prior to big ones. we compute the reciprocal of each attribute as the new attribute. In a word, we employ a mapping from the old attribute to the new one. Then we can employ the sampling. With the reduced data set, we can detect ports scanners more easily and quickly. This is a good preparation for detecting ports can. What’s more, we introduce a new way to identify ports scanners. As the host which scan large number of different destination IP addresses and ports is probably a ports scanners, we can compute the entropy of each host, which reflect the distribution of its destination IP addresses and ports. The experimental results show that datum from the sample also can tell which hosts are port scanners accurately. We will see that the attackers’ entropy for destination IP address is bigger than others clearly.
A Hybrid Bounding Volume Algorithm to Detect Collisions between Deformable Objects
Authors: F. A. Madera, A. M. Day, S. D. Laycock
Venue: Proceedings of the 2009 Second International Conferences on Advances in Computer-Human Interactions (2009)

An algorithm to detect collisions between both rigid and deformable objects is presented. The approach exploits benefits of a Bounding Volume Hierarchy (BVH) and a Feature-based method. The BVH decomposes the three dimensional polygonal objects into a hierarchy of spheres. The lowest level of the hierarchy is formed utilising spheres which bound 1-rings surrounding each vertex of the original mesh. Spatial coherence is exploited during construction to ensure that adjacent 1-rings are joined first. This promotes tighter bounding volumes as the objects deform. Experiments were carried out to analyse the performance of the method when varying the BVH construction to consider octrees and binary trees. To illustrate the enhancement the approach provides it has been compared against standard Sphere and Axis-aligned Bounding Volume Hierarchies.
A survey of CAD model simplification techniques for physics-based simulation applications
Authors: Atul Thakur, Ashis Gopal Banerjee, Satyandra K. Gupta
Venue: Computer-Aided Design (2009)

Automated CAD model simplification plays an important role in effectively utilizing physics-based simulation during the product realization process. Currently a rich body of literature exists that describe many successful techniques for fully-automatic or semi-automatic simplification of CAD models for a wide variety of applications. The purpose of this paper is to compile a list of the techniques that are relevant for physics-based simulations problems and to characterize them based on their attributes. We have classified them into the following four categories: techniques based on surface entity based operators, volume entity based operators, explicit feature based operators, and dimension reduction operators. This paper also presents the necessary background information in the CAD model representation to assist the new readers. We conclude the paper by outlining open research directions in this field.
Optimal splitters for database partitioning with size bounds
Authors: Kenneth A. Ross, John Cieslewicz
Venue: Proceedings of the 12th International Conference on Database Theory (2009)

Partitioning is an important step in several database algorithms, including sorting, aggregation, and joins. Partitioning is also fundamental for dividing work into equal-sized (or balanced) parallel subtasks. In this paper, we aim to find, materialize and maintain a set of partitioning elements (splitters) for a data set. Unlike traditional partitioning elements, our splitters define both inequality and equality partitions, which allows us to bound the size of the inequality partitions. We provide an algorithm for determining an optimal set of splitters from a sorted data set and show that it has time complexity O(k lg2 N), where k is the number of splitters requested and N is the size of the data set. We show how the algorithm can be extended to pairs of tables, so that joins can be partitioned into work units that have balanced cost. We demonstrate experimentally (a) that finding the optimal set of splitters can be done efficiently, and (b) that using the precomputed splitters can improve the time to sort a data set by up to 76%, with particular benefits in the presence of a few heavy hitters.
Solving the Delay-Constrained Capacitated Minimum Spanning Tree Problem Using a Dandelion-Encoded Evolutionary Algorithm
Authors: Ángel M. Pérez-Bellido, Sancho Salcedo-Sanz, Emilio G. Ortiz-García, Antonio Portilla-Figueras, Maurizio Naldi
Venue: Proceedings of the 7th International Conference on Simulated Evolution and Learning (2008)

The Delay-Constrained Capacitated Minimum Spanning Tree (DC-CMST) is a recently proposed problem which arises in the design of the topology of communications networks. The DC-CMST proposes the joint optimization of the network topology in terms of the traffic capacity and its mean time delay. In this paper, an evolutionary algorithm which uses Dandelion-encoding is proposed to solve the problem. The Dandelion code has been recently proposed as an effective way of encoding trees in evolutionary algorithms, due to its good properties of locality. We describe the main characteristics of the algorithm, and compare its results with that of an existing heuristic for the DC-CMST. We show that our Dandelion-encoded evolutionary algorithm is able to obtain better results in all the instances tackled.
Statistical Analysis of QKD Networks in Real-Life Environments
Authors: Katharina Lessiak, Christian Kollmitzer, Stefan Schauer, Jürgen Pilz, Stefan Rass
Venue: Proceedings of the 2009 Third International Conference on Quantum, Nano and Micro Technologies (2009)

The aim of this paper is to show that external influences like temperature, humidity, sunshine duration and global radiation have effect on the quality of Quantum Key Distribution (QKD). It will be explained how the qubit error rate is correlated to these external influences. The correlations between the different influences will be analyzed using statistical methods, in particular generalized linear models.
Angkor Ruins: the Bayon Temple and its Faces
Authors: Katsunori Ishikawa
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

At TOPPAN PRINTING CO., LTD., we have been producing high-definition, real-time computer graphics using the TOPPAN VR System since 1997. Our virtual reality titles feature photo-realistically reproduced spaces based on 3D and colorimetric measurements to create digital archives of cultural heritage. Viewers can freely and interactively adjust their viewpoints within these accurately reproduced spaces and experience an overwhelming sense of immersion. Our titles are shown at various exhibitions and museums worldwide.
Server and presentation application for eLearning system
Authors: Krzysztof Tokarz, Szymon Masłowski, Mateusz Zołnowski
Venue: Proceedings of the 8th conference on Systems theory and scientific computation (2008)

In this paper two parts of eLearning system developed at the Silesian University of Technology have been presented. The main idea of the system is to provide distance lectures for students including persons with different disabilities. The system uses audio, video and text messages transmission and in this part it is similar to videoconference. Additionally system is prepared to handle special channels with data for handicapped persons. The teacher can present the lecture in traditional way and transmit the presentation to remote students using the Internet. The system consists of three parts: streaming server, control application and presentation application. In this paper the short description of the system has been presented with details about streaming server and presentation application implementation.
Active Polarization Descattering
Authors: Tali Treibitz, Yoav Y. Schechner
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2009)

Vision in scattering media is important but challenging. Images suffer from poor visibility due to backscattering and attenuation. Most prior methods for scene recovery use active illumination scanners (structured and gated), which can be slow and cumbersome, while natural illumination is inapplicable to dark environments. The current paper addresses the need for a non-scanning recovery method, that uses active scene irradiance. We study the formation of images under widefield artificial illumination. Based on the formation model, the paper presents an approach for recovering the object signal. It also yields rough information about the 3D scene structure. The approach can work with compact, simple hardware, having active widefield, polychromatic polarized illumination. The camera is fitted with a polarization analyzer. Two frames of the scene are taken, with different states of the analyzer or polarizer. A recovery algorithm follows the acquisition. It allows both the backscatter and the object reflection to be partially polarized. It thus unifies and generalizes prior polarization-based methods, which had assumed exclusive polarization of either of these components. The approach is limited to an effective range, due to image noise and illumination falloff. Thus, the limits and noise sensitivity are analyzed. We demonstrate the approach in underwater field experiments.
V-detector: An efficient negative selection algorithm with "probably adequate" detector coverage
Authors: Zhou Ji, Dipankar Dasgupta
Venue: Information Sciences: an International Journal (2009)

This paper describes an enhanced negative selection algorithm (NSA) called V-detector. Several key characteristics make this method a state-of-the-art advance in the decade-old NSA. First, individual-specific size (or matching threshold) of the detectors is utilized to maximize the anomaly coverage at little extra cost. Second, statistical estimation is integrated in the detector generation algorithm so the target coverage can be achieved with given probability. Furthermore, this algorithm is presented in a generic form based on the abstract concepts of data points and matching threshold. Hence it can be extended from the current real-valued implementation to other problem space with different distance measure, data/detector representation schemes, etc. By using one-shot process to generate the detector set, this algorithm is more efficient than strongly evolutionary approaches. It also includes the option to interpret the training data as a whole so the boundary between the self and nonself areas can be detected more distinctly. The discussion is focused on the features attributed to negative selection algorithms instead of combination with other strategies.
Resource usage policy expression and enforcement in grid computing
Authors: Jun Feng, Glenn Wasson, Marty Humphrey
Venue: Proceedings of the 8th IEEE/ACM International Conference on Grid Computing (2007)

To date, not enough attention has been paid to issues surrounding the description and enforcement of policies for controlling Grid resources. These policies define the permitted or desired usage scenario(s) allowed by resource providers, virtual organizations, or even the governing body for an entire Grid. Most existing Grid systems have either “in-spirit” usage policies with no actual enforcement (e.g., all resource providers are assumed to contribute in kind), or have implicit resource usage policies whose intent can only be manifested by examining the ad-hoc policy enforcement. Moreover, systems that do define some resource usage policies typically consider only CPU resources, without mentioning other Grid resources such as disk and bandwidth. Unless sufficient resource usage policies and enforcement mechanisms are created, resource providers will be increasingly reluctant to participate in Grids out of fear that their local resources will be overrun. In this paper, we identify the requirements for a resource usage policy language, and then propose an event-centric model by which to implement these policies. We describe the language structure, its implementation on top of the XML access control language XACML and a policy service that processes the language. Because decisions based on this type of policy typically require information from outside the security context of a single Grid request, we extend XACML for general timer-based and event-centric processing necessary to enforce such Grid resource usage policies. We evaluate our prototype implementation on a Grid consisting of three data repositories by showing that a usage policy-controlled Grid environment can be achieved with only minimal overhead.