Search

A global scoping review of scholarly work about memes

This paper introduces a new memetic optimization algorithm called MeSA (Memetic Simulated Annealing) to address the data fitting problem with local-support free-form curves. The proposed method hybridizes simulated annealing with the COBYLA local search optimization method. This approach is further combined with the centripetal parameterization and the Bayesian information criterion to compute all free variables of the curve reconstruction problem with B-splines. The performance of our approach is evaluated by its application to four different shapes with local deformations and different degrees of noise and density of data points. The MeSA method has also been compared to the non-memetic version of SA. Our results show that MeSA is able to reconstruct the underlying shape of data even in the presence of noise and low density point clouds. It also outperforms SA for all the examples in this paper. This work has been supported by the Spanish Ministry of Economy and Competitiveness (MINECO) under grants TEC2013-47141-C4-R (RACHEL) and #TIN2012-30768 (Computer Science National Program) and Toho University (Funabashi, Japan).

Split delivery vehicle routing problem is one of the traditional types of routing problems in which the demand of different points can be divided among vehicles and the objective is to minimize the path length, which vehicles travel. In this paper, fuel cost of vehicles which is assumed to be dependent on their traveled path and load is considered as the objective functions. Namely, the cost of the consumed fuel is proportionate to the unit of load carried per unit of distance. In order to solve the proposed model a new memetic algorithm is developed which has two rows. The performance of the proposed algorithm for 21 standard problems is compared with the optimum solutions obtained from mathematical programming standard solver and the solutions of the same algorithm with single row solution representation. The results express the efficiency of developed algorithm.

E-Learning systems have proven to be fundamental in several areas of tertiary education and in business companies. There are many significant advantages for people who learn online such as convenience, portability, flexibility and costs. However, the remarkable velocity and volatility of modern knowledge due to the exponential growth of the World Wide Web, requires novel learning methods that offer additional features such as information structuring, efficiency, task relevance and personalization. This paper proposes a novel multi-agent e-Learning system empowered with (ontological) knowledge representation and memetic computing to efficiently manage complex and unstructured information that characterize e-Learning. In particular, differing from other similar approaches, our proposal uses 1) ontologies to provide a suitable method for modeling knowledge about learning content and activities, and 2) memetic agents as intelligent explorers in order to create in time and personalized e-Learning experiences that satisfy learners specific preferences. The proposed method has been tested by realizing a multi-agent software plug-in for an industrial e-Learning platform with experimentations to validate our memetic proposal in terms of flexibility, efficiency and interoperability. © 2010 IEEE.

Orientadores: Christiano Lyra Filho, Celso Cavellucci Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação Resumo: Grande parte das falhas em sistemas elétricos de potência ocorrem por consequência de falhas permanentes nas redes de distribuição. Agências reguladoras definem índices de confiabilidade para quantificar e avaliar a qualidade da distribuição de energia. A violação dos limites estabelecidos podem resultar em multas significativas para a distribuidora de energia. Um dos objetivos ao se realizar a instalação de chaves em redes de distribuição é criar a possibilidade de re-energizar a maior quantidade de clientes no menor tempo possível através da transferência de carga para sistemas que não tiveram seu fornecimento de energia interrompido. Esta tese estuda o problema de alocação de chaves (PAC) em sistemas radiais de distribuição de energia elétrica e propõe a instalação otimizada desses dispositivos em locais apropriados das redes, a fim de melhorar a confiabilidade do sistema pela redução do período que os consumidores ficam sem energia. Uma metodologia baseada nos conceitos de algoritmo memético juntamente com uma população estruturada é proposta neste trabalho para alocar chaves seccionadoras e de manobra, manuais e automáticas, com diferentes capacidades. A função objetivo utilizada busca minimizar o custo de alocação das chaves e o custo da energia não distribuída sob restrições de confiabilidade e fluxo de carga em todos os componentes da rede. É apresentado também um estudo multiobjetivo para o PAC, que procura alocar chaves minimizando simultaneamente os custos de instalação das chaves e da energia não distribuída e maximizando a confiabilidade da rede, sob restrições de fluxos. A abordagem proposta para resolver o PAC mono-objetivo também foi utilizada no PAC multiobjetivo, juntamente com o método do ?-restrito. A metodologia proposta tem o seu bom desempenho confirmado por diferentes estudos de casos com redes reais de grande porte localizadas no estado de São Paulo Abstract: Most failures in electric power systems occur as a result of permanent faults in distribution networks. Regulatory agencies establish reliability standards indices for quantify and evaluate the quality of power distribution. The infringe of established limits can result in costly fines for the utility suppliers. One of the aim when perform the switches allocation in distribution networks is the possibility of re-energize the largest amount of customers in the shortest possible time by transferring load to other power systems which don¿t had their energy supply interrupted. This thesis studies the switch allocation problem (SAP) in radial systems of electrical power distribution and proposes an optimized installation of these devices in appropriate locations of network, in order to improve the reliability system by the reducing of the period that consumers remains without power. A methodology based on the concepts of memetic algorithm with a structured population is proposed in this thesis to allocate sectionalizing and tie switches of different capacities, with manual or automatic operation schemes. The objective function used seeks to minimize the switches allocation and the energy not supplied costs under constraints of reliability and load flow. A Multi-objective study for SAP is presented, to perform the switches allocation seeks minimize simultaneously the switches installation and energy not supplied costs and maximize the network reliability, under constraints of load flow. The proposed approach to solve the SAP monocriteria was also used in SAP multi-criteria along with the ?-constraint method. The proposed methodology has its good performance confirmed by several case studies with real large networks located in the state of São Paulo Doutorado Automação Doutora em Engenharia Elétrica

A measurement of the cross section for e+e-→ hadrons using 11 000 hadronic decays of the Z boson at ten different center-of-mass energies is presented. A three-parameter fit gives the following values for the Z mass MZ, the total width ΓZ, the product of the electronic and hadronic partial widths ΓeΓh, and the unfolded pole cross section σ0: MZ = 91.171 ± 0.030 (stat.) ± 0.030 (beam) GeV, ΓZ = 2.511 ± 0.065 GeV, ΓeΓh = 0.148 ± 0.006 (stat.) ± 0.004 (syst.) GeV2, σ0 = 41.6 ± 0.7 (stat.) ± 1.1 (syst.) nb, Good agreement with the predictions of the standard model is observed. From a two-parameter fit the number of massless neutrino generations is found to be Nv = 2.91 ± 0.26. Thus the hypothesis of a fourth neutrino with mass less than 40 GeV is excluded with 95% confidence level. Combining the cross section measurements with the ratio Γl/Γh reported in another DELPHI paper [Phys. Lett. B 241 (1990) 425], the hadronic, leptonic and invisible widths are found to be Γh = 1741 ± 61 MeV, Γl = 85.1 ± 2.9 MeV, Γh/Γl = 20.45 ± 0.98, Γinv = 515 ± 54 MeV, in good agreement with the standard model., 0, SCOPUS: ar.j, info:eu-repo/semantics/published

No considerar la cultura organizacional en el desarrollo de sistemas de información ocasiona algunos problemas, por ejemplo, dificultades en la implantación de dichos sistemas por cuanto sus usuarios no aceptan modificaciones en sus culturas de trabajo. Sin embargo, las actuales metodologías de diseño no contemplan factores culturales. El objetivo de esta investigación fue identificar los principales rasgos culturales compartidos por los usuarios de SI de una universidad argentina. Como resultado del trabajo realizado fue posible, por un lado, identificar los memes compartidos por los integrantes de la comunidad elegida, y por otro, categorizar tales memes según su grado de incidencia. Este trabajo pretende ser un paso inicial hacia la construcción de sistemas que evolucionen junto con la cultura de la organización en la que se encuentran insertos. Problems may arise when organizational culture is not considered in the development of information systems, such as difficulties in system implementation, since users do not accept changes in their work cultures. However, current methodology designs do not contemplate cultural factors. The objective of this investigation was to identify the main cultural features shared by the users of information systems in an Argentinean university. As result of this work it was possible to identify the memes shared by the members of the community selected, and to categorize such memes according to their incidence grade. This work seeks to be an initial step towards the construction of systems that evolve along with the organizational culture they are an integral part of.

The Hypergraph Partitioning (HGP) problem is a well-studied problem that finds applications in a variety of domains. In several application domains, such as the VLSI design and database migration planning, the quality of the solution is more of a concern than the running time of the algorithm. In this work, we introduce novel problem-specific recombination and mutation operators and develop a new multilevel memetic algorithm by combining these operators with kKaHyPar-E. The performance of our algorithm is compared with the state-of-the-art HGP algorithms on 150 real-life instances taken from the benchmark sets used in the literature. The experiments reveal that our algorithm outperforms all others, and finds the best solutions in 112, 115, and 125 instances in 2, 4, and 8 hours, respectively. © 2022 Owner/Author.