bluuebunny/crossref_metadata_2025_split huggingface dataset:
Urine proteomics for prediction of disease progression in patients with IgA nephropathy
Authors: Rudnicki Michael , Siwy Justyna , Wendt Ralph , Lipphardt Mark , Koziolek Michael J , Maixnerova Dita , Peters Björn , Kerschbaum Julia , Leierer Johannes , Neprasova Michaela , Banasik Miroslaw , Sanz Ana Belen , Perez-Gomez Maria Vanessa , Ortiz Alberto , Stegmayr Bernd , Tesar Vladimir , Mischak Harald , Beige Joachim , Reich Heather N ,   PERSTIGAN working group, Beige Joachim , Wendt Ralph , Siwy Justyna , Zürbig Petra , Mischak Harald , Durban Annika , Raad Julia , Golovko Igor , Reich Heather , Lam Ping , Yang Stuart , Díaz Jiménez , Sanz Ana Belen , Fernandez-Fernandez Beatriz , Rojas-Rivera Jorge Enrique , Perez-Gomez Maria Vanessa , Ortiz Alberto , Sanchez-Niño Maria Dolores , Sanchez-Rodriguez Jinny , Rudnicki Michael , Kerschbaum Julia , Leierer Johannes , Mayer Gert , Stegmayr Bernd , Peters Björn 
Published: November 2020

AbstractBackgroundRisk of kidney function decline in immunoglobulin A (IgA) nephropathy (IgAN) is significant and may not be predicted by available clinical and histological tools. To serve this unmet need, we aimed at developing a urinary biomarker-based algorithm that predicts rapid disease progression in IgAN, thus enabling a personalized risk stratification.MethodsIn this multicentre study, urine samples were collected in 209 patients with biopsy-proven IgAN. Progression was defined by tertiles of the annual change of estimated glomerular filtration rate (eGFR) during follow-up. Urine samples were analysed using capillary electrophoresis coupled mass spectrometry. The area under the receiver operating characteristic curve (AUC) was used to evaluate the risk prediction models.ResultsOf the 209 patients, 64% were male. Mean age was 42 years, mean eGFR was 63 mL/min/1.73 m2 and median proteinuria was 1.2 g/day. We identified 237 urine peptides showing significant difference in abundance according to the tertile of eGFR change. These included fragments of apolipoprotein C-III, alpha-1 antitrypsin, different collagens, fibrinogen alpha and beta, titin, haemoglobin subunits, sodium/potassium-transporting ATPase subunit gamma, uromodulin, mucin-2, fractalkine, polymeric Ig receptor and insulin. An algorithm based on these protein fragments (IgAN237) showed a significant added value for the prediction of IgAN progression [AUC 0.89; 95% confidence interval (CI) 0.83–0.95], as compared with the clinical parameters (age, gender, proteinuria, eGFR and mean arterial pressure) alone (0.72; 95% CI 0.64–0.81).ConclusionsA urinary peptide classifier predicts progressive loss of kidney function in patients with IgAN significantly better than clinical parameters alone.
Measuring the efficiency of VAT reforms: a demand system simulation approach
Authors: Tóth Peter , Cupák Andrej , Rizov Marian 
Published: November 2020

AbstractUsing an estimated demand model, we simulate household-level demand responses to the recent Slovak value added tax (VAT) reform and its hypothetical alternatives. We use simulation results, instead of the standard approximate measures, for constructing an improved efficiency indicator of tax reforms as a ratio of welfare and fiscal revenue effects and call it marginal welfare gain (MWG). We also contribute to the literature on optimal structure of indirect taxes and on marginal tax reforms with new evidence of actual and hypothetical reforms that could increase the welfare of households at zero fiscal costs. Regarding the general policy implications of our results, we conclude that using a demand model to rank commodities according to their MWGs can be helpful for designing both efficient and equitable VAT reforms.
Double Generativity and Complete Effective
Authors: Smullyan Raymond M 
Published: November 2020

Abstract
§1. Complete Effective Inseparability. A disjoint pair (A1,A2) is by definition recursively inseparable if no recursive superset of A1 is disjoint from A2. This is equivalent to saying that for any disjoint r.e. supersets ωi and ωj of A1 and A2, the set ωi is not the complement of ωj —in other words, there is a number n outside both ωi and ωj. The disjoint pair (A1,A2) is called effectively inseparable—abbreviated E.I.—if there is a recursive function δ(x, y)—called an E.I. function for (A1, A2)—such that for any numbers i and j such that A1⊆ ωi and A2Í ωj. with ωi being disjoint from ωj, the number d(i , j) is outside both a;,- and ωj. We shall call a disjoint pair (A1, A2) completely E.I. if there is a recursive function δ(x, y)—which we call a complete E.I. function for (A1, A2)—such that for any numbers i and j, if A1⊆ ωi and A2Í ωj, then δ(i , j) Í ωi ↔ d(i , j)Í ωj (in other words, d(i, j) is either inside or outside both sets ωi and ωj.). [If ωi and ωj happen to be disjoint, then, of course, d(i, j) is outside both ωi and ωj, so any complete E.I. function for (A1,A2) is also an E.I. function for (A1,A2) In a later chapter, we will prove the non-trivial fact that if (A1, A2) is E.I. and A1 and A2 are both r.e., then (A1,A2) is completely E.I. [The proof of this uses the result known as the double recursion theorem, which we will study in Chapter 9.] Effective inseparability has been well studied in the literature. Complete effective inseparability will play a more prominent role in this volume—especially in the next few chapters. Proposition 1. (1) If (A1,A2) is completely E.I., then so is (A2,A1) —in fact, if d(x,y) is a complete E.I. function for (A1,A2), then d(y,x) is a complete E.I. function for (A2, A1).
Recursion Theorems
Authors: Smullyan Raymond M 
Published: November 2020

Abstract
We have proved that the complement of every completely productive set (in other words, every generative set) is universal, and this was enough to establish Theorem A of Chapter 6. In Chapter 10 we will prove Myhill’s stronger result that the complement of every productive set is universal. For this proof, we will need the recursion theorem of this chapter. Recursion theorems (which can be stated in many forms) have profound applications in recursive function theory and metamathematics, and we shall devote considerable space to their study. To illustrate their rather startling nature, consider the following mathematical “believe-it-or-not’s”: Which of the following propositions, if true, would surprise you? . . . 1. There is a number n such that ωn = ωn+1.
Three Special Topics
Authors: Smullyan Raymond M 
Published: November 2020

Abstract
The topics of this chapter are of more specialized interest and are not necessary for the results of our final chapter. They will probably be of more interest to the specialist (particularly the results of Section III) than to the general reader. We know from Chapter 2 that if all recursive sets are representable in S, then S is undecidable. We also know from Chapter 4 that if all recursively enumerable sets are representable in S, then S is not only undecidable but generative. We might also ask the question, If all recursive sets are representable in S, is S necessarily generative? Shoenfield [1961] answered this question negatively. He constructed an axiomatizable system in which all recursive sets are representable, and so the system is undecidable, but he showed that the system is not creative. Let us say that all recursive sets are uniformly representable in S if there is a recursive function g(x) such that for any number i, if ωi is a recursive set, then g(i) is the Godel number of a formula which represents ωi in S. We will show that if all recursive sets are uniformly representable in S, then S is generative. We also showed in Chapter 2 that if all recursive sets are definable in S and S is consistent, then the pair (P,R) of its nuclei is recursively inseparable. Under the same hypothesis, is the pair (P,R) necessarily effectively inseparable? The answer is no. In Shoenfield’s system all recursive sets are not only representable, but definable. However, the set P is not creative. Hence the pair (P, R) of nuclei of the system, though recursively inseparable, is not effectively inseparable.
Solvable and Unsolvable Problems (1954)
Authors: Turing Alan 
Published: November 2020

Abstract
In Chapter 1 Turing proves the existence of mathematical problems that cannot be solved by the universal Turing machine. There he also advances the thesis, now called the Church–Turing thesis,that any systematic method for solving mathematical problems can be carried out by the universal Turing machine. Combining these two propositions yields the result that there are mathematical problems which cannot be solved by any systematic method—cannot, in other words, be solved by any algorithm. In ‘Solvable and Unsolvable Problems’ Turing sets out to explain this result to a lay audience. The article first appeared in Science News, a popular science journal of the time. Starting from concrete examples of problems that do admit of algorithmic solution, Turing works his way towards an example of a problem that is not solvable by any systematic method. Loosely put, this is the problem of sorting puzzles into those that will ‘come out’ and those that will not. Turing gives an elegant argument showing that a sharpened form of this problem is not solvable by means of a systematic method (pp. 591–2). The sharpened form of the problem involves what Turing calls ‘the substitution type of puzzle’. An typical example of a substitution puzzle is this. Starting with the word BOB, is it possible to produce BOOOB by replacing selected occurrences of the pair OB by BOOB and selected occurences of the triple BOB by O? The answer is yes: … BOB → BBOOB → BBOBOOB → BOOOB …Turing suggests that any puzzle can be re-expressed as a substitution puzzle. Some row of letters can always be used to represent the ‘starting position’ envisaged in a particular puzzle, e.g. in the case of a chess problem, the pieces on the board and their positions. Desired outcomes, for example board positions that count as wins, can be described by further rows of letters, and the rules of the puzzle, whatever they are, are to be represented in terms of permissible substitutions of groups of letters for other groups of letters.
Craniofacial growth and development
Authors: Gillgrass T J , Welbury R 
Published: November 2020

Abstract
This Chapter describes, in general terms, the prenatal development and postnatal growth of the craniofacial skeleton, and the occlusal development of the primary and permanent dentitions. Understanding of embryological development is essential for the dental practitioner who may frequently face patients with common craniofacial anomalies such as cleft lip and/or palate. For routine care, an understanding of their development and aetiology will bring insight to their likely presenting signs and symptoms. This section will include a brief summary of the development of the face, including the neural crest and pharyngeal arches. It is not the intention of this summary to be in any way a complete or thorough description but simply to describe some of the key cells/interactions and structures. Neural crest cells are derived from the neural fold, and are highly migratory and specialized cells capable of predetermined differentiation. The differentiation occurs after their migration and is essential for the normal development of face and teeth. By week 4 the primitive mouth or stomatodeum is bordered laterally and from the developing heart inferiorly by the pharyngeal or branchial arches. These are six bilateral cylindrical thickenings (although the fifth and sixth are small) which form in the pharyngeal wall and into which the neural crest cells migrate. They are separated externally by the branchial grooves and internally by the pharyngeal pouches. The first groove and pouches are involved in the formation of the auditory apparatus and the Eustachian tube. Each arch has a derived cartilage rod, muscular, nervous, and vascular component. The first two arches and their associated components are central to the development of the facial structures. This period is also characterized by the development of the organs for hearing, sight, and smell, namely the otic, optic, and nasal placodes. By the end of week 4, thickenings start to develop in the frontal process. The medial and lateral frontonasal processes develop from these, together with the nasal placodes. The maxillary process develops from the first pharyngeal arch and grows forward to meet the medial and nasal processes, from which it is separated by distinct grooves at week 7.
Operative treatment of dental caries in the primary dentition
Authors: Duggal M S , Day P F 
Published: November 2020

Abstract
While there is no doubt that the best way to tackle the problem of dental caries is through an effective programme of prevention, as outlined in previous chapters, it is unfortunate that many children still suffer from the disease and its consequences. Hence, there is a need to consider operative treatment to prevent the breakdown of the dentition. As discussed in earlier chapters, there are a number of different techniques and philosophies for treating dental caries. This Chapter will concentrate mainly on the methods of complete caries removal (a ‘surgical’ approach). Research to support different philosophies, techniques, and materials frequently lacks evidence from randomized controlled trials, which are considered as the gold standard. Consequently, lower levels of evidence are used to support different techniques. More importantly, dentists need to be skilled in different techniques and philosophies to ensure that appropriate care is provided to each and every child. The removal of caries is not a new concept for the treatment of dental decay. Over the years the treatment of dental caries in children has been discussed and many attempts have been made to rationalize the management of the disease. Writing more than 150 years ago, Harris (1839) was one of the first to address the problem of restoring the primary dentition. Even in those days he was emphasizing the importance of prevention by good toothbrushing. Caries could be arrested by ‘plugging’, but from his description he obviously found treatment for the young patient difficult and not as successful as for adults. However, he did emphasize the importance of looking after children’s teeth: ‘If parents and guardians would pay more attention to the teeth of their children, the services of the dentist would much less frequently be required’, and ‘Many persons suppose that the teeth, in the early periods of childhood, require no attention, and thus are guilty of the most culpable neglect of the future well-being of those entrusted to their care’. Unfortunately, this statement still applies today. Caries removal can be a stressful experience for the child, the parent, and the dentist. Therefore it is important that there is a positive health gain from any treatment that is provided.
Traumatic injuries to the teeth
Authors: Welbury R , Whitworth J M 
Published: November 2020

Abstract
Dental trauma in childhood and adolescence is common. At 5 years of age 31–40% of boys and 16–30% of girls, and at 12 years of age 12–33% of boys and 4–19% of girls, will have suffered some dental trauma. Boys are affected almost twice as often as girls in both the primary and the permanent dentitions. The majority of dental injuries in the primary and permanent dentitions involve the anterior teeth, especially the maxillary central incisors. Concussion, subluxation, and luxation are the most common injuries in the primary dentition, while uncomplicated crown fractures are most common in the permanent dentition. Prognosis of traumatic injuries has improved significantly in the last 20 years. This has been largely due to a greater understanding of dental pulp reaction patterns and vital pulp therapies. Children are most accident prone between 2 and 4 years for the primary dentition and between 7 and 10 years for the permanent dentition. Coordination and judgement are incompletely developed in children during the primary dentition years, and the majority of injuries are due to falls in and around the home as the child becomes more adventurous and explores his/her surroundings. Most injuries in the permanent dentition are caused by falls and collisions while playing and running, although bicycles are a common accessory. The place of injury varies in different countries according to local customs, but accidents in the school playground remain common. Sports injuries usually occur in the teenage years and are commonly associated with contact sports. Injuries due to road traffic accidents and assaults are most commonly associated with the late teenage years and adulthood, and are often closely related to alcohol abuse. One form of injury in childhood that must never be forgotten is child physical abuse or non-accidental injury (NAI). More than 50% of these children will have orofacial injuries (see also Chapter 4, Safeguarding Children). Accidental dental injuries can result from direct or indirect trauma. Direct trauma occurs when a tooth receives a direct blow, making this sort of injury more common at the front of the mouth.
Paediatrics
Authors: Whymark Caroline , Junkin Ross , Ramsey Judith 
Published: November 2020

Abstract
To pass the written part of the FRCA, candidates must achieve the pass mark for the SAQs and the MCQ/ SBA papers combined. Therefore, doing particularly well in one paper, or one area, can compensate for another in which you have scored poorly. The 30 SBA questions is an area that candidates commonly find difficult. There is a feeling these questions are unjust and that it is impossible to second guess the examiners and choose the correct option. They feel further punished that four marks are awarded for each correct answer or lost for an incorrect choice. While this reflects the fact that four answers have been eliminated in the course of choosing the best answer, candidates often state it is an unfair ‘all or nothing’ way to mark these questions. They can commonly narrow the choice down to a final two options but report finding it difficult to then choose between them. They receive no credit having successfully eliminated three of the options and cite the SBA element as being the reason they failed the examination. These comments however are not supported by examination success data published by the RCoA. The pass rate for this paper was consistent at around 70% before and after the introduction of the SBA component in September 2011. We believe the concepts behind the SBAs are misunderstood by many. When asked to write a SBA question, candidates inevitably produce a five- part A to E multiple choice question but with only one correct answer. The finer points of SBA questions are lost among quickly written revision aids containing what the authors believe to be examination standard questions, when often they are not. Further, because SBAs are a relatively new element to the FRCA there is a limited bank of questions, and a highly restricted number in the public domain. Both these factors make practice of these questions difficult. Part of exam success is practice of the technique and question type in advance. We believe the practice of SBAs is an area to which candidates do not give enough attention.
Symbols Without Context
Authors: Smith Gary 
Published: November 2020

Abstract
Humans have invaluable real-world knowledge because we have accumulated a lifetime of experiences that help us recognize, understand, and anticipate. Computers do not have real-world experiences to guide them, so they must rely on statistical patterns in their digital data base—which may be helpful, but is certainly fallible. We use emotions as well as logic to construct concepts that help us understand what we see and hear. When we see a dog, we may visualize other dogs, think about the similarities and differences between dogs and cats, or expect the dog to chase after a cat we see nearby. We may remember a childhood pet or recall past encounters with dogs. Remembering that dogs are friendly and loyal, we might smile and want to pet the dog or throw a stick for the dog to fetch. Remembering once being scared by an aggressive dog, we might pull back to a safe distance. A computer does none of this. For a computer, there is no meaningful difference between dog, tiger, and XyB3c, other than the fact that they use different symbols. A computer can count the number of times the word dog is used in a story and retrieve facts about dogs (such as how many legs they have), but computers do not understand words the way humans do, and will not respond to the word dog the way humans do. The lack of real world knowledge is often revealed in software that attempts to interpret words and images. Language translation software programs are designed to convert sentences written or spoken in one language into equivalent sentences in another language. In the 1950s, a Georgetown–IBM team demonstrated the machine translation of 60 sentences from Russian to English using a 250-word vocabulary and six grammatical rules. The lead scientist predicted that, with a larger vocabulary and more rules, translation programs would be perfected in three to five years. Little did he know! He had far too much faith in computers. It has now been more than 60 years and, while translation software is impressive, it is far from perfect. The stumbling blocks are instructive. Humans translate passages by thinking about the content—what the author means—and then expressing that content in another language.
Beat the Market II
Authors: Smith Gary 
Published: November 2020

Abstract
Nowadays, technical analysts are called quants. Being overly impressed by computers, we are overly impressed by quants using computers instead of pencils and graph paper. Quants do not think about whether the patterns they discover make sense. Their mantra is, “Just show me the data.” Indeed, many quants have PhDs in physics or mathematics and only the most rudimentary knowledge of economics or finance. That does not deter them. If anything, their ignorance encourages them to search for patterns in the most unlikely places. The logical conclusion of moving from technical analysts using pencils to quants using computers is to eliminate humans entirely. Just turn the technical analysis over to computers. A 2011 article in the wonderful technology magazine Wired was filled with awe and admiration for computerized stock trading systems. These black-box systems are called algorithmic traders (algos) because the computers decide to buy and sell using computer algorithms in place of human judgment. Humans write the algorithms that guide the computers but, after that, the computers are on their own. Some humans are dumbstruck. After Pepperdine University invested 10 percent of its portfolio in quant funds in 2016, the director of investments argued that, “Finding a company with good prospects makes sense, since we look for under valued things in our daily lives, but quant strategies have nothing to do with our lives.” He thinks that not having the wisdom and common sense acquired by being alive is an argument for computers. He is not alone. Black-box investment algorithms now account for nearly a third of all U.S. stock trades. Some of these systems track stock prices; others look at economic and noneconomic data and dissect news stories. They all look for patterns. A momentum algorithm might notice that when a particular stock trades at a higher price for five straight days, the price is usually higher on the sixth day. A mean-reversion algorithm might notice that when a stock trades at a higher price for eight straight days, the price is usually lower on the ninth day. A pairs-trading algorithm might notice that two stock prices usually move up and down together, suggesting an opportunity when one price moves up and the other doesn’t.