Miracle-dz/UniFAR-FTUs huggingface dataset:
Investigating the Success for All Reading Program.

This paper presents a multifaceted approach for investigating the impact of the Success for All (SFA) program on children's reading proficiency. The approach advocated features case study research and uses document analysis, structured observation, interviews, and questionnaires to collect data. The research design was successfully field tested in two Mississippi elementary schools, one in a rural community and one in a university community. Strategies presented in this paper can be used by experienced or novice researchers to study the SFA reading program in an elementary school. Student and teacher questionnaires are attached. (Author/SLD) Reproductions supplied by EDRS are the best that can be made from the ori inal document. co co) cv, cp 2 INVESTIGATING THE SUCCESS FOR ALL READING PROGRAM Jack Blendinger Mississippi State University Lauren R. Wells University of West Alabama Abstract: This paper presents a multi-faceted approach for investigating the impact of the Success For All program on children's reading proficiency. The approach advocated in the paper features case study research and uses document analysis, structured observation, interviews, and questionnaires to collect data. The research design was successfully field-tested in two Mississippi elementary schools--one located in a rural community and one located in a university community. Strategies presented in this paper can be used by either experienced or novice researchers to study the SFA reading program in an elementary school. This paper presents a multi-faceted approach for investigating the impact of the Success For All program on children's reading proficiency. The approach advocated in the paper features case study research and uses document analysis, structured observation, interviews, and questionnaires to collect data. The research design was successfully field-tested in two Mississippi elementary schools--one located in a rural community and one located in a university community. Strategies presented in this paper can be used by either experienced or novice researchers to study the SFA reading program in an elementary school. Paper presented at a display session that was given at the Annual Meeting of the Mid-South Educational Research Association Little Rock, Arkansas November 14-16, 2001 PERMISSION TO REPRODUCE AND DISSEMINATE THIS MATERIAL HAS BEEN GRANTED BY
Investigation of Different Low-Cost Array Antennas for Digital Beamforming and DOA-Estimation

This contribution presents two different 10 GHz low-cost microstrip array antennas. First an array of U-slot patch elements is investigated which exhibits a large bandwidth of ~35%. Secondly a semi-circular microstrip array on a planar metallic reflector with an extended beam scanning range of ±70° is discussed. For both types of arrays measurement results are presented. Suitable algorithms for the calibration of the U-slot patch array and the transformation of the semi-circular microstrip array to a uniform virtual linear array are investigatetd. In addition to the well known procedures, a modification to the commonly used calibration method is introduced and applied to the measured data.
PENGARUH BUDAYA ORGANISASI DAN MOTIVASI BERPRESTASI TERHADAP KEPUASAN KERJA SERTA IMPLIKASINYA TERHADAP KINERJA PEMERIKSA PAJAK

Tujuan penelitian ini adalah untuk menganalisis pengaruh budaya organisasi dan motivasi berprestasi terhadap kepuasan kerja serta implikasinya terhadap kinerja pemeriksa pajak di Kantor Pelayanan Pajak Badora Dua, Jakarta. Data dikumpulkan dengan cara mendistribusikan kuesioner kepada 42 orang pemeriksa pajak KPP Badora Dua, Jakarta. Analisis jalur digunakan untuk menghitung pengaruh variabel eksogenus dan varibel endogenus dari penelitian ini diperoleh simpulan besarnya total pengaruh budaya organisasi terhadap kepuasan kerja bagi pemeriksa pajak pada KPP Badora Dua, Jakarta adalah 32% dengan arah positif. Artinya, Budaya Organisasi (X1) berpengaruh positif terhadap tinggi rendahnya Kepuasan Kerja (Y). Besarnya total pengaruh motivasi berprestasi terhadap kepuasan kerja bagi pemeriksa pajak pada KPP Badora Dua, Jakarta adalah 46,47% dengan arah positif. Artinya, Motivasi Berprestasi (X2) berpengaruh positif terhadap tinggi rendahnya Kepuasan Kerja (Y). Besarnya total pengaruh budaya organisasi terhadap kinerja pemeriksa pajak pada KPP Badora Dua, Jakarta adalah 22,84% dengan arah positif. Artinya, Budaya Organisasi (X1) berpengaruh positif terhadap tinggi rendahnya Kinerja Pemeriksa (Z). Kata Kunci: budaya organisasi, motivasi berprestasi, kepuasan kerja, kinerja pemeriksa pajak
Software Pipeline–Based Partitioning Method with Trade‐Off between Workload Balance and Communication Optimization

For a multiprocessor System‐on‐Chip (MPSoC) to achieve high performance via parallelism, we must consider how to partition a given application into different components and map the components onto multiple processors. In this paper, we propose a software pipeline–based partitioning method with cyclic dependent task management and communication optimization. During task partitioning, simultaneously considering computation load balance and communication optimization can cause interference, which leads to performance loss. To address this issue, we formulate their constraints and apply an integer linear programming approach to find an optimal partitioning result — one that requires a trade‐off between these two factors. Experimental results on a reconfigurable MPSoC platform demonstrate the effectiveness of the proposed method, with 20% to 40% performance improvements compared to a traditional software pipeline–based partitioning method.
Der deutsche Wortschatz nach Sachgruppen

Thomas Mann benutzte ihn ebenso wie Lion Feuchtwanger, Paul Celan ebenso wie Hermann Kasack: den Dornseiff. Peter Hacks schrieb: "Zwei Schriftsteller, die sich zusammentaten, hatten zwei Zimmer, zwei Schreibtische und den Dornseiff doppelt. " Den "Reichtum der deutschen Ausdrucksmittel" wollte Franz Dornseiff (1888-1960) dokumentieren, als er 1933 sein grosses Woerterbuch zum ersten Mal vorlegte. Die Dichter haben sich dieser Schatztruhe der deutschen Sprache gerne bedient, und nicht nur sie. Denn mit seinem einzigartigen Strukturierungsprinzip stellt der Dornseiff ein unverzichtbares Hilfsmittel fur jeden Schreibenden dar, der bedeutungsverwandte Woerter (Synonyme) sucht, um seine Texte praziser und abwechslungsreicher zu formulieren. UEber die stilistische Praxis hinaus ermoeglicht der Dornseiff dem Sprachwissenschaftler differenzierte Wortschatzanalysen. Der Dornseiff bildet den gesamten deutschen Wortschatz nach Sachgruppen geordnet ab, d. h. nicht alphabetisch. So prasentiert jeder Eintrag eine Fulle von Woertern aller Wortarten, die zur jeweiligen Sache bzw. einem Begriff gehoeren, und bietet so Information, Dokumentation und Inspiration in einem. Die umfassende Neubearbeitung des traditionsreichen Standardwerks zeichnet sich unter anderem aus durch die Erweiterung um wichtige neue Sachgebiete (Medien, Informatik, Boerse, Raumfahrt, Sport und Freizeit usw.), die grundlegende Revision und Aktualisierung des abgebildeten Wortschatzes mithilfe des Wortkorpus des Projekts "Deutscher Wortschatz" an der Universitat Leipzig, die Verbesserung der Artikelstruktur, eine ausfuhrliche lexikographische Einfuhrung von Herbert Ernst Wiegand, die Beigabe einer leistungsfahigen CD-ROM fur die schnelle, gezielte Recherche (gebundene Ausgabe) , ein voellig neues, benutzerfreundliches Layout. Die 8. Auflage des Dornseiff ist die konsequente, erstmals auch elektronisch erschlossene Weiterfuhrung des beruhmten Woerterbuchs in die Gegenwart der deutschen Sprache. Systemvoraussetzungen (CD-ROM gebundene Ausgabe): PC mit 80486er Prozessor (Pentium Prozessor empfohlen), mindestens 16 MB RAM, 32 MB RAM empfohlen, mindestens 18 MB freier Speicherplatz (nur Softwareinstallation), mindestens 40 MB freier Speicherplatz (Vollinstallation) Windows 95/98/ME/2000/NT4.0/XP. Unter Windows 7 und Windows 8/8.1 ist die Virtualisierung einer XP-Umgebung noetig (z.B. XP Mode, VirtualBox)
Physician Agency and Competition: Evidence from a Major Change to Medicare Chemotherapy Reimbursement Policy

We investigate the role of physician agency and competition in determining health care supply and patient outcomes. A 2005 change to Medicare fees had a large, negative impact on physician profit margins for providing chemotherapy treatment. In response to these cuts, physicians increased their provision of chemotherapy and changed the mix of chemotherapy drugs they administered. The increase in treatment improved patient survival. These changes were larger in states that experienced larger decreases in physician profit margins. Finally while physician response was larger in more competitive markets, survival improvements were larger in less competitive markets.
Is Non Dipping Hypertension Associated with Dyslipidemia, Type 2 Diabetes or Chronic Kidney Disease?

Abstract Background and aims. Hypertension and dyslipidemia (DLP) increase the risk of cardiovascular diseases (CVD), especially in patients with chronic kidney disease (CKD). A non dipping pattern is very common in CKD. The aim of the study was to determine whether there is a difference between dipping/non dipping hypertension in subjects with CKD and DLP with or without lipid-lowering therapy (LLT). Material and methods. We performed a retrospective study that included 129 subjects from the Nephrology- Hypertension Out-patient Department of the University Campus Bio-Medico, Rome from January 2011 to April 2013. Results. From a total of 129 CKD subjects, 73 (56.59%) subjects had a non dipping pattern and 56 (43.41%) had a dipper pattern. We found statistically significant differences between the dipping and non-dipping pattern in subjects with CKD stages 1-2 versus stages 3-4 (p=0.018). When we analyzed the association between non-dipping status with DLP and type 2 diabetes (T2D), we did not find a statistically significant result. Conclusions. Only CKD significantly influenced the dipping/non dipping pattern in the study group
Energy-efficient networking techniques for wireless sensor networks

Wireless sensor networks must minimize overall power consumption in order to maximize operational lifetime. This paper's primary focus is on networks that use a mixture of higher-powered IP-speaking nodes and lower-powered non-IP nodes. Graph-theoretic techniques are used to investigate heuristics for guaranteeing full network connectivity in networks consisting of sensors with differing transmission ranges. Simulation results are provided for the use of adaptive power control in IP networks that utilize reactive routing protocols and sleep-mode operation.
An Analysis of Information Content in Television Advertising: An Update

Abstract Three hundred and forty-eight randomly selected network television commercials aired in 1981 were analyzed to determine their informational value using the fourteen operationally defined evaluative criteria of informativeness established in a previous benchmark study by Resnik and Stern in 1977. The results revealed general trends similar to the Resnik and Stern findings. The results are interpreted in terms of the recent findings in low involvement decision making and hemispherical lateralization.
Content based Classification and Retrieval of Images

CBIR is a challenging task. The SIFT and HARRIS corner detection approach takes image and transforms into large collection of local feature vectors. In addition, Sift is invariant to translation, rotation and scaling. K-means clustering is used to cluster the descriptors forming visual words (cluster center) and finally image is represented in the form of histogram where each histogram bin is called as visual word. The (dis)similarity is measured by comparing the histograms of query image with that of database images and displays the corresponding retrieved images. Construct classifier SVM, KNN for determining which category the image belongs. Our experiments shows high rate of retrieval effectiveness in terms of precision and recall. Keywords— CBIR, SIFT, HARRIS, K-means clustering, SVM, KNN
FASTA Herder: a web application to trim protein sequence sets

Abstract The ever increasing number of sequences in protein databases usually turns out large numbers of homologs in sequence similarity searches. While information from homology can be very useful for functional prediction based on amino acid conservation, many of these homologs usually have high levels of identity among themselves, which hinders multiple sequence alignment computation and, especially, visualization. More generally, high redundancy reduces the usability of a protein set in machine learning applications and biases statistical analyses. We developed an algorithm to identify redundant sequence homologs that can be culled producing a streamlined FASTA file. As a difference from other automatic approaches that only aggregate sequences with high identity, our method clusters near-full length homologs allowing for lower sequence identity thresholds. Our method was fully tested and implemented in a web application called FASTA Herder, publicly available at http://fh.ogic. ca/.
Outline of the Assembly process: JAZZ, the JGI In-House Assembler

Advancing Science with DNA Sequence Outline of the Assembly Process: JAZZ, the JGI In-House Assembler Source Tissue Pair-aligned reads Extract DNA Convert to graph: Reads = Nodes Edges = Pair alignments Shred & insert DNA 3 kb 40 kb 8 kb Clone libraries Traverse graph to generate contigs and scaffolds Forward & reverse sequencing End sequences (reads) with approximately known separations Read pairing information helps span sections without good alignments
Mixed Reality on Mobile Devices

The evolution of mobile-computing, location sensing and wireless networking has created a new class of computing: context-aware computing. Mobile computing devices such as PDAs have access to information processing and communication capabilities but do not necessarily have any awareness of the context in which they operate. Context-aware computing describes the special capability of an information infrastructure to recognize and react to the real-world context. Context here could mean many things, e.g. current physical location, weather conditions etc. The most critical aspects of context are location and identity. Location-aware computing systems respond to user’s location, either spontaneously (e.g. warning of nearby hazard) or when activated by user request. Immense potential of this area is already envisaged by the mobile manufactures as many of them have started providing GPS (Global Positioning System) receivers in their mobile devices enabling them location aware too. One such context-aware technology is mobile mixed reality (MMR). As mentioned, the most important aspect of MMR system is to identify the location and orientation of the user to retrieve the context so as to present him/her with context-aware information thereby enhancing the general awareness of the surrounding. This chapter focuses on different approaches for user-localization to trigger MMR based application. The chapter outlines system architecture, enabling technologies and challenges to make the MMR ubiquitous. Particularly, we are interested in the role of computer vision which can make this imaginative area a reality. This section outlines general definitions and requirements of MMR. Applications (Section 2), System Architecture (3), Challenges (Section 4), Tracking and registration (Section 5) are described in subsequent sections.
Optimal synchronous pulsewidth modulation with a trajectory tracking scheme for high dynamic performance (invertor control)

It is noted that synchronous pulsewidth modulation based on precalculated and stored optimal pulse patterns could be a superior method for the control of high-power inverters operated at low switching frequency. The technique has rarely been applied in practice owing to its poor dynamic performance. A feedforward control technique eliminates this drawback: the space vector of the machine currents is forced to track a precalculated optimal trajectory in the steady state and under the transient operating conditions commanded by the drive control system. Undesired transients caused by the pulsewidth modulator are avoided. Experimental results obtained from a 30 kW AC drive are presented. <<ETX>>
A Tagger for Teaching Purposes.

This paper describes a software system intended to help students learn about the process of tagging, the assignment of part-of-speech labels, which is basic to computational linguistics. It does this by (a) making it transparent why words have been analysed in a particular way, and (b) making it straightforward to add items to the system’s lexicon and improve its grammatical coverage. An unforeseen and welcome side-effect is that users are led to reflect on various properties of English grammar.
Fixed or Dynamic Priority? That is the Question

Since the first results published in 1973 by Liu and Layland on the Rate Monotonic (RM) and Earliest Deadline First (EDF) algorithms, a lot of progress has been made in the schedulability analysis of periodic task sets. Nevertheless, many important results are not widely known and several misconceptions still exist about the properties of these two scheduling methods. Surprisingly, an exhaustive comparison between fixed priority and dynamic priority scheduling is still missing and there is not a general agreement in the real-time community about the suitability of these two scheduling approaches for future real-time systems. The purpose of the panel is to present the most controversial issues to a wide specialized audience, starting a constructive and interactive discussion aimed at clarifying some critical points and drawing some missing research lines.
Cost-sensitive decision trees with completion time requirements

In many classification tasks, managing costs and completion times are the main concerns. In this paper, we assume that the completion time for classifying an instance is determined by its class label, and that a late penalty cost is incurred if the deadline is not met. This time requirement enriches the classification problem but posts a challenge to developing a solution algorithm. We propose an innovative approach for the decision tree induction, which produces multiple candidate trees by allowing more than one splitting attribute at each node. The user can specify the maximum number of candidate trees to control the computational efforts required to produce the final solution. In the tree-induction process, an allocation scheme is used to dynamically distribute the given number of candidate trees to splitting attributes according to their estimated contributions to cost reduction. The algorithm finds the final tree by backtracking. An extensive experiment shows that the algorithm outperforms the top-down heuristic and can effectively obtain the optimal or near-optimal decision trees without an excessive computation time.
COMPRESSED FILTER FOR REAL TIME IMPLEMENTATION OF SIMULTANEOUS LOCALIZATION AND MAP BUILDING

This work addresses the real time implementation aspects of Simultaneous Localization and Map Building (SLAM). It presents a new compressed filter that can significantly reduce the computation requirements when working in local areas or with high frequency external sensors. It is shown that by extending the standard Kalman filter models the information gained in a local area can be maintained with a cost proportional to Na, being Na the number of landmarks in the area and then transferred to the global map in only one iteration at full SLAM computational cost. The algorithms are validated with experimental results obtained with a standard vehicle running in an outdoor environment.
Unit testing database applications using SpecDB: A database of software specifications

In this dissertation I introduce SpecDB, a database created to represent and host software specifications in a machine-readable format. The specifications represented in SpecDB are for the purpose of unit testing database operations. A structured representation aids in the processes of both automated software testing and software code generation, based on the actual software specifications. I describe the design of SpecDB, the underlying database that can hold the specifications required for unit testing database operations. Specifications can be fed directly into SpecDB, or, if available, the formal specifications can be translated to the SpecDB representation. An algorithm that translates formal specifications to the SpecDB representation is described. The Z formal specification language has been chosen as an example for the translation algorithm. The outcome of the translation algorithm is a set of machine-readable formal specifications. To demonstrate the use of SpecDB, two automated tools are presented. The first automatically generates database constraints from represented business rules in SpecDB. This constraint generator gives the advantage of enforcing some business rules at the database level for better data quality. The second automated application of SpecDB is a reverse engineering tool that logs the actual execution of the program from the code. By Automatically comparing the output of this tool to the specifications in SpecDB, errors of commission are highlighted that might otherwise not be identified. Some errors of commission including coding unspecified behavior together with correct coding of the specifications cannot be discovered through black box testing techniques, since these techniques cannot observe what other modifications or outputs have happened in the background. For example, black box, functional testing techniques cannot identify an error if the software being tested produced the correct specified output but more over, sent classified data to insecure locations. Accordingly, the decision of whether a software application passed a test depends on whether it coded all the specifications and only the specifications for that unit. Automated tools, using the reverse engineering application introduced in this dissertation, can thus automatically make the decision whether the software passed a test or not based on the provided specifications.
Violation Monitoring System for Power Construction Site

Automatic detection of violations will improve the efficiency of enterprise management and reduce the workload of employees. In this paper, a construction site monitoring system based on Tiny-yolo-dense is developed for three common violations of electric power construction site: no safety helmet, safety gloves and no labour suits. The experimental results show that the system can meet the requirements of real-time and accuracy of power construction site monitoring.
Evaluation Of Some Superscalar And VLIW Processor Designs

iii ACKNOWLEDGEMENTS I w ould like to thank my advisor, Professor Wen-mei Hwu, for his technical advice and patience. I have learned more from Wen-mei than could ever be written in a thesis. I wish to extend my appreciation to for their outstanding technical input on this project. William wrote the trace generator and a simulator for VLIW architectures. His understanding of trace generation proved to be very valuable. Scott wrote the optimizing compiler and was always there when I had questions. He also improved the code scheduler. Tom was very helpful in answering questions about simulation on micro-architectures. Rick wrote the register allocator. Pohua is responsible for writing most of the IMPACT-I C compiler and helped me start on this work. He is also responsible for the original code scheduler. Finally, I wish to thank everyone above and all of my other friends who have made my life in graduate school very enjoyable.
Memory, Thinking and Language: Topics in Cognitive Psychology

1. Introduction 2. Thinking and Knowledge 3. The Structure of Knowledge 4. Active Memory 5. Language and Knowledge 6. Language and Communication 7. Knowledge, Speech and Action: The Halfway Mark 8. Problem-Solving 9. Learning, Acting and Speaking 10. Implications for Teaching 11. Knowing and Doing: What's It All About? Suggestions for Further Reading. References and Name Index. Subject Index.