Directed search with real options

While search is normally modelled by economists purely in terms of decisions over making observations, this paper models it as a process in which information is gained through feedback from innovatory product launches. The information gained can then be used to decide whether to exercise real options. In the model the initial decisions involve a product design and the scale of production capacity. There are then real options to change these factors based on what is learned. The case of launching product variants in parallel is also considered. Under ‘true’ uncertainty, the model can be seen in terms of heuristic decision-making based on subjective beliefs with limited foresight. Search costs, the values of the real options, beliefs, and the cost of capital are all shown to be significant in determining the search path.

Searching behaviour and diet of Oystercatcher Haematopus ostralegus pairs feeding in their territories

Search path, searching behaviour and diet of pairs of Oystercatchers feeding in mudflat territories were studied during spring. females ate Nereis, Mya, small unidentified prey, probably Corophium, and a few Macoma, whereas males primarily ate Macoma. Even when female and male foraged in the same site, they often caught different prey. The combination of 'The Search-rate/Detection Model' (Gendron & Staddon 1983) and 'The Harvestable Prey Model' (Zwarts & Wanink 1993) provide the theoretical framework in which to explain these differences in diet. Macoma are thought to be more cryptic than Nereis, Mya and Corophium. Therefore females, while searching at a faster rate than their respective mates, caught far fewer cryptic prey, but a greater number of more conspicuous prey than their mates. On the basis of distances moved before and after capturing prey, males exhibited area-restricted searching for Macoma and Corophium. In contrast, females did not exhibit any area-restricted searching. it is suggested that the distribution of Macoma and Corophium available to males searching slowly was more clumped than that of these two prey species available to females searching more quickly.

Solution Methods for Service Network Design with Resource Management Consideration

La gestion des ressources, équipements, équipes de travail, et autres, devrait être prise en compte lors de la conception de tout plan réalisable pour le problème de conception de réseaux de services. Cependant, les travaux de recherche portant sur la gestion des ressources et la conception de réseaux de services restent limités. La présente thèse a pour objectif de combler cette lacune en faisant l’examen de problèmes de conception de réseaux de services prenant en compte la gestion des ressources. Pour ce faire, cette thèse se décline en trois études portant sur la conception de réseaux. La première étude considère le problème de capacitated multi-commodity fixed cost network design with design-balance constraints(DBCMND). La structure multi-produits avec capacité sur les arcs du DBCMND, de même que ses contraintes design-balance, font qu’il apparaît comme sous-problème dans de nombreux problèmes reliés à la conception de réseaux de services, d’où l’intérêt d’étudier le DBCMND dans le contexte de cette thèse. Nous proposons une nouvelle approche pour résoudre ce problème combinant la recherche tabou, la recomposition de chemin, et une procédure d’intensification de la recherche dans une région particulière de l’espace de solutions. Dans un premier temps la recherche tabou identifie de bonnes solutions réalisables. Ensuite la recomposition de chemin est utilisée pour augmenter le nombre de solutions réalisables. Les solutions trouvées par ces deux méta-heuristiques permettent d’identifier un sous-ensemble d’arcs qui ont de bonnes chances d’avoir un statut ouvert ou fermé dans une solution optimale. Le statut de ces arcs est alors fixé selon la valeur qui prédomine dans les solutions trouvées préalablement. Enfin, nous utilisons la puissance d’un solveur de programmation mixte en nombres entiers pour intensifier la recherche sur le problème restreint par le statut fixé ouvert/fermé de certains arcs. Les tests montrent que cette approche est capable de trouver de bonnes solutions aux problèmes de grandes tailles dans des temps raisonnables. Cette recherche est publiée dans la revue scientifique Journal of heuristics. La deuxième étude introduit la gestion des ressources au niveau de la conception de réseaux de services en prenant en compte explicitement le nombre fini de véhicules utilisés à chaque terminal pour le transport de produits. Une approche de solution faisant appel au slope-scaling, la génération de colonnes et des heuristiques basées sur une formulation en cycles est ainsi proposée. La génération de colonnes résout une relaxation linéaire du problème de conception de réseaux, générant des colonnes qui sont ensuite utilisées par le slope-scaling. Le slope-scaling résout une approximation linéaire du problème de conception de réseaux, d’où l’utilisation d’une heuristique pour convertir les solutions obtenues par le slope-scaling en solutions réalisables pour le problème original. L’algorithme se termine avec une procédure de perturbation qui améliore les solutions réalisables. Les tests montrent que l’algorithme proposé est capable de trouver de bonnes solutions au problème de conception de réseaux de services avec un nombre fixe des ressources à chaque terminal. Les résultats de cette recherche seront publiés dans la revue scientifique Transportation Science. La troisième étude élargie nos considérations sur la gestion des ressources en prenant en compte l’achat ou la location de nouvelles ressources de même que le repositionnement de ressources existantes. Nous faisons les hypothèses suivantes: une unité de ressource est nécessaire pour faire fonctionner un service, chaque ressource doit retourner à son terminal d’origine, il existe un nombre fixe de ressources à chaque terminal, et la longueur du circuit des ressources est limitée. Nous considérons les alternatives suivantes dans la gestion des ressources: 1) repositionnement de ressources entre les terminaux pour tenir compte des changements de la demande, 2) achat et/ou location de nouvelles ressources et leur distribution à différents terminaux, 3) externalisation de certains services. Nous présentons une formulation intégrée combinant les décisions reliées à la gestion des ressources avec les décisions reliées à la conception des réseaux de services. Nous présentons également une méthode de résolution matheuristique combinant le slope-scaling et la génération de colonnes. Nous discutons des performances de cette méthode de résolution, et nous faisons une analyse de l’impact de différentes décisions de gestion des ressources dans le contexte de la conception de réseaux de services. Cette étude sera présentée au XII International Symposium On Locational Decision, en conjonction avec XXI Meeting of EURO Working Group on Locational Analysis, Naples/Capri (Italy), 2014. En résumé, trois études différentes sont considérées dans la présente thèse. La première porte sur une nouvelle méthode de solution pour le "capacitated multi-commodity fixed cost network design with design-balance constraints". Nous y proposons une matheuristique comprenant la recherche tabou, la recomposition de chemin, et l’optimisation exacte. Dans la deuxième étude, nous présentons un nouveau modèle de conception de réseaux de services prenant en compte un nombre fini de ressources à chaque terminal. Nous y proposons une matheuristique avancée basée sur la formulation en cycles comprenant le slope-scaling, la génération de colonnes, des heuristiques et l’optimisation exacte. Enfin, nous étudions l’allocation des ressources dans la conception de réseaux de services en introduisant des formulations qui modèlent le repositionnement, l’acquisition et la location de ressources, et l’externalisation de certains services. À cet égard, un cadre de solution slope-scaling développé à partir d’une formulation en cycles est proposé. Ce dernier comporte la génération de colonnes et une heuristique. Les méthodes proposées dans ces trois études ont montré leur capacité à trouver de bonnes solutions.

Alienação acadêmica: uma reflexão a partir de Marx, Bauman e Castoriadis

The education is a fundamental part of a human life, extrapolating formal aspects and can be experienced in different existence activities. When the education is analyzed under a cultural context, it's noticed the influence of the education on docent and students formation, being the reproduction of this context. Thus, three aims were stablished: a) revise Marx literature about alienation; b) analyze and compare the understanding of alienation in Bauman's and Castoriadis' theory; c) suggest, from the theoretical readings, a search path in education area. For this purpose, a simple theoretical research was performed, showing the recurrent categories found in a literature review. Besides, the current context is discussed from a sociological and pedagogical point of view, focusing on raise important questioning for the educational area. The results pointed out that in a society characterized by liquid pragmatism, the students turn out to reflect their current society. It is expected - inside the limit of this study - to contributing to the formation of an education more aware of its culture that surrounds them

“Acham que brotamos das fontes dessa cidade?”: uma etnografia sobre o cotidiano de sobrevivência de pessoas em situação de rua em Nata/RN

Through participant observation, held in the administrative region east of Natal / RN, this research aimed to understand about the daily life of men and women living on the streets in the city. How they relate to the space where they live? In this relationship, which uses and survival strategies triggered by this social segment? These were some of the questions that guided this research, in order to highlight the specificities of this way of life and the possible consequences that such a situation could reverberate. In this sense, there was an effort to keep up with people on the streets, their itineraries and seize their narratives. Along the search path - which took place intermittently between the years 2011-2015 - attended spaces of occupation and traffic of this population group in the street, as well as insert me and got involved in events, forums, seminars, meetings and subject of joints on the streets as a political movement (MNPR / RN). They are considered in this study as people on the street to those who occupy the street as their main space of survival and ordering of daily life: in the streets sleep, feed themselves, meet the physiological and hygienic needs, and is where draw sustenance. The street is taken in this research in its broadest sense, including all possible places relatively protected from the cold, rain and exposure to violence, thus includes both open and public spaces: as squares and parks; but also closed and private places: hostels, abandoned warehouses, prisons, etc. It was observed that in none of these spaces guys on the street are established in a fixed manner, in contrast, they experience the roaming, which in part is due to urban systems - which tends to stigmatize them and delete them places - and the very need to survive, because while living in the street differentiated practices are triggered, and these differ from the dominant mode of sedentary life.

“Acham que brotamos das fontes dessa cidade?”: uma etnografia sobre o cotidiano de sobrevivência de pessoas em situação de rua em Nata/RN

Through participant observation, held in the administrative region east of Natal / RN, this research aimed to understand about the daily life of men and women living on the streets in the city. How they relate to the space where they live? In this relationship, which uses and survival strategies triggered by this social segment? These were some of the questions that guided this research, in order to highlight the specificities of this way of life and the possible consequences that such a situation could reverberate. In this sense, there was an effort to keep up with people on the streets, their itineraries and seize their narratives. Along the search path - which took place intermittently between the years 2011-2015 - attended spaces of occupation and traffic of this population group in the street, as well as insert me and got involved in events, forums, seminars, meetings and subject of joints on the streets as a political movement (MNPR / RN). They are considered in this study as people on the street to those who occupy the street as their main space of survival and ordering of daily life: in the streets sleep, feed themselves, meet the physiological and hygienic needs, and is where draw sustenance. The street is taken in this research in its broadest sense, including all possible places relatively protected from the cold, rain and exposure to violence, thus includes both open and public spaces: as squares and parks; but also closed and private places: hostels, abandoned warehouses, prisons, etc. It was observed that in none of these spaces guys on the street are established in a fixed manner, in contrast, they experience the roaming, which in part is due to urban systems - which tends to stigmatize them and delete them places - and the very need to survive, because while living in the street differentiated practices are triggered, and these differ from the dominant mode of sedentary life.

Optimum-Path Forest pruning parameter estimation through Harmony Search

Pattern recognition in large amount of data has been paramount in the last decade, since that is not straightforward to design interactive and real time classification systems. Very recently, the Optimum-Path Forest classifier was proposed to overcome such limitations, together with its training set pruning algorithm, which requires a parameter that has been empirically set up to date. In this paper, we propose a Harmony Search-based algorithm that can find near optimal values for that. The experimental results have showed that our algorithm is able to find proper values for the OPF pruning algorithm parameter. © 2011 IEEE.

Boosting optimum-path forest clustering through harmony Search and its applications for intrusion detection in computer networks

In this paper we propose a nature-inspired approach that can boost the Optimum-Path Forest (OPF) clustering algorithm by optimizing its parameters in a discrete lattice. The experiments in two public datasets have shown that the proposed algorithm can achieve similar parameters' values compared to the exhaustive search. Although, the proposed technique is faster than the traditional one, being interesting for intrusion detection in large scale traffic networks. © 2012 IEEE.

On the path of Exploratory Search Users - A Semantic Web tool

L’Exploratory Search, paradigma di ricerca basato sulle attività di scoperta e d’apprendimento, è stato per diverso tempo ignorato dai motori di ricerca tradizionali. Invece, è spesso dalle ricerche esplorative che nascono le idee più innovative. Le recenti tecnologie del Semantic Web forniscono le soluzioni che permettono d’implementare dei motori di ricerca capaci di accompagnare gli utenti impegnati in tale tipo di ricerca. Aemoo, motore di ricerca sul quale s’appoggia questa tesi ne è un esempio efficace. A partire da quest’ultimo e sempre con l’aiuto delle tecnologie del Web of Data, questo lavoro si propone di fornire una metodologia che permette di prendere in considerazione la singolarità del profilo di ciascun utente al fine di guidarlo nella sua ricerca esplorativa in modo personalizzato. Il criterio di personalizzazione che abbiamo scelto è comportamentale, ovvero basato sulle decisioni che l’utente prende ad ogni tappa che ritma il processo di ricerca. Implementando un prototipo, abbiamo potuto testare la validità di quest’approccio permettendo quindi all’utente di non essere più solo nel lungo e tortuoso cammino che porta alla conoscenza.

Critical path scheduling : a preliminary literature search /

Includes index.

Critical path scheduling : a preliminary literature search /

Includes index.

Cutting path as a rural postman problem

The Rural Postman Problem (RPP) is a particular Arc Routing Problem (ARP) which consists of determining a minimum cost circuit on a graph so that a given subset of required edges is traversed. The RPP is an NP-hard problem with significant real-life applications. This paper introduces an original approach based on Memetic Algorithms - the MARP algorithm - to solve the RPP and, also deals with an interesting Industrial Application, which focuses on the path optimization for component cutting operations. Memetic Algorithms are a class of Metaheuristics which may be seen as a population strategy that involves cooperation and competition processes between population elements and integrates “social knowledge”, using a local search procedure. The MARP algorithm is tested with different groups of instances and the results are compared with those gathered from other publications. MARP is also used in the context of various real-life applications.

QWERTY and the search for optimality

This paper shows how one of the developers of QWERTY continued to use the trade secret that underlay its development to seek further efficiency improvements after its introduction. It provides further evidence that this was the principle used to design QWERTY in the first place and adds further weight to arguments that QWERTY itself was a consequence of creative design and an integral part of a highly efficient system rather than an accident of history. This further serves to raise questions over QWERTY's forced servitude as 'paradigm case' of inferior standard in the path dependence literature. The paper also shows how complementarities in forms of intellectual property rights protection played integral roles in the development of QWERTY and the search for improvements on it, and also helped effectively conceal the source of the efficiency advantages that QWERTY helped deliver.