171,588 research outputs found
Doerr, Charles A.
No full textEdith C. Doerr - wifehttps://stars.library.ucf.edu/cfm-ch-memoranda-1921/1245/thumbnail.jp
Blood will have blood: Vengeance and Injustice in Salman Rushdie’s Shalimar the Clown
No full textRevenge, as a violent redressing following the perception of injustice or wrongdoing by others, is a complex sentiment that links contrasting concepts such as love, hate, history, pain and justice in Salman Rushdie’s Shalimar the Clown. The assassination of prominent politician and World War hero Max Ophuls in front of his illegitimate daughter India by a Kashmiri known as Shalimar the Clown provokes an unstoppable chain of events that reveals a wealth of undiscovered changes of identity and unaddressed crimes. After discovering his wife had left him for Max, Shalimar’s suffering and burning desire to deliver revenge on a cold platter of his own gradually involves entire families, religious and political groups and the justice system itself, thus surpassing boundaries of morality, culture, time and space. Likewise, upon discovering the truth about her parents and their assassin, India – who regains her true name Kashmira in the process – is deeply affected and also seeks revenge. Her confused state of mind leads her to ponder on how problematic it is to delimit righteous revenge and relate it with justice, be it official or ‘poetic’. Shalimar’s subsequent capture marks the beginning of a duel between the two protagonists who use different means to punish the other. Kashmira combines psychological torture and a determining testimony in court that dismisses Shalimar’s solid ‘reasonable betrayed Muslim man’ legal defence. He, on the other hand, defies the law by breaking out of prison and persistently hunting down his prey. Rushdie’s novel is therefore a telling story of the deep and troubled roots of the constant cycle binding revenge and justice, wrong and right, and of the various forces, be them avenging, legal or cosmic, through which an amendment of wrongs may be attained in a postmodern and multicultural world such as the one we live in today
The Runtime of Randomized Local Search on the generalized Needle problem
No full textInternational audienceIn their recent work, C. Doerr and Krejca (Transactions on Evolutionary Computation, 2023) proved upper bounds on the expected runtime of the randomized local search heuristic on generalized Needle functions. Based on these upper bounds, they deduce in a not fully rigorous manner a drastic influence of the needle radius k on the runtime. In this short article, we add the missing lower bound necessary to determine the influence of parameter k on the runtime. To this aim, we derive an exact description of the expected runtime, which also significantly improves the upper bound given by C. Doerr and Krejca. We also describe asymptotic estimates of the expected runtime
Playing Mastermind With Constant-Size Memory
No full textWe analyze the classic board game of Mastermind with n holes and a
constant number of colors. The classic result of Chvatal (Combinatorica 3 (1983), 325-329) states that the codebreaker can find the secret code with Theta(n / log n) questions. We show that this bound remains valid if the codebreaker may only store a constant number of guesses and answers. In addition to an intrinsic interest in this question, our result also disproves a conjecture of Droste, Jansen, and Wegener (Theory of Computing Systems 39 (2006), 525-544) on the memory-restricted black-box complexity of the OneMax function class
Spatial and temporal variations of water repellency and probability of its occurrence in calcareous Mediterranean rangeland soils affected by fires
No full textAbstract not availableMerche B. Bodí, Isabel Muñoz-Santa, Carmen Armero, Stefan H. Doerr, Jorge Mataix-Solera, Artemi Cerd
Reducing the arity in unbiased black-box complexity
No full textInternational audienceWe show that for all the -ary unbiased black-box complexity of the -dimensional \onemax function class is . This indicates that the power of higher arity operators is much stronger than what the previous bound by Doerr et al. (Faster black-box algorithms through higher arity operators, Proc. of FOGA 2011, pp. 163--172, ACM, 2011) suggests. The key to this result is an encoding strategy, which might be ofindependent interest. It shows that, using -ary unbiased variationoperators only, we may simulate an unrestricted memory of bits
Data from "Into the unknown: The role of post-fire soil erosion in the carbon cycle"
No full textWildfires directly emit 2.1 Pg carbon (C) to the atmosphere annually. The net effect of wildfires on the C cycle, however, involves many interacting source and sink processes beyond these emissions from combustion. Among those, the role of post-fire enhanced soil organic carbon (SOC) erosion as a C sink mechanism remains essentially unquantified. Wildfires can greatly enhance soil erosion due to the loss of protective vegetation cover and changes to soil structure and wettability. Post-fire SOC erosion acts as a C sink when off-site burial and stabilization of C eroded after a fire, together with the on-site recovery of SOC content, exceed the C losses during its post-fire transport. Here we synthesize published data on post-fire SOC erosion and evaluate its overall potential to act as longer-term C sink. To explore its quantitative importance, we also model its magnitude at continental scale using the 2017 wildfire season in Europe. Our estimations show that the C sink ability of SOC water erosion during the first post-fire year could account for around 13% of the C emissions produced by wildland fires. This indicates that post-fire SOC erosion is a quantitatively important process in the overall C balance of fires, and highlights the need for more field data to further validate this initial assessment.
Here we provide the post-fire SOC erosion dataset ("Post-fire SOC erosion rates" file) used for calculating the SOC ratio of eroded sediments implemented in the RUSLE modelling; as well as the list of data sources ("List of data sources" file).Ministerio de Ciencia, Innovación y Universidades, Ramón y Cajal 2021 RYC2021-031262-I; European Union, Ramón y Cajal 2021 RYC2021-031262-I; Consejo Superior de Investigaciones Científicas, Proyecto Intramural Especial20208AT007; Natural Environment Research Council, UK-FDRS (NE/T003553/1) NE/T003553/1; European Union, FirEURisk101003890Peer reviewe
Going Beyond Counting First Authors in Author Co-citation Analysis
No full textThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
- …
