ppxscal/embedding_network huggingface dataset:
Band arrays in Fortran: an elegant representation
Authors: S. C. Eisenstat, J. W. Lewis
Venue: ACM SIGNUM Newsletter (1981)

By breaking the usual linkage between the two functions of an array declaration -- storage allocation and element access -- a particularly elegant and readable FORTRAN representation for band matrices is obtained. Mathematical software using this representation involves simpler index expressions, is easier to read, and may produce more efficient code.
Knowledge discovery and experience modeling in computer forensics media analysis
Authors: A. Chris Bogen, David A. Dampier
Venue: Proceedings of the 2004 international symposium on Information and communication technologies (2004)

This paper is presented to identify research goals for the modeling of experiences, lessons learned, and knowledge discovered during the analysis of digital evidence in a forensic investigation. Additionally this paper suggests how such models might be used to facilitate automated computer forensics media analysis tools. The scope of this paper, with respect to computer forensics, is limited to the search for, identification of, and analysis of evidence found on digital storage media. Probing questions are presented that the authors are intending to answer in this research, as well as an idea of what products might be produced in this research effort.
Testing hypergraph colorability
Authors: Artur Czumaj, Christian Sohler
Venue: Theoretical Computer Science (2005)

We study the problem of testing properties of hypergraphs. The goal of property testing is to distinguish between the case whether a given object has a certain property or is "far away" from the property. We prove that the fundamental problem of l-colorability of k-uniform hypergraphs can be tested in time independent of the size of the hypergraph. We present a testing algorithm that examines only (k l/ε)O(k) entries of the adjacency matrix of the input hypergraph, where ε is a distance parameter independent of the size of the hypergraph. The algorithm tests only a constant number of entries in the adjacency matrix provided that l, k, and ε are constants. This result is a generalization of previous results about testing graph colorability.
International Diffusion of Digital Mobile Technology: A Coupled-Hazard State-Based Approach
Authors: Robert J. Kauffman, Angsana A. Techatassanasoontorn
Venue: Information Technology and Management (2005)

The convergence of the Internet, electronic commerce, and wireless technology has created the basis for the rapid global diffusion of mobile commerce. We believe that one approach to understand mobile commerce diffusion is to study the diffusion of digital mobile devices required in mobile commerce activities. Although prior research in technology diffusion has identified a set of variables that affect the entire diffusion process, our knowledge about the factors that dominate at different states of a diffusion process is still incomplete. This research puts forward a new theoretical perspective to enable managers to better understand the states of technology diffusion in the context of digital mobile phones. Our empirical methods involve a coupled-hazard analysis of an interdependent event model to test the effects of country characteristics, the digital and the analog mobile phone industry characteristics, and the regulatory policies on various states of digital mobile phone diffusion across countries. We conduct non-parametric and parametric survival analysis of the model. The results illustrate a broader set of factors that drive the diffusion speed from the early to the partial diffusion state than from the introduction to the early diffusion state.
A Prelaunch Diffusion Model for Evaluating Market Defense Strategies
Authors: John H. Roberts, Charles J. Nelson, Pamela D. Morrison
Venue: Marketing Science (2005)

This paper describes the development and application of a marketing model to help set an incumbent's defensive marketing strategy prior to a new competitor's launch. The management problem addressed is to assess the market share impact of a new entrant in the residential Australian long distance telephone call market and determine the factors that would influence its dynamics and ultimate market appeal.The paper uses probability flow models to provide a framework to generate forecasts and assess the determinants of share loss. We develop models at two levels of complexity to give both simple, robust forecasts and more detailed diagnostic analysis of the effect of marketing actions. The models are calibrated prior to the new entrant's launch, enabling preemptive marketing strategies to be put in place by the defending company. The equilibrium level of consideration of the new entrant was driven by respondents' strength of relationship with the defender and inertia, while trial was more price-based. Continued use of the defender depends on both service factors and price. The rate at which share loss eventuates is negatively related to the defender's perceived responsiveness, saving money being the only reason to switch, and risk aversion.Prelaunch model forecasts, validated six months after launch using both aggregate monthly sales data and detailed tracking surveys, are shown to closely follow the actual evolution of the market. The paper provides a closed-form multistate model of the new entrant's diffusion, a methodology for the prelaunch calibration of dynamic models in practice, and insights into defensive strategies for existing companies facing new entrants.
Internetworking of factors affecting successive searches over multiple episodes
Authors: Shin-jeng Lin
Venue: Journal of the American Society for Information Science and Technology (2005)

Successive information searches are fairly common. To enhance the understanding of the behavior, this study attempted to improve both the descriptive and explanatory power of the Multiple Information Seeking Episodes (MISE) model, a conceptual model characterizing factors affecting successive searches. It empirically observed how the key factors in the information seeking process in the MISE model evolve over multiple search sessions and explained how those factors are affected by other factors associated with searchers, search activity, search context, systems, information attainment, and information-use activities. The validated and enriched MISE model can be extended to serve the basis for future studies in other complex searches process such as multi-tasking and collaborative searches, and can also help identify problems that users face and thus derive requirements for system support.
Heterogeneous High Performance Computer Emulation of a Space Based Radar On-Board Processor
Authors: Assem Salama, Richard Linderman, John Rooks, Allison Leider
Venue: Proceedings of the 2004 Users Group Conference (2004)

This paper presents the successful emulation of an on-board processor (OBP) to support Space Based Radar (SBR). The emulation is demonstrated on the forty-eight node dual Xeon Heterogeneous High Performance Computer (HHPC) operated by the Air Force Research Laboratory (AFRL) located in Rome, New York. Each node in the HHPC supports one Annapolis Wildstar II board, composed of 2 Xilinx Virtex II 6 Million gate Field Programmable Gate Arrays (FPGAs). As system complexity increases, debugging the software of tera-scale systems with hundreds to thousands of processors is poorly supported by time consuming simulations. However, the advent of large FPGAs allows a powerful new tool to assist in the architecture development effort-emulation. For the case at hand, the 96 FPGAs of the HHPC are capable of emulatingat 8% of the actual system clock speed (20 MHz of 250 MHz) and close to 15% of the 2560 individual processors of the proposed SBR system. Even at this reduced scale, this emulation provides a testing environment roughly a million times more capable than HPC-basedsimulation for early software bug detection and correction. Further, this framework allows for experimenting with architecture enhancements and changes, and ultimately will ensure a low cost, reliable, fully reprogrammable product produced without re-spins. The embedded system architecture of this SBR OBP is based on AFRL's dual processor, power efficient, programmable, Wafer Scale Signal Processor (WSSP). Target tracking and discrimination algorithms were developed and demonstrated on an earlier 96 processor embodiment of this architecture. For SBR, the algorithm set is being extended to include Synthetic Aperture Radar (SAR) image formation and Moving Target Indication (MTI) algorithms.
Damped Newton Algorithms for Matrix Factorization with Missing Data
Authors: A. M. Buchanan, A. W. Fitzgibbon
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

The problem of low-rank matrix factorization in the presence of missing data has seen significant attention in recent computer vision research. The approach that dominates the literature is EM-like alternation of closed-form solutions for the two factors of the matrix. An obvious alternative is non-linear optimization of both factors simultaneously, a strategy which has seen little published research. This paper provides a comprehensive comparison of the two strategies by evaluating previously published factorization algorithms as well as some second order methods not previously presented for this problem. We conclude that, although alternation approaches can be very quick, their propensity to glacial convergence in narrow valleys of the cost function means that average-case performance is worse than second-order strategies. Further, we demonstrate the importance of two main observations: one, that schemes based on closed-form solutions alone are not suitable and that non-linear optimization strategies are faster, more accurate and provide more flexible frameworks for continued progress; and two, that basic objective functions are not adequate and that regularization priors must be incorporated, a process that is easier with nonlinear methods.
A MIMO Parameter Estimation Model Taking Ricean Fading Channel and Stochastically Uncorrelated Signals into Account " Part II: Asymptotically Efficient Estimators
Authors: Bamrung Tau Sieskul, Somchai Jitapunkul
Venue: Proceedings of the 3rd Annual Communication Networks and Services Research Conference (2005)

The purpose of this paper is twofold; to demonstrate parameter estimation possibility of MIMO model [11], and to propose an asymptotically efficient approach for estimating three channel parameters such as, nominal direction, angular spread and Rice factor. Manipulating the estimation in efficient manner, the benchmark and the proposed estimators are based on weighted least squares (WLS) criteria. Rather than invoking the sample covariance estimate in ordinary WLS criterion, the proposed approach makes use of structured covariance estimate for computing the weight matrix. The nonparametric estimate presented herein is the way to constrain the array covariance matrix to hold the Toeplitz structure so that the residual due to imposing the structured weight matrix is less than that provided by employing the ordinary sample covariance. As a matter of course, this leads to more advantage for parameter estimation, particulary, in non-asymptotic region of temporal snapshot number. Numerical examples are conducted to validate the superiority in non-asymptotic situations.
Errata
Authors: W. W. Bledsoe
Venue: Issue 34 (June 1972) (1972)

On page 10 of the February Newsletter we inadvertantly misspelled C. L. Chang's name. Our apologies to him and others so treated.
Modeling the spread of infectious disease
Authors: Joseph Glessner
Venue: Journal of Computing Sciences in Colleges (2005)

The study of disease spread among large populations is a daunting task to perform without the aid of computers. Not only does this require extensive data retrieval and analysis, but it is impossible to test multiple scenarios. Pestilence is a program that allows students to explore the patterns of disease spread. Pestilence was developed using Netlogo, a programmable modeling environment. The user has control of over 20 variables that can be dynamically changed during program execution. Important factors such as the effect of geographic barriers, infection lifespan, population density, contagiousness, and hospital capability can be tested separately and related. Observed values are constantly updated during program execution. Graphs are also produced concurrently with execution to allow immediate observation of trends. There is an option to output all data into an Excel&reg; spreadsheet in a selected time interval for further analysis. Macros are provided to automatically format spreadsheets for ease of reading and printing. There are eleven different backgrounds to choose from, including a moving subway system. All of the following can be dynamically set: initial positions and densities of two populations, percentage of each population having the infection initially, the number of travelers, those who move more, and meanderers and their number of movements per day of simulation, infection lifespan is established for both susceptible and healthy individuals, ranges of which are controlled, percent recovery and a period after which recovered people are immune to being infected again, transmission characteristics are provided through infection radius and percent infection per contact, latency period, hospital mobility and percent indifference, hospital capacity and capabilities, decrease in hospital capability due to the demand, treatment time and decrease in mobility of infected people each day the infection progresses. The time interval which the program runs can be modified to slow down and speed up at certain points. All of these variable settings are visible on-screen at all times through the use of sliders. All values of these sliders are saved to an Excel&reg; file for comparison. This program automates data collection and provides data analysis on progressively produced on-screen graphs. It serves as a learning tool for disease spread as well as a practical projection tool for severity of possible disease epidemics.
A Neural Network Based Predictive Mechanism for Available Bandwidth
Authors: Alaknantha Eswaradass, Xian-He Sun, Ming Wu
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Most recent developments of computer sciences, such as web services, Grid, peer-to-peer, and mobile computing, are network-based computing. Their applicability depends on the availability of the underlying network bandwidth. However, network resources are shared and the available network bandwidth varies with time. There is no satisfactory solution available for network performance predictions. This lack of prediction limits the applicability of network-based computing, especially for Grid computing where concurrent remote processing is essential. In this study, we propose an Artificial Neural Network (ANN) based approach for network performance prediction. The ANN mechanism has been tested on classical trace files and compared with the well-known system NWS (Network Weather Service) for performance. Experimental results show the ANN approach always provides an improved prediction over that of NWS. ANN has a real potential in network computing.
Sound compression: a rough path approach
Authors: Terry J. Lyons, Nadia Sidorova
Venue: Proceedings of the 4th international symposium on Information and communication technologies (2005)

We present a new approach to sound compression, based on rough path theory, which turns out to be more effective than the traditional Fourier and Wavelet methods. We describe a procedure for encoding a signal using certain sequences of iterated integrals known as signatures and construct an algorithm for decoding.
CISA Exam Cram: Certified Information Systems Auditor
Authors: Allen Keele, Keith Mortier
Venue:  (2005)

Want an affordable yet innovative approach to studying for the Certified Information Systems Auditor (CISA) 2005 exam? CISA 2005 Exam Cram 2 is your solution. You will have the essential material for passing the CISA 2005 exam right at your fingertips. All exam objectives are covered and you'll find practice exams, exam alerts, notes, tips and cautions to help guide you through your exam preparation. A CD also provides you with a video introduction to the exam and complete explanations of answers to the practice questions from Certified Tech Trainers (CTT). As a special bonus, you will receive $75 in discounts on CTT products and services. For your smartest, most efficient way to get certified, choose CISA 2005 Exam Cram 2.
Designing and implementing a user-focused web based database system
Authors: Rachel Noiseux
Venue: Journal of Computing Sciences in Colleges (2004)

The goal of this project is to create a system with an interface designed with usability in mind as well as a strong interweaving of the web and a database to create the ideal freshman orientation online registration site. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A framework to elicit the skills needed for software development
Authors: Jack Downey
Venue: Proceedings of the 2005 ACM SIGMIS CPR conference on Computer personnel research (2005)

This paper proposes a theoretical framework to inform an interview instrument. This instrument will be used to investigate the skills needed in software development by interviewing experienced personnel. Based on Social Cognitive Theory, this framework will allow for the elicitation of skill-set information by considering the person, their behaviors and the organization they work in.
Interactive Pinpoint Image Object Removal
Authors: Frank Nielsen, Richard Nock
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

We present a novel interactive system and its user interface for removing objects in digital pictures. Our system consists of two components: (i) (partiallysupervised/automatic) image segmentation [2], and (ii) (guided) texture synthesis [3].
A steepest descent method for vector optimization
Authors: L. M. Graña Drummond, B. F. Svaiter
Venue: Journal of Computational and Applied Mathematics (2005)

In this work we propose a Cauchy-like method for solving smooth unconstrained vector optimization problems. When the partial order under consideration is the one induced by the nonnegative orthant, we regain the steepest descent method for multicriteria optimization recently proposed by Fliege and Svaiter. We prove that every accumulation point of the generated sequence satisfies a certain first-order necessary condition for optimality, which extends to the vector case the well known "gradient equal zero" condition for real-valued minimization. Finally, under some reasonable additional hypotheses, we prove (global) convergence to a weak unconstrained minimizer.As a by-product, we show that the problem of finding a weak constrained minimizer can be viewed as a particular case of the so-called Abstract Equilibrium problem.
Programmable SC Biquad Using One Single Capacitor Bank
Authors: A. Torralba, A. P. Vega-Leal, R. G. Carvajal
Venue: Analog Integrated Circuits and Signal Processing (2005)

This paper presents a new technique for programming SC circuits using a single time-multiplexed capacitor bank, achieving a significant reduction in capacitance area. Simulation and experimental results obtained with a programmable biquad low pass filter show the validity of the proposed method.
Autonomous ground vehicle path tracking
Authors: Jeff Wit, Carl D. Crane,  III<, David Armstrong
Venue: Journal of Robotic Systems (2004)

Autonomous ground vehicle navigation requires the integration of many technologies such as path planning, position and orientation sensing, vehicle control, and obstacle avoidance. The work presented here focuses on the control of a nonholonomic ground vehicle as it tracks a given path. A new path tracking technique called &ldquo;vector pursuit&rdquo; is presented. This new technique is based on the theory of screws, which was developed by Sir Robert Ball in 1900. It generates a desired vehicle turning radius based on the vehicle's current position and orientation relative to the position of a point ahead on the planned path and the desired orientation along the path at that point. The vector pursuit algorithm is compared to other geometrical approaches, and it is shown to be more robust, resulting in more accurate path tracking. &copy; 2004 Wiley Periodicals, Inc.
A low-footprint class loading mechanism for embedded Java virtual machines
Authors: Christophe Rippert, Alexandre Courbot, Gilles Grimaud
Venue: Proceedings of the 3rd international symposium on Principles and practice of programming in Java (2004)

This paper shows that it is possible to dramatically reduce the memory consumption of classes loaded in an embedded Java virtual machine without reducing its functionalities. We describe how to pack the constant pool by deleting entries which are only used during the class loading process. We present some benchmarks which demonstrate the efficiency of this mechanism. We finally suggest some additional optimizations which can be applied if some restrictions to the functionalities of the virtual machine can be tolerated.
Comparative analysis of topological constructions of Sparse Flat Neighborhood Networks for cluster supercomputers
Authors: A. A. Koshul'Ko
Venue: Cybernetics and Systems Analysis (2005)

The topology of Sparse Flat Neighborhood Networks (SFNNs) is considered and its advantages and drawbacks are analyzed. A comparative analysis of the quality of SFNN constructions designed by a modified cyclic method is performed. A set of quality criteria for estimation of practical usefulness of SFNN constructions is proposed.
Design of Distributed Simulation Environments: A Unified System-Theoretic and Logical Processes Approach
Authors: James Nutaro, Hessam Sarjoughian
Venue: Simulation (2004)

This article presents a framework for distributed simulation that is based on system-theoretic and logical-process concepts. The framework describes a three-part worldview for developing simulation models. These are modeling formalisms, abstract simulators, and computational environments. A unified view of time and causality allows for the application of system-theoretic notions of causality within a distributed simulation environment. Within this framework, the authors introduce a unified notion of causality for use in parallel simulations. Furthermore, they describe an approach for developing distributed simulation models that evolve from modeling constructs to simulation algorithms and their implementations. The framework is exemplified using the discrete event system specification (DEVS) modeling formalism, its abstract simulator, and a parallel algorithm that implements the abstract simulator.