Miracle-dz/UniFAR-FTUs huggingface dataset:
Modern Tools for Old Content - in Search of Named Entities in a Finnish OCRed Historical Newspaper Collection 1771-1910

Named entity recognition (NER), search, classification and tagging of names and name like frequent informational elements in texts, has become a standard information extraction procedure for textual data. NER has been applied to many types of texts and different types of entities: newspapers, fiction, historical records, persons, locations, chemical compounds, protein families, animals etc. In general a NER system’s performance is genre and domain dependent and also used entity categories vary [1]. The most general set of named entities is usually some version of three partite categorization of locations, persons and organizations. In this paper we report first trials and evaluation of NER with data out of a digitized Finnish historical newspaper collection Digi. Digi collection contains 1,960,921 pages of newspaper material from years 1771– 1910 both in Finnish and Swedish. We use only material of Finnish documents in our evaluation. The OCRed newspaper collection has lots of OCR errors; its estimated word level correctness is about 74–75 % [2]. Our principal NER tag-ger is a rule-based tagger of Finnish, FiNER, provided by the FIN-CLARIN consortium. We show also results of limited category semantic tagging with tools of the Semantic Computing Research Group (SeCo) of the Aalto University. FiNER is able to achieve up to 60.0 F-score with named entities in the evaluation data. Seco’s tools achieve 30.0–60.0 F-score with locations and persons . Performance of FiNER and SeCo’s tools with the data shows that at best about half of named entities can be recognized even in a quite erroneous OCRed text.
Lyrebird - Assigning Meanings to Machines

This paper presents work in progress on the Lyrebird framework, consisting of a language for specifying the programmer-visible behaviour of a processor and its associated devices, a tool for automatically producing a fast simulator, and a formal semantic interpretation providing a machine model for use in an interactive theorem prover. Machine specifications are modular, providing abstract interfaces and structural parameterization (MMU-less processors, for example). Also presented is a specific example: An instantiation for the ARM1136jf-s core.
The co-evolutionary dynamics of IS engagement

In this paper we consider the co-evolutionary dynamics of IS engagement where episodic change of implementation increasingly occurs within the context of linkages and interdependencies between systems and processes within and across organisations. Although there are many theories that interpret the various motors of change be it lifecycle, teleological, dialectic or evolutionary, our paper attempts to move towards a unifying view of change by studying co-evolutionary dynamics from a complex systems perspective. To understand how systems and organisations co-evolve in practice and how order emerges, or fails to emerge, we adopt complex adaptive systems theory to incorporate evolutionary and teleological motors, and actor-network theory to incorporate dialectic motors. We illustrate this through the analysis of the implementation of a novel academic scheduling system at a large research-intensive Australian university.
Perlecan and Dystroglycan act at the basal side of the Drosophila follicular epithelium to maintain epithelial organization

Dystroglycan (Dg) is a widely expressed extracellular matrix (ECM) receptor required for muscle viability, synaptogenesis, basementmembrane formation and epithelial development. As an integral component of the Dystrophin-associated glycoprotein complex, Dg plays a central role in linking the ECM and the cytoskeleton. Disruption of this linkage in skeletal muscle leads to various types of muscular dystrophies. In epithelial cells, reduced expression of Dg is associated with increased invasiveness of cancer cells. We have previously shown that Dg is required for epithelial cell polarity in Drosophila, but the mechanisms of this polarizing activity and upstream/downstream components are largely unknown. Using the Drosophila follicle-cell epithelium (FCE) as a model system, we show that the ECM molecule Perlecan (Pcan) is required for maintenance of epithelial-cell polarity. Follicle cells that lack Pcan develop polarity defects similar to those of Dg mutant cells. Furthermore, Dg depends on Pcan but not on Laminin A for its localization in the basal-cell membrane, and the two proteins bind in vitro. Interestingly, the Dg form that interacts with Pcan in the FCE lacks the mucin-like domain, which is thought to be essential for Dg ligand binding activity. Finally, we describe two examples of how Dg promotes the differentiation of the basal membrane domain: (1) by recruiting/anchoring the cytoplasmic protein Dystrophin; and (2) by excluding the transmembrane protein Neurexin. We suggest that the interaction of Pcan and Dg at the basal side of the epithelium promotes basal membrane differentiation and is required for maintenance of cell polarity in the FCE.
ANALYSIS OF SECURITY ISSUES OF MOBILE WIMAX 802 . 16 E AND THEIR SOLUTIONS

This paper examines threats to the security of the Mobile WiMax/ 802.16e broadband wireless access technology. Threats associated with the physical layer and MAC layer are reviewed in detail. Threats are listed and ranked according to the level of risk they represent. This review work can be used to prioritize future research directions in Mobile WiMax/802.16e security.
The interrelation of HIV, cervical human papillomavirus, and neoplasia among antenatal clinic attenders in Tanzania

Objectives: To determine the prevalence and interrelation of cervical human papillomavirus (HPV) genotypes, squamous intraepithelial lesions (SIL), HIV, and other reproductive tract infections (RTIs) among urban antenatal clinic attenders in Mwanza, Tanzania. Methods: Genital swabs were collected from 660 pregnant women and tested for a range of RTIs and for cervical cytology. Cervical HPV-DNA was detected by PCR and genotyped. HIV and syphilis serologies were performed. Results: HPV prevalence was 34% (209/612 women). Of the 144 typeable samples, 83% were high risk (HR-HPV) oncogenic strains (56% HPV 16 related types). SIL was detected in 43 women (7%), with high grade SIL in 3%. There was a high prevalence of HIV (15%), and of any RTI (83%). Genital warts were detected in 20 women (3%). HPV infection was associated with some behavioural factors (short duration of relationship, single status, not using condoms) and gonorrhoea. There was no overall association between HPV and HIV (OR=1.02, 95% CI 0.6–1.6), but a non-significant trend towards a stronger association with HR-HPV in women aged 15–19 (OR=2.79, 95% CI 0.8–9.5) and women aged ≥30 (OR=3.20, 95% CI 0.7–15). SIL was associated with HPV (OR=3.66, 95% CI 1.9–7.0), but not significantly with HIV (OR=1.54, 95% CI 0.7–3.4). Prevalence of SIL was higher among women dually positive for HPV/HIV compared to HPV infection only (21% v 12%), although this difference was not statistically significant (p=0.17). Conclusions: HPV infection was highly prevalent in this young antenatal population. The association of HIV with HR-HPV types in older women may suggest that the principal HIV/HPV interaction in this population is for HIV to upregulate HPV persistence, leading to subsequent development of SIL.
Cryptographic API for Embedded Applications

This paper presents GEmSysC, an unified cryptographic API for embedded systems. Software layers implementing this API can be built over existing libraries, allowing embedded software to access cryptographic functions in a consistent way that does not depend on the underlying library. The API complies to good practices for API design and good practices for embedded software development and took its inspiration from other cryptographic libraries and standards. The main inspiration for creating GEmSysC was the CMSIS-RTOS standard, which defines an unified API for embedded software in a implementation-independent way, but targets operating systems instead of cryptographic functions. GEmSysC is made of a generic core and attachable modules, one for each cryptographic algorithm. Until now, three modules were been fully specified: AES, RSA, and SHA-256. As a proof of concept, two implementations of GEmSysC were made. One of them was built over wolfSSL, which is an open source library for embedded systems. The other was built over OpenSSL, which is open source and a de facto standard. Unlike wolfSSL, OpenSSL does not specifically target embedded systems. This paper displays test results showing GEmSysC to be simpler than other libraries in some aspects. These results have shown that both implementations incur in little overhead in computation time compared to the cryptographic libraries themselves. The overhead of the implementation has been measured for each cryptographic algorithm and is between around 0% and 0.17% for the implementation over wolfSSL and between 0.03% and 1.40% for the one over OpenSSL. This document also presents the memory costs for each implementation.
Lower bounds for the signature size of incremental schemes

We show lower bounds for the signature size of incremental schemes which are secure against substitution attacks and support single block replacement. We prove that for documents of n blocks such schemes produce signatures of /spl Omega/(n/sup 1/(2+c)/) bits for any constant c>0. For schemes accessing only a single block resp. A constant number of blocks for each replacement this bound can be raised to /spl Omega/(n) resp. /spl Omega/(/spl radic/n). Additionally, we show that our technique yields a new lower bound for memory checkers.
Automated Dynamic Resource Provisioning and Monitoring in Virtualized Large-Scale Datacenter

Infrastructure as a Service (IaaS) is a pay-as-you go based cloud provision model which on demand outsources the physical servers, guest virtual machine (VM) instances, storage resources, and networking connections. This article reports the design and development of our proposed innovative symbiotic simulation based system to support the automated management of IaaS-based distributed virtualized data enter. To make the ideas work in practice, we have implemented an Open Stack based open source cloud computing platform. A smart benchmarking application "Cloud Rapid Experimentation and Analysis Tool (aka CBTool)" is utilized to mark the resource allocation potential of our test cloud system. The real-time benchmarking metrics of cloud are fed to a distributed multi-agent based intelligence middleware layer. To optimally control the dynamic operation of prototype data enter, we predefine some custom policies for VM provisioning and application performance profiling within a versatile cloud modeling and simulation toolkit "CloudSim". Both tools for our prototypes' implementation can scale up to thousands of VMs, therefore, our devised mechanism is highly scalable and flexibly be interpolated at large-scale level. Autonomic characteristics of agents aid in streamlining symbiosis among the simulation system and IaaS cloud in a closed feedback control loop. The practical worth and applicability of the multiagent-based technology lies in the fact that this technique is inherently scalable hence can efficiently be implemented within the complex cloud computing environment. To demonstrate the efficacy of our approach, we have deployed an intelligible lightweight representative scenario in the context of monitoring and provisioning virtual machines within the test-bed. Experimental results indicate notable improvement in the resource provision profile of virtualized data enter on incorporating our proposed strategy.
Constructing Visualizations with InfoVis Tools - An Evaluation from a user Perspective

Several information visualization toolkits and tools have been developed to facilitate users work. However, evaluation studies for these toolkits and tools from a user perspective have been overlooked. In this paper, we evaluate 13 information visualization toolkits and tools developed in the last 10 years from a user perspective. For each user type (novice, savvy and expert), we investigated the toolkits and tools using 5 dimensions. This study shows that tools for savvy users—users with basic programming skills and domain knowledge— are lacking, and these users should be supported with more tools to construct advanced visualizations. We outline our approach to how savvy users can be engaged more in the development process and construct advanced visualizations. Information visualization community should focus more on moving the boundary of constructing advanced visualizations from expert users towards savvy users.
Path Tail Emulation: An Approach to Enable End-to-End Congestion Control for Split Connections and Performance Enhancing Proxies

Wide area mobile networks facilitate TCP/IP with radio link protocols (RLP) in order to achieve acceptable throughput. Varying channel properties, roaming etc. which interfere with the TCP retransmission and congestion control mechanisms can be alleviated by split connection techniques and performance enhancing proxies (PEP). However, current split connection techniques and PEP do not sufficiently maintain end–to–end congestion control and rate control. Flow control and window clamping techniques, which are often used for this purpose, do not solve but work around the problem and undermine TCP’s sliding window mechanism. In this paper we propose the concept of Path Tail Emulation to overcome this weakness. A TCP flow is split at the gateway from the Internet into the mobile network. The mobile network is then hidden behind an emulated loss free link, the bandwidth and capacity of which correspond to the mobile network’s properties. Using Path Tail Emulation, congestion control and acknowledgement pacing is done exactly the same way as in pure wirebound networks, thus TCP can fully exploit the available network capacity without suffering from any adverse interaction with lower layers. The behaviour of a mobile network behind a PEP using Path Tail Emulation is reduced to a network which is compliant to the network model used for TCP in wirebound networks and therefore can be handled with well known and well proven techniques.
Fracture toughness of locust cuticle

SUMMARY Insect cuticle is one of the most common biological materials, yet very little is known about its mechanical properties. Many parts of the insect exoskeleton, such as the jumping legs of locusts, have to withstand high and repeated loading without failure. This paper presents the first measurements of fracture toughness for insect cuticle using a standard engineering approach. Our results show that the fracture toughness of cuticle in locust hind legs is 4.12 MPa m1/2 and decreases with desiccation of the cuticle. Stiffness and strength of the tibia cuticle were measured using buckling and cantilever bending and increased with desiccation. A combination of the cuticle’s high toughness with a relatively low stiffness of 3.05 GPa results in a work of fracture of 5.56 kJ m–2, which is amongst the highest of any biological material, giving the insect leg an exceptional ability to tolerate defects such as cracks and damage. Interestingly, insect cuticle achieves these unique properties without using reinforcement by a mineral phase, which is often found in other biological composite materials. These findings thus might inspire the development of new biomimetic composite materials.
A qualitative study : community nurses' experience of organizational trust

ii PREFACE . iv TABLE OF CONTENTS . v ACKNOWLEDGEMENTS . viii CHAPTER 1: PRESENTING THE ISSUE . 1 Problem Statement . 4 Purpose . 4 Research Questions . 5 Situating Myself in the Work . 5 Definition of Terms . 5 Summary . 6 CHAPTER 2: LITERATURE REVIEW . 8 Search Strategy . 8 Factors that Influence Organizational Trust . 9 Organizational Trust, Change, Job Satisfaction, and Retention. 9 Organizational Trust, Nurse-leader Interactions, and Relationships. 12 Organizational Trust, Leadership Style, and Job Satisfaction. 15 Summary . 17 CHAPTER 3: RESEARCH METHODS . 20 Methodology . 20 Sampling Plan . 21 Recruitment Strategies . 22 Data Collection Procedures . 23 Data Analysis . 23 Ethical Considerations. 25 Ensuring Scientific Quality . 26 CHAPTER 4: FINDINGS . 29 Introduction . 29 Situating the Participants . 29
Small-Area Analysis of Incidence and Localisation of Vulvar Cancer

Objective. Vulvar cancer is a rare disease mainly in older women. HPV and non-HPV induced vulvar cancer reflect two types of oncogenesis. Controversies exist on most recent developments in vulvar cancer incidence, patients, and disease characteristics. Changes in incidence, age of disease onset, and tumor site in women treated for primary vulvar cancer in a single German university hospital unit will be described. Methods. A retrospective analysis of patient records of women treated between 1994 and 2008 was performed. The fifteen-year-spanning period was divided into three five year-spanning cohorts. Descriptive and statistical analyses were performed. Results. 104 patients were identified: cohort-1 from 1994 to 1998 (11 patients); cohort-2 from 1999 to 2003 (21 patients); cohort-3 from 2004 to 2008 (72 patients). Mean age (years) was 73.18 (confidence interval (CI): 64.04; 82.33), 58.9 (CI: 52.24; 65.57), and 61.19 (CI: 57.27; 65.12), respectively. Vulvar cancer confined to the region between clitoris and urethra was seen more often in cohort-3 (n = 20) compared to cohort-1 (n = 0) or cohort-2 (n = 1). Conclusion. This analysis supports the notion of rising incidence of vulvar cancer and a changing pattern of anatomical local extension. Disease onset is not restricted to older women.
Two Counterexamples Concerning the Scott Topology on a Partial Order

We construct a complete lattice $Z$ such that the binary supremum function $\sup:Z\times Z\to Z$ is discontinuous with respect to the product topology on $Z\times Z$ of the Scott topologies on each copy of $Z$. In addition, we show that bounded completeness of a complete lattice $Z$ is in general not inherited by the dcpo $C(X,Z)$ of continuous functions from $X$ to $Z$ where $X$ may be any topological space and where on $Z$ the Scott topology is considered.
Labeling the Regions of the Type Cn Shi Arrangement

The number of regions of the type $C_n$ Shi arrangement in $\mathbb{R}^n$ is $(2n+1)^n$. Strikingly, no bijective proof of this fact has been given thus far. The aim of this paper is to provide such a bijection and use it to prove more refined results. We construct a bijection between the regions of the type $C_n$ Shi arrangement in $\mathbb{R}^n$ and sequences $a_1a_2 \ldots a_n$, where $a_i \in \{-n, -n+1, \ldots, -1, 0, 1, \ldots, n-1, n\}$, $ i \in [n]$. Our bijection naturally restrict to bijections between special regions of the arrangement and sequences with a given number of distinct elements.
CT Radiation Dose Optimization and Estimation: an Update for Radiologists

In keeping with the increasing utilization of CT examinations, the greater concern about radiation hazards from examinations has been addressed. In this regard, CT radiation dose optimization has been given a great deal of attention by radiologists, referring physicians, technologists, and physicists. Dose-saving strategies are continuously evolving in terms of imaging techniques as well as dose management. Consequently, regular updates of this issue are necessary especially for radiologists who play a pivotal role in this activity. This review article will provide an update on how we can optimize CT dose in order to maximize the benefit-to-risk ratio of this clinically useful diagnostic imaging method.
Factoids : Automatically constructing and administering vocabulary assistance and assessment

We address an important problem with a novel approach: helping children learn words during computer-assisted oral reading. We build on Project LISTEN's Reading Tutor, which is a computer program that adapts automatic speech recognition to listen to children read aloud, and helps them learn to read (http://www.cs.cmu.edu/~listen). In this paper, we focus on the problem of vocabulary acquisition. To learn a word from reading with the Reading Tutor, students must first encounter the word and then learn the meaning of the word from context. This paper describes how we modified the Reading Tutor to help students learn the meanings of new words by augmenting stories with WordNet-derived comparisons to other words – “factoids”. Furthermore, we report results from an embedded experiment designed to evaluate the effectiveness of including factoids in stories that children read with the Reading Tutor. Factoids helped – not for all students and all words, but for third graders seeing rare words, and for singlesense rare words tested one or two days later.
StraightTaint: Decoupled offline symbolic taint analysis

Taint analysis has been widely applied in ex post facto security applications, such as attack provenance investigation, computer forensic analysis, and reverse engineering. Unfortunately, the high runtime overhead imposed by dynamic taint analysis makes it impractical in many scenarios. The key obstacle is the strict coupling of program execution and taint tracking logic code. To alleviate this performance bottleneck, recent work seeks to offload taint analysis from program execution and run it on a spare core or a different CPU. However, since the taint analysis has heavy data and control dependencies on the program execution, the massive data in recording and transformation overshadow the benefit of decoupling. In this paper, we propose a novel technique to allow very lightweight logging, resulting in much lower execution slowdown, while still permitting us to perform full-featured offline taint analysis. We develop StraightTaint, a hybrid taint analysis tool that completely decouples the program execution and taint analysis. StraightTaint relies on very lightweight logging of the execution information to reconstruct a straight-line code, enabling an offline symbolic taint analysis without frequent data communication with the application. While StraightTaint does not log complete runtime or input values, it is able to precisely identify the causal relationships between sources and sinks, for example. Compared with traditional dynamic taint analysis tools, StraightTaint has much lower application runtime overhead.