Effects of Homophily on Citation Patterns in Scientific Communities

Indiviidid kipuvad looma sidemeid pigem nende isikutega, kellega neil on sarnaseid huvisid või muud ühist. Bibliomeetria kontekstis avaldub sama põhimõte viitamise mustrites - artiklites viidatakse muuhulgas ka autorite endi ning nende koostööpartnerite artiklitele. Eelneva valguses on käesoleva töö eesmärgiks projekteerida bibliomeetrilised indikaatorid, mis võimaldaks meil arvestada sarnasuse mõju teadlaste ning teadusasutuste hindamisel. Konkreetsemalt defineeritakse käesolevas töös sarnasuse alusel kärbitud ja kaalutud versioonid viidete arvu meetrikale. On ilmselge, et sarnasust arvestavad meetrikad annavad kõrgema hinnangu kogukondadele, kus on tava viidata eelkõige teiste kogukondade autorite artiklitele. Samuti kirjeldatakse ning analüüsitakse antud töös viitamise mustreid, mis tuvastati kirjeldatud meetrikate rakendamisel viidete võrgule kolme erineva teadlaste kogukonna puhul.Individuals tend to establish ties in higher rate with individuals that exhibit some kind of affinity than with dissimilar ones. This principle, referred to as homophily, has a important impact in the shape of the social interactions, i.e., topologies of the underlying social networks. In the context of bibliometrics, the effects of homophily can be observed in patterns of citation: references often include a non-negligeable number of self-citations and citations from close collaborators. In light of the above, we aim at designing bibliometric indicators that allow us to modulate the effect of homophily in the ranking induced by metrics. Clearly, homophily-aware metrics would favor communities where citations involve a broader participation. In this thesis, we present homophily-trimmed and homophily-weighted versions of the citation count and report on the patterns of citation uncovered by such metrics over the citation network for three different communities

The Economic Value of the Precision Disease Management System for Anthracnose and Botrytis Fruit Rot for the Florida Strawberry Industry

The objective of this study was to examine the economic benefits associated with precision fungicide application system for Florida strawberry production. Given the weather and disease forecast system developed by the University of Florida researchers (Peres, 2010a , strawberry growers can potentially 1) reduce fungicide application rates during cool and dry conditions without affecting yields, thus reducing production costs; or 2) apply fungicide at the precise time of high disease pressure during warm and wet weather, therefore, decreasing disease development and spread, and increasing the yields and profits.fungicide application reduction, precision disease management system, strawberry, effect on yield, Agribusiness, Agricultural and Food Policy, Crop Production/Industries, Environmental Economics and Policy, Food Consumption/Nutrition/Food Safety, Production Economics, Risk and Uncertainty,

Planar Matching in Streams Revisited

We present data stream algorithms for estimating the size or weight of the maximum matching in low arboricity graphs. A large body of work has focused on improving the constant approximation factor for general graphs when the data stream algorithm is permitted O(n polylog n) space where n is the number of nodes. This space is necessary if the algorithm must return the matching. Recently, Esfandiari et al. (SODA 2015) showed that it was possible to estimate the maximum cardinality of a matching in a planar graph up to a factor of 24+epsilon using O(epsilon^{-2} n^{2/3} polylog n) space. We first present an algorithm (with a simple analysis) that improves this to a factor 5+epsilon using the same space. We also improve upon the previous results for other graphs with bounded arboricity. We then present a factor 12.5 approximation for matching in planar graphs that can be implemented using O(log n) space in the adjacency list data stream model where the stream is a concatenation of the adjacency lists of the graph. The main idea behind our results is finding "local" fractional matchings, i.e., fractional matchings where the value of any edge e is solely determined by the edges sharing an endpoint with e. Our work also improves upon the results for the dynamic data stream model where the stream consists of a sequence of edges being inserted and deleted from the graph. We also extend our results to weighted graphs, improving over the bounds given by Bury and Schwiegelshohn (ESA 2015), via a reduction to the unweighted problem that increases the approximation by at most a factor of two

A Simple, Space-Efficient, Streaming Algorithm for Matchings in Low Arboricity Graphs

We present a simple single-pass data stream algorithm using O((log n)/eps^2) space that returns an (alpha + 2)(1 + eps) approximation to the size of the maximum matching in a graph of arboricity alpha

Analysis of relationship for conflict management in the organisation

Статья посвящена исследованию причин возникновения конфликтных ситуаций на примере Уральского управления государственного автодорожного надзора Федеральной службы по надзору в сфере транспорта, а также определения личностных предрасположенностей сотрудников к конфликтному поведению, выявления определенных стилей разрешения конфликтной ситуации. Автором разработаны практические рекомендации по профилактике конфликтных ситуаций в организации.The article is devoted to the study of the causes of conflict on the example of Ural management of the state road supervision of the Federal service for supervision in the sphere of transport, as well as a definition of personal dispositions of employees to conflict behavior, the identification of specific styles to resolve conflict. The author developed practical recommendations for the prevention of conflict situations in the organization

Massive Graph Analysis in the Data Stream Model

Graphs have become an abstraction of choice in modeling highly-structured data. The need to compute graph-theoretic properties of datasets arises in many applications that involve entities and pairwise relations between them. However, in practice the datasets in question can be too large to be stored in main memory, distributed across many machines, or changing over time. Moreover, in an increasing number of applications the algorithm has to make real time decisions as the data arrives, which puts further limitations on the time and space that can realistically be used. These characteristics render classical algorithmic approaches obsolete and necessitate the development of new techniques. The streaming model of computation takes these challenges into account, providing a trade-off between the resources used by the algorithm and its accuracy. A graph stream is defined by a sequence of edge insertions (and sometimes deletions) into an initially empty graph. The objective is to compute a certain property of the graph at the end of the stream while minimizing the amount of space the algorithm uses. In this model, we explore fundamental graph-theoretic problems that also serve as important primitives in massive graph analysis. Our results can be divided into three main categories: Finding large matchings and related problems. We describe two optimal algorithms for finding large matchings in dynamic (insert-delete) graph streams---an approximation of an arbitrary maximum matching and an exact algorithm under the assumption that the matching is of certain size. We also show how the techniques developed in these algorithms can be used to solve a variety of related problems such as vertex cover and hitting set in hypergraphs. We then concentrate on estimating just the size of the matching and present a series of sublinear results for the class of low arboricity graphs. Counting the number of cycles. We fully resolve in which settings there exist algorithms approximating the number of fixed length cycles that do not store the entire graph. For cycles of length five or greater, we show that no such algorithms exist. For triangles and four-cycles, we describe several counting results and a few lower bounds for the insert-only model, considering such parameters as the number of passes taken over the stream and its ordering. Vertex ordering problems in directed graphs. We consider such fundamental problems as topologically sorting a directed acyclic graph (DAG), checking whether the input is in fact a DAG, and finding a minimum feedback arc set. It can be shown that when the input graph is arbitrary, these problems have high space complexity in the streaming model. Thus, we concentrate on designing algorithms for tournaments and a certain family of random graphs. Together, these results complement the much more mature body of work on algorithms for undirected graph streams

Ideology and Pragmatism in the Bilateral Relations with the United States: Brazil and Bolivia

Introduction. The article reviews the trajectory of international cooperation in the Western Hemisphere on the example of the case studies of Brazil-U.S. and Bolivia-U.S. bilateral relations, which experienced a significant change due to inner-political transformations in the countries. The main purpose of the study is to assess the degree of variability in the foreign policy, implemented by governments belonging to different political spectrum. Methods. The research is lined up on a comparison of the foreign policy of left governments of Luiz Inбcio Lula da Silva and Dilma Rousseff in Brazil and Evo Morales in Bolivia, as well as the shift to the “right” of the administrations of Michel Temer and Jeanine Бсez are in focus. The study also reveals the activities of the current administrations of Jair Bolsonaro (since 2019) in Brazil and Luis Arce (since 2020) in Bolivia. Analysis. Thus, orientation towards independence and aspiration to oppose Washington during the period of the “left turn” was prevalent. At the same time, interim administrations’ denial of the principles of anti-Americanism did not lead to the long-term results and radical progress in relations. Nevertheless, there is no reason to point out a formation of a trend towards the dependence of the Latin American countries on the changes in U.S. policy. On the contrary, the line to the independence and sovereignty, which was developed in the previous decade, is being maintained. Results. The dynamics of the analyzed bilateral relations and the adjustment of the foundations of cooperation in multilateral formats indicate a strong subjective factor and an increasing influence of ideology in the foreign policy of the states in the region

Development of Resilience Among Young People as Prevention of Deviation

Молодежь как социально-демографическая группа людей наиболее подвержена стрессу. Неспособность справиться со стрессом может способствовать формированию девиаций и разрушению личности. В статье исследована взаимосвязь показателей уровня стресса и резилентности и установлено, что развитие компонентов резилентности среди молодежи снижает уровень стресса и способствует профилактике девиаций.Young people, as a socio-demographic group of people, are affected with stress. The inability to cope with stress can contribute to the formation of deviations and the destruction of personality. In this article, we investigated the relationship between stress and resilience and found that the development of resilience components among young people reduces stress levels and contributes to the prevention of deviations