ppxscal/embedding_network huggingface dataset:
Signaling System #7, Fifth Edition, 5 edition
Authors: Travis Russell
Venue:  (2006)

The industry-standard SS7 reference—fully revised and expanded Control and analyze voice traffic on TDM and VoIP networks using SS7—the highly reliable, fault-tolerant signaling network. Completely revised and updated to cover the latest technologies and developments, Signaling System #7, Fifth Edition includes full details on the signaling network, its architecture, and protocols. You’ll learn, in laymen’s terms, how SS7 messaging works, how to maintain an SS7 network, and how to maximize the capabilities of SS7. Both wireline and wireless networks are covered in this comprehensive book, with added focus on mobile and convergent networks. Real-world examples, protocol message details, and call flows illustrate each important concept in full detail. NEW TO THIS EDITION: In-depth coverage of SS7 over IP (SIGTRAN) A new chapter covering the Mobile Application Part (MAP) Details on using SS7 as a data source for revenue assurance, billing analysis, fraud detection, and lawful intercept The latest ANSI and ITU standards Table of contentsChapter 1: Signaling System #7Chapter 2: The SS7 NetworkChapter 3: Overview of a ProtocolChapter 4: Overview of Signal Units Chapter 5: Message Transfer Part (MTP)Chapter 6: Message Transfer Part (MTP) Level 3Chapter 7: Signaling Transport (SIGTRAN)Chapter 8: ISDN User Part (ISUP)Chapter 9: General Description of SCCP FunctionsChapter 10: Overview of TCAPChapter 11: Mobile Application Part (MAP)Chapter 12: Applications, Monitoring, and OSSChapter 13: SS& and the IP Muiltimedia Subsystem (IMS)APPENDIX A: ITU-TSS SS7 PUBLICATIONSAPPENDIX B: AMERICAN NATIONAL STANDARDS INSTITUTE (ANSI)APPENDIX C: CAUSE CODESAPPENDIX D: ACRONYM LISTBIBLIOGRAPHYINDEX
A canonic interpretive program form for measuring "ideal" HLL architectures
Authors: M. J. Flynn
Venue: ACM SIGARCH Computer Architecture News (1978)

Over the past several years our group has become increasingly interested in the notion of an "ideal" machine. Ideal with respect to some specified higher level language (HLL) environment. Initially, much of the focus of the work was on traditional machines: trying to identify and factor out architectural instructions and artifacts in programs from functional instructions. For example, the existence of load or store accumulator instructions in a program representation are largely architectural since they specify a movement among the storage resources of a system rather than a movement required in the original source program. We found it useful at the time to define three types of instructions:(1) <u>M-type instructions</u> or memory partition movement instructions such as the aforementioned load and store instructions. These instructions move data within the storage hierarchy.(2) <u>P-instructions</u> or procedural instructions performing operations associated with instruction sequencing: branch, compare, test, etc.(3) <u>F-instructions</u> are the functional instructions which actually transform a datum. These would include arithmetic operations as well as logical and shifting operations.
Exponential Runge-Kutta methods for parabolic problems
Authors: Marlis Hochbruck, Alexander Ostermann
Venue: Applied Numerical Mathematics (2005)

The aim of this paper is to construct exponential Runge-Kutta methods of collocation type and to analyze their convergence properties for linear and semilinear parabolic problems. For the analysis, an abstract Banach space framework of sectorial operators and locally Lipschitz continuous nonlinearities is chosen. This framework includes interesting examples like reaction-diffusion equations. It is shown that the methods converge at least with their stage order, and that convergence of higher order (up to the classical order) occurs, if the problem has sufficient temporal and spatial smoothness. The latter, however, might require the source function to fulfil unnatural boundary conditions. Therefore, the classical order is not always obtained and an order reduction must be expected, in general.
Rapid and brief communication: Multisets mixture learning-based ellipse detection
Authors: Zhi-Yong Liu, Hong Qiao, Lei Xu
Venue: Pattern Recognition (2006)

We develop an ellipse detection algorithm based on the multisets mixture learning (MML) that differs from the conventional Hough transform perspective. The algorithm developed has potential advantages in terms of noise resistance, incomplete ellipse detection, and detecting a multitude of ellipses.
From social bookmarking to social summarization: an experiment in community-based summary generation
Authors: Oisin Boydell, Barry Smyth
Venue: Proceedings of the 12th international conference on Intelligent user interfaces (2007)

We describe a novel document summarization technique that uses informational cues, such as social bookmarks or search queries, as the basis for summary construction by leveraging the snippet-generation capabilities of standard search engines. A comprehensive evaluation demonstrates how the social summarization technique can generate summaries that are of significantly higher quality that those produced by a number of leading alternatives.
Identity-Based and Inter-Domain Password Authenticated Key Exchange for Lightweight Clients
Authors: Ford Long Wong, Hoon Wei Lim
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 01 (2007)

We propose a four-party password authenticated interdomain key exchange protocol which makes use of properties of identity-based cryptography and secret public keys. Being password-based and certificate-free, our protocol is lightweight and is suited to lightweight computing environments, such as pervasive computing. Apart from resistance against offline and active attacks, our protocol additionally provides perfect forward secrecy. We provide heuristic analysis of various security properties. Performance comparisons against other related protocols show that our protocol is efficient.
MCSE Self-Paced Training Kit (Exam 70-293): Planning and Maintaining a Microsoft Windows Server 2003 Network Infrastructure, Second Edition
Authors: Craig Zacker, Anthony Steven
Venue:  (2006)

Get in-depth exam preparation for the updated Exam 70-293, a core MCSA/MCSE exam for Windows Server 2003-and build real-world job skills. Includes case studies, troubleshooting labs, and more.
Inductive assertions and operational semantics
Authors: J. Strother Moore
Venue: International Journal on Software Tools for Technology Transfer (STTT) (2006)

This paper shows how classic inductive assertions can be used in conjunction with a formal operational semantics to prove partial correctness properties of programs. The method imposes only the proof obligations that would be produced by a verification condition generator &#x2013; but does not require the definition of a verification condition generator. All that is required is a theorem prover, a formal operational semantics, and the object program with appropriate assertions at user-selected cut points. The verification conditions are generated in the course of the theorem-proving process by straightforward symbolic evaluation of the formal operational semantics. The technique is demonstrated by proving the partial correctness of simple bytecode programs with respect to a preexisting operational model of the Java Virtual Machine.
Reasoning about linear circuits; a model-based approach
Authors: Juan J. Flores, Arthur M. Farley
Venue: AI Communications (1999)

Most of the work on behavior prediction in the field of Qualitative Reasoning has focused on transient behavior and responses to perturbations&semi; very little has been done regarding systems in steady state. A large class of systems, especially in the area of power systems, are designed for sinusoidal steady&dash;state operation. Thus, an understanding of the steady state behavior of electrical circuits is very important.This article presents a framework for reasoning about linear electrical circuits in sinusoidal steady state. The reasoning process relies on a constraint&dash;based model of the circuit, derived from electro&dash;magnetic theory and generated automatically from the structure of the circuit. In a linear circuit operating in steady state, all quantities are sinusoidals of the same frequency as the source. Since any sinusoidal can be expressed as the real part of a complex exponential, we use the complex form, which simplifies computations&semi; this complex form, characterized by magnitude and angle, is called a phasor. In order to capture magnitude and phase angle information in the model, all constraints operate on phasor variables.Constraint Propagation (CP) is the main inference mechanism. The CP module reasons with as much information and precision as the user provides, ranging from qualitative to quantitative. Intervals provide a general representation mechanism.The framework presented in this article has been implemented in a program called Qualitative Phasor Analysis (QPA), which performs circuit analysis, parameter design, diagnosis, control design, and structure simplification. Circuits with multiple sources are solved using the superposition principle.
Strongly normal sets of contractible tiles in N dimensions
Authors: T. Yung Kong, Punam Kumar Saha, Azriel Rosenfeld
Venue: Pattern Recognition (2007)

The second and third authors and others have studied collections of (usually) convex ''tiles''-a generalization of pixels or voxels-in R^2 and R^3 that have a property called strong normality (SN): for any tile P, only finitely many tiles intersect P, and any nonempty intersection of those tiles also intersects P. This paper extends basic results about strong normality to collections of contractible polyhedra in R^n whose nonempty intersections are contractible. We also give sufficient (and trivially necessary) conditions on a locally finite collection of contractible polyhedra in R^2 or R^3 for their nonempty intersections to be contractible.
C#Builder Kick Start
Authors: Joe Mayo
Venue:  (2003)

C#Builder Kick Start provides a rapid overview of the C#Builder tool, a Borland developerï¾¿s introduction to C# explaining the new forms and interfaces, and set of examples illustrating the power of C#, C#Builder, and .NET development. Special attention is paid to differences between existing Borland tools and development strategies and C#Builder.
Assessment of the NIST shop data model as a neutral file format
Authors: Greg Harward, Charles Harrell
Venue: Proceedings of the 38th conference on Winter simulation (2006)

This paper evaluates the shop data model (SDM) being developed by the National Institute of Standards and Technology (NIST) in terms of its viability as a neutral file format (NFF) for the discrete-event simulation (DES) of manufacturing systems. ProModel simulation software served as the test case for this evaluation. Observations are also provided regarding the challenges that simulation vendors might encounter when implementing the proposed NIST SDM. This paper shows that the NIST SDM doesn't pose any limitations which would prevent it from syntactically representing a manufacturing simulation model, however, it is not without certain challenges and difficulties. While only 28% of the ProModel data elements are currently supported by the SDM, future enhancements to the SDM should allow the information model to serve as a foundation upon which a common information model and NFF for the DES industry could be built.
Low-rate TCP-targeted denial of service attacks and counter strategies
Authors: Aleksandar Kuzmanovic, Edward W. Knightly
Venue: IEEE/ACM Transactions on Networking (TON) (2006)

Denial of Service attacks are presenting an increasing threat to the global inter-networking infrastructure. While TCP's congestion control algorithm is highly robust to diverse network conditions, its implicit assumption of end-system cooperation results in a well-known vulnerability to attack by high-rate non-responsive flows. In this paper, we investigate a class of low-rate denial of service attacks which, unlike high-rate attacks, are difficult for routers and counter-DoS mechanisms to detect. Using a combination of analytical modeling, simulations, and Internet experiments, we show that maliciously chosen low-rate DoS traffic patterns that exploit TCP's retransmission timeout mechanism can throttle TCP flows to a small fraction of their ideal rate while eluding detection. Moreover, as such attacks exploit protocol homogeneity, we study fundamental limits of the ability of a class of randomized timeout mechanisms to thwart such low-rate DoS attacks.
Improving confidence in network simulations
Authors: Michele C. Weigle
Venue: Proceedings of the 38th conference on Winter simulation (2006)

Simulation has become the tool of choice for an increasing number of networking researchers. Unfortunately, standard statistical techniques often cannot be applied when Internetlike heavy-tailed workloads are used as input. We present issues involved in using heavy-tailed distributions in network simulations, including three different methods for dealing with such distributions in simulation. We also discuss the proper use of the random number generator implemented in the ns-2 simulator and the impacts of improper usage.
Prototype reduction schemes applicable for non-stationary data sets
Authors: Sang-Woon Kim, B. John Oommen
Venue: Pattern Recognition (2006)

All of the prototype reduction schemes (PRS) which have been reported in the literature, process time-invariant data to yield a subset of prototypes that are useful in nearest-neighbor-like classification. Although these methods have been proven to be powerful, they suffer from a major disadvantage when they are utilized for applications involving non-stationary data, namely, time varying samples, typical of video and multimedia applications. In this paper, we suggest two PRS mechanisms which, in turn, are suitable for two distinct models of non-stationarity. In the first model, the data points obtained at discrete time steps, are individually assumed to be perturbed in the feature space, because of noise in the measurements or features. As opposed to this, in the second model, we assume that, at discrete time steps, new data points are available, and that these themselves are generated due to a non-stationarity in the parameters of the feature space. In both of these cases, rather than process all the data as a whole set using a PRS, we propose that the information gleaned from a previous PRS computation be enhanced to yield the prototypes for the current data set using an LVQ-3 type ''fine tuning''. The results are, to our knowledge, the first reported PRS results for non-stationary data, and can be summarized as follows: if the system obeys the first model of non-stationarity, the improved accuracy is as high as 90.98% for artificial data ''Non_normal 2'', and as high as 97.62% for the real-life data set, ''Arrhythmia''. As opposed to this, if the system obeys the second model of non-stationarity, the improved accuracy is as high as 76.30% for the artificial data, and as high as 97.40% for this real-life data set. These are, in our opinion, very impressive, considering that the data sets are truly time-varying.
Automatic enumeration and evaluation of certain multiprocessor design alternatives
Authors: Tony Middleton
Venue: ACM SIGMICRO Newsletter (1977)

Quite often, a designer has to chose from several alternative ways of achieving the same end. When the number of alternatives is very large, it is useful to have an "analyser" available which will mechanically enumerate the alternatives and assign a cost to each one - finally identifying the best alternative. The author has already produced such an analyser for serial programs [1, 2]. The intention of this paper is to suggest that the approach used in this earlier work can be of relevance to the design of systems involving several processors (in particular, pipelines which are in a steady state). The analyses used are very approximate, but should be sufficient to select, from a large number of alternatives, the few alternatives which warrant detailed study (e.g. by precise simulation).
Flexible tool support for accessibility evaluation
Authors: Barbara Leporini, Fabio Paternò, Antonio Scorcia
Venue: Interacting with Computers (2006)

The increasing need to check Web site accessibility has stimulated interest in tools to aid the various activities involved. While some tools for this purpose already exist, we believe that there is a demand for making their support more flexible. In particular, there is often a need for validation of multiple sets of guidelines, repairing Web pages and providing better reports for the evaluators. In this paper, we discuss such issues and how we have addressed them in the design of MAGENTA, our new tool for supporting inspection-based evaluation of accessibility and usability guidelines.
Web Service Security: Scenarios, Patterns, and Implementation Guidance for Web Services Enhancements (WSE) 3.0
Venue:  (2006)

The WEB SERVICE SECURITY guide provides guidance for applying security to Web services by using WSE 3.0 and Microsoft® .NET Framework 2.0. 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
Ajax Design Patterns
Authors: Michael Mahemoff
Venue:  (2006)

Ajax, or Asynchronous JavaScript and XML, exploded onto the scene in the spring of 2005 and remains the hottest story among web developers. With its rich combination of technologies, Ajax provides a strong foundation for creating interactive web applications with XML or JSON-based web services by using JavaScript in the browser to process the web server response.Ajax Design Patterns shows you best practices that can dramatically improve your web development projects. It investigates how others have successfully dealt with conflicting design principles in the past and then relays that information directly to you.The patterns outlined in the book fall into four categories:Foundational technology: Examines the raw technologies required for Ajax developmentProgramming: Exposes techniques that developers have discovered to ensure their Ajax applications are maintainableFunctionality and usability: Describes the types of user interfaces you'll come across in Ajax applications, as well as the new types of functionality that Ajax makes possibleDevelopment: Explains the process being used to monitor, debug, and test Ajax applicationsAjax Design Patterns will also get you up to speed with core Ajax technologies, such as XMLHttpRequest, the DOM, and JSON. Technical discussions are followed by code examples so you can see for yourself just what is-and isn't-possible with Ajax. This handy reference will help you to produce high-quality Ajax architectures, streamline web application performance, and improve the user experience.Michael Mahemoff holds a PhD in Computer Science and Software Engineering from the University of Melbourne, where his thesis was "Design Reuse in Software Engineering and Human-Computer Interaction." He lives in London and consults on software development issues in banking, health care, and logistics."Michael Mahemoff's Ajax Design Patterns is a truly comprehensive compendium of web application design expertise, centred around but not limited to Ajax techniques. Polished nuggets of design wisdom are supported by tutorials and real-world code examples resulting in a book that serves not only as an intermediate to expert handbook but also as an extensive reference for building rich interactive web applications." --Brent Ashley, remote scripting pioneer
Scatter search for chemical and bio-process optimization
Authors: Jose A. Egea, María Rodríguez-Fernández, Julio R. Banga, Rafael Martí
Venue: Journal of Global Optimization (2007)

Scatter search is a population-based method that has recently been shown to yield promising outcomes for solving combinatorial and nonlinear optimization problems. Based on formulations originally proposed in 1960s for combining decision rules and problem constraints such as the surrogate constraint method, scatter search uses strategies for combining solution vectors that have proved effective in a variety of problem settings. In this paper, we develop a general purpose heuristic for a class of nonlinear optimization problems. The procedure is based on the scatter search methodology and treats the objective function evaluation as a black box, making the search algorithm context-independent. Most optimization problems in the chemical and bio-chemical industries are highly nonlinear in either the objective function or the constraints. Moreover, they usually present differential-algebraic systems of constraints. In this type of problem, the evaluation of a solution or even the feasibility test of a set of values for the decision variables is a time-consuming operation. In this context, the solution method is limited to a reduced number of solution examinations. We have implemented a scatter search procedure in Matlab (Mathworks, 2004) for this special class of difficult optimization problems. Our development goes beyond a simple exercise of applying scatter search to this class of problems, but presents innovative mechanisms to obtain a good balance between intensification and diversification in a short-term search horizon. Computational comparisons with other recent methods over a set of benchmark problems favor the proposed procedure.
Musical part separation based on perceptual hierarchy
Authors: Tomoyoshi Kinoshita, Ibuki Handa, Makoto Muto, Shuichi Sakai, Hidehiko Tanaka
Venue: Systems and Computers in Japan (2007)

There have been many studies of auditory scene analysis in which an attempt was made to understand external events through acoustic signals. In particular, when the target is limited to music, there have been several studies aiming at automatic music scoring. In most previous studies, however, the procedure is constantly limited to local processing. Even if the procedure continues along the time axis, it is confined to the local neighborhood on the time axis, and only limited processing performance is realized. The purpose of this paper is to improve this aspect. A method is proposed which focuses on the hierarchical structure in the perception of the acoustic stream and extracts a single note string corresponding to each part from the music. In the proposed method, phrases are formed as an intermediate step in extracting the parts. Local clues are used in forming the phrases, and global clues are used in forming the parts. By using this approach, the parts are successfully extracted without problems such as explosion of the computational complexity. In a preliminary experiment, the parts were successfully extracted with a reproduction rate of approximately 80&percnt; and a fit rate of approximately 85&percnt;. &copy; 2007 Wiley Periodicals, Inc. Syst Comp Jpn, 38(2): 91&ndash; 100, 2007; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10310