Dissertations / Theses on the topic 'Local Learning and Employment Networks'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 25 dissertations / theses for your research on the topic 'Local Learning and Employment Networks.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
Kamp, Annelies, and Annelies kamp@deakin edu au. "A study of the Geelong Local Learning and Employment Network." Deakin University. School of Education, 2006. http://tux.lib.deakin.edu.au./adt-VDU/public/adt-VDU20070329.145032.
Full textHundley, Gene. "Collaborative Learning and Wireless Local Area Networks." NSUWorks, 2003. http://nsuworks.nova.edu/gscis_etd/599.
Full textOutkin, Alexander V. "Local Interactions, Learning and Automata Networks in Games." Diss., Virginia Tech, 1998. http://hdl.handle.net/10919/29465.
Full textPh. D.
Lögdlund, Ulrik. "Networks and Nodes : The Practices of Local Learning Centres." Doctoral thesis, Linköpings universitet, Avdelningen för sociologi (SOC), 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-69601.
Full textDenna avhandling är en studie om lärcentra i Sverige. Syftet är att beskriva och öka kunskapen om de relationer och de aktörsnätverk som omger praktiken. Avhandlingen bygger på resultat från fyra olika delstudier. Fokus i två av dessa ligger på lärcentra som organisation. Hur ser relationen mellan lärcentra och omgivande aktörer ut i regionen och vilka strategier används för att skapa aktörsnätverk? De övriga två studierna handlar om videokonferens där fokus ligger på hur relationer skapas mellan miljö, teknik och människor. Särskilt studeras interaktion och kommunikation mellan dessa aktörer i en utpräglat socioteknisk lärandemiljö. Den teoretiska ramen för de olika delstudierna är aktörsnätverksteori som används tillsammans med begrepp som spatiala relationer. De fyra studierna använder sig i huvudsak av kvalitativa metoder som intervjuer och observationsstudier. Datainsamlingen berör en bred samling informanter som rektorer, lärare och studenter tillsammans med projektledare, politiker och företagare. Studiernas resultat visar att det finns skilda synsätt på utbildning och kompetens mellan olika grupper av aktörer. Trots involveringsstrategier av aktörer från omgivande aktörsnätverk lyckas man inte agera som en mäklare på en utbildningsmarknad. Resultaten visar vidare att miljö tillsammans med teknik har stort inflytande på hur studenter och lärare agerar i videokonferensklassrummen. Det är den materiella designen och den tekniska logiken som styr praktiken. Resultaten visar också på hur olika studerandestrategier utvecklas för att stå utanför interaktion i klassrummet tillsammans med hur lärares kommunikation utvecklas för att överbrygga avståndet till de studerande. Sammantaget visar de fyra studierna på hur olika aktörsnätverk inverkar på praktiken genom representationer.
Moore, Tessa Anne. "Primary strategy learning networks : a local study of a national initiative." Thesis, University of Birmingham, 2008. http://etheses.bham.ac.uk//id/eprint/160/.
Full textWilhelmi, Roca Francesc. "Towards spatial reuse in future wireless local area networks: a sequential learning approach." Doctoral thesis, Universitat Pompeu Fabra, 2020. http://hdl.handle.net/10803/669970.
Full textL'operació de reutilització espacial (SR) està guanyant impuls per a la darrera família d'estàndards IEEE 802.11 a causa dels aclaparadors requisits que presenten les xarxes sense fils de nova generació. En particular, la creixent necessitat de tràfic i el nombre de dispositius concurrents comprometen l'eficiència de les xarxes d'àrea local sense fils (WLANs) cada cop més concorregudes i posen en dubte la seva naturalesa descentralitzada. L'operació SR, inicialment introduïda per l'estàndard IEEE 802.11ax-2021 i estudiada posteriorment a IEEE 802.11be-2024, pretén augmentar el nombre de transmissions concurrents en un conjunt bàsic de serveis superposats (OBSS) mitjançant l'ajustament de la sensibilitat i el control de potència de transmissió, millorant així l'eficiència espectral. El nostre estudi sobre el funcionament de SR mostra un potencial destacat per millorar el nombre de transmissions simultànies en desplegaments multitudinaris, contribuint així al desenvolupament d'aplicacions de nova generació de baixa latència. Tot i això, els beneficis potencials de SR són actualment limitats per la rigidesa del mecanisme introduït per a l'11ax, i la manca de coordinació entre els BSS que ho implementen. L'operació SR evoluciona cap a esquemes coordinats on cooperen diferents BSS. En canvi, la coordinació comporta una sobrecàrrega de comunicació i sincronització, el qual té un impacte en el rendiment de les WLAN. D'altra banda, l'esquema coordinat és incompatible amb els dispositius que utilitzen versions anteriors IEEE 802.11, la qual cosa podria deteriorar el rendiment de les xarxes ja existents. Per aquests motius, en aquesta tesi s'avalua la viabilitat de mecanismes descentralitzats per a SR i s'analitzen minuciosament els principals impediments i mancances que se'n poden derivar. El nostre objectiu és donar llum a la futura forma de les WLAN pel que fa a l?optimització de SR i si s'ha de mantenir el seu caràcter descentralitzat, o bé és preferible evolucionar cap a desplegaments coordinats i centralitzats. Per abordar SR de forma descentralitzada, ens centrem en la Intel·ligència Artificial (AI) i ens proposem utilitzar una classe de mètodes seqüencials basats en l'aprenentatge, anomenats Multi-Armed Bandits (MAB). L'esquema MAB s'adapta al problema descentralitzat de SR perquè aborda la incertesa causada pel funcionament simultani de diversos dispositius (és a dir, un entorn multi-jugador) i la falta d'informació que se'n deriva. Els MAB poden fer front a la complexitat darrera les interaccions espacials entre dispositius que resulten de modificar la seva sensibilitat i potència de transmissió. En aquest sentit, els nostres resultats indiquen guanys importants de rendiment (fins al 100 \%) en desplegaments altament densos. Tot i això, l'aplicació d'aprenentatge automàtic amb múltiples agents planteja diversos problemes que poden comprometre el rendiment dels dispositius d'una xarxa (definició d'objectius conjunts, horitzó de convergència, aspectes d'escalabilitat o manca d'estacionarietat). A més, el nostre estudi d'aprenentatge multi-agent per a SR multi-agent inclou aspectes d'infraestructura per a xarxes de nova generació que integrin AI de manera intrínseca.
Zoumpoulis, Spyridon Ilias. "Networks, decisions, and outcomes : coordination with local information and the value of temporal data for learning influence networks." Thesis, Massachusetts Institute of Technology, 2014. http://hdl.handle.net/1721.1/91100.
Full textCataloged from PDF version of thesis.
Includes bibliographical references (pages 173-177).
We study decision making by networked entities and the interplay between networks and outcomes under two different contexts: in the first part of the thesis, we study how strategic agents that share local information coordinate; in the second part of the thesis, we quantify the gain of having access to temporally richer data for learning of influence networks. In the first part of the thesis, we study the role of local information channels in enabling coordination among strategic agents. Building on the standard finite-player global games framework, we show that the set of equilibria of a coordination game is highly sensitive to how information is locally shared among agents. In particular, we show that the coordination game has multiple equilibria if there exists a collection of agents such that (i) they do not share a common signal with any agent outside of that collection; and (ii) their information sets form an increasing sequence of nested sets, referred to as a filtration. Our characterization thus extends the results on the uniqueness and multiplicity of equilibria in global games beyond the well-known case in which agents have access to purely private or public signals. We then provide a characterization of how the extent of equilibrium multiplicity is determined by the extent to which subsets of agents have access to common information: we show that the size of the set of equilibrium strategies is increasing with the extent of variability in the size of the subsets of agents who observe the same signal. We study the set of equilibria in large coordination games, showing that as the number of agents grows, the game exhibits multiple equilibria if and only if a non-vanishing fraction of the agents have access to the same signal. We finally consider an application of our framework in which the noisy signals are interpreted to be the idiosyncratic signals of the agents, which are exchanged through a communication network. In the second part of the thesis, we quantify the gain in the speed of learning of parametric models of influence, due to having access to richer temporal information. We infer local influence relations between networked entities from data on outcomes and assess the value of temporal data by characterizing the speed of learning under three different types of available data: knowing the set of entities who take a particular action; knowing the order in which the entities take an action; and knowing the times of the actions. We propose a parametric model of influence which captures directed pairwise interactions and formulate different variations of the learning problem. We use the Fisher information, the Kullback-Leibler (KL) divergence, and sample complexity as measures for the speed of learning. We provide theoretical guarantees on the sample complexity for correct learning based on sets, sequences, and times. The asymptotic gain of having access to richer temporal data for the speed of learning is thus quantified in terms of the gap between the derived asymptotic requirements under different data modes. We also evaluate the practical value of learning with richer temporal data, by comparing learning with sets, sequences, and times given actual observational data. Experiments on both synthetic and real data, including data on mobile app installation behavior, and EEG data from epileptic seizure events, quantify the improvement in learning due to richer temporal data, and show that the proposed methodology recovers the underlying network well.
by Spyridon Ilias Zoumpoulis.
Ph. D.
Todeschi, Tiziano. "Calibration of local-stochastic volatility models with neural networks." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2021. http://amslaurea.unibo.it/23052/.
Full textTaveira, Ana Cristina Estêvão Monteiro. "Estratégias em parceria de desenvolvimento local : o caso das Redes Regionais para o Emprego." Master's thesis, Instituto Superior de Economia e Gestão, 2002. http://hdl.handle.net/10400.5/4193.
Full textA discussão em torno das novas lógicas de desenvolvimento, fez emergir um crescente interesse pela perspectiva de um desenvolvimento assente numa lógica territorial de base regional e local. A esta dimensão, ressalta a capacidade de mobilização dos actores locais para a participação no processo de desenvolvimento das suas regiões e a ênfase na autonomia de decisão das comunidades territorialmente organizadas. Neste contexto, compete ao Estado, um papel fundamental de animador e catalisador da sociedade civil, tornando-se num parceiro activo em iniciativas locais. O presente trabalho pretende contribuir para a reflexão sobre a definição dos contornos de um modelo de intervenção na promoção do desenvolvimento, com base no exemplo extraído na experiência portuguesa das Redes Regionais para o Emprego (RRE) ao nível da mobilização, intervenção e integração de estratégias de desenvolvimento dos actores públicos e privados locais, cooperando num quadro de parceria. Tratando-se de uma experiência relativamente recente, cujo processo de constituição teve início em 1998, e não existindo informação sistematizada, as conclusões a que se chegou, decorrem dos resultados da análise empírica (efectuada a partir de um inquérito aplicado aos actores locais que integram as RRE) interpretados à luz do corpo teórico e ainda das considerações tecidas pelos entrevistados sobre esta problemática. Em síntese, apesar de confinadas a um contexto de actuação restrito, as RRE demonstram uma capacidade de concertação estratégica entre os actores locais em presença, mobilizados em torno de interesses comuns com base numa identidade territorial das respectivas regiões. São, contudo, fortemente pilotadas pelo Estado Central, e do ponto de vista da estrutura organizativa formal trata-se de uma articulação verticalizada, de lógica top-down cujo modelo de intervenção apesar de enquadrado inicialmente para a acção, veio a verificar uma oscilação para um modelo mais dirigido para a provisão.
The debate on the new logics of development has arisen an increasing interest in a developing perspective based on a territorial logic of regional and local support. To this extent, it stands out the local performers ability of mobilization by participating in the developing process of their regions, as well as the stress on the power of decision and autonomy of the communities organized by territorial areas. Within this context, it is also due to the State to deal with a fundamental matter, and become an active partner in local initiatives as a performer and promoter of civil society. The purpose of the current study is to make a contribution to the reflection on the definition of an intervention model to the promotion of the development, regarding the example given by the Portuguese experience within the Regional Networks for Employment (RNE) [Redes Regionais para o Emprego (RRE)], concerning the mobilization, intervention and integration through developing strategies of the local performers, both private and public, and cooperating in a partnership project. Considering this a rather new experience, whose process of constitution took place in the beginning of 1998, and since systematic information does not exist, we have reached to conclusions resulting from an empiric analysis (based on an inquiry applied to the local performers who belong to the RNE). The interpretation of the results was enlightened by the theoretical body, and took into account the comments on this matter made by the interviewees. In brief, despite the restricte context, the RRE show a capacity for strategic accord among the local agents, around common interests based in a territorial identity of the regions. They are, however, conduced by central State, and from the formal organizational structure, it's a verticalized connection suported in a top-down logic whose initial intervention action model was changed into a more directed model to provision.
Stella, Federico. "Learning a Local Reference Frame for Point Clouds using Spherical CNNs." Master's thesis, Alma Mater Studiorum - Università di Bologna, 2020. http://amslaurea.unibo.it/20197/.
Full textBarrachina, Muñoz Sergio. "Responsive spectrum management for wireless local area networks: from heuristic-based policies to model-free reinforcement learning." Doctoral thesis, Universitat Pompeu Fabra, 2021. http://hdl.handle.net/10803/670782.
Full textEn aquesta tesi ens centrem en el problema conjunt de la gestió de l'espectre: assignació de canals primaris i secundaris a xarxes d'àrea local sense fils (WLAN) amb channel bonding. Des de l'estàndard IEEE 802.11n fins a estàndards més recents com el 802.11ac, el 802.11ax i el 802.11be, s'han anat proposant amplades de banda més grans per permetre agrupar canals, augmentant així l'amplada de banda total per transmissió. Tot i que aquest augment en l'amplada de banda afavoreix la capacitat potencial de les xarxes, suportant així els requeriments de les noves aplicacions Wi-Fi, també redueix la potència per Hertz i accentua els problemes de contenció i interferència entre nodes veïns. En resum, si les xarxes WLANs ja eren complexes per se, s'estan tornant encara més complexes a causa de l'augment de la densitat de nodes i de les noves prestacions incloses als darrers estàndards. Primer proposem un model analític basat en xarxes Markov en temps continu (CTMN) per caracteritzar channel bonding en WLANs saturades. Aquest model es basa en un nou algorisme que genera CTMNs a partir d'escenaris distribuïts espaialment, on no és necessari que els nodes estiguin dins del rang de contenció de la resta. Identifiquem els factors claus que afecten el rendiment i l'equitat de les diferents polítiques de channel bonding i mostrem l'existència d'interrelacions crítiques entre nodes en forma de reacció en cadena. D'això se'n desprèn que no hi ha una política channel bonding òptima única per a cada escenari. En ampliar el model analític per donar suport a règims no saturats, destaquem els avantatges d'assignar els canals tan amplis com sigui possible a les WLAN i implementar polítiques d'accés adaptatiu per fer front a les situacions que poden aparèixer tant en termes de rendiment com d'equitat. A part dels models analítics, aquesta tesi es basa en simulacions per generalitzar escenaris evitant costosos bancs de proves experimentals, de vegades inviables. Malauradament, els simuladors de xarxes sense fils existents solen ser massa simplistes o molt costosos computacionalment. És per això que desenvolupem el simulador de xarxes sense fils Komondor, concebut com una eina de codi obert accessible (llesta per utilitzar) per a la investigació de xarxes sense fils. L’avantatge essencial de Komondor respecte d’altres simuladors sense fils coneguts rau en la seva elevada velocitat de processament d’esdeveniments. A continuació ens desviem de models analítics i simulacions i abordem mesures reals a través del Wi-Fi All-Channel Analyzer (WACA), el primer sistema que mesura simultàniament l'energia de tots els 24 canals que permeten channel bonding a la banda Wi-Fi dels 5 GHz. Amb WACA, realitzem un estudi únic de localitzacions que inclouen nuclis urbans, barris residencials, universitats i fins i tot un partit a al Camp Nou, un estadi ple amb 98.000 aficionats i 12.000 connexions Wi-Fi simultànies. Les dades experimentals revelen els factors fonamentals que controlen el guany de rendiment, a partir dels quals ressaltem la correlació entre canals. També mostrem la importància del conjunt de dades recopilades per trobar nous factors claus, que d'una altra manera no seria possible, atès que els models d'ocupació de canals simples subestimen els guanys potencials. Pel que fa a solucions, primer discutim propostes basades en heurístiques per trobar configuracions satisfactòries ràpidament. En aquest sentit, proposem dinàmicament (DyWi), un algorisme de selecció de canal primari en línia, descentralitzat i eficient per xarxes channel bonding. DyWi millora el rendiment esperat tenint en compte no només l’ocupació del canal primari objectiu, sinó també l’activitat dels canals secundaris. Fins i tot quan suposem retards significatius a causa del canvi de canal primari, observem millores importants en termes de rendiment i retard. Finalment, identifiquem els enfocaments d’aprenentatge automàtic (o machine learning) aplicables al problema de la gestió de l’espectre a les WLAN i justifiquem per què l'aprenentatge del tipus reinforcement learning (RL) és el més adient. En particular, ens centrem en el rendiment adequat de les variacions d'RL sense estats i proposem multi-armed bandits com la solució adequada, ja que i) necessitem una adaptabilitat ràpida per millorar l’experiència d’usuari en escenaris Wi-Fi dinàmics i ii) el nombre de configuracions multicanal que una xarxa pot adoptar és limitat; per tant, els agents poden explorar completament l’espai d’acció en un temps raonable.
Chen, Ye. "Fuzzy Cognitive Maps: Learning Algorithms and Biomedical Applications." University of Cincinnati / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1423581705.
Full textAndersson, Camilla. "Hastily Formed Networks och lokal egenmakt : En fallstudie utifrån implementeringen av en proaktiv katastrofledning i Indonesien." Thesis, Umeå universitet, Institutionen för kultur- och medievetenskaper, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-146312.
Full textJunuthula, Ruthwik Reddy. "Modeling, Evaluation and Analysis of Dynamic Networks for Social Network Analysis." University of Toledo / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1544819215833249.
Full textCelebi, Deniz. "The Role Of Local Capabilities In The Exporting Smes And Their Role In The Regional Economic Grtowth: The Case Study Of Ankara." Master's thesis, METU, 2003. http://etd.lib.metu.edu.tr/upload/12604806/index.pdf.
Full textGibson, Laila. "Learning Destinations : The complexity of tourism development." Doctoral thesis, Karlstad University, Faculty of Social and Life Sciences, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-435.
Full textOur world is becoming increasingly complex, and is rapidly changingwith distances being reduced. Societies today are also in atransition from traditional production industries to increasingreliance on communication, consumption, services and experience. Asone of these emerging ‘new industries’, tourism is part of thismovement. Globalisation also makes further development of tourismpossible through, amongst other things, the spreading of languages;the development of low-cost carriers; international monetary systems;telecommunications and other technological innovations. Tourismcontributes to the globalisation of society and at the same time is aproduct of it. This is confirmed by complexity theories that stressthe systematic and dynamic nature of globalisation and theinterdependence of the global and the local. Hence, in this thesis,it is argued that acknowledging the complexity of tourism isnecessary for understanding tourism development, and more knowledgeabout tourism also leads to greater knowledge of our society.
The main aim of this thesis is to understand the complexity of localand regional tourist destination development, by exploring social andcultural factors that influence this development. In order to fulfilthis aim, analysis has been conducted at three different levels:places, projects and people. More specifically, by examining placesand how they develop as destinations; investigating the structure of,and processes within, groups and networks important for destinationdevelopment and by exploring the roles, resources and attitudes ofenterprising people who are seen as key for development. The thesisis based on a research project including three studies of tourismdestinations and projects in Northern Sweden and Scotland.
The social and cultural factors connected to tourism development arein turn part of learning processes, which in this thesis are seen asfundamental mechanisms for processes of development. A frameworkcalled ‘Learning Destinations’ is introduced that demonstrates howimportant social and cultural factors manifest themselves at each ofthe three levels: places, projects and people. History and heritageand rationales are the main cultural factors discussed, whilstinteraction and boundaries are prominent social factors found toinfluence tourism development. It is suggested that the framework of‘Learning Destinations’ may serve as a tool for understanding thecomplexity of local and regional tourism development.
Bardaine, Clémence. "La fabrique des paysages et des savoir-faire agroforestiers dans le bassin francilien : acteurs, processus et projets." Thesis, Paris, Institut agronomique, vétérinaire et forestier de France, 2020. http://www.theses.fr/2020IAVF0021.
Full textFaced with the environmental and climatic crisis, practices based on the management of ecological processes are opening up a new horizon for agriculture. The current challenge of agroforestry, based on associations of trees, crops and/or animals, is no longer limited to production alone, but also affects its sustainability and in particular the provision of ecosystem services and the food resilience of territories. However, these agroecological practices cannot result from the application of technical recipes. Can farmers’ naturalistic and agroecological knowledge of landscapes, become a vector for the transmission of agroforestry practices mainly through neighborhood effect and collective learning ? A critical study of the methods and mechanisms of learning, transmission and support of agroforestry practices in the Paris Basin is carried out through a transdisciplinary, ethno-geographic and pragmatic approach. The stories of their agroecological trajectories are retraced through ethnographic investigation and documentary collection from the field (photography, drawing of farmers, project plan). A typology of the different forms of agroforestry landscapes (intra-plot tree lines, diversified hedgerows gridding, etc.) and the range of ecological and diversification knowledge associated with them is proposed. In contrast, the mistrust of trees among some soil conservation farmers is identified. Secondly, the survey on the methods of support by stakeholders in territorial development (farmers, landowners, agricultural development associations, agents of regional nature parks and communities of municipalities), sheds light on conflicts and alliances between actors. The tools and collective learning processes of this outside agroecological university are highlighted through the chronicles of farmers' collective workshops and participatory research projects around the heritage of locally adapted seeds and woody plants (ecological survey, botanical index, reading and landscape design, project and pruning workshops, participatory selection). This work offers a synthesis of the brakes (the long time, the lack of local references and management know-how, the tree in the rural lease). And the conditions of transmission of agroforestry practices (pioneering attitudes, empirical and transversal approaches, involvement of territorial actors) are articulated between different scales: from the plot to the plain, to the community of actors in the large landscape. Finally, this thesis identifies a set of updating of living heritage which, through the agro-ecosystem benefits and the local food systems resulting from these new agricultural landscapes; could become the basis of a local project guaranteeing the environmental, social and economic sustainability of the territory
Yang, Tun-Jen, and 楊敦仁. "Learning-Based Intrusion Detection Scheme for Wireless Local Area Networks." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/66786837376134447228.
Full text大葉大學
資訊管理學系碩士班
97
Since the technology of wireless local networks were invented, the character of data transmitting without being restricted by any physical media can let people access and share network resources anytime. Although the wireless infrastructure brings much convenience to us, at the same time, a large number of information is secret exposed. Hence, hackers can wiretap the transmitted data and embezzle the resources of wireless facilities, so that intrusion detection systems become indispensable roles wireless local networks. However, current intrusion detection systems arise too much false-alarm and false-negative with the result that system administrators should deeply concern about whether the alarm is useless and notice the effectiveness of rule base. Therefore, our research addresses this issue by integrating fuzzy association rules into the linear discriminant analysis (LDA) to construct a hybrid intrusion detection scheme. By employing misuse detection, we implement LDA to find out the unknown attacks which were hidden among the regular behaviors, then trace their attack patterns and characteristics by using the fuzzy association rules, and further automatically add the rules into the rule base to achieve the goal of self-learning functionality, such that it can increase the detecting rate of intrusion detection system and enhance the updating efficiency of rule base. Finally, an intrusion detection system was implemented to demonstrate the feasibility of our proposed scheme.
Kutsia, Merab [Verfasser]. "Learning and generalisation in neural networks with local preprocessing / presented by Merab Kutsia." 2007. http://d-nb.info/98568612X/34.
Full text"Locally connected recurrent neural networks." Chinese University of Hong Kong, 1993. http://library.cuhk.edu.hk/record=b5887724.
Full textThesis (M.Phil.)--Chinese University of Hong Kong, 1993.
Includes bibliographical references (leaves 161-166).
List of Figures --- p.vi
List of Tables --- p.vii
List of Graphs --- p.viii
Abstract --- p.ix
Chapter Part I --- Learning Algorithms
Chapter 1 --- Representing Time in Connectionist Models --- p.1
Chapter 1.1 --- Introduction --- p.1
Chapter 1.2 --- Temporal Sequences --- p.2
Chapter 1.2.1 --- Recognition Tasks --- p.2
Chapter 1.2.2 --- Reproduction Tasks --- p.3
Chapter 1.2.3 --- Generation Tasks --- p.4
Chapter 1.3 --- Discrete Time v.s. Continuous Time --- p.4
Chapter 1.4 --- Time Delay Neural Network (TDNN) --- p.4
Chapter 1.4.1 --- Delay Elements in the Connections --- p.5
Chapter 1.4.2 --- NETtalk: An Application of TDNN --- p.7
Chapter 1.4.3 --- Drawbacks of TDNN --- p.8
Chapter 1.5 --- Networks with Context Units --- p.8
Chapter 1.5.1 --- Jordan's Network --- p.9
Chapter 1.5.2 --- Elman's Network --- p.10
Chapter 1.5.3 --- Other Architectures --- p.14
Chapter 1.5.4 --- Drawbacks of Using Context Units --- p.15
Chapter 1.6 --- Recurrent Neural Networks --- p.16
Chapter 1.6.1 --- Hopfield Models --- p.17
Chapter 1.6.2 --- Fully Recurrent Neural Networks --- p.20
Chapter A. --- EXAMPLES OF USING RECURRENT NETWORKS --- p.22
Chapter 1.7 --- Our Objective --- p.25
Chapter 2 --- Learning Algorithms for Recurrent Neural Networks --- p.27
Chapter 2.1 --- Introduction --- p.27
Chapter 2.2 --- Gradient Descent Methods --- p.29
Chapter 2.2.1 --- Backpropagation Through Time (BPTT) --- p.29
Chapter 2.2.2 --- Real Time Recurrent Learning Rule (RTRL) --- p.30
Chapter A. --- RTRL WITH TEACHER FORCING --- p.32
Chapter B. --- TERMINAL TEACHER FORCING --- p.33
Chapter C. --- CONTINUOUS TIME RTRL --- p.33
Chapter 2.2.3 --- Variants of RTRL --- p.34
Chapter A. --- SUB GROUPED RTRL --- p.34
Chapter B. --- A FIXED SIZE STORAGE 0(n3) TIME COMPLEXITY LEARNGING RULE --- p.35
Chapter 2.3 --- Non-Gradient Descent Methods --- p.37
Chapter 2.3.1 --- Neural Bucket Brigade (NBB) --- p.37
Chapter 2.3.2 --- Temporal Driven Method (TO) --- p.38
Chapter 2.4 --- Comparison between Different Approaches --- p.39
Chapter 2.5 --- Conclusion --- p.41
Chapter 3 --- Locally Connected Recurrent Networks --- p.43
Chapter 3.1 --- Introduction --- p.43
Chapter 3.2 --- Locally Connected Recurrent Networks --- p.44
Chapter 3.2.1 --- Network Topology --- p.44
Chapter 3.2.2 --- Subgrouping --- p.46
Chapter 3.2.3 --- Learning Algorithm --- p.47
Chapter 3.2.4 --- Continuous Time Learning Algorithm --- p.50
Chapter 3.3 --- Analysis --- p.51
Chapter 3.3.1 --- Time Complexity --- p.51
Chapter 3.3.2 --- Space Complexity --- p.51
Chapter 3.3.3 --- Local Computations in Time and Space --- p.51
Chapter 3.4 --- Running on Parallel Architectures --- p.52
Chapter 3.4.1 --- Mapping the Algorithm to Parallel Architectures --- p.52
Chapter 3.4.2 --- Parallel Learning Algorithm --- p.53
Chapter 3.4.3 --- Analysis --- p.54
Chapter 3.5 --- Ring-Structured Recurrent Network (RRN) --- p.55
Chapter 3.6 --- Comparison between RRN and RTRL in Sequence Recognition --- p.55
Chapter 3.6.1 --- Training Sets and Testing Sequences --- p.56
Chapter 3.6.2 --- Comparison in Training Speed --- p.58
Chapter 3.6.3 --- Comparison in Recalling Power --- p.59
Chapter 3.7 --- Comparison between RRN and RTRL in Time Series Prediction --- p.59
Chapter 3.7.1 --- Comparison in Training Speed --- p.62
Chapter 3.7.2 --- Comparison in Predictive Power --- p.63
Chapter 3.8 --- Conclusion --- p.65
Chapter Part II --- Applications
Chapter 4 --- Sequence Recognition by Ring-Structured Recurrent Networks --- p.67
Chapter 4.1 --- Introduction --- p.67
Chapter 4.2 --- Related Works --- p.68
Chapter 4.2.1 --- Feedback Multilayer Perceptron (FMLP) --- p.68
Chapter 4.2.2 --- Back Propagation Unfolded Recurrent Rule (BURR) --- p.69
Chapter 4.3 --- Experimental Details --- p.71
Chapter 4.3.1 --- Network Architecture --- p.71
Chapter 4.3.2 --- Input/Output Representations --- p.72
Chapter 4.3.3 --- Training Phase --- p.73
Chapter 4.3.4 --- Recalling Phase --- p.73
Chapter 4.4 --- Experimental Results --- p.74
Chapter 4.4.1 --- Temporal Memorizing Power --- p.74
Chapter 4.4.2 --- Time Warping Performance --- p.80
Chapter 4.4.3 --- Fault Tolerance --- p.85
Chapter 4.4.4 --- Learning Rate --- p.87
Chapter 4.5 --- Time Delay --- p.88
Chapter 4.6 --- Conclusion --- p.91
Chapter 5 --- Time Series Prediction --- p.92
Chapter 5.1 --- Introduction --- p.92
Chapter 5.2 --- Modelling in Feedforward Networks --- p.93
Chapter 5.3 --- Methodology with Recurrent Networks --- p.94
Chapter 5.3.1 --- Network Structure --- p.94
Chapter 5.3.2 --- Model Building - Training --- p.95
Chapter 5.3.3 --- Model Diagnosis - Testing --- p.95
Chapter 5.4 --- Training Paradigms --- p.96
Chapter 5.4.1 --- A Quasiperiodic Series with White Noise --- p.96
Chapter 5.4.2 --- A Chaotic Series --- p.97
Chapter 5.4.3 --- Sunspots Numbers --- p.98
Chapter 5.4.4 --- Hang Seng Index --- p.99
Chapter 5.5 --- Experimental Results and Discussions --- p.99
Chapter 5.5.1 --- A Quasiperiodic Series with White Noise --- p.101
Chapter 5.5.2 --- Logistic Map --- p.103
Chapter 5.5.3 --- Sunspots Numbers --- p.105
Chapter 5.5.4 --- Hang Seng Index --- p.109
Chapter 5.6 --- Conclusion --- p.112
Chapter 6 --- Chaos in Recurrent Networks --- p.114
Chapter 6.1 --- Introduction --- p.114
Chapter 6.2 --- Important Features of Chaos --- p.115
Chapter 6.2.1 --- First Return Map --- p.115
Chapter 6.2.2 --- Long Term Unpredictability --- p.117
Chapter 6.2.3 --- Sensitivity to Initial Conditions (SIC) --- p.118
Chapter 6.2.4 --- Strange Attractor --- p.119
Chapter 6.3 --- Chaotic Behaviour in Recurrent Networks --- p.120
Chapter 6.3.1 --- Network Structure --- p.121
Chapter 6.3.2 --- Dynamics in Training --- p.121
Chapter 6.3.3 --- Dynamics in Testing --- p.122
Chapter 6.4 --- Experiments and Discussions --- p.123
Chapter 6.4.1 --- Henon Model --- p.123
Chapter 6.4.2 --- Lorenz Model --- p.127
Chapter 6.5 --- Conclusion --- p.134
Chapter 7 --- Conclusion --- p.135
Appendix A Series 1 Sine Function with White Noise --- p.137
Appendix B Series 2 Logistic Map --- p.138
Appendix C Series 3 Sunspots Numbers from 1700 to 1979 --- p.139
Appendix D A Quasiperiodic Series with White Noise --- p.141
Appendix E Hang Seng Daily Closing Index in 1991 --- p.142
Appendix F Network Model for the Quasiperiodic Series with White Noise --- p.143
Appendix G Network Model for the Logistic Map --- p.144
Appendix H Network Model for the Sunspots Numbers --- p.145
Appendix I Network Model for the Hang Seng Index --- p.146
Appendix J Henon Model --- p.147
Appendix K Network Model for the Henon Map --- p.150
Appendix L Lorenz Model --- p.151
Appendix M Network Model for the Lorenz Map --- p.159
Bibliography --- p.161
Chen, Guo-Cyuan, and 陳國泉. "A Global-Local-Color based Object Detection System Using Fuzzy Neural Networks With Support Vector Learning." Thesis, 2008. http://ndltd.ncl.edu.tw/handle/42024194836296031108.
Full text國立中興大學
電機工程學系所
96
A new method for real-time object detection by a Fuzzy Neural Network with Principal Component-based Support Vector learning (FNN-PCSV) is proposed in this thesis. FNN-PCSV is a fuzzy system that consists of Takagi-Sugeno-Kang (TSK) type fuzzy rules. The antecedent part of FNN-PCSV is generated via fuzzy clustering of the input data. The dimension of free parameter vector in the consequent part of FNN-PCSV is first reduced by the PCA. A linear support vector machine is then used to tune the consequent parameters on the principal component space to give the network better generalization performance. The object detection system consists of two stages. The first stage uses color histogram of the global color appearance of an object as detection feature for a FNN-PCSV classifier. To represent color information by histograms as accurately as possible, a non-uniform partition of color space is proposed. An efficient method for histogram extraction during the image scanning process is proposed for real-time implementation. The second stage uses geometry-dependent local color appearance as color feature for another FNN-PCSV classifier. Candidates generated in stage one are filtered in this stage to reduce the number of false alarms. To verify performance of the proposed method, experiments on detection of two specific objects are performed. For comparison, other types of detection methods and classifiers are also applied to the same detection task. Results show the proposed FNN-PCSV-based detection system achieves better results than compared methods.
HUANG, SHIH-MENG, and 黃仕孟. "A Holistic and Local Feature Learning Method for Machine Health Monitoring with Convolutional Bi-Directional LSTM Networks." Thesis, 2019. http://ndltd.ncl.edu.tw/handle/xrkeg3.
Full text靜宜大學
資訊工程學系
107
In the modern industry, machine health monitoring systems are critical to the modern manufacturing industry. In the machine health monitoring, due to the advanced sensor technologies, the data-driven approach is becoming the most popular way. However, how to deal with the noise data and realize the spatial and temporal correlations presented in the data is a challenge. Traditional research focuses on the use of feature extraction methods to judge normal tool and wear tool for tool state. However, while detecting the characteristics of the worn tool, the tool is likely to cause damage to the workpiece and machine will be downtime. It will have a huge burden on time and material costs. With the rapid development and application of deep learning in recent years, data feature methods can be used to predict tool wear. It provides instant visibility into tool wear. The study proposes a deep learning model called Holistic-Local LSTM (HLLSTM) to predict tool wear. HLLSTM learns short-term data characteristics by segmenting data into fragment data. HLLSTM learns short-term data features by segmenting data into fragment data and short-term data features classify into holistic training and local training to capture more implicit feature information. HLLSTM learns short-term data features by segment data. Short-term data features classify into overall training and local training to capture more implicit feature information to predict tool wear. The data of the study is from 2010 phm society conference data challenge. It contains multiple sensor parameters and tool wear values. The model through the supervised learning method can train to learn the sensor parameters to predict the condition of tool wear. Finally, we compare the prediction error values of the HLLSTM model with the currently used neural network model. The model verifies the prediction accuracy by error values. The HLLSTM model presented in this paper predicts more accurate tool wear values. The HLLSTM model can reduce the mean absolute error between the actual and the predicted tool wear value by a factor of two compared to other neural network models.
Itani, Hani. "A Closer Look at Neighborhoods in Graph Based Point Cloud Scene Semantic Segmentation Networks." Thesis, 2020. http://hdl.handle.net/10754/665898.
Full textScellier, Benjamin. "A deep learning theory for neural networks grounded in physics." Thesis, 2020. http://hdl.handle.net/1866/25593.
Full textIn the last decade, deep learning has become a major component of artificial intelligence, leading to a series of breakthroughs across a wide variety of domains. The workhorse of deep learning is the optimization of loss functions by stochastic gradient descent (SGD). Traditionally in deep learning, neural networks are differentiable mathematical functions, and the loss gradients required for SGD are computed with the backpropagation algorithm. However, the computer architectures on which these neural networks are implemented and trained suffer from speed and energy inefficiency issues, due to the separation of memory and processing in these architectures. To solve these problems, the field of neuromorphic computing aims at implementing neural networks on hardware architectures that merge memory and processing, just like brains do. In this thesis, we argue that building large, fast and efficient neural networks on neuromorphic architectures also requires rethinking the algorithms to implement and train them. We present an alternative mathematical framework, also compatible with SGD, which offers the possibility to design neural networks in substrates that directly exploit the laws of physics. Our framework applies to a very broad class of models, namely those whose state or dynamics are described by variational equations. This includes physical systems whose equilibrium state minimizes an energy function, and physical systems whose trajectory minimizes an action functional (principle of least action). We present a simple procedure to compute the loss gradients in such systems, called equilibrium propagation (EqProp), which requires solely locally available information for each trainable parameter. Since many models in physics and engineering can be described by variational principles, our framework has the potential to be applied to a broad variety of physical systems, whose applications extend to various fields of engineering, beyond neuromorphic computing.
Mavalela, Hildah Ramadimetja. "Phela o phedise : a case study of an income-generating project in Moganyaka community." Diss., 1999. http://hdl.handle.net/10500/18179.
Full textSocial work
M.A. (SS) (Mental Health)