scholarly journals Daily Patterns of Foraging and Aggressive Behaviors in Great-tailed Grackle (Quiscalus mexicanus) at an Urban Patch with Availability or Absence of Resources

2021 ◽  
Author(s):  
Alejandro Rodrigo ◽  
Laurent Avila-Chauvet ◽  
Jonathan Buritica

The Great-tailed Grackle (Quiscalus mexicanus) seems to take advantage of inhospitable environments such as cities. However, it is not yet fully understood how these birds exploit hostile environments to their advantage. Casual observation suggests that this species can obtain resources of biological importance such as food or nesting material from the garbage. As a first approach to the problem, we located a patch outside a residential building in a high-density urban area, where the residents left their trash for pickup. A group of wild Great-tailed grackles was identified as regular visitors. In total, 25 days were recorded at the site (November 2017 - January 2018). Events such as foraging, the number of subjects present at the foraging area, aggressive behaviors between members of the group, and their relation with the presence or absence of the garbage collector truck were registered. The results show a higher number of grackles at the observation site and a higher frequency of foraging behaviors in the presence of garbage collection than in its absence. In its presence, the distribution of foraging during the day follows a normal distribution. In the absence, the distribution shows more variability towards the day. The highest frequency of interactions occurred between two grackles, yet there were records of up to eight subjects. The highest number of aggressions registered took place in the absence of garbage collection than in its presence. Moreover, the focal subject exhibits fewer agonistic behaviors than other group members, a result expected if the producer-scrounger game literature is considered. The outcome is explained in terms of deprivation and availability of resources. Finally, we conclude that grackles can exploit hazardous environments such as cities due to the highly social behaviors exhibited during foraging.

2013 ◽  
Vol 15 (01) ◽  
pp. 1350001
Author(s):  
KONSTANTIN KOGAN ◽  
DANA SHERILL-ROFE

We address quality control of products undergoing multiple transshipment stages handled by different parties. Depending on the transportation modes, the stages may expose the products to hostile environments, such as extreme temperatures, which could influence quality. We incorporate the effect of quality on demand with the Neyman–Pearson statistical framework to study the effect of intra-competition between supply chain parties on inspection policies and thereby product quality. Specifically, we compare these policies with that of a centralized supply chain, where a single decision maker chooses the optimal inspection policies for all stages. We find that in terms of inspection policy, a party with the higher probability of nonconformance tends to inspect less under competition compared to the system-wide optimal inspection policy. Conversely, the other party may inspect more than under the system-wide optimal policy. We determine when intra-competition impacts conformance quality so that regulations are of particular importance for protecting consumers.


1999 ◽  
Vol 09 (03) ◽  
pp. 391-399 ◽  
Author(s):  
ALAIN AZAGURY ◽  
ELLIOT K. KOLODNER ◽  
EREZ PETRANK

Replication-based incremental garbage collection is one of the more appealing concurrent garbage collection algorithms known today. It allows continuous operation of the application (the mutator) with very short pauses for garbage collection. There is a growing need for such garbage collectors suitable for a multithreaded environments such as the Java Virtual Machine. Furthermore, it is desirable to construct collectors that also work on multiprocessor computers. We begin by pointing out an important, yet subtle point, which arises when implementing the replication-based garbage collector for a multithreaded environment. We first show that a simple and natural implementation of the algorithm may lead to an incorrect behavior of multithreaded applications. We then show that another simple and natural implementation eliminates the problem completely. Thus, the contribution of this part is in stressing this warning to future implementors. Next, we address the effects of the memory coherence model on this algorithm. We show that even when the algorithm is properly implemented with respect to our first observation, a problem might still arise when a multiprocessor system is used. Adopting a naive solution to this problem results in very frequent (and expensive) synchronization. We offer a slight modification to the algorithm which eliminates the problem and requires little synchronization.


2019 ◽  
Vol 13 ◽  
pp. 359-365
Author(s):  
Igor Kopeć ◽  
Jakub Smołka

In programming languages with automatic memory management garbage collection plays an important role of cleaning unused memory. Garbage collection algorithms have been developed for many years and aim to maximize the application’s performance. This paper presents and compares a performance of five garbage collection algorithms present in current version of Java 12 in three applications with different object lifetime span. The analysis covered the system responsiveness, garbage collector workload and application throughput at high application load.


10.29007/xkwx ◽  
2018 ◽  
Author(s):  
Yue Niu ◽  
Jan Hoffmann

This article introduces a novel system for deriving upper bounds on the heap-space requirements of functional programs with garbage collection. The space cost model is based on a perfect garbage collector that immediately deallocates memory cells when they become unreachable. Heap-space bounds are derived using type-based automatic amortized resource analysis (AARA), a template-based technique that efficiently reduces bound inference to linear programming. The first technical contribution of the work is a new operational cost semantics that models a perfect garbage collector. The second technical contribution is an extension of AARA to take into account automatic deallocation. A key observation is that deallocation of a perfect collector can be modeled with destructive pattern matching if data structures are used in a linear way. However, the analysis uses destructive pattern matching to accurately model deallocation even if data is shared. The soundness of the extended AARA with respect to the new cost semantics is proven in two parts via an intermediate linear cost semantics. The analysis and the cost semantics have been implemented as an extension to Resource Aware ML (RaML). An experimental evaluation shows that the system is able to derive tight symbolic heap-space bounds for common algorithms. Often the bounds are asymptotic improvements over bounds that RaML derives without taking into account garbage collection.


2021 ◽  
Vol 20 (5) ◽  
pp. 1-25
Author(s):  
Andrés Amaya García ◽  
David May ◽  
Ed Nutting

Garbage collected programming languages, such as Python and C#, have accelerated software development. These modern languages increase productivity and software reliability as they provide high-level data representation and control structures. Modern languages are widely used in software development for mobile, desktop, and server devices, but their adoption is limited in real-time embedded systems. There is clear interest in supporting modern languages in embedded devices as emerging markets, like the Internet of Things, demand ever smarter and more reliable products. Multiple commercial and open-source projects, such as Zerynth and MicroPython, are attempting to provide support. But these projects rely on software garbage collectors that impose high overheads and introduce unpredictable pauses, preventing their use in many embedded applications. These limitations arise from the unsuitability of conventional processors for performing efficient, predictable garbage collection. We propose the Integrated Hardware Garbage Collector (IHGC); a garbage collector tightly coupled with the processor that runs continuously in the background. Further, we introduce a static analysis technique to guarantee that real-time programs are never paused by the collector. Our design allocates a memory cycle to the collector when the processor is not using the memory. The IHGC achieves this by careful division of collection work into single-memory-access steps that are interleaved with the processor’s memory accesses. As a result, our collector eliminates run-time overheads and enables real-time program analysis. The principles behind the IHGC can be used in conjunction with existing architectures. For example, we simulated the IHGC alongside the ARMv6-M architecture. Compared to a conventional processor, our experiments indicate that the IHGC offers 1.5–7 times better performance for programs that rely on garbage collection. The IHGC delivers the benefits of garbage-collected languages with real-time performance but without the complexity and overheads inherent in software collectors.


Ciencia Unemi ◽  
2016 ◽  
Vol 9 (17) ◽  
pp. 80
Author(s):  
Jeaninne Sanchez Seilema ◽  
Jaime Potes Saltos ◽  
Lizan Grennady Ayol Pérez

El objetivo de la investigación fue determinar el primer nivel de Prevención en Atención Primaria en Salud, en lo que respecta a higiene laboral y su incidencia en la presentación de riesgos en la salud de los trabajadores recolectores de basura, caso del Gobierno Autónomo Descentralizado, GAD, del cantón Marcelino Maridueña, provincia del Guayas, Ecuador. En esta investigación se señala como uno de los problemas: el desconocimiento y el manejo de los respectivos protocolos de salud en cuanto a la protección de la integridad del trabajador. Se comprobó en el proceso de recolección de datos por medio de la encuesta, que no existe Atención Primaria en Salud, donde se prevenga enfermedades y riesgos de contraerlas. La Bioseguridad por medio de la protección con el equipo y materiales apropiados es de suma importancia dentro del área de recolección de basura; de eso depende el cuidado y prevención de enfermedades causadas por virus o microorganismos que incurran en cuadros clínicos complicados para la salud de los operarios, y, poder realizar sus actividades con la seguridad y confianza respectiva. Abstract The aim of this research was to determine the first level of prevention in primary health care in regard to occupational health and its impact on the presence of risks in the health of garbage collector workers from the Canton Marcelino Maridueña, GAD, Guayas province, Ecuador. In this research, it is identified as one of the problems: the lack of knowledge and management of the health protocols concerning the protection of the integrity of the worker. Based on the data collection process of the survey, it was proved that there is no primary health care to prevent the risks of acquiring diseases. Biosecurity through protection with appropriate equipment and materials is essential in the area of garbage collection; these elements are the base for the care and prevention of diseases caused by viruses or microorganisms that present complicated medical conditions for the health of workers, so they can be able to carry out their activities with safety and appropriate confidence.


2007 ◽  
Vol 7 (5) ◽  
pp. 505-536
Author(s):  
RUBEN VANDEGINSTE ◽  
BART DEMOEN

AbstractThe design and implementation of an incremental copying heap garbage collector for WAM-based Prolog systems is presented. Its heap layout consists of a number of equal-sized blocks. Other changes to the standard WAM allow these blocks to be garbage collected independently. The independent collection of heap blocks forms the basis of an incremental collecting algorithm which employs copying without marking (contrary to the more frequently used mark&copy or mark&slide algorithms in the context of Prolog). Compared to standard semi-space copying collectors, this approach to heap garbage collection lowers in many cases the memory usage and reduces pause times. The algorithm also allows for a wide variety of garbage collection policies including generational ones. The algorithm is implemented and evaluated in the context of hProlog.


Author(s):  
Tawanda Mushiri ◽  
Emmison Gocheki

The Arduino is programmed to control the robot navigation. The Garbage Collection Robot is designed to collect solid waste at public places (schools, workplaces, and parks) and residential areas. The design of the robot is such that when it starts, it maneuvers as per programmed route. The Garbage Collector can sense by means of capacitive proximity sensors if the obstacle is living (for example, a human being) or non-living (for example, vehicle) and then gives appropriate warning signals like flashing light, hoot, or voice commands. The robot is equipped with vision capabilities in order for it to detect colors, namely green, red, yellow, blue, and black for organics, plastic, metal, paper, and glass, respectively. When the GCR sees a particular color code on garbage container, it picks up the bin, carries it in its carriage, then offloads it at a desired station to wait for recycling or final dumping.


2017 ◽  
Author(s):  
Jim Albert Charlton Everett ◽  
Zachary Ingbretsen ◽  
Fiery Andrews Cushman ◽  
Mina Cikara

By many accounts cooperation appears to be a default strategy in social interaction. There are, however, several documented instances in which reflexive responding favors aggressive behaviors: for example, interactions with out-group members. We conduct a rigorous test of potential boundary conditions of intuitive prosociality by looking at whether intuition favors cooperation even towards competitive out-group members, and even in losses frames. Moreover, we address three major methodological limitations of previous research in this area: a lack of an unconstrained control condition; non-compliance with time manipulations leading to high rates of exclusions and thus a selection bias; and non-comprehension of the structure of the game. Even after eliminating participant selection bias and non-comprehension, we find that deliberation decreases cooperation: even in competitive contexts towards out-groups and even in a losses frame, though the differences in cooperation between groups was consistent across conditions. People may be intuitive cooperators, but they are not intuitively impartial.


2014 ◽  
Vol 2014 ◽  
pp. 1-8
Author(s):  
Hao Wu ◽  
Zhen-Zhou Ji

Concurrent garbage collectors (CGC) have recently obtained extensive concern on multicore platform. Excellent designed CGC can improve the efficiency of runtime systems by exploring the full potential processing resources of multicore computers. Two major performance critical components for designing CGC are studied in this paper, stack scanning and heap compaction. Since the lock-based algorithms do not scale well, we present a lock-free solution for constructing a highly concurrent garbage collector. We adopt CAS/MCAS synchronization primitives to guarantee that the programs will never be blocked by the collector thread while the garbage collection process is ongoing. The evaluation results of this study demonstrate that our approach achieves competitive performance.


Sign in / Sign up

Export Citation Format

Share Document