3 resultados para school behaviour problems
em Universidade do Minho
Resumo:
In view of the major social and environmental problems, with which we are faced nowadays, we noticed a certain absence of values in society, where man draws many more resources than nature can replace in the short or medium term. Within the framework of fashion emerges the ethical fashion as a movement in this direction, intending to change this current paradigm. Ethical fashion encompasses different concepts such as fair trade, sustainability, working conditions, raw materials, social responsibility and the protection of animals. This study aims to determine which type of communication are fashion brands using in this context, and if this communication aims at educating the consumer for a more ethical consumer behavior. For this study were selected 44 fashion brands associated with the Ethical Trade Initiative. The method used for the research development was content analysis for which first was made a data collection of the information provided on the websites and social networks of the selected fashion brands. The data was analyzed taking into account the quality and type of information published related to ethical fashion, for which an ordinal scale was created as a way of measuring and comparing results.
Resumo:
The artificial fish swarm algorithm has recently been emerged in continuous global optimization. It uses points of a population in space to identify the position of fish in the school. Many real-world optimization problems are described by 0-1 multidimensional knapsack problems that are NP-hard. In the last decades several exact as well as heuristic methods have been proposed for solving these problems. In this paper, a new simpli ed binary version of the artificial fish swarm algorithm is presented, where a point/ fish is represented by a binary string of 0/1 bits. Trial points are created by using crossover and mutation in the different fi sh behavior that are randomly selected by using two user de ned probability values. In order to make the points feasible the presented algorithm uses a random heuristic drop item procedure followed by an add item procedure aiming to increase the profit throughout the adding of more items in the knapsack. A cyclic reinitialization of 50% of the population, and a simple local search that allows the progress of a small percentage of points towards optimality and after that refines the best point in the population greatly improve the quality of the solutions. The presented method is tested on a set of benchmark instances and a comparison with other methods available in literature is shown. The comparison shows that the proposed method can be an alternative method for solving these problems.
Resumo:
Tese de Doutoramento em Ciências da Saúde