The presence of circles in the network maximum flow problem increases the complexity of the preflow algorithm.This study proposes a novel two-stage preflow algorithm to address this issue.First,this study proves that ...The presence of circles in the network maximum flow problem increases the complexity of the preflow algorithm.This study proposes a novel two-stage preflow algorithm to address this issue.First,this study proves that at least one zero-flow arc must be present when the flow of the network reaches its maximum value.This result indicates that the maximum flow of the network will remain constant if a zero-flow arc within a circle is removed;therefore,the maximum flow of each network without circles can be calculated.The first stage involves identifying the zero-flow arc in the circle when the network flow reaches its maximum.The second stage aims to remove the zero-flow arc identified and modified in the first stage,thereby producing a new network without circles.The maximum flow of the original looped network can be obtained by solving the maximum flow of the newly generated acyclic network.Finally,an example is provided to demonstrate the validity and feasibility of this algorithm.This algorithm not only improves computational efficiency but also provides new perspectives and tools for solving similar network optimization problems.展开更多
This paper investigates the maximum network through- put for resource-constrained space networks based on the delay and disruption-tolerant networking （DTN） architecture. Specifically, this paper proposes a methodol...This paper investigates the maximum network through- put for resource-constrained space networks based on the delay and disruption-tolerant networking （DTN） architecture. Specifically, this paper proposes a methodology for calculating the maximum network throughput of multiple transmission tasks under storage and delay constraints over a space network. A mixed-integer linear programming （MILP） is formulated to solve this problem. Simula- tions results show that the proposed methodology can successfully calculate the optimal throughput of a space network under storage and delay constraints, as well as a clear, monotonic relationship between end-to-end delay and the maximum network throughput under storage constraints. At the same time, the optimization re- sults shine light on the routing and transport protocol design in space communication, which can be used to obtain the optimal network throughput.展开更多
Maximum Flow Problem (MFP) discusses the maximum amount of flow that can be sent from the source to sink. Edmonds-Karp algorithm is the modified version of Ford-Fulkerson algorithm to solve the MFP. This paper present...Maximum Flow Problem (MFP) discusses the maximum amount of flow that can be sent from the source to sink. Edmonds-Karp algorithm is the modified version of Ford-Fulkerson algorithm to solve the MFP. This paper presents some modifications of Edmonds-Karp algorithm for solving MFP. Solution of MFP has also been illustrated by using the proposed algorithm to justify the usefulness of proposed method.展开更多
Summary:Changes of maximum expiratory flow at 25%and 50%of vital capacity(MEF2s and MEFso,respectively),and predominant parameters indicating small airways function in asthmatics before and after bronchodilator(BD)rev...Summary:Changes of maximum expiratory flow at 25%and 50%of vital capacity(MEF2s and MEFso,respectively),and predominant parameters indicating small airways function in asthmatics before and after bronchodilator(BD)reversibility test have been less interpreted.Our study aimed to investigate the clinical role of changes of MEF2s and MEFso before and after BD reversibility test in diagnosing asthma.Forced expiratory volume in the first second(FEV),MEF2s,and MEFso were measured before and after BD reversibility test in 207 asthmatic patients using standard process.Forty healthy individuals were enrolled as controls.Receiver operating characteristic(ROC)curve was used to assess the diagnostic accuracy of reversibility of MEF2s and MEFgo before and after BD reversibility test(OMEF 2s%and AMEF so%,respectively)in diagnosing asthma.Among these functional criteria,AMEF2;%and 0MEFs%≥25%performed the best diagnostic performance.The sensitivity,specificity,and accuracy of AMEF 25%≥25%as an objcctive diagnostic test for asthma were 63.29%,87.50%,and 67.21%,and of AMEFs0%≥25%were 79.23%,85.00%,and 80.16%,respectively.The area under the ROC curve of the indicators was 0.8203 and 0.9104,respectively.By contrast,an increase in FEV≥12%and 200 mL demonstrated a sensitivity of 62.32%,specificity of 82.50%,and accuracy of 65.59%in diagnosing asthma.The changes of MEF2s and MEFso before and after BD reversibility test may be of additional value in the clinical diagnosis of asthma,with cutoff values of 25%being the most.展开更多
Calculating the most reliable maximum flow(MRMF)from the edge cache node to the requesting node can provide an important reference for selecting the best edge cache node in a content delivery network(CDN).However,SDBA...Calculating the most reliable maximum flow(MRMF)from the edge cache node to the requesting node can provide an important reference for selecting the best edge cache node in a content delivery network(CDN).However,SDBA,as the current state-of-the-art MRMF algorithm,is too complex to meet real-time computing needs.This paper proposes a set of MRMF algorithms:NWCD(Negative Weight Community Deletion),SCPDAT(Single-Cycle Preference Deletion Approximation algorithm with Time constraint)and SCPDAP(Single-Cycle Preference Deletion Approximation algorithm with Probability constraint).NWCD draws on the“flow-shifting”algorithm of minimum cost and maximum flow,and further defines the concept of negative weight community.This algorithm continuously deletes the negative weight communities,which can increase reliability while keeping the flow constant in the residual graph.It is proven that when all negative weight communities are deleted,the corresponding maximum flow is the MRMF.SCPDAT tries to approach the optimal solution to the greatest extent possible within the limited time,while SCPDAP tries to reach the probability threshold in the shortest amount of time.Both of these adopt the strategy of first deleting single-cycle communities(which contribute more to the reliability with lower time cost).Experiments show that,compared with SDBA,NWCD combined with the probabilistic pruning achieves an order of magnitude improvement in time cost,while SCPDAT and SCPDAP demonstrate better time performance and increased applicability.展开更多
This work presents the hydrologic estimations of the hydraulic underground arched culvert channel (UACC) in Sabinal Basin, Chiapas, México and the hydrological problems associated with it, such as the erosion phe...This work presents the hydrologic estimations of the hydraulic underground arched culvert channel (UACC) in Sabinal Basin, Chiapas, México and the hydrological problems associated with it, such as the erosion phenomenon and abrasion cavity formation in it. On the other hand, the maximum flows that the UACC could transport were analyzed, concluding that it no longer has the hydraulic capacity to transport the flow rate associated to return periods equal to or greater than five years and that maximum permissible velocity UACC’s bottom is 3 m/s.展开更多
Many zeotropic refrigerant mixtures are proposed as alternatives to some chlorofluorocar-bons (CFCs) and hydrochlorofluorocarbons ( HCFCs). An advantage of zeotropic mixtures is the possibility of reduction in entropy...Many zeotropic refrigerant mixtures are proposed as alternatives to some chlorofluorocar-bons (CFCs) and hydrochlorofluorocarbons ( HCFCs). An advantage of zeotropic mixtures is the possibility of reduction in entropy generation by matching the temperature glidings of refrigerant and heat-transfer fluid in both condenser and evaporator. Zeotropic mixtures are compared with pure re-frigerants to evaluate their exergetic losses. On the other hand, the special phenomena which result from temperature gliding are proved by experiments. A simple equation is obtained, to evaluate dif-ferent zeotropic mixtures' exergetic losses. The maximum flow rate of heat-transfer fluids is found in order that refrigerants phase change can be completed. Lastly, some examples of zeotropic mix-tures ( R407C, R405A and R414B) are given, and their exergetic losses and maximum flow rate of heat-transfer fluids in condenser are forecasted.展开更多
The effect of the rare earths on the high temperature properties of deformed leaded-brasses has been stu- died with the high temperature tensile test.The results show that the rare earth additives can increase elongat...The effect of the rare earths on the high temperature properties of deformed leaded-brasses has been stu- died with the high temperature tensile test.The results show that the rare earth additives can increase elongation of alloys at high temperature,but they had little effect on the maximum flow stress.With the help of SEM. X-ray diffraction instrument,quantitative metallography analysis instrument,etc.,the effect of the rare earth elements on the mierostrueture of alloys has also been examined.展开更多
ransport network in the paper is defined as follows: (1) Connected and directed network without self loop;(2) There is only one source vertex with zero in degree; (3) There is only one sink vertex with zero out de...ransport network in the paper is defined as follows: (1) Connected and directed network without self loop;(2) There is only one source vertex with zero in degree; (3) There is only one sink vertex with zero out degree;(4) The capacity of every arc is non negative integer Blocking flow is a kind of flow commonly happened in a transport network . Its formation is due to the existance of a blocking cutset in the network. In this paper the fundamental concepts and theorems of the blocking flow and the blocking cutset are introduced and a linear programming model for determining the blocking cutset in a network is set up. In order to solve the problem by graph theoretical approach a method called 'two way flow augmenting algorithm' is developed. With this method an iterative procedure of forward and backward flow augmenting process is used to determine whether a given cutset is a blocking one.展开更多
The minimum cost of capacity expansion for time-limited transportation problem on-demand (MCCETLTPD) is to find such a practicable capacity expansion transportation scheme satisfying the time-limited T along with all ...The minimum cost of capacity expansion for time-limited transportation problem on-demand (MCCETLTPD) is to find such a practicable capacity expansion transportation scheme satisfying the time-limited T along with all origins’ supply and all destinations’ demands as well as the expanding cost is minimum. Actually, MCCETLTPD is a balance transportation problem and a variant problem of minimum cost maximum flow problem. In this paper, by creating a mathematical model and constructing a network with lower and upper arc capacities, MCCETLTPD is transformed into searching feasible flow in the constructed network, and consequently, an algorithm MCCETLTPD-A is developed as MCCETLTPD’s solution method basing minimum cost maximum flow algorithm. Computational study validates that the MCCETLTPD-A algorithm is an efficient approach to solving the MCCETLTPD.展开更多
The analysis of the risk of flooding upstream from the Imboulou hydroelectric dam on the Léfini River in the Republic of Congo-Brazzaville, focused on the evolution of annual rainfall and flow in the study area d...The analysis of the risk of flooding upstream from the Imboulou hydroelectric dam on the Léfini River in the Republic of Congo-Brazzaville, focused on the evolution of annual rainfall and flow in the study area during the period from 1970 to 2020 before and after the building of the dam in 2005, by applying statistical methods. These methods were used to analyse the spatial and temporal evolution of rainfall and flow at the unique hydrometric station located at the RN2 (National Road N°2) bridge in the village of Mbouambé in the Pool region. This work has shown that rainfall is not the cause of flooding in the Léfini catchment area. The monthly flow coefficient (MFC) showed exceptional flooding from November and December onwards after the dam was built, resulting in a variability of flows, with periods of high and low water. In addition, the annual average flow (AAF) and the maximum average flow (MAF) increased after the dam was built. Maximum average flows (MAF) were higher than annual average flows (AAF) throughout the period of study (1970-2020). The annual and monthly rainfall-runoff relationship showed changes after the dam was built, particularly from 2009 and during the months of November and December. .展开更多
Objective: to observe the clinical therapeutic effect of "salbutamol and phenergan" in the implementation of "children with cough variant asthma" through clinical experiments. Methods: 100 children...Objective: to observe the clinical therapeutic effect of "salbutamol and phenergan" in the implementation of "children with cough variant asthma" through clinical experiments. Methods: 100 children with cough variant asthma admitted from June 2019 to May 2020 were selected as the object of this study combined with the clinical research subjects of children with cough variant asthma, and were simultaneously divided into the control group and the observation group, and the actual records of the observation and textual research of the disease conditions of the related 100 children were well recorded. Among them, the control group mainly adopts the conventional treatment management measures, while the observation group adopts the clinical treatment implementation plan of "salbutamol and phenergan" to further analyze the optimization effect of the two groups of children in clinical treatment. Results: from the change after treatment, the maximum expiratory flow rate in the observation group was (87.8 ± 4.1) L/min;The change of high expiratory flow rate in the control group was (84.0 ± 4.2) L/min, and the comparison between the two groups was statistically significant (P < 0.05). To sum up, the clinical observation of the actual situation of the treatment of the two groups of patients, of which the maximum group's total effective rate of 94% was significantly higher than the control group of 84%;At the same time, the incidence of treatment after three months was observed, among which the incidence of observation of the other side was 96%(48/50)/ that of the control group was 84%(42/50). There were statistically significant differences between the two groups in the comparison of clinical treatment effect and incidence, P < 0.05. Conclusion: The treatment scheme of salbutamol and phenergan is beneficial to the disease control of children with cough variant asthma, which not only improves the therapeutic effect, but also can prevent the recurrence of the disease, and is worthy of further promotion and application.展开更多
Deep space networks,satellite networks,ad hoc networks,and the Internet can be modeled as DTNs(Delay Tolerant Networks).As a fundamental problem,the maximum flow problem is of vital importance for routing and service ...Deep space networks,satellite networks,ad hoc networks,and the Internet can be modeled as DTNs(Delay Tolerant Networks).As a fundamental problem,the maximum flow problem is of vital importance for routing and service scheduling in networks.However,there exists no permanent end-to-end path since the topology and the characteristics of links are time-variant,resulting in a crucial maximum flow problem in DTNs.In this paper,we focus on the single-source-single-sink maximum flow problem of buffer-limited DTNs,followed by a valid algorithm to solve it.First,the BTAG(Buffer-limited Time Aggregated Graph)is constructed for modeling the buffer-limited DTN.Then,on the basis of BTAG,the two-way cache transfer series and the relevant transfer rules are designed,and thus a BTAG-based maximum flow algorithm is proposed to solve the maximum flow problem in buffer-limited DTNs.Finally,a numerical example is given to demonstrate the effectiveness of the proposed algorithm.展开更多
The idea of the inverse optimization problem is to adjust the values of the parameters so that the observed feasible solutions are indeed optimal.The modification cost is measured by different norms,such asl1,l2,l∞no...The idea of the inverse optimization problem is to adjust the values of the parameters so that the observed feasible solutions are indeed optimal.The modification cost is measured by different norms,such asl1,l2,l∞norms and the Hamming distance,and the goal is to adjust the parameters as little as possible.In this paper,we consider the inverse maximum flow problem under the combination of the weighted l2 norm and the weighted Hamming distance,i.e.,the modification cost is fixed in a given interval and depends on the modification out of the given interval.We present a combinatorial algorithm which can be finished in O(nm)to solve it due to the minimum cut of the residual network.展开更多
基金The National Natural Science Foundation of China(No.72001107,72271120)the Fundamental Research Funds for the Central Universities(No.NS2024047,NP2024106)the China Postdoctoral Science Foundation(No.2020T130297,2019M660119).
文摘The presence of circles in the network maximum flow problem increases the complexity of the preflow algorithm.This study proposes a novel two-stage preflow algorithm to address this issue.First,this study proves that at least one zero-flow arc must be present when the flow of the network reaches its maximum value.This result indicates that the maximum flow of the network will remain constant if a zero-flow arc within a circle is removed;therefore,the maximum flow of each network without circles can be calculated.The first stage involves identifying the zero-flow arc in the circle when the network flow reaches its maximum.The second stage aims to remove the zero-flow arc identified and modified in the first stage,thereby producing a new network without circles.The maximum flow of the original looped network can be obtained by solving the maximum flow of the newly generated acyclic network.Finally,an example is provided to demonstrate the validity and feasibility of this algorithm.This algorithm not only improves computational efficiency but also provides new perspectives and tools for solving similar network optimization problems.
基金supported by the National Natural Sciences Foundation of China(6113200261321061+3 种基金6123101161201183)the National Basic Research Program of China(2014CB340206)the Tsinghua University Initiative Scientific Research Program(2011Z05117)
文摘This paper investigates the maximum network through- put for resource-constrained space networks based on the delay and disruption-tolerant networking （DTN） architecture. Specifically, this paper proposes a methodology for calculating the maximum network throughput of multiple transmission tasks under storage and delay constraints over a space network. A mixed-integer linear programming （MILP） is formulated to solve this problem. Simula- tions results show that the proposed methodology can successfully calculate the optimal throughput of a space network under storage and delay constraints, as well as a clear, monotonic relationship between end-to-end delay and the maximum network throughput under storage constraints. At the same time, the optimization re- sults shine light on the routing and transport protocol design in space communication, which can be used to obtain the optimal network throughput.
文摘Maximum Flow Problem (MFP) discusses the maximum amount of flow that can be sent from the source to sink. Edmonds-Karp algorithm is the modified version of Ford-Fulkerson algorithm to solve the MFP. This paper presents some modifications of Edmonds-Karp algorithm for solving MFP. Solution of MFP has also been illustrated by using the proposed algorithm to justify the usefulness of proposed method.
基金This project was supported by the National Natural Science Foundation of China(No.81970024)partly by Scientific Research Project of Wuhan Health Committee(No.WX16C45).
文摘Summary:Changes of maximum expiratory flow at 25%and 50%of vital capacity(MEF2s and MEFso,respectively),and predominant parameters indicating small airways function in asthmatics before and after bronchodilator(BD)reversibility test have been less interpreted.Our study aimed to investigate the clinical role of changes of MEF2s and MEFso before and after BD reversibility test in diagnosing asthma.Forced expiratory volume in the first second(FEV),MEF2s,and MEFso were measured before and after BD reversibility test in 207 asthmatic patients using standard process.Forty healthy individuals were enrolled as controls.Receiver operating characteristic(ROC)curve was used to assess the diagnostic accuracy of reversibility of MEF2s and MEFgo before and after BD reversibility test(OMEF 2s%and AMEF so%,respectively)in diagnosing asthma.Among these functional criteria,AMEF2;%and 0MEFs%≥25%performed the best diagnostic performance.The sensitivity,specificity,and accuracy of AMEF 25%≥25%as an objcctive diagnostic test for asthma were 63.29%,87.50%,and 67.21%,and of AMEFs0%≥25%were 79.23%,85.00%,and 80.16%,respectively.The area under the ROC curve of the indicators was 0.8203 and 0.9104,respectively.By contrast,an increase in FEV≥12%and 200 mL demonstrated a sensitivity of 62.32%,specificity of 82.50%,and accuracy of 65.59%in diagnosing asthma.The changes of MEF2s and MEFso before and after BD reversibility test may be of additional value in the clinical diagnosis of asthma,with cutoff values of 25%being the most.
基金partly supported by Open Research Fund from State Key Laboratory of Smart Grid Protection and Control,China(Zhang B,www.byqsc.net/com/nrjt/),Rapid Support Project(61406190120,Zhang B)the Fundamental Research Funds for the Central Universities(2242021k10011,Zhang B,www.seu.edu.cn)the National Key R&D Program of China(2018YFC0830200,Zhang B,www.most.gov.cn).
文摘Calculating the most reliable maximum flow(MRMF)from the edge cache node to the requesting node can provide an important reference for selecting the best edge cache node in a content delivery network(CDN).However,SDBA,as the current state-of-the-art MRMF algorithm,is too complex to meet real-time computing needs.This paper proposes a set of MRMF algorithms:NWCD(Negative Weight Community Deletion),SCPDAT(Single-Cycle Preference Deletion Approximation algorithm with Time constraint)and SCPDAP(Single-Cycle Preference Deletion Approximation algorithm with Probability constraint).NWCD draws on the“flow-shifting”algorithm of minimum cost and maximum flow,and further defines the concept of negative weight community.This algorithm continuously deletes the negative weight communities,which can increase reliability while keeping the flow constant in the residual graph.It is proven that when all negative weight communities are deleted,the corresponding maximum flow is the MRMF.SCPDAT tries to approach the optimal solution to the greatest extent possible within the limited time,while SCPDAP tries to reach the probability threshold in the shortest amount of time.Both of these adopt the strategy of first deleting single-cycle communities(which contribute more to the reliability with lower time cost).Experiments show that,compared with SDBA,NWCD combined with the probabilistic pruning achieves an order of magnitude improvement in time cost,while SCPDAT and SCPDAP demonstrate better time performance and increased applicability.
文摘This work presents the hydrologic estimations of the hydraulic underground arched culvert channel (UACC) in Sabinal Basin, Chiapas, México and the hydrological problems associated with it, such as the erosion phenomenon and abrasion cavity formation in it. On the other hand, the maximum flows that the UACC could transport were analyzed, concluding that it no longer has the hydraulic capacity to transport the flow rate associated to return periods equal to or greater than five years and that maximum permissible velocity UACC’s bottom is 3 m/s.
基金Supported by National Natural Science Foundation of China( No. 50476062) .
文摘Many zeotropic refrigerant mixtures are proposed as alternatives to some chlorofluorocar-bons (CFCs) and hydrochlorofluorocarbons ( HCFCs). An advantage of zeotropic mixtures is the possibility of reduction in entropy generation by matching the temperature glidings of refrigerant and heat-transfer fluid in both condenser and evaporator. Zeotropic mixtures are compared with pure re-frigerants to evaluate their exergetic losses. On the other hand, the special phenomena which result from temperature gliding are proved by experiments. A simple equation is obtained, to evaluate dif-ferent zeotropic mixtures' exergetic losses. The maximum flow rate of heat-transfer fluids is found in order that refrigerants phase change can be completed. Lastly, some examples of zeotropic mix-tures ( R407C, R405A and R414B) are given, and their exergetic losses and maximum flow rate of heat-transfer fluids in condenser are forecasted.
文摘The effect of the rare earths on the high temperature properties of deformed leaded-brasses has been stu- died with the high temperature tensile test.The results show that the rare earth additives can increase elongation of alloys at high temperature,but they had little effect on the maximum flow stress.With the help of SEM. X-ray diffraction instrument,quantitative metallography analysis instrument,etc.,the effect of the rare earth elements on the mierostrueture of alloys has also been examined.
文摘ransport network in the paper is defined as follows: (1) Connected and directed network without self loop;(2) There is only one source vertex with zero in degree; (3) There is only one sink vertex with zero out degree;(4) The capacity of every arc is non negative integer Blocking flow is a kind of flow commonly happened in a transport network . Its formation is due to the existance of a blocking cutset in the network. In this paper the fundamental concepts and theorems of the blocking flow and the blocking cutset are introduced and a linear programming model for determining the blocking cutset in a network is set up. In order to solve the problem by graph theoretical approach a method called 'two way flow augmenting algorithm' is developed. With this method an iterative procedure of forward and backward flow augmenting process is used to determine whether a given cutset is a blocking one.
文摘The minimum cost of capacity expansion for time-limited transportation problem on-demand (MCCETLTPD) is to find such a practicable capacity expansion transportation scheme satisfying the time-limited T along with all origins’ supply and all destinations’ demands as well as the expanding cost is minimum. Actually, MCCETLTPD is a balance transportation problem and a variant problem of minimum cost maximum flow problem. In this paper, by creating a mathematical model and constructing a network with lower and upper arc capacities, MCCETLTPD is transformed into searching feasible flow in the constructed network, and consequently, an algorithm MCCETLTPD-A is developed as MCCETLTPD’s solution method basing minimum cost maximum flow algorithm. Computational study validates that the MCCETLTPD-A algorithm is an efficient approach to solving the MCCETLTPD.
文摘The analysis of the risk of flooding upstream from the Imboulou hydroelectric dam on the Léfini River in the Republic of Congo-Brazzaville, focused on the evolution of annual rainfall and flow in the study area during the period from 1970 to 2020 before and after the building of the dam in 2005, by applying statistical methods. These methods were used to analyse the spatial and temporal evolution of rainfall and flow at the unique hydrometric station located at the RN2 (National Road N°2) bridge in the village of Mbouambé in the Pool region. This work has shown that rainfall is not the cause of flooding in the Léfini catchment area. The monthly flow coefficient (MFC) showed exceptional flooding from November and December onwards after the dam was built, resulting in a variability of flows, with periods of high and low water. In addition, the annual average flow (AAF) and the maximum average flow (MAF) increased after the dam was built. Maximum average flows (MAF) were higher than annual average flows (AAF) throughout the period of study (1970-2020). The annual and monthly rainfall-runoff relationship showed changes after the dam was built, particularly from 2009 and during the months of November and December. .
文摘Objective: to observe the clinical therapeutic effect of "salbutamol and phenergan" in the implementation of "children with cough variant asthma" through clinical experiments. Methods: 100 children with cough variant asthma admitted from June 2019 to May 2020 were selected as the object of this study combined with the clinical research subjects of children with cough variant asthma, and were simultaneously divided into the control group and the observation group, and the actual records of the observation and textual research of the disease conditions of the related 100 children were well recorded. Among them, the control group mainly adopts the conventional treatment management measures, while the observation group adopts the clinical treatment implementation plan of "salbutamol and phenergan" to further analyze the optimization effect of the two groups of children in clinical treatment. Results: from the change after treatment, the maximum expiratory flow rate in the observation group was (87.8 ± 4.1) L/min;The change of high expiratory flow rate in the control group was (84.0 ± 4.2) L/min, and the comparison between the two groups was statistically significant (P < 0.05). To sum up, the clinical observation of the actual situation of the treatment of the two groups of patients, of which the maximum group's total effective rate of 94% was significantly higher than the control group of 84%;At the same time, the incidence of treatment after three months was observed, among which the incidence of observation of the other side was 96%(48/50)/ that of the control group was 84%(42/50). There were statistically significant differences between the two groups in the comparison of clinical treatment effect and incidence, P < 0.05. Conclusion: The treatment scheme of salbutamol and phenergan is beneficial to the disease control of children with cough variant asthma, which not only improves the therapeutic effect, but also can prevent the recurrence of the disease, and is worthy of further promotion and application.
基金supported by the National Science Foundation(Nos.91338115,61231008)National S&T Major Project(No.2015ZX03002006)+2 种基金the Fundamental Research Funds for the Central Universities(Nos.WRYB142208,JB140117)Shanghai Aerospace Science and Technology Innovation Fund(No.201454)the 111 Project(No.B08038).
文摘Deep space networks,satellite networks,ad hoc networks,and the Internet can be modeled as DTNs(Delay Tolerant Networks).As a fundamental problem,the maximum flow problem is of vital importance for routing and service scheduling in networks.However,there exists no permanent end-to-end path since the topology and the characteristics of links are time-variant,resulting in a crucial maximum flow problem in DTNs.In this paper,we focus on the single-source-single-sink maximum flow problem of buffer-limited DTNs,followed by a valid algorithm to solve it.First,the BTAG(Buffer-limited Time Aggregated Graph)is constructed for modeling the buffer-limited DTN.Then,on the basis of BTAG,the two-way cache transfer series and the relevant transfer rules are designed,and thus a BTAG-based maximum flow algorithm is proposed to solve the maximum flow problem in buffer-limited DTNs.Finally,a numerical example is given to demonstrate the effectiveness of the proposed algorithm.
基金This research is supported by the Fundamental Research Funds for the Central Universities(No.20720190068)the China Scholarship Council(No.201706315073).
文摘The idea of the inverse optimization problem is to adjust the values of the parameters so that the observed feasible solutions are indeed optimal.The modification cost is measured by different norms,such asl1,l2,l∞norms and the Hamming distance,and the goal is to adjust the parameters as little as possible.In this paper,we consider the inverse maximum flow problem under the combination of the weighted l2 norm and the weighted Hamming distance,i.e.,the modification cost is fixed in a given interval and depends on the modification out of the given interval.We present a combinatorial algorithm which can be finished in O(nm)to solve it due to the minimum cut of the residual network.
