ppxscal/embedding_network huggingface dataset:
Server Capacity Planning for Web Traffic Workload
Authors: Krishna Kant, Youjip Won
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

The goal of this paper is to provide a methodology for determining bandwidth requirements for various hardware components of a World Wide Web server. The paper assumes a traditional symmetric multiprocessor (SMP) architecture for theweb-server, although the same analysis applies to an SMP node in a cluster. The paper derives formulae for bandwidth demandsfor memory, processor data bus, network adapters, disk adapters, I/O-memory paths, and I/O buses. Since the web workload characteristics vary widely, three sample workloads are considered for illustrative purposes: 1) standard SPECweb96,2) a SPECweb96-like workload that assumes dynamic data and retransmissions, and 3) WebProxy, which models a web proxyserver that does not do much caching and, thus, has rather severe requirements. The results point to a few general conclusions regarding Web workloads. In particular, reduction in memory/data bus bandwidth by using the virtual interface architecture (VIA)is very desirable, and the connectivity needs may go well beyond the capabilities of traditional systems based on the traditionalPCI-bus. Web workloads also demand a significantly higher memory bandwidth than data bus bandwidth and this disparity isexpected to increase with the use of VIA. Also, the current efforts to offload TCP/IP processing may require a larger headroomin I/O subsystem bandwidth than in the processor-memory subsystem.
Developing A RAD Standard
Authors: Don Millington, Jennifer Stapleton
Venue: IEEE Software (1995)

In early 1994, end-user organizations, and software tool vendors -- joined later by a sprinkling of academics -- established the Dynamic Systems Development Method Consortium. Their goal was "to develop and evolve continuously a public-domain method for rapid application development." Objectives included publishing a framework for the method, promoting it, providing training and certification, and so on.The first version of the DSDM proposed standard was published early this year. It identifies three factors that are critical for RAD methods: the end-user community must have a committed senior staff that allows developers easy access to end users, the development team must be stable and have well-established skills, and the application area must be commercial, with flexible initial requirements and a clearly defined user group.Version 2 of the DSDM Manual is scheduled to be published in January 1996. In the interim, the method is being used on a trial basis by DSDM Consortium members with extensive RAD experience who are looking for problems and new ideas. At the same time, working groups are creating material to enhance Version 1 in a range of areas, including system maintenance, reuse, and the relationships of DSDM to other methods.
Generation Theorem for the Streaming Operator in Slab Geometry
Authors: M. Boulanouar
Venue: Journal of Dynamical and Control Systems (2003)

We study the one-dimensional streaming operator in slab domain with general boundary conditions described by a linear operator K. We prove that the streaming operator generates a strongly continuous semigroup and determine its upper bound. We also give the expression of the generated semigroup, which we use to describe its asymptotic behavior in the next article in this issue.
Design-manufacturing interface for 0.13 micron and below
Authors: Andrzej J. Strojwas
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

Over the years, the increase in IC functionality has been achieved by a continuous drive towards smaller feature sizes. Due to the decreasing dimensions of semiconductor structures, the sensitivity to critical design and manufacturing parameters has risen dramatically. Vertical integration techniques and multi-level interconnect, which are becoming more common in modern technologies, have driven up the number of critical processing steps to several hundreds. These trends are expected to continue for the next several decades. The .13 micron technology is around the corner, as well as 300mm wafers. The increase in IC functionality has come with a skyrocketing capital spending (more than $2 billion per fabrication facility). Moreover, the product life cycles for leading edge IC's have become very short (less than 2 years).
Conversational natural language understanding interfacing city event information
Authors: Marion Mast, Thomas Ross, Henrik Schulz, Heli Harrikari, Vasiliki Demesticha, Lazaros Polymenakos, Yannis Vamvakoulas, Jan Stadermann
Venue: Data Knowledge Engineering (2002)

The article describes aspects of the development of a conversational natural language understanding (NLU) system done during the first year of the European research project CATCH-2004 (Converse in AThens Cologne and Helsinki) [http://www.catch2004.org]. The project is co-funded by the European Union in the scope of the IST programme (IST 1999-11103).Its objectives focus on multi-modal, multi-lingual conversational natural language access to information systems. The paper emphasises on architecture, and telephony-based speech and NLU components as well as aspects of the implementation of a city event information (CEI) system in English, Finnish, German and Greek. The CEI system accesses two different databases in Athens and Helsinki using a common retrieval interface. Furthermore the paper singles out methodologies involved for acoustic and language model of the speech recognition component, parsing techniques and dialog modelling for the conversational natural language subsystem. For the implementation it outlines an incremental system refinement methodology necessary to adapt the system components to real-life data. It addresses the implementation of language specific characteristics and a common dialog design for all four languages, but also deals with aspects towards a multilingual conversational system. Finally, it presents prospects for further developments of the project.
Porting Multimedia Applications to the Open System Environment
Authors: Richard D. Schneeman
Venue: IEEE Software (1992)

To migrate DOS-based courseware to the Open System Environment (OSE), process creation and communication in Posix, a portable operating-system interface, were merged with a multilevel client-server architecture. This helped identify some problems that developers are likely to face when considering any operating-system or platform migration to the OSE. The OSE reference model is reviewed, and the proposed multilevel client-server software architecture developed to fully embody the DOS model in a distributed, portable OSE is outlined. The hardware and software of the interactive video delivery system used in the OSE are described.
Efficient Online and Offline Testing of Embedded DRAMs
Authors: Sybille Hellebrand, Hans-Joachim Wunderlich, Alexander A. Ivaniuk, Yuri V. Klimets, Vyacheslav N. Yarmolik
Venue: IEEE Transactions on Computers (2002)

This paper presents an integrated approach for both built-in online and offline testing of embedded DRAMs. It is based on a new technique for output data compression which offers the same benefits as signature analysis during offline test, but also supports efficient online consistency checking. The initial fault-free memory contents are compressed to a reference characteristic and compared to test characteristics periodically. The reference characteristic depends on the memory contents, but unlike similar characteristics based on signature analysis, it can be easily updated concurrently with WRITE operations. This way, changes in memory do not require a time consuming recomputation. The respective test characteristics can be efficiently computed during the periodic refresh operations of the dynamic RAM. Experiments show that the proposed technique significantly reduces the time between the occurrence of an error and its detection (error detection latency). Compared to error detecting codes (EDC) it also achieves a significantly higher error coverage at lower hardware costs. Therefore, it perfectly complements standard online checking approaches relying on EDC, where the concurrent detection of certain types of errors is guaranteed, but only during READ operations accessing the erroneous data.
MCSE Exam Notes: Core Requirements
Authors: Sybex Inc.
Venue:  (1998)

:Save $15! This box set contains the MCSE Exam Notes for the Networking Essentials, NT Workstation 4, NT Server 4, and NT Server 4 in the Enterprise exams--plus a CD containing the Network Press custom test-preparation program. Review your knowledge objective-by-objective with the Exam Notes books, then test yourself with the CD to make sure you're ready for the exams. |
Compiler Support for Object-Oriented Real-Time Software
Authors: Prabha Gopinath, Thomas Bihari, Rajiv Gupta
Venue: IEEE Software (1992)

The suitability of compile-time code analysis and rearrangement to improve the predictability of object-oriented software in dynamic real-time environments is discussed. The techniques combine the abstraction of object-oriented software design with the power of static, compiler-based code analysis to develop and enhance the predictability of real-time software. They also counteract the effects of unpredictable delays caused by the arrival, servicing, and execution of dynamic tasks, and give the application latitude to react to delays caused by hardware, external events, and the loading of communication media.
Quantum Comparison Machines with One-Sided Error
Authors: Chiu Fan Lee, Neil F. Johnson
Venue: Quantum Information Processing (2002)

It is always possible to decide, with one-sided error, whether two quantum states are the same under a specific unitary transformation. However we show here that it is impossible to do so if the transformation is anti-linear and non-singular. This result implies that unitary and anti-unitary operations exist on an unequal footing in quantum information theory.PACS: 03.67.-a
Using Expert Systems to Construct Formal Specifications
Authors: Mark R. Blackburn
Venue: IEEE Expert: Intelligent Systems and Their Applications (1989)

A project is described that is intended to formalize the software requirement specification process by defining a specification model that characterizes the generic properties of a specification. An approach is presented in which the expert system that assists in specifying requirements is integrated with a transformational system that can synthesize programs from such specifications. The specification model provides the basis for such an expert system. An example illustrates the system's functionally.
Deterministic test pattern generation techniques for sequential circuits
Authors: Ilker Hamzaoglu, Janak H. Patel
Venue: Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design (2000)

This paper presents new test generation techniques for improving the average-case performance of the iterative logic array based deterministic sequential circuit test generation algorithms. To be able to assess the effectiveness of the proposed techniques, we have developed a new ATPG system for sequential circuits, called ATOMS, and we have incorporated these techniques into the test generator. ATOMS achieved very high fault coverages in a short amount of time for the ISCAS89 sequential benchmark circuits, demonstrating the effectiveness of these techniques on the test generation performance.
An early cipher device: Fredrik gripenstierna's machine
Authors: Bengt Beckman
Venue: Cryptologia (2002)

This article presents a description and analysis of the early Swedish cipher device of Fredrik Gripenstierna.
Integrating Vision Modules: Stereo, Shading, Grouping, and Line Labeling
Authors: Sharath Pankanti, Anil K. Jain
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

It is generally agreed that individual visual cues are fallible and often ambiguous. This has generated a lot of interest in design of integrated vision systems which are expected to give a reliable performance in practical situations. The design of such systems is challenging since each vision module works under a different and possibly conflicting set of assumptions. We have proposed and implemented a multiresolution system which integrates perceptual organization (grouping), segmentation, stereo, shape from shading, and line labeling modules. We demonstrate the efficacy of our approach using images of several different realistic scenes. The output of the integrated system is shown to be insensitive to the constraints imposed by the individual modules. The numerical accuracy of the recovered depth is assessed in case of synthetically generated data. Finally, we have qualitatively evaluated our approach by reconstructing geons from the depth data obtained from the integrated system. These results indicate that integrated vision systems are likely to produce better reconstruction of the input scene than the individual modules.
Spatial Join Processing Using Corner Transformation
Authors: Ju-Won Song, Kyu-Young Whang, Young-Koo Lee, Min-Jae Lee, Sang-Wook Kim
Venue: IEEE Transactions on Knowledge and Data Engineering (1999)

Spatial join finds pairs of spatial objects having a specific spatial relationship in spatial database systems. Since spatial join is a fairly expensive operation, we need an efficient algorithm taking advantage of the characteristics of available spatial access methods. In this paper, we propose a spatial join algorithm using corner transformation and show its excellence through experiments. To the extent of authors' knowledge, the spatial join processing using corner transformation is new. In corner transformation, two regions in one file joined with two adjacent regions in the other file share a large common area. The proposed algorithm utilizes this property in order to reduce the number of disk accesses for spatial join. Experimental results show that the performance of the algorithm is generally better than that of the R*-tree based algorithm proposed by Brinkhoff et al. This is a strong indication that corner transformation is a promising category of spatial access methods and that spatial operations can be performed better in the transform space than in the original space. This reverses the common belief that transformation will adversely effect the clustering. We also briefly mention that the join algorithm based on corner transformation has a nice property of being amenable to parallel processing. We believe that our result will provide a new insight towards transformation-based processing of spatial operations.
Pairwise Data Clustering by Deterministic Annealing
Authors: Thomas Hofmann, Joachim M. Buhmann
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1997)

Partitioning a data set and extracting hidden structure from the data arises in different application areas of pattern recognition, speech and image processing. Pairwise data clustering is a combinatorial optimization method for data grouping which extracts hidden structure from proximity data. We describe a deterministic annealing approach to pairwise clustering which shares the robustness properties of maximum entropy inference. The resulting Gibbs probability distributions are estimated by mean-field approximation. A new structure-preserving algorithm to cluster dissimilarity data and to simultaneously embed these data in a Euclidian vector space is discussed which can be used for dimensionality reduction and data visualization. The suggested embedding algorithm which outperforms conventional approaches has been implemented to analyze dissimilarity data from protein analysis and from linguistics. The algorithm for pairwise data clustering is used to segment textured images.
Verifying Compliance with Commitment Protocols
Authors: Mahadevan Venkatraman, Munindar P. Singh
Venue: Autonomous Agents and Multi-Agent Systems (1999)

Interaction protocols are specific, often standard, constraints on the behaviors of autonomous agents in a multiagent system. Protocols are essential to the functioning of open systems, such as those that arise in most interesting web applications. A variety of common protocols in negotiation and electronic commerce are best treated as commitment protocols, which are defined, or at least analyzed, in terms of the creation, satisfaction, or manipulation of the commitments among the participating agents.When protocols are employed in open environments, such as the Internet, they must be executed by agents that behave more or less autonomously and whose internal designs are not known. In such settings, therefore, there is a risk that the participating agents may fail to comply with the given protocol. Without a rigorous means to verify compliance, the very idea of protocols for interoperation is subverted. We develop an approach for testing whether the behavior of an agent complies with a commitment protocol. Our approach requires the specification of commitment protocols in temporal logic, and involves a novel way of synthesizing and applying ideas from distributed computing and logics of program.
Best-Case Results for Nearest-Neighbor Learning
Authors: Steven Salzberg, Arthur L. Delcher, David Heath, Simon Kasif
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1995)

In this paper we propose a theoretical model for analysis of classification methods, in which the teacher knows the classification algorithm and chooses examples in the best way possible. We apply this model using the nearest-neighbor learning algorithm, and develop upper and lower bounds on sample complexity for several different concept classes. For some concept classes, the sample complexity turns out to be exponential even using this best-case model, which implies that the concept class is inherently difficult for the NN algorithm. We identify several geometric properties that make learning certain concepts relatively easy. Finally we discuss the relation of our work to helpful teacher models, its application to decision tree learning algorithms, and some of its implications for current experimental work.
The Adjoint Newton Algorithm for Large-Scale Unconstrained Optimization in Meteorology Applications
Authors: Zhi Wang, K. Droegemeier, L. White
Venue: Computational Optimization and Applications (1998)

A new algorithm is presented for carrying out large-scale unconstrained optimization required in variational data assimilation using the Newton method. The algorithm is referred to as the adjoint Newton algorithm. The adjoint Newton algorithm is based on the first- and second-order adjoint techniques allowing us to obtain the Newton line search direction by integrating a tangent linear equations model backwards in time (starting from a final condition with negative time steps). The error present in approximating the Hessian (the matrix of second-order derivatives) of the cost function with respect to the control variables in the quasi-Newton type algorithm is thus completely eliminated, while the storage problem related to the Hessian no longer exists since the explicit Hessian is not required in this algorithm. The adjoint Newton algorithm is applied to three one-dimensional models and to a two-dimensional limited-area shallow water equations model with both model generated and First Global Geophysical Experiment data. We compare the performance of the adjoint Newton algorithm with that of truncated Newton, adjoint truncated Newton, and LBFGS methods. Our numerical tests indicate that the adjoint Newton algorithm is very efficient and could find the minima within three or four iterations for problems tested here. In the case of the two-dimensional shallow water equations model, the adjoint Newton algorithm improves upon the efficiencies of the truncated Newton and LBFGS methods by a factor of at least 14 in terms of the CPU time required to satisfy the same convergence criterion.The Newton, truncated Newton and LBFGS methods are general purpose unconstrained minimization methods. The adjoint Newton algorithm is only useful for optimal control problems where the model equations serve as strong constraints and their corresponding tangent linear model may be integrated backwards in time. When the backwards integration of the tangent linear model is ill-posed in the sense of Hadamard, the adjoint Newton algorithm may not work. Thus, the adjoint Newton algorithm must be used with some caution. A possible solution to avoid the current weakness of the adjoint Newton algorithm is proposed.
Using Process History to Predict Software Quality
Authors: Taghi M. Khoshgoftaar, Edward B. Allen, Robert Halstead, Gary P. Trio, Ronald M. Flass
Venue: Computer (1998)

Mission-critical systems must use reliable software. However, assuring software reliability often entails costly and time-consuming development processes. Software quality models can mitigate these costs by predicting module reliability early on, which lets developers focus improvement efforts on modules that require the most attention. Many software quality models use only product metrics such as lines of code or McCabe cyclomatic complexity. This product focus assumes that all modules have a similar process history. For systems that evolve, this assumption is not valid. Modules with similar product measurements may have different quality because of different development histories. For example, a reused module with many changes is likely to have more faults than a similar module with few changes. The authors have developed a quality model based solely on process-history variables. Their study posits that a module's history prior to integration can help predict the likelihood of fault discovery during integration and test. Such module reliability predictions can be used to focus review, integration, and testing resources on high-risk areas of a system. They report their findings in a case study involving the Joint Surveillance Target Attack Radar System, an embedded, real-time military system developed by Northrop Grumman for the US Air Force in support of the US Army.
Call for Papers for Special Issue on Online Analysis and Querying of Continuous Data Streams
Venue: IEEE Transactions on Knowledge and Data Engineering (2001)

No abstract available.
Elastically Adaptive Deformable Models
Authors: Dimitris N. Metaxas, Ioannis A. Kakadiaris
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

We present a novel technique for the automatic adaptation of a deformable model's elastic parameters within a Kalman filter framework for shape estimation applications. The novelty of the technique is that the model's elastic parameters are not constant, but spatio-temporally varying. The variation of the elastic parameters depends on the distance of the model from the data and the rate of change of this distance. Each pass of the algorithm uses physics-based modeling techniques to iteratively adjust both the geometric and the elastic degrees of freedom of the model in response to forces that are computed from the discrepancy between the model and the data. By augmenting the state equations of an extended Kalman filter to incorporate these additional variables, we are able to significantly improve the quality of the shape estimation. Therefore, the model's elastic parameters are always initialized to the same value and they are subsequently modified depending on the data and the noise distribution. We present results demonstrating the effectiveness of our method for both two-dimensional and three-dimensional data.