45 resultados para Space problem
Resumo:
A Work Project, presented as part of the requirements for the Award of a Masters Degree in Management from the NOVA – School of Business and Economics
Resumo:
Dissertação apresentada para obtenção do Grau de Mestre em Engenharia Electrotécnica e de Computadores, pela Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia
Resumo:
Optimization is a very important field for getting the best possible value for the optimization function. Continuous optimization is optimization over real intervals. There are many global and local search techniques. Global search techniques try to get the global optima of the optimization problem. However, local search techniques are used more since they try to find a local minimal solution within an area of the search space. In Continuous Constraint Satisfaction Problems (CCSP)s, constraints are viewed as relations between variables, and the computations are supported by interval analysis. The continuous constraint programming framework provides branch-and-prune algorithms for covering sets of solutions for the constraints with sets of interval boxes which are the Cartesian product of intervals. These algorithms begin with an initial crude cover of the feasible space (the Cartesian product of the initial variable domains) which is recursively refined by interleaving pruning and branching steps until a stopping criterion is satisfied. In this work, we try to find a convenient way to use the advantages in CCSP branchand- prune with local search of global optimization applied locally over each pruned branch of the CCSP. We apply local search techniques of continuous optimization over the pruned boxes outputted by the CCSP techniques. We mainly use steepest descent technique with different characteristics such as penalty calculation and step length. We implement two main different local search algorithms. We use “Procure”, which is a constraint reasoning and global optimization framework, to implement our techniques, then we produce and introduce our results over a set of benchmarks.
Resumo:
The second half of the XX century was marked by a great increase in the number of people living in cities. Urban agglomerations became poles of attraction for migration flows and these phenomena, coupled with growing car-ownership rates, resulted in the fact that modern transport systems are characterized by large number of users and traffic modes. The necessity to organize these complex systems and to provide space for different traffic modes changed the way cities look. Urban areas had to cope with traffic flows, and as a result nowadays typical street pattern consists of a road for motorized vehicles, a cycle lane (in some cases), pavement for pedestrians, parking and a range of crucial signage to facilitate navigation and make mobility more secure. However, this type of street organization may not be desirable in certain areas, more specifically, in the city centers. Downtown areas have always been places where economic, leisure, social and other types of facilities are concentrated, not surprisingly, they often attract large number of people and this frequently results in traffic jams, air and noise pollution, thus creating unpleasant environment. Besides, excessive traffic signage in central locations can harm the image and perception of a place, this relates in particular to historical centers with architectural heritage.
Resumo:
NSBE - UNL
Resumo:
Product fundamentals are essential in explaining heterogeneity in the product space. The scope for adapting and transferring capabilities into the production of different goods determines the speed and intensity of the structural transformation process and entails dissimilar development opportunities for nations. Future specialization patterns become then partly determined by the current network of products’ relatedness. Building on previous literature, this paper explicitly compares methodological concepts of product connectivity to conclude in favor of the density measure we propose combined with the Revealed Relatedness Index (RRI) approach presented by Freitas and Salvado (2011). Overall, RRI specifications displayed more consistent behavior when different time horizons are equated.
Resumo:
This research addresses the problem of creating interactive experiences to encourage people to explore spaces. Besides the obvious spaces to visit, such as museums or art galleries, spaces that people visit can be, for example, a supermarket or a restaurant. As technology evolves, people become more demanding in the way they use it and expect better forms of interaction with the space that surrounds them. Interaction with the space allows information to be transmitted to the visitors in a friendly way, leading visitors to explore it and gain knowledge. Systems to provide better experiences while exploring spaces demand hardware and software that is not in the reach of every space owner either because of the cost or inconvenience of the installation, that can damage artefacts or the space environment. We propose a system adaptable to the spaces, that uses a video camera network and a wi-fi network present at the space (or that can be installed) to provide means to support interactive experiences using the visitor’s mobile device. The system is composed of an infrastructure (called vuSpot), a language grammar used to describe interactions at a space (called XploreDescription), a visual tool used to design interactive experiences (called XploreBuilder) and a tool used to create interactive experiences (called urSpace). By using XploreBuilder, a tool built of top of vuSpot, a user with little or no experience in programming can define a space and design interactive experiences. This tool generates a description of the space and of the interactions at that space (that complies with the XploreDescription grammar). These descriptions can be given to urSpace, another tool built of top of vuSpot, that creates the interactive experience application. With this system we explore new forms of interaction and use mobile devices and pico projectors to deliver additional information to the users leading to the creation of interactive experiences. The several components are presented as well as the results of the respective user tests, which were positive. The design and implementation becomes cheaper, faster, more flexible and, since it does not depend on the knowledge of a programming language, accessible for the general public.
Resumo:
This paper examines modern economic growth according to the multidimensional scaling (MDS) method and state space portrait (SSP) analysis. Electing GDP per capita as the main indicator for economic growth and prosperity, the long-run perspective from 1870 to 2010 identifies the main similarities among 34 world partners’ modern economic growth and exemplifies the historical waving mechanics of the largest world economy, the USA. MDS reveals two main clusters among the European countries and their old offshore territories, and SSP identifies the Great Depression as a mild challenge to the American global performance, when compared to the Second World War and the 2008 crisis.
Resumo:
Combinatorial Optimization Problems occur in a wide variety of contexts and generally are NP-hard problems. At a corporate level solving this problems is of great importance since they contribute to the optimization of operational costs. In this thesis we propose to solve the Public Transport Bus Assignment problem considering an heterogeneous fleet and line exchanges, a variant of the Multi-Depot Vehicle Scheduling Problem in which additional constraints are enforced to model a real life scenario. The number of constraints involved and the large number of variables makes impracticable solving to optimality using complete search techniques. Therefore, we explore metaheuristics, that sacrifice optimality to produce solutions in feasible time. More concretely, we focus on the development of algorithms based on a sophisticated metaheuristic, Ant-Colony Optimization (ACO), which is based on a stochastic learning mechanism. For complex problems with a considerable number of constraints, sophisticated metaheuristics may fail to produce quality solutions in a reasonable amount of time. Thus, we developed parallel shared-memory (SM) synchronous ACO algorithms, however, synchronism originates the straggler problem. Therefore, we proposed three SM asynchronous algorithms that break the original algorithm semantics and differ on the degree of concurrency allowed while manipulating the learned information. Our results show that our sequential ACO algorithms produced better solutions than a Restarts metaheuristic, the ACO algorithms were able to learn and better solutions were achieved by increasing the amount of cooperation (number of search agents). Regarding parallel algorithms, our asynchronous ACO algorithms outperformed synchronous ones in terms of speedup and solution quality, achieving speedups of 17.6x. The cooperation scheme imposed by asynchronism also achieved a better learning rate than the original one.
Resumo:
The thrust towards energy conservation and reduced environmental footprint has fueled intensive research for alternative low cost sources of renewable energy. Organic photovoltaic cells (OPVs), with their low fabrication costs, easy processing and flexibility, represent a possible viable alternative. Perylene diimides (PDIs) are promising electron-acceptor candidates for bulk heterojunction (BHJ) OPVs, as they combine higher absorption and stability with tunable material properties, such as solubility and position of the lowest unoccupied molecular orbital (LUMO) level. A prerequisite for trap free electron transport is for the LUMO to be located at a level deeper than 3.7 eV since electron trapping in organic semiconductors is universal and dominated by a trap level located at 3.6 eV. Although the mostly used fullerene acceptors in polymer:fullerene solar cells feature trap-free electron transport, low optical absorption of fullerene derivatives limits maximum attainable efficiency. In this thesis, we try to get a better understanding of the electronic properties of PDIs, with a focus on charge carrier transport characteristics and the effect of different processing conditions such as annealing temperature and top contact (cathode) material. We report on a commercially available PDI and three PDI derivatives as acceptor materials, and its blends with MEH-PPV (Poly[2-methoxy 5-(2-ethylhexyloxy)-1,4-phenylenevinylene]) and P3HT (Poly(3-hexylthiophene-2,5-diyl)) donor materials in single carrier devices (electron-only and hole-only) and in solar cells. Space-charge limited current measurements and modelling of temperature dependent J-V characteristics confirmed that the electron transport is essentially trap-free in such materials. Different blend ratios of P3HT:PDI-1 (1:1) and (1:3) show increase in the device performance with increasing PDI-1 ratio. Furthermore, thermal annealing of the devices have a significant effect in the solar cells that decreases open-circuit voltage (Voc) and fill factor FF, but increases short-circuit current (Jsc) and overall device performance. Morphological studies show that over-aggregation in traditional donor:PDI blend systems is still a big problem, which hinders charge carrier transport and performance in solar cells.
Resumo:
Information systems are widespread and used by anyone with computing devices as well as corporations and governments. It is often the case that security leaks are introduced during the development of an application. Reasons for these security bugs are multiple but among them one can easily identify that it is very hard to define and enforce relevant security policies in modern software. This is because modern applications often rely on container sharing and multi-tenancy where, for instance, data can be stored in the same physical space but is logically mapped into different security compartments or data structures. In turn, these security compartments, to which data is classified into in security policies, can also be dynamic and depend on runtime data. In this thesis we introduce and develop the novel notion of dependent information flow types, and focus on the problem of ensuring data confidentiality in data-centric software. Dependent information flow types fit within the standard framework of dependent type theory, but, unlike usual dependent types, crucially allow the security level of a type, rather than just the structural data type itself, to depend on runtime values. Our dependent function and dependent sum information flow types provide a direct, natural and elegant way to express and enforce fine grained security policies on programs. Namely programs that manipulate structured data types in which the security level of a structure field may depend on values dynamically stored in other fields The main contribution of this work is an efficient analysis that allows programmers to verify, during the development phase, whether programs have information leaks, that is, it verifies whether programs protect the confidentiality of the information they manipulate. As such, we also implemented a prototype typechecker that can be found at http://ctp.di.fct.unl.pt/DIFTprototype/.
Resumo:
A definição de pirataria ou a desmistificação da sua origem, no tempo e espaço, revela maiores dificuldades do que atualmente. Com este trabalho propusemo-nos a estudar como é que a pirataria era perpetrada e entendida no passado, bem como no presente. Também nos propomos a identificar limitações legais e as medidas operativas no combate à pirataria, como por exemplo: limites conceptuais, lacunas, estratégias, entre outros. Por outro lado, atendemos as soluções encontradas no combate à pirataria sem deixar de observar fraqueza da lei e conflitos entre jurisdições. Por fim, o curso da história dá-nos a seguinte percepção: a pirataria era tida como crime se fosse contra os interesses das nações. O desinteresse dos Estados para reprimir a pirataria possibilitou o seu aumento, proliferação, domínio e sofisticação em certas regiões do Mundo. O presente trabalho tem como objetivo trazer para o centro da discussão os direitos humanos numa perspetiva tripla: proibição da pirataria, supressão e raízes, aliando o estudo de possíveis respostas a dar a esta epidemia.
Resumo:
This case study illustrates the application of the Value Creation Radar (VCR) to SenSyF, an Earth Observation (EO) system which was developed by Deimos Engenharia S.A. (DME), the Portuguese affiliate of Elecnor Deimos. It describes how a team of consultants adopted the VCR in order to find new market applications for SenSyF, selected the one with the highest potential, and defined a path to guarantee a sustainable market launch. This case study highlights the main challenges of bringing a technology-driven company closer to the market in the pursuit of long-term sustainability, while not compromising its technological capabilities