ppxscal/embedding_network huggingface dataset:
Exploring Web marketing project management
Authors: Donald Emerick, Kim Round
Venue:  (2000)

Develop an Internet business strategy Build a winning project team Work toward your Webmaster CertificationTotal Management Strategies for Web-based Projects.Written by Donald Emerick and Kim Round with Susan JoyceGet the expert's view on marketing and communications for the Web. Learn insiders' tips for developing and implementing a business plan that works in the online community, then follow through by learning how to build a great project team and manage clients, workers, and technology to achieve your goals.With this interactive workbook, you'll be creating your own real outline as you work through the case studies, exercises, and labs that underscore the reading in each section. By the time you're through, you will have a complete work plan to refer to as you manage your next project.Exploring Web Marketing and Project Management gives you the skills to: Turn your creative vision into a marketing strategy and find the technology to support it Reach the clients that are right for your business Develop your plans into reality Manage the project, the team, and the client Get to the product launch-and through it Understand the special legal issues surrounding Internet communicationsExploring Web Marketing and Project Management is great for hands-on classroom use, self-paced study toward certification, or just as a practical guide for anyone who wants to do business on the Worldwide Web.About the Foundations of Web Site Architecture SeriesEndorsed by WOW, The World Organization of Webmasters, these fully interactive workbooks-and their companion websites at www.phptr.com/phptrinteractive.com-give you the core skills you need to manage content, business, and technology on the Worldwide Web. They are building blocks in Prentice Hall's comprehensive curriculum for professional Webmaster certification.About WOWThe World Organization of Webmasters is a professional organization with thousands of members and affiliates worldwide. Started as a non-profit organization, WOW was created to enhance the role and position of those individuals who create, manage, maintain, and market websites. This support is provided through membership in WOW. For more information on becoming a member, please visit, www.world-webmaster.org
Evolvable view environment (EVE): non-equivalent view maintenance under schema changes
Authors: E. A. Rundensteiner, A. Koeller, X. Zhang, A. J. Lee, A. Nica, A. Van Wyk, Y. Lee
Venue: Proceedings of the 1999 ACM SIGMOD international conference on Management of data (1999)

Supporting independent ISs and integrating them in distributed data warehouses (materialized views) is becoming more important with the growth of the WWW. However, views defined over autonomous ISs are susceptible to schema changes. In the EVE project we are developing techniques to support the maintenance of data warehouses defined over distributed dynamic ISs [5, 6, 7]. The EVE system is the first to allow views to survive schema changes of their underlying ISs while also adapting to changing data in those sources. EVE achieves this is two steps: applying view query rewriting algorithms that exploit information about alternative ISs and the information they contain, and incrementally adapting the view extent to the view definition changes. Those processes are referred to as view synchronization and view adaption, respectively. They increase the survivability of materialized views in changing environments and reduce the necessity of human interaction in system maintenance.
Parallel streams of linear random numbers in the spectral test
Authors: Karl Entacher
Venue: ACM Transactions on Modeling and Computer Simulation (TOMACS) (1999)

This paper reports analyses of subsequences of linear congruential pseudorandom numbers by means of the spectral test. Such subsequences occur in particular simulation setups or as methods to obtain parallel streams of pseudorandom numbers for parallel and distributed simulation. Especially in the latter case, two kinds of substreams are of special interest: lagged random numbers with step sizes k, and consecutive streams of random numbers of length l. We show how to analyze correlations within and between lagged subsequences with arbitrary step sizes k. Analyzing consecutive streams with the spectral test is related to the well-known long-range correlation analysis of linear congruential generators. Whereas the latter was carried out to show correlations between pairs of processors only, the spectral test provides a convenient method to study correlations between larger numbers of parallel streams as well.
Reading patterns and formats of academic articles on the Web
Authors: Y. Rho, T. D. Gedeon
Venue: ACM SIGCHI Bulletin (2000)

Various formats are being used for Web-based academic articles such as conference papers and journal papers. We surveyed the formats being used and tried to identify reading activities and the proper formats by carrying out two online surveys: an email-based survey with an email-based questionnaire and a Web-based survey with a Web-based questionnaire.The survey results show that readers overview Web-based academic articles from the screen, print them out and then read the printed articles. The results also show that the structural formats employed by most papers on the Web are against readers' preferences. The simple two-frame format was most preferred by 47% of the respondents as readers, but the cascade format of page windows was regarded as the worst by 65%. An interesting result is that 26% of the respondents selected as the worst style the paper-like format that is currently widely used for Web-based articles. Brief data sets and results are shown in this article.In addition, the importance of examples embedded in the Web-based questionnaire was shown by two consecutive surveys.
Discovering Internet marketing intelligence through online analytical web usage mining
Authors: Alex G. Büchner, Maurice D. Mulvenna
Venue: ACM SIGMOD Record (1998)

This article describes a novel way of combining data mining techniques on Internet data in order to discover actionable marketing intelligence in electronic commerce scenarios. The data that is considered not only covers various types of server and web meta information, but also marketing data and knowledge. Furthermore, heterogeneity resolution thereof and Internet- and electronic commerce-specific pre-processing activities are embedded. A generic web log data hypercube is formally defined and schematic designs for analytical and predictive activities are given. From these materialised views, various online analytical web usage data mining techniques are shown, which include marketing expertise as domain knowledge and are specifically designed for electronic commerce purposes.
Performance analysis of the Alpha 21264-based Compaq ES40 system
Authors: Zarka Cvetanovic, R. E. Kessler
Venue: Proceedings of the 27th annual international symposium on Computer architecture (2000)

This paper evaluates performance characteristics of the Compaq ES40 shared memory multiprocessor. The ES40 system contains up to four Alpha 21264 CPU's together with a high-performance memory system. We qualitatively describe architectural features included in the 21264 microprocessor and the surrounding system chipset. We further quantitatively show the performance effects of these features using benchmark results and profiling data collected from industry-standard commercial and technical workloads. The profile data includes basic performance information - such as instructions per cycle, branch mispredicts, and cache misses - as well as other data that specifically characterizes the 21264. Wherever possible, we compare and contrast the ES40 to the AlphaServer 4100 - a previous-generation Alpha system containing four Alpha 21164 microprocessors - to highlight the architectural advances in the ES40. We find that the Compaq ES40 often provides 2 to 3 times the performance of the AlphaServer 4100 at similar clock frequencies. We also find that the ES40 memory system has about five times the memory bandwidth of the 4100. These performance improvements come from numerous microprocessor and platform enhancements, including out-of-order execution, branch prediction, functional units, and the memory system.
Functions and data can dance as equal partners
Authors: J. Philip Benkard
Venue: ACM SIGAPL APL Quote Quad (1998)

It is difficult today to think of machines of the early fifties. A vaguely recollected machine, which probably combines features of more than one real machine, had as memory a rotating drum. The instruction format included an operation code and four addresses. The first three addresses were not unusual: the locations of two operands and the result of the operation. The fourth address was the location of the next instruction. A programmer had to pick a spot on the drum that will be under the read head when the instruction finishes. It required a bit of ingenuity and lots of experimentation to get the most out machines from that era. The job was not made any easier by the fact the machines typically had about a thousand words of storage.It was not long before assemblers and compilers took over the job of managing machine operations. Programs were divided into two major sections: procedures and data. The small storage capacity raised a problem: to store all numbers with the same number of bits required a choice. If the word size was small, precision was limited; if large, relatively few numbers could be stored. A compromise was reached by storing numbers in several different formats that used more storage when greater precision was required. Data-types had arrived.It was to be a several years before the term polymorphism was applied in the computer field. An early use of the word is cited in the OED: "The various portraits of her majesty astonish by their perplexing polymorphism hellip;" [1839 Fraser's Mag. XX. 699].Compilers in the fifties required a set of declarations that preceded the executable code. The names of variables were classified into groups that specified the storage formats of their respective members. Different instruction sequences were needed to perform arithmetic on differently formatted numbers.Nonnumeric data was a category by itself. Before long nonnumeric subcategories, i. e., data-types, were recognized. Some of them formed nested sequences, just as the early numeric types --- bits, small integers, large integers, and floating point --- formed a natural sequence. The domain of a function was the set of data-types on which it could operate.A typical OOPS requires declaration of the data-types and functions that apply to them in a different way. Instead of considering functions and the data-types that they can accept, it considers data-types and the sets of functions that can use them. As in the case of FORTRAN, declarations must be complete before programming begins. The sets of functions could be thought of as function-types, although the term has been little used, if at all.No matter just how the information on data and function types were stored in the early computer and compiler days, and no matter whether they were stored with the CPU or on disk or drum, not many thought then about arrays of functions. The Michigan Algorithm Decoder (MAD), a compiler of the late fifties, is the only place I know of which supported indexed function name variables.
Speeding up MLP Execution through Difference Forward Propagation
Authors: Dario Albesano, Roberto Gemello, Franco Mana
Venue: Neural Processing Letters (1998)

At present the Multi-layer Perceptron model (MLP) is, without doubt, the most diffused neural network for applications. So, it is important, from an engineering point of view, to design and test methods to improve MLP efficiency at run time. This paper describes a simple but effective method to cut down execution time for MLP networks dealing with a sequential input. This case is very common, including all kinds of temporal processing, like speech, video, and in general signals varying in time. The suggested technique requires neither specialized hardware nor big quantities of additional memory. The method is based on the ubiquitous idea of difference transmission, widely used in signal coding. For each neuron, the activation value at a certain moment is compared with the corresponding activation value computed at the previous net forward computation: if no relevant change occurred the neuron does not perform any computation, otherwise it propagates to the connected neurons the difference of its two activations multiplied by its outgoing weights. The method requires the introduction of a quantization of the unit activation function that causes an error which is analyzed empirically. In particular, the effectiveness of the method is verified on two speech recognition tasks with two different neural networks architectures. The results show a drastic reduction of the execution time on both the neural architectures and no significant changes in recognition quality.
A Chip for Linearization of RF Power Amplifiers using Predistortion based on a Bit-Parallel Complex Multiplier
Authors: Pietro Andreani, Lars Sundström
Venue: Analog Integrated Circuits and Signal Processing (2000)

This paper presents a custom chip for linearization of RF power amplifiers using digital predistortion. The chip has been implemented in a standard digital 0.8 &mu;m CMOS process with standard static cells and single-phase clocking. A systolic complex multiplier based on distributed arithmetic constitutes the core of the chip. The nonlinear function is realized with a look-up table containing complex gain factors applied to the complex multiplier. Maximum clock frequency was found by means of simulation to be 105 MHz corresponding to 21 Msamples/s throughput with 3 W power consumption using 5 V supply voltage. The fabricated chip is fully functional and has been measured up to 60 MHz clock frequency with 825 mW power consumption with 3.3 V supply voltage. Operation at 1.5 V supply voltage allows 10 MHz clock frequency with 35 mW power consumption.
A Markov Pixon Information Approach for Low-Level Image Description
Authors: Xavier Descombes, Frithjof Kruggel
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1999)

The problem of extracting information from an image which corresponds to early stage processing in vision is addressed. We propose a new approach (the MPI approach) which simultaneously provides a restored image, a segmented image and a map which reflects the local scale for representing the information. Embedded in a Bayesian framework, this approach is based on an information prior, a pixon model and two Markovian priors. This model based approach is oriented to detect and analyze small parabolic patches in a noisy environment. The number of clusters and their parameters are not required for the segmentation process. The MPI approach is applied to the analysis of Statistical Parametric Maps obtained from fMRI experiments.
Efficient performance prediction for modern microprocessors
Authors: David Ofelt, John L. Hennessy
Venue: ACM SIGMETRICS Performance Evaluation Review (2000)

Generating an accurate estimate of the performance of a program on a given system is important to a large number of people. Computer architects, compiler writers, and developers all need insight into a machine's performance. There are a number of performance estimation techniques in use, from profile-based approaches to full machine simulation. This paper discusses a profile-based performance estimation technique that uses a lightweight instrumentation phase that runs in order number of dynamic instructions, followed by an analysis phase that runs in roughly order number of static instructions. This technique accurately predicts the performance of the core pipeline of a detailed out-of-order issue processor model while scheduling far fewer instructions than does full simulation. The difference between the predicted execution time and the time obtained from full simulation is only a few percent.
Shopping in the Healthcare Information Systems Market&mdash;A Search for Well-Camouflaged Land Mines
Authors: Ralph R. Grams
Venue: Journal of Medical Systems (1998)

The selection of a healthcare information system is analogous to a big game hunt. The buyers perceive themselves as the hunters while the truth is just the opposite. To strip away the carefully crafted facade of corporate marketing is an art form and requires due diligence on the part of the shopper. Suggestions are offered to the consumer on how to pierce the shell of corporate silence and find the facts that will make a significant difference in product selection. The objectives on the seller's side are to make as much profit as possible and give as little as required to make the sale. The buyer is looking for the best product, the best company, and the most painless installation. The ground between these two vastly different goals is the battlefield of healthcare computer procurement. May the best shopper win! Caveat emptor.
COFTA: Hardware-Software Co-Synthesis of Heterogeneous Distributed Embedded Systems for Low Overhead Fault Tolerance
Authors: Bharat P. Dave, Niraj K. Jha
Venue: IEEE Transactions on Computers (1999)

Embedded systems employed in critical applications demand high reliability and availability in addition to high performance. Hardware-software co-synthesis of an embedded system is the process of partitioning, mapping, and scheduling its specification into hardware and software modules to meet performance, cost, reliability, and availability goals. In this paper, we address the problem of hardware-software co-synthesis of fault-tolerant real-time heterogeneous distributed embedded systems. Fault detection capability is imparted to the embedded system by adding assertion and duplicate-and-compare tasks to the task graph specification prior to co-synthesis. The dependability (reliability and availability) of the architecture is evaluated during co-synthesis. Our algorithm, called COFTA (Co-synthesis Of Fault-Tolerant Architectures), allows the user to specify multiple types of assertions for each task. It uses the assertion or combination of assertions which achieves the required fault coverage without incurring too much overhead. We propose new methods to: 1) Perform fault tolerance based task clustering, which determines the best placement of assertion and duplicate-and-compare tasks, 2) Derive the best error recovery topology using a small number of extra processing elements, 3) Exploit multidimensional assertions, and 4) Share assertions to reduce the fault tolerance overhead. Our algorithm can tackle multirate systems commonly found in multimedia applications. Application of the proposed algorithm to a large number of real-life telecom transport system examples (the largest example consisting of 2,172 tasks) shows its efficacy. For fault-secure architectures, which just have fault detection capabilities, COFTA is able to achieve up to 48.8 percent and 25.6 percent savings in embedded system cost over architectures employing duplication and task-based fault tolerance techniques, respectively. The average cost overhead of COFTA fault-secure architectures over simplex architectures is only 7.3 percent. In case of fault-tolerant architectures, which cannot only detect but also tolerate faults, COFTA is able to achieve up to 63.1 percent and 23.8 percent savings in embedded system cost over architectures employing triple-modular redundancy, and task-based fault tolerance techniques, respectively. The average cost overhead of COFTA fault-tolerant architectures over simplex architectures is only 55.4 percent.
Fuzzy Temporal/Categorical Information in Diagnosis
Authors: Jacques Wainer, Sandra Sandri
Venue: Journal of Intelligent Information Systems (1999)

This paper proposes a way of incorporating fuzzy temporal reasoning within diagnostic reasoning. Disorders are described as an evolving set of necessary and possible manifestations. Ill-known moments in time, e.g., when a manifestation should start or end, are modeled by fuzzy intervals, which are also used to model the elapsed time between events, e.g., the beginning of a manifestation and its end. Patient information about the intensity and times in which manifestations started and ended are also modeled using fuzzy sets. The paper discusses many measures of consistency between the patient&lsquo;s data and the disorder model, and defines when the manifestations of the patient can be explained by a disorder. This work also discusses related issues such as the intensity of manifestations and the speed in which the disorder is evolving, given the patient&lsquo;s data, and how to use that information to make predictions about future and past events.
A case for end system multicast (keynote address)
Authors: Yang-hua Chu, Sanjay G. Rao, Hui Zhang
Venue: Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2000)

The conventional wisdom has been that IP is the natural protocol layer for implementing multicast related functionality. However, ten years after its initial proposal, IP Multicast is still plagued with concerns pertaining to scalability, network management, deployment and support for higher layer functionality such as error, flow and congestion control. In this paper, we explore an alternative architecture for small and sparse groups, where end systems implement all multicast related functionality including membership management and packet replication. We call such a scheme End System Multicast. This shifting of multicast support from routers to end systems has the potential to address most problems associated with IP Multicast. However, the key concern is the performance penalty associated with such a model. In particular, End System Multicast introduces duplicate packets on physical links and incurs larger end-to-end delay than IP Multicast. In this paper, we study this question in the context of the Narada protocol. In Narada, end systems self-organize into an overlay structure using a fully distributed protocol. In addition, Narada attempts to optimize the efficiency of the overlay based on end-to-end measurements. We present details of Narada and evaluate it using both simulation and Internet experiments. Preliminary results are encouraging. In most simulations and Internet experiments, the delay and bandwidth penalty are low. We believe the potential benefits of repartitioning multicast functionality between end systems and routers significantly outweigh the performance penalty incurred.
Maximum Likelihood Estimation Methods for Multispectral Random Field Image Models
Authors: Jesse Bennett, Alireza Khotanzad
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1999)

This work considers the problem of estimating parameters of multispectral random field (RF) image models using maximum likelihood (ML) methods. For images with an assumed Gaussian distribution, analytical results are developed for multispectral simultaneous autoregressive (MSAR) and Markov random field (MMRF) models which lead to practical procedures for calculating ML estimates. Although previous work has provided least squares methods for parameter estimation, the superiority of the ML method is evidenced by experimental results provided in this work. The effectiveness of multispectral RF models using ML estimates in modeling color texture images is also demonstrated.