Thesis (M.S.)--University of Michigan, 1971.

Thesis (Ph. D.)--University of Missouri-Columbia, 2002. / Typescript. Vita. Includes bibliographical references (leaves 64-72). Also available on the Internet.

Thesis (Ph. D.)--University of Missouri-Columbia, 2002. / Typescript. Vita. Includes bibliographical references (leaves 64-72). Also available on the Internet.

Thesis (Ph. D.)--University of Washington, 1996. / Vita. Includes bibliographical references (leaves [144]-155).

Universiẗat, Diss., 1998--Essen. / Textformat: PDF.

Thesis (Ph.D.)--Duquesne University, 2005. / Title from document title page. Abstract included in electronic submission form. Includes bibliographical references (p. 74-80) and index.

This thesis utilizes statistical physics concepts and mathematical modeling to study complex systems. I investigate the emergent complexities in two systems: (i) the stock volume volatility in the United States stock market system; (ii) the robustness of networks in an interdependent lattice network system. In Part I, I analyze the United States stock market data to identify how several financial factors significantly affect scaling properties of volume volatility time intervals. I study the daily trading volume volatility time intervals between two successive volume volatilities above a certain threshold q, and find a range of power law distributions. I also study the relations between the form of these distribution functions and several financial factors: stock lifetimes, market capitalization, volume, and trading value. I find that volume volatility time intervals are short-term correlated. I also find that the daily volume volatility shows a stronger long-term correlation for sequences of longer lifetimes. In Part II, I apply percolation theory to interacting complex networks. The dependency links between the two square lattice networks have a typical length r lattice units. For two nodes connecting by a dependency link, one node fails once the node on which it depends in the other network fails. I show that rich phase transition phenomena exist when the length of the dependency links r changes. The results suggest that percolation for small r is a second-order transition, and for larger r is a first-order transition. The study suggests that interdependent infrastructures embedded in two-dimensional space become most vulnerable when the interdependent distance is in the intermediate range, which is much smaller than the size of the system.

Aravind Chandrashekar, for the Master of Science degree in Electrical and Computer, presented on 02/09/2011, at Southern Illinois University Carbondale. TITLE: Reduction of Cache Related Preemption Delay using DVS in Real Time Systems MAJOR PROFESSOR: Dr. Harini Ramaprasad Embedded/real-time systems are ubiquitous in today's world. Providing temporal guarantees is paramount in such systems. In several multi-tasking real-time systems, tasks are assigned varying priorities and scheduled in accordance with a preemptive scheduling policy. When a task is preempted, a significant number of memory blocks belonging to the particular task are displaced from the cache memory between the time that the task is preempted and the time that the task resumes execution. Upon resumption, a corresponding amount of time is spent in reloading the cache with previously replaced memory blocks, thereby incurring what is known as cache-related preemption delay (CRPD). CRPD of a task due to a given preemption depends on the position in the program where the preempted task is executing at the time of preemption. As such, CRPD at different preemption points may be significantly different. In this thesis, we exploit this difference in CRPD and use dynamic voltage/frequency scaling (DVFS) to control the execution speed of a task such that it gets preempted in regions where the CRPD is low, as far as is possible without jeopardizing system schedulability. Simulation results demonstrate that our algorithm reduces number of cache reloads due to preemption to a reasonable extent, thereby reducing the repeated usage of off-chip memory bandwidth.

Submitted by MARCUS VINÍCIUS CAMILLO GÁLIA (niciu86@gmail.com) on 2016-04-11T19:04:40Z No. of bitstreams: 1 dissertacao_estrutura.pdf: 442836 bytes, checksum: 1fa4e568f456e1432401b1654274be6e (MD5) / Rejected by Juliano Benedito Ferreira (julianoferreira@reitoria.unesp.br), reason: Solicitamos que realize uma nova submissão seguindo as orientações abaixo: No campo “Versão a ser disponibilizada online imediatamente” foi informado que seria disponibilizado o texto completo porém no campo “Data para a disponibilização do texto completo” foi informado que o texto completo deverá ser disponibilizado apenas 6 meses após a defesa. Caso opte pela disponibilização do texto completo apenas 6 meses após a defesa selecione no campo “Versão a ser disponibilizada online imediatamente” a opção “Texto parcial”. Esta opção é utilizada caso você tenha planos de publicar seu trabalho em periódicos científicos ou em formato de livro, por exemplo e fará com que apenas as páginas pré-textuais, introdução, considerações e referências sejam disponibilizadas. Se optar por disponibilizar o texto completo de seu trabalho imediatamente selecione no campo “Data para a disponibilização do texto completo” a opção “Não se aplica (texto completo)”. Isso fará com que seu trabalho seja disponibilizado na íntegra no Repositório Institucional UNESP. Por favor, corrija esta informação realizando uma nova submissão. Agradecemos a compreensão. on 2016-04-13T12:36:13Z (GMT) / Submitted by MARCUS VINÍCIUS CAMILLO GÁLIA (niciu86@gmail.com) on 2016-04-13T14:24:54Z No. of bitstreams: 1 dissertacao_estrutura.pdf: 442836 bytes, checksum: 1fa4e568f456e1432401b1654274be6e (MD5) / Approved for entry into archive by Felipe Augusto Arakaki (arakaki@reitoria.unesp.br) on 2016-04-14T19:56:56Z (GMT) No. of bitstreams: 1 galia_mvc_me_rcla.pdf: 442836 bytes, checksum: 1fa4e568f456e1432401b1654274be6e (MD5) / Made available in DSpace on 2016-04-14T19:56:56Z (GMT). No. of bitstreams: 1 galia_mvc_me_rcla.pdf: 442836 bytes, checksum: 1fa4e568f456e1432401b1654274be6e (MD5) Previous issue date: 2016-01-26 / Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq) / O presente trabalho de pesquisa foi motivado por um modelo de bilhar unidimensional denominado de Bouncer. O modelo consiste em uma partícula movendo-se sob ação de um campo gravitacional e que colide com um plataforma móvel. Apresentaremos suas características e propriedades que motivaram a pesquisa para um bilhar bidimensional com geometria da fronteira do tipo ovóide. Os objetivos desta dissertação são de estudar as propriedades estatísticas e termodinâmicas de um bilhar ovóide com dependência temporal na fronteira em um regime dissipativo em relação as colisões entre a partícula e a fronteira. Para o bilhar bidimensional, apresentaremos as propriedades desenvolvidas inspiradas no modelo unidimensional. Desenvolvemos as expressões para determinar os expoentes críticos do sistema em relação a velocidade quadrática média, o número de colisões em função do tempo e a conexão com a termodinâmica através do teorema de equipartição de energia. Nesta dissertação apresentamos um forma alternativa de fazer a conexão com a termodinâmica através da lei de Fourier para a condução do calor, para bilhares bidimensionais e de determinar o número de colisões em função do tempo. / This work was motivated by a one-dimensional model called as bouncer. The model consists of a particle moving under the action of a gravitational field and experiences collisions with a periodic moving platform. We describe shortly its dynamical properties and move forward to a two-dimensional billiard problem of the oval-like shape. The objective of this dissertation is to study some statistical and thermodynamical properties of an oval-like shaped billiard whose boundary moves in time. Upon collision with the boundary, the particle has a fractional lose of energy produced by inelastic collisions. We then obtain equations that describe the dynamics at both sort and large time. By the use of equipartition theorem, we make a connection of the dynamical results with the thermodynamics approach. In this dissertation we present an alternative way of making the connection with thermodynamics via the Fourier’s law for heat conduction. / CNPq: 130351/2014-8

abstract: Internet and social media devices created a new public space for debate on political and social topics (Papacharissi 2002; Himelboim 2010). Hotly debated issues span all spheres of human activity; from liberal vs. conservative politics, to radical vs. counter-radical religious debate, to climate change debate in scientific community, to globalization debate in economics, and to nuclear disarmament debate in security. Many prominent ’camps’ have emerged within Internet debate rhetoric and practice (Dahlberg, n.d.). In this research I utilized feature extraction and model fitting techniques to process the rhetoric found in the web sites of 23 Indonesian Islamic religious organizations, later with 26 similar organizations from the United Kingdom to profile their ideology and activity patterns along a hypothesized radical/counter-radical scale, and presented an end-to-end system that is able to help researchers to visualize the data in an interactive fashion on a time line. The subject data of this study is the articles downloaded from the web sites of these organizations dating from 2001 to 2011, and in 2013. I developed algorithms to rank these organizations by assigning them to probable positions on the scale. I showed that the developed Rasch model fits the data using Andersen’s LR-test (likelihood ratio). I created a gold standard of the ranking of these organizations through an expertise elicitation tool. Then using my system I computed expert-to-expert agreements, and then presented experimental results comparing the performance of three baseline methods to show that the Rasch model not only outperforms the baseline methods, but it was also the only system that performs at expert-level accuracy. I developed an end-to-end system that receives list of organizations from experts, mines their web corpus, prepare discourse topic lists with expert support, and then ranks them on scales with partial expert interaction, and finally presents them on an easy to use web based analytic system. / Dissertation/Thesis / Doctoral Dissertation Computer Science 2016