Cluster headache is a primary headache disorder that can be highly disabling. In this thesis we look at the treatment landscape of cluster headache with a scoping review of preventive and acute therapies for cluster headache as identified in randomized controlled trials and two-arm observational studies. We subsequently compare these therapies where data are available using network meta-analysis of randomized trials, and we attempt subgroup analyses again where data are available for acute treatments of episodic and chronic cluster. We identify the ranking of treatments for acute cluster headache, and certain acute therapies that may be beneficial in episodic and chronic cluster headache. Based on our findings, we also identify future directions for cluster headache trials.

One of the impacts of the rising demand for community health services, primarily used by seniors, is that hospitals are often faced with the challenge of having patients finish the acute phase of their treatment and yet are unable to discharge them due to the lack of a bed in a more appropriate community care setting. The frequency of this challenge has led to the designation of “alternative level of care” (ALC) being ascribed to patients who remain in the hospitals due to insufficient capacity downstream. The thesis focuses on a model that seeks to address patient flow through the community care network (CCN) and finding capacity allocation policies for the different facilities that resolves the ALC challenge using scenario analysis. A queuing network model with general routings and nodes’ blocking has been developed and a heuristic approximation method has been employed for solving the model. Blocking probabilities and the number of blocked patients are derived as performance metrics of the CCN. We test the accuracy of the queuing model through a simulation model and the behaviours of the system in different scenarios are investigated in the simulation model and our policy insights and conclusions are provided.

Spiking neural networks (SNNs) are a more biologically realistic model of the brain than traditional analog neural networks and therefore should be better for modelling certain functions of the human brain. This thesis uses the concept of deriving an SNN from an accepted non-spiking neural network via analysis and modifications of the transmission function. We investigate this process to determine if and how the modifications can be made to minimize loss of information during the transition from non-spiking to spiking while retaining positive features and functionality of the non-spiking network. By comparing combinations of spiking neuron models and networks against each other, we determined that replacing the transmission function with a neural model that is similar to it allows for the easiest method to create a spiking neural network that works comparatively well. This similarity between transmission function and neuron model allows for easier parameter selection which is a key component in getting a functioning SNN. The parameters all play different roles, but for the most part, parameters that speed up spiking, such as large resistance values or small rheobases generally help the accuracy of the network. But the network is still incomplete for a spiking neural network since this conversion is often only performed after learning has been completed in analog form. The neuron model and subsequent network developed here are the initial steps in creating a bidirectional SNN that handles hetero-associative and auto-associative recall and can be switched easily between spiking and non-spiking with minimal to no loss of data. By tying everything to the transmission function, the non-spiking learning rule, which in our case uses the transmission function, and the neural model of the SNN, we are able to create a functioning SNN. Without this similarity, we find that creating SNN are much more complicated and require much more work in parameter optimization to achieve a functioning SNN.

The next-generation (6G) networks promise to provide extended 5G capabilities with enhanced performance at high data rates, low latency, low energy consumption, and rapid adaptation. 6G networks are also expected to support the unprecedented Internet of Everything (IoE) scenarios with highly diverse requirements. With the emerging applications of autonomous driving, virtual reality, and mobile computing, achieving better performance and fulfilling the diverse requirements of 6G networks are becoming increasingly difficult due to the rapid proliferation of wireless data and heterogeneous network structures. In this regard, learning-based algorithms are naturally powerful tools to deal with the numerous data and are expected to impact the evolution of communication networks. This thesis employed learning-based approaches to enhance the performance and fulfill the diverse requirements of the next-generation intelligent networks under various network structures. Specifically, we design the trajectory of the unmanned aerial vehicle (UAV) to provide energy-efficient, high data rate, and fair service for the Internet of things (IoT) networks by employing on/off-policy reinforcement learning (RL). Thereafter, we applied a deep RL-based approach for heterogeneous traffic offloading in the space-air-ground integrated network (SAGIN) to cover the co-existing requirements of ultra-reliable low-latency communication (URLLC) traffic and enhanced mobile broadband (eMBB) traffic. Precise traffic prediction can significantly improve the performance of 6G networks in terms of intelligent network operations, such as predictive network configuration control, traffic offloading, and communication resource allocation. Therefore, we investigate the wireless traffic prediction problem in edge networks by applying a federated meta-learning approach. Lastly, we design an importance-oriented clustering-based high quality of service (QoS) system with software-defined networking (SDN) by adopting unsupervised learning.

A Thesis Submitted to the Faculty of Indiana University by Nikeshbhai Patel in Partial Fulfillment of the Requirements for the Degree of Master of Science, August 2005 / Medical health partners use heterogeneous data formats, legacy software and strictly licensed vocabularies which make it hard to integrate their data and work. Integration of services and data are the two main necessities. The current architecture used provides partial solution by providing one-to-one mapping wrappers. This thesis provides discussion on difficulties encountered by the coexistence of so many medical vocabularies and efforts to provide interoperation. Also other problems are listed which hinders the interoperation between health partners. Solution is proposed for some of these problems by forming semantic network based on multi-agent technology. Service composition and integration stages are shown to develop future advance health services. Middle layer is implemented which performs integration and provides common platform for sharing information, using global ontology and local domain ontology. Inferencebased matchmaking algorithm proposed in this thesis helps in mapping and achieving our goal. Six different filtering techniques are selected and used in matchmaking algorithm. Analysis of these filtering techniques is provided to understand the integration process. In the ending section an abstract idea is proposed on basis of network architecture and matchmaking algorithm to develop Open Terminological System.

Submitted to the faculty of the informatics Graduate Program in partial fulfillment of the requirements for the degree Master of Science in Bioinformatics in the School of Informatics, Indiana University, May 2006 / The publication of the draft human genome consisting of 30,000 genes is merely the beginning of genome biology. A new way to understand the complexity and richness of molecular and cellular function of proteins in biological processes is through understanding of biological networks. These networks include protein-protein interaction networks, gene regulatory networks, and metabolic networks. In this thesis, we focus on human protein-protein interaction networks using informatics techniques. First, we performed a thorough literature survey to document different experimental methods to detect and collect protein interactions, current public databases that store these interactions, computational software to predict, validate and interpret protein networks. Then, we developed the Human Annotated Protein-Protein Interaction (HAPPI) database to manage a wealth of integrated information related to protein functions, protein-protein functional links, and protein-protein interactions. Approximately 12900 proteins from Swissprot, 57900 proteins from Trembl, 52186 protein-domains from Swisspfam, 4084 gene-pathways from KEGG, 2403190 interactions from STRING and 51207 interactions from OPHID public databases were integrated into a single relational database platform using Oracle 10g on an IU Supercomputing grid. We further assigned a confidence score to each protein interaction pair to help assess the quality and reliability of protein-protein interaction. We hosted the database on the Discovery Informatics and Computing web site, which is now publicly accessible. HAPPI database differs from other protein interaction databases in these following aspects: 1) It focuses on human protein interactions and contains approximately 860000 high-confidence protein interaction records—one of the most complete and reliable sources of human protein interaction today; 2) It includes thorough protein domain, gene and pathway information of interacting proteins, therefore providing a whole view of protein functional information; 3) It contains a consistent ranking score that can be used to gauge the confidence of protein interactions. To show the benefits of HAPPI database, we performed a case study using Insulin Signaling pathway in collaboration with a biology team on campus. We began by taking two sets of proteins that were previously well studied as separate processes, set A and set B. We queried these proteins against the HAPPI database, and derived high-confidence protein interaction data sets annotated with known KEGG pathways. We then organized these protein interactions on a network diagram. The end result shows many novel hub proteins that connect set A or B proteins. Some hub proteins are even novel members outside of any annotated pathway, making them interesting targets to validate for subsequent biological studies.

Indiana University-Purdue University Indianapolis (IUPUI) / Location Allocation, rooted in Operations Research and Mathematical programming, allows real world problems to be solved using optimization (based on mathematics and science) and equity principles (based on ethics). Finding nearest facilities for everyone simultaneously is a task solved by numerical and algebraic solutions. Bikeshare as a public good requires equitable allocation of bikeshare resources. Distance, as an impediment, can be minimized using location allocation algorithms. Since location allocation of this kind involves large numbers, sophisticated algorithms are needed to solve them due to their combinatorically explosive nature (i.e. as ‘n’ rises, solution time rises at least exponentially – sometimes called ‘Non Polynomial Time-Hard’ problems). Every day, researchers are working to improve such algorithms, since faster and better solutions can improve such algorithms and in turn help improve our daily lives.

No description available.

Bayesian networks have been applied to many different domains to perform prognostics, reduce risk and ultimately improve decision making. However, these methods have not been applied to military field and human performance data sets in an industrial environment. Methods frequently rely on a clear understanding of causal connections leading to an undesirable event and detailed understanding of the system behavior. Methods may also require large amount of analyst teams and domain experts, coupled with manual data cleansing and classification. The research performed utilized machine learning algorithms (such as Bayesian networks) and two existing data sets. The primary objective of the research was to develop a diagnostic and prognostic tool utilizing Bayesian networks that does not require the need for detailed causal understanding of the underlying system. The research yielded a predictive method with substantial benefits over reactive methods. The research indicated Bayesian networks can be trained and utilized to predict failure of several important components to include potential malfunction codes and downtime on a real-world Navy data set. The research also considered potential error within the training data set. The results provided credence to utilization of Bayesian networks in real field data – which will always contain error that is not easily quantified. Research should be replicated with additional field data sets from other aircraft. Future research should be conducted to solicit and incorporate domain expertise into subsequent models. Research should also consider incorporation of text based analytics for text fields, which was considered out of scope for this research project.

No description available.