Miracle-dz/UniFAR-FTUs huggingface dataset:
LNEP WCMC Global Ecological Forest Classification and Forest Protected Area Gap Analysis

The United Nations Environment Programme World Conservation Monitoring Centre (UNEP-WCMC) is the biodiversity assessment and policy implementation arm of the United Nations Environment Programme (UNEP), the world's foremost intergovernmental environmental organization. The Centre has been in operation since 1989, combining scientific research with practical policy advice. UNEP-WCMC provides objective, scientifically rigorous products and services to help decision makers recognize the value of biodiversity and apply this knowledge to all that they do. Its core business is managing data about ecosystems and biodiversity, interpreting and analysing that data to provide assessments and policy analysis, and making the results available to international decision-makers and businesses. Disclaimer: The contents of this report do not necessarily reflect the views or policies of UNEP-WCMC, other contributory organisations and the supporting institutions. The designations employed and the presentations do not imply the expressions of any opinion whatsoever on the part of UNEP-WCMC, other contributory organisations and the supporting institutions concerning the legal status of any country, territory, city or area or its authority, or concerning the delimitation of its frontiers or boundaries. and recommendations in view of the 10% target for forest protection under the Convention on Biological Diversity (CBD). 2nd revised edition. Preface Deforestation and forest degradation continue at an alarming rate worldwide and jeopardise the tremendous diversity of species and habitat types present in forests around the globe. They also put at risk the large variety of ecosystem services forests provide to humankind. In view of this global problem, the Convention on Biological Diversity (CBD) at its Ninth Conference of the Parties (COP9) reconfirmed the target of having " at least 10% of each of the world's forest type effectively conserved " (decision IX/5, Programme of Work on Forest Biological Diversity). The present study illustrates the major issues related to this target, such as the geographic distribution of the world's remaining forest areas, difficulties related to the world's forest types and WWF ecoregions, and an up-to-date global gap analysis for forest protected areas. The objectives of this study were developed within a larger project carried out by the Institute of Forest and Environmental Policy (IFP), University of Freiburg, called " Conservation of forest biodiversity under the CBD: Options for a global forest protected area network ". Its overall aim was to provide scientific analyses and policy advice with regard to the feasibility, financing and targets for the establishment of a global network of forest …
Self-Determination Motivation and Perceived Barriers in the Vegetable Eating Context

SELF-DETERMINATION MOTIVATION AND PERCEIVED BARRIERS IN THE VEGETABLE EATING CONTEXT Vera Bogdanovich University of Guelph, 2013 Advisors: Dr. Sunghwan Yi Dr. Vinay Kanetkar Mean daily vegetable consumption is below the recommended 7-10 servings in the diet of adult Canadians. This thesis aims to investigate the moderating role of perceived barriers on the relationship between motivation and (greater) vegetable consumption. 606 people from the Ontario Food panel participated in the online study. The results identified a positive moderating effect of perceived barriers on the relationship between autonomous motivation and vegetable consumption (p < .05) and negative approaching significance moderating effect of perceived barriers on controlled motivation and vegetable intake (p = 0.056). Also four motivational profiles of consumers were identified and described in terms of vegetable consumption, food related behaviors, stages of change and socio-demographic characteristics. These results extend the Self-Determination Theory with perceived barriers component and can inform intervention program development for social marketers and policy makers.
LiHB: Lost in HTTP Behaviors - A Behavior-Based Covert Channel in HTTP

The application-layer covert channels have been extensively studied in recent years. Information-hiding in ubiquitous application packets can significantly improve the capacity of covert channels. However, the undetectability is still a knotty problem, because the existing covert channels are all frustrated by proper detection schemes. In this paper, we propose LiHB, a behavior-based covert channel in HTTP. When a client is browsing a website and downloading webpage objects, we can reveal some fluctuation behaviors that the distribution relationship between the ports opening and HTTP requests are flexible. Based on combinatorial nature of distributing N HTTP requests over M HTTP flows, such fluctuation can be exploited by LiHB channel to encode covert messages, which can obtain high stealthiness. Besides, LiHB achieves a considerable and controllable capacity by setting the number of webpage objects and HTTP flows. Compared with existing techniques, LiHB is the first covert channel implemented based on the unsuspicious behavior of browsers, the most important application-layer software. Because most HTTP proxies are using NAPT techniques, LiHB can also operate well even when a proxy is equipped, which poses a serious threat to individual privacy. Experimental results show that LiHB covert channel achieves a good capacity, reliability and high undetectability.
An Integrated Investigation into A Communication Network for A PCBA System

For the successful integration of a highly automated printed circuit board assembly (PCBA) system consisting of assembly robots and associated control devices using a local area network (LAN), it is crucial to deliver the desired cost effective functional integration specified and required by the systems' analysts, designers or their clients. Such a highly integrated time-critical environment often requires a full system evaluation, i.e., the investigation of the system's performance cannot only focus on the operations aspect without considering the performance of the communication environment. Until recently, however, system designers lacked a feasible approach that allows investigators to take both aspects into account. Meanwhile, decision makers and managers from companies often demand fast delivery of an outcome, which gives a preview of the overall system performance before implementation of the actual system. This paper presents a method that may provide a useful aid for system designers to examine both the assembly system and its communication system by formulating an integrated process. This involves modelling the basic manufacturing operations and incorporating the effect of the communication system in order to detect and eliminate any fatal bottlenecks that may occur in the system. This method has been tested by applying it into a fairly complex PCBA system as a case study.
Parametrization of Closed Surfaces for 3-D Shape Description

This paper presents procedures for the explicit parametric representation and global description of surfaces of simply connected 3-D objects. The novel techniques overcome severe limitations of earlier methods (restriction to star-shaped objects (D. H. Ballard and Ch. M. Brown, Computer Vision, Prentice-Hall, Englewood Cliffs, NJ, 1981), constraints on positioning and shape of cross-sections (F. Solina and R. Bajcsy, IEEE Trans. Pattern Anal. Much. Intell. 12(2), 1990, 131-147; L. H. Staib and J. S. Duncan, in Visualization in Biomedical Computing 1992 (R. A. Robb, Ed.), Vol. Proc. SPIE 108, pp. 90-104, 1992), and nonhomogeneous distribution of parameter space). We parametrize the surface by defining a continuous, one-to-one mapping from the surface of the original object to the surface of a unit sphere. The parametrization is formulated as a constrained optimization problem. Practicable starting values are obtained by an initial mapping based on a heat conduction model. The parametrization enables us to expand the object surface into a series of spherical harmonic functions, extending to 3-D the concept of elliptical Fourier descriptors for 2-D closed curves (E. Persoon and K. S. Fu, IEEE Trans. Syst. Man Cybernetics 7(3), 1977, 388-397; F. P. Kuhl and Ch. R. Giardina, Comput. Graphics Image Process. 18(3), 1982, 236-258). Invariant, object-centered descriptors are obtained by rotating the parameter net and the object into standard positions. The new methods are illustrated with 3-D test objects. Potential applications are recognition, classification, and comparison of convoluted surfaces or parts of surfaces of 3-D shapes.
Robust transmission of variable-length encoded sources

Digital communications systems commonly use compression (source coding) and error control (channel coding) to allow efficient and robust transmission of data over noisy channels. When compression is imperfect, some residual redundancy remains in the transmitted data and can be exploited at the decoder to improve the decoder's probability-of-error performance. A new approach to joint source-channel maximum a posteriori probability (MAP) decoding applicable to systems employing variable-length source codes (VLCs) was previously developed by the authors-the resulting joint decoder's structure is similar to that of the conventional Viterbi decoder. This paper extends the authors' previous work to address the problem of error propagation, an inherent problem with using VLCs. Options considered include list decoding, trellis-pruning, and composite schemes. Simulation results presented show that the proposed techniques can result in significant improvement in decoding performance.
A Dynamic Approach for Eecient Tcp Buuer Allocation

Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works, must be obtained from the IEEE. Abstract The paper proposes local and global optimization schemes for eecient TCP buuer allocation in an HTTP server. The proposed local optimization scheme dynamically adjusts the TCP send-buuer size to the connection and server characteristics. The global optimization scheme divides a certain amount of buuer space among all active TCP connections. These schemes are of increasing importance due to the large scale of TCP connection characteristics. The schemes are compared to the static allocation policy employed by a typical HTTP server, and shown to achieve considerable improvement to server performance and better utilization of its resources. The schemes require only minor code changes and only at the server.
Mammalian GRIP domain proteins differ in their membrane binding properties and are recruited to distinct domains of the TGN

The four mammalian golgins, p230/golgin-245, golgin-97, GCC88 and GCC185 are targeted to trans-Golgi network (TGN) membranes by their C-terminal GRIP domain in a G-protein-dependent process. The Arf-like GTPase, Arl1, has been shown to mediate TGN recruitment of p230/golgin245 and golgin-97 by interaction with their GRIP domains; however, it is not known whether all the TGN golgins bind to Arl1 and whether they are all recruited to the same or different TGN domains. Here we demonstrate differences in membrane binding properties and TGN domain recruitment of the mammalian GRIP domain proteins. Overexpression of full-length GCC185 resulted in the appearance of small punctate structures dispersed in the cytoplasm of transfected cells that were identified as membrane tubular structures by immunoelectron microscopy. The cytoplasmic GCC185-labelled structures were enriched for membrane binding determinants of GCC185 GRIP, whereas the three other mammalian GRIP family members did not colocalize with the GCC185-labelled structures. These GCC185-labelled structures included the TGN resident protein α2,6 sialyltransferase and excluded the recycling TGN protein, TGN46. The Golgi stack was unaffected by overexpression of GCC185. Overexpression of both full-length GCC185 and GCC88 showed distinct and nonoverlapping structures. We also show that the GRIP domains of GCC185 and GCC88 differ in membrane binding properties from each other and, in contrast to p230/golgin-245 and golgin-97, do not interact with Arl1 in vivo. Collectively these results show that GCC88, GCC185 and p230/golgin245 are recruited to functionally distinct domains of the TGN and are likely to be important for the maintenance of TGN subdomain structure, a critical feature for mediating protein sorting and membrane transport.
Applications of Support Vector Mathine and Unsupervised Learning for Predicting Maintainability Using Object-Oriented Metrics

Importance of software maintainability is increasing leading to development of new sophisticated techniques. This paper presentes the applications of support vector machine and unsupervised learning in software maintainability prediction using object-oriented metrics. In this paper, the software maintainability predictor is performed. The dependent variable was maintenance effort. The independent variable were five OO metrics decided clustering technique. The results showed that the Mean Absolute Relative Error (MARE) was 0.218 of the predictor. Therefore, we found that SVM and clustering technique were useful in constructing software maintainability predictor. Novel predictor can be used in the similar software developed in the same environment.
Draft Genome Sequence of Lactococcus lactis subsp. lactis bv. diacetylactis CRL264, a Citrate-Fermenting Strain

ABSTRACT We report the draft genome sequence of Lactococcus lactis subsp. lactis bv. diacetylactis CRL264, a natural strain isolated from artisanal cheese from northwest Argentina. L. lactis subsp. lactis bv. diacetylactis is one of the most important microorganisms used as starter culture around the world. The CRL264 strain constitutes a model microorganism in the studies on the generation of aroma compounds (diacetyl, acetoin, and 2,3-butanediol) by lactic acid bacteria. Our genome analysis shows similar genetic organization to other available genomes of L. lactis bv. diacetylactis strains.
Monte-Carlo image retargeting

In this paper an efficient method for image retargeting is proposed. It relies on a monte-carlo model that makes use of image saliency. Each random sample is extracted from deformation probability mass function defined properly, and shrinks or enlarges the image by a fixed size. The shape of the function, determining which regions of the image are affected by the deformations, depends on the image saliency. High informative regions are less likely to be chosen, while low saliency regions are more probable. Such a model does not require any optimization, since its solution is obtained by extracting repeatedly random samples, and allows real-time application even for large images. Computation time can be additionally improved using a parallel implementation.
Expertise community detection

Providing knowledge workers with access to experts and communities-of-practice is central to sharing expertise and crucial to organizational performance, adaptation, and even survival. This paper covers ongoing research to develop an Expert Locator prototype, a model-based system for detecting experts and broader communities-of-practice. The underlying expertise model is extensible and supports aggregation of evidence across diverse sources. The prototype is being used to locate critical expertise in key project areas, and current evaluation indicates its potential effectiveness.
Assessment of Entropy Based Method of Variable Choice in Cluster Analysis

— In the paper, we investigate the efficiency of an algorithm for the choice of variables in cluster analysis built on the entropy approach (Dash & Liu, 2000). The assessment of this algorithm is carried out on synthetic data sets in the form of the mixtures of normal distributions. It turns out that the method is not working so well as the Authors of the entropy based approach suggested. The method fails in presence of correlation between masking variables.
Head pose 3D data web-based visualization

An approach build on discriminative random regression forests was followed in order to achieve fast, accurate and reliable estimation of head pose in uncontrolled environment. Data representing the changes of a person's head direction, concerning two Degrees of Freedom (DOF), pitch and yaw, are collected and stored adopting a lightweight data exchange format (JavaScript Object Notation-JSON). After that, a web visualization approach is proposed in order to improve the understanding and the analysis of the captured 3D data.
Extracting descriptions of problems with product and services from twitter data

There is enough evidence that social media contains timely information that businesses could use to their benefits. In this paper we discuss automatic extraction of descriptions of problems from twitter data. More specifically we present a system that filters tweets related to an enterprise and extracts descriptions of problems with their product/service. First step of this extraction process is to identify the tweets containing such descriptions. We view this as text classification problem. We propose that sentences describing problems can be characterized by their lexical and syntactic structure. Our experiments show that use of such structural features in classification models, results in the F-measure of 0.742. It is a significant improvement over a baseline F-measure of 0.66, obtained by using only word ngram features. Since twitter data is dynamic, classification models have to be adopted to changing nature of problems and language distributions. We describe a simple adaptation scheme, and experimentally demonstrate its effectiveness. Finally we discuss our method to pinpoint the phrases describing the problems in the identified tweets. We show that by using simple syntactic pattern an extraction F-measure of 0.434 is achieved. Considering the noise in the tweeter data this level of performance is quite encouraging. General Terms Text classification, Information extraction, Natural Language processing, Machine Learning
Matrix Partitioning : Optimal bipartitioning and heuristic solutions

Cover image: Optimal 2-way partitioning of the 60 × 60 matrix prime60, consisting of 462 nonzeroes. The prime60 matrix elements are defined by: a ij = 0 if i mod j = 0 or j mod i = 0 1 otherwise The load imbalance of this partitioning is no larger than ε = 3%, and its communication volume is equal to 14. The partitioning was calculated by the optimal branch and bound method described in this thesis. ii A B S T R A C T An important component of many scientific computations is the matrix-vector multiplication. An efficient parallelization of the matrix-vector multiplication would instantly lower computation times in many areas of scientific computing, and enable solving larger problems than is currently possible. A major obstacle in development of this parallelization is finding out how to distribute the matrix data over all processors without introducing a large communication cost. This problem can be accurately modelled by the matrix partitioning problem with an appropriate cost function. In this thesis, an optimal branch-and-bound algorithm for 2-way matrix partitioning is developed. Since matrix partitioning is NP-Complete, a polynomial time algorithm is not expected to exist. However, several lower bounds on the cost of branches of the branching-tree are introduced in this thesis, reducing the computation time of the optimal algorithm significantly. Comparisons with Integer Linear Programs that solve the same problem show that the branch-and-bound method is efficient in solving the 2-way matrix partitioning problem. The algorithm was able to find the optimal 2-way partitioning of 75% of all matrices of the University of Florida Sparse Matrix Collection [12] with at most 200 rows or columns. Finally, several suggestions for further research on optimal bipartitioning matrices are given. In Chapter 3, using information on common characteristics of optimal solutions, a new heuristic method is developed that attempts to find good solutions in polynomial time. This heuristic is not based on hypergraphs, as most publicly available partitioners are, but uses a novel partitioning model. The model assigns individual rows and columns to different processors, ensuring a low computation time, and allows for 2-dimensional partitionings, ensuring a high solution quality. In its current form, the heuristic partitions the matrix in p parts directly when solving the p-way partitioning problem, avoiding the possible negative effects of recursive bisection. Furthermore, a multilevel scheme is included to enable solving extremely large matrices in reasonable time. Comparison of …
Predicting the Next Change at the Fine-Grained Level

Changing source code is not an easy task. Developers occasionally change source code incorrectly or overlook code fragments that need to be changed. Such mistakes entail additional cost in having to reedit the source code correctly, and repeated changes themselves can be a hazard to software quality. We are conducting research into realizing automated code changing as a countermeasure for human errors. As the first step of this research, in this paper we propose a technique to predict what kinds of program elements will be deleted and added in the next change to Java methods. We also evaluate two types of prediction using the proposed technique. One is predicting all types of program elements. The other is predicting only program elements that are statements or larger elements. The precision of the two types of prediction were experimentally found to be 54%-96% and 73%-99%, respectively.
Therapy with cyclosporine in experimental murine myocarditis with encephalomyocarditis virus.

To explain the progression from infectious viral myocarditis to congestive cardiomyopathy an infection/immune hypothesis has been proposed stating that the primary viral process incites an excessive or disordered immunologic response against the myocardium. To test whether one form of immunosuppressive therapy might ameliorate this process, we used cyclosporine in a murine preparation of infectious myocarditis (encephalomyocarditis [EMC] virus), which has been shown to result in a congestive cardiomyopathy pathologically similar to that seen in man. Eight-week-old male DBA-2 mice were infected with EMC virus and randomized to a treatment or control group. Cyclosporine (25 mg/kg/day) was administered subcutaneously for 3 weeks, starting (1) at 1 week after infection during viral replication, and (2) at 3 weeks after infection, after the period of active viral replication. In mice treated during viral replication there was a significantly higher mortality rate compared with that of control mice (15/21 vs 9/29, p = .01). There was no evident reduction in myocardial pathology (inflammation, necrosis, or calcification) in the treated compared with the control groups. In mice treated after the period of viral replication, there was no improvement in mortality (8/22 vs 2/19, NS) compared with control. Treated mice showed no reduction in myocardial histopathologic lesions. Furthermore, treated mice had significantly greater heart weight/body weight ratios (1.3 +/- 0.4% vs 1.0 +/- 0.3%, p less than .005), lung weight/body weight ratios (1.1 +/- 0.5% vs 0.8 +/- 0.3%, p less than .05), and liver weight/body weight ratios (6.0 +/- 0.8% vs 5.4 +/- 0.6%, p less than .005) than control mice, suggesting more severe myocardial failure. (ABSTRACT TRUNCATED AT 250 WORDS)