ppxscal/embedding_network huggingface dataset:
Using the Lens of Max Weber's Theory of Bureaucracy to Examine E-Government Research
Authors: Aby Jain
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 5 - Volume 5 (2004)

Kurt Lewin famously proclaimed, "There is nothing so practical as good theory", signifying that a good theory lends itself to being applied in a variety of contexts. This paper uses the lens of Max Weber's theory of bureaucracy to examine contemporary E-Government related research and literature. Two major, prevailing themes emerge from this exercise. The first theme that emerges is that IT (information technology) is a tool for reforming' bureaucracy. The second, somewhat contradictory, theme is that E-Government failure may be explained as a consequence of bureaucracy. Each of these themes is discussed in detail. These themes are also explored via case studies.The paper concludes that current E-Government research does not offer adequate clarity on the issue of how E-Government and bureaucracy impact each other in reciprocal ways; and calls for future research into these issues.
Optimality of universal Bayesian sequence prediction for general loss and alphabet
Authors: Marcus Hutter
Venue: The Journal of Machine Learning Research (2003)

Various optimality properties of universal sequence predictors based on Bayes-mixtures in general, and Solomonoff's prediction scheme in particular, will be studied.The probability of observing xt at time t, given past observations x1...xt-1 can be computed with the chain rule if the true generating distribution &mu; of the sequences x1x2x3.... is known. If &mu; is unknown, but known to belong to a countable or continuous class &Mu; one can base ones prediction on the Bayes-mixture &xi; defined as a w&nu;-weighted sum or integral of distributions &nu; &isin; &Mu;. The cumulative expected loss of the Bayes-optimal universal prediction scheme based on &xi; is shown to be close to the loss of the Bayes-optimal, but infeasible prediction scheme based on &mu;. We show that the bounds are tight and that no other predictor can lead to significantly smaller bounds.Furthermore, for various performance measures, we show Pareto-optimality of &xi; and give an Occam's razor argument that the choice w&nu; &sim 2-K(&nu;) for the weights is optimal, where K(&nu;) is the length of the shortest program describing &nu;.The results are applied to games of chance, defined as a sequence of bets, observations, and rewards.The prediction schemes (and bounds) are compared to the popular predictors based on expert advice.Extensions to infinite alphabets, partial, delayed and probabilistic prediction, classification, and more active systems are briefly discussed.
Evaluating message understanding systems: an analysis of the third message understanding conference (MUC-3)
Authors: Nancy Chinchor, David D. Lewis, Lynette Hirschman
Venue: Computational Linguistics (1993)

This paper describes and analyzes the results of the Third Message Understanding Conference (MUC-3). It reviews the purpose, history, and methodology of the conference, summarizes the participating systems, discusses issues of measuring system effectiveness, describes the linguistic phenomena tests, and provides a critical look at the evaluation in terms of the lessons learned. One of the common problems with evaluations is that the statistical significance of the results is unknown. In the discussion of system performance, the statistical significance of the evaluation results is reported and the use of approximate randomization to calculate the statistical significance of the results of MUC-3 is described.
Characteristics of WAP traffic
Authors: Irene C. Y. Ma, James Irvine
Venue: Wireless Networks (2004)

This paper considers the characteristics of Wireless Application Protocol (WAP) traffic. We start by constructing a WAP traffic model by analysing the behaviour of users accessing public WAP sites via a monitoring system. A wide range of different traffic scenarios were considered, but most of these scenarios resolve to one of two basic types. The paper then uses this traffic model to consider the effects of large quantities of WAP traffic on the core network. One traffic characteristic which is of particular interest in network dimensioning is the degree of self-similarity, so the paper looks at the characteristics of aggregated traffic with WAP, Web and packet speech components to estimate its self-similarity. The results indicate that, while WAP traffic alone does not exhibit a significant degree of self-similarity, a combined load from various traffic sources retains almost the same degree of self-similarity as the most self-similar individual source.
Quadratic filters for automatic pattern recognition
Authors: Robert Raymond Muise
Venue:  (2003)

Composite correlation filtering is a discipline concerned with the detection and recognition of patterns in signals. Considering image data, composite correlation filtering involves many mathematical and engineering disciplines. Starting with the original spatial matched filter from the image processing discipline, applying the techniques of filter design from digital signal processing, with objective functions from statistical pattern recognition, the research into composite correlation filtering for pattern detection and classification has made significant progress. For the most part, research in this discipline has been relegated to linear filters. Research highlighted in this dissertation involves presenting the mathematical model for a quadratic composite correlation filter, deriving several distinct methods of designing the parameters of the quadratic filter, and analyzing the performance of the derived filters as compared to the linear counterparts. Some of the mathematical and statistical properties of these new quadratic filters are derived and efficient methodologies for implementing these filters on a digital computer are discussed. A case study on real-world Synthetic Aperture Radar Imagery is presented to compare the performance and properties of the different quadratic filter design methodologies.
The taming of the pointer
Authors: Piotr Dembinski, Richard Schwartz
Venue: ACM SIGPLAN Notices (1977)

The existence of pointers in a higher-level programming language has been considered by many as a serious, if not insurmountable, impediment to software reliability. This paper seeks to show that most of the problems created by the use of the pointer are due to an implementation level pointer definition. A new approach is proposed which treats the pointer type in a way consistent with other data types. An example is given of how formal program verification methods can be applied to programs manipulating structures created with pointers if the introduced definition is used. A discussion is given of some implications of the adopted concepts and how they are related to the question of data representation and such notions as data abstraction.
Analyzing Large Spreadsheet Programs
Authors: Markus Clermont
Venue: Proceedings of the 10th Working Conference on Reverse Engineering (2003)

Although the results of spreadsheet programs are thebase for very important decisions and are subject to manychanges, they are only poorly documented. In this paperwe introduce an approach that extents previous work in thearea of spreadsheet visualization. It enables the maintainerto decompose large spreadsheets into self contained parts,that are similar to modules in conventional software. Ofcourse there are important differences, as these modules areonly recognized during analysis, and users are not forced tobuild modular spreadsheets. This is very important, as weaim not to change the spreadsheet users. It has turned out,that attempts to change the users are usually doomed to fail.This approach can be considered orthogonal to semanticclasses, that have been introduced in prior work.The generated abstraction is not build upon the formula-contentsof the spreadsheet, but on properties of the dataflow graph. Therefore, spreadsheets with irregular formulascan be solely analyzed with the new approach.On the other hand, large spreadsheets can be decomposedinto data modules at first, that are smaller and easierto understand. Each of the data modules can than beanalyszed with a formula based approach.
A note on the bounded fragmentation property and its applications in network reliability
Authors: Mohammad Taghi Hajiaghayi, Mahdi Hajiaghayi
Venue: European Journal of Combinatorics (2003)

In this paper, we introduce a new property for graphs called bounded fragmentation, by which we mean after removing any set of at most k vertices the number of connected components is bounded only by a function of k. We demonstrate how bounded fragmentation can be used to measure the reliability of a network and introduce several classes of bounded fragmentation graphs. Finally, we pose some open problems related to this concept.
Determining Granularity of Independent Tasks for Reengineering a Legacy System into an OO System
Authors: Richard Millham, Martin Ward, Hongji Yang
Venue: Proceedings of the 27th Annual International Conference on Computer Software and Applications (2003)

Reengineering a COBOL legacy system is a difficultmulti-step process, particularly when the COBOL legacy systemis a sequential procedural-driven system which is beingreengineered into an object oriented, event-driven system. Inthis scenario, it is necessary to analyse the legacy system inorder to identify which tasks can be executed independently andwhich tasks must be executed sequentially. The focus ofreengineering is too often based on theory rather than based onexperience gained from real-world examples. This paper hopesto address this imbalance by providing a practical applicationof reengineering to an actual legacy telecommunications system.
Non-commutative logic II: sequent calculus and phase semantics
Authors: Paul Ruet
Venue: Mathematical Structures in Computer Science (2000)

Non-commutative logic, which is a unification of commutative linear logic and cyclic linear logic, is extended to all linear connectives: additives, exponentials and constants. We give two equivalent versions of the sequent calculus (directly with the structure of order varieties, and with their presentations as partial orders), phase semantics and a cut-elimination theorem. This involves, in particular, the study of the entropy relation between partial orders, and the introduction of a special class of order varieties: the series&ndash;parallel order varieties.
Human-robot interface based on the mutual assistance between speech and vision
Authors: Mitsutoshi Yoshizaki, Yoshinori Kuno, Akio Nakamura
Venue: Proceedings of the 2001 workshop on Perceptive user interfaces (2001)

This paper presents a user interface for a service robot that can bring the objects asked by the user. Speech-based interface is appropriate for this application. However, it alone is not sufficient. The system needs a vision-based interface to recognize gestures as well. Moreover, it needs vision capabilities to obtain the real world information about the objects mentioned in the user's speech. For example, the robot needs to find the target object ordered by speech to carry out the task. This can be considered that vision assists speech. However, vision sometimes fails to detect the objects. Moreover, there are objects for which vision cannot be expected to work well. In these cases, the robot tells the current status to the user so that he/she can give advice by speech to the robot. This can be considered that speech assists vision through the user. This paper presents how the mutual assistance between speech and vision works and demonstrates promising results through experiments.
Walks confined in a quadrant are not always D-finite
Authors: Mireille Bousquet-Mélou, Marko Petkovšek
Venue: Theoretical Computer Science (2003)

We consider planar lattice walks that start from a prescribed position, take their steps in a given finite subset of Z2, and always stay in the quadrant x ≥ 0, y ≥ 0. We first give a criterion which guarantees that the length generating function of these walks is D-finite, that is, satisfies a linear differential equation with polynomial coefficients. This criterion applies, among others, to the ordinary square lattice walks. Then, we prove that walks that start from (1,1), take their steps in {(2,-1), (-1, 2)} and stay in the first quadrant have a non-D-finite generating function. Our proof relies on a functional equation satisfied by this generating function, and on elementary complex analysis.
An automatic sign recognition and translation system
Authors: Jie Yang, Jiang Gao, Ying Zhang, Xilin Chen, Alex Waibel
Venue: Proceedings of the 2001 workshop on Perceptive user interfaces (2001)

A sign is something that suggests the presence of a fact, condition, or quality. Signs are everywhere in our lives. They make our lives easier when we are familiar with them. But sometimes they pose problems. For example, a tourist might not be able to understand signs in a foreign country. This paper discusses problems of automatic sign recognition and translation. We present a system capable of capturing images, detecting and recognizing signs, and translating them into a target language. We describe methods for automatic sign extraction and translation. We use a user-centered approach in system development. The approach takes advantage of human intelligence if needed and leverage human capabilities. We are currently working on Chinese sign translation. We have developed a prototype system that can recognize Chinese sign input from a video camera that is a common gadget for a tourist, and translate the signs into English or voice stream. The sign translation, in conjunction with spoken language translation, can help international tourists to overcome language barriers. The technology can also help a visually handicapped person to increase environmental awareness.
The novice programmers' syndrome of design-by-keyword
Authors: David Ginat
Venue: ACM SIGCSE Bulletin (2003)

In the course of reading the description of a given assignment, it is natural that associations with design patterns directly tied to explicit keywords or phrases in the assignment text will evolve. However, explicit keywords may not always be the basis for the desired solution. Implicit cues may yield a better outcome. This paper presents a study of novice programmers who are misguided by explicit keyword associations. The study shows that students' tendency to "design-by-keyword" may sometime lead them to incorrect or inefficient programming solutions. The study displays student solutions to three CSI problems, each answered in three different ways. The first two ways reflect undesirable "design-by-keyword" outcomes, and the third way encloses the desired solution, which demonstrates the importance of looking for implicit cues.
Defect tracking and reliability modeling for a new product release
Authors: Shanker Sanyal, Ken Aida, Kostas Gaitanos, George Wowk, Sam Lahiri
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 1 (1992)

One of the indicators of success in the area of delivering quality software is the number of defects reported by the customer following product ship. Consequently, this necessitates a process for tracking defects in the development and testing phases. The consequent to defect arrival patterns can then be used to provide flags requiring changes in the development process, and to project the likely number of customer reported problems once the product goes out of the door.This report describes the methods used for tracking defects and for using reliability growth models to project the number of customer reported defects for a new product release. The methods used for extracting, depicting, analyzing, and modeling defect data are described in detail.Defects were tracked using the Configuration Management Version Control tool (CMVC), with the defect data extracted on a weekly basis. The defect arrival rate was then used to project the number of expected customer reported defects using a reliability projection tool.
Estimating Degradation Model Parameters Using Neighborhood Pattern Distributions: An Optimization Approach
Authors: Tapas Kanungo, Qigong Zheng
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--Noise models are crucial for designing image restoration algorithms, generating synthetic training data, and predicting algorithm performance. There are two related but distinct estimation scenarios. The first is model calibration, where it is assumed that the input ideal bitmap and the output of the degradation process are both known. The second is the general estimation problem, where only the image from the output of the degradation process is given. While researchers have addressed the problem of calibration of models, issues with the general estimation problems have not been addressed in the literature. In this paper, we describe a parameter estimation algorithm for a morphological, binary, page-level image degradation model. The inputs to the estimation algorithm are 1) the degraded image and 2) information regarding the font type (italic, bold, serif, sans serif). We simulate degraded images using our model and search for the optimal parameter by looking for a parameter value for which the local neighborhood pattern distributions in the simulated image and the given degraded image are most similar. The parameter space is searched using a direct search optimization algorithm. We use the p{\hbox{-}}\rm value of the Kolmogorov-Smirnov test as the measure of similarity between the two neighborhood pattern distributions. We show results of our algorithm on degraded document images.
Synthesis and Optimization of Threshold Logic Networks with Application to Nanotechnologies
Authors: Rui Zhang, Pallav Gupta, Lin Zhong, Niraj K. Jha
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 2 (2004)

We propose an algorithm for efficient threshold network synthesis of arbitrary multi-output Boolean functions. The main purpose of this work is to bridge the wide gap that currently exists between research on the development of nanoscale devices and research on thedevelopment of synthesis methodologies to generate optimized networks utilizing these devices. Many nanotechnologies, such as resonant tunneling diodes (RTD) and quantum cellular automata (QCA), are capable of implementing threshold logic. While functionally correct threshold gates have been successfully demonstrated, there exists no methodology or design automation tool for general multi-level threshold network synthesis. We have built the first such tool, ThrEshold Logic Synthesizer (TELS), on top of an existing Boolean logic synthesis tool. Experiments with about 60 multi-output benchmarks were performed, though the results of only 10 of them are reported in this paper because of space restrictions. They indicate that up to 77% reduction in gate count is possible when utilizing threshold logic, with an average reduction being 52%, compared to traditional logic synthesis. Furthermore, thesynthesized networks are well-balanced, and hence delay-optimized.
Building an Association Rules Framework to Improve Product Assortment Decisions
Authors: Tom Brijs, Gilbert Swinnen, Koen Vanhoof, Geert Wets
Venue: Data Mining and Knowledge Discovery (2004)

It has been claimed that the discovery of association rules is well suited for applications of market basket analysis to reveal regularities in the purchase behaviour of customers. However today, one disadvantage of associations discovery is that there is no provision for taking into account the business value of an association. Therefore, recent work indicates that the discovery of interesting rules can in fact best be addressed within a microeconomic framework. This study integrates the discovery of frequent itemsets with a (microeconomic) model for product selection (PROFSET). The model enables the integration of both quantitative and qualitative (domain knowledge) criteria. Sales transaction data from a fully automated convenience store are used to demonstrate the effectiveness of the model against a heuristic for product selection based on product-specific profitability. We show that with the use of frequent itemsets we are able to identify the cross-sales potential of product items and use this information for better product selection. Furthermore, we demonstrate that the impact of product assortment decisions on overall assortment profitability can easily be evaluated by means of sensitivity analysis.
Ni- and Co-based silicides for advanced CMOS applications
Authors: J. A. Kittl, A. Lauwers, O. Chamirian, M. Van Dal, A. Akheyar, M. De Potter, R. Lindsay, K. Maex
Venue: Microelectronic Engineering (2003)

The scaling behavior of Co, Co-Ni and Ni silicides to sub-40 nm gate length CMOS technologies with sub-100 nm junction depths was evaluated. Limitations were found for Co and Co-Ni alloy silicides, which exhibited an increase in sheet resistance at gate lengths below 40 nm and required high processing temperatures to achieve low junction leakage. Ni silicide was shown, in contrast, to have good scaling behavior, with a decrease in sheet resistance for decreasing gate lengths down to 30 nm, lower diode leakage (at similar sheet resistance) and lower silicide to p+ Si contact resistance than Co silicide. Key material issues impacting the applicability of NiSi to CMOS technologies were investigated. Studies of the kinetics of Ni2Si growth were used to design a process that avoids excessive silicidation of small features. The thermal degradation mechanisms of NiSi films were also studied. Thin films degraded morphologically with activation energies of ∼ 2.4 eV. Thick films degraded morphologically at low temperatures and by transformation to NiSi2 at high temperatures, suggesting a higher activation energy for the latter mechanism. Pt alloying was shown to help stabilize NiSi films against morphological degradation.
How complex is the unified modeling language?
Authors: Keng Siau, Qing Cao
Venue: Advanced topics in database research vol. 1 (2003)

Unified Modeling Language (UML)has emerged as the software industry's dominant modeling language. It is the de facto modeling language standard for specifying, visualizing, constructing, and documenting the components of software systems. Despite its prominence and status as the standard modeling language, UML has its critics. Opponents argue that it is complex and difficult to learn. Some question the rationale of having nine diagramming techniques in UML and the raison d'être of those nine techniques in UML. Others point out that UML lacks a comprehensive methodology to guide its users, which makes the language even more convoluted. A few studies on UML can be found in the literature. However, no study exists to provide a quantitative measure of UML complexity or to compare UML with other object-oriented techniques. In this research, we evaluate the complexity of UML using complexity metrics. The objective is to provide a reliable and accurate quantitative measure of UML complexity. A comparison of the complexity metrical values of UML with other object-oriented techniques was also carried out. Our findings suggest that each diagram in UML is not distinctly more complex than techniques in other modeling methods. But as a whole, UML is very complex-2-11 times more complex than other modeling methods.