A Search For Thermospheric Composition Perturbations Due To Vertical Winds

Thesis (Ph.D.) University of Alaska Fairbanks, 2006The thermosphere is generally in hydrostatic equilibrium, with winds blowing horizontally along stratified constant-pressure surfaces, driven by the dayside-to-nightside pressure gradient. A marked change in this paradigm resulted after Spencer et al. [1976] reported vertical wind measurements of 80 m·s-1 from analyses of AE-C satellite data. It is now established that the thermosphere routinely supports large-magnitude (~30-150 m·s-1) vertical winds at auroral latitudes. These vertical winds represent significant departure from hydrostatic and diffusive equilibrium, altering locally---and potentially globally---the thermosphere's and ionosphere's composition, chemistry, thermodynamics and energy budget. Because of their localized nature, large-magnitude vertical wind effects are not entirely known. This thesis presents ground-based Fabry-Perot Spectrometer OI(630.0)-nm observations of upper-thermospheric vertical winds obtained at Inuvik, NT, Canada and Poker Flat, AK. The wind measurements are compared with vertical displacement estimates at ~104 km2 horizontal spatial scales determined from a new modification to the electron transport code of Lummerzheim and Lilensten [1994] as applied to FUV-wavelength observations by POLAR spacecraft's Ultraviolet Imager [Torr et al. , 1995]. The modification, referred to as the column shift, simulates vertical wind effects such as neutral transport and disruption of diffusive equilibrium by vertically displacing the Hedin [1991] MSIS-90 [O2]/[N2] and [O]/([N2]+[O2]) mixing ratios and subsequently redistributing the O, O2, and N 2 densities used in the transport code. Column shift estimates are inferred from comparisons of UVI OI(135.6)-nm auroral observations to their corresponding modeled emission. The modeled OI(135.6)-nm brightness is determined from the modeled thermospheric response to electron precipitation and estimations of the energy flux and characteristic energy of the precipitation, which are inferred from UVI-observed Lyman-Birge-Hopfield N2 emissions in two wavelength ranges. Two-dimensional column shift maps identify the spatial morphology of thermospheric composition perturbations associated with auroral forms relative to the model thermosphere. Case-study examples and statistical analyses of the column shift data sets indicate that column shifts can be attributed to vertical winds. Unanticipated limitations associated with modeling of the OI(135.6)-nm auroral emission make absolute column shift estimates indeterminate. Insufficient knowledge of thermospheric air-parcel time histories hinders interpretations of point-to-point time series comparisons between column shifts and vertical winds

Ant Colony Algorithms for the Resolution of Semantic Searches in P2P Networks

Tesis por compendio[EN] The long-lasting trend in the field of computation of stress and resource distribution has found its way into computer networks via the concept of peer-to-peer (P2P) connectivity. P2P is a symmetrical model, where each network node is enabled a comparable range of capacities and resources. It stands in a stark contrast to the classical, strongly asymmetrical client-server approach. P2P, originally considered only a complimentary, server-side structure to the straightforward client-server model, has been shown to have the substantial potential on its own, with multiple, widely known benefits: good fault tolerance and recovery, satisfactory scalability and intrinsic load distribution. However, contrary to client-server, P2P networks require sophisticated solutions on all levels, ranging from network organization, to resource location and managing. In this thesis we address one of the key issues of P2P networks: performing efficient resource searches of semantic nature under realistic, dynamic conditions. There have been numerous solutions to this matter, with evolutionary, stigmergy-based, and simple computational foci, but few attempt to resolve the full range of challenges this problem entails. To name a few: real-life P2P networks are rarely static, nodes disconnect, reconnect and change their content. In addition, a trivial incorporation of semantic searches into well-known algorithms causes significant decrease in search efficiency. In our research we build a solution incrementally, starting with the classic Ant Colony System (ACS) within the Ant Colony Optimization metaheuristic (ACO). ACO is an algorithmic framework used for solving combinatorial optimization problems that fits contractually the problem very well, albeit not providing an immediate solution to any of the aforementioned problems. First, we propose an efficient ACS variant in structured (hypercube structured) P2P networks, by enabling a path-post processing algorithm, which called Tabu Route Optimization (TRO). Next, we proceed to resolve the issue of network dynamism with an ACO-compatible information diffusion approach. Consequently, we attempt to incorporate the semantic component of the searches. This initial approximation to the problem was achieved by allowing ACS to differentiate between search types with the pheromone-per-concept idea. We called the outcome of this merger Routing Concept ACS (RC-ACS). RC-ACS is a robust, static multipheromone implementation of ACS. However, we were able to conclude from it that the pheromone-per-concept approach offers only limited scalability and cannot be considered a global solution. Thus, further progress was made in this respect when we introduced to RC-ACS our novel idea: dynamic pheromone creation, which replaces the static one-to-one assignment. We called the resulting algorithm Angry Ant Framework (AAF). In AAF new pheromone levels are created as needed and during the search, rather than prior to it. The final step was to enable AAF, not only to create pheromone levels, but to reassign them to optimize the pheromone usage. The resulting algorithm is called EntropicAAF and it has been evaluated as one of the top-performing algorithms for P2P semantic searches under all conditions.[ES] La popular tendencia de distribución de carga y recursos en el ámbito de la computación se ha transmitido a las redes computacionales a través del concepto de la conectividad peer-to-peer (P2P). P2P es un modelo simétrico, en el cual a cada nodo de la red se le otorga un rango comparable de capacidades y recursos. Se trata de un fuerte contraste con el clásico y fuertemente asimétrico enfoque cliente-servidor. P2P, originalmente considerado solo como una estructura del lado del servidor complementaria al sencillo modelo cliente-servidor, ha demostrado tener un potencial considerable por sí mismo, con múltiples beneficios ampliamente conocidos: buena tolerancia a fallos y recuperación, escalabilidad satisfactoria y distribución de carga intrínseca. Sin embargo, al contrario que el modelo cliente-servidor, las redes P2P requieren de soluciones sofisticadas a todos los niveles, desde la organización de la red hasta la gestión y localización de recursos. Esta tesis aborda uno de los problemas principales de las redes P2P: la búsqueda eficiente de recursos de naturaleza semántica bajo condiciones dinámicas y realistas. Ha habido numerosas soluciones a este problema basadas en enfoques evolucionarios, estigmérgicos y simples, pero pocas han tratado de resolver el abanico completo de desafíos. En primer lugar, las redes P2P reales son raramente estáticas: los nodos se desconectan, reconectan y cambian de contenido. Además, la incorporación trivial de búsquedas semánticas en algoritmos conocidos causa un decremento significativo de la eficiencia de la búsqueda. En esta investigación se ha construido una solución de manera incremental, comenzando por el clásico Ant Colony System (ACS) basado en la metaheurística de Ant Colony Optimization (ACO). ACO es un framework algorítmico usado para búsquedas en grafos que encaja perfectamente con las condiciones del problema, aunque no provee una solución inmediata a las cuestiones mencionadas anteriormente. En primer lugar, se propone una variante eficiente de ACS para redes P2P estructuradas (con estructura de hipercubo) permitiendo el postprocesamiento de las rutas, al que hemos denominado Tabu Route Optimization (TRO). A continuación, se ha tratado de resolver el problema del dinamismo de la red mediante la difusión de la información a través de una estrategia compatible con ACO. En consecuencia, se ha tratado de incorporar el componente semántico de las búsquedas. Esta aproximación inicial al problema ha sido lograda permitiendo al ACS diferenciar entre tipos de búsquedas através de la idea de pheromone-per-concept. El resultado de esta fusión se ha denominado Routing Concept ACS (RC-ACS). RC-ACS es una implementación multiferomona estática y robusta de ACS. Sin embargo, a partir de esta implementación se ha podido concluir que el enfoque pheromone-per-concept ofrece solo escalabilidad limitada y que no puede ser considerado una solución global. Por lo tanto, para lograr una mejora a este respecto, se ha introducido al RC-ACS una novedosa idea: la creación dinámica de feromonas, que reemplaza la asignación estática uno a uno. En el algoritmo resultante, al que hemos denominado Angry Ant Framework (AAF), los nuevos niveles de feromona se crean conforme se necesitan y durante la búsqueda, en lugar de crearse antes de la misma. La mejora final se ha obtenido al permitir al AAF no solo crear niveles de feromona, sino también reasignarlos para optimizar el uso de la misma. El algoritmo resultante se denomina EntropicAAF y ha sido evaluado como uno de los algoritmos más exitosos para las búsquedas semánticas P2P bajo todas las condiciones.[CA] La popular tendència de distribuir càrrega i recursos en el camp de la computació s'ha estès cap a les xarxes d'ordinadors a través del concepte de connexions d'igual a igual (de l'anglès, peer to peer o P2P). P2P és un model simètric on cada node de la xarxa disposa del mateix nombre de capacitats i recursos. P2P, considerat originàriament només una estructura situada al servidor complementària al model client-servidor simple, ha provat tindre el suficient potencial per ella mateixa, amb múltiples beneficis ben coneguts: una bona tolerància a errades i recuperació, una satisfactòria escalabilitat i una intrínseca distribució de càrrega. No obstant, contràriament al client-servidor, les xarxes P2P requereixen solucions sofisticades a tots els nivells, que varien des de l'organització de la xarxa a la localització de recursos i la seua gestió. En aquesta tesi s'adreça un dels problemes clau de les xarxes P2P: ser capaç de realitzar eficientment cerques de recursos de naturalesa semàntica sota condicions realistes i dinàmiques. Existeixen nombroses solucions a aquest tema basades en la computació simple, evolutiva i també basades en l'estimèrgia (de l'anglès, stigmergy), però pocs esforços s'han realitzat per intentar resoldre l'ampli conjunt de reptes existent. En primer lloc, les xarxes P2P reals són rarament estàtiques: els nodes es connecten, desconnecten i canvien els seus continguts. A més a més, la incorporació trivial de cerques semàntiques als algorismes existents causa una disminució significant de l'eficiència de la cerca. En aquesta recerca s'ha construït una solució incremental, començant pel sistema clàssic de colònia de formigues (de l'anglés, Ant Colony System o ACS) dins de la metaheurística d'optimització de colònies de formigues (de l'anglès, Ant Colony Optimization o ACO). ACO és un entorn algorísmic utilitzat per cercar en grafs i que aborda el problema de forma satisfactòria, tot i que no proveeix d'una solució immediata a cap dels problemes anteriorment mencionats. Primer, s'ha proposat una variant eficient d'ACS en xarxes P2P estructurades (en forma d'hipercub) a través d'un algorisme de processament post-camí el qual s'ha anomenat en anglès Tabu Route Optimization (TRO). A continuació, s'ha procedit a resoldre el problema del dinamisme de les xarxes amb un enfocament de difusió d'informació compatible amb ACO. Com a conseqüència, s'ha intentat incorporar la component semàntica de les cerques. Aquest enfocament inicial al problema s'ha realitzat permetent a ACS diferenciar entre tipus de cerques amb la idea de ''feromona per concepte'', i s'ha anomenat a aquest producte Routing Concept ACS o RC-ACS. RC-ACS és una implementació multi-feromona robusta i estàtica d'ACS. No obstant, s'ha pogut concloure que l'enfocament de feromona per concepte ofereix només una escalabilitat limitada i no pot ser considerada una solució global. En aquest respecte s'ha realitzat progrés posteriorment introduint una nova idea a RC-ACS: la creació dinàmica de feromones, la qual reemplaça a l'assignació un a un de les mateixes. A l'algorisme resultant se l'ha anomenat en anglès Angry Ant Framework (AAF). En AAF es creen nous nivells de feromones a mesura que es necessiten durant la cerca, i no abans d'aquesta. El progrés final s'ha aconseguit quan s'ha permès a AAF, no sols crear nivells de feromones, sinó reassignar-los per optimitzar la utilització de feromones. L'algorisme resultant s'ha anomenat EntropicAAF i ha sigut avaluat com un dels algorismes per a cerques semàntiques P2P amb millors prestacions.Krynicki, KK. (2016). Ant Colony Algorithms for the Resolution of Semantic Searches in P2P Networks [Tesis doctoral]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/61293TESISPremios Extraordinarios de tesis doctoralesCompendi

Simulation of non-linear bearing forces for post-stability investigation

Different types of bearing designs were developed to improve dynamic properties of rotor-bearing systems. Elliptical bearings, multisleeve bearings, tilting pad and other designs such as herringbone groove were utilized to increase resistance to the onset of self excited vibrations. Experimental trials are costly, two alternative methods are used to gain a qualitative insight. The first one creates mathematical model and applies both a digital or an analog computer simulation. The second one investigates phenomena occurring on the laboratory rig with the bearing replaced by an electronic simulating device, working in a feedback loop, which produces forces,which are functions of journal displacement and velocity. The simulated hydrodynamic forces are produced according to assumed characteristics matched to the bearing type. The principal benefit of the analog simulation is that nonlinear characteristics of a subsystem are precisely identified and mathematical methods applied for a wide class of problems are checked on the experimental installation

Articulatory grounding of phonemic distinctions in English by means of electropalatography

The aim of the experiment described in this paper was to devise and test a procedure that would allow identification of a phoneme on the basis of only tongue-to-palate and labial contacts that accompanied its realization in continuous read speech. The hypothesis underlying this study was that the articulatory correlates of the phonemic distinctive features can be induced statistically from dimensionality-reduced electropalatographic data.29931

An ACO-based personalized learning technique in support of people with acquired brain injury

This is the author’s version of a work that was accepted for publication in Applied Soft Computing . Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Applied Soft Computing 47 (2016) 316–331. DOI 10.1016/j.asoc.2016.04.039The ever-increasing cases of acquired brain injury (ABI), especially among young people, have prompted a rapid progress in research involving neurological disorders. One important path is the concept of relearning, which attempts to help people regain basic motor and cognitive skills lost due to illness or accident. The goals of relearning are twofold. First, there must exist a way to properly assess the necessities of an affected person, leading to a diagnosis, followed by a recommendation regarding the exercises, tests and tasks to perform; and second, there must be a way to confirm the results obtained from these recommendations in order to fine-tune and personalize the relearning process. This presents a challenge, as there is a deeply-rooted duality between the personalized and the generalized approach. In this work we propose a personalization algorithm based on the ant colony optimization (ACO), which is a bio-inspired meta-heuristic. As we show, the stochastic nature of ants has certain similarities to the human learning process. We combine the adaptive and exploratory capabilities of ACO systems to respond to rapidly changing environments and the ubiquitous human factor. Finally, we test the proposed solution extensively in various scenarios, achieving high quality results. © 2016 Elsevier B.V. All rights reservedThis research has been funded by the Spanish Ministry of Economy and Competitiveness and by the FEDER funds of the EU under the project SUPEREMOS (TIN2014-60077-R) and insPIre (TIN2012-34003). Kamil Krynicki is supported by the FPI fellowship from Universitat Politecnica de Valencia.Krynicki, K.; Jaén Martínez, FJ.; Navarro, E. (2016). An ACO-based personalized learning technique in support of people with acquired brain injury. Applied Soft Computing. 47:316-331. doi:10.1016/j.asoc.2016.04.039S3163314

A directional preference ETX measure for the collection tree protocol in mobile sensor networks

There has been a growing interest in Wireless Sensor Networks (WSN) that utilizes mobile nodes for various purposes. These mobile wireless sensor networks tend to suffer from constant link breakages mainly caused by connected nodes moving apart, often moving very quickly. These lost connections require WSNs to constantly repair the network connections; this constant maintenance in turn causes power and packet losses and very noisy network conditions. However a performance extending metric can be implemented in order to reduce the frequency and occurrence of lost links between a parent node and its child. As such a directional preference Estimated Transmissions Count (ETX) measure was developed for the Collection Tree Protocol (CTP) in order to create longer lasting links. This thesis describes and measures the performance of this directional preference ETX measure utilizing various metrics such as Packet Reception Ratio, average number of beacon transmissions per node, Parent changes and various others. The Packet Reception Ratio metric is primarily used to compare this directional preference ETX measure to other popular WSN algorithms such as M-Leach, Geographic Greedy Forwarding and as well regular CTP due to the differences in topology between these algorithms. Based on the packet reception ratio the directional preference ETX measure improves the performance of CTP such that it is capable of outperforming M-Leach in various scenarios

Corpus-based Online Word Formation Exercises for Advanced Learners of English – Challenges and Solutions

The paper presents the design and operation of an online platform for word formation practice. The system is based on a pre-defined list of pairs of base and derived forms and usage examples drawn automatically from the British National Corpus. A procedure for the extraction of example sentences is outlined. Results of 372 users’ interacting with the system for over 4.5 month are reviewed. The question about what factors influence users’ evaluation of specific exercises as more difficult is addressed. The results may be relevant in the area of language testing, preparation of examination materials, student-teacher online interaction and teaching English word formation

Methods and models for the quantitative analysis of crowd brainstorming

Microtask marketplaces provide shortcuts for automating tasks that are otherwise intractable for computers. Creative tasks fall squarely within this definition, and microtask marketplaces have been heavily leveraged to this end. Brainstorming is often an implicit component of these solutions. This thesis provides the first foundational study of brainstorming in microtask marketplaces, aimed at solving the open problems in brainstorming task design to make this process more accessible and effective. This is achieved by establishing techniques for coding brainstorming data at scale, models for quantifying desirable outcomes of brainstorming, and a qualitative deconstruction of brainstorming strategies employed in this environment. Idea forests are introduced as a data structure to enable the disambiguation of ideas in large corpuses, providing natural measures of two metrics of primary interest in brainstorming research: quantity and novelty. They are constructed via a tree-traversal algorithm, restricting the subset of the corpus which the coder must be aware of when making decisions. A simulation approach is introduced to assess the validity of hypothesis outcomes derived from idea forest metrics. The introduction of idea forests enables the core contribution of this thesis, a set of quantitative models for brainstorming outcomes. This thesis extracts several actionable conclusions from the parameters of these models: the rate of unique idea generation is subject to decay over time; individuals have a significant effect on the rate of idea generation, with productive workers generating dozens more unique ideas; and individuals generate their most novel ideas late in a brainstorming session, after the first 18 responses. Furthermore, a replication of findings by Nijstad and Stroebe is conducted, finding that workers take more time to generate ideas when changing semantic categories and are more likely to remain within a category than expected by chance. Finally, a taxonomy of strategies employed by brainstormers is presented. In particular, this thesis discusses the phenomena of scoping brainstorming problems, providing partial solutions, and riffing on previous solutions

A meta-analytic review examining the validity of tests of executive functioning to predict functional, driving and employment outcomes in individuals with a traumatic brain injury; and, An evaluation of the convergent validity of a face-to-face and virtual neuropsychological assessment

Rationale Executive functions represent an important domain of abilities that are vital for purposeful goal-directed behaviour. Disruption to these functions is commonly seen in Traumatic Brain Injury (TBI). Previous findings have suggested a link between executive functioning and cognitive recovery, although the evidence for this is mixed. Others have suggested a link between executive functioning and functional outcomes. Method A meta-analytic review was conducted. A total of 720 articles were identified from EMBASE, PsychInfo and MEDLINE, and further two articles were hand-searched from references. Twenty-four met inclusion criteria and were included in the review. Results The Trail Making Test (part B) (TMT-B) and Wisconsin Card Sorting Test (WCST) were significantly associated with functional outcomes following a TBI. Verbal Fluency was not significantly associated with functional outcome following a TBI. The TMT-B was also associated with a person’s ability to return to driving following a TBI, although there were only three studies reporting this outcome. No test of executive functioning was associated with employment outcomes following a TBI, although only four studies were included in this analysis. Conclusion Tests of executive functioning, specifically the TMT-B and WCST, were associated with functional outcomes following a TBI, which is important to guide rehabilitation strategies and future planning (such as care needs). This meta-analytic review has also highlighted the scarcity of research in specific outcomes (such as employment and driving)