Miracle-dz/UniFAR-FTUs huggingface dataset:
Improvement of Security in UAS Communication and Navigation using ADS-B

III ACKNOWLEDGEMENTS . IV TABLE OF CONTENTS . V LIST OF TABLES . VIII LIST OF FIGURES . IX LIST OF ABBREVIATIONS . X CHAPTER 1: INTRODUCTION . 1 Types of UAS . 1 UAS Applications . 3 Motivation . 3 CHAPTER 2: SECURITY IN UAS COMMUNICATION . 5 Communication between UAS and Ground control station (GCS) . 5 2.1. 1. Availability . 8 2.1. 2. Confidentiality . 8 2.1. 3. Integrity . 8 Communication between UAS and air traffic control center (ATC) . 8 UAS Intercommunication . 9 2.3.1. High Altitude Platforms (HAPs) . 9 2.3.2. Flying Ad Hoc Networks(FANET’s). 10 vi 2.3.3. Mobile Ad-hoc Wireless Networks (MANET’s) . 12 2.3. 4. Unmanned Aerial System-Collaboration Wireless Network(UAS-CWN). 15 CHAPTER 3: SECURITY IN UAS NAVIGATION . 17 Global Positioning System (GPS). 17 3.1. 1. Security in GPS . 18 3.1. 2. GPS Spoofing. 20 3.1. 3. GPS and INS sensor fusion . 23 Traditional Radar system . 25 3.2.1. Security in Radar Systems . 27 3.2. 2. Radar Fusion with ADS-B . 28 Collision Avoidance . 30 3.3.1. FLARM . 30 3.3.2. Portable Collision Avoidance System(PCAS) and Traffic Collision Avoidance System (TCAS) . 30 CHAPTER 4: AUTOMATIC DEPENDENT SURVEILLANCE – BROADCAST (ADS-B) 32 Birth of ADS-B . 33 4.1. 1. ADS-B Out. 34 4.1. 2. ADS-B In . 34 4.1. 3. Traffic Information Services Broadcast (TIS-B) . 34 4.1. 4. Flight Information Service – Broadcast (FIS-B) . 35
On the complexity of the view-selection problem

A commonly used and powerful technique for improving query response time over very large databases is to precompute (‘Lmaterialize”) frequently’ asked queries (“views”). The problem is to select an appropriate set of views, given a limited amount of resources. Harinarayan, Rajaraman and Ullman formalized this technique by proposing a framework in which queries are modeled by a weighted partial order, and selecting a set of views whose materialization minimizes the average query response time is equivalent to selecting a subset of nodes of the partial order that minimizes a suitably defined cost function. Because this problem is NPHard, the focus is on approximability and heuristics. Harinarayan, Rajaraman and Ullman proposed a greedy heuristic together with a “benefit” criterion to measure its performance; this heuristic and performance measure are used in several subsequent papers which generalize their work. We prove the following lower bounds: (a) The greedy heuristic of Harinarayan, Rajaraman and Ullman has query response time at least n/12 times optimal for infinitely many n. (Compare this to the fact that no algorithm, regardless of how naive it is, ever has query response time exceeding n times optimal.) (b) If PfNP, then for every e > 0, every polynomialtime approximation algorithm for the view-selection problem will output solutions with query response time at least n’-’ times optimal, for infinitely many n, even for partial orders with bounded degrees and *College of Computing, Georgia Institute of Technology, howardQcc.gatech. edu. Research supported in part by NSF grant CCR-9732746. +CoIlege of Computing and School of Industrial and Systems Engineering, Georgia Institute of Technology, mihailQcc.gatech. edu. Work done in part while the author was at Bellcore. Permission to make digital or hard copies of all OT part of this work fbl personal or classroom USC is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this nhx and the full citation on the tirst page. TO COj>y otllerwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission andior a fee. PODS ‘99 Philadelphia PA Copyright ACM 1999 l-58113-062-7/99/05. $5.00 bounded depth. (c) A similar result applies even if we generously allow the algorithm to materialize ak views, LY a constant, and compare its performance to the optimal achievable when k views are chosen. Our results prove (if P#NP) that the viewselection problem is essentially inapproximable for general partial orders (the “benefit” performance measure of Harinarayan, Rajaraman and Ullman provides no competitiveness guarantee against the optimal solution). Hence studies of the Harinarayan, Rajaraman and Ullman framework and its generalizations should focus on special cases of practical significance, such as hypercubes, and on experimental comparison of heuristics.
Bypass and insertion algorithms for exclusive last-level caches

Inclusive last-level caches (LLCs) waste precious silicon estate due to cross-level replication of cache blocks. As the industry moves toward cache hierarchies with larger inner levels, this wasted cache space leads to bigger performance losses compared to exclusive LLCs. However, exclusive LLCs make the design of replacement policies more challenging. While in an inclusive LLC a block can gather a filtered access history, this is not possible in an exclusive design because the block is de-allocated from the LLC on a hit. As a result, the popular least-recently-used replacement policy and its approximations are rendered ineffective and proper choice of insertion ages of cache blocks becomes even more important in exclusive designs. On the other hand, it is not necessary to fill every block into an exclusive LLC. This is known as selective cache bypassing and is not possible to implement in an inclusive LLC because that would violate inclusion. This paper explores insertion and bypass algorithms for exclusive LLCs. Our detailed execution-driven simulation results show that a combination of our best insertion and bypass policies delivers an improvement of up to 61.2% and on average (geometric mean) 3.4% in terms of instructions retired per cycle (IPC) for 97 single-threaded dynamic instruction traces spanning selected SPEC 2006 and server applications, running on a 2 MB 16-way exclusive LLC compared to a baseline exclusive design in the presence of well-tuned multi-stream hardware prefetchers. The corresponding improvements in throughput for 35 4-way multi-programmed workloads running with an 8 MB 16-way shared exclusive LLC are 20.6% (maximum) and 2.5% (geometric mean).
Lack of Skeletal Effect of Soy Isoflavones in Intact Growing, Female Rats May Be Explained by Constant Serum Estrogenic Activity despite Reduced Serum Estradiol

Background/Aims: Scarce data exist on the effects of soy isoflavones (IF) on bone during peripuberty, a known ‘window of opportunity’ for bone consolidation. Our aim was to determine the skeletal, reproductive, and serum estradiol (E2)/estrogenic activity response of consuming naturally-occurring soy protein-associated IF during peripuberty. Methods: Weanling (∼3 weeks old), female rats were placed on one of four nutritionally-complete dietary regimens in which protein (200 g/kg diet) was provided as casein or soy protein isolates containing either 0.11 (Low IF), 2.16 (Med IF), or 3.95 (High IF) mg total aglycone isoflavones/g protein for 8 weeks, during which body weights and estrus cycling were recorded. Results: Bone growth and density were unaffected by soy intake while the reproductive tissues showed a slight response (greater uterine weights of the Med and High IF groups). Despite suppression of E2 concentrations in the High IF group, total circulating estrogenic activity was unaltered. Moreover, in the High IF group, E2 was significantly depressed compared with bioassayable estrogenic activity, suggesting negative feedback inhibition of E2 by the elevated circulating levels of IF. Conclusions: This suppression in E2 with maintenance of total serum estrogenicity in the High IF group may explain the lack of effect observed in the skeletal tissues.
Label tree based image classification using sum match kernel

The label tree-based classification is one of the most popular approaches for reducing the testing complexity to sublinear with the large number of classes. One of the popular approaches to generate the label tree is to apply recursively a spectral clustering algorithm to an affinity matrix for partition set of class labels into subsets, each subset corresponds to a child node of the tree. To obtain the affinity matrix from confusion matrix, a set of N binary one-versus-all classifiers is trained and applied on validation set, where N is number of classes. However, these approaches are not reliable when there are a large number of classes because it is too costly to train these classifiers. Furthermore, the affinity matrix could not reflect the real similarity among classes due to the classification accuracy can be low. In addition, the resulting label tree may not be balanced due to the objective function of spectral clustering penalizes unbalanced partitions. In this paper, to achieve better similarity measurement between classes and without using one-versus-all classifiers, we adopt the sum match kernel to get similarity matrix. Moreover, we propose a heuristic for learning balanced tree structure by adjusting the number of class labels in clusters after the spectral clustering is done. The experimental results on benchmark datasets SUN-397 and Caltech-256 show that the performance of the proposed approach outperforms significantly the other approaches.
Relation Between EBA and Nested Logit Models

We show that elimination by aspects (EBA) generalizes nested logit and cross-nested logit models. The latter two models are equivalent to a special case of EBA called preference trees. The transformations between preference trees and nested logit models become more complex when the utilities of alternatives are functions of covariates. In this case, a simple model in one domain corresponds to a complex model in the other. An extended EBA model, in which the utilities of alternatives are functions of covariates, represents a two-stage choice process. Alternatives are first screened using a probabilistic lexicographic rule and then compared in terms of their compensatory utilities. We provide a typology of the relations between EBA and other logit models, and we discuss issues concerning estimation, statistical testing, and data collection. We describe an application illustrating (1) the process of constructing a preference tree with covariates and (2) the different implications obtained from a preference t.
A Molecular and Morphological Phylogenetic Analysis of Afrotropical Monolepta Species and Related Galerucinae (Coleoptera: Chrysomelidae)

The phylogenetic status of Afrotropical galerucines was investigated with molecular and morphological analyses. The taxon sample analysed comprised 15 species within Monolepta, three within Afrocandezea, two each within Afrocrania and Barombiella and one Pseudocrania species; all were originally placed in “Monoleptites”. Further galerucines outside the “Monoleptites” are Diacantha sp. , Exosoma polita, Exosoma sp. , Galerudolphia tenuicornis, and Parasbecesta ruwensorica. The chrysomeline Linaeidea nubila was included as outgroup. 35 morphological characters including 16 characters on genital morphology were analysed. A 540 bp mitochondrial DNA NADH dehydrogenase subunit 1 (ND1) fragment and the entire second internal transcribed spacer region ITS2 (519–709 bp) of the nuclear ribosomal DNA were sequenced from 22 and 24 taxa, respectively. Both molecular data sets were characterized by a high average A-T content of 86.4% (ND1) and 62.7% (ITS2). Trees of separate and combined data sets were reconstructed with Maximum Parsimony (MP) and Maximum Likelihood (ML) approaches. The congruent tree topologies of both morphological and molecular data sets strongly support the monophyly of Monolepta, Afrocrania and Afrocandezea with regard to recently revised Afrotropical representatives. Barombiella emerged as polyphyletic, on species showing close relationship to Galerudolphia tenuicornis, which is traditionally placed in the “Scelidites”. “Monoleptites” is most likely polyphyletic since its decisive character, the elongated metatarsus, obviously evolved more than once in the Galerucinae. Understanding of the phylogenetic position and delimitation of the taxa primarily based on morphological characters could be significantly improved by molecular data.
Akademia Baru Survey on Running Environment of VANET Comparison with Routing Protocols

Vehicular Ad hoc Network (VANET) is a promising technology, which provides the comfort applications and enjoyable drive on the road. To provide safety and accountable network Quality of Service (QoS) parameters, it is essential to design routing protocols in which support VANET environment. Mobile adhoc Network (MANET) offered effective protocols and some of MANET protocols has been used for VANET. On the other hand, due to a special kind of simulation stationary is not suitable to take in use the same protocols of MANET for VANET. In this problem, it is needed to survey on running environment of VANET and compare the routing protocols. This paper is twofold, first, it describes the running environment of VANET which consists of environment such as, component, network pattern, and applications, techniques such as, Broadcast, Geocast and Unicast, and routing protocols such as, routing strategy and forwarding strategy. Second, it describes the routing protocols which have been proposed for VANET. The primary contribution of this survey on new routing protocols and provide the comparison of the routing protocols. The limitation of each routing protocol for VANET is provided which can be implied to researchers to mitigate the challenges of VANET routing protocols. Furthermore the discussion of open area is present in this paper. Copyright © 2015 Penerbit Akademia Baru All rights reserved.
Exploring the role of culture in trust development with service providers

Purpose – The purpose of this study is to explore how customers from different cultures develop trust with service providers to uncover underlying dimensions of trust development for customers from different cultures.Design/methodology/approach – This study utilizes semi‐structured phenomenological depth interviews to explore the role of culture in the development of trust with service providers.Findings – Customers' direct service experiences in their native culture and in the culture where they reside (in this study the USA), as well as recommendations from others appear to be the major determinants of trust. Furthermore, a customer's trust in a recommender seems to transfer over to a service provider.Research limitations/implications – Because all informants were from one foreign culture (Korean), the findings related to primarily this group. Further generalization of these findings should only be made after studies conducted with informants from other foreign cultures.Practical implications – Service .
Algorithm Design Template Base on Temporal ADT

Design and Analysis of Computer Algorithms is a must of Computer Curricula. It covers many topics that group around several core themes. These themes range from data structures to complexity theory, but one very special theme is algorithmic design patterns, including greedy method, divide-and-conquer, dynamic programming, backtracking and branch-and-bound. Naturally, at the undergraduate level all listed design patterns are taught, learnt and comprehended by examples. But they can be semi-formalized as design templates, semi-specified by correctness conditions, and semi-formally verified, for example, by means of Manna -- Pnueli proof-principles. Moreover, this approach can lead to new insights and better comprehension of the design patterns, specification and verification methods. In this paper we demonstrate an utility of the approach by study of backtracking and branch-and-bound design patterns. In particular, we present, specify and prove correctness of the unified template for these patterns. Our approach is based on a temporal abstract data type the que that unifies stack and queue discipline. We prove that every algorithm instantiated from the template is totally correct, if the input graph for traversing is finite, the boundary condition is monotone, and the decision condition is anti-monotone on sets of "visited" vertices.
The Predicted Effects of Chronic Obesity in Middle Age on Medicare Costs and Mortality

Background:The prevalence of adult obesity has increased in recent decades. It is important to predict the long-term effect of body weight, and changes in body weight, in middle age on longevity and Medicare costs in older ages. Methods:The relationships between individuals' characteristics in middle age and subsequent Medicare costs and mortality were estimated from the linkage of the National Health and Nutrition Examination Survey I Epidemiologic Follow-up Study to Medicare administrative records (1991–2000) and mortality information (1971–2000). We predicted longevity and lifetime Medicare costs via simulation for 45-year-old persons by body weight in 1973 and changes in body weight between 1973 and 1983. Results:Obese 45-year-olds had a smaller chance of surviving to age 65 and, if they did, incurred significantly higher average lifetime Medicare costs than normal-weight 45-year-olds ($163,000 compared with $117,000). Those who remained obese between ages 45 and 55 in 1973 to 1983 incurred significantly higher lifetime Medicare costs than those who maintained normal weight. Other weight change categories did not differ significantly from those who maintained normal weight in terms of life expectancy at age 65, but overweight and obese people who lost weight had less chance of surviving to age 65 and the lowest estimated life expectancies thereafter. Conclusions:Chronic obesity in middle age increases lifetime Medicare costs relative to those who remained normal weight. As the survival of obese persons improves, it is possible that Medicare costs may rise substantially in the future to meet the health care needs of today's obese middle-aged population. Thus, active engagement by both the private and public sectors to prevent and to reduce obesity are critically needed.
Suicide, Homicide, and Other Violent Deaths Among People Experiencing Homelessness in the United States: A Cross-sectional Study

Objectives: Limited information exists about violent deaths among people experiencing homelessness (PEH) across the United States. Using data from a national reporting system, we describe characteristics of suicides, homicides, and other deaths classified as violent among PEH in the United States. Methods: We obtained data on demographic characteristics, mechanisms of injury, and circumstances surrounding violent deaths from January 1, 2016, through December 31, 2018, in 31 states from the National Violent Death Reporting System. Results: Of 122 113 violent deaths in 31 states during 2016-2018, 1757 (1.4%) occurred among PEH and 3952 (3.2%) occurred among people for whom homelessness status was unknown or missing. Of all violent deaths among PEH, 878 were suicides (1.1% of all suicides), 458 were homicides (1.6% of all homicides), 352 were of undetermined intent (2.8% of all deaths of undetermined intent), and 59 were the result of legal interventions (3.8% of all deaths due to legal interventions). Hanging/suffocation/strangulation was the most common mechanism of suicide among PEH (44.4%), followed by deaths due to firearms (21.6%). Firearms were the most common mechanism of homicide deaths among PEH (48.0%). Black PEH were more likely to die by homicide than by suicide, and White PEH were more likely to die by suicide than by homicide. Among the 843 suicide victims for whom additional information was known, 345 (40.9%) had a history of suicidal thoughts or plans, 245 (29.1%) had disclosed intent to die by suicide, and 183 (21.7%) were receiving treatment for a mental health condition. Conclusions: Efforts to reduce mortality and improve health outcomes among PEH should consider the high rates of violent deaths in this population.
Principe de recollement des équations des contraintes en relativité générale@@@Gluing principle for the constraint equations in general relativity

En relativite generale, les equations d'Einstein pour un espace-temps peuvent se voir comme une equation d'evolution, dont les donnees ini- tiales, la metrique et la seconde forme fondamentale sur une hypersurface de genre " espace ", satisfont des " equations des contraintes ". On s'inte- resse ici a leur resolution par la methode de " recollement ", en decrivant son principe general. Cette methode permet de construire de grandes fa- milles de solutions sur une variete non-compacte approchant une reference a l'infini. Le cas des metriques riemanniennes a courbure scalaire constante y est inclus. Une liste non-exhaustive de resultats est decrite, notamment dans le cas de donnees initiales sur une variete riemannienne non-compacte et dont le comportement approche une certaine reference a l'infini.
Reasoning About a Machine with Local Capabilities Provably Safe Stack and Return Pointer Management Technical Appendix Including Proofs and Details Lau Skorstengaard

3 Macros 9 3.1 Linking and ABI . 9 3.2 Flag table . 10 3.3 Macro definitions . 10 3.4 Stack . 15 3.5 Labels . 21
THE TINKERER'S EVOLVING TOOL-BOX

range gravitational effects of the planets can lift the orbits of these objects beyond the outer edge of the planetary system, protecting them from close encounters with the planets. Therefore, many of these objects can survive in these eccentric orbits for the 4.6-billion-year age of the Solar System, forming a scattered disk. Duncan and Levison's numerical simulations 4 indicate that objects in the scattered disk tend to have more eccentric and/or inclined orbits than those in the Kuiper belt. Two recently discovered trans-neptunian objects may be the first members of the scattered disk to be found.major axis is 47 AU, its eccentricity is 0.3, its inclination is 32ᑻ, and it is about 300 km across 13. The newly discovered second object, 1996TL 66 , is estimated 3 to have a semimajor axis of 84 AU, an eccentricity of 0.58, an inclination of 24ᑻ, and to be about 490 km across. These objects are clearly outside the range of orbital elements predicted for the Kuiper belt: 1996RQ 20 because of its inclination, and 1996TL 66 because of its eccentricity. However, they could be members of the scattered disk 4. With the recent advances in our observational and theoretical understanding of the trans-neptunian region, it is now possible to construct a tentative picture of how the outer Solar System formed and evolved. Jupiter and Saturn formed early on, when the gaseous component of the solar nebula was still present. As the gas dissipated, it left behind a large number of small, icy bodies that had condensed from it, outside the orbit of Saturn and extending outward perhaps as far as a few hundred AU. These objects collided and gradually grew into larger 'planetesi-mals'. As the planetesimals increased in mass, they began to gravitationally perturb one another into more eccentric and more inclined orbits about the Sun. The growth of planets was much more rapid inside about 40 AU, leading to the formation of Uranus and Neptune. But outside 40 AU (that is, in the Kuiper belt), the bodies remained relatively small. Pluto may be just the largest Kuiper-belt object. The young Uranus and Neptune scattered most of the remaining nearby planetes-imals, outwards into the trans-neptunian region and inwards towards Jupiter and Saturn (Fig. 1). Usually, the objects scattered outwards eventually returned to the Uranus–Neptune region. In contrast, Jupiter and Saturn are so massive that they can efficiently eject many of these planetesimals …
S UPPLEMENTARY : E ND - TO - END ROBUST JOINT UNSUPERVISED IMAGE ALIGNMENT AND CLUSTERING

S2 Method 6 S2.1 Fine transformation regularization loss . 6 S2.2 Soft inlier loss . 7 S2.3 Gaussian mixture model . 7 S2.4 Network architecture . 8