As semiconductor technologies develop, a System-on-Chip (SoC) that integrates all semiconductor intellectual property (IP) cores is suggested and widely used for various applications. A traditional bus interconnection does not support transmitting data between IP cores for high performance. Because of this reason, a Network-on-Chip (NoC) has been suggested to provide an efficient and scalable solution to interconnect among all IP cores. High throughput and low latency have recently become the main important factors of NoC for achieving hard guaranteed real-time systems. In order to guarantee these factors and provide real-time service (i.e., Guaranteed Service, GS), the circuit switching (CS) approach has been widely utilized. The CS approach allocates mutually exclusive paths to transmitting data between different sources and destinations using dedicated NoC resources. However, the exclusive occupancy of the allocated path reduces the efficiency of the overall use of NoC resources. In order to solve this problem, Space-Division-Multiplexing (SDM) and Time-Division-Multiplexing (TDM) techniques have been suggested. SDM implements a circuit switching technique by assigning physically different NoC-links between different connections. Path connections of the SDM technique based on spatial resources assignment do not provide high scalability. In contrast to this, using virtual time slots for a path connection, the TDM technique can share physical links between exclusively established connections, thereby improving NoC path diversity. For all of these mentioned techniques, the factor that significantly impacts the system efficiency or performance scaling is how the path is allocated. In recent years, a dynamic connection allocation approach that can cope with highly dynamic workloads has been gaining attention due to the sudden and diverse demands of applications in real-time systems. There are two groups in the dynamic connection allocation approach. One is a distributed allocation technique, and the other is a centralized allocation technique. While distributed allocation exploits additional logic integrated into the NoC-routers for path search and allocation, the centralized approach makes use of a central unit to manage the path allocation problem. There are several algorithms for the centralized allocation technique. Trellis search-based allocation approach shows the best performance among them. Many algorithms related to centralized connection allocators have been studied extensively during the past decade. However, relatively little attention was paid to methodology in analyzing and evaluating the centralized connection allocation algorithms. In order to further develop the algorithms, it is necessary to understand and evaluate the centralized connection allocator by establishing a new analysis methodology. Thus, this thesis presents a performance analysis methodology for the trellis search-based allocation approach. Firstly, this thesis proposes a system model for analysis. Secondly, performance metrics are defined. Finally, the analysis results of each performance metric related to the trellis search-based allocation approach are presented. Through this analysis, the performance of the trellis search-based allocation approach can be accurately analyzed. Although a simulation is not performed, the upper limit of performance of the trellis search-based allocation approach can also be predicted through the analysis metrics. Additionally, we introduce the general formulation of the trellis search-based path allocation algorithm. The weight values among available paths through the branch metric and path metric are proposed to enable higher performance path connection. Furthermore, according to network size, topology, TDM, interface load delivery, and router internal storage, the performance of trellis search-based path allocation algorithms is also described. In the end, the Application Specific Instruction Processor (ASIP) hardware platform customized for the trellis search-based path allocation algorithm is presented. The shortest available and lowest-cost (SALC) path search algorithm is proposed to improve the success rate of path connection in the ASIP hardware platform. We evaluate the algorithm performance and implementation synthesis results. In order to realize the dynamic connection approach, a short execution cycle of ASIP time is essential. We develop several algorithms to achieve this short execution cycle. The first one is a rectangular region of search algorithm that allows adapting the size and form of path search region according to the particular source-destination positions and considers actual operational constraints. The average execution cycles for searching an optimum path are decreased because the unnecessary region for path-search is excluded. The second one is a path-spreading search algorithm that separates between involved routers and uninvolved routers in path search. The involved routers are selected and spread out from source to destination at each intermediate trellis-search process. The path-search overhead is considerably reduced due to the router involvements. The third one is a three-directional path-spreading search algorithm that eliminates one direction movement among four spreading movements. Because of this reason, the trellis search-based path connection algorithm, which omits the back-tracing process, can be implemented in the ASIP platform. Thus, the whole algorithm execution time can be halved. The last one is a moving regional path search algorithm that significantly reduces computation complexity by selecting a constant dimensional path-search region that affects performance and moving the region from source to destination. The moving regional path search algorithm achieves a considerable decrement of computational complexity.:1 Introduction 1 1.1 NoC-interconnect . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.2 Thesis outline . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 2 Connection allocation in a Network-on-Chip 7 2.1 Circuit Switching NoCs . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.1.1 Guaranteed Service in NoCs . . . . . . . . . . . . . . . . . . . 7 2.1.2 Spatial-Division-Multiplexing technique . . . . . . . . . . . . 8 2.1.3 Time-Division-Multiplexing technique . . . . . . . . . . . . . 10 2.2 System architectures employing circuit switching NoCs . . . . . . . . 11 2.2.1 Static and dynamic connection allocation . . . . . . . . . . . 12 2.2.2 Distributed connection allocation technique . . . . . . . . . . 14 2.2.3 Centralized connection allocation technique . . . . . . . . . . 16 2.2.4 Algorithms for centralized connection allocation . . . . . . . . 17 2.2.4.1 Software based run-time path allocation approach . 18 2.2.4.2 Trellis search-based allocation approach . . . . . . . 19 3 Performance analysis methodology for a centralized connection allocator 23 3.1 System model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23 3.2 Performance metrics and analysis methodology . . . . . . . . . . . . 25 3.3 System simulation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 4 Trellis search-based path allocation algorithm 45 4.1 General formulation . . . . . . . . . . . . . . . . . . . . . . . . . . . 45 4.1.1 Trellis graph structure . . . . . . . . . . . . . . . . . . . . . . 45 4.1.2 Survivor path selection criterion . . . . . . . . . . . . . . . . . 52 ix 4.1.2.1 Branch metric and path metric . . . . . . . . . . . . 52 4.1.2.2 The shortest-available and lowest-cost path selection criterion . . . . . . . . . . . . . . . . . . . . . . . . . 53 4.2 Algorithm Properties . . . . . . . . . . . . . . . . . . . . . . . . . . . 55 4.2.1 Network topology . . . . . . . . . . . . . . . . . . . . . . . . 55 4.2.2 Network size . . . . . . . . . . . . . . . . . . . . . . . . . . . 58 4.2.3 Time-Division-Multiplexing . . . . . . . . . . . . . . . . . . . 61 4.2.4 NoC interface load diversity . . . . . . . . . . . . . . . . . . . 63 4.2.5 The internal storage of the router . . . . . . . . . . . . . . . . 66 5 ASIP approach for Trellis search-based connection allocation 73 5.1 System model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 73 5.1.1 Trellis search-based ASIP platform architecture . . . . . . . . 74 5.2 Algorithm for improving success rates of path connection . . . . . . . 81 5.2.1 SALC algorithm for Trellis search-based ASIP platform . . . . 81 5.2.2 Performance evaluation of the SALC algorithm . . . . . . . . 88 5.2.2.1 Simulation results . . . . . . . . . . . . . . . . . . . 88 5.2.2.2 Synthesis results . . . . . . . . . . . . . . . . . . . . 91 5.3 Algorithm for reducing path-search time . . . . . . . . . . . . . . . . 93 5.3.1 Rectangular regional path search algorithm . . . . . . . . . . 93 5.3.2 Path-spreading search algorithm . . . . . . . . . . . . . . . . 99 5.3.3 Three directional path-spreading search algorithm . . . . . . 108 5.3.4 Moving regional path search algorithm . . . . . . . . . . . . . 114 5.3.5 Performance evaluation . . . . . . . . . . . . . . . . . . . . . 123 5.3.5.1 Simulation results . . . . . . . . . . . . . . . . . . . 123 5.3.5.2 Synthesis results . . . . . . . . . . . . . . . . . . . . 126 6 Conclusion and Future work 131 6.1 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 131 6.2 Future work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 132 Bibliography 135

Behavioral disruptions are highly prevalent, affecting almost all persons with dementia at some point during the course of their illness (McConnell, 2014). These behavioral disruptions in persons with dementia are commonly associated with decreased quality of life in the person exhibiting the symptoms as well as their caregivers (Fauth, Zarit, Hofer & Stephens, 2006). The purpose of this doctoral project was to design an intervention to promote socialization and engagement among people with dementia. A review of evidence-based interventions was conducted to identify effective non-pharmacological interventions to decrease behavioral disruptions in persons with dementia. The most promising interventions for reducing symptoms of behavioral disruptions in persons with dementia identified in the literature include music therapy, animal-assisted therapy, massage, activities-based interventions, behavioral management and combination therapies incorporating two or more of these interventions. Incorporating these effective interventions, a new program, Connections, was developed. The program includes a series of different daily interventions to be provided in a skilled nursing facility over the course of six weeks for residents with mild to moderate dementia. The Connections program is guided by a person-centered care philosophy and utilizes an evidence-based approach. Connections is designed to address the unmet psychological needs in people with dementia, such as fear or a sense of loss of control, lack of meaningful activities, loneliness and a lack of social interaction and decrease the behavioral disruptions.

Seven hundred thousand college undergraduates are members of men's and women's fraternities in the United States and Canada. Fraternal organizations, or fraternities and sororities, claim they exist to enrich students' lives and enhance the educational mission of universities. However, strong resistance exists within academic ranks to the existence and perpetuation of these organizations. This resistance calls for the study of the college fraternity to determine what, if any, roles the organizations play in the experiences and development of undergraduate students. This study examined and compared reported outcomes associated with the undergraduate college experiences of fraternity and sorority members versus students who are not members. Significant differences in student outcomes were analyzed in relation to three defined principles and objectives of student affairs practice: (1) student engagement; (2) the ability of students to develop coherent values and ethical standards; and (3) the connection of students to a supportive and inclusive community.

no / This paper is focused on the design of an adaptive Connection Admission Control (CAC) algorithm for a Universal Mobile Telecommunication System (UMTS) based satellite system with variable link capacity. The main feature of the proposed algorithm is to maximize the resource utilization by adapting to the link conditions and the antenna gain of the users. The link quality of the user may vary depending on the weather condition, user mobility and any other propagation factors. The algorithm is compared against a non-adaptive admission control algorithm under different test cases. The proposed CAC algorithm is simulated using MATLAB and the performance results are obtained for a mix of multimedia traffic classes such as video streaming, web browsing, netted voice and email. The simulation results indicate a higher system performance in terms of the blocking ratio and the number of admitted connections.

In this paper, using the general purpose software ABAQUS, a three dimensional (3-D) finite element model was built to simulate semi-rigid composite connection with precast hollowcore slabs. 3D continuum elements are used for all parts of the composite connections and the contact conditions between all the components are explicitly modelled. The model also incorporates nonlinear material characteristics and non-linear geometric behaviour. A simplified method to simulate the bolted end plate connection is introduced and validated. The proposed simulation method of the longitudinal shear transmission can accurately simulate the plastic state of the longitudinal rebars after cracking. Different materials are chosen by the authors to simulate the concrete slab, and the elastic¿plastic material property is adopted which can accurately simulate the moment¿rotation response of the connections. Numerical results are presented and compared with the experimental data and good agreement is obtained.

京都大学 / 新制・課程博士 / 博士(生命科学) / 甲第24304号 / 生博第487号 / 新制||生||65(附属図書館) / 京都大学大学院生命科学研究科高次生命科学専攻 / (主査)教授 渡邊 直樹, 教授 見学 美根子, 教授 今吉 格 / 学位規則第4条第1項該当 / Doctor of Philosophy in Life Sciences / Kyoto University / DFAM

N/A

This thesis focuses on how cultural connections in classroom influences students value of learning, specifically, their value of reading. Several researchers and theorists have emphasized the importance of balancing cognitive and conative aspects of childrens reading development. However, what is lacking in these studies is a focus on Pacific Islander (PI) children. The purpose of this study was to examine value of reading for diverse students who may be struggling in classrooms designed for White, middle-class students. Findings provide educators and those working with diverse students a chance to consider how connecting cultural backgrounds for all students can help in classrooms. This study was framed from a larger study on equity in teaching academic language conducted by the supervising professor, Dr. Bryant Jensen. This research study used a mixed method approach: multiple regression analysis to predict gains in PI students reading values, and interviews with classroom teachers. Fourth through sixth grade Latino and PI students in 32 classrooms participating in the quantitative study, and three teachers were interviewed. Due to the short time frame, PI students value of reading did not increase on average. Themes also emerged during interviews with the classroom teachers. I conclude with a discussion, implications, and recommendations for future research studies and educators working with PI and other diverse students.

No abstract is provided. / Thesis / Master of Engineering (MEngr) / Scope and contents: The aim of this thesis is to present a finite difference method, for analysing coupled shear walls with constant or variable cross-section, resting on rigid or elastic foundations and with elastic or inelastic connecting beams. It is also intended to compare the finite difference method with the continuous connection method, which can be developed using Rosman's approach or Newmark's concept for analysing composite beams or the energy approach, and with the finite element method. An analysis of coupled shear walls with multiple piers is presented.

The political connections of businesses bear implications for the economy. This dissertation studies the political connection of railways in the United Kingdom during the 19th century using several novel data sets. The first chapter of the dissertation begins by quantitatively investigating the implications of the political connections of railways for capital investment. Politically connected railways did significantly more capital investment than their non-connected counterparts. In addition, within-firm increases in political connections were associated with increased subsequent capital investment. The latter part of chapter one introduces the private bill process in the legislature as a likely channel relating political connections and capital investment. Politically connected firms proposed and passed considerably more legislation enabling capital investment than non-politically connected firms. Chapter two of the dissertation focuses on consumer and employee safety, relating safety to political connections and showing that politically connected railways were considerably deadlier than non-politically connected railways. A century of fatal railway accidents data is presented along with supplementary data sources to demonstrate this point. Chapter three of the dissertation looks at political connections as the outcome rather than as the explanatory variable. Political connections are related to voting rights in U.K. constituencies across five general elections spanning major franchise reforms. Within-constituency results show that for a given constituency increases in the franchise are associated with decreased likelihood that railway directors will run or win seats in the House of Commons.