Sistema para agendamento de apresentações entre conjuntos musicais e casas noturnas

Orientadora: Prof.ª Dr.ª Rafaela Mantovani FontanaMonografia (especialização) - Universidade Federal do Paraná, Setor de Educação Profissional e Tecnológica, Curso de Especialização em Engenharia de SoftwareInclui referênciasResumo: As cidades brasileiras contam com um aquecido mercado musical local, repleto de conjuntos musicais que se apresentam em casas noturnas durante todas as épocas do ano. Para que estes eventos ocorram, é necessário o agendamento entre os dois parceiros, "bandas" e "pubs". Até recentemente, a grande maioria dos agendamentos ocorria de maneira analógica, por meio de ligações telefônicas ou conversas presenciais. Foi da última década para cá que este trabalho de agendamento começou a ser realizado majoritariamente por meio digital, através de aplicativos de mensagens - segundo pesquisa realizada com o público-alvo. Neste trabalho, realizou-se o desenvolvimento de um aplicativo móvel multiplataforma (Android e iOS) destinado a realizar o agendamento desses eventos, bem como a busca por parceiros comerciais por cada uma das partes. Para tal, foram utilizadas as tecnologias: Spring Boot, Java, Flutter, Dart e MySQLAbstract: Brazilian cities have a hot local music market, full of musical groups that perform in nightclubs throughout the year. For this, it is necessary to schedule events between these two partners (also known as "bands" and "pubs"). Until recently, the vast majority of appointments took place analogously, through phone calls or face-toface conversations. It was in the last decade that this scheduling work began to be done mostly digitally, through messaging applications - according to a survey carried out with the target audience. In this work, a multiplatform mobile application (Android and iOS) was developed to schedule these events, as well as the search for commercial partners by each of the parts. For this purpose, the following technologies were used: Spring Boot, Java, Flutter, Dart and MySQL

Ethics Dumping Case Studies from North-South Research Collaborations

This book provides original, up-to-date case studies of “ethics dumping” that were largely facilitated by loopholes in the ethics governance of low and middle-income countries. It is instructive even to experienced researchers since it provides a voice to vulnerable populations from the fore mentioned countries. Ensuring the ethical conduct of North-South collaborations in research is a process fraught with difficulties. The background conditions under which such collaborations take place include extreme differentials in available income and power, as well as a past history of colonialism, while differences in culture can add a new layer of complications. In this context, up-to-date case studies of unethical conduct are essential for research ethics training

Phase transition in a stochastic prime number generator

We introduce a stochastic algorithm that acts as a prime number generator. The dynamics of such algorithm gives rise to a continuous phase transition which separates a phase where the algorithm is able to reduce a whole set of integers into primes and a phase where the system reaches a frozen state with low prime density. We present both numerical simulations and an analytical approach in terms of an annealed approximation, by means of which the data are collapsed. A critical slowing down phenomenon is also outlined.Comment: accepted in PRE (Rapid Comm.

Number theoretic example of scale-free topology inducing self-organized criticality

In this work we present a general mechanism by which simple dynamics running on networks become self-organized critical for scale free topologies. We illustrate this mechanism with a simple arithmetic model of division between integers, the division model. This is the simplest self-organized critical model advanced so far, and in this sense it may help to elucidate the mechanism of self-organization to criticality. Its simplicity allows analytical tractability, characterizing several scaling relations. Furthermore, its mathematical nature brings about interesting connections between statistical physics and number theoretical concepts. We show how this model can be understood as a self-organized stochastic process embedded on a network, where the onset of criticality is induced by the topology.Comment: 4 pages, 3 figures. Physical Review Letters, in pres

Revealing Robust Oil and Gas Company Macro-Strategies using Deep Multi-Agent Reinforcement Learning

The energy transition potentially poses an existential risk for major international oil companies (IOCs) if they fail to adapt to low-carbon business models. Projections of energy futures, however, are met with diverging assumptions on its scale and pace, causing disagreement among IOC decision-makers and their stakeholders over what the business model of an incumbent fossil fuel company should be. In this work, we used deep multi-agent reinforcement learning to solve an energy systems wargame wherein players simulate IOC decision-making, including hydrocarbon and low-carbon investments decisions, dividend policies, and capital structure measures, through an uncertain energy transition to explore critical and non-linear governance questions, from leveraged transitions to reserve replacements. Adversarial play facilitated by state-of-the-art algorithms revealed decision-making strategies robust to energy transition uncertainty and against multiple IOCs. In all games, robust strategies emerged in the form of low-carbon business models as a result of early transition-oriented movement. IOCs adopting such strategies outperformed business-as-usual and delayed transition strategies regardless of hydrocarbon demand projections. In addition to maximizing value, these strategies benefit greater society by contributing substantial amounts of capital necessary to accelerate the global low-carbon energy transition. Our findings point towards the need for lenders and investors to effectively mobilize transition-oriented finance and engage with IOCs to ensure responsible reallocation of capital towards low-carbon business models that would enable the emergence of fossil fuel incumbents as future low-carbon leaders

On a Dynamical Approach to Some Prime Number Sequences

In this paper we show how the cross-disciplinary transfer of techniques from Dynamical Systems Theory to Number Theory can be a fruitful avenue for research. We illustrate this idea by exploring from a nonlinear and symbolic dynamics viewpoint certain patterns emerging in some residue sequences generated from the prime number sequence. We show that the sequence formed by the residues of the primes modulo $k$ are maximally chaotic and, while lacking forbidden patterns, display a non-trivial spectrum of Renyi entropies which suggest that every block of size $m>1$, while admissible, occurs with different probability. This non-uniform distribution of blocks for $m>1$ contrasts Dirichlet's theorem that guarantees equiprobability for $m=1$. We then explore in a similar fashion the sequence of prime gap residues. This sequence is again chaotic (positivity of Kolmogorov-Sinai entropy), however chaos is weaker as we find forbidden patterns for every block of size $m>1$. We relate the onset of these forbidden patterns with the divisibility properties of integers, and estimate the densities of gap block residues via Hardy-Littlewood $k$-tuple conjecture. We use this estimation to argue that the amount of admissible blocks is non-uniformly distributed, what supports the fact that the spectrum of Renyi entropies is again non-trivial in this case. We complete our analysis by applying the Chaos Game to these symbolic sequences, and comparing the IFS attractors found for the experimental sequences with appropriate null models.Comment: 18 pages, 20 figure

Saccadic modulation of neural excitability in auditory areas of the neocortex

In natural "active" vision, humans and other primates use eye movements (saccades) to sample bits of information from visual scenes. In the visual cortex, non-retinal signals linked to saccades shift visual cortical neurons into a high excitability state as each saccade ends. The extent of this saccadic modulation outside of the visual system is unknown. Here, we show that during natural viewing, saccades modulate excitability in numerous auditory cortical areas with a temporal pattern complementary to that seen in visual areas. Control somatosensory cortical recordings indicate that the temporal pattern is unique to auditory areas. Bidirectional functional connectivity patterns suggest that these effects may arise from regions involved in saccade generation. We propose that by using saccadic signals to yoke excitability states in auditory areas to those in visual areas, the brain can improve information processing in complex natural settings

Analytical properties of horizontal visibility graphs in the Feigenbaum scenario

Time series are proficiently converted into graphs via the horizontal visibility (HV) algorithm, which prompts interest in its capability for capturing the nature of different classes of series in a network context. We have recently shown [1] that dynamical systems can be studied from a novel perspective via the use of this method. Specifically, the period-doubling and band-splitting attractor cascades that characterize unimodal maps transform into families of graphs that turn out to be independent of map nonlinearity or other particulars. Here we provide an in depth description of the HV treatment of the Feigenbaum scenario, together with analytical derivations that relate to the degree distributions, mean distances, clustering coefficients, etc., associated to the bifurcation cascades and their accumulation points. We describe how the resultant families of graphs can be framed into a renormalization group scheme in which fixed-point graphs reveal their scaling properties. These fixed points are then re-derived from an entropy optimization process defined for the graph sets, confirming a suggested connection between renormalization group and entropy optimization. Finally, we provide analytical and numerical results for the graph entropy and show that it emulates the Lyapunov exponent of the map independently of its sign.Comment: 19 pages, 11 figures, accepted for publication in Chao