Miracle-dz/UniFAR-FTUs huggingface dataset:
Secure and Robust Censorship-Resistant Publishing Systems

In many cases, censoring documents on the Internet is a fairly simple task. Almost any published document can be traced back to a specific host, and from there to an individual responsible for the material. Someone wishing to censor this material can use the courts, threats, or other means of intimidation to compel the relevant parties to delete the material or remove the host from the network. Even if these methods prove unsuccessful, various denial of service attacks can be launched against a host to make the document difficult or impossible to retrieve. Unless a host's operator has a strong interest in preserving a particular document, removing it is often the easiest course of action. A censorship-resistant publishing system allows an individual to publish a document in such a way that it is difficult, if not impossible, for an adversary to completely remove, or convincingly alter, a published document. One useful technique for ensuring document availability is to replicate the document widely on servers located throughout the world. However, replication alone does not block censorship. Replicas need to be protected from accidental or malicious corruption. In addition, a censorship-resistant publishing system needs to address a number of other important issues, including protecting the publisher's identity while simultaneously preventing storage flooding attacks by anonymous users. This dissertation presents the design and implementation of two very different censorship-resistant publishing systems. The first system. Publius, is a web based system that allows an individual to publish, update, delete and retrieve documents in a secure manner. Publius's main contributions include an automatic tamper checking mechanism, a method for updating or deleting anonymously published content and methods for publishing anonymously hyperlinked content. The second system, Tangler, is a peer-to-peer based system whose contributions include a unique publication mechanism and a dynamic self-policing network. The benefits of this new publication mechanism include the automatic replication of previously published content and an incentive to audit the reliability with which servers store content published by other people. In part through these incentives, the self-policing network identifies and ejects servers that exhibit faulty behaviour.
Extensive Reading Program Which Changes Reluctant Engineering Students into Autonomous Learners of English

This article introduces extensive reading (ER) as an approach to improve fundamental communication skills in English of reluctant EFL learners : average Japanese engineering students. It is distinct from concurrent translation approach from a perspective that the learners use English instead of Japanese to grasp the meaning of what they read and enjoy reading. In the ER program at Toyota National College of Technology, many students developed more positive attitude toward English, increased their reading speed, and achieved higher TOEIC scores, which was compared to those of the students before this ER program was introduced. Comparison between three groups of the students showed strong correlation between their TOEIC scores and the reading amount.
Fast Internet transmission of physiological signals using the lifting scheme and SPIHT coding algorithm

With the development of the information highway, the Internet is rapidly reaching major medical centers, peripheral hospitals and clinics, and the homes of physicians and patients. This connection provides a unique opportunity to transmit physiological data through the Internet for diagnosis, monitoring, and analysis by dedicated computers connected to the Internet. The efficient transmission of this type of data has become a significant problem. In this paper we present a multiresolution approach based on a powerful combination of the lifting scheme and the SPIHT coding algorithm. This approach enables the rate of transmission to be adapted to the receiving device so that the unnecessary portion of the data is never sent. It also allows a lossless transmission, and is capable of reconstructing essential waveforms of the data even when the network halts after a certain period of transmission.
Recursive and flat partitioning for VLSI circuit design

Circuit partitioning is a subproblem of the physical design phase and considered to be a very important tool for circuit layout. Recent work of Cong and Lim (1998) suggests that multi-way bi-partitioning is more effective than hierarchical bi-partitioning based on a recursive scheme, in addition to the limitation of recursive multi-way partitioners to minimize absorption cost metrics but not hyper-edge cost metrics. In this paper, we use a modified recursive multi-way partitioner to prove that hierarchical bi-partitioning is more effective than multi-way partitioning for both cost metrics. Results obtained indicate that hierarchical bi-partitioning obtains cutsize results that are on average 25% and 55% better than a multiway flat partitioning based on the hyper-edge and absorption costs, respectively. In addition, a combined hierarchical bi-partitioning followed by a multiway flat partitioning scheme improves results on average by 42% for the hyper-edge cost metric.
Heuristic evaluation applied to library web services

Purpose – The purpose of the paper is to present usability heuristics for the evaluation of public library web services.Design/methodology/approach – Heuristics for library services are based on Nielsen's classical list of heuristics and results of previous usability research of library web services. A total of 15 public library web sites were evaluated on the basis of these applied heuristics. One part of the study was supported through usability tests. The results of these studies were utilized to evaluate the applied heuristics.Findings – The applied heuristics are divided into three categories: heuristics critical from the usability viewpoint; heuristics concerning major problems; and heuristics connected to minor usability problems but still important and concerning conventions of web design. The use of the heuristics and the results they give are evaluated to provide a basis for their use in future.Research limitations/implications – The applied heuristics lists have been tested in two different stu.
IXP2400/2800 Programming: The Complete Microengine Coding Guide

From the Publisher: Software and firmware engineers developing products based on the Intel IXP2400 or IXP2800 network processors will find this guide to be an invaluable resource, whether they are new to programming Intel network processors or already familiar with the IXP1200 processor. Users will progress through a set of tasks typically faced by network software engineers, from basic receive and transmit operations to more complex packet processing. Each task is deconstructed, through working example code, into what the appropriate parts of the software and hardware can do and why it is important to the design and implementation. The various tradeoffs that are possible within the software and hardware are also fully analyzed. This coding guide progresses in steps from simple, single-threaded programs to a complete multithreaded reference application using the microblock programming paradigm. Application and programming notes are used throughout to accelerate the pace for readers already familiar with IXP1200 programming. Complete and working code examples from the book and the Intel IXA Software Developer's Kit are included on the CD-ROM. Author Biography: Eric J. Johnson and Aaron R. Kunze are senior network software engineers with Intel's research and development group. They designed and implemented the microACE architecture in the IXP12xx Software Development Kit, which helps software engineers create reusable packet-processing modules and combine them into network processor applications. They also designed reusable Quality of Service (QoS) components for use with Intel's network processor family. They are the coauthors of IXP1200 Programming. They live in Portland, Oregon.
A Benchmark for Comparing Different Approaches for Specifying and Verifying Real-Time Systems

Abstract : To be considered correct or useful, real-time systems must deliver results within specified time intervals, either without exception or with high probability. Recently, a large number of formal methods have been invented for specifying and verifying real-time systems. It has been suggested that these formal methods need to be tested out on actual real-time systems. Such testing will allow the scalability of the methods to be assessed and also will uncover new problems requiring a formal solution. However, before these methods can be productively applied to industrial systems, greater understanding is needed about how they compare (e.g., what classes of problems they are designed to solve, the availability of mechanical support, etc.). To provide insight into the utility of different methods for solving real-time problems, the authors have developed a generic version of a real-time railroad crossing system. Their plan is to use this example as a benchmark for comparing different formalisms. In this paper, the authors define the problem, describe three classes of formalisms that can be applied, and summarize efforts currently in progress to specify the system of interest and prove properties about its behavior.
Estimation of angles of arrivals of broadband signals

A high resolution one-step algorithm for estimating the angles of arrivals of multiple wideband sources is proposed. For a dense and equally spaced array structure, a bilinear transformation is utilized in frequency domain for coherent signal subspace processing. When compared with existing coherent approaches, the proposed algorithm is noniterative and does not need knowledge of initial estimates of the arrival angles. The performance of the algorithm is presented using simulated data.
Comparison of reconstruction accuracy of sparse recovery algorithms for gapped RCS data

This study evaluates and compares the reconstruction accuracy of sparse recovery algorithms (SRAs) when we reconstruct a two‐dimensional (2D) inverse synthetic aperture radar (ISAR) image from a gapped radar‐cross‐section (RCS) dataset. To analyze the influence of the gap on the reconstruction accuracy, we adopted a relative error (RE) in a 2D image domain, and evaluated the reconstruction accuracy of each method by calculating each RE value against the rate of missing data in the gap. The accuracy of the basis pursuit denoising method was better than that of other methods considered in this study, especially when we reconstructed the ISAR image from the gapped RCS dataset when signal‐to‐noise ratio was low. Consequently, the relaxed constraint rather than the strictly equality constraint for the SRA is more adequate for SRA applied to radar imaging. © 2015 Wiley Periodicals, Inc. Microwave Opt Technol Lett 57:1249–1255, 2015
Self-suppressed NACK-based multicast congestion control

We introduce SNMCC, a NACK-based multicast congestion control mechanism that suppress "unnecessary" NACks on the receiver side according to the congestion state measured by each receiver. Since SNMCC is not based on representatives to adjust its transmission rate, both salability and fairness of SNMCC are achieved by using this self-suppressed scheme. In addition, the two adaptive algorithms are developed to compensate the decrease of rate, as there are multiple bottleneck links in the session. We evaluate the design using simulation, and demonstrate that SNMCC is TCP-friendly, free from drop-to-zero problem and responsive efficiently to the variance of bandwidth and group member. In the meantime, we also investigate SNMCC's weaknesses and point out the future direction.
Catalogs, Indexes, and Full Text Databases

Abstract Persistent themes in modern librarianship have included the importance of online catalogs in recording local holdings, the ability of indexes to extend the subject and descriptive analysis of these catalogs, and the desirability of mainstreaming government publications with non-governmental literature. These themes have been reaffirmed, but in another sense challenged by recent developments in online public access catalogs (OPACs), commercial indexing services such as Lexis/Nexis, and government produced full text databases such as GPO Access. records in an OPAC centering on the use of direct links to online resources is one of the more concrete and practical forms of such integration. However, the required maintenance may not be a cost effective or desirable use of Staff time.
POTENTIAL OF HIGH-RESOLUTION SAR IMAGES FOR URBAN ANALYSIS

State-of-the-art airborne SAR sensors provide spatial resolution on the order of a decimetre. In such data, many features of urban objects can be identified, which were beyond the scope of radar remote sensing before. In this paper, the impact of high-resolution SAR data on the analysis of urban scenes is discussed. An example for the new quality of the appearance of buildings in such data is given and interpreted. The fine level of detail opens the opportunity to reconstruct the structure of man-made objects (e.g. buildings). First results of segmentations of salient roof and facade structures, which become visible in such kind of data, are presented. The topics geocoding and data fusion using different kinds of reference GIS data are addressed. In order to limit the computational load, a combined multi-scale SAR image processing and analysis is advantageous.
Research on Dynamic Data Streams Clustering Algorithm –Pdstream Based on PCA and Density

The research on data streams clustering has become a focus in the field of data streams mining. Because the number of data streams is too large, and CPU of the computer has limited memory and time, it’s difficult to carry out clustering quickly and effectively. For that problem, we design an improved clustering algorithm for dynamic data streams based on principal component analysis and density. The PDStream algorithm effectively overcomes the shortcomings of the STREAM algorithm controlled by historical data and the CluStream algorithm is difficult to describe non-spherical and out "old data", resulting in huge amount of data. In the course of the experiment, we compare with the STREAM algorithm, the PDStream algorithm shows the superiority of handling mass data and the characteristics of high-quality clustering.
Binary Hough transform and its implementation

The Binary Hough Transform (BHT) is a variation of the standard Hough transform for line detection with slope/intercept parameterization which, for image and accumulator arrays whose dimensions are integer powers of two, needs only additions and binary shifts during its calculation, allows full precision for the representation of the parameters and uses integer arithmetic without rounding errors. This paper presents the BHT and its implementation in hardware (two systolic array architectures and their combination) and software (a sequential algorithm).
A Novel System for Repair Guidance Using Augmented Reality

The daily life of a common man revolves around various forms of appliances/gadgets he uses throughout the day such as a mobile phone, laptop, printer, microwave oven, washing machine, etc. Although these appliances/gadgets are taken by most of the people for granted, the problem occurs when any of these things do not work as they are expected to. Getting them to the repair shops for every small glitch is expensive as well as time consuming. Although most of the companies which produce these appliances/gadgets do supply them with basic manuals, which deal with how to solve these minor issues, but reading them and at the same time repairing the corresponding appliance/gadget can be a frustrating task at times. These problems can be reduced to a large extent if some kind of live guidance is available. In this paper we propose a method to do so with the help of an augmented reality based system that will guide the user to carry out small scale repair jobs on these gadgets. All that is required is a decent webcam and a computing device, with a processor of 1 GHz or more and a display screen.
Finite state transducers: parsing free and frozen sentences

Accurately parsing natural language sentences requires very large scale lexical grammars. Rules of such grammars can roughly be classiied as \free" or "frozen" according to the variability of the arguments, e.g. complements. For instance , a rule describing a sentence like John eats potatoes would be called free whereas a rule describing a sentence like John kicks the bucket would be called frozen. Usually, grammar representations describe frozen rules as a particular case of free ones and assume that they can be treated as exceptions. Finite-state transducers not only give simple and ef-cient parsing strategies for very large scale grammars but that they also provide a natural and uniied way of handling sentences in which free and frozen components are mixed in a complex manner. In language processing, nite-state models are not a lesser evil that bring simplicity and eeciency at the cost of accuracy. On the contrary they provide a very natural framework to describe complex linguistic phenomena.
Research on Moving Vehicle Detection and Tracking Algorithm Based on Video Image

Based on the computer vision technology and the digital image processing technology, the video moving vehicle detection and tracking algorithm is made to be on research; with the base of each characters of the background difference method and the inter-frame difference method, a revised comprehensive difference method is used, and combined with the special traffic video background, a background updating method revised from Surrender Algorithm is proposed. The moving object tracking algorithm based on matching matrix is explained to focus on the problem of failure of tracking moving objects when each of them are kept out. The application of software demonstrates that the method cited in this paper proves to be right and feasible and meet the need of highway operation monitor.
Compensation of motion related blur in CCD color endoscope images

Color CCD endoscopes with sequential three color illuminations have the advantage of a high resolution but are sensitive to object motion. A digital method for the restoration of color-shifted images is proposed. The method makes use of phase-only matching followed by a resampling operation to compensate for a space-variant shift between different primary color images. Restored images are suitable for further image processing such as color emphasis and structure enhancement.
Multisensory Integrated Expressive Environments: Toward a Paradigm for Multimodal and Distributed Environments for the Performing Arts and New Media

This article introduces Multisensory Integrated Expressive Environments (MIEEs) as a framework for distributed active mixed reality environments for the performing arts, and discusses the structure of MIEEs and their global properties. Extended Multimodal Environments (EMEs) are introduced as basic components and described in detail, mainly with reference to what they contain – real and virtual objects, and real and virtual subjects. EMEs are then connected together into a network of spaces enabling geographically distributed performances. The concept of “active EMEs” is finally employed to introduce MIEEs as a hierarchical structure of metaspaces conceived as virtual subjects collaborating in achieving the overall narrative or aesthetic goal of the performance. Some examples of EMEs and MIEEs are also discussed.
On Delayed Choice Execution for Falsification

We present an approach for finding errors in programs and specifications. We formulate our approach as an execution mechanism for a non-deterministic guarded-command language. Guarded commands have already proved useful for verification-condition generation but are usually viewed as a non-executable representation. We show how to execute guarded commands using an explicit-state model checker. We illustrate the benefits of this approach in two related domains: bounded-exhaustive testing and falsification for Hoare triples. The basis of our approach is the delayed-choice technique for improving the execution of guarded commands. Delayed choice postpones non-deterministic choice of values until they are used. Our approach also supports copy-propagation of symbolic values but avoids the cost of full-blown symbolic execution. We describe an implementation of our approach in Java PathFinder, a popular model checker for Java programs. Our experimental results show that our techniques significantly improve performance compared to the current execution strategy in Java Pathfinder.
Spatial Regression Models

Preface Chapter 1: Introduction Interaction and Social Science Democracy Around the World Introducing Spatial Dependence Maps as Visual Displays of Data Measuring Spatial Association and Correlation Measuring Proximity Estimating Spatial Models Summary Chapter 2: Spatially Lagged Dependent Variables Regression with Spatially Lagged Dependent Variables Estimating the Spatially Lagged y Model Maximum Likelihood Estimates of the Spatially Lagged Y Model of Democracy Equilibrium Effects in the Spatially Lagged y Model Spatial Dependence in Turnout in Italy Using Different Weights Matrices in a Spatially Lagged Dependent Variable Model The Spatially Lagged Dependent Variable Versus OLS with Dummy Variables Summary Chapter 3: Spatial Error Model The Spatial Error Model Maximum Likelihood Estimation of the Spatial Errors Model Example: Democracy and Development Spatially Lagged y Versus Spatial Errors Assessing Spatial Error in Dyadic Trade Flows Summary Chapter 4: Extensions Specifying Connectivities Inference and Model Evaluation Summary Appendix: Software Options References
Numerical simulations of wake structure generated by rotating blades using a time marching, free vortex blob method

Vorticity fields in the wake generated by rotating blades are calculated using a time accurate, free vortex blob method without a non physical model of the far wake. The computed free wake geometry of single rotor in hover is represented by the three wake regions: well defined tip vortex region, intermediate entangled region, and initially generated wake bundle. The air loads and simulated wake geometries in the radial and axial directions agree well with those obtained using a prescribed wake method for a one blade rotor, and with the experimental data for a two blade rotor. This agreement can be obtained with the correct initial condition of a slowly rotating blade instead of an impulsively rotating blade. The wake geometry and unsteady air loads of helicopter rotor in forward flight is also calculated in forward flight. The rotor blade and wake interaction is critical to vibration and noise problem of the helicopter. Because the computational time of the free vortex blob method is proportional to the square of the element number, the reduction method of computational time is also considered.
Onlining queer acts: Digital research ethics and caring for risky archives

This essay considers how the current compulsion to digital reproduction – the urge to digitize, network, and online previously not-online materials – offers researchers of and within queer circuits the opportunity to defamiliarize and denaturalize our participation in academic systems of exploitation and to reorient our work towards decolonizing research economies, habits, protocols, and relationships. It takes the Cabaret Commons, the authors’ speculative digital archive of and for trans- feminist and queer (TFQ) grassroots performance scenes in Canada, Mexico, and the United States, as its point of departure. The authors frame TFQ performance and party scenes as negotiated intimacies, cultivating ethics of vulnerability and risk, which operate within and as networked intimate publics. Reading across decolonial, queer, feminist, and trans- ethics and methods, this essay revisits the value of ephemerality, of strategic evaporation, non-storage, and forgetting in online research contexts.