In this paper, we propose two novel efficient scheduling schemes with network coding in multi-relay wireless network to maximize the transmission efficiency. The first one uses adaptive forwarding with network coding(...In this paper, we propose two novel efficient scheduling schemes with network coding in multi-relay wireless network to maximize the transmission efficiency. The first one uses adaptive forwarding with network coding(AF-NC), in which each relay adaptively calculates the number of packets having innovative information according to the feedback from the sink. With AF-NC, duplicate packets are not sent, and the total number of time slots needed to complete transmission can be significantly reduced. The second scheme, named adaptive forwarding with network coding and retransmission(AFR-NC), combines AF-NC with automatic repeat request(ARQ) to guarantee reliable end-to-end communication with limited resource occupation. Numerical results show that compared with simple forwarding with network coding(F-NC), AF-NC has close successful delivery rate with dramatically less time slots, while AFR-NC achieves strict reliability with limited resource cost.展开更多
Synchronization rhythm and oscillating in biological systems can give clues to understanding the cooperation and competition between cells under appropriate biological and physical conditions. As a result, the network...Synchronization rhythm and oscillating in biological systems can give clues to understanding the cooperation and competition between cells under appropriate biological and physical conditions. As a result, the network setting is appreciated to detect the stability and transition of collective behaviors in a network with different connection types. In this paper, the synchronization performance in time-delayed excitable homogeneous random networks（EHRNs） induced by diversity in system parameters is investigated by calculating the synchronization parameter and plotting the spatiotemporal evolution pattern, and distinct impacts induced by parameter-diversity are detected by setting different time delays. It is found that diversity has no distinct effect on the synchronization performance in EHRNs with small time delay being considered. When time delay is increased greatly, the synchronization performance of EHRN degenerates remarkably as diversity is increased. Surprisingly, by setting a moderate time delay, appropriate parameter-diversity can promote the synchronization performance in EHRNs, and can induce the synchronization transition from the asynchronous state to the weak synchronization. Moreover, the bistability phenomenon, which contains the states of asynchronous state and weak synchronization,is observed. Particularly, it is confirmed that the parameter-diversity promoted synchronization performance in time-delayed EHRN is manifested in the enhancement of the synchronization performance of individual oscillation and the increase of the number of synchronization transitions from the asynchronous state to the weak synchronization. Finally, we have revealed that this kind of parameter-diversity promoted synchronization performance is a robust phenomenon.展开更多
We propose a weighted model to explain the self-organizing formation of scale-free phenomenon in nongrowth random networks. In this model, we use multiple-edges to represent the connections between vertices and define...We propose a weighted model to explain the self-organizing formation of scale-free phenomenon in nongrowth random networks. In this model, we use multiple-edges to represent the connections between vertices and define the weight of a multiple-edge as the total weights of all single-edges within it and the strength of a vertex as the sum of weights for those multiple-edges attached to it. The network evolves according to a vertex strength preferential selection mechanism. During the evolution process, the network always holds its totM number of vertices and its total number of single-edges constantly. We show analytically and numerically that a network will form steady scale-free distributions with our model. The results show that a weighted non-growth random network can evolve into scMe-free state. It is interesting that the network also obtains the character of an exponential edge weight distribution. Namely, coexistence of scale-free distribution and exponential distribution emerges.展开更多
A simplified Olami-Feder-Christensen model on a random network has been studied. We propose a new toppling rule -- when there is an unstable site toppling, the energy of the site is redistributed to its nearest neighb...A simplified Olami-Feder-Christensen model on a random network has been studied. We propose a new toppling rule -- when there is an unstable site toppling, the energy of the site is redistributed to its nearest neighbors randomly not averagely. The simulation results indicate that the model displays self-organized criticality when the system is conservative, and the avalanche size probability distribution of the system obeys finite size scaling. When the system is nonconservative, the model does not display scaling behavior. Simulation results of our model with different nearest neighbors q is also compared, which indicates that the spatial topology does not alter the critical behavior of the system.展开更多
In this paper, we propose an evolving random network. The model is a linear combination of preferential attachment model and uniform model. We show that scaling limit distribution of the number of leaves at time n is ...In this paper, we propose an evolving random network. The model is a linear combination of preferential attachment model and uniform model. We show that scaling limit distribution of the number of leaves at time n is approximated by nomal distribution and the proportional degree sequence obeys power law. The branching structure and maximum degree are also discussed in this paper.展开更多
In random network models, sizes for pores and throats are distributed according to a truncated Weibull distribution. As a result, parameters defining the shape of the distribution are critical for the characteristic o...In random network models, sizes for pores and throats are distributed according to a truncated Weibull distribution. As a result, parameters defining the shape of the distribution are critical for the characteristic of the network. In this paper, an algorithm to distribute pores and throats in random network was established to more representatively describe the topology of porous media. First, relations between Weibull parameters and the distribution of dimensionless throat sizes were studied and a series of standard curves were obtained. Then, by analyzing the capillary pressure curve of the core sample, frequency distribution histogram of throat sizes was obtained. All the sizes were transformed to dimensionless numbers ranged from 0 to 1. Curves of the core were compared to the standard curves, and truncated Weibull parameters could be determined according an inverse algorithm. Finally, aspect ratio and average length of throats were adjusted to simultaneously fit the porosity and the capillary pressure curves and the whole network was established. The predicted relative permeability curves were in good agreement with the experimental data of cores, indicating the validity of the algorithm.展开更多
In mobile computing environments, most IoT devices connected to networks experience variable error rates and possess limited bandwidth. The conventional method of retransmitting lost information during transmission, c...In mobile computing environments, most IoT devices connected to networks experience variable error rates and possess limited bandwidth. The conventional method of retransmitting lost information during transmission, commonly used in data transmission protocols, increases transmission delay and consumes excessive bandwidth. To overcome this issue, forward error correction techniques, e.g., Random Linear Network Coding(RLNC) can be used in data transmission. The primary challenge in RLNC-based methodologies is sustaining a consistent coding ratio during data transmission, leading to notable bandwidth usage and transmission delay in dynamic network conditions. Therefore, this study proposes a new block-based RLNC strategy known as Adjustable RLNC(ARLNC), which dynamically adjusts the coding ratio and transmission window during runtime based on the estimated network error rate calculated via receiver feedback. The calculations in this approach are performed using a Galois field with the order of 256. Furthermore, we assessed ARLNC's performance by subjecting it to various error models such as Gilbert Elliott, exponential, and constant rates and compared it with the standard RLNC. The results show that dynamically adjusting the coding ratio and transmission window size based on network conditions significantly enhances network throughput and reduces total transmission delay in most scenarios. In contrast to the conventional RLNC method employing a fixed coding ratio, the presented approach has demonstrated significant enhancements, resulting in a 73% decrease in transmission delay and a 4 times augmentation in throughput. However, in dynamic computational environments, ARLNC generally incurs higher computational costs than the standard RLNC but excels in high-performance networks.展开更多
The design and performance analysis of networked control systems with random network delay in the forward channel is proposed, which are described in a state-space form. A new control scheme is used to overcome the ef...The design and performance analysis of networked control systems with random network delay in the forward channel is proposed, which are described in a state-space form. A new control scheme is used to overcome the effects of network transmission delay, which is termed networked predictive control （NPC）. Furthermore, three different ways to choose control input are discussed and the performances are analyzed, respectively. Both real-time simulations and practical experiments show the effectiveness of the control scheme.展开更多
Understanding charge transport mechanisms in thin-film transistors based on random networks of single-wall carbon nanotubes(SWCNT-TFTs)is essential for further advances to improve the potential for various nanoelectro...Understanding charge transport mechanisms in thin-film transistors based on random networks of single-wall carbon nanotubes(SWCNT-TFTs)is essential for further advances to improve the potential for various nanoelectronic applications.Herein,a comprehensive investigation of the two-dimensional(2D)charge transport mechanism in SWCNT-TFTs is reported by analyzing the temperature-dependent electrical characteristics determined from the direct-current and non-quasi-static transient measurements at 80-300 K.To elucidate the time-domain charge transport characteristics of the random networks in the SWCNTs,an empirical equation was derived from a theoretical trapping model,and a carrier velocity distribution was determined from the differentiation of the transient response.Furthermore,charge trapping and de-trapping in shallow-and deep-traps in SWCNT-TFTs were analyzed by investigating charge transport based on their trapping/de-trapping rate.The comprehensive analysis of this study provides fundamental insights into the 2D charge transport mechanism in TFTs based on random networks of nanomaterial channels.展开更多
In this study,we consider the problem of node ranking in a random network.A Markov chain is defined for the network,and its transition probability matrix is unknown but can be learned by sampling random interactions a...In this study,we consider the problem of node ranking in a random network.A Markov chain is defined for the network,and its transition probability matrix is unknown but can be learned by sampling random interactions among nodes.Our objective is to decompose the Markov chain into several ergodic classes and select the best node in each ergodic class.We propose a dynamic sampling procedure,which gives a probability guarantee on correct decomposition and maximizes a weighted probability of correct selection of the best node in each ergodic class.Numerical experiment results demonstrate the efficiency of the proposed sampling procedure.展开更多
Current hyperelastic constitutive models of hydrogels face difficulties in capturing the stress-strain behaviors of hydrogels under extremely large deformation because the effect of non-affine deformation of the polym...Current hyperelastic constitutive models of hydrogels face difficulties in capturing the stress-strain behaviors of hydrogels under extremely large deformation because the effect of non-affine deformation of the polymer network inside is ambiguous.In this work,we construct periodic random network(PRN)models for the effective polymer network in hydrogels and investigate the non-affine deformation of polymer chains intrinsically originates from the structural randomness from bottom up.The non-affine deformation in PRN models is manifested as the actual stretch of polymer chains randomly deviated from the chain stretch predicted by affine assumption,and quantified by a non-affine ratio of each polymer chain.It is found that the non-affine ratios of polymer chains are closely related to bulk deformation state,chain orientation,and initial chain elongation.By fitting the non-affine ratio of polymer chains in all PRN models,we propose a non-affine constitutive model for the hydrogel polymer network based on micro-sphere model.The stress-strain curves of the proposed constitutive models under uniaxial tension condition agree with the simulation results of different PRN models of hydrogels very well.展开更多
Molten iron temperature as well as Si, P, and S contents is the most essential molten iron quality （MIQ） indices in the blast furnace （BF） ironmaking, which requires strict monitoring during the whole ironmaking p...Molten iron temperature as well as Si, P, and S contents is the most essential molten iron quality （MIQ） indices in the blast furnace （BF） ironmaking, which requires strict monitoring during the whole ironmaking production. However, these MIQ parameters are difficult to be directly measured online, and large-time delay exists in off-line analysis through laboratory sampling. Focusing on the practical challenge, a data-driven modeling method was presented for the prediction of MIQ using the improved muhivariable incremental random vector functional-link net- works （M-I-RVFLNs）. Compared with the conventional random vector functional-link networks （RVFLNs） and the online sequential RVFLNs, the M-I-RVFLNs have solved the problem of deciding the optimal number of hidden nodes and overcome the overfitting problems. Moreover, the proposed M I RVFLNs model has exhibited the potential for multivariable prediction of the MIQ and improved the terminal condition for the multiple-input multiple-out- put （MIMO） dynamic system, which is suitable for the BF ironmaking process in practice. Ultimately, industrial experiments and contrastive researches have been conducted on the BF No. 2 in Liuzhou Iron and Steel Group Co. Ltd. of China using the proposed method, and the results demonstrate that the established model produces better estima ting accuracy than other MIQ modeling methods.展开更多
In this paper, considering both cluster heads and sensor nodes, we propose a novel evolving a network model based on a random walk to study the fault tolerance decrease of wireless sensor networks （WSNs） due to node...In this paper, considering both cluster heads and sensor nodes, we propose a novel evolving a network model based on a random walk to study the fault tolerance decrease of wireless sensor networks （WSNs） due to node failure, and discuss the spreading dynamic behavior of viruses in the evolution model. A theoretical analysis shows that the WSN generated by such an evolution model not only has a strong fault tolerance, but also can dynamically balance the energy loss of the entire network. It is also found that although the increase of the density of cluster heads in the network reduces the network efficiency, it can effectively inhibit the spread of viruses. In addition, the heterogeneity of the network improves the network efficiency and enhances the virus prevalence. We confirm all the theoretical results with sufficient numerical simulations.展开更多
AIM:To analyze ultrasound biomicroscopy(UBM)images using random forest network to find new features to make predictions about vault after implantable collamer lens(ICL)implantation.METHODS:A total of 450 UBM images we...AIM:To analyze ultrasound biomicroscopy(UBM)images using random forest network to find new features to make predictions about vault after implantable collamer lens(ICL)implantation.METHODS:A total of 450 UBM images were collected from the Lixiang Eye Hospital to provide the patient’s preoperative parameters as well as the vault of the ICL after implantation.The vault was set as the prediction target,and the input elements were mainly ciliary sulcus shape parameters,which included 6 angular parameters,2 area parameters,and 2 parameters,distance between ciliary sulci,and anterior chamber height.A random forest regression model was applied to predict the vault,with the number of base estimators(n_estimators)of 2000,the maximum tree depth(max_depth)of 17,the number of tree features(max_features)of Auto,and the random state(random_state)of 40.0.RESULTS:Among the parameters selected in this study,the distance between ciliary sulci had a greater importance proportion,reaching 52%before parameter optimization is performed,and other features had less influence,with an importance proportion of about 5%.The importance of the distance between the ciliary sulci increased to 53% after parameter optimization,and the importance of angle 3 and area 1 increased to 5% and 8%respectively,while the importance of the other parameters remained unchanged,and the distance between the ciliary sulci was considered the most important feature.Other features,although they accounted for a relatively small proportion,also had an impact on the vault prediction.After parameter optimization,the best prediction results were obtained,with a predicted mean value of 763.688μm and an actual mean value of 776.9304μm.The R²was 0.4456 and the root mean square error was 201.5166.CONCLUSION:A study based on UBM images using random forest network can be performed for prediction of the vault after ICL implantation and can provide some reference for ICL size selection.展开更多
In this paper, we discuss how to transform the disordered phase into an ordered phase in random Boolean networks. To increase the effectiveness, a control scheme is proposed, which periodically freezes a fraction of t...In this paper, we discuss how to transform the disordered phase into an ordered phase in random Boolean networks. To increase the effectiveness, a control scheme is proposed, which periodically freezes a fraction of the network based on the average sensitivity of Boolean functions of the nodes. Theoretical analysis is carried out to estimate the expected critical value of the fraction, and shows that the critical value is reduced using this scheme compared to that of randomly freezing a fraction of the nodes. Finally, the simulation is given for illustrating the effectiveness of the proposed method.展开更多
In this paper,we provide a general method to obtain the exact solutions of the degree distributions for random birthand-death network（RBDN） with network size decline.First,by stochastic process rules,the steady stat...In this paper,we provide a general method to obtain the exact solutions of the degree distributions for random birthand-death network（RBDN） with network size decline.First,by stochastic process rules,the steady state transformation equations and steady state degree distribution equations are given in the case of m ≥ 3 and 0 〈 p 〈 1/2,then the average degree of network with n nodes is introduced to calculate the degree distributions.Specifically,taking m = 3 for example,we explain the detailed solving process,in which computer simulation is used to verify our degree distribution solutions.In addition,the tail characteristics of the degree distribution are discussed.Our findings suggest that the degree distributions will exhibit Poisson tail property for the declining RBDN.展开更多
In the Internet of vehicles(IoV),direct communication between vehicles,i.e.,vehicle-tovehicle(V2V)may have lower latency,compared to the schemes with help of Road Side Unit(RSU)or base station.In this paper,the scenar...In the Internet of vehicles(IoV),direct communication between vehicles,i.e.,vehicle-tovehicle(V2V)may have lower latency,compared to the schemes with help of Road Side Unit(RSU)or base station.In this paper,the scenario where the demands of a vehicle are satisfied by cooperative transmissions from those one in front is considered.Since the topology of the vehicle network is dynamic,random linear network coding is applied in such a multisource single-sink vehicle-to-vehicle network,where each vehicle is assumed to broadcast messages to others so that the intermediate vehicles between sources and sink can reduce the latency collaboratively.It is shown that the coding scheme can significantly reduce the time delay compared with the non-coding scheme even in the channels with high packet loss rate.In order to further optimize the coding scheme,one can increase the generation size,where the generation size means the number of raw data packets sent by the source node to the sink node in each round of communication.Under the premise of satisfying the coding validity,we can dynamically select the Galois field size according to the number of intermediate nodes.It is not surprised that the reduction in the Galois field size can further reduce the transmission latency.展开更多
Based on the random walk and the intentional random walk, we propose two types of immunization strategies which require only local connectivity information. On several typical scale-free networks, we demonstrate that ...Based on the random walk and the intentional random walk, we propose two types of immunization strategies which require only local connectivity information. On several typical scale-free networks, we demonstrate that these strategies can lead to the eradication of the epidemic by immunizing a small fraction of the nodes in the networks. Particularly, the immunization strategy based on the intentional random walk is extremely efficient for the assortatively mixed networks.展开更多
An approach based on artificial neural network （ANN） is used to develop predictive relations between hydrodynamic inline force on a vertical cylinder and some effective parameters. The data used to calibrate and val...An approach based on artificial neural network （ANN） is used to develop predictive relations between hydrodynamic inline force on a vertical cylinder and some effective parameters. The data used to calibrate and validate the ANN models are obtained from an experiment. Multilayer feed-forward neural networks that are trained with the back-propagation algorithm are constructed by use of three design parameters （i.e. wave surface height, horizontal and vertical velocities） as network inputs and the ultimate inline force as the only output. A sensitivity analysis is conducted on the ANN models to investigate the generalization ability （robustness） of the developed models, and predictions from the ANN models are compared to those obtained from Morison equation which is usually used to determine inline force as a computational method. With the existing data, it is found that least square method （LSM） gives less error in determining drag and inertia coefficients of Morison equation. With regard to the predicted results agreeing with calculations achieved from Morison equation that used LSM method, neural network has high efficiency considering its convenience, simplicity and promptitude. The outcome of this study can contribute to reducing the errors in predicting hydrodynamic inline force by use of ANN and to improve the reliability of that in comparison with the more practical state of Morison equation. Therefore, this method can be applied to relevant engineering projects with satisfactory results展开更多
Two kinds of noise strategies in binary opinion dynamics on ER random networks are discussed. Random noise p1 in the initial configuration plays a role in redistributing the opinion states associated with the network....Two kinds of noise strategies in binary opinion dynamics on ER random networks are discussed. Random noise p1 in the initial configuration plays a role in redistributing the opinion states associated with the network. Under synchronous updating, the system can attain a stable state within few time steps. The fraction of nodes with changed opinion states F decreases exponentially with time, and the ratio of one of the two opinion states R remains almost unchanged during the evolution. The average ratio <R> crosses at the half-half initial concentration under different p1. For noise in the dynamical evolution p2, the system can reach a steady state with small fluctuations. With larger p2, more nodes have changed opinion states at each updating and more nodes with opposite opinions coexist. If p2 is greater than 0.5, the two opinions coexist with equal support.展开更多
基金the National Natural Science Foundation of China(Nos.61102051,61221001 and 61301117)the National High Technology Research and Development Program(863)of China(Nos.2012AA011701 and 2012AA121601)+1 种基金the Shanghai Jiao Tong University Science and Technology Innovation Foundation(No.AF0300021)the Shanghai Key Laboratory Funding(No.12DZ2272600)
文摘In this paper, we propose two novel efficient scheduling schemes with network coding in multi-relay wireless network to maximize the transmission efficiency. The first one uses adaptive forwarding with network coding(AF-NC), in which each relay adaptively calculates the number of packets having innovative information according to the feedback from the sink. With AF-NC, duplicate packets are not sent, and the total number of time slots needed to complete transmission can be significantly reduced. The second scheme, named adaptive forwarding with network coding and retransmission(AFR-NC), combines AF-NC with automatic repeat request(ARQ) to guarantee reliable end-to-end communication with limited resource occupation. Numerical results show that compared with simple forwarding with network coding(F-NC), AF-NC has close successful delivery rate with dramatically less time slots, while AFR-NC achieves strict reliability with limited resource cost.
基金Project supported by the National Natural Science Foundation of China(Grant Nos.11675001,11675112,11775020,and 11372122)
文摘Synchronization rhythm and oscillating in biological systems can give clues to understanding the cooperation and competition between cells under appropriate biological and physical conditions. As a result, the network setting is appreciated to detect the stability and transition of collective behaviors in a network with different connection types. In this paper, the synchronization performance in time-delayed excitable homogeneous random networks（EHRNs） induced by diversity in system parameters is investigated by calculating the synchronization parameter and plotting the spatiotemporal evolution pattern, and distinct impacts induced by parameter-diversity are detected by setting different time delays. It is found that diversity has no distinct effect on the synchronization performance in EHRNs with small time delay being considered. When time delay is increased greatly, the synchronization performance of EHRN degenerates remarkably as diversity is increased. Surprisingly, by setting a moderate time delay, appropriate parameter-diversity can promote the synchronization performance in EHRNs, and can induce the synchronization transition from the asynchronous state to the weak synchronization. Moreover, the bistability phenomenon, which contains the states of asynchronous state and weak synchronization,is observed. Particularly, it is confirmed that the parameter-diversity promoted synchronization performance in time-delayed EHRN is manifested in the enhancement of the synchronization performance of individual oscillation and the increase of the number of synchronization transitions from the asynchronous state to the weak synchronization. Finally, we have revealed that this kind of parameter-diversity promoted synchronization performance is a robust phenomenon.
基金Supported by the National Natural Science Foundation of China under Grant No.60874080the Commonweal Application Technique Research Project of Zhejiang Province under Grant No.2012C2316the Open Project of State Key Lab of Industrial Control Technology of Zhejiang University under Grant No.ICT1107
文摘We propose a weighted model to explain the self-organizing formation of scale-free phenomenon in nongrowth random networks. In this model, we use multiple-edges to represent the connections between vertices and define the weight of a multiple-edge as the total weights of all single-edges within it and the strength of a vertex as the sum of weights for those multiple-edges attached to it. The network evolves according to a vertex strength preferential selection mechanism. During the evolution process, the network always holds its totM number of vertices and its total number of single-edges constantly. We show analytically and numerically that a network will form steady scale-free distributions with our model. The results show that a weighted non-growth random network can evolve into scMe-free state. It is interesting that the network also obtains the character of an exponential edge weight distribution. Namely, coexistence of scale-free distribution and exponential distribution emerges.
文摘A simplified Olami-Feder-Christensen model on a random network has been studied. We propose a new toppling rule -- when there is an unstable site toppling, the energy of the site is redistributed to its nearest neighbors randomly not averagely. The simulation results indicate that the model displays self-organized criticality when the system is conservative, and the avalanche size probability distribution of the system obeys finite size scaling. When the system is nonconservative, the model does not display scaling behavior. Simulation results of our model with different nearest neighbors q is also compared, which indicates that the spatial topology does not alter the critical behavior of the system.
基金The NSF (71271003) of Chinathe Programming Fund (12YJC630111, 12YJA790041) of the Humanities adn Social Sciences Research of the Ministry of Education of China+1 种基金the NSF (10040606Q03) of Anhui ProvinceKey University Science Research Project (KJ2013A044) of Anhui Province
文摘In this paper, we propose an evolving random network. The model is a linear combination of preferential attachment model and uniform model. We show that scaling limit distribution of the number of leaves at time n is approximated by nomal distribution and the proportional degree sequence obeys power law. The branching structure and maximum degree are also discussed in this paper.
文摘In random network models, sizes for pores and throats are distributed according to a truncated Weibull distribution. As a result, parameters defining the shape of the distribution are critical for the characteristic of the network. In this paper, an algorithm to distribute pores and throats in random network was established to more representatively describe the topology of porous media. First, relations between Weibull parameters and the distribution of dimensionless throat sizes were studied and a series of standard curves were obtained. Then, by analyzing the capillary pressure curve of the core sample, frequency distribution histogram of throat sizes was obtained. All the sizes were transformed to dimensionless numbers ranged from 0 to 1. Curves of the core were compared to the standard curves, and truncated Weibull parameters could be determined according an inverse algorithm. Finally, aspect ratio and average length of throats were adjusted to simultaneously fit the porosity and the capillary pressure curves and the whole network was established. The predicted relative permeability curves were in good agreement with the experimental data of cores, indicating the validity of the algorithm.
文摘In mobile computing environments, most IoT devices connected to networks experience variable error rates and possess limited bandwidth. The conventional method of retransmitting lost information during transmission, commonly used in data transmission protocols, increases transmission delay and consumes excessive bandwidth. To overcome this issue, forward error correction techniques, e.g., Random Linear Network Coding(RLNC) can be used in data transmission. The primary challenge in RLNC-based methodologies is sustaining a consistent coding ratio during data transmission, leading to notable bandwidth usage and transmission delay in dynamic network conditions. Therefore, this study proposes a new block-based RLNC strategy known as Adjustable RLNC(ARLNC), which dynamically adjusts the coding ratio and transmission window during runtime based on the estimated network error rate calculated via receiver feedback. The calculations in this approach are performed using a Galois field with the order of 256. Furthermore, we assessed ARLNC's performance by subjecting it to various error models such as Gilbert Elliott, exponential, and constant rates and compared it with the standard RLNC. The results show that dynamically adjusting the coding ratio and transmission window size based on network conditions significantly enhances network throughput and reduces total transmission delay in most scenarios. In contrast to the conventional RLNC method employing a fixed coding ratio, the presented approach has demonstrated significant enhancements, resulting in a 73% decrease in transmission delay and a 4 times augmentation in throughput. However, in dynamic computational environments, ARLNC generally incurs higher computational costs than the standard RLNC but excels in high-performance networks.
基金supported partly by the National Natural Science Foundation of China(60504020)the Program for New Century Excellent Talents in University(NCET-08-0047)the Excellent Young Scholars Research Fund of Beijing Institute of Technology(2008YS0104).
文摘The design and performance analysis of networked control systems with random network delay in the forward channel is proposed, which are described in a state-space form. A new control scheme is used to overcome the effects of network transmission delay, which is termed networked predictive control （NPC）. Furthermore, three different ways to choose control input are discussed and the performances are analyzed, respectively. Both real-time simulations and practical experiments show the effectiveness of the control scheme.
基金supported by the National Research Foundation of Korea grant funded by the Korea government(MSIT)(NRF-2021R1A2C2012855).
文摘Understanding charge transport mechanisms in thin-film transistors based on random networks of single-wall carbon nanotubes(SWCNT-TFTs)is essential for further advances to improve the potential for various nanoelectronic applications.Herein,a comprehensive investigation of the two-dimensional(2D)charge transport mechanism in SWCNT-TFTs is reported by analyzing the temperature-dependent electrical characteristics determined from the direct-current and non-quasi-static transient measurements at 80-300 K.To elucidate the time-domain charge transport characteristics of the random networks in the SWCNTs,an empirical equation was derived from a theoretical trapping model,and a carrier velocity distribution was determined from the differentiation of the transient response.Furthermore,charge trapping and de-trapping in shallow-and deep-traps in SWCNT-TFTs were analyzed by investigating charge transport based on their trapping/de-trapping rate.The comprehensive analysis of this study provides fundamental insights into the 2D charge transport mechanism in TFTs based on random networks of nanomaterial channels.
基金This work was supported in part by the National Natural Science Foundation of China(Grants No.72022001,92146003,71901003).
文摘In this study,we consider the problem of node ranking in a random network.A Markov chain is defined for the network,and its transition probability matrix is unknown but can be learned by sampling random interactions among nodes.Our objective is to decompose the Markov chain into several ergodic classes and select the best node in each ergodic class.We propose a dynamic sampling procedure,which gives a probability guarantee on correct decomposition and maximizes a weighted probability of correct selection of the best node in each ergodic class.Numerical experiment results demonstrate the efficiency of the proposed sampling procedure.
基金supported by the National Natural Science Foundation of China(Grant Nos.12202339 and 12172273)Xi’an Jiaotong University Tang Scholar.
文摘Current hyperelastic constitutive models of hydrogels face difficulties in capturing the stress-strain behaviors of hydrogels under extremely large deformation because the effect of non-affine deformation of the polymer network inside is ambiguous.In this work,we construct periodic random network(PRN)models for the effective polymer network in hydrogels and investigate the non-affine deformation of polymer chains intrinsically originates from the structural randomness from bottom up.The non-affine deformation in PRN models is manifested as the actual stretch of polymer chains randomly deviated from the chain stretch predicted by affine assumption,and quantified by a non-affine ratio of each polymer chain.It is found that the non-affine ratios of polymer chains are closely related to bulk deformation state,chain orientation,and initial chain elongation.By fitting the non-affine ratio of polymer chains in all PRN models,we propose a non-affine constitutive model for the hydrogel polymer network based on micro-sphere model.The stress-strain curves of the proposed constitutive models under uniaxial tension condition agree with the simulation results of different PRN models of hydrogels very well.
基金Item Sponsored by National Natural Science Foundation of China(61290323,61333007,61473064)Fundamental Research Funds for Central Universities of China(N130108001)+1 种基金National High Technology Research and Development Program of China(2015AA043802)General Project on Scientific Research for Education Department of Liaoning Province of China(L20150186)
文摘Molten iron temperature as well as Si, P, and S contents is the most essential molten iron quality （MIQ） indices in the blast furnace （BF） ironmaking, which requires strict monitoring during the whole ironmaking production. However, these MIQ parameters are difficult to be directly measured online, and large-time delay exists in off-line analysis through laboratory sampling. Focusing on the practical challenge, a data-driven modeling method was presented for the prediction of MIQ using the improved muhivariable incremental random vector functional-link net- works （M-I-RVFLNs）. Compared with the conventional random vector functional-link networks （RVFLNs） and the online sequential RVFLNs, the M-I-RVFLNs have solved the problem of deciding the optimal number of hidden nodes and overcome the overfitting problems. Moreover, the proposed M I RVFLNs model has exhibited the potential for multivariable prediction of the MIQ and improved the terminal condition for the multiple-input multiple-out- put （MIMO） dynamic system, which is suitable for the BF ironmaking process in practice. Ultimately, industrial experiments and contrastive researches have been conducted on the BF No. 2 in Liuzhou Iron and Steel Group Co. Ltd. of China using the proposed method, and the results demonstrate that the established model produces better estima ting accuracy than other MIQ modeling methods.
基金Project supported by the National Natural Science Foundation of China (Grant Nos. 61103231 and 61103230)the Innovation Program of Graduate Scientific Research in Institution of Higher Education of Jiangsu Province, China (Grant No. CXZZ11 0401)
文摘In this paper, considering both cluster heads and sensor nodes, we propose a novel evolving a network model based on a random walk to study the fault tolerance decrease of wireless sensor networks （WSNs） due to node failure, and discuss the spreading dynamic behavior of viruses in the evolution model. A theoretical analysis shows that the WSN generated by such an evolution model not only has a strong fault tolerance, but also can dynamically balance the energy loss of the entire network. It is also found that although the increase of the density of cluster heads in the network reduces the network efficiency, it can effectively inhibit the spread of viruses. In addition, the heterogeneity of the network improves the network efficiency and enhances the virus prevalence. We confirm all the theoretical results with sufficient numerical simulations.
文摘AIM:To analyze ultrasound biomicroscopy(UBM)images using random forest network to find new features to make predictions about vault after implantable collamer lens(ICL)implantation.METHODS:A total of 450 UBM images were collected from the Lixiang Eye Hospital to provide the patient’s preoperative parameters as well as the vault of the ICL after implantation.The vault was set as the prediction target,and the input elements were mainly ciliary sulcus shape parameters,which included 6 angular parameters,2 area parameters,and 2 parameters,distance between ciliary sulci,and anterior chamber height.A random forest regression model was applied to predict the vault,with the number of base estimators(n_estimators)of 2000,the maximum tree depth(max_depth)of 17,the number of tree features(max_features)of Auto,and the random state(random_state)of 40.0.RESULTS:Among the parameters selected in this study,the distance between ciliary sulci had a greater importance proportion,reaching 52%before parameter optimization is performed,and other features had less influence,with an importance proportion of about 5%.The importance of the distance between the ciliary sulci increased to 53% after parameter optimization,and the importance of angle 3 and area 1 increased to 5% and 8%respectively,while the importance of the other parameters remained unchanged,and the distance between the ciliary sulci was considered the most important feature.Other features,although they accounted for a relatively small proportion,also had an impact on the vault prediction.After parameter optimization,the best prediction results were obtained,with a predicted mean value of 763.688μm and an actual mean value of 776.9304μm.The R²was 0.4456 and the root mean square error was 201.5166.CONCLUSION:A study based on UBM images using random forest network can be performed for prediction of the vault after ICL implantation and can provide some reference for ICL size selection.
基金supported in part by the National Natural Science Foundation of China (Grant Nos. 60874018,60736022,and 60821091)
文摘In this paper, we discuss how to transform the disordered phase into an ordered phase in random Boolean networks. To increase the effectiveness, a control scheme is proposed, which periodically freezes a fraction of the network based on the average sensitivity of Boolean functions of the nodes. Theoretical analysis is carried out to estimate the expected critical value of the fraction, and shows that the critical value is reduced using this scheme compared to that of randomly freezing a fraction of the nodes. Finally, the simulation is given for illustrating the effectiveness of the proposed method.
基金Project supported by the National Natural Science Foundation of China(Grant No.61273015)the Chinese Scholarship Council
文摘In this paper,we provide a general method to obtain the exact solutions of the degree distributions for random birthand-death network（RBDN） with network size decline.First,by stochastic process rules,the steady state transformation equations and steady state degree distribution equations are given in the case of m ≥ 3 and 0 〈 p 〈 1/2,then the average degree of network with n nodes is introduced to calculate the degree distributions.Specifically,taking m = 3 for example,we explain the detailed solving process,in which computer simulation is used to verify our degree distribution solutions.In addition,the tail characteristics of the degree distribution are discussed.Our findings suggest that the degree distributions will exhibit Poisson tail property for the declining RBDN.
基金This work was supported in part by the Guangdong Basic and Applied Basic Research Foundation under Key Project 2019B1515120032in part by the National Science Foundation of China(NSFC)with grant no.61901534+3 种基金in part by the Science,Technology and Innovation Commission of Shenzhen Municipality with grant no.JCYJ20190807155617099in part by the University Basic Research Fund 20lgpy43in part by the Guangdong Natural Science Foundation of Grant No.2019A1515011622the Foundation of Grant No.2019-JCJQ-JJ-411.
文摘In the Internet of vehicles(IoV),direct communication between vehicles,i.e.,vehicle-tovehicle(V2V)may have lower latency,compared to the schemes with help of Road Side Unit(RSU)or base station.In this paper,the scenario where the demands of a vehicle are satisfied by cooperative transmissions from those one in front is considered.Since the topology of the vehicle network is dynamic,random linear network coding is applied in such a multisource single-sink vehicle-to-vehicle network,where each vehicle is assumed to broadcast messages to others so that the intermediate vehicles between sources and sink can reduce the latency collaboratively.It is shown that the coding scheme can significantly reduce the time delay compared with the non-coding scheme even in the channels with high packet loss rate.In order to further optimize the coding scheme,one can increase the generation size,where the generation size means the number of raw data packets sent by the source node to the sink node in each round of communication.Under the premise of satisfying the coding validity,we can dynamically select the Galois field size according to the number of intermediate nodes.It is not surprised that the reduction in the Galois field size can further reduce the transmission latency.
文摘Based on the random walk and the intentional random walk, we propose two types of immunization strategies which require only local connectivity information. On several typical scale-free networks, we demonstrate that these strategies can lead to the eradication of the epidemic by immunizing a small fraction of the nodes in the networks. Particularly, the immunization strategy based on the intentional random walk is extremely efficient for the assortatively mixed networks.
文摘An approach based on artificial neural network （ANN） is used to develop predictive relations between hydrodynamic inline force on a vertical cylinder and some effective parameters. The data used to calibrate and validate the ANN models are obtained from an experiment. Multilayer feed-forward neural networks that are trained with the back-propagation algorithm are constructed by use of three design parameters （i.e. wave surface height, horizontal and vertical velocities） as network inputs and the ultimate inline force as the only output. A sensitivity analysis is conducted on the ANN models to investigate the generalization ability （robustness） of the developed models, and predictions from the ANN models are compared to those obtained from Morison equation which is usually used to determine inline force as a computational method. With the existing data, it is found that least square method （LSM） gives less error in determining drag and inertia coefficients of Morison equation. With regard to the predicted results agreeing with calculations achieved from Morison equation that used LSM method, neural network has high efficiency considering its convenience, simplicity and promptitude. The outcome of this study can contribute to reducing the errors in predicting hydrodynamic inline force by use of ANN and to improve the reliability of that in comparison with the more practical state of Morison equation. Therefore, this method can be applied to relevant engineering projects with satisfactory results
基金supported in part by the National Natural Science Founda-tion of China (10635020 and 10975057)the Ministry of Education of China (306022)
文摘Two kinds of noise strategies in binary opinion dynamics on ER random networks are discussed. Random noise p1 in the initial configuration plays a role in redistributing the opinion states associated with the network. Under synchronous updating, the system can attain a stable state within few time steps. The fraction of nodes with changed opinion states F decreases exponentially with time, and the ratio of one of the two opinion states R remains almost unchanged during the evolution. The average ratio <R> crosses at the half-half initial concentration under different p1. For noise in the dynamical evolution p2, the system can reach a steady state with small fluctuations. With larger p2, more nodes have changed opinion states at each updating and more nodes with opposite opinions coexist. If p2 is greater than 0.5, the two opinions coexist with equal support.
