A Rede Enraizados e o Movimento Hip Hop: ritornelos territoriais e o desenvolvimento da rádio web

O hip hop é um movimento político, social e cultural presente nas periferias do Brasil desde 1980. O hip hop vem se desenvolvendo ao longo dos anos, criando espaço, ganhando visibilidade e ampliando o seu público, principalmente entre os segmentos das juventudes urbanas. O presente trabalho teve como objetivo principal investigar o Movimento Enraizados, uma organização hip hop da Baixada Fluminense, que articula e interage com parceiros em diversos estados e alguns países. Nesse contexto, o estudo selecionou três questões como eixos para a análise. Como foi criada a Rede Enraizados e quais são suas principais características? Como o Movimento Enraizados produz territórios existenciais na Baixada Fluminense? Como o Movimento Enraizados utiliza a linguagem radiofônica para expressar suas ações? Para a análise das questões levantadas, a pesquisa utilizou o referencial teórico de Antonio Negri e Deleuze & Guattari, costurando os conceitos de comum, multidão, rádios livres, ritornelos, territórios. A sede do Movimento Enraizados, em Morro Agudo / Nova Iguaçu, é o centro Rede Enraizados e responsável pela dinamização das informações em seus diversos canais de comunicação. Ao disparar seus projetos e iniciativas na construção de uma rede intercontinental de apoio-mútuo, o Movimento Enraizados desterritorializa sentidos e práticas da Baixada Fluminense. Essa desterritorialização produz uma mensagem potente de militância cultural para jovens e fortalece redes para a construção de novas resistências biopolíticas nesses territórios.

Eyes on their fingertips: some aspects of the arts, science, technology and culture of the fisherfolk of Trivandrum, India

Eyes on Their Finger Tips deals with the traditional marine wisdom of a set of people and the rarest of rare experiences they have had at sea. Through these numerous chapters he takes us into the seas of the fishers. It is a voyage which we cannot make in reality. But through the heroic deeds of his father, the riddles of oldman Sebesti, the shark story of brother Kamalappan, and the rituals of his mother, we get a fascinating peep into the wisdom of the watery world of the small-scale fishers of Trivandrum, Kerala, India.

Beyond niche thinking: Market selection in science-based ventures

Matching a new technology to an appropriate market is a major challenge for new technology-based firms (NTBF). Such firms are often advised to target niche-markets where the firms and their technologies can establish themselves relatively free of incumbent competition. However, technologies are diverse in nature and do not benefit from identical strategies. In contrast to many Information and Communication Technology (ICT) innovations which build on an established knowledge base for fairly specific applications, technologies based on emerging science are often generic and so have a number of markets and applications open to them, each carrying considerable technological and market uncertainty. Each of these potential markets is part of a complex and evolving ecosystem from which the venture may have to access significant complementary assets in order to create and sustain commercial value. Based on dataset and case study research on UK advanced material university spin-outs (USO), we find that, contrary to conventional wisdom, the more commercially successful ventures were targeting mainstream markets by working closely with large, established competitors during early development. While niche markets promise protection from incumbent firms, science-based innovations, such as new materials, often require the presence, and participation, of established companies in order to create value. © 2012 IEEE.

大型公共环境人员疏散路径规划研究

大型公共环境人员疏散路径规划研究对指导安全设施建设、应急预案的制定、实施和推演都有重要意义。近年来进化计算领域兴起的分布估计算法为路径规划问题的解决提供了新的优化工具。本论文将一种典型的分布估计算法——贝叶斯优化算法，应用到大型公共环境人员疏散路径规划问题解决过程中，针对单路径人员疏散、多路径人员疏散和多目标点人员疏散三类具体的疏散路径规划问题，分别设计和实现了相应的基于贝叶斯优化的人员疏散路径规划算法，并在仿真实验中根据大型公共环境空间类型复杂和人员相对密集等特点，面向不同的规划要求和目的，求解出了满足约束条件的最优疏散路径集合。 本文提出的基于贝叶斯优化的人员疏散路径规划算法，以大型公共环境的基本信息已知为前提，基于二维环境下的拓扑空间法，按照应用系统的规划要求，通过引入疏散性能，路径安全性和易通性等参数，对疏散空间建立全局环境模型；在系统分析分布估计算法基本框架和特点的基础上，引入其中一类典型算法——贝叶斯优化算法，设计出一系列适于不同疏散路径规划问题的基于贝叶斯优化的路径规划算法。该算法用贝叶斯网络对优选路径集合建立概率模型，并由建立起的贝叶斯网络产生新的路径集合，与原有路径进行竞争，可以在找到一条最优的路径集合的同时，利用中间结果，快速找出多条较优的路径。仿真实验标明，该算法可以有效的满足大型公共环境下人员疏散的任务要求。

基于DSRC的多功能不停车收费系统

DSRC标准是ISO/TC204制定的智能交通系统(ITS)中车—路信息通讯的协议。采用双片式ETC电子标签结合双界面IC卡的储值卡方案形成的多功能不停车收费系统,充分兼容了当前国内普遍应用的IC卡半自动收费方式,集中了IC卡收费系统和ETC收费系统的优点,方便、快捷、通行能力强,并解决了收费口的交通拥挤现象。

五十万年来人类对黄土地区的适应性初步研究

After researching the coupling relationship among choosing raw material, stone technology, environmental change and Huaman evolution stage of archeological sites in different sediment in north China, the author thinks that: The human behavior is different in loessic region between glacial and interglacial ages. In Human evolution procession, Human erectus and early Human sapiens may co-exist in north China before L2, but after L2Human erectus disappear, and the stone technology of early Human sapiens become more progression. After comparing the age and environment, geology context, stone technology and using fire between them, we may make a preliminary conclusion that the environmental change during L2 maybe the outer reason and different capability of adaptation between Human erectus and early Human Sapiensis is the inner reason of Human erectus becoming disappear. The environmental change in last glacial climax and deglacial may result in new crowd and new culture entering into North China, which break the culture tradition which exist since early stage of palaeolithic. And play an important role from palaeolithic stage into neolithic stage. So unstable envirnmental change play an important role in Human evolution procession, and different scale environment change have different effect, large scale environmental change make small effect, but millenary scale even more short scale environmental change may bear more important role, some times it can transfer the evolution direction.

Intelligence in Scientific Computing

Combining numerical techniques with ideas from symbolic computation and with methods incorporating knowledge of science and mathematics leads to a new category of intelligent computational tools for scientists and engineers. These tools autonomously prepare simulation experiments from high-level specifications of physical models. For computationally intensive experiments, they automatically design special-purpose numerical engines optimized to perform the necessary computations. They actively monitor numerical and physical experiments. They interpret experimental data and formulate numerical results in qualitative terms. They enable their human users to control computational experiments in terms of high-level behavioral descriptions.

Swimming in Space-Time

Cyclic changes in the shape of a quasi-rigid body on a curved manifold can lead to net translation and/or rotation of the body in the manifold. Presuming space-time is a curved manifold as portrayed by general relativity, translation in space can be accomplished simply by cyclic changes in the shape of a body, without any thrust or external forces.

The Role of Programming in the Formulation of Ideas

Classical mechanics is deceptively simple. It is surprisingly easy to get the right answer with fallacious reasoning or without real understanding. To address this problem we use computational techniques to communicate a deeper understanding of Classical Mechanics. Computational algorithms are used to express the methods used in the analysis of dynamical phenomena. Expressing the methods in a computer language forces them to be unambiguous and computationally effective. The task of formulating a method as a computer-executable program and debugging that program is a powerful exercise in the learning process. Also, once formalized procedurally, a mathematical idea becomes a tool that can be used directly to compute results.

The Criminalization of Mass Starvations: From Natural Disaster to Crime Against Humanity

Edkins Jenny, 'The Criminalisation of Mass Starvations: From Natural Disaster to Crime Against Humanity', In: 'The New Famines: Why Famines Persist in an Era of Globalisation', (New York: Routledge), pp.50-65, 2006 RAE2008

International evidence on the payout ratio, earnings, dividends and returns

ap Gwilym, Owain, et al., 'International evidence on the payout ratio, earnings, dividends and returns', Financial Analysts Journal (2006) 62(1) pp.36-53 RAE2008

„Livre des merveilles”. Burgundzka wizja Orientu późnego średniowiecza w miniaturach manuskryptu fr. 2810 z Bibliothèque nationale de France

Wydział Historyczny: Instytut Historii Sztuki

To Queue or Not to Queue: When Queueing is Better Than Timesharing in a Distributed System

We examine the question of whether to employ the first-come-first-served (FCFS) discipline or the processor-sharing (PS) discipline at the hosts in a distributed server system. We are interested in the case in which service times are drawn from a heavy-tailed distribution, and so have very high variability. Traditional wisdom when task sizes are highly variable would prefer the PS discipline, because it allows small tasks to avoid being delayed behind large tasks in a queue. However, we show that system performance can actually be significantly better under FCFS queueing, if each task is assigned to a host based on the task's size. By task assignment, we mean an algorithm that inspects incoming tasks and assigns them to hosts for service. The particular task assignment policy we propose is called SITA-E: Size Interval Task Assignment with Equal Load. Surprisingly, under SITA-E, FCFS queueing typically outperforms the PS discipline by a factor of about two, as measured by mean waiting time and mean slowdown (waiting time of task divided by its service time). We compare the FCFS/SITA-E policy to the processor-sharing case analytically; in addition we compare it to a number of other policies in simulation. We show that the benefits of SITA-E are present even in small-scale distributed systems (four or more hosts). Furthermore, SITA-E is a static policy that does not incorporate feedback knowledge of the state of the hosts, which allows for a simple and scalable implementation.

Task Assignment in a Distributed System: Improving Performance by Unbalancing Load

We consider the problem of task assignment in a distributed system (such as a distributed Web server) in which task sizes are drawn from a heavy-tailed distribution. Many task assignment algorithms are based on the heuristic that balancing the load at the server hosts will result in optimal performance. We show this conventional wisdom is less true when the task size distribution is heavy-tailed (as is the case for Web file sizes). We introduce a new task assignment policy, called Size Interval Task Assignment with Variable Load (SITA-V). SITA-V purposely operates the server hosts at different loads, and directs smaller tasks to the lighter-loaded hosts. The result is that SITA-V provably decreases the mean task slowdown by significant factors (up to 1000 or more) where the more heavy-tailed the workload, the greater the improvement factor. We evaluate the tradeoff between improvement in slowdown and increase in waiting time in a system using SITA-V, and show conditions under which SITA-V represents a particularly appealing policy. We conclude with a discussion of the use of SITA-V in a distributed Web server, and show that it is attractive because it has a simple implementation which requires no communication from the server hosts back to the task router.

Fine-Grained Layered Multicast

Traditional approaches to receiver-driven layered multicast have advocated the benefits of cumulative layering, which can enable coarse-grained congestion control that complies with TCP-friendliness equations over large time scales. In this paper, we quantify the costs and benefits of using non-cumulative layering and present a new, scalable multicast congestion control scheme which provides a fine-grained approximation to the behavior of TCP additive increase/multiplicative decrease (AIMD). In contrast to the conventional wisdom, we demonstrate that fine-grained rate adjustment can be achieved with only modest increases in the number of layers and aggregate bandwidth consumption, while using only a small constant number of control messages to perform either additive increase or multiplicative decrease.