Miracle-dz/UniFAR-FTUs huggingface dataset:
Classification of O Stars in the Yellow-Green: The Exciting Star VES 735

Acquiring data for spectral classification of heavily reddened stars using traditional criteria in the blue-violet region of the spectrum can be prohibitively time consuming using small to medium sized telescopes. One such star is the Vatican Observatory emission-line star VES 735, which we have found excites the H II region KR 140. In order to classify VES 735, we have constructed an atlas of stellar spectra of O stars in the yellow-green (4800–5420 Å). We calibrate spectral type versus the line ratio He I λ4922:He II λ5411, showing that this ratio should be useful for the classification of heavily reddened O stars associated with H II regions. Application to VES 735 shows that the spectral type is O8.5. The absolute magnitude suggests luminosity class V. Comparison of the rate of emission of ionizing photons and the bolometric luminosity of VES 735, inferred from radio and infrared measurements of the KR 140 region, to recent stellar models gives consistent evidence for a main-sequence star of mass 25 M☉ and age less than a few million years with a covering factor 0.4–0.5 by the nebular material. Spectra taken in the red (6500–6700 Å) show that the stellar Hα emission is double-peaked about the systemic velocity and slightly variable. Hβ is in absorption, so that the emission-line classification is "(e)". However, unlike the case of the more well-known O(e) star ζ Oph, the emission from VES 735 appears to be long-lived rather than episodic.
Order isomorphisms of cones

Let C be a closed convex cone of vertex 0 in a real normed vector space L. We suppose C does not contain an entire straight line, and let _ * be the order induced on L by C. Let S be some subset of L. A map 5p: S--S is said to be order preserving on S if x > y implies so(x) >? p(y). We say a bijection so: S S is regular on S if both so and so-1 are order preserving on S. (We are not assuming so continuous.) Zeeman has shown [2] that if C is a right circular cone in R4, the only regular maps of R4 are affine, with linear part a Lorentz transformation. In this paper we show that similar conclusions can be drawn under more general circumstances. Before proceeding, we would like to record the benefit of several useful conversations with M. Koecher. We also note that, at the suggestion of the referee, we have modified our Proposition 1 to include the infinite dimensional case. As part of the setting for the sequel, we shall insist that C have a compact base. This means there is a continuous linear functional h on L such that h(x) >0 for xeC-0, and the set P=h-'(1)Q\C, called a base of the cone, is compact. Each ray in C intersects P exactly once, and as is customary, we call a ray passing through an extreme (respectively exposed) point of P an extreme (respectively exposed) ray of C. Since P is the closure of the convex hull of its extreme points, C is the closure of the convex hull of its extreme rays. Furthermore, let p be an exposed point of P. There is, by definition, a continuous linear functional s on L and a real number a such that s(x) +a > 0 for x EP,
OIDMD: A Novel Open-Set Intrusion Detection Method Based on Mahalanobis Distance

Intrusion detection has been a classic and challenging problem since new attacks emerge rapidly. Traditional methods are normally divided into two categories, anomaly detection and close-set detection. Anomaly detection methods cannot provide detailed diagnostic information about attacks, while close-set detection methods cannot cope with the constantly appearing unknown attacks. However, in real-world scenarios, intrusion detection methods have to detect known attacks while also identifying unknown ones. This is called open-set recognition which means that the detection model encounters unknown attacks that do not appear in the train phase. Some researchers have proposed open-set recognition methods to address the problem, but these methods are mainly based on Euclidean distance, which has two problems: (1) not taking into account the different scales of different feature (dimension) changes; (2) not considering the correlation between features. In this paper, we propose OIDMD that solves the open-set intrusion recognition based on the Mahalanobis distance. We conduct fine-grained attack classification of known attacks. Also, we conduct extensive experiments on the CICIDS2017 dataset and the results show that OIDMD outperforms existing methods for identifying unknown attacks, which confirms the effectiveness of open-set intrusion detection based on the Mahalanobis distance.
Camurati-Engelmann Disease Association With Hypogonadism and Primary Hypothyroidism

Introduction: Camurati-Engelmann disease (CED) is a rare autosomal dominant disease with various phenotypic expressions. The symptoms usually develop during childhood. The hallmark of the disease is bilateral symmetric diaphyseal hyperostosis of the long bones with progressive involvement of the metaphysis. The epiphysis is strictly spared. The common clinical symptoms are pain of the extremities, muscle wasting, waddling gait, and lethargy. CED is rarely seen in conjunction with hypogonadism. CED-associated hypothyroidism has not been reported yet. Clinical assessment and skeletal survey are important to make the diagnosis. Case Presentation: Hereby we reported a case of CED with concomitant hypogonadism and hypothyroidism. Serial plain radiographs of the patient showed classic and progressive diaphyseal cortical hyperostosis of the long bone. Conclusions: Hyperostosis of the skull was observed in the present case. The characteristic osseous changes of CED were highlighted and the differential diagnoses were discussed.
Theoretical and experimental analysis of a randomized algorithm for Sparse Fourier transform analysis q

We analyze a sublinear RA‘SFA (randomized algorithm for Sparse Fourier analysis) that finds a near-optimal B-term Sparse representation R for a given discrete signal S of length N, in time and space polyðB; logðNÞÞ, following the approach given in [A.C. Gilbert, S. Guha, P. Indyk, S. Muthukrishnan, M. Strauss, Near-Optimal Sparse Fourier Representations via Sampling, STOC, 2002]. Its time cost polyðlogðNÞÞ should be compared with the superlinear XðN logNÞ time requirement of the Fast Fourier Transform (FFT). A straightforward implementation of the RA‘SFA, as presented in the theoretical paper [A.C. Gilbert, S. Guha, P. Indyk, S. Muthukrishnan, M. Strauss, Near-Optimal Sparse Fourier Representations via Sampling, STOC, 2002], turns out to be very slow in practice. Our main result is a greatly improved and practical RA‘SFA. We introduce several new ideas and techniques that speed up the algorithm. Both rigorous and heuristic arguments for parameter choices are presented. Our RA‘SFA constructs, with probability at least 1 d, a nearoptimal B-term representation R in time polyðBÞ logðNÞ logð1=dÞ= 2 logðMÞ such that kS Rk22 6 ð1þ ÞkS Roptk 2 2. Furthermore, this RA‘SFA implementation already beats the FFTW for not unreasonably large N. We extend the algorithm to higher dimensional cases both theoretically and numerically. The crossover point lies at N ’ 70; 000 in one dimension, and at N ’ 900 for data on a N N grid in two dimensions for small B signals where there is noise. 2005 Elsevier Inc. All rights reserved. AMS subject classifications: 65T50; 68W20; 42A10
Place-Difference-Value Patterns: A Generalization of Generalized Permutation and Word Patterns

Abstract Motivated by the study of Mahonian statistics, in 2000, Babson and Steingrímsson [Sém. Lothar. Comb] introduced the notion of a “generalized permutation pattern” (GP) which generalizes the concept of “classical” permutation pattern introduced by Knuth in 1969. The invention of GPs led to a large number of publications related to properties of these patterns in permutations and words. Since the work of Babson and Steingrímsson, several further generalizations of permutation patterns have appeared in the literature, each bringing a new set of permutation or word pattern problems and often new connections with other combinatorial objects and disciplines. For example, Bousquet-Mélou et al. [J. Comb. Theory A] introduced a new type of permutation pattern that allowed them to relate permutation patterns theory to the theory of partially ordered sets. In this paper we introduce yet another, more general definition of a pattern, called place-difference-value patterns (PDVP) that covers all of the most common definitions of permutation and/or word patterns that have occurred in the literature. PDVPs provide many new ways to develop the theory of patterns in permutations and words. We shall give several examples of PDVPs in both permutations and words that cannot be described in terms of any other pattern conditions that have been introduced previously. Finally, we discuss several bijective questions linking our patterns to other combinatorial objects.
Learning from collisions in cognitive radio networks: Time Division Fair Sharing without pre-agreement

We consider a decentralized multi-armed bandit problem arisen in the application of cognitive radio networks, where M distributed secondary users independently search for spectrum opportunities in N channels without information sharing. The channel occupancy is modeled as an i.i. d. Bernoulli process with unknown mean. A collision happens when multiple users choose the same channel, and none or only one receives reward depending on the collision model. Under a non-Bayesian formulation, the performance measure of a policy is given by the system regret, defied as the total reward loss with respect to the optimal performance in the ideal scenario where all channel parameters are known to all users and collisions among secondary users are eliminated through centralized scheduling. In our previous work, a Time Division Fair Sharing (TDFS) framework was proposed for constructing fair decentralized policies that achieve the same logarithmic order of the system regret growth rate as in the centralized counterpart where users exchange observations and make decisions jointly. This TDFS framework, however, requires pre-agreement among users regarding the offset in their time sharing schedule. In this work, we generalize the TDFS framework by eliminating the pre-agreement thus achieve a complete decentralization among users. We show that by learning from collisions, users can settle at orthogonal time-sharing offsets and the TDFS framework can maintain its logarithmic regret order and the fairness among users without pre-agreement. The result applies to general stochastic processes beyond Bernoulli and thus finds a wide range of applications including multi-channel communication systems, multi-agent systems, web search and advertising, and social networks.
In Praise of Meekness: Essays on Ethnics and Politics

Translator's Preface. Introduction. In Praise of Meekness. PART I. Ethics and Politics. Reason of State and Democracy. PART II. The Nature of Prejudice. Racism Today. PART III. Truth and Liberty. Tolerance and Truth. PART IV. For and Against Lay Ethics. The Gods that Failed. APPENDIX. Understand Before Judging. Free to Save Ourselves. Note about the texts. Index.
Globalization: Historical Perspective and Prospects

Economies around the world have become increasingly integrated, thereby enhancing productivity growth and expanding consumer choices. In many nations, globalization has been accompanied by an increase in living standard hardly imagined just a generation ago. But perceived consequences for income distribution, environmental quality, and national sovereignty have also made globalization the focus of widespread controversy. This paper reviews alternative measures of globalization and identifies forces that promote and those that limit globalization. In significant ways, the world economy is now more integrated than even at the height of the previous wave of globalization a century ago. However, history shows that globalization and its benefits are highly vulnerable to political factors. While the Great Depression unleashed protectionist policies in many nations, the backlash to globalization started earlier, during prosperous times, in response to redistributive consequences. Although similar redistributive pressures are evident today, national governments are now better equipped to ensure a politically acceptable sharing of globalization's benefits. Globalization today confronts a second threat with no close historical parallel. This concerns the setting of social standards and is perceived as an issue of national sovereignty. Although nations remain free to set any standard desired by domestic residents, globalization raises the cost of maintaining higher standards than those adopted by trading partners. The prognosis for globalization is therefore mixed. While a major 1930-style reversal remains unlikely, resistance to the encroachment of international integration on domestic social norms will continue. One implication is that the power and authority of multilateral institutions, and especially of the WTO, will remain limited. Another possible implication is that further trade liberalization will be carried out mainly at the regional level, among groups of countries willing to accept shared social norms as a condition of open regional markets.
Adaptive multi-voltage scaling in wireless NoC for high performance low power applications

Networks-on-Chip (NoCs) have garnered significant interest as communication backbone for multicore processors used across a wide range of fields that demand higher computation capability. Wireless NoCs (WNoCs) by augmenting single hop, long range wireless links with wired interconnects; offer the most promising solution to reduce multi-hop long distance communication bottlenecks and opens up innumerable possibilities of topological innovations that are not possible otherwise. However, energy consumption in routers along with Wireless Interface (WI) components still remains considerably high. Specifically for large systems with many nodes in the network, a significant amount of energy is consumed by the communication infrastructure (routers, links, WIs). The usage of the routers and WIs are application dependent and for most cases performance requirements can be met without operating the whole communication infrastructure to its maximum limit. Dynamic reconfigurable systems that can switch between both high performance and low power modes can cater to wide range of applications. In this paper, we propose a novel design methodology for energy efficient WNoC using Adaptive Multi-voltage Scaling (AMS) that reduces dynamic power consumption, along with power gating to prevent static power dissipation in routers and WIs. We evaluate our proposed design in presence of real and synthetic traffic patterns. This approach saves up to 62.50% of static power with less than 1% area overhead. In different traffic scenarios, the proposed WNoC reduces overall packet energy dissipation up to 35% on average compared to a regular WNoC, without significant performance degradation. Design considerations for augmenting existing WNoCs with these routers and corresponding overheads are also presented.
Nutritional Contents and Medicinal Properties of Wheat: A Review

Wheat is considered good source of protein, minerals, B-group vitamins and dietary fiber i.e. an excellent health-building food. Thus, it has become the principal cereal, being more widely used for the making of bread than any other cereal because of the quality and quantity of its characteristic protein called gluten. Gluten makes bread dough stick together and gives it the ability to retain gas. Wheat has several medicinal virtues; starch and gluten in wheat provide heat and energy; the inner bran coats, phosphates and other mineral salts; the outer bran, the much-needed roughage the indigestible portion that helps easy movement of bowels; the germ, vitamins B and E; and protein of wheat helps build and repair muscular tissue. The wheat germ, which is removed in the process of refining, is also rich in essential vitamin E, the lack of which can lead to heart disease. The loss of vitamins and minerals in the refined wheat flour has led to widespread prevalence of constipation and other digestive disturbances and nutritional disorders. The whole wheat, which includes bran and wheat germ, therefore, provides protection against diseases such as constipation, ischaemic, heart disease, disease of the colon called diverticulum, appendicitis, obesity and diabetes. To enhance the quality as well as the quantity of proteins/starches, and the content of vitamins, essential amino acids, minerals and other healthy components of wheat, it is essential to understand the molecular and genetic control of various aspects of plant growth and development.
The Lagrangian Density of {123, 234, 456} and the Turán Number of its Extension

Abstract Given a positive integer n and an r-uniform hypergraph F, the Turán number ex(n, F ) is the maximum number of edges in an F -free r-uniform hypergraph on n vertices. The Turán density of F is defined as π(F)=limn→∞ex(n,F)(rn) \pi \left( F \right) = {\lim _{n \to \infty }}{{ex\left( {n,F} \right)} \over {\left( {_r^n} \right)}} . The Lagrangian density of F is π (F ) = sup{r! λ(G) : G is F -free}, where λ(G) is the Lagrangian of G. Sidorenko observed that π(F ) ≤ π (F ), and Pikhurko observed that π(F ) = π (F ) if every pair of vertices in F is contained in an edge of F . Recently, Lagrangian densities of hypergraphs and Turán numbers of their extensions have been studied actively. For example, in the paper [A hypergraph Turán theorem via Lagrangians of intersecting families, J. Combin. Theory Ser. A 120 (2013) 2020–2038], Hefetz and Keevash studied the Lagrangian densitiy of the 3-uniform graph spanned by {123, 456} and the Turán number of its extension. In this paper, we show that the Lagrangian density of the 3-uniform graph spanned by {123, 234, 456} achieves only on K53 K_5^3 . Applying it, we get the Turán number of its extension, and show that the unique extremal hyper-graph is the balanced complete 5-partite 3-uniform hypergraph on n vertices.
Prion-Protein-interacting Amyloid-β Oligomers of High Molecular Weight Are Tightly Correlated with Memory Impairment in Multiple Alzheimer Mouse Models*

Background: Amyloid-β (Aβ) oligomers are key in Alzheimer disease (AD) but are diverse and poorly characterized. Results: Multiple Aβ forms were measured across the life span of AD model mice and human AD brain. Conclusion: Aβ species interacting with prion protein were tightly linked to behavioral impairment. Significance: An Aβ oligomer subset with defined biochemical properties is present in multiple AD-relevant samples. Alzheimer disease (AD) is characterized by amyloid-β accumulation, with soluble oligomers (Aβo) being the most synaptotoxic. However, the multivalent and unstable nature of Aβo limits molecular characterization and hinders research reproducibility. Here, we characterized multiple Aβo forms throughout the life span of various AD mice and in post-mortem human brain. Aβo exists in several populations, where prion protein (PrPC)-interacting Aβo is a high molecular weight Aβ assembly present in multiple mice and humans with AD. Levels of PrPC-interacting Aβo match closely with mouse memory and are equal or superior to other Aβ measures in predicting behavioral impairment. However, Aβo metrics vary considerably between mouse strains. Deleting PrPC expression in mice with relatively low PrPC-interacting Aβo (Tg2576) results in partial rescue of cognitive performance as opposed to complete recovery in animals with a high percentage of PrPC-interacting Aβo (APP/PSEN1). These findings highlight the relative contributions and interplay of Aβo forms in AD.
SPSC : a Simple Supercompiler in Scala ?

class Term case class Var(name: String) extends Term case class CFG(kind: TKind.Value, name: String, args: List[Term]) extends Term { def replaceArgs(newArgs: List[Term]) = CFG(kind, name, newArgs) } case class Let(term: Term, bindings: List[(Var, Term)]) extends Term case class Pat(name: String, args: List[Var]) object TKind extends Enumeration {val Ctr, FCall, GCall = Value} class CFGObject(kind: TKind.Value) extends ((String, List[Term]) => CFG) { def apply(name: String, args: List[Term]) = CFG(kind, name, args) def unapply(e: CFG) = if (e.kind == kind) Some(e.name, e.args) else None } object Ctr extends CFGObject(TKind.Ctr) object FCall extends CFGObject(TKind.FCall) object GCall extends CFGObject(TKind.GCall) abstract class Def {def name: String} case class FFun(name: String, args: List[Var], term: Term) extends Def case class GFun(name: String, p: Pat, args: List[Var], term: Term) extends Defclass Def {def name: String} case class FFun(name: String, args: List[Var], term: Term) extends Def case class GFun(name: String, p: Pat, args: List[Var], term: Term) extends Def case class Program(defs: List[Def]){ val f = (defs :\ (Map[String, FFun]())) {case (x: FFun, m) => m + (x.name -> x); case (_, m) => m} val g = (defs :\ (Map[(String, String), GFun]())) {case (x: GFun, m) => m + ((x.name, x.p.name) -> x); case (_, m) => m} val gs = (defs :\ Map[String, List[GFun]](). withDefaultValue(Nil)) {case (x: GFun, m) => m + (x.name -> (x :: m(x.name))); case (_, m) => m} } Fig. 2. SLanguage.scala To simplify manipulations with terms we define functional objects Ctr, FCall, GCall. A method apply is only used to mimick a constructor: c = Ctr(n, ts) expands to c = Ctr.apply(n, ts). A method named unapply is used for generalized pattern-matching yielding an extractor : the pattern case Ctr(n, ts) will cause an invocation of Ctr.unapply. Some(n, args) corresponds to a successful match, while None is a failure. In addition to the list of definitions defs (declared in the constructor), the class Program contains three value fields: f, g, and gs. f is a map, where key is a name of an f-function and a value is the f-function itself. g is a map which uses a pair (a g-function name, a pattern name) as a key and the corresponding g-function as a value. gs is a map with a g-function name as a key and a list of g-functions as a value. In Scala, a piece of code appearing inside a class, but outside the method definitions, is considered to be a part of the constructor body. So, in the class Program, the maps f, g and gs are initialized when the constructor is called. To populate the map f, we traverse the list of function definitions. If an f-function is encountered then it is added to f. Note that this can be written in Scala in an elegant way by means of higher-order functions. We use the method :\ of the class List (where :\ is an alias for foldRight) possessing the following property: ([a0, a1, a2 . an] :\ z) op = op(a0, op(a1, op(., op(an, z) . )))