1,721,300 research outputs found
The Brownian Web: Convergence and Characterisation
No full textThe Brownian web (BW) is the random network formally consisting of the paths of coalescing one-dimensional Brownian motions starting from every space-time point in ?×?. We extend the earlier work of Arratia and of Tóth and Werner by providing a new characterization which is then used to obtain convergence results for the BW distribution, including convergence of the system of all coalescing random walks to the BW under diffusive space-time scaling
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
An experiment using factor graph for early attack detection
Full text linkThis paper presents a factor graph based framework (named AttackTagger) for high
accuracy and preemptive detection of attacks. We use security logs of
real-incidents that occurred over a six-year period at the National Center for
Supercomputing Applications (NCSA) at the University of Illinois to evaluate
AttackTagger. Our data consist of attacks that led directly to the target system
being compromised, i.e., not detected in advance, either by the security
analysts or by intrusion detection systems. AttackTagger can detect 74 percent
of attacks before the system misuse. AttackTagger uncovered six hidden attacks
that were not detected by security analysts.Submission published under a 24 month embargo labeled 'U of I only', the embargo will last until 2017-05-01The student, Phuong Cao, accepted the attached license on 2015-01-20 at 10:18.The student, Phuong Cao, submitted this Thesis for approval on 2015-01-20 at 10:35.This Thesis was approved for publication on 2015-01-23 at 15:27.DSpace SAF Submission Ingestion Package generated from Vireo submission #7689 on 2015-07-22 at 14:16:28Made available in DSpace on 2015-07-22T22:32:41Z (GMT). No. of bitstreams: 2
cao_phuong123.pdf: 622872 bytes, checksum: 8c07b075e3b86bafb1744a1bef0d2d54 (MD5)
license.txt: 4057 bytes, checksum: 08fe4bafa3625f947e1aacf6a4333a9e (MD5)
Previous issue date: 2015-01-23Embargo set by: Seth Robbins for item 79820
Lift date: 2017-07-22T22:34:16Z
Reason: Author requested U of Illinois access only (OA after 2yrs) in Vireo ETD systemU of I Only Restriction Lifted for Item 79820 on 2017-07-23T09:15:21Z
Improving Log-Based Field Failure Data Analysis of Multi-Node Computing Systems
No full textLog-based Field Failure Data Analysis (FFDA) is a widely-adopted methodology to assess dependability properties of an operational system. A key step in FFDA is filtering out entries that are not useful and redundant error entries from the log. The latter is challenging: a fault, once triggered, can generate multiple errors that propagate within the system. Grouping the error entries related to the same fault manifestation is crucial to obtain realistic measurements. This paper deals with the issues of the tuple heuristic, used to group the error entries in the log, in multi-node computing systems. We demonstrate that the tuple heuristic can group entries incorrectly; thus, an improved heuristic that adopts statistical indicators is proposed. We assess the impact of inaccurate grouping on dependability measurements by comparing the results obtained with both the heuristics. The analysis encompasses the log of the Mercury cluster at the National Center for Supercomputing Applications
Variations on the Author
Full text link“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Appropriate Similarity Measures for Author Cocitation Analysis
Full text linkWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
Fault sensitivity and wear-out analysis of VLSI systems
No full textThis thesis describes simulation approaches to conduct fault sensitivity and wear-out failure analysis of VLSI systems. A fault-injection approach to study transient impact in VLSI systems is developed. Through simulated fault injection at the device level and subsequent fault propagation at the gate, functional and software levels, it is possible to identify critical bottlenecks in dependability. Techniques to speed up the fault simulation and to perform statistical analysis of fault impact are developed. A wear-out simulation environment is also developed to closely mimic dynamic sequences of wear-out events in a device through time, to localize weak location/aspect of target chip and to allow generation of Time-to-Failure (TTF) distribution of a VLSI chip as whole. First, an accurate simulation of a target chip and its application code is performed to acquire real workload trace data on switch activity. Then, using this switch activity information, wear-out of the each component of the chip is simulated using Monte Carlo techniques.Made available in DSpace on 2011-05-07T11:55:45Z (GMT). No. of bitstreams: 2
license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5)
9512332.pdf: 5368522 bytes, checksum: 14cf273cc19173550bce7b08caa72f48 (MD5)
Previous issue date: 1994Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding ([email protected]) on 2011-05-07T14:34:23Z
Item is restricted indefinitely.Restriction data tranferred 2014-07-01T11:13:06-05:00
Original Data
Group with Access UIUC Users [automated]
Release Date: none
Reason: ETDs are only available to UIUC Users without author permissionETDs are only available to UIUC Users without author permissionU of I Onl
Measurement and evaluation of multimedia I/O performance
No full textI/O is becoming the bottleneck in computer systems as the disparity between the speed of the I/O system and the CPU continues to grow. This research addresses the performance evaluation of I/O, with special emphasis on multimedia workstation-class systems. First, multimedia I/O activity is shown to be bursty with correlation across multiple device types (such as video, network, and disk). Second, several novel instrumentation and measurement techniques are developed to allow accurate measurement and analysis of multimedia I/O activity. Third, an I/O resource contention model is created that incorporates measurements of I/O device interaction. Fourth, the I/O signature is developed as a technique for evaluating and predicting application I/O performance. Fifth, a multimedia benchmark and multimedia benchmarking tool are constructed to allow quantitative comparison of I/O performance on different machines at several levels of detail. Sixth, the techniques for instrumentation, measurement, and analysis are incorporated into a single tool called Priority, providing automatic, flexible evaluation of I/O, with unique capabilities for evaluating multimedia systems.Made available in DSpace on 2011-05-07T13:51:37Z (GMT). No. of bitstreams: 2
license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5)
9624524.pdf: 7922156 bytes, checksum: da080789c11af13e6e9f07bdb4cf9c44 (MD5)
Previous issue date: 1995Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding ([email protected]) on 2011-05-07T15:00:01Z
Item is restricted indefinitely.Restriction data tranferred 2014-07-01T11:28:22-05:00
Original Data
Group with Access UIUC Users [automated]
Release Date: none
Reason: ETDs are only available to UIUC Users without author permissionETDs are only available to UIUC Users without author permissionU of I Onl
- …
