ppxscal/embedding_network huggingface dataset:
Controlling Iterative Software Development Projects: The Challenge of Stakeholder and Technical Integration
Authors: Bendik Bygstad
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

Most IS projects today are not greenfield projects, but relate heavily to existing information infrastructures and business processes. How should the development process integrate with the business process? This is a crucial question, because a project that does not integrate with the business processes will be a failure, even if the software which is produced is well designed and programmed.The Software Engineering community has embraced iterative process frameworks, like the Rational Unified Process. These frameworks claim to support a step-wise integration of the business process and the development process.This paper explores and analyses the managerial challenges of integration in such projects. Building on a longitudinal case study and an analysis of the Rational Unified process, four types of integration are identified and analyzed: External and internal stakeholder integration, and internal and external technical integration. Finding that the external integrationmechanisms are just as critical at the internal, the paper concludes that the integration challenge is complex, partly outside the control of the project manager and not supported sufficiently in the RUP framework. A theory extension to RUP is suggested.
Beyond Independence: Probabilistic Models for Query Approximation on Binary Transaction Data
Authors: Dmitry Pavlov, Heikki Mannila, Padhraic Smyth
Venue: IEEE Transactions on Knowledge and Data Engineering (2003)

We investigate the problem of generating fast approximate answers to queries posed to large sparse binary data sets. We focus in particular on probabilistic model-based approaches to this problem and develop a number of techniques that are significantly more accurate than a baseline independence model. In particular, we introduce two techniques for building probabilistic models from frequent itemsets: the itemset maximum entropy model and the itemset inclusion-exclusion model. In the maximum entropy model, we treat itemsets as constraints on the distribution of the query variables and use the maximum entropy principle to build a joint probability model for the query attributes online. In the inclusion-exclusion model, itemsets and their frequencies are stored in a data structure, called an ADtree, that supports an efficient implementation of the inclusion-exclusion principle in order to answer the query. We empirically compare these two itemset-based models to direct querying of the original data, querying of samples of the original data, as well as other probabilistic models such as the independence model, the Chow-Liu tree model, and the Bernoulli mixture model. These models are able to handle high-dimensionality (hundreds or thousands of attributes), whereas most other work on this topic has focused on relatively low-dimensional OLAP problems. Experimental results on both simulated and real-world transaction data sets illustrate various fundamental trade offs between approximation error, model complexity, and the online time required to compute a query answer.
SME barriers to electronic commerce adoption: nothing changes-everything is new
Authors: Carina Ihlström, Monika Magnusson, Ada Scupola, Virpi Kristiina Tuunainen
Venue: Managing IT in government business & communities (2003)

In this chapter we look into earlier empirical research on the barriers to e-commerce (EC) adoption and diffusion for small and medium-sized enterprises (SMEs). We explore research conducted in the context of information and communications technologies (ICT) in general, as well as EDI and Internet-based e-commerce. What we are interested in is whether these barriers are something new created by the new wave of Internet based technologies. We divide the barriers, inhibitors, or factors slowing down the diffusion of new technologies found in previous literature into those internal to an organization and those imposed by external forces. The basic premise of this chapter is that technologies advance or change, but the barriers for SMEs to adopt them do not. The authors hope that understanding this will help researchers, small companies, and policy makers to move on and do something active to reduce such barriers.
Construction of interactive video information system by applying results of object recognition
Authors: Xiaomeng Wu, Wenli Zhang, Shunsuke Kamijo, Masao Sakauchi
Venue: Proceedings of the eleventh ACM international conference on Multimedia (2003)

Although numerous attempts have been made to determine algorithms and approaches for building up a video information system, not many practical applications have been proposed. In this paper, a novel interactive video information system called the Drama Characters' Popularity Voting System (DCPVS) is constructed by applying the results of off-line object recognition. The system's purpose is to provide description annotation, retrieval, and statistics in the video associated with an object, such as a character as a basic unit, over the Internet. By using the proposed system, multiple users in a network can enjoy the same video and can vote for the characters they like in it. The voting information is collected and stored in the server, which then provides the statistics regarding the popularity of different characters or the voting rates within different periods of the video.
Interior and exterior functions of positive Boolean functions
Authors: Kazuhisa Makino, Hirotaka Ono, Toshihide Ibaraki
Venue: Discrete Applied Mathematics (2003)

The interior and exterior functions of a Boolean function f were introduced in Makino and Ibaraki (Discrete Appl. Math. 69 (1996) 209-231), as stability (or robustness) measures of the f. In this paper, we investigate the complexity of two problems α-INTERIOR and α-EXTERIOR, introduced therein. We first answer the question about the complexity of α-INTERIOR left open in Makino and Ibaraki (Discrete Appl. Math. 69 (1996) 209-231); it has no polynomial total time algorithm even if α is bounded by a constant, unless P = NP. However, for positive h-term DNF functions with h bounded by a constant, problems α-INTERIOR and α-EXTERIOR can be solved in (input) polynomial time and polynomial delay, respectively. Furthermore, for positive k-DNF functions, α-INTERIOR for two cases in which k = 1, and α and k are both bounded by a constant, can be solved in polynomial delay and in polynomial time, respectively.
Exact flow analysis
Authors: Christian Mossin
Venue: Mathematical Structures in Computer Science (2003)

We present a type-based flow analysis for simply typed lambda calculus with booleans, data-structures and recursion. The analysis is exact in the following sense: if the analysis predicts a redex, there exists a reduction sequence (using standard reduction plus context propagation rules) such that this redex will be reduced. The precision is accomplished using intersection typing.It follows that the analysis is non-elementary recursive &ndash; more surprisingly, the analysis is decidable. We argue that the specification of such an analysis provides a good starting point for developing new flow analyses and an important benchmark against which other flow analyses can be compared. Furthermore, we believe that the techniques employed for stating and proving exactness are of independent interest: they provide methods for reasoning about the precision of program analyses.A preliminary version of this paper has previously been published (Mossin 1997b). The present paper extends, elaborates and corrects this previously published abstract.
Multilevel First-Order System Least Squares for Elliptic Grid Generation
Authors: A. L. Codd, T. A. Manteuffel, S. F. McCormick, J. W. Ruge
Venue: SIAM Journal on Numerical Analysis (2003)

A new fully variational approach is studied for elliptic grid generation (EGG). It is based on a general algorithm developed in a companion paper [A. L. Codd, T. A. Manteuffel, and S. F. McCormick, SIAM J. Numer. Anal., 41 (2003), pp. 2197--2209] that involves using Newton's method to linearize an appropriate equivalent first-order system, first-order system least squares (FOSLS) to formulate and discretize the Newton step, and algebraic multigrid (AMG) to solve the resulting matrix equation. The approach is coupled with nested iteration to provide an accurate initial guess for finer levels using coarse-level computation. The present paper verifies the assumptions of the companion work and confirms the overall efficiency of the scheme with numerical experiments.
Reliability of information on theInternet: Some distinctions
Authors: Anton Vedder, Robert Wachbroit
Venue: Ethics and Information Technology (2004)

In this contribution, we identify and clarify some distinctions we believe are useful in establishing the reliability of information on the Internet. We begin by examining some of the salient features of information that go into the determination of reliability. In so doing, we argue that we need to distinguish content and pedigree criteria of reliability and that we need to separate issues of reliability of information from the issues of the accessibility and the usability of information. We then turn to an analysis of some common failures to recognize reliability or unreliability.
O(h2) Global Pointwise Algorithms for Delay Quadratic Problems in the Calculus of Variations
Authors: Om Prakash Agrawal, John Gregory
Venue: SIAM Journal on Numerical Analysis (2003)

The main purpose of this paper is to give numerical algorithms and the error analysis for delay quadratic problems in the calculus of variations. These methods are new, efficient, and accurate and have a global a priori error of O(h2), where h is the distance between any two successive node points.We also derive the results for the general, numerical, delay problem, but we focus on proving our results in the simpler quadratic case since the extra technical numerical details have been given previously by the second author. In addition, the authors have previously shown how to reformulate general delay constrained problems in optimal control theory/constrained calculus of variations as unconstrained delay problems. Thus our numerical results and methods will hold for these general constrained problems also.Finally, we note that our algorithm, which solves the stationary condition(s) numerically, avoids the more difficult problems of piecing the solution of second order equations together and requires less smoothness in the solution. Thus we replace difficult second order boundary value problems with the easier task of approximating definite integrals involving first order derivatives.
Designing and specifying mobility within the multiagent systems engineering methodology
Authors: Athie L. Self, Scott A. DeLoach
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

Recently, researchers have created many platforms and applications for mobile agents; however, current Agent-Oriented Software Engineering (AOSE) methodologies have yet not fully integrated the unique properties of these mobile agents. This paper attempts to bridge the gap between current AOSE methodologies and mobile agent systems by incorporating mobility into the established Multiagent Systems Engineering (MaSE) methodology. We accomplished this by adding a move command to the MaSE analysis models and then defined the required transformations to incorporate the required functionality into the design. Finally, we translated the design models into Java-based agents that operate within a mobile agent environment.
Fun and Games: Multi-Language Development
Authors: Andrew M. Phelps, David M. Parks
Venue: Queue (2004)

Computer games (or “electronic games” if you encompass those games played on console-class hardware) comprise one of the fastest-growing application markets in the world. Within the development community that creates these entertaining marvels, multi-language development is becoming more commonplace as games become more and more complex. Today, asking a development team to construct a database-enabled Web site with the requirement that it be written entirely in C++ would earn scornful looks and rolled eyes, but not long ago the idea that multiple languages were needed to accomplish a given task was scoffed at.
Complexity of molecules
Authors: Sonja Nikolic´, Nenad Trinajstic´
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

We studied complexity of several classes of molecular graphs[1]: linear and branch trees, (poly)cycles and general graphs. Trees and (poly)cycles are simple graphs that are graphs without multiple edges and loops. General graphs are graphs with multiple edges and loops. A loop is an edge with both of its vertices identical. We used trees[2] to represent alkanes, cycles to represent cycloalkanes, various polycyclic graphs to represent cage-structures and general graphs to represent heterosystems. We employed in our study the following complexity indices: Bonchev's indices[3], Zagreb complexity indices[4], spanning trees[2] and total walk counts[5]. We considered the following structural features: a graph (molecule) size in terms of number of vertices and edges, branching, cyclicity, the number of loops and multiple edges and symmetry.
Randomization helps to perform independent tasks reliably
Authors: Bogdan S. Chlebus, Dariusz R. Kowalski
Venue: Random Structures Algorithms (2004)

This paper is about algorithms that schedule tasks to be performed in a distributed failure-prone environment, when processors communicate by message-passing, and when tasks are independent and of unit length. The processors work under synchrony mad may fail by crashing. Failure patterns are imposed by adversaries. Linearly-bounded adversaries may fail up to a constant fraction of the processors. Weakly-adaptive adversaries have to select, prior to the start of an execution, a subset of processors to be failure-prone, and then may fail only the selected processors, at arbitrary steps, in the course of the execution. Strongly adaptive adversaries have a total number of failures as the only restriction on failure patterns. The measures of complexity are work, measured as the available processor steps, and communication, measured as the number of point-to-point messages. A randomized algorithm is developed, that attains both O(n log*n) expected work and O(n log*n) expected communication, against weakly-adaptive linearly-bounded adversaries, in the case when the numbers of tasks and processors are both equal to n. This is in contrast with performance of algorithms against strongly-adaptive linearly-bounded adversaries, which has to be ω(n log n/log log n) in terms of work.
On Using Partial Supervision for Text Categorization
Authors: Charu C. Aggarwal, Stephen C. Gates, Philip S. Yu
Venue: IEEE Transactions on Knowledge and Data Engineering (2004)

Abstract--In this paper, we discuss the merits of building text categorization systems by using supervised clustering techniques. Traditional approaches for document classification on a predefined set of classes are often unable to provide sufficient accuracy because of the difficulty of fitting a manually categorized collection of documents in a given classification model. This is especially the case for heterogeneous collections of Web documents which have varying styles, vocabulary, and authorship. Hence, this paper investigates the use of clustering in order to create the set of categories and its use for classification of documents. Completely unsupervised clustering has the disadvantage that it has difficulty in isolating sufficiently fine-grained classes of documents relating to a coherent subject matter. In this paper, we use the information from a preexisting taxonomy in order to supervise the creation of a set of related clusters, though with some freedom in defining and creating the classes. We show that the advantage of using partially supervised clustering is that it is possible to have some control over the range of subjects that one would like the categorization system to address, but with a precise mathematical definition of how each category is defined. An extremely effective way then to categorize documents is to use this a priori knowledge of the definition of each category. We also discuss a new technique to help the classifier distinguish better among closely related clusters.
An improved quadrilateral finite element for analysis of thin plates
Authors: A. G. Razaqpur, M. Nofal, A. Vasilescu
Venue: Finite Elements in Analysis and Design (2003)

A review of 4-node, 12 degrees-of-freedom quadrilateral elements for thin plates is presented. An improved thin plate element based on the Discrete Kirchhoff Assumptions, called IDKQ, is discussed. The formulation is based on a coordinate transformation technique which involves the imposition of the Discrete Kirchhoff Assumptions at the center and mid-side nodes of the 9-node Lagrangean isoparametric plate element denoted as QUAD9. The element IDKQ passes the patch test and it appears to be accurate. Based on the numerical results from a set of standard test problems, this new formulation is shown to be an improvement over the earlier attempts to formulate a compatible and computationally efficient finite element for thin plates analysis.
PromisQoS: An Architecture for Delivering QoS to High-Performance Applications on Myrinet Clusters
Authors: Jothi P. Neelamegam, Srigurunath Chakravarthi, Manoj Apte, Anthony Skjellum
Venue: Proceedings of the 28th Annual IEEE International Conference on Local Computer Networks (2003)

Clusters of workstations are being extensively used forsolving computationally intensive scientific problems.However, there is limited support for Quality of Service(QoS) based distributed computing on commercial off-the-shelf (COTS) clusters. This limitation has restricted successful deployment of distributed real-time high-performancecomputing applications to customized anddedicated embedded multi-processor systems. This paperdescribes research work that attempts to provide a clusterplatform that can guarantee access to computational andcommunication resources to distributed applications. Theauthors have developed PromisQoS, an architecture thatsupports execution of hard real-time distributedapplications on a Linux cluster while providing high-throughputand low-latency communication usingMyrinet. PromisQoS consists of the following majorcomponents -- Hare, BDM-RT and Turtle. Hare is aprototype implementation of time-based QoS channelsspecified by the Real-Time Message Passing Interface(MPI/RT 1.1) standard. BDM-RT is a low-level messaginglibrary on Myrinet that provides deterministiccommunication latency and bandwidth on Myrinet. Turtle,a variant of RT-Linux, is the real-time operating systemthat provides guaranteed computation time. This workdemonstrates that it is possible to deploy hard real-timedistributed applications on COTS clusters and underlinesthe significance of the MPI/RT API in the realm ofdistributed high-performance computing applications thatrequire QoS.
Learning from User Behavior in Image Retrieval: Application of Market Basket Analysis
Authors: Henning Müller, Thierry Pun, David Squire
Venue: International Journal of Computer Vision (2004)

This article describes an approach to learn feature weights for content-based image retrieval (CBIR) from user interaction log files. These usage log files are analyzed for images marked together by a user in the same query step. The problem is somewhat similar to one of the traditional data mining problems, the market basket analysis problem, where items bought together in a supermarket are analyzed. This paper outlines similarities and differences between the two fields and explains how to use the interaction data for deriving a better feature weighting.Experiments with existing log files are done and a significant improvement in performance is reached with a feature weighting calculated from the information contained in the log files. Even with several steps of relevance feedback the results remain much better than without the learning, which means that not only information from feedback is taken into account earlier, but a better quality of retrieval is reached in all steps.
The evolution of information technology management at the federal level: implications for public administration
Authors: Stephen H. Holden
Venue: Public information technology: policy and management issues (2003)

Federal agencies rely extensively on information technology (IT) to perform basic missions. Arguably, public administration should be driving the theory, policy, and practice for managing these increasingly important resources. This is especially true as public organizations move to electronic government.Despite some maturation in the literature for managing IT in federal agencies in the last several years, public administration has contributed little to this effort. Other academic fields, such as information science, business administration, and practitioners from the federal government and related contractors have contributed more recently to the theory and practice of IT management at the federal level than public administration.This chapter analyzes federal IT management literature from several academic disciplines and government documents. The analysis compares federal IT management with a normative model of management maturity focusing on the strategic objectives for IT and related management approaches. Public administration's minimal contribution to federal IT management raises profound questions whether federal agencies are performing commensurate with public expectations in an information age.
Numerical method for solving a class of nonlinear elliptic inverse problems
Authors: M. Essaouini, A. Nachaoui, S. El Hajji
Venue: Journal of Computational and Applied Mathematics (2004)

This paper discusses a method to solve a family of nonlinear inverse problems with Cauchy conditions on a part of the boundary and no condition at all on another part. An iterative boundary element procedure is proposed. The scheme uses a dynamically estimated relaxation parameter on the under-specified boundary. Various types of convergence, boundary condition formulations and effects of added small perturbations into the input data are investigated. The numerical results show that the method produces a stable reasonably approximate solution.
A wavelet-based approach for frequency estimation of interference signals in printed circuit boards
Authors: A. Kacha, F. Grenez, P. De Doncker, K. Benmahammed
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

This paper proposes a wavelet-based approach for frequency estimation of the source of interference in a PCB. The frequency constitutes a relevant information that characterizes the disturbance signal and may lead to the identification of its source. The estimation procedure is only based on the disturbed signal, already available, from which the interference signal is reconstructed by performing a wavelet decomposition at level one. The estimated interference is then appropriately processed to determine its frequency.