Miracle-dz/UniFAR-FTUs huggingface dataset:
Reliability of the Turkish Version of a New Coma Scale: FOUR Score

Objectives: Although the most commonly used scale is the Glasgow Coma Scale (GCS) in neurological intensive care units (NICU), it has some shortcomings. Many attempts have been made to design new scales that could provide further neurological detail in coma. The FOUR score (Full Outline of UnResponsiveness) is a new coma scale. The aim of this study is the validation of the Turkish version of the FOUR score and comparison of it with the GCS. Patients and Methods: A total of consecutive 124 patients (65 males, 59 females; mean age 68.4aplusmn;14.7 years; range 26 to 96 years) who were admitted to the seven NICUs between 2006-2007 were enrolled in the study. Each patient was rated on both scales by two different neurologists within one hour after each other without knowledge of the othera#39;s scores. Morbidity was assessed at hospital discharge using the modified Rankin Scale. Results: The inter-rater reliability was excellent for both FOUR score (K=0.68; %95 CI, 0.59-077) and GCS (K=0.69; %95 CI, 0.60-0.77). Outcome prediction of the FOUR score was as effective as GCS. Conclusion: The FOUR score has major advantages and provide important details of the neurologic examination such as brainstem reflexes and eye movements. We believe our results suggest that the FOUR score could be used instead of GCS in the NICUs in Turkey. Amac: Norolojik yogun bakim unitelerinde (NYBU) en sik kullanilan olcek Glasgow Koma Skalasi (GKS) olmakla birlikte bazi eksiklikleri nedeni ile elestirilmekte ve norolojik hastalarin izlenmesinde daha iyi bir olcek gelistirme calismalari devam etmektedir. FOUR skor (Full Outline of UnResponsiveness) yeni bir koma degerlendirme olcegidir. Bu calismanin amaci FOUR skorun Turkce cevirisinin GKS ile karsilastirilmasi ve gozlemciler arasi guvenirliginin saptanmasidir. Hastalar ve Yontemler: Calismaya, 2006-2007 yillari arasinda yedi merkezin NYBUa#39;lerinde yatan toplam 124 hasta (65 erkek, 59 kadin; ort. yas 68.4aplusmn;14.7; dagilim 26-96) dahil edildi. Her hasta, iki noroloji doktoru tarafindan, birbirinin degerlendirmelerinden habersiz ve en fazla bir saat aralikli olacak sekilde muayene edildi ve FOUR skor ve GKS es zamanli olarak uygulandi. Hastalarin prognozu modifiye Rankin Skalasi (mRS) ile degerlendirildi. Bulgular: Uygulayicilar arasi uyumluluk hem FOUR skor icin (K=0.68; %95 CI, 0.59-0.77) hem de GKS icin (K=0.69; %95 CI, 0.60-0.77) iyi bulundu. FOUR skorun prognozu belirlemede GKS kadar etkili oldugu saptandi. Sonuc: FOUR skorun onemli ustunlukleri olup, beyin sapi refleksleri ve goz hareketleri gibi norolojik muayenenin onemli ayrintilari hakkinda bilgi saglar. Calismamizin sonuclarinin Turkiyea#39;deki NYBUa#39;lerde FOUR skorun GKS yerine kullanilabilecegi gorusunu destekledigine inaniyoruz.
A Logical Approach for Geo-Coding and Minimizing Noise in the Spatial Data of Public Bus Services in Urban Areas

This paper describes how a more efficient public transit system means better accessibility and higher opportunities for a better economy. In order to enhance the operation or to provide a better transit service, it is essential to draw a clear picture of the baseline conditions to identify the pros and cons of the existing service. Developing a quantitative spatial database of the service characteristics is deemed necessary for detailed analyses of existing services. A spatial database may help in understanding the geographical extent of the services and identifying the areas that may need special considerations to enhance the services. In this paper, a logical approach is presented to geo-code the spatial data of the public bus services; namely, the stoppage and routes maps (layers). The used geo-data to develop the bus stops and routes’ layers have significant noise. The adopted methodology to filter such noise in data and to develop the spatial database is presented in detail. Analyses and conclusions were presented using the presented geographic information system (GIS) spatial data techniques.
Bodily Surfaces and Coverings in Shakespeare

Although the early modern body in Shakespeare has received a lot of critical attention, the significance of the skin envelope has not been the subject of much study. This research attempts to contribute to the larger discourse on early modern skin by exploring the role of bodily surfaces and coverings in Coriolanus, Julius Caesar and Macbeth in the textualisation of early modern bodies. It theorises a relationship between the legibility and the vulnerability of the skin envelope, arguing that both factors mutually reinforce each other. Being pierced and ‘read’ are both symptomatic of defencelessness, so characters attempt to protect their skin from both by using coverings. The early modern theory of the closed body posited that the skin was a definitive and defensive barrier between the body and its environment. The interior of the body thus became a place of mystery, so early modern anatomy theorised that this was the location of ‘truth’. However, in the three plays, the notion of ‘truth’ is completely destabilised due to the volatile surfaces of the body. Truths are not discovered, but are constructed, dissolved and reconstructed on the outermost layer of the body, instead of the bodily interior. Further, bodily surfaces and coverings are often conflated, creating complex ‘layered bodies’ that tell multiple, often paradoxical narratives, none of which are the objective truth. Disguises tell the narratives of inviolability that the character would have others believe. The inherent vulnerability of the skin also feeds into these narratives, creating the desire for a body that is armoured to protect the character from being pierced and/or read. However, the superficial nature of the skin envelope encourages engagement and interpretation, thus exposing the desired dermal inviolability and illegibility as a fantasy.
A minimalist, distributed morphology approach to intra-individual variation: expletives and agreement in an insular english variety

This article is intended as a contribution toward an emerging program (Adger & Smith 2005, Adger 2006, 2007) that seeks to account for intra-individual (or, ‘Labovian sociolinguistic’) variation (e.g., Chambers, Trudgill & Schilling-Estes 2002) within a broadly Minimalist theoretical framework (Chomsky 1995 et seq., and related work). Following a specific approach (Parrott 2007, Nevins & Parrott In press, Parrott To appear), I attempt to implement this objective by utilizing the theory of Distributed Morphology (DM, Halle & Marantz 1993, Embick & Noyer 2007). Expletive constructions and their verbal agreement properties are a potentially productive point of contact between variationist sociolinguistics and morphosyntactic theory (for some previous work, see e.g., Meechan & Foley 1994, Schütze 1999, Henry 2002, Henry & Cottell 2007, Sobin 2004, Rupp 2005, Tortora 2006). Expletives and agreement, both in English and cross-linguistically, have long been important and central topics for generative syntax (e.g., Chomsky 1981, Chomsky 1993, 1995, 2000, 2001, 2004, Belletti 1988, Lasnik 1992, 1995, Vikner 1995, Belvin & Den Dikken 1997, Cardinaletti 1997, Moro 1997, Castillo, Drury & Grohmann 1999, Hazout 2004, Kayne 2004, 2006, among many others, see Deal 2009 for numerous references). Moreover, as reviewed below, sociolinguists using variationist methods have documented abundant interand intra-individual variation in the forms of expletives and their corresponding agreement patterns for diverse varieties of English. This growing body of
Estimating the Number of Concepts

Most Natural Language Processing systems have been built around the idea of a word being something found between white spaces and punctuation. This is a normal and efficient way to proceed. Tasks such as Word Sense Disambigua-tion, Machine Translation, or even indexing rarely go beyond the single word. Language models used in NLP applications are built on the word, with a few multiword expressions taken as exceptions. But future NLP systems will neces-sarily venture out into the uncharted areas of multiword expressions. The di-mensions and the topology of multiword concepts are unknown: Are there hun-dreds of thousands or tens of millions? Which words participate in multiword concepts and which do not? As the corpus grows, will their number keep on increasing? In this paper, I estimate the number of multiword concepts that are used in English, systematically probing the Web as our corpus.
Adaptive approximate state storage

Efficiently storing and matching visited states is key to the effectiveness of explicit-state model checkers such as SPIN. Models of concurrent programs often have too many reachable states to enumerate easily in main memory, and an efficient model checker can exhaust main memory in minutes by storing state descriptors exactly. A popular alternative is to over-approximate the set of visited states using a randomized, probabilistic data structure, such as a Bloom filter. Because the approximation is sound and does not slow down the search with revisitation of states, it tends to find errors quickly. Because it is probabilistically complete, the approach can also convincingly demonstrate lack of errors. In this dissertation, I analyze the approximate state storage problem in unprecedented detail, improve upon standard solutions, and demonstrate a novel approach that solves a configuration dilemma facing users of the standard solutions. Especially with my improvements, the best Bloom filter or hash compaction configuration for a given situation is quite good, but choosing the best configuration depends on a good estimate of the number of reachable states. Such an estimate is usually only available after checking a model. I solve this dilemma with an efficient storage scheme that is not tied to a particular estimate, because it is adaptive. Regardless of the number of states encountered at run time, its accuracy is near the information-theoretic optimal. It is also competitively fast, thanks to a novel in-place adaptation algorithm and a favorable access pattern to memory.
An activity-driven model for an interactional notion of context

Abstract : Prior research in context-awareness has largely been dominated by a positivist notion of context. While this notion of context is sufficient for well-defined and focused applications, it suffers from two main shortcomings. First, it fails to consider context as a dynamic construct that arises from a user's interactions. Second, it lacks enough consideration for the role of the human actor in context-awareness. As a result, it is inadequate for dealing with the kind of high-level activities that people naturally engage in as part of their everyday lives. This dissertation proposes an activity-driven model for an interactional notion of context that addresses these shortcomings. In this model, context is defined as a relation between activities. The model was validated using a prototype implementation running on the Google Android mobile phone emulator. Results show that not only does this model improve the computing experience of the user, it also provides unique benets that have not been available before, such as situation awareness, memory and mental aid, and an associative mode of information access. A rule-based method for discovering parent-child relationships between activities was also validated. These findings demonstrate that the activity-driven model of context warrants further research as a viable basis for context-aware mobile computing.
Physiologic Capacity as a Predictor of Postoperative Complications and Associated Costs in Three Types of Oncological Surgeries

Physiologic Capacity as a Predictor of Postoperative Complications and Collateral Costs in Three Types of Oncological Surgeries by Vicky D. Woodruff M.A., Tulsa University, 1985 B.S., Oral Roberts University, 1975 Dissertation Submitted in Fulfillment of the Requirements for the Degree of Doctor of Philosophy
Die jüdischen Gesandtschaften an Pompeius (63 v. Chr.) bei Diodor und Josephus

Zusammenfassung Sowohl Diodor (40,2) als auch Flavius Josephus (ant. Iud. 14,41–45) berichten über drei jüdische Delegationen, die 63 v. Chr. in Damaskus die Entscheidung im Jerusalemer Thronstreit zwischen Hyrkanos II. und Aristobulos II. in die Hände des Pompeius legen. Nach beiden Historikern soll eine davon gegen beide Kandidaten argumentiert und die Abschaffung des Königtums in Judäa zugunsten einer priesterlichen Regierung gefordert haben. Die Untersuchung zeigt zunächst, daß diese Forderung ohne echte Parallele in der jüdischen Geschichte hasmonäischer (und herodianischer) Zeit ist. Sie fragt dann nach einem Entstehungskontext für den frühesten Bericht über die Ereignisse in Damaskus und begreift ihn als Element der Selbstdarstellung des Pompeius. Literarkritisch wird sodann gefragt, welche Funktion der Gesandtschaftsbericht für Diodor und Josephus mit Blick auf ihre mutmaßlichen historiographischen Konzepte hat. Von dieser Grundlage her wird die Historizität des Berichteten in Frage gestellt. Abstract Diodorus Siculus (40,2) and Flavius Josephus (ant. Iud. 14,41–45) both give an account about three Jewish delegations, which met Pompey in Damascus in 63 B. C. E. in order to demand a decision in the conflict between Hyrcanus II and Aristobulus II. According to both historians, one of these delegations argued against both candidates and requested the abolition of kingship in Judea, preferring a priestly government. The study initially shows that this request is without a real parallel in Jewish history in Hasmonean (and Herodian) times. It then tries to contextualize the genesis of an early report about the events in Damascus. This report is understood as a part of Pompey′s self-presentation. Thereafter the study analyzes the function of the report in both Diodorus and Josephus, taking into account their presumable historiographical concepts. Based on this approach, the historicity of the reported events is challenged.
Enhanced P2P Botnets Detection Framework Architecture with Hybrid Analysis Approach

— Nowadays, botnets are the most advanced cybercrime as being powerful threaten to the internet infrastructure by risking the Internet stability and security. Millions of computers have been hijacking and infecting by botnets especially during peak activity. The P2P botnets exploit users and dominating the P2P technology which make botnets are harder to detect and terminated. As P2P botnets issues been highlighted as it’s dramatically evolvement, this paper addresses on current problems relate to P2P botnets faced by users and recommending the improvement. Also, this paper concentrated on proposing P2P botnets detection framework. Also, an in-depth analysis of P2P botnets has been conducted to understand and cope with their behaviors and characteristics. The new improvement has been introduced at the propose botnets framework architecture to improve the effectiveness of P2P detection analysis. The framework architecture has been structuralized with hybrid analysis through the integration of static analysis and dynamic analysis. Prior to this matter, this research has proposed a new enhancement on framework architecture that has been reinforced by hybrid detection technique to improve the effectiveness and efficiency of P2P botnets detection.
Tunable Properties of Poly-DL-Lactide-Monomethoxypolyethylene Glycol Porous Microparticles for Sustained Release of Polyethylenimine-DNA Polyplexes

Direct pulmonary delivery is a promising step in developing effective gene therapies for respiratory disease. Gene therapies can be used to treat the root cause of diseases, rather than just the symptoms. However, developing effective therapies that do not cause toxicity and that successfully reach the target site at therapeutic levels is challenging. We have developed a polymer-DNA complex utilizing polyethylene imine (PEI) and DNA, which was then encapsulated into poly(lactic acid)-co-monomethoxy poly(ethylene glycol) (PLA-mPEG) microparticles via double emulsion, solvent evaporation. Then, the resultant particle size, porosity, and encapsulation efficiency were measured as a function of altering preparation parameters. Microsphere formation was confirmed from scanning electron micrographs and the aerodynamic particle diameter was measured using an aerodynamic particle sizer. Several formulations produced particles with aerodynamic diameters in the 0–5 μm range despite having larger particle diameters which is indicative of porous particles. Furthermore, these aerodynamic diameters correspond to high deposition within the airways when inhaled and the measured DNA content indicated high encapsulation efficiency. Thus, this formulation provides promise for developing inhalable gene therapies.
A system for automatic text detection in video

Video indexing is an important problem that has occupied recent research efforts. The text appearing in video can provide semantic information about the scene content. Detecting and recognizing text events can provide indices into the video for content based querying. We describe a system for detecting, tracking, and extracting artificial and scene text in MPEG-1 video. Preliminary results are presented.
Time Warps, String Edits, and Macromolecules

1. An overview of sequence comparison Joseph B. Kruskal Part I. Macromolecular Sequences: 2. Recognition of patterns in genetic sequences Bruce W. Erickson and Peter H. Sellers 3. Fast algorithms to determine RNA secondary structures containing multiple loops David Sankoff, Joseph B. Kruskal, Sylvie Mainville and Robert J. Cedergren Part II. Time-Warping, Continuous Functions, and Speech Processing 4. The symmetric time-warping problem: from continuous to discrete Joseph B. Kruskal and Mark Liberman 5. Use of dynamic programming in a syllable-based continuous speech recognition system Melvyn J. Hunt, Matthew Lennig and Paul Mermelstein 6. Application of sequence comparison to the study of bird songs David W. Bradley and Richard A. Bradley Part III. Variations on a Theme: Algorithms for Related Problems: 7. On the complexity of the extended string-to-string correction problem Robert A. Wagner 8. An analysis of the general tree-editing problem Andrew S. Noetzel and Stanley M. Selkow 9. Simultaneous comparison of three or more sequences related by a tree David Sankoff and Robert J. Cedergren 10. An anthology of algorithms and concepts for sequence comparison Joseph B. Kruskal and David Sankoff 11. Dissimilarity measures for clustering strings James M. Coggins Part IV. Computational Complexity: 12. Recent results on the complexity of common-subsequence problems 13. Formal-language error correction Robert A. Wagner 14. How to computer string-edit distances quickly William J. Masek and Michael S. Paterson Part V. Random Sequences: 15. An upper-bound technique for lengths of common subsequences Vaclav Chvatal and David Sankoff 16. Probabilistic behavior of longest-common-subsequence length Joseph Deken 17. Common subsequences and monotone subsequences David Sankoff and Sylvie Mainville Author index Subject index.
Applying Big Data, Machine Learning, and SDN/NFV for 5G Early-Stage Traffic Classification and Network QoS Control

Due to the rapid growth of mobile broadband and IoT applications, the early-stage mobile traffic classification becomes more important for traffic engineering to guarantee Quality of Service (QoS), implement resource management, and network security. Therefore, identifying traffic flows based on a few packets during the early state has attracted attention in both academic and industrial fields. However, a powerful and flexible platform to handle millions of traffic flows is still challenging. This study aims to demonstrate how to integrate various state-of-the-art machine learning (ML) algorithms, big data analytics platforms, software-defined networking (SDN), and network functions virtualization (NFV) to build a comprehensive framework for developing future 5G SON applications. This platform successfully collected, stored, analyzed, and identified a huge number of real-time traffic flows at broadband Mobile Lab (BML), National Chiao Tung University (NCTU). Moreover, we also implemented network QoS control to configure priorities per-flow traffic to enable bandwidth guarantees for each application by using SDN. Finally, the performance of the proposed models was evaluated by applying them to a real testbed environment. The powerful computing capacity of the platform was also analyzed.
Exclusion of Giant Coronary Artery Aneurysm with Covered Stent Combinedwith Coil Embolization of Vessel Outflow

Background: Coronary artery aneurysms (CAA) are rare abnormal dilatation of the coronary arteries. They are termed giant if their diameter exceeds the reference vessel diameter by more than 4 times or if they are more than 8 mm in diameter. If not treated, they have a tendency to rupture, thrombose or embolize. There is however no definite therapy for CAA. Various therapies suggested in the management of aneurysms include surgical resection, covered stent implantation or coil embolization. Methods: We describe a case of coiling of a potential collateral vessel feeding the giant coronary aneurysm retrogradely and covered stenting of main branch to exclude the aneurysm. Results: Transcatheter embolization was successfully done. No late complications were seen during 1 year CT angiography. Conclusion: Dual stent and coil embolization is safe and effective for vessel outflow during the treatment of giant coronary artery aneurysm. Further long term outcomes will have to be determined through serial CT angiographies.
Radical recognition of handwritten Chinese characters using GA-based kernel active shape modelling

A key property of Chinese characters is that they are composed of fundamental parts called radicals. In this paper, a method to recognise (offline) the radicals of handwritten Chinese characters is proposed that is an extension of the authors' previous work based on active shape modelling. Three stages are involved: a set of example radicals is first described by landmarks using (mostly) automatic landmark labelling, then radicals are modelled as active shapes using kernel principal component analysis, and finally unseen radicals are matched to the reference models using a genetic algorithm to search for the optimal shape parameters. Experiments are conducted on a 430,800 character subset of the freely-available HITPU database, a collection of 751,000 loosely-constrained handwritten Chinese characters. Results show that this new method outperforms existing representative radical approaches, including the authors' own earlier work. Improvements on the previous work are made in two aspects: automatic landmark labelling, which renders this methodology more practical, and the use of a genetic algorithm which finds the optimal shape parameters more effectively, leading to the best results so far reported on this dataset.
Efficient Cache Performance Modeling in GPUs Using Reuse Distance Analysis

Reuse distance analysis (RDA) is a popular method for calculating locality profiles and modeling cache performance. The present article proposes a framework to apply the RDA algorithm to obtain reuse distance profiles in graphics processing unit (GPU) kernels. To study the implications of hardware-related parameters in RDA, two RDA algorithms were employed, including a high-level cache-independent RDA algorithm, called HLRDA, and a detailed RDA algorithm, called DRDA. DRDA models the effects of reservation fails in cache blocks and miss status holding registers to provide accurate cache-related performance metrics. In this case, the reuse profiles are cache-specific. In a selection of GPU kernels, DRDA obtained the L1 miss-rate breakdowns with an average error of 3.86% and outperformed the state-of-the-art RDA in terms of accuracy. In terms of performance, DRDA is 246,000× slower than the real GPU executions and 11× faster than GPGPU-Sim. HLRDA ignores the cache-related parameters and its obtained reuse profiles are general, which can be used to calculate miss rates in all cache sizes. Moreover, the average error incurred by HLRDA was 16.9%.