A partial solution for D-unification based on a reduction to AC 1-unification

Author(s):  
Evelyne Contejean
Keyword(s):  
Author(s):  
Thomas N. Sherratt ◽  
David M. Wilkinson

Why do we age? Why cooperate? Why do so many species engage in sex? Why do the tropics have so many species? When did humans start to affect world climate? This book provides an introduction to a range of fundamental questions that have taxed evolutionary biologists and ecologists for decades. Some of the phenomena discussed are, on first reflection, simply puzzling to understand from an evolutionary perspective, whilst others have direct implications for the future of the planet. All of the questions posed have at least a partial solution, all have seen exciting breakthroughs in recent years, yet many of the explanations continue to be hotly debated. Big Questions in Ecology and Evolution is a curiosity-driven book, written in an accessible way so as to appeal to a broad audience. It is very deliberately not a formal text book, but something designed to transmit the excitement and breadth of the field by discussing a number of major questions in ecology and evolution and how they have been answered. This is a book aimed at informing and inspiring anybody with an interest in ecology and evolution. It reveals to the reader the immense scope of the field, its fundamental importance, and the exciting breakthroughs that have been made in recent years.


Author(s):  
Yun Peng ◽  
Byron Choi ◽  
Jianliang Xu

AbstractGraphs have been widely used to represent complex data in many applications, such as e-commerce, social networks, and bioinformatics. Efficient and effective analysis of graph data is important for graph-based applications. However, most graph analysis tasks are combinatorial optimization (CO) problems, which are NP-hard. Recent studies have focused a lot on the potential of using machine learning (ML) to solve graph-based CO problems. Most recent methods follow the two-stage framework. The first stage is graph representation learning, which embeds the graphs into low-dimension vectors. The second stage uses machine learning to solve the CO problems using the embeddings of the graphs learned in the first stage. The works for the first stage can be classified into two categories, graph embedding methods and end-to-end learning methods. For graph embedding methods, the learning of the the embeddings of the graphs has its own objective, which may not rely on the CO problems to be solved. The CO problems are solved by independent downstream tasks. For end-to-end learning methods, the learning of the embeddings of the graphs does not have its own objective and is an intermediate step of the learning procedure of solving the CO problems. The works for the second stage can also be classified into two categories, non-autoregressive methods and autoregressive methods. Non-autoregressive methods predict a solution for a CO problem in one shot. A non-autoregressive method predicts a matrix that denotes the probability of each node/edge being a part of a solution of the CO problem. The solution can be computed from the matrix using search heuristics such as beam search. Autoregressive methods iteratively extend a partial solution step by step. At each step, an autoregressive method predicts a node/edge conditioned to current partial solution, which is used to its extension. In this survey, we provide a thorough overview of recent studies of the graph learning-based CO methods. The survey ends with several remarks on future research directions.


2020 ◽  
Vol 70 (2) ◽  
pp. 497-503
Author(s):  
Dipendu Maity ◽  
Ashish Kumar Upadhyay

Abstract If the face-cycles at all the vertices in a map are of same type then the map is said to be a semi-equivelar map. There are eleven types of semi-equivelar maps on the torus. In 1972 Altshuler has presented a study of Hamiltonian cycles in semi-equivelar maps of three types {36}, {44} and {63} on the torus. In this article we study Hamiltonicity of semi-equivelar maps of the other eight types {33, 42}, {32, 41, 31, 41}, {31, 61, 31, 61}, {34, 61}, {41, 82}, {31, 122}, {41, 61, 121} and {31, 41, 61, 41} on the torus. This gives a partial solution to the well known Conjecture that every 4-connected graph on the torus has a Hamiltonian cycle.


Author(s):  
Rosy Oh ◽  
Joseph H.T. Kim ◽  
Jae Youn Ahn

In the auto insurance industry, a Bonus-Malus System (BMS) is commonly used as a posteriori risk classification mechanism to set the premium for the next contract period based on a policyholder's claim history. Even though the recent literature reports evidence of a significant dependence between frequency and severity, the current BMS practice is to use a frequency-based transition rule while ignoring severity information. Although Oh et al. [(2020). Bonus-Malus premiums under the dependent frequency-severity modeling. Scandinavian Actuarial Journal 2020(3): 172–195] claimed that the frequency-driven BMS transition rule can accommodate the dependence between frequency and severity, their proposal is only a partial solution, as the transition rule still completely ignores the claim severity and is unable to penalize large claims. In this study, we propose to use the BMS with a transition rule based on both frequency and size of claim, based on the bivariate random effect model, which conveniently allows dependence between frequency and severity. We analytically derive the optimal relativities under the proposed BMS framework and show that the proposed BMS outperforms the existing frequency-driven BMS. Later, numerical experiments are also provided using both hypothetical and actual datasets in order to assess the effect of various dependencies on the BMS risk classification and confirm our theoretical findings.


Author(s):  
Casey B Mulligan ◽  
Xavier Sala-i-Martin

Abstract What economic forces create and sustain old-age Social Security as a public program? We relate political, efficiency, and narrative theories of Social Security to empirical results reported in our companion paper in this volume. Political theories, including rational majority voting and pressure group theories, feature a redistributive struggle among groups. "Efficiency theories," which model SS as a full or partial solution to market failure, include optimal redistribution, retirement insurance, and alleviating labor market congestion. Finally we analyze three "narrative" theories. Overall, retirement, and not alleviating poverty, seems important at the margin, which means that plans to reduce intergenerational redistribution may not be politically sustainable merely because they provide "adequate" incomes for the elderly. Politics seem important, because cross-cohort redistribution is so prevalent, even when the old are consuming as much or more than do the young. SS reform would therefore be assisted by political reforms equalizing political power across generations.


2006 ◽  
Vol 96 (1) ◽  
pp. 127-151 ◽  
Author(s):  
Shamena Anwar ◽  
Hanming Fang

We propose a simple model of trooper behavior to design empirical tests for whether troopers of different races are monolithic in their search behavior, and whether they exhibit relative racial prejudice in motor vehicle searches. Our test of relative racial prejudice provides a partial solution to the well-known inframarginality and omitted-variables problems associated with outcome tests. When applied to a unique dataset from Florida, our tests soundly reject the hypothesis that troopers of different races are monolithic in their search behavior, but the tests fail to reject the hypothesis that troopers of different races do not exhibit relative racial prejudice.


Author(s):  
M.V. Sukhoterin ◽  
◽  
A.M. Maslennikov ◽  
T.P. Knysh ◽  
I.V. Voytko ◽  
...  

Abstract. An iterative method of superposition of correcting functions is proposed. The partial solution of the main differential bending equation is represented by a fourth-degree polynomial (the beam function), which gives a residual only with respect to the bending moment on parallel free faces. This discrepancy and the subsequent ones are mutually compensated by two types of correcting functions-hyperbolic-trigonometric series with indeterminate coefficients. Each function satisfies only a part of the boundary conditions. The solution of the problem is achieved by an infinite superposition of correcting functions. For the process to converge, all residuals must tend to zero. When the specified accuracy is reached, the process stops. Numerical results of the calculation of a square ribbed plate are presented.


2021 ◽  
Vol 16 (1) ◽  
pp. 65-73
Author(s):  
Aleksandra A. Khadynskaya ◽  

The relevance of the study is dictated by the need to identify intertextual connections in the lyrics by I. Elagin as evidence of the dialogic nature of his poems, their close connection with the Russian and world literary tradition. The article reveals the problem of detecting intertextual sources in the poetry of the second wave of emigration due to its poor study at the level of poetics, a partial solution of which is proposed in this publication. The novelty of the research lies in the detection of allusions and quotations that have not previously attracted the attention of researchers studying the work by I. Elagin. The aim of the study is to determine the allusive background of the Elagin's lyrics, which is necessary for the poet to organize a cultural dialogue with the metropolis of the literature. Based on the goal, the research methods were determined: the analysis of intertextual relations based on a comparative and historical-literary approach. In the course of the study, conclusions were drawn about the presence of a number of new, previously unnoticed allusive sources of Elagin's lyrics, consonant with his outlook of the emigrant poet, and also revealed the dialogical nature of his work, which is distinguished by the tragic outlook of a man of the new “neon age” - a time that does not accept poetry. In addition, it was determined that his intertextual dialogue with classics and contemporaries reveals the polemic and ambiguousness of his attitude to the new industrial age and, at the same time, faith in the unlimited possibilities of the poetic word, due to the fact that for Elagin, as a poet who formed abroad, it was important to define his own poetic genealogy and his place among Russian poets. As a research perspective, it should be noted the possibility of further consideration of the complex of intertextual connections of the poet, demonstrating his desire to be included in the circle of the “big” literature of the metropolis, to declare the uninterrupted tradition of Russian poetry, but at the same time showing a new look at them from the position of a “non-Soviet” person aesthetic space. Keywords; Ivan Elagin, poetry of the second wave of Russian emigration, intertextual connections, poetry of Russian emigration, literary allusion, traditions of Russian literature


Sign in / Sign up

Export Citation Format

Share Document