Miracle-dz/UniFAR-FTUs huggingface dataset:
Influence of rhizome mass on the crop establishment and dry matter yield of Miscanthus×giganteus over ten seasons

The aim of the present investigation was to assess the influence of rhizome mass on the success of plantation establishment and biomass yield of the bioenergy crop M. giganteus during 10 years of cultivation. The experiment included three treatments with different rhizome masses: 10-20 g (very low); 25- 35 g (low), and 40-60 g (medium mass). Planting density was 2 rhizomes m-2. The plants were harvested by mowing of the whole above-ground biomass each year in February. Out of the total number of planted rhizomes, the lowest emergence was noticed in very low mass rhizomes. In the first season, the greatest number of stems and crop height were encountered under the treatment with the highest rhizome mass. In the second season, crop heights were almost equal in all treatments. During the first two seasons, the highest biomass yields were recorded under the treatments with the highest rhizome masses. Although the analyzed parameters were highest with the rhizomes of 40-60g during the crop establishing stage, starting from the third season of cultivation, high yields of above-ground biomass may be obtained also with lower mass rhizomes. Having the highest biomass yield (25.85? 7.36 Mg DM ha-1), the crop established with rhizomes of 25-35 g clearly stood out.
Bitkiler, herbivorlar ve doğal düşmanlar arasındaki trofik ilişkiler

Bitkiler, herbivorlar ve dogal dusmanlar arasinda karmasik trofik iliskiler mevcuttur. Hem herbivorlar hem de dogal dusmanlar, besinlerini bulmada bitkisel kaynakli kimyasallardan faydalanir. Bitkiler salgilamis olduklari kimyasallarla herbivorlari cezbeder. Bitkiler herbivorlarin saldirisina ugradiklarinda da cesitli bilesimlerde kimyasallar salgilayip, yayarlar. Bu yayilan kimyasallar, herbivor saldirisi olmadigi durumlarda ortaya cikan kimyasallardan nitelik ve nicelik olarak farklidir. Bu sekilde bitkiler tarafindan salgilanan ucucu kimyasal bilesikler, bitkinin cevresi ile olan iliskilerinin degisimine yol acmaktadir. Dogal dusmanlar (parazitoitler ve predatorler), herbivorlarin beslenmesi sonucu bitkilerin meydana getirdigi kimyasallardan olumlu sekilde etkilenebilmektedir. Ayrica dogal dusmanlar dogrudan herbivorlar tarafindan gelen sinyalleri de, konukcularini ya da avlarini bulmada kullanabilmektedir. Basarili biyolojik mucadele uygulamalari icin bitkiler, herbivorlar ve dogal dusmanlar arasinda mevcut trofik iliskilerin calisilmasi gerekmektedir
Different techniques designs for clustering of data, specially categorical data: An Overview

Mining of knowledge from a pool of data is known as data mining. One of the research potent field of research in area of data mining is clustering. The earlier work in clustering is mainly concentrated on quantitative and ordinal data or we can in general say numeric data which have an inherited order. But application of these algorithms on categorical data is not possible as these data items do not have any inherited order. Therefore it becomes necessary to have algorithms that can solve the problem of categorical data clustering. In this paper, an overview of various categorical data clustering techniques has been given.
Rainfall and other meteorological factors as drivers of urban transmission of leptospirosis

Background Leptospirosis is an important public health problem affecting vulnerable urban slum populations in developing country settings. However, the complex interaction of meteorological factors driving the temporal trends of leptospirosis remain incompletely understood. Methods and findings From 1996 to 2010, we investigated the association between the weekly incidence of leptospirosis and climatic variables in the city of Salvador, Brazil by using a dynamic generalized linear model that accounted for time lags, overall trend and seasonal variation. Our model showed an increase of leptospirosis cases associated with rainfall, lower temperature and higher humidity. There was a lag of one-to-two weeks between weekly values for significant meteorological variables and leptospirosis incidence. Independent of the season, a weekly cumulative rainfall of 20 mm increased the risk of the leptospirosis by 10% compared to a week without rain. Finally, over the 14 year study period the incidence of leptospirosis decreased significantly by four fold (12.8 versus 3.6 per 100,000 people), independently of variations in climate. Conclusions Strategies to control leptospirosis should focus on avoiding contact with contaminated sources of Leptospira as well as on increasing awareness in the population and health professionals within the short time window after both low-level and extreme rainfall events. Increased leptospirosis incidence was restricted to one-to-two weeks after those events suggesting that infectious Leptospira survival may be limited to short time intervals. Author Summary To determine the role of meteorological variables, seasonal variation and temporal trends in the incidence of leptospirosis, we investigated the time series of leptospirosis incidence amongst residents of Salvador, Brazil, from 1996 to 2010. Exploratory and confirmatory statistical methods detected associations between meteorological factors and disease incidence. Results showed the importance of extreme meteorological conditions, particularly rainfall, as short-term predictors of leptospirosis incidence. In addition, we found a long-term decreasing trend of in disease incidence over the observation period.
Speed-up of Constrained Community Detection based on Hamiltonian

Recent development of information technology and rise of social media enable us to access massive data. Large scale data such as hyperlink structure in WWW and friendship information in social media can be represented as networks based on graph theory. For analyzing such data, many methods have been proposed. Among them, the methods called community detection have advantages that they can make networks simple and easy to understand. However, most of them had not considered the background knowledge of data, thus some methods called constrained community detection which take such background knowledge into consideration have been proposed. Constrained community detection methods show robust performance on noisy data due to its background knowledge. In particular, constrained Hamiltonian-based community detection methods have advantages such as flexibility of output results. The Hamiltonian, energy in statistical mechanics, can be theoretically considered as a generalization of the Newman’s modularity. In this paper, we propose a method for accelerating constrained community detection based on Hamiltonian. Our proposed method is a variant of Blondel’s Louvain method which is known for its computational efficiency. We experimentally show that the proposed method is superior to the existing method based on simulated annealing in terms of computational efficiency, and its accuracy is as well as the existing method under the same conditions. Our method enables us to perform constrained community detection for larger networks compared with the existing method.
A note on network structure: functional relationships between network indicators

Two important aspects of network structure are network density and network centrality. These two aspects highlight different characteristics of a network. Empirical studies tend to find that one or the other is the better explanatory variable for certain aspects of corporate behaviour. This note makes a simple and compelling point. There is a hill-shaped relationship between network density and network centrality. A purely stochastic process of alliance formation will lead to a hill-shaped relationship. A mathematical, functional relationship can be shown between network density and the upper bound to network centrality. The combination of these outcomes sets lower and upper bounds on network centrality. This approach can offer a vantage point for an evolutionary study of network structure.
轉換域運算於MPEG-2 to H.264 Transcoding上之應用

Usually, video signals are compressed before they are stored or transmitted over networks. In many applications, such as transcoding, manipulation of video signals directly on the compressed bit streams is more desirable than the approach where the compressed videos are fully decoded and then manipulated, because of the computational cost issue. For energy compaction purposes, video compression methods use techniques such as discrete cosine transform (DCT) to convert video signals from the pixel domain to the transform domain. Image operations such as motion compensation and down sampling have counterparts in the transform domain. The derivations of these transform-domain counterparts are based on the orthogonality of DCT and the linearity of these operations. However, since the data is organized block by block in the transform domain, the coding operations are not straightforward when applying to the transform-domain data. Therefore, there is a need to investigate the transform-domain operations, especially for H.264, which provides many advanced coding techniques. The thesis investigates several coding operations, including transform kernel conversion, intra prediction and motion compensation for H.264. They are expected to have applications in the transform domain transcoder. In the context, we derive the transform-domain equivalent operations for these coding operations and provide the efficient way to implement the algorithm for each transform-domain operation. A transform-domain MPEG-2 to H.264 transcoder is devised, and its performance is evaluated and compared to the pixel domain approach. In this thesis, we also formulate a general problem for rounding in the transform domain. The rounding operation is commonly performed in multimedia systems. Take half-pixel motion compensation as an example. The generation of new pixels at half-pixel locations requires a rounding operation for better approximation of the pixel values. However, rounding is a nonlinear operation; so its corresponding transform-domain operation does not exist. We propose an approximate solution to this problem and demonstrate that the proposed approach is better than other approaches when applied to an MPEG-2 decoder.
design and control of quadrotors with application to autonomous flying

This thesis is about modelling, design and control of Miniature Flying Robots (MFR) with a focus on Vertical Take-Off and Landing (VTOL) systems and specifically, micro quadrotors. It introduces a mathematical model for simulation and control of such systems. It then describes a design methodology for a miniature rotorcraft. The methodology is subsequently applied to design an autonomous quadrotor named OS4. Based on the mathematical model, linear and nonlinear control techniques are used to design and simulate various controllers along this work. The dynamic model and the simulator evolved from a simple set of equations, valid only for hovering, to a complex mathematical model with more realistic aerodynamic coefficients and sensor and actuator models. Two platforms were developed during this thesis. The first one is a quadrotorlike test-bench with off-board data processing and power supply. It was used to safely and easily test control strategies. The second one, OS4, is a highly integrated quadrotor with on-board data processing and power supply. It has all the necessary sensors for autonomous operation. Five different controllers were developed. The first one, based on Lyapunov theory, was applied for attitude control. The second and the third controllers are based on PID and LQ techniques. These were compared for attitude control. The fourth and the fifth approaches use backstepping and sliding-mode concepts. They are applied to control attitude. Finally, backstepping is augmented with integral action and proposed as a single tool to design attitude, altitude and position controllers. This approach is validated through various flight experiments conducted on the OS4.
Windows NT/2000 Native API Reference

From the Publisher: The Windows NT native application programming interface is the set of system services provided by the Windows NT executive to both user mode and kernel mode programs. These API routines are the equivalent of Unix system calls or VMS system services. The Windows NT/2000 Native API Reference provides the first comprehensive look at these so-far undocumented services. A unique tool for software developers who need to create or maintain utility applications under Windows NT 4.0 and 2000, this reference includes: documentation of the over 200 routines included in the native API, detailed description of those routines either not directly accessible via the Win32 API or that offer substantial additional functionality; example library routines and utility programs to demonstrate functionality of particular routines; coverage of kernel functions to support the debugging of user mode applications; and pointers to relevant documented functionality within the DDK. Because of its distance from the Windows NT operating system internals, the Win32 API does not allow access to the full functionality of operating system itself. The APIs native to Windows NT and 2000 provide a long-sought foothold into this functionality. This reference will help you to: write user mode code to interact with kernel mode applications; develop critical tools and technologies such as real-time systems, debuggers, analysis tools and device drivers; deepen your understanding of Windows NT internals; and learn what API changes are made with the release of Windows 2000. About the Author: Gary Nebbett first started working with operating systems when he joined the MultiMIRTOS development team at Standard Telecommunication Laboratories immediately after graduating from London University in 1982. (MultiMIRTOS was a real-time embedded operating system for the Intel 8086 processor.) Gary has served as a Senior Research Engineer in various organizations, since that time. He has focused on developing kernel-mode code for operating systems including Unix, VMS and Windows NT, and is practiced in modifying the behavior of applications for which only binary code is available. Through his investigation of system internals, he has developed applications not typically possible for a given operating system, including tools to trace system calls, reconstruct deleted files, and capture network traffic. Gary holds a BSc (Engineering) from Queen Mary College, University of London and lives in Basel, Switzerland. In his free time he enjoys squash, cross-country skiing, walking in the Alps, mountain biking in the Black Forest.
Spatial and temporal characteristics of bacterial parasite communities in outbreaking fossorial water vole (Arvicola terrestris) populations : static uniformity or dynamic heterogeneity?

Le campagnol terrestre, Arvicola terrestris, occasionne en France, lors de ses pullulations cycliques interannuelles, d’importants degâts aux prairies de montagne. Un groupe de travail constitue des equipes de recherche de l’Universite de Franche-Comte (UFC), de l’INRA (Centre de Biologie et de Gestion des Populations) et d’organismes agricoles (Federation Regionale de Defense contre les Organismes Nuisibles de Franche-Comte, FREDON), ont privilegie une approche « systemique » dans laquelle les interactions entre les campagnols, leur habitat (paysage, predateurs) et les pratiques agricoles sont analysees de facon hierarchisees (spatialement et temporellement). Un des objectifs est de mettre en evidence le plus grand nombre possible de facteurs de controle sur lesquels il est possible d’agir, et l'echelle a laquelle ces actions sont pertinentes. Ces etudes ont permis d’initier une strategie, experimentee avec succes, notamment en Franche-Comte et en Auvergne, et qui privilegie la lutte raisonnee. Il subsiste neanmoins des zones d’ombre relatives a la comprehension du cycle, notamment concernant les determinants de la phase de declin. Le role du cortege de pathogenes (parmi lesquels certains peuvent etre transmis a l’homme) reste pour l’instant sujet de debat dans la litterature scientifique. La comprehension des facteurs cles determinant cette phase devrait permettre aux eleveurs de mieux anticiper les impacts economiques et adopter les strategies de controles des population les plus adequates. Objectifs de la these (1) Tester les hypotheses des pathogenes et de la senescence pour expliquer le declin demographique. (2) Rechercher des indicateurs biologiques (diversite des pathogenes et/ou indicateurs immunitaires) qui permettent de predire les phases de declin et d’anticiper des mesures agricoles appropriees pour restaurer les prairies. (3) Evaluer le role de la transition entre la phase de forte densite et de declin demographique pour l’emergence de pathogenes circulants par les populations de campagnols et responsables de maladies humaines. Methodologie generale Des suivis de populations avec des prelevements reguliers (mensuels) seront realises sur plusieurs populations (repliquats) dans la periode qui encadre le declin demographique. Des methodes fondees sur le sequencage a haut debit (NGS : Next Generation Sequencing) pour l’epidemiologie permettent d’etablir des catalogues complets des pathogenes (virus, bacteries, parasites) hebergees par les populations, et d’en mesurer les prevalences.
An adaptive distributed ray tracing with automatic differentiation

Ray tracing is well known as one of the most popular rendering techniques in computer graphics. In the algorithm tracing rays from a viewpoint and calculation of intersection between rays and objects are essential. Since the rays are usually defined as piecewise lines precisely, they can not include the neighbor situation even if the neighbor is very close. Therefore the rays must be distributed, i.e., additional rays must be defined along with the original ones in order to obtain the neighbor situation. In this paper we introduce the so-called automatic differentiation to detection whether the rays are to be distributed or not. In the proposed method each calculation of the ray tracing has its differentiation with respect to coordinates and time. Then we can discover where the rays need distribution. This approach makes the distribution adaptive so that the computational cost becomes low.
Interest point detection method based on multi-scale Gabor filters

In this study, a novel interest point detection algorithm which combines image intensity variation and edge contour information is proposed. Firstly, the Canny edge contour detector is used to extract the edge map. Secondly, the imaginary parts of multi-scale Gabor filters are applied to smooth input image and then the normalised information entropies at various scales can be acquired. Finally, multiplication of different normalised information entropies will be served as a new measure for interest point that can also be used for interest point detection. This method has two advantages: on the one hand, detection accuracy is greatly improved because combination information is adopted to extract interest points including contour shape information, grey variation of edge pixels and their neighbours; on the other hand, non-interest points can be well inhabited due to multi-scale product in detector is served as an interest point measure. Also, desirable noise robustness and time efficiency are validated through experiments. Compared with four other state-of-art methods, the proposed method shows excellent performance in terms of geometric transformations and localisation accuracy of repeated interest points.
WASMII: a data driven computer on a virtual hardware

Virtual hardware is a technique to realize a large digital circuit with a small real hardware by using an extended Field Programmable Gate Array (FPGA) technology. Several configuration RAM modules are provided inside the FPGA chip, and the configuration of the gate array can be rapidly changed by replacing the active module. Data for configuration are transferred from an off-chip backup RAM to an unused configuration RAM module. A novel computation mechanism called the WASMII, which executes a target data flow graph directly, is proposed on the basis of the virtual hardware. A WASMII chip consists of the FPGA for virtual hardware and the additional mechanism to replace configuration RAM modules in the data driven manner. Configuration data are preloaded by the order which is assigned in advance with a static scheduling preprocessor. By connecting a number of WASMII chips, a highly parallel system can be easily constructed. <<ETX>>
FIGURE OUT PERSPECTIVES: PERCEPTUALLY REALISTIC AVATAR VISUALIZATION

Projection of three-dimensional space onto a twodimensional surface relies on the computer graphics camera based in design on the camera obscura. Geometrical limitations of this model lead to perspective distortions in wide-angle projections. Including the camera model, our approach is to involve the human perception in order to create a realistic spatial impression by a two-dimensional image. This paper discusses the influence of multi-perspective on three-dimensional computer graphics in virtual worlds based on the rules of perspective projection enhanced by characteristics of visual perception and techniques of Renaissance painting. The aim is to provide human-centered interfaces for an efficient and coherent communication of spatial information in virtual worlds to support avatarmediated interaction with its need for correct depiction of human figures concerning proportion and orientation. To this end, we explain an object-based and introduce a camera-based computer graphics procedure to prevent projective distortions and misalignments.
Design of wideband wireless LANs through performance charts

The paper proposes a design methodology for the development of wideband wireless local area networks. The approach moves from a modeling environment where the value of a properly defined cost-to-benefit of the system is adopted to measure the design effectiveness. A possible design tool consists of performance charts where the design requirements are related to the model parameters and hence, to the system parameters. The general design formulation and the performance charts are presented.
Modeling microbial diversity with metabolic trade-offs

ABSTRACT Nature exhibits much higher biodiversity than predicted by theories of competition. One solution for reconciling this “paradox of the plankton” is to imposes metabolic trade-offs, where species need to allocate limited cellular resources into multiple functions. However, two questions exist for metabolic models: first, as many such models have been proposed with diverse assumptions and different results, can we find a universal language to summarize various models into one unified framework? Second, under the pressure of evolution, will there be a single optimal metabolic strategy that finally dominates over all others? In this work, we address these two questions by constructing a generalizable framework to describe the species-environment feedback in chemostat-type resource-competition models. Employing this framework, a fitness landscape based on the strategy-growth rate relationship can be constructed. Species are capable of creating their own fitness landscape by shaping their nutrient environment, which allows for dynamic fitness landscapes and rich ecological behaviors, and is crucial for biodiversity in all the models we examined. A non-invasible strategy corresponds to a species creating a fitness landscape that places itself at the top. Under certain conditions, more than one species is required to complete this task, which leads to evolutionarily stable coexistence. Our approach facilitates quantitative understanding of chemostat experiments, and provides insight into the competitive-exclusion paradox.