Background:Patients with type 2 diabetes are at high risk for developing multiple chronic complications.However,there is a lack of studies of the cumulative number of diabetic complications in China.Methods:A retrospe...Background:Patients with type 2 diabetes are at high risk for developing multiple chronic complications.However,there is a lack of studies of the cumulative number of diabetic complications in China.Methods:A retrospective cohort study was performed from 2009 to 2021.Type 2 diabetes patients who were first diagnosed after the age of 35 years between January 1,2009,and December 31,2017,were included.Five states were defined according to the number of chronic complications:no(S0),one(S1),two(S2),three(S3),and four or more complications(S4).A multi-state Markov model was constructed to estimate transition probability,transition intensity,mean sojourn time,and the possible factors for each state.Results:The study included 32653 type 2 diabetes patients(mean age,59.59 years;15929(48.8%)male),and mean follow-up time of 7.75 years.In all,4375 transitions were observed.The 12-year transition probability of from state S0 to S1 was the lowest at 16.4%,while that from S2 to S3 was the highest,at 45.6%.Higher fasting blood glucose,lower high-density lipoprotein cholesterol,higher total cholesterol,and an unhealthy diet were associated with higher risk of progression from S0 to S1.Being female,less than 60 years old,weekly physical activity,and vegetarian diet decreased this risk.Being female and less than 60 years old reduced the likelihood of transition from S1 to S2,whereas lower high-density lipoprotein cholesterol increased this likelihood.Conclusions:Following the occurrence of two complications in type 2 diabetes patients,the risk for accumulating a third complication within a short time is significantly increased.It is important to take advantage of the stable window period when patients have fewer than two complications,strengthen the monitoring of blood glucose and blood lipids,and encourage patients to maintain good living habits to prevent further deterioration.展开更多
This paper analyzes a queue mode] of the polling system with limited service (K=1) in discrete time. By the imbedded Markov chain theory and the probability generating function method, the mean values of queue length ...This paper analyzes a queue mode] of the polling system with limited service (K=1) in discrete time. By the imbedded Markov chain theory and the probability generating function method, the mean values of queue length and message waiting time are explicitly obtained. Also, we give the simulation results. The results obtained by H. Tagai (1985) are revised.展开更多
We present a discrete time single-server two-level mixed service polling systems with two queue types, one center queue and N normal queues. Two-level means the center queue will be successive served after each normal...We present a discrete time single-server two-level mixed service polling systems with two queue types, one center queue and N normal queues. Two-level means the center queue will be successive served after each normal queue. In the first level, server visits between the center queue and the normal queue. In the second level, normal queues are polled by a cyclic order. Mixed service means the service discipline are exhaustive for center queue, and parallel 1-limited for normal queues. We propose an imbedded Markov chain framework to drive the closed-form expressions for the mean cycle time, mean queue length, and mean waiting time. Numerical examples demonstrate that theoretical and simulation results are identical the new system efficiently differentiates priorities.展开更多
In Wireless Sensor Networks(WSNs),polling can obviously improve the throughput and decrease average access delay by allocating bandwidth efficiently and reasonably.In this paper,a Dynamic Polling Media Access Control ...In Wireless Sensor Networks(WSNs),polling can obviously improve the throughput and decrease average access delay by allocating bandwidth efficiently and reasonably.In this paper,a Dynamic Polling Media Access Control (DPMAC) scheme designed according to WSNs' features is proposed.DPMAC is a priority based access control protocol with the characteristics that its polling table is dynamically refreshed depending on whether the sensor node is active and that the bandwidth is dynamically allocated according to the traffic types.The access priorities are determined by the emergency levels of events and the scheduler proposed in our MAC is preemptive based on the deadline of the events.Simulation results show that DPMAC can efficiently utilize bandwidth and decrease average access delay and response time for emergency events with different access priorities in WSNs.展开更多
There has been a significant interest of researchers to combine different schemes focused on optimizing energy performance while developing aMAC protocol for Wireless Sensor Networks(WSNs).In this paper,we propose to ...There has been a significant interest of researchers to combine different schemes focused on optimizing energy performance while developing aMAC protocol for Wireless Sensor Networks(WSNs).In this paper,we propose to integrate two cross-layer schemes:dynamic channel polling and packet concatenation using a recent asynchronous MAC protocol“Adaptive&Dynamic Polling MAC”(ADPMAC).ADP-MAC dynamically selects the polling interval distribution based on characterization of incoming traffic patterns using Coefficient of variation(CV).Packet Concatenation(PC)refers to combining the individually generated data packets into a single super packet and sending it at the polling instant.Also,the Block Acknowledgement(BA)scheme has been developed for ADP-MAC to work in conjunction with the packet concatenation.The proposed schemes have been implemented in Tiny-OS for Mica2 platform and Avrora emulator has been used for conducting experiments.Simulation results have revealed that the performance both in terms of energy&packet loss improves when ADP-MAC is used in conjunction with the additional features of PC&BA.Furthermore,the proposed scheme has been compared with a stateof-art packet concatenation primitive PiP(Packet-in-Packet).It has been observed that ADP-MAC supersedes the performance of PiP in terms of PDR(Packet Delivery Ratio)due to better management of synchronization between source and sink.展开更多
Wireless networking in cyber-physical systems(CPSs) is characteristically different from traditional wireless systems due to the harsh radio frequency environment and applications that impose high real-time and reliab...Wireless networking in cyber-physical systems(CPSs) is characteristically different from traditional wireless systems due to the harsh radio frequency environment and applications that impose high real-time and reliability constraints.One of the fundamental considerations for enabling CPS networks is the medium access control protocol. To this end, this paper proposes a novel priority-aware frequency domain polling medium access control(MAC) protocol, which takes advantage of an orthogonal frequency-division multiple access(OFDMA)physical layer to achieve instantaneous priority-aware polling.Based on the polling result, the proposed work then optimizes the resource allocation of the OFDMA network to further improve the data reliability. Due to the non-polynomial-complete nature of the OFDMA resource allocation, we propose two heuristic rules,based on which an efficient solution algorithm to the OFDMA resource allocation problem is designed. Simulation results show that the reliability performance of CPS networks is significantly improved because of this work.展开更多
A solution is imperatively expected to meet the efficient contention resolution schemes for managing simultaneous access requests to the communication resources on the Network on Chip (NoC). Based on the ideas of conf...A solution is imperatively expected to meet the efficient contention resolution schemes for managing simultaneous access requests to the communication resources on the Network on Chip (NoC). Based on the ideas of conflict-free transmission, priority-based service, and dynamic self-adaptation to loading, this paper presents a novel scheduling algorithm for Medium Access Control (MAC) in NoC with the researches of the communication structure features of 2D mesh. The algorithm gives priority to guarantee the Quality of Service (QoS) for local input port as well as dynamic adjustment of the performance of the other ports along with input load change. The theoretical model of this algorithm is established with Markov chain and probability generating function. Mathematical analysis is made on the mean queue length and the mean inquiry cyclic time of the system. Simulated experiments are conducted to test the accuracy of the model. It turns out that the findings from theoretical analysis correspond well with those from simulated experiments. Further more, the analytical findings of the system performance demonstrate that the algorithm enables effectively strengthen the fairness and stability of data transmissions in NoC.展开更多
Interrupt-driven systems can be collapsed due to frequent NIC interrupts under heavy network traffic. To mitigate this problem, a high-performance communication mechanism SBIM based on real-time OS RTLinux is designed...Interrupt-driven systems can be collapsed due to frequent NIC interrupts under heavy network traffic. To mitigate this problem, a high-performance communication mechanism SBIM based on real-time OS RTLinux is designed and implemented. A new concept of semi-polling is presented. With state-based semi-polling mechanism and lightweight buffering algorithm, interrupt frequency is reduced and the performance for short packet is significantly ameliorated. The experimental results indicate that the throughputs of SBIM for 64byte and 1500byte packets are 394Mbps and 895Mbps in Gigabit Ethernet environments, which show that the performance of SBIM surpasses that of other mechanisms.展开更多
A novel mixed polling system with multiple stations is considered. Each station produces two classes of messages served with different disciplines. The real time message served with exhaustive service discipline and t...A novel mixed polling system with multiple stations is considered. Each station produces two classes of messages served with different disciplines. The real time message served with exhaustive service discipline and the unreal time message served with gated service discipline. Using an iterative method, the exact mean waiting times for both message classes are derived. The influence of the gate location of the message class served by the gated service discipline on the mean waiting time is also analyzed. The analytical results are verified with simulation method and agree well with simulation results.展开更多
Recently, applications of real-time polling service (rtPS) in IEEE 802.16 wireless networks have gained considerable popularity. These applications generate large amounts of real time traffic in the network and thus m...Recently, applications of real-time polling service (rtPS) in IEEE 802.16 wireless networks have gained considerable popularity. These applications generate large amounts of real time traffic in the network and thus maintaining the quality of service (QoS) such as packet delay requirement in rtPS dominant networks is critical. Existing dimensioning methodology does not consider QoS parameters of rtPS in network dimensioning. Moreover, exhaustive and time-consuming simulations are required to evaluate the performance and QoS of rtPS. To overcome this problem, we propose an improved radio network dimensioning framework which considers QoS parameters of rtPS in network dimensioning. In this framework, an analytical model is developed to evaluate the capacity and performance of rtPS in IEEE 802.16 wireless networks. The proposed framework provides a fast and accurate means of finding the trade-off between system load and packet delay, thus providing network operators with an analytical tool that jointly considers coverage, capacity and QoS requirements for obtaining the minimum number of sites required. The accuracy of the proposed model is validated through simulations.展开更多
Tribological tests play an important role on the evaluation of long-term bio-tribological performances of prosthetic materials for commercial fabrication.Those tests focus on the motion simulation of a real joint in v...Tribological tests play an important role on the evaluation of long-term bio-tribological performances of prosthetic materials for commercial fabrication.Those tests focus on the motion simulation of a real joint in vitro with only normal loads and constant velocities,which are far from the real friction behavior of human joints characterized with variable loads and multiple directions.In order to accurately obtain the bio-tribological performances of artificial joint materials,a tribological tester with a miniature four-station tribological system is proposed with four distinctive features.Firstly,comparability and repeatability of a test are ensured by four equal stations of the tester.Secondly,cross-linked scratch between tribo-pairs of human joints can be simulated by using a gear-rack meshing mechanism to produce composite motions.With this mechanism,the friction tracks can be designed by varying reciprocating and rotating speeds.Thirdly,variable loading system is realized by using a ball-screw mechanism driven by a stepper motor,by which loads under different gaits during walking are simulated.Fourthly,dynamic friction force and normal load can be measured simultaneously.The verifications of the performances of the developed tester show that the variable frictional tracks can produce different wear debris compared with one-directional tracks,and the accuracy of loading and friction force is within ?5%.Thus the high consistency among different stations can be obtained.Practically,the proposed tester system could provide more comprehensive and accurate bio-tribological evaluations for prosthetic materials.展开更多
Resilient network infrastructure is pivotal for business entities that are growing reliance on the Internet.Distributed Denial-of-Service(DDOS)is a common network threat that collectively overwhelms and exhausts netwo...Resilient network infrastructure is pivotal for business entities that are growing reliance on the Internet.Distributed Denial-of-Service(DDOS)is a common network threat that collectively overwhelms and exhausts network resources using coordinated botnets to interrupt access to network services,devices,and resources.IDS is typically deployed to detect DDOS based on Snort rules.Although being fairly accurate,IDS operates on a computeintensive packet inspection technique and lacks rapidDDOSdetection.Meanwhile,SNMP is a comparably lightweight countermeasure for fast detection.However,this SNMP trigger is often circumvented if the DDOS burst rate is coordinated to flood the network smaller than theSNMPpolling rate.Besides,SNMP does not scale well if the poll rate is set extremely fine for improved detection accuracy.In this paper,a lightweight 3D SNMP scaling method is proposed to optimize the SNMP poll rate forDDOSmitigation automatically.The 3D-SNMP uses horizontal scaling to dynamically adjust the optimal poll rate through random packet inspection that is selective.Suppose a sign of DDOS is detected,3D-SNMP scales down the poll rate for finer detection.As DDOS subsides,3D-SNMP scales the poll rate up for faster DDOS detection.The equilibrium between scalability and accuracy is determined on the fly depending on the types of DDOS variants.3D-SNMP also adds a vertical scaling to detect non-salient DDOS that falls below the detection threshold.The experimental results showed that 3D-SNMP achieved DDOS detection of 92%while remaining scalable to different DDOS variants and volumes.展开更多
Nowadays, the Multi-Shuttle and Multi-Station Transportation System (MMTS)<span><span><span style="font-family:;" "=""> is one of the most interesting research topics in many...Nowadays, the Multi-Shuttle and Multi-Station Transportation System (MMTS)<span><span><span style="font-family:;" "=""> is one of the most interesting research topics in many fields of industries. It is an effective solution to reduce unexpected accidents that occur during transportation as well as increase productivity in manufacturing. The aim of this paper is to introduce the controller design for the MMTS which is built in our BK-Recme BioMech Lab at Ho Chi Minh City University of Technology (VNU-HCM), Viet Nam. Based on the design of this system, the control algorithms will be conducted to check the operation of the whole system. To evaluate the feasibility and effectiveness of this model, we design a series of random instances for different quantities of nodes as well as the different quantities of shuttles. Our system includes 4 stations and 6 shuttles which are assembled in the serial chain system. However, the number of stations and number of shuttles can be expanded to any desired ones which are based on the requirement of the industries. In this paper, we mainly focus on the controller design of this system to make it operate in an effective way that the goods will be transported and delivered to the target station as fast as possible. In order to solve the large</span></span></span><span><span><span style="font-family:;" "="">-</span></span></span><span><span><span style="font-family:;" "="">scale instances and realistic transport prob<span>lems, we propose three algorithms for three progresses as shuttles calling</span>, path reading and shuttles communicating. The shuttles calling is to decide which <span>shuttle should be called to the star</span></span></span></span><span><span><span style="font-family:;" "="">t</span></span></span><span><span><span style="font-family:;" "="">-node. Path reading to determine the shortest</span></span></span><span><span><span style="font-family:;" "=""> <span>way to go from start-node to end-node. Finally, shuttles communicating,</span> which allow one shuttle to interact with the next shuttles so we have a loop of orders (shuttle 1 to shuttle 2;shuttle 2 to shuttle 3;etc</span></span></span><span><span><span style="font-family:;" "="">.</span></span></span><span><span><span style="font-family:;" "="">;shuttle n-1 to shuttle n). This proposes solution can help us to solve the huge numbers of shuttles <span>and stations in the system. The specific result of this study is applying</span> Dijkstra’s algorithm to propose an algorithm that allows handling a transportation system without caring about the number of shuttles as well as the number of stations for the closed-loop path. Several test problems are carried out in order to check the feasibility and the effectiveness of our purposed control algorithm.</span></span></span>展开更多
Survival data with amulti-state structure are frequently observed in follow-up studies.An analytic approach based on a multi-state model(MSM)should be used in longitudinal health studies in which a patient experiences...Survival data with amulti-state structure are frequently observed in follow-up studies.An analytic approach based on a multi-state model(MSM)should be used in longitudinal health studies in which a patient experiences a sequence of clinical progression events.One main objective in the MSM framework is variable selection,where attempts are made to identify the risk factors associated with the transition hazard rates or probabilities of disease progression.The usual variable selection methods,including stepwise and penalized methods,do not provide information about the importance of variables.In this context,we present a two-step algorithm to evaluate the importance of variables formulti-state data.Three differentmachine learning approaches(randomforest,gradient boosting,and neural network)as themost widely usedmethods are considered to estimate the variable importance in order to identify the factors affecting disease progression and rank these factors according to their importance.The performance of our proposed methods is validated by simulation and applied to the COVID-19 data set.The results revealed that the proposed two-stage method has promising performance for estimating variable importance.展开更多
基金supported by the National Natural Science Foundation of China(grant No.72074011)the Real World Study Project of Hainan Boao Lecheng Pilot Zone(Real World Study Base of NMPA)(HNLC2022RWS012)+1 种基金the fundamental research funds for central public welfare research institutes(2023CZ-11)National Natural Science Foundation of China(No.82003536).
文摘Background:Patients with type 2 diabetes are at high risk for developing multiple chronic complications.However,there is a lack of studies of the cumulative number of diabetic complications in China.Methods:A retrospective cohort study was performed from 2009 to 2021.Type 2 diabetes patients who were first diagnosed after the age of 35 years between January 1,2009,and December 31,2017,were included.Five states were defined according to the number of chronic complications:no(S0),one(S1),two(S2),three(S3),and four or more complications(S4).A multi-state Markov model was constructed to estimate transition probability,transition intensity,mean sojourn time,and the possible factors for each state.Results:The study included 32653 type 2 diabetes patients(mean age,59.59 years;15929(48.8%)male),and mean follow-up time of 7.75 years.In all,4375 transitions were observed.The 12-year transition probability of from state S0 to S1 was the lowest at 16.4%,while that from S2 to S3 was the highest,at 45.6%.Higher fasting blood glucose,lower high-density lipoprotein cholesterol,higher total cholesterol,and an unhealthy diet were associated with higher risk of progression from S0 to S1.Being female,less than 60 years old,weekly physical activity,and vegetarian diet decreased this risk.Being female and less than 60 years old reduced the likelihood of transition from S1 to S2,whereas lower high-density lipoprotein cholesterol increased this likelihood.Conclusions:Following the occurrence of two complications in type 2 diabetes patients,the risk for accumulating a third complication within a short time is significantly increased.It is important to take advantage of the stable window period when patients have fewer than two complications,strengthen the monitoring of blood glucose and blood lipids,and encourage patients to maintain good living habits to prevent further deterioration.
文摘This paper analyzes a queue mode] of the polling system with limited service (K=1) in discrete time. By the imbedded Markov chain theory and the probability generating function method, the mean values of queue length and message waiting time are explicitly obtained. Also, we give the simulation results. The results obtained by H. Tagai (1985) are revised.
基金Supported by the National Natural Science Foundation of China (No. 61072079)Science Foundation of Yunnan Provincial Department (No. 2011Y117)
文摘We present a discrete time single-server two-level mixed service polling systems with two queue types, one center queue and N normal queues. Two-level means the center queue will be successive served after each normal queue. In the first level, server visits between the center queue and the normal queue. In the second level, normal queues are polled by a cyclic order. Mixed service means the service discipline are exhaustive for center queue, and parallel 1-limited for normal queues. We propose an imbedded Markov chain framework to drive the closed-form expressions for the mean cycle time, mean queue length, and mean waiting time. Numerical examples demonstrate that theoretical and simulation results are identical the new system efficiently differentiates priorities.
基金supported by the National Natural Science Foundation of China under Grants No.61172068,61003300the Key Program of NSFC Guangdong Union Foundation under Grant No.U0835004+2 种基金the National Grand Fundamental Research 973 Program of China under Grant No.A001200907the Fundamental Research Funds for the Central Universities under Grant No.K50511010003Program for New Century Excellent Talents in University under Grant No.NCET-11-0691
文摘In Wireless Sensor Networks(WSNs),polling can obviously improve the throughput and decrease average access delay by allocating bandwidth efficiently and reasonably.In this paper,a Dynamic Polling Media Access Control (DPMAC) scheme designed according to WSNs' features is proposed.DPMAC is a priority based access control protocol with the characteristics that its polling table is dynamically refreshed depending on whether the sensor node is active and that the bandwidth is dynamically allocated according to the traffic types.The access priorities are determined by the emergency levels of events and the scheduler proposed in our MAC is preemptive based on the deadline of the events.Simulation results show that DPMAC can efficiently utilize bandwidth and decrease average access delay and response time for emergency events with different access priorities in WSNs.
文摘There has been a significant interest of researchers to combine different schemes focused on optimizing energy performance while developing aMAC protocol for Wireless Sensor Networks(WSNs).In this paper,we propose to integrate two cross-layer schemes:dynamic channel polling and packet concatenation using a recent asynchronous MAC protocol“Adaptive&Dynamic Polling MAC”(ADPMAC).ADP-MAC dynamically selects the polling interval distribution based on characterization of incoming traffic patterns using Coefficient of variation(CV).Packet Concatenation(PC)refers to combining the individually generated data packets into a single super packet and sending it at the polling instant.Also,the Block Acknowledgement(BA)scheme has been developed for ADP-MAC to work in conjunction with the packet concatenation.The proposed schemes have been implemented in Tiny-OS for Mica2 platform and Avrora emulator has been used for conducting experiments.Simulation results have revealed that the performance both in terms of energy&packet loss improves when ADP-MAC is used in conjunction with the additional features of PC&BA.Furthermore,the proposed scheme has been compared with a stateof-art packet concatenation primitive PiP(Packet-in-Packet).It has been observed that ADP-MAC supersedes the performance of PiP in terms of PDR(Packet Delivery Ratio)due to better management of synchronization between source and sink.
基金supported by National Natural Science Foundation of China(61304263,61233007)the Cross-disciplinary Collaborative Teams Program for Science,Technology and Innovation of Chinese Academy of Sciences-Network and System Technologies for Security Monitoring and Information Interaction in Smart Arid
文摘Wireless networking in cyber-physical systems(CPSs) is characteristically different from traditional wireless systems due to the harsh radio frequency environment and applications that impose high real-time and reliability constraints.One of the fundamental considerations for enabling CPS networks is the medium access control protocol. To this end, this paper proposes a novel priority-aware frequency domain polling medium access control(MAC) protocol, which takes advantage of an orthogonal frequency-division multiple access(OFDMA)physical layer to achieve instantaneous priority-aware polling.Based on the polling result, the proposed work then optimizes the resource allocation of the OFDMA network to further improve the data reliability. Due to the non-polynomial-complete nature of the OFDMA resource allocation, we propose two heuristic rules,based on which an efficient solution algorithm to the OFDMA resource allocation problem is designed. Simulation results show that the reliability performance of CPS networks is significantly improved because of this work.
基金Supported by the National Natural Science Foundation of China(No.61072079)
文摘A solution is imperatively expected to meet the efficient contention resolution schemes for managing simultaneous access requests to the communication resources on the Network on Chip (NoC). Based on the ideas of conflict-free transmission, priority-based service, and dynamic self-adaptation to loading, this paper presents a novel scheduling algorithm for Medium Access Control (MAC) in NoC with the researches of the communication structure features of 2D mesh. The algorithm gives priority to guarantee the Quality of Service (QoS) for local input port as well as dynamic adjustment of the performance of the other ports along with input load change. The theoretical model of this algorithm is established with Markov chain and probability generating function. Mathematical analysis is made on the mean queue length and the mean inquiry cyclic time of the system. Simulated experiments are conducted to test the accuracy of the model. It turns out that the findings from theoretical analysis correspond well with those from simulated experiments. Further more, the analytical findings of the system performance demonstrate that the algorithm enables effectively strengthen the fairness and stability of data transmissions in NoC.
文摘Interrupt-driven systems can be collapsed due to frequent NIC interrupts under heavy network traffic. To mitigate this problem, a high-performance communication mechanism SBIM based on real-time OS RTLinux is designed and implemented. A new concept of semi-polling is presented. With state-based semi-polling mechanism and lightweight buffering algorithm, interrupt frequency is reduced and the performance for short packet is significantly ameliorated. The experimental results indicate that the throughputs of SBIM for 64byte and 1500byte packets are 394Mbps and 895Mbps in Gigabit Ethernet environments, which show that the performance of SBIM surpasses that of other mechanisms.
基金Sponsored by the National Natural Science Foundation of China (No .60474031) the National"863"Program Project (2002AA412010-08)
文摘A novel mixed polling system with multiple stations is considered. Each station produces two classes of messages served with different disciplines. The real time message served with exhaustive service discipline and the unreal time message served with gated service discipline. Using an iterative method, the exact mean waiting times for both message classes are derived. The influence of the gate location of the message class served by the gated service discipline on the mean waiting time is also analyzed. The analytical results are verified with simulation method and agree well with simulation results.
文摘Recently, applications of real-time polling service (rtPS) in IEEE 802.16 wireless networks have gained considerable popularity. These applications generate large amounts of real time traffic in the network and thus maintaining the quality of service (QoS) such as packet delay requirement in rtPS dominant networks is critical. Existing dimensioning methodology does not consider QoS parameters of rtPS in network dimensioning. Moreover, exhaustive and time-consuming simulations are required to evaluate the performance and QoS of rtPS. To overcome this problem, we propose an improved radio network dimensioning framework which considers QoS parameters of rtPS in network dimensioning. In this framework, an analytical model is developed to evaluate the capacity and performance of rtPS in IEEE 802.16 wireless networks. The proposed framework provides a fast and accurate means of finding the trade-off between system load and packet delay, thus providing network operators with an analytical tool that jointly considers coverage, capacity and QoS requirements for obtaining the minimum number of sites required. The accuracy of the proposed model is validated through simulations.
基金Supported by Funding of State Key Laboratory of Mechanical Transmissions,Chongqing University,China(Grant No.SKLMT-KFKT-201504)National Natural Science Foundation of China(Grant No.51275381)Science and Technology Planning Project of Shaanxi Province,China(Grant No.2012GY2-37)
文摘Tribological tests play an important role on the evaluation of long-term bio-tribological performances of prosthetic materials for commercial fabrication.Those tests focus on the motion simulation of a real joint in vitro with only normal loads and constant velocities,which are far from the real friction behavior of human joints characterized with variable loads and multiple directions.In order to accurately obtain the bio-tribological performances of artificial joint materials,a tribological tester with a miniature four-station tribological system is proposed with four distinctive features.Firstly,comparability and repeatability of a test are ensured by four equal stations of the tester.Secondly,cross-linked scratch between tribo-pairs of human joints can be simulated by using a gear-rack meshing mechanism to produce composite motions.With this mechanism,the friction tracks can be designed by varying reciprocating and rotating speeds.Thirdly,variable loading system is realized by using a ball-screw mechanism driven by a stepper motor,by which loads under different gaits during walking are simulated.Fourthly,dynamic friction force and normal load can be measured simultaneously.The verifications of the performances of the developed tester show that the variable frictional tracks can produce different wear debris compared with one-directional tracks,and the accuracy of loading and friction force is within ?5%.Thus the high consistency among different stations can be obtained.Practically,the proposed tester system could provide more comprehensive and accurate bio-tribological evaluations for prosthetic materials.
文摘Resilient network infrastructure is pivotal for business entities that are growing reliance on the Internet.Distributed Denial-of-Service(DDOS)is a common network threat that collectively overwhelms and exhausts network resources using coordinated botnets to interrupt access to network services,devices,and resources.IDS is typically deployed to detect DDOS based on Snort rules.Although being fairly accurate,IDS operates on a computeintensive packet inspection technique and lacks rapidDDOSdetection.Meanwhile,SNMP is a comparably lightweight countermeasure for fast detection.However,this SNMP trigger is often circumvented if the DDOS burst rate is coordinated to flood the network smaller than theSNMPpolling rate.Besides,SNMP does not scale well if the poll rate is set extremely fine for improved detection accuracy.In this paper,a lightweight 3D SNMP scaling method is proposed to optimize the SNMP poll rate forDDOSmitigation automatically.The 3D-SNMP uses horizontal scaling to dynamically adjust the optimal poll rate through random packet inspection that is selective.Suppose a sign of DDOS is detected,3D-SNMP scales down the poll rate for finer detection.As DDOS subsides,3D-SNMP scales the poll rate up for faster DDOS detection.The equilibrium between scalability and accuracy is determined on the fly depending on the types of DDOS variants.3D-SNMP also adds a vertical scaling to detect non-salient DDOS that falls below the detection threshold.The experimental results showed that 3D-SNMP achieved DDOS detection of 92%while remaining scalable to different DDOS variants and volumes.
文摘Nowadays, the Multi-Shuttle and Multi-Station Transportation System (MMTS)<span><span><span style="font-family:;" "=""> is one of the most interesting research topics in many fields of industries. It is an effective solution to reduce unexpected accidents that occur during transportation as well as increase productivity in manufacturing. The aim of this paper is to introduce the controller design for the MMTS which is built in our BK-Recme BioMech Lab at Ho Chi Minh City University of Technology (VNU-HCM), Viet Nam. Based on the design of this system, the control algorithms will be conducted to check the operation of the whole system. To evaluate the feasibility and effectiveness of this model, we design a series of random instances for different quantities of nodes as well as the different quantities of shuttles. Our system includes 4 stations and 6 shuttles which are assembled in the serial chain system. However, the number of stations and number of shuttles can be expanded to any desired ones which are based on the requirement of the industries. In this paper, we mainly focus on the controller design of this system to make it operate in an effective way that the goods will be transported and delivered to the target station as fast as possible. In order to solve the large</span></span></span><span><span><span style="font-family:;" "="">-</span></span></span><span><span><span style="font-family:;" "="">scale instances and realistic transport prob<span>lems, we propose three algorithms for three progresses as shuttles calling</span>, path reading and shuttles communicating. The shuttles calling is to decide which <span>shuttle should be called to the star</span></span></span></span><span><span><span style="font-family:;" "="">t</span></span></span><span><span><span style="font-family:;" "="">-node. Path reading to determine the shortest</span></span></span><span><span><span style="font-family:;" "=""> <span>way to go from start-node to end-node. Finally, shuttles communicating,</span> which allow one shuttle to interact with the next shuttles so we have a loop of orders (shuttle 1 to shuttle 2;shuttle 2 to shuttle 3;etc</span></span></span><span><span><span style="font-family:;" "="">.</span></span></span><span><span><span style="font-family:;" "="">;shuttle n-1 to shuttle n). This proposes solution can help us to solve the huge numbers of shuttles <span>and stations in the system. The specific result of this study is applying</span> Dijkstra’s algorithm to propose an algorithm that allows handling a transportation system without caring about the number of shuttles as well as the number of stations for the closed-loop path. Several test problems are carried out in order to check the feasibility and the effectiveness of our purposed control algorithm.</span></span></span>
文摘Survival data with amulti-state structure are frequently observed in follow-up studies.An analytic approach based on a multi-state model(MSM)should be used in longitudinal health studies in which a patient experiences a sequence of clinical progression events.One main objective in the MSM framework is variable selection,where attempts are made to identify the risk factors associated with the transition hazard rates or probabilities of disease progression.The usual variable selection methods,including stepwise and penalized methods,do not provide information about the importance of variables.In this context,we present a two-step algorithm to evaluate the importance of variables formulti-state data.Three differentmachine learning approaches(randomforest,gradient boosting,and neural network)as themost widely usedmethods are considered to estimate the variable importance in order to identify the factors affecting disease progression and rank these factors according to their importance.The performance of our proposed methods is validated by simulation and applied to the COVID-19 data set.The results revealed that the proposed two-stage method has promising performance for estimating variable importance.