ppxscal/embedding_network huggingface dataset:
Exploring Memory Hierarchy with ArchC
Authors: Pablo Viana, Edna Barros, Sandro Rigo, Rodolfo Azevedo, Guido Araújo
Venue: Proceedings of the 15th Symposium on Computer Architecture and High Performance Computing (2003)

This paper presents the cache configuration exploration of a programmable system, in order to find the best matching between the architecture and a given application. Here, programmable systems composed by processor and memories may be rapidly simulated making use of ArchC, an Architecture Description Language (ADL) based on SystemC. Initially designed to model processor architectures, ArchC was extended to support a more detailed description of the memory subsystem, allowing the design space exploration of the whole programmable system. As an example, it is shown an image processing application, running on a SPARC-V8 processor-based architecture, which had its memory organization adjusted to minimize cache misses.
Probabilistic diagnostics with P-graphs
Authors: Balázs Polgár, Endre Selényi
Venue: Acta Cybernetica (2003)

This paper presents a novel approach for solving the probabilistic diagnosis problem in multiprocessor systems. The main idea of the algorithm is based on the reformulation of the diagnostic procedure as a P-graph model. The same, well-elaborated mathematical paxadigm--originally used to model material flow--can be applied in our approach to model information flow. This idea is illustrated by deriving a maximum likelihood diagnostic decision procedure. The diagnostic accuracy of the solution is considered on the basis of simulation measurements, and a method of constructing a general framework for different aspects of a complex problem is demonstrated with the use of P-graph models.
Design Fragility
Authors: Bob Colwell
Venue: Computer (2004)

Tying conceptually separate functions together increases overall complexity and thus has a real price.
Network protocols: correcting transmission errors of up to two bits
Authors: Sei-Jong Chung
Venue: ACM SIGCSE Bulletin (2003)

While the construction of Hamming Codes that can detect and correct 1-bit transmission errors has been illustrated [1], Hamming Codes that will detect and correct transmission errors of more than 1 bit remain yet to be constructed. In this paper, how to build Group Codes that can correct transmission errors of up to 2 bits will be shown. Note that transmission control protocols such as TCP/IP rely upon the notion of checksums", a variation of Hamming Codes, for their transmission error correction. The ease and efficiency with which the group codes can be built will then be compared to those of Hamming Codes and Cyclic Redundancy Checking, the transmission error detection/correction schemes discussed in [1].
An approximate analytical approach to resampling averages
Authors: Dörthe Malzahn, Manfred Opper
Venue: The Journal of Machine Learning Research (2003)

Using a novel reformulation, we develop a framework to compute approximate resampling data averages analytically. The method avoids multiple retraining of statistical models on the samples. Our approach uses a combination of the replica "trick" of statistical physics and the TAP approach for approximate Bayesian inference. We demonstrate our approach on regression with Gaussian processes. A comparison with averages obtained by Monte-Carlo sampling shows that our method achieves good accuracy.
Towards the Verification and Validation of Online Learning Systems: General Framework and Applications
Authors: Ali Mili, GuangJie Jiang, Bojan Cukic, Yan Liu, Rahma Ben Ayed
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

Online Adaptive Systems cannot be certi.ed using traditional testing and proving methods, because these methods rely on assumptions that do not hold for such systems. In this paper we discuss a framework for reasoning about online adaptive systems, and see how this framework can be used to perform the verification of these systems. In addition to the framework, we present some preliminary results on concrete neural network models.
Using a Bayesian Approach to Quantify Scale Compatibility Bias
Authors: Richard M. Anderson, Benjamin F. Hobbs
Venue: Management Science (2002)

This paper proposes a new analytical framework to quantify and correct for scale compatibility bias in the assessment of trade-off weights in multiattribute value analysis. The procedure is demonstrated with an application to a fisheries management problem. Trade-off judgments are elicited from a group of fisheries experts with management responsibility in the Lake Erie basin. Then we use a Bayesian method to compute posterior probability distributions of attribute weights. In computing the Bayesian weights, our measurement model assumes that the weight ratios produced by each respondent's judgments are subject to random error and an unknown scale compatibility bias. Ratios are log-transformed and analyzed by a Bayesian linear model with a noninformative prior distribution. Posterior distributions are then developed for the weights and the bias. We estimate the compatibility bias for each person and, in most cases, it is found to be large and in the predicted direction, suggesting the importance of its consideration in deriving trade-off weights. In addition, the Bayesian framework is shown to be useful for quantifying the value of additional information about multiattribute weights. Finally, a simple heuristic procedure for assessing the weights appears to be effective in eliminating the bias.
Software Cost Estimation through Conceptual Requirement
Authors: Yuan Zhao, Hee Beng Kuan Tan, Wei Zhang
Venue: Proceedings of the Third International Conference on Quality Software (2003)

Software cost estimation is vital for the effective controland management of the whole software developmentprocess. Currently, Constructive Cost Model (COCOMO II)is the most popular tool for estimating software cost. Ituses Lines of Code and Function Points to assess softwaresize. However, these are actually implementation detailsand difficult to estimate during the early stage of softwaredevelopment. The Entity Relationship (ER) model is wellused in conceptual modeling (requirements analysis) fordata-intensive systems. In this article, we explore the use ofER model for the estimation of software cost. A new term,Path Complexity, is proposed. Based on Path Complexityand other factors, we built a multiple regression model forsoftware cost estimation. The approach has been validatedstatistically through system data from the real industryprojects.
Nonlinear optical properties of one-dimensional organic molecular aggregates in nanometer films
Authors: R. V. Markov, A. I. Plekhanov, V. V. Shelkovnikov, J. Knoester
Venue: Microelectronic Engineering (2003)

Nanometer films of molecular J-aggregates of pseudoi socyanine (PIC) with various degrees of both static and dynamic disorder were prepared. The amount of static disorder was varied by modifying the local environment of the J-aggregates in the films, while the dynamic disorder was varied by changing the film temperature. Through these variations, the delocalization length Ndel of the excitons was controlled, as could be monitored from the width of the exciton absorption line. This has allowed us to establish the scaling of the nonlinear optical susceptibility per aggregate molecule, X(3)/N, with the delocalization length as X(3)/N ∝ Ngamma;del, with γ=2.32±0.2. This behavior turned out to be independent of the detailed nature of disorder, and agrees very well with the theoretically predicted size-enhancement of the cubic susceptibility in J-aggregates.
Sequential Design of Multiple Description Scalar Quantizers
Authors: Chao Tian, Sheila S. Hemami
Venue: Proceedings of the Conference on Data Compression (2004)

This paper introduces a new sequential design method for multiple descriptionscalar quantizers (MDSQ's) to generate two or more balanced descriptions. In thisdesign method, a multiple description system is divided into multiple stages, and them-th stage can be understood intuitively as minimizing the distortion of receiving anym of all the descriptions, while looking ahead to the next stage to reduce thedistortion if more descriptions are present. Entropy-constrained sequential MDSQ withtwo descriptions is shown to achieve the same asymptotic performance as entropy-constrainedMDSQ with uniform stepsize. Then this method is applied to the designof sequential MDSQ with three descriptions, for which two slightly different designsare given and compared with a three description system based on unequal loss protectionat high rate. The results suggest that if the quality of the decoded source withtwo or more descriptions (rather than a single description) is most important, generalmultiple description systems should be favored over unequal loss protection systems.However, if the quality of the decoded source with a single description is most important(in the case of, for example, high channel failure rates), the difference in theirperformances is not terribly large.
Career satisfaction for managerial and technical anchored IS personnel in later career stages
Authors: Maxwell K. Hsu, H. G. Chen, James J. Jiang, Gary Klein
Venue: ACM SIGMIS Database (2003)

Information system (IS) personnel have exhibit high incidence of technical and managerial anchors. It has been proposed that IS personnel with technical anchors have difficultly moving into a more advanced career stage that requires a greater emphasis on managerial skills (e.g., leadership) and activities. Using the data from a survey of IS professionals, we find that career satisfaction is positively and significantly correlated with career stage. Moreover, managerially anchored IS professionals are found to be more satisfied in the mentor stage than those who are technically anchored. However, no clear relationship between career anchors and career satisfaction was found in the sponsor stage. It appears that the combined effects of career anchor and stage is a more complex relation than previously thought in the literature. The results indicate that career programs discussed in the literature may need to be adjusted to accommodate advancement for those with a technical career anchor.
ThreadMentor: a pedagogical tool for multithreaded programming
Authors: Steve Carr, Jean Mayo, Ching-Kuang Shene
Venue: Journal on Educational Resources in Computing (JERIC) (2003)

ThreadMentor is a multiplatform pedagogical tool designed to ease the difficulty in teaching and learning multithreaded programming. It consists of a C++ class library and a visualization system. The class library supports many thread management functions and synchronization primitives in an object-oriented way, and the visualization system is activated automatically by a user program and shows the inner working of every thread and every synchronization primitive on-the-fly. Events can also be saved for playback. In this way, students will be able to visualize the dynamic behavior of a threaded program and the interaction among threads and synchronization primitives.
Query, analysis, and visualization of multidimensional databases
Authors: Pat Hanrahan
Venue:  (2003)

In recent years, large multidimensional databases, or data warehouses, have become common in a variety of commercial and scientific applications. It is not unusual for these data warehouses to contain billions of tuples, each categorized by tens or hundreds of dimensions. A major challenge with these databases is to extract meaning from the important data they contain: to discover structure, find patterns, and derive causal relationships. A promising technique for the analysis of these multidimensional databases is visualization. To make visualization effective in this context, we need to develop tools that tightly integrate visual presentation and database queries, support interactive refinement of the display, and can visually present a large number of tuples and dimensions. This dissertation introduces a formal approach to building visualization systems that addresses these demands. The foundation of the dissertation is the Polaris formalism, a language for precisely describing a wide range of table-based graphical presentations of relational information. A key aspect of this formal language is the ability to compile visual specifications automatically into the precise queries and drawing commands necessary to generate the display. This ability enables us to design systems that closely integrate analysis and visualization. Using the Polaris formalism, we have built two interactive systems: the Polaris interface and a framework for multiscale visualization. The Polaris interface for the exploration of multidimensional databases extends the popular Pivot Table interface to generate a rich, expressive set of graphic displays. The Polaris interface is simple and expressive because it is built upon the Polaxis formalism. Analysts can incrementally construct complex queries, receiving visual feedback as they assemble and alter the query. The Polaris interface is a generally applicable tool that tightly integrates analysis with visualization. This dissertation also demonstrates how to use the Polaris formalism and data cubes to specify and implement domain specific multiscale (pan-and-zoom) visualizations efficiently. The presented approach to multiscale visualization addresses several limitations in the current approaches by introducing multiple zoom paths into the data and providing general mechanisms
GENVIEW: a portable source-level debugger for macrocell generators
Authors: A. Compan, A. Greiner, F. Pêcheux, F. Pétrot
Venue: Proceedings of the conference on European design automation (1991)

An effective layout design method for VLSI macrocell is presented in this paper. The method describes a way to write, to test and to validate efficient Full-Custom generators and tilers. First, after a brief overview of the design methodology of tilers, the GENLIB C-library of procedural design functions is described. Second, GENVIEW, a portable and graphic layout debugger for the interactive testing of generators, is detailed.
Generation-heavy hybrid machine translation
Authors: Nizar Yahya Habash
Venue:  (2003)

The state of the art techniques in Machine Translation (MT) require large amounts of symmetric resources from source and target languages. This is true regardless of whether the approach is Transfer or Interlingua, Symbolic or Statistical. Symmetry within these approaches is necessary to ensure quality, robustness and retargetability. In reality, such symmetry, whether it is in terms of structural transfer lexicons, interlingual dictionaries or parallel corpora, is a major bottleneck in developing any MT system. This dissertation presents an approach to MT that addresses the lack of symmetry by exploiting symbolic and statistical target language resources in source-poor/target-rich language pairs. This approach is called Generation-Heavy Hybrid Machine Translation (GHMT). Expected source language resources include a syntactic parser and a simple one-to-many translation dictionary. No transfer rules or complex interlingual representations are used. Rich target language symbolic resources are used to overgenerate multiple structural variations from a target-glossed syntactic dependency representation of source language sentences. Statistical target-language resource are then used to select amongst the overgenerated translations. The source-target asymmetry of systems developed in this approach makes them more easily retargetable to new source languages. The contributions of this research include: (1) a new model for machine translation that transcends the need for large amounts of symmetric knowledge while maintaining a high degree of robustness, quality, and retargetability; (2) a systematic framework for handling translation divergences that uniformly accommodates a wide range of seemingly different divergence types and their interactions; (3) a hybrid (symbolic-statistical) generation approach that expands the concept of symbolic overgeneration to include conflation and head-swapping of structural variations; (4) the introduction and use of structural n-grams on a large scale in natural language generation; and (5) the creation of several resources that have been used by other researchers including an extensible MT system for translating into English and a large-scale categorical variation database for English. An extensive evaluation suggests that GHMT is more robust and has superior output quality, in terms of grammaticality and accuracy, relative to a primarily statistical approach.
No more mind games
Authors: Shirt Trax
Venue: Organised Sound (2001)

The Spring sunshine makes the blind a perfect glowing square, clearly much later than the twenty-three minute duration of the live recording I set in motion, as I lay on my friend's bed alone, drunk on vodka and tonic and giddy with big city kicks after the very . . . Manhattan evening I was taken on. It was dark, I was too full of it to take the subway back to Brooklyn, I remember the cab ride over the bridge, no dog to greet me as I unlocked the heavy steel door. I was laughing at Alan Vega complaining about not being allowed to smoke, there was booing . . . &lsquo;Frankie Teardrop&rsquo; had been glitching over Brussels for hours.
Sustaining And Extending Organization Strategy via Information Technology Governance
Authors: Sheila K. McGinnis, Lela "Kitty" Pumphrey, Kenneth Trimmer, Carla Wiggins
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 6 - Volume 6 (2004)

This paper summarizes commonly accepted theories of corporate governance and extends them to information technology governance in United States (US) hospitals. It goes on to argue that currently accepted theories of governance may not apply in rural US hospital settings. Rather, this work posits that governance is a pattern of social relations integrating organizational activities. This position is supported in the adjoining case study1 examining a small, rural US hospital's use of coordination and collaboration to integrate IT activities and to align IT strategy and functions with corporate strategy. Thus, contrary to the dominant paradigms of hierarchy, power, and resource based governance, coordination can provide an effective mechanism for information technology governance.
Embedded Hardware Face Detection
Authors: T. Theocharides, G. Link, N. Vijaykrishnan, M. J. Irwin, W. Wolf
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

Face detection is the first step towards face recognition and is a vital task in surveillance and security applications. Current software implementations of face detection algorithms lack the computational ability to support detection in real time video streams. Consequently, this work focuses on the design of special-purpose hardware for performing rotation invariant face detection. The synthesized design using 160nm technology is found to operate at 409.5 kHz providing a throughput of 424 frames per second and consumes 7 Watts of power. The synthesized design provided 75% accuracy in detecting faces from a set of 55 images that is competitive with existing software implementations that provide around 80-85% accuracy.
Simulation in city planning and engineering
Authors: B. Sadoun
Venue: Applied system simulation: methodologies and applications (2003)

Simulation and modeling are important tools that can aid the city and regional planner and engineer to predict the performance of certain designs and plans. They also can help to optimize the designs, and operations of urban systems including transportation systems, energy-conserving site designs, environmental protection systems, telecommunications systems, pollution control schemes, toll automation schemes in highways, tunnels and bridges, among others. Modeling and simulation have benefited greatly from the recent advances in high performance computing and computers as they are becoming cost-effective tools for the design, analysis, and optimum operation and tuning of urban systems. This chapter provides an overview of the basics and main applications of simulation and modeling to city and regional planning and engineering.
Minimal and maximal exposure path algorithms for wireless embedded sensor networks
Authors: Giacomino Veltri, Qingfeng Huang, Gang Qu, Miodrag Potkonjak
Venue: Proceedings of the 1st international conference on Embedded networked sensor systems (2003)

Sensor networks not only have the potential to change the way we use, interact with, and view computers, but also the way we use, interact with, and view the world around us. In order to maximize the effectiveness of sensor networks, one has to identify, examine, understand, and provide solutions for the fundamental problems related to wireless embedded sensor networks. We believe that one of such problems is to determine how well the sensor network monitors the instrumented area. These problems are usually classified as coverage problems. There already exist several methods that have been proposed to evaluate a sensor network's coverage.We start from one of such method and provide a new approach to complement it. The method of using the minimal exposure path to quantify coverage has been optimally solved using a numerical approximation approach. The minimal exposure path can be thought of as the worst-case coverage of a sensor network. Our first goal is to develop an efficient localized algorithm that enables a sensor network to determine its minimal exposure path. The theoretical highlight of this paper is the closed-form solution for minimal exposure in the presence of a single sensor. This solution is the basis for the new and significantly faster localized approximation algorithm that reduces the theoretical complexity of the previous algorithm. On the other hand, we introduce a new coverage problem - the maximal exposure path - which is in a sense the best-case coverage path for a sensor network. We prove that the maximal exposure path problem is NP-hard, and thus, we provide heuristics to generate approximate solutions.In addition, we demonstrate the effectiveness of our algorithms through several simulations. In the case of the minimal single-source minimal exposure path, we use variational calculus to determine exact solutions. For the case of maximal exposure, we use networks with varying numbers of sensors and exposure models.
The Asymptotic Proportion of Subdivisions of a 2&times;2 Table that Result in Simpson's Paradox
Authors: Petros Hadjicostas
Venue: Combinatorics, Probability and Computing (1998)

A 2&times;2 table of nonnegative integers is subdivided additively into n 2&times;2 subtables of nonnegative integers in an arbitrary way. The first case of Simpson's Paradox (SP) occurs when the determinant of the original table is less than zero, but the determinant of each of the n 2&times;2 subtables is greater than or equal to zero. The second case of SP occurs when the previous inequalities hold with &lsquo;less than&rsquo; and &lsquo;greater than or equal&rsquo; replaced by &lsquo;greater than&rsquo; and &lsquo;less than or equal&rsquo;, respectively. For the case n=2, this paper calculates the asymptotic proportion of the subdivisions of the original 2&times;2 table such that SP occurs. It is shown that this asymptotic proportion is bounded above by 1&#x002F;12.