Cooperative coevolutionary bare-bones particle swarm optimization with function independent decomposition for large-scale supply chain network design with uncertainties

Supply chain network design (SCND) is a complicated constrained optimization problem that plays a significant role in the business management. This article extends the SCND model to a large-scale SCND with uncertainties (LUSCND), which is more practical but also more challenging. However, it is difficult for traditional approaches to obtain the feasible solutions in the large-scale search space within the limited time. This article proposes a cooperative coevolutionary bare-bones particle swarm optimization (CCBBPSO) with function independent decomposition (FID), called CCBBPSO-FID, for a multiperiod three-echelon LUSCND problem. For the large-scale issue, binary encoding of the original model is converted to integer encoding for dimensionality reduction, and a novel FID is designed to efficiently decompose the problem. For obtaining the feasible solutions, two repair methods are designed to repair the infeasible solutions that appear frequently in the LUSCND problem. A step translation method is proposed to deal with the variables out of bounds, and a labeled reposition operator with adaptive probabilities is designed to repair the infeasible solutions that violate the constraints. Experiments are conducted on 405 instances with three different scales. The results show that CCBBPSO-FID has an evident superiority over contestant algorithms

Swarm intelligence algorithms adaptation for various search spaces

U današnje vrijeme postoji mnogo algoritama inteligencije rojeva koji se uspiješno koriste za rešavanje raznih teških problema optimizacije. Zajednicki elementi svih ovih algoritama su operator za lokalnu pretragu (eksploataciju) oko prona enih obecavajucih rješenja i operator globalne pretrage (eksploracije) koji pomaže u bijegu iz lokalnih optimuma. Algoritmi inteligencije rojeva obicno se inicijalno testiraju na neogranicenim, ogranicenim ili visoko-dimenzionalnim skupovima standardnih test funkcija. Nadalje, mogu se poboljšati, prilagoditi, izmijeniti, hibridizirati, kombinirati s lokalnom pretragom. Konacna svrha je korištenje takve metaheuristike za optimizaciju problema iz stvarnog svijeta. Domeni rješenja odnosno prostori pretrage prakticnih teških problema optimizacije mogu biti razliciti. Rješenja mogu biti vektori iz skupa realnih brojeva, cijelih brojeva ali mogu biti i kompleksnije strukture. Algoritmi inteligencije rojeva moraju se prilagoditi za razlicite prostore pretrage što može biti jednostavno podešavanje parametera algoritma ili prilagodba za cjelobrojna rješenja jednostavnim zaokruživanjem dobivenih realnih rješenja ali za pojedine prostore pretrage potrebnao je skoro kompletno prepravljanja algoritma ukljucujuci i operatore ekploatacije i ekploracije zadržavajuci samo proces vo enja odnosno inteligenciju roja. U disertaciji je predstavljeno nekoliko algoritama inteligencije rojeva i njihova prilagodba za razlicite prostore pretrage i primjena na prakticne probleme. Ova disertacija ima za cilj analizirati i prilagoditi, u zavisnosti od funkcije cilja i prostora rješenja, algoritme inteligencije rojeva. Predmet disertacije ukljucuje sveobuhvatan pregled postojecih implementacija algoritama inteligencije rojeva. Disertacija tako er obuhvaca komparativnu analizu, prikaz slabosti i snaga jednih algoritama u odnosu na druge zajedno s istraživanjem prilagodbi algoritama inteligencije rojeva za razlicite prostore pretrage i njihova primjena na prakticne problem. Razmatrani su problemi sa realnim rješenjima kao što su optimizacija stroja potpornih vektora, grupiranje podataka, sa cijelobrojnim rješenjima kao što je slucaj problema segmentacije digitalnih slika i za probleme gdje su rješenja posebne strukture kao što su problemi planiranja putanje robota i triangulacije minimalne težine. Modificirani i prilago eni algoritmi inteligencije rojeva za razlicite prostore pretrage i primjenih na prakticne probleme testirani su na standardnim skupovima test podataka i uspore eni s drugim suvremenim metodama za rješavanje promatranih problema iz literature. Pokazane su uspješne prilagodbe algoritama inteligencije rojeva za razne prostore pretrage. Ovako prilago eni algoritmi su u svim slucajevima postigli bolje rezultate u usporedbi sa metodama iz literature, što dovodi do zakljucka da je moguce prilagoditi algoritme inteligencije rojeva za razne prostore pretrage ukljucujuci i kompleksne strukture i postici bolje rezultate u usporedbi sa metodama iz literature

Improvements of task scheduling and load balancing in cloud environment by swarm intelligence metaheuristics

Klaud racunarstvo pripada grupi novijih racunarskih paradigmi, koja se poput paradigme mrežnog racunarstva, bazira na grupisanju resursa i na korišcenju mrežnih i Internet tehnologija. U opštem smislu, klaud racunarstvo se odnosi na novi nacin isporuke racunarskih resursa u vidu usluge, gde se pod resursima podrazumeva gotovo sve, od podataka i softvera, do hardverskih komponenti, kao što su procesirajuci elementi, memorija i skladišta. Klaud racunarstvo je aktuelna i važna multidisciplinarna oblast, o cemu svedoci veliki broj objavljenih radova u vrhunskim me unarodnim casopisima i prikazanih na najznacajnijim svetskim skupovima. Na osnovu naucnih rezultata prikupljenih u objavljenim radovima iz ovog domena, može da se zakljuci da u klaud okruženju postoji veliki broj izazova i problema, za cije rešavanje mogu da se prona u bolje metode, tehnike i algoritmi. Jedan od najvažnijih izazova savremenog klaud okruženja je raspore ivanje zahteva krajnjih korisnika za izvršavanje na ogranicenom skupu raspoloživih resursa (virtuelnih mašina). Problem raspore ivanja na klaudu odnosi se na definisanje rasporeda izvršavanja zadataka na ogranicenom skupu raspoloživih resursa uzimajuci pritom u obzir potencijalna ogranicenja i funkciju cilja koju je potrebno optimizovati. Raspore ivanje poslova vrše algoritmi raspore ivanja, koji mogu da se podele na staticke i dinamicke. U slucaju statickog raspore ivanja, gde se poslovi ne mogu dinamicki prebacivati sa preopterecnih na manje opterecene virtuelne mašine, zadaci se raspore uju za izvršavanje na raspoložive virtuelne mašine pre pocetka izvršavanja. S druge strane, primenom metoda dinamickog raspore ivanja, koje je u literaturi poznato pod nazivom balansiranje opterecenja, vrši se preraspodela poslova izme u aktivnih virtuelnih mašina tokom samog izvršavanja programa raspore ivanja. Preraspodela se vrši tako što se zadaci sa virtuelnih mašina koje imaju vece opterecenje dinamicki prebacuju za izvršavanje na virtuelnim mašinama koje imaju manje opterecenje. Za potrebe dinamickog raspore ivanja koriste se uglavnom heuristicke i metaheuristicke optimizacione metode i algoritmi, koji postižu dobre rezultate. Problemi raspore ivanja poslova i balansiranja opterecenja na klaudu pripadaju grupi NP teških kombinatornih i/ili globalnih problema sa ili bez ogranicenja. Na osnovu publikovanih rezultata u relevantnim literaturnim izvorima, vidi se da su metaheuristike inteligencije rojeva, koje spadaju u grupu prirodom-inspirisanih algoritama, uspešno testirane na bencmark problemima i primenjivane na prakticnim NP teškim optimizacionim problemima (globalnim i kombinatornim) i da mogu da postignu bolje rezultate u smislu brzine konvergencije i kvaliteta rešenja, od drugih metoda, tehnika i algoritama. Polazeci od navedenog, u ovom radu je ispitivano da li je moguce dalje unaprediti rešavanja problema raspore ivanja poslova i balansiranja opterecenja na klaudu primenom metaheuristika inteligencije rojeva. Tokom sprovedenog istraživanja, unapre eno je i adaptirano više metaheuristika inteligencije rojeva za rešavanje problema raspore ivanja poslova i balansiranja opterecenja u klaud okruženju. U disertaciji su detaljno prikazane implementacije dva unapre ena algoritma rojeva - algoritma optimizacije monarh leptirovima i algoritma optimizacije jatom kitova. Za potrebe testiranja, rešavana su dva modela raspore ivanja poslova na klaudu. Prvi model, koji pripada grupi jednokriterijumske optimizacije, uzima u obzir minimizaciju vremena izvršavanja svih zadataka na klaudu, dok drugi, višekriterijumski model uzima u obzir minimizaciju vremena izvršavanja svih zadataka na klaudu i budžeta, tj. troškova za izvršavanje svih zahteva krajnjih korisnika. Simulacije su vršene u robusnom okruženju CloudSim simulatora i oba algoritma su testirana sa skupom veštackih podataka, generisanih u okviru CloudSim platforme, i realnih podataka, koji su preuzeti iz globalno dostupne bencmark baze. Osim testiranja za praktican izazov na klaudu, da bi se preciznije utvrdila unapre- enja modifikovanih metaheuristika u odnosu na osnovne verzije, obe metaheuristike su verifikovane i testiranjima na standardnim skupovima bencmark funkcija za globalnu optimizaciju bez ogranicenja. Upore ivanjem generisanih rezultata (kvalitet rešenja i brzina konvergencije) sa rezultatima najboljih poznatih metaheuristika i heuristika iz literature, koje su primenjivane na iste instance problema (na praktican problem raspore ivanja na klaudu i bencmark testove), dokazan je kvalitet implementiranih algoritama, cime je potvr ena i osnovna hipoteza ovog rada da se rešavanje izazova raspore ivanja poslova i balansiranja opterecenja u klaud okruženju mogu dalje unaprediti primenom metaheuristika inteligencije rojeva

Unapređenje procesiranja medicinskih digitalnih slika pomocu algoritama inteligencije rojeva

Medicina je jedna od nauka gde je omogucen znacajan napredak pojavom digitalnih slika i obrade digitalnih slika. Racunarska obrada digitalnih medicinskih slika može drasticno ubrzati proces dijagnostike pri tome otkrivajuci i najsitnije promene na tkivima koje nisu vidljive ljudskom oku. Obrada medicinskih slika ukljucuje slike generisane razlicitim izvorima kao što su rendgen, ultrazvuk, magnetna rezonanca, i snimljene razlicitim urđajima kao što su skeneri, mikroskopske slike, endoskopske kapsule i drugi. Stalni napredak u medicinskoj tehnologiji snimanja doveo je do slika visokih rezolucija, trodimenzionalnih anatomskih i fizioloških slika. Sa druge strane, ovi napreci doveli su do novih problema i izazova u procesiranju medicinskih slika. Mnogi od ovih problema predstavljaju teške optimizacione probleme za cije se rešavanje u poslednje dve decenije uspešno koriste algoritmi inspirisani prirodom, posebno algoritmi inteligencije rojeva. Da bi se ovi algoritmi primenili na probleme optimizacije u obradi medicinskih digitalnih slika, neohodno je da se posebno prilagode konkretnom problemu. Ova tema predstavlja aktivnu oblast naucnog istraživanja što se može zakljuciti na osnovu velikog broja naucnih i strucnih radova, knjiga, casopisa i konferencija koji su joj posveceni. U ovoj tezi predstavljeno je nekoliko algoritma inteligencije rojeva i njihova primena na razlicite optimizacione probleme obrade medicinskih digitalnih slika. Konkretno, algoritam slepog miša, algoritam vatrometa i algoritam svica korišceni su za registraciju slika retine, segmentaciju MRI slika mozga, detekciju krvarenja na slikama endoskopske kapsule, kompresiju slika, detekciju leukemije na mikroskopskim slikama i detekciju emfisema na CT slikama pluca. Svaki od razmatranih problema je specifican i za njihovo rešavanje prilagođeni su algoritmi inteligencije rojeva. Modifikovani i prilagođeni algoritmi inteligencije rojeva za primenu u obradi medicinskih digitalnih slika testirani su na standardnim skupovima test slika prikupljenim za razmatrane probleme. Poređenjem predloženih metoda unapređenja obrade medicinskih digitalnih slika pomocu algoritama inteligencije rojeva sa drugim savremenim algoritmima iz literature, pokazano je da su dobijeni bolji rezultati, što dovodi do zakljucka da je moguce pronaci bolje metode i tehnike za rešavanje problema optimizacije koji se pojavljuju prilikom analize i obrade medicinskih digitalnih slika prilagođavanjem i primenom algoritama inteligencije rojeva

Integrating Recognition and Decision Making to Close the Interaction Loop for Autonomous Systems

Intelligent systems are becoming increasingly ubiquitous in daily life. Mobile devices are providing machine-generated support to users, robots are coming out of their cages in manufacturing to interact with co-workers, and cars with various degrees of self-driving capabilities operate amongst pedestrians and the driver. However, these interactive intelligent systems\u27 effectiveness depends on their understanding and recognition of human activities and goals, as well as their responses to people in a timely manner. The average person does not follow instructions step-by-step or act in a formulaic manner, but instead varies the order of actions and timing when performing a given task. People explore their surroundings, make mistakes, and may interrupt an activity to handle more urgent matters. The decisions that an autonomous intelligent system makes should account for such noise and variance regardless of the form of interaction, which includes adapting action choices and possibly its own goals.While most people take these aspects of interaction for granted, they are complex and involve many specific tasks that have primarily been studied independently within artificial intelligence. This results in open-loop interactive experiences where the user must perform a fixed input command or the intelligent system performs a hard-coded output response---one of the components of the interaction cannot adapt with respect to the other for longer-term back-and-forth interactions. This dissertation explores how developments in plan recognition, activity recognition, intent recognition, and autonomous planning can work together to develop more adaptive interactive experiences between autonomous intelligent systems and the people around them. In particular, we consider a unifying perspective of recognition algorithms that provides sufficient information to dynamically produce short-term automated planning problems, and we present ways to run these algorithms faster for the real-time needs of interaction. This exploration leads to the introduction of the Planning and Recognition Together Close the Interaction Loop (PReTCIL) framework that serves as a first step towards identifying how we can address the problem of closing the interaction loop, in addition to new questions that need to be considered

Blown to Bits: Your Life, Liberty, and Happiness After the Digital Explosion

382 p.Libro ElectrónicoEach of us has been in the computing field for more than 40 years. The book is the product of a lifetime of observing and participating in the changes it has brought. Each of us has been both a teacher and a learner in the field. This book emerged from a general education course we have taught at Harvard, but it is not a textbook. We wrote this book to share what wisdom we have with as many people as we can reach. We try to paint a big picture, with dozens of illuminating anecdotes as the brushstrokes. We aim to entertain you at the same time as we provoke your thinking.Preface Chapter 1 Digital Explosion Why Is It Happening, and What Is at Stake? The Explosion of Bits, and Everything Else The Koans of Bits Good and Ill, Promise and Peril Chapter 2 Naked in the Sunlight Privacy Lost, Privacy Abandoned 1984 Is Here, and We Like It Footprints and Fingerprints Why We Lost Our Privacy, or Gave It Away Little Brother Is Watching Big Brother, Abroad and in the U.S. Technology Change and Lifestyle Change Beyond Privacy Chapter 3 Ghosts in the Machine Secrets and Surprises of Electronic Documents What You See Is Not What the Computer Knows Representation, Reality, and Illusion Hiding Information in Images The Scary Secrets of Old Disks Chapter 4 Needles in the Haystack Google and Other Brokers in the Bits Bazaar Found After Seventy Years The Library and the Bazaar The Fall of Hierarchy It Matters How It Works Who Pays, and for What? Search Is Power You Searched for WHAT? Tracking Searches Regulating or Replacing the Brokers Chapter 5 Secret Bits How Codes Became Unbreakable Encryption in the Hands of Terrorists, and Everyone Else Historical Cryptography Lessons for the Internet Age Secrecy Changes Forever Cryptography for Everyone Cryptography Unsettled Chapter 6 Balance Toppled Who Owns the Bits? Automated Crimes—Automated Justice NET Act Makes Sharing a Crime The Peer-to-Peer Upheaval Sharing Goes Decentralized Authorized Use Only Forbidden Technology Copyright Koyaanisqatsi: Life Out of Balance The Limits of Property Chapter 7 You Can’t Say That on the Internet Guarding the Frontiers of Digital Expression Do You Know Where Your Child Is on the Web Tonight? Metaphors for Something Unlike Anything Else Publisher or Distributor? Neither Liberty nor Security The Nastiest Place on Earth The Most Participatory Form of Mass Speech Protecting Good Samaritans—and a Few Bad Ones Laws of Unintended Consequences Can the Internet Be Like a Magazine Store? Let Your Fingers Do the Stalking Like an Annoying Telephone Call? Digital Protection, Digital Censorship—and Self-Censorship Chapter 8 Bits in the Air Old Metaphors, New Technologies, and Free Speech Censoring the President How Broadcasting Became Regulated The Path to Spectrum Deregulation What Does the Future Hold for Radio? Conclusion After the Explosion Bits Lighting Up the World A Few Bits in Conclusion Appendix The Internet as System and Spirit The Internet as a Communication System The Internet Spirit Endnotes Inde

Peer production of Open Hardware: Unfinished artifacts and architectures in the hackerspaces

The dissertation adopts the theoretical framework of peer production to investigate the phenomena of open collaboration in hacker clubs through two case studies of small scale electronic artefacts. A critique of current theories of peer production is developed from a Science and Technology Studies point of view, arguing for the primacy of social constructivism over technological determinist narratives about the role of ICTs in late capitalism in general and hacker culture in particular. Properties of disruptive novelty and spontaneous emergence routinely attributed to ICTs – and by extension to the peer production practices of hackers – are approached sceptically with a historically informed ethnographic method that concentrates on continuities and contexts.La tesis adopta el marco teórico de la producción entre iguales para investigar los fenómenos de colaboración abierta en los clubs de hackers, a través de dos estudios de caso sobre artefactos electrónicos de pequeña escala. Se desarrolla una crítica de las teorías actuales sobre la producción entre iguales desde el punto de vista de los Estudios de Ciencia y Tecnología, defendiendo la primacía de la visión constructivista social por encima de las narrativas deterministas tecnológicas en el papel de las TIC en el capitalismo tardío, en general, y en la cultura hacker en particular. Nociones como la novedad perturbadora y la aparición espontánea, atribuidas habitualmente a las TIC y, por extensión, a las prácticas de producción entre iguales de los hackers, se tratan con escepticismo mediante un método etnográfico históricamente informado, que se concentra en las continuidades y contextos.La tesi adopta el marc teòric de la producció entre iguals per investigar els fenòmens de col·laboració oberta als clubs de hackers, a través de dos estudis de cas sobre artefactes electrònics de petita escala. S’hi desenvolupa una crítica de les teories actuals sobre la producció entre iguals des del punt de vista dels Estudis de Ciència i Tecnologia, defensant la primacia de la visió constructivista social per sobre de les narratives deterministes tecnològiques en el paper de les TIC en el capitalisme tardà, en general, i en la cultura hacker en particular. Nocions com la novetat pertorbadora i l’aparició espontània, atribuïdes habitualment a les TIC i, per extensió, a les pràctiques de producció entre iguals dels hackers, es tracten amb escepticisme mitjançant un mètode etnogràfic històricament informat, que es concentra en les continuïtats i els contextos.Societat de la informació i el coneixemen

Improving the sustainability of coal SC in both developed and developing countries by incorporating extended exergy accounting and different carbon reduction policies

In the age of Industry 4.0 and global warming, it is inevitable for decision-makers to change the way they view the coal supply chain (SC). In nature, energy is the currency, and nature is the source of energy for humankind. Coal is one of the most important sources of energy which provides much-needed electricity, as well as steel and cement production. This manuscript-based PhD thesis examines the coal SC network as well as the four carbon reduction strategies and plans to develop a comprehensive model for sustainable design. Thus, the Extended Exergy Accounting (EEA) method is incorporated into a coal SC under economic order quantity (EOQ) and economic production quantity (EPQs) in an uncertain environment. Using a real case study in coal SC in Iran, four carbon reduction policies such as carbon tax (Chapter 5), carbon trade (Chapter 6), carbon cap (Chapter 7), and carbon offset (Chapter 8) are examined. Additionally, all carbon policies are compared for sustainable performance of coal SCs in some developed and developing countries (the USA, China, India, Germany, Canada, Australia, etc.) with the world's most significant coal consumption. The objective function of the four optimization models under each carbon policy is to minimize the total exergy (in Joules as opposed to Dollars/Euros) of the coal SC in each country. The models have been solved using three recent metaheuristic algorithms, including Ant lion optimizer (ALO), Lion optimization algorithm (LOA), and Whale optimization algorithm (WOA), as well as three popular ones, such as Genetic algorithm (GA), Ant colony optimization (ACO), and Simulated annealing (SA), are suggested to determine a near-optimal solution to an exergy fuzzy nonlinear integer-programming (EFNIP). Moreover, the proposed metaheuristic algorithms are validated by using an exact method (by GAMS software) in small-size test problems. Finally, through a sensitivity analysis, this dissertation compares the effects of applying different percentages of exergy parameters (capital, labor, and environmental remediation) to coal SC models in each country. Using this approach, we can determine the best carbon reduction policy and exergy percentage that leads to the most sustainable performance (the lowest total exergy per Joule). The findings of this study may enhance the related research of sustainability assessment of SC as well as assist coal enterprises in making logical and measurable decisions

Cities' Identity Through Architecture and Art

Intended to be a guide for academics, scholars, and interested leaders, this book was designed to critically assess issues related to architectural identity, the city as a scene, the city as an organism, the city as a subject, and the planning or rather approaching of one. A pressing issue for many researchers in the field, the book discusses the negative repercussions resulting from globalization. Studies have indicated that globalization, despite all the positive effects, has resulted in a loss of identity within a city. As a city develops over time, its identity is evolving as well and may even be lost due to rapid and constant changes it is subjected to. Discussed as well are examples and tendencies in dealing with urban identities as well as the transformation of cities and urban cultures mentioned in terms of form, identity, and art. This book is a combination of innovative research submitted to a conference on Cities’ Identity Through Architecture and Arts (CITAA) whereas scholars from all over the world gather in one venue to discuss cultural, historical, and economic issues of the city. Thus, the book offers a collective and global solution that is applicable on a universal level. The research presented in this book was conducted by authors, or rather participants of the conference from, three different continents of the world and organized by IEREK. It was a distinct opportunity for them to share their thoughts with leading scholars and professionals in the field of Architecture, Arts, and Planning. The research and materials in this book are directed at those who are actively engaged in the decision-making processes and to a heterogeneous audience who has an interest to critically examine all the new literature available in the field. A special word of thanks should be made to the editors of this book and to all the authors and co-authors of the chapters who collectively provided the academic community with unique and increasingly valuable literature