Head load carriage is a common phenomenon in some parts of the world. This is prevalent across sub-Saharan Africa where women and children are used as pedestrian load-transporters. It has also been observed that during gymnasium and a few sporting activities, experienced gymnasts carry loads or other gymnasts by placing them their heads. The neck plays a major role in supporting the head in balance while generating the controlled head movements that are essential for balance in the head load carriage. Hence in this study, a biomechanical model of the controlled human head-head load carriage system is developed. The biomechanics model of the head loading problem in this study is a type of constrained mechanical three-dimensional, matrix coefficients, multibody systems which arise in many applications like robotics, vehicle and machinery dynamics. This governing equation was solved using Differential Transform Method (DTM) and was validated with the fourth order Runge-Kutta numerical method (RK4). Good agreements are reached between the two solutions. The effects of head mass, head load, neck mass were investigated. Other effects such as upper and lower linkage lengths were investigated in the study. As the head load increases, there were increases in both axial and angular displacement of the head and the neck motion.
The bane of optical network is multiuser interference as a result of codewords overlap from different nodes simultaneously transmitting. Transmission scheduling is a good interference avoidance scheme which helps prevent throughput degradation at high offered load in an optical code division multiple access local area network. Interference avoidance consists of state estimation and transmission scheduling. This work examines different scheduling algorithms and parameter variations. This work investigated the performance of three scheduling algorithms (Pure Selfish Scheduling, Threshold Scheduling and Overlap Section Scheduling) against the ALOHA CDMA and our novel Hybrid-Hybridized Overlap and Threshold Scheduling-HOT algorithms using the modified padded prime codeset. The performance of the scheduling algorithms are measured in terms of its normalized network throughput, packet error rate and the average number of codewords allow into the line against the normalized offered load. The analysis shows that under this condition, the Hybridized Overlap-Threshold scheduling perform best and has throughputs as high as the 52 % with nearly zero packet error rate while the nonscheduled algorithm produce a throughput as low as 10 % and very high error rate at maximum offered load. Overall, the Threshold Scheduling and HOT algorithm are head to head B 'Ladi Ogunwolu and performed best in terms of normalized network throughput, however the HOT scheduling is best in terms of the packet error rate. Analysis also shows that the throughput is not affected by changes in codeset length and the mean packet size but it is affected by changes in the codeset weight. The study also analyzes the performance of the network under a bimodal packet distribution and with the Prime code codeset family. Optical Orthogonal Codeset and the Prime codeset family are used in the study under the assumption of perfect state estimation; that all nodes have the same view of the network and the transmission lines and the distance between the nodes and the central star coupler is assumed to be zero. A novel hybrid Scheduling Algorithm, the HOT Scheduling which proved better than traditional Scheduling Algorithms is peddled here.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations鈥揷itations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright 漏 2024 scite LLC. All rights reserved.
Made with 馃挋 for researchers
Part of the Research Solutions Family.