Miracle-dz/UniFAR-FTUs huggingface dataset:
Türkiye’nin Korunan Alanlarında Çatışma Analizi

Dunyada oldugu gibi ulkemizde de korunan alanlardaki orman, su, yaban hayati, mera vb. dogal varliklarin kullanimi, korunmasi ve yonetimi konularinda cesitli catismalar yasanmaktadir. Korunan alanlarda catisma yonetimi ilk kez 1992’de Venezuela Caracas’ta duzenlenen “IV. Dunya Milli Parklar ve Korunan Alanlar Kongresi’nde uluslararasi oneme sahip bir toplanti duzeyinde tartisilmaya baslanmistir. Surec icinde catisma yonetimi konusunda cesitli yontemler uygulanmaya ve catismanin cozumune yonelik farkli adimlar atilmaya baslanmistir. Bu calismanin temel amaci; Turkiye’deki korunan alanlarda yasanan catismalarin nedenlerini belirleyerek, catismanin konularini, taraflarini ve sonuclarini analiz etmektir. Bu amacla; Turkiye’de korunan alanlarda yasanan catismalarin neler oldugu, bu catismalarin hangi bolgelerde one ciktigi ve hangi sekilde yonetildigi konulari irdelenmeye calisilmistir. Bu kapsamda 18 Nisan 2007-22 Aralik 2017 tarihleri arasinda ulusal ve yerel basinda ve 2012-2017 tarihleri arasinda Tarim ve Orman Bakanligi’nin 15 bolge mudurlugune ait internet sitelerinde yer alan haberler incelenmis ve korunan alanlarda yasanan catismalar hakkinda cesitli veriler Belgesel Tarama Yontemi ile elde edilmis ve Icerik Analizi’yle analiz edilmistir. Bulgulara gore: Turkiye’de de korunan alanlarda yasanan catismalarin ozellikle yaban hayati, orman ve su kaynaklarinin paylasilmasi ve turizm konularinda one ciktigi tespit edilmistir. Daha cok yaban hayvanlari konusunda yasanan catismalarin haberlerde yer buldugu dikkati cekmektedir. Orman kaynaklari konusundaki catismalar daha cok biyokacakcilik konularinda agirlik kazanirken, su kaynaklari konusunda ise su kaynaklarinin durumu ve HES’ler konusunda yasanan catismalar agirlik kazanmaktadir. Turizm konusunda alan kilavuzlugu ve turizm etkinliklerinin planlanmasi surecinde catismalar yasandigi belirlenmistir.
CEM des batteries haute tension allégées pour véhicule électrique : Caractérisation de matériaux et étude du rayonnement électromagnétique

Dans l’industrie automobile, le vehicule electrique seduit de plus en plus de clients. Ce qui limite sa progression dans le marche est son manque d’autonomie. Une des solutions permettant d’augmenter l’autonomie d’un vehicule est de reduire sa masse en modifiant la geometrie des pieces et les materiaux utilises. Cependant, de tels changements peuvent avoir des impacts sur la CEM du vehicule.Les travaux de cette these portent sur l’etude de l’allegement du blindage des batteries de traction pour vehicule electrique du point de vue de la CEM. Plusieurs methodes de caracterisation de materiaux sont mises en place dans ce document. Une methode innovante reposant sur l’utilisation d’une cellule TEM ou d’une stripline a ete developpee durant ces travaux de these, elle permet de mesurer la permittivite relative complexe d’un materiau dielectrique inconnu entre 1 kHz et 1 GHz. Les proprietes electromagnetiques ainsi mesurees sont inserees dans des modeles numeriques 3D. Les methodes numeriques adaptees a ce type d’etude sont les differences finies dans le domaine temporel et la methode des moments. L’etude du rayonnement de la batterie a ete effectuee grâce a une maquette a l’echelle ½ en chambre semi-anechoique et en chambre reverberante a brassage de mode selon des montages normatifs. Des configurations plus complexes ont ensuite ete etudiees en tenant compte de l’integration du pack-batterie dans le vehicule.
A Run-time Life-cycle for Interactive Public Display Applications

Digital public display systems are becoming increasingly complex. They are moving from closed systems to open interactive systems where users can not only watch the played content but also directly or indirectly interact with them, owners can easily customize the displayed content by adding and removing applications and developers can create and distribute applications that can be used in any display. This shift needs to be accompanied by more flexible and powerful application management. What currently occurs in most public displays is that the content is displayed cyclically or randomly based on a pre-set schedule where each content is given a certain amount of time. This traditional approach limits the flexibility of public displays since it is necessary to know in advance the amount of time to properly execute the content and is gradually becoming obsolete as the public displays move to the more complex envisioned scenario. The development of public displays requires that the management of content in such devices is made in a more complete and flexible way. Therefore, we developed a public display system capable of supporting richer applications and manage the available resources more effectively. We initially defined a list of design goals that we believe will address several observed shortcomings of the current displays and will support some requirements of future displays: the capability of applications to load their resources before going to the foreground, the possibility to negotiate extra time before leaving the screen in order to finish the presentation of content, develop tools for applications to request or relinquish display time for themselves and finally enable the system to quickly pause and resume applications. We then analyzed how other existing computing platforms deal with similar issues and we proposed a runtime lifecycle for interactive public display applications that met all our initial requirements. The result was the development of a complete framework developed as a Chrome Extension supporting the proposed runtime lifecycle model for interactive public display applications. The final results showed that our approach is feasible and a possible solution to the creation of advanced public displays that support the future users, owners and developer’s needs.
Present problems of power system control. 3

This paper describes two algorithms applied for active and reactive power control in wind turbine driven doubly fed induction generator (DFIG). The first proposed method applies the PI controllers for regulation of DFIG power and the rotor current while the second one utilizes a difference approx-imation of a given flux derivative. Both algorithms are based on the model description with reference to the stator flux linkage frame. General description of the analyzed methods is delivered and some results of simulations are included.
Análise de métodos de produção de interfaces visuais para recuperação da informação

The advent of the Web and the consequent increase in the volume of electronic information had caused many problems about access, search, location and retrieval of information in large volumes of data. This work is a revision of the different models, methods and algorithms to create interfaces for Visual Information Retrieval, classified according to their production process: Analysis and Data Processing, Implementation of algorithms for classification and distribution of Visual and Application Processing Techniques of Visual. The results of other researchers want to serve as a tool for the election of one or another combination methodology in the development of specific proposals for visual interfaces for information retrieval, and suggest the need for more research into new techniques for processing visual.
Offloading Packet Processing in a Combined Router/Server

Despite the performance limitation with minimum-sized packet processing, a modern PC-based router can provide as competitive service as a specialized hardware router while offering more flexibility and possibility to extend beyond routing. We focus on a use case in which the PC-based router also functions as a server. In this paper, we propose an architecture to boost overall performance of the PC-based router by offloading packet processing tasks to the NIC. We introduce a fast path for packet forwarding based on caching of flow entries in on-board classification hardware on the NIC. We describe our design and present an experimental evaluation.
Snapchat and Sexting: A Snapshot of Baring Your Bare Essentials

1 Riva Richmond, Can You Protect Your Image While on Facebook? , N.Y. TIMES (July 24, 2009, 7:17 PM), http://gadgetwise.blogs. nytimes.com/2009/07/24/can-you-protectyour-image-while-on-facebook/; Lee Mathews, Facebook Sez, “Don’t Mind Us, We’re Just Whoring Out Your Photos”, HUFFINGTON POST TECH (July 16, 2009, 9:00 PM), http://downloadsquad.switched. com/2009/07/16/facebook-sez-dont-mind-us-were-justwhoring-out-your-photos? icid=sphere_blogsmith_inpage_downloadsquad.
The Interactive Whiteboard Revolution: Teaching with IWBs

Interactive whiteboards are not just another classroom technology. As the first digital technology designed specifically for teaching and learning, they have the potential to radically alter the way we learn and facilitate the integration and ready use of all other digital technologies - hardware and software. Just as the blackboard was the symbol and transformative technology of the 18th century classroom, the interactive whiteboard will be the centrepiece of the 21st century digital classroom.
Parallel and deterministic algorithms from MRFs (Markov Random Fields): Surface reconstruction and integration. Memorandum report

In recent years many researchers have investigated the use of Markov random fields (MRFs) for computer vision. They can be applied for example in the output of the visual processes to reconstruct surfaces from sparse and noisy depth data, or to integrate early vision processes to label physical discontinuities. Drawbacks of MRFs models have been the computational complexity of the implementation and the difficulty in estimating the parameters of the model. This paper derives deterministic approximations to MRFs models. One of the considered models is shown to give in a natural way the graduate non convexity (GNC) algorithm. This model can be applied to smooth a field preserving its discontinuities. A new model is then proposed: it allows the gradient of the field to be enhanced at the discontinuities and smoothed elsewhere. All the theoretical results are obtained in the framework of the mean field theory, that is a well known statistical mechanics technique. A fast, parallel, and iterative algorithm to solve the deterministic equations of the two models is presented, together with experiments on synthetic and real images. The algorithm is applied to the problem of surface reconstruction is in the case of sparse data. A fast algorithm ismore » also described that solves the problem of aligning the discontinuities of different visual models with intensity edges via integration. « less
Concurrency on the JVM – An investigation of strategies for handling concurrency in Java, Clojure, and Groovy.

Processors with multiple cores opens up for better utilisation of hardware resources for applications if they take advantage of concurrency and parallelism. There are several methods to reap the benefits of concurrency; software transactional memory, actors and agents, locks and threads. The use of parallelism in programming comes at a price: synchronisation between threads operating on shared memory resources. New software libraries and programming language exists to simplify implementation of parallel application and this essay investigate strategies on those with the Java Virtual Machine as a commonon denominator: Java, Clojure and Groovy.
Automatic Performance Tuning in the Zettabyte File System

As storage systems become ever larger and more complex, file systems and other storage software needs to move away from static configuration and manual performance tuning and towards dynamic configuration and automatic run-time performance tuning. The Zettabyte File System (ZFS) includes many self-tuning and self-managing algorithms. In this paper we present three of those algorithms: dynamic striping, automatic block size selection, and automatic filename based performance tuning.
Shadow removal for robust vehicle detection

Shadow removal is a critical process for any computer vision based vehicle detection system. Traditional shadow removal methods are not sufficiently robust since they frequently remove parts of the vehicles together with the shadows. For robust shadow identification and removal, shadow information must be compiled at every step of the computer vision chain from the time the shadow enters the scene until it finally disappears. In this paper we present a shadow removal algorithm that preserves the compactness of the vehicles' object masks while allowing for dealing with changing illumination conditions, long and broken shadows and multiple shadows at night. The method is based on a complex shadow model which includes, among others, information regarding: luminance and chromaticity, morphology, dynamics and spatial relations analysis.
Towards the Use of Sub-Band Processing in Automatic Speaker Recognition

Automatic speaker recognition uses a person’s voice as a means of identifying them. It has many practical applications, particularly in the area of security systems. The thesis investigates the application of neural networks (both classifying and predicting) to the problem, as well as offering a new alternative to the current wide-band approach to speaker recognition. As part of the work, a new method of ranking a speaker’s impostors is presented. It involves creating a vector quantisation (VQ) model for each potential impostor and testing this impostor model against the genuine speaker’s VQ model. The ranking of these model vs. model scores is indicative of the final ranking of the impostors, as determined by the test results. Previous methods of ranking impostors required testing the genuine speaker model with every impostor’s training utterances, which requires considerably more computation than this new method which only needs one test per impostor. Impostor ranking has potential applications in score normalisation for models which don’t use discriminative training. Such models include predictive neural networks (PNN) and vector quantisation, which both produce a score which is the distance of the test utterance from the model. These scores may be normalised by comparing them to a distance from an anti-speaker model. Using the model vs. model impostor ranking, a cohort of impostors may be selected for each speaker to represent the anti-speaker model. A normalisation method, based on cohorts of these ranked impostors, markedly improved the verification error rates of distance models for both text-dependent and text-independent conditions. Further reductions in error rates may be achieved through the use of informa­ tion complementary to the linear prediction cepstrum coefficients (LPCC). When the scores from a recogniser based on the LP residual are used in conjunction with those from an LPCC recogniser they lead to a drop in the identification error rate.
Theory-Based Bayesian Models of Inductive Inference

Abstract : Our research aims to develop computational models of inductive inference in higher-level human cognition, specifically the ability to generalize from sparse, noisy, ambiguous data, and to build more human-like machine learning systems. Work has focused on two areas of cognition: learning about categories and their properties, and learning about relational structures -- specifically, systems of causal and social relations. We have developed a theory-based Bayesian framework for modeling these learning tasks as statistical inference over hierarchies of structured knowledge representations. Our models have made several contributions. First, they have explained a broad range of phenomena with high quantitative accuracy, using a minimum of free parameters. Second, they have provided a rational framework for explaining how and why everyday induction works, in terms of approximations to optimal statistical inference in natural environments. Third, they have provided tools for elucidating people's implicit theories about the structure of the world - describing the form and content of the prior knowledge that guides inductive inference and explaining how it may be acquired from experience. Finally, our models have led to improved algorithms for machine learning of category structures and their property distributions, causal networks, and the structure of social relations, thus bringing artificial intelligence systems closer to the capacities of human intelligence at the same tone as they support a better understanding of human intelligence.
Jogos Sérios para Língua Gestual Portuguesa

A aplicacao VirtualSign consiste num Tradutor Bidirecional de Lingua Gestual Portuguesa. A aplicacao permite traduzir, de forma automatica, os gestos da lingua gestual Portuguesa para Portugues escrito e o texto escrito para os respetivos gestos em lingua gestual. A arquitetura de software que suporta a aplicacao compreende, para alem dos restantes componentes do modelo, um jogo educativo cujo objetivo e ensinar os conceitos de basicos da lingua gestual Portuguesa. O jogo compreende tres niveis que estao diretamente relacionados com o grau de dificuldade na aprendizagem da lingua gestual ao longo do tempo (carater, palavra e frase). A dificuldade aumenta com o avanco no jogo a medida que passamos da aprendizagem de letras para a aprendizagem das palavras e finalmente de frases em Lingua Gestual. Foram implementados varios desafios para o jogador, tais como a obtencao de itens para ter acesso a outras zonas, pontos de verificacao para avaliar o conhecimento em lingua gestual e minijogos divertidos. A aprendizagem e inerente ao proprio jogo. A medida que o jogador progride no jogo, ele vai aprender novos gestos em lingua gestual comecando pelo alfabeto, passando pelas palavras, ate ser capaz de reproduzir frases completas. O jogo esta preparado para funcionar em computadores pessoais e exportado para dispositivos moveis, nomeadamente Android, iOS e Windows Phone
EBChombo Software Package for Cartesian Grid, Embedded Boundary Applications

EBChombo Software Package for Cartesian Grid, Embedded Boundary Applications P. Colella D. T. Graves T. J. Ligocki G. Miller D. Modiano P. O. Schwartz B. Van Straalen J. Pilliod D. Trebotich M. Barad B. Keen A. Nonaka C. Shen Applied Numerical Algorithms Group Computational Research Division Lawrence Berkeley National Laboratory Berkeley, CA Feb. 2, 2000
A course in phonology

Preface. Acknowledgements. Readings Logistics. Key to Symbols. Part I: Phonetics and Phonology: 1. How Are Sounds Made? The Production of Obstruents. 2. Introducing Phonology. Assimilation. 3. Sonorant Consonants. 4. Natural Classes of Sounds: Distinctive Features. 5. Vowel Sounds: Cardinal Vowels. 6. Phonological Processes Involving Vowel Features. 7. The Vowels of English. 8. The Timing Tier. The Great Vowel Shift. Part II: Suprasegmental Structure: 9. The Syllable. 10. Syllable Complexity: English Phonotactics. 11. The Phenomenon of Stress: Rhythm. 12. Metrical Principles and Parameters. 13. Syllable Weight. Further Metrical Machinery. 14. Tonal Phonology. Part III: Advanced Theory: 15. Modes of Rule Application. The Cycle. 16. Domains of Rule Application: Lexical and Prosodic Phonology. 17. Aspects of Lexical Representations: Underspecification, Markedness and Feature Geometry. 18. Rules and Derivations. 19. Constraints: Optimality Theory. 20. Looking Back and Moving On. References. Glossary. Index of Languages. Index of Names. Index of Subjects.
Specifications as search keys for software libraries : a case study using Lambda Prolog

Searching through a large repository of objects can be a tedious activity if a user cannot easily identify the object of interest. In the context of software development, we describe a method of searching through program libraries using specification matching. We use signature information along with preand postcondition specifications as search keys to increase the recall and precision of a query. This paper details a case study of specification matching where we use Lambda Prolog as our specification and query language and higher-order unification to retrieve from a library of ML functions. We discuss the significance of specification matching in general and point out some open issues. ©1990 E. J. Rollins and J. M. Wing This research was sponsored by the Defense Advanced Research Projects Agency (DOD) and monitored by the Avionics Laboratory, Air Force Wright Aeronautical Laboratories, Aeronautical Systems Division (AFSQ, Wright-Patterson AFB, OH 45433-6543 under Contract F33615-87-C-1499, ARPA Order No. 4976, Amendment 20. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the Defense Advanced Research Projects Agency or the U.S. Government.
Reluctance synchronous machines and drives

1. Brushless electric machines and drives: comparison criteria and results 2. Classification of reluctance synchronous machines and drives 3. Field distribution and inductance computation 4. Cageless rotor RSMs: identification and performance 5. Cage rotor RSMs: theory and performance 6. Driving control with motion sensors 7. Driving control without sensors 8. Generator mode 9. Machine design aspects Index
Support Vector Machines and Metamorphic Malware Detection

Support Vector Machines and Metamorphic Malware Detection by Tanuvir Singh Metamorphic malware changes its internal structure with each infection, which makes it challenging to detect. In this research, we test several scoring techniques that have shown promise in metamorphic detection. We then perform a careful robustness analysis by employing morphing strategies that cause each score to fail. Finally, we show that combining scores using a Support Vector Machine (SVM) yields results that are significantly more robust than we obtained using any of the individual scores.
Au fin fond de l'Uttar Pradesh. Observations personnelles sur quelques péripéties vécues et l'empirisme qu'elles ont induit

Ce court texte presente une note de terrain, initialement redigee apres deux premieres annees de these. Elle permet de saisir les difficultes concretes rencontrees lors d’une recherche doctorale menee a travers quatre petites municipalites a l’est de l’Uttar Pradesh, un Etat pauvre au nord de l’Inde. En presentant quelques-uns des aleas auxquels il a pu etre confronte, l’auteur souhaite montrer que ces experiences, parfois malaisees, ne sont jamais insurmontables et constituent au final une r.
Interactive Cases in MIS

There is no turning back on the information age. Employers are very interested in employees that understand the appropriate use of information technology to support their organization. This does not mean that the students must be able to program; however they do need to understand the issues associated with applying information technology. In addition educational institutions are exploring the use of technology enhanced delivery methodologies, such as the world wide web. This research evaluated the effectiveness of the use of a computerized, interactive case. This case uses hypertext media to engage the students in a problem solving activity in which they apply theory learned in lecture and text material to successfully accomplish a "real world" type problem. This is an example of an active learning methodology, which leads to improved learning of the content areas, with higher-order reasoning and increased retention.
Doing Task-Based Teaching

There is currently enormous interest in task-based teaching and learning. But some teachers are still unsure of how to put it into practice. This book gives examples of a range of task sequences suitable for all levels of learners, using both written and spoken English. The advice is based firmly in the classroom and includes contributions from teachers from around the world who are enthusiastic about task-based teaching. It takes account of research into language learning, and is ideal for both practising teachers and those on TEFL/TESOL courses. Name of Series: Oxford Handbooks for Language Teachers