Showing 1,081 - 1,100 results of 7,333 for search '"probability"', query time: 0.05s Refine Results
  1. 1081

    RSPEED:the reliability and real-time routing based on uncertain delay in wireless sensor network by Quan CHEN, Hong GAO

    Published 2013-08-01
    “…The forwarding reliability was proposed by considering the unreliability and the delay of a link,and with which,a novel real-time routing protocol(RSPEED) was designed.The forwarding reliability denoted the probability to deliver the data successfully to the neighbor node under a given deadline,and it was used to achieve probabilistic QoS guarantee in timeliness and reliability.The protocol can also make trade-off between the transmission delay and the reliability of transmission to improve the probability of successful transmission when the environment and link quality is very poor.The experimental results show that the proposed approach can significantly improve the reliability of transmission and reduces the number of the missed deadline,and even when the channel is very poor,it can achieve 20% higher performance than SPEED.…”
    Get full text
    Article
  2. 1082

    Performance analysis and re-modeling of secondary users in cognitive radio system by Wei LIN, Yu FU, Qin-yu ZHANG, Ye WANG, Sheng WANG

    Published 2012-11-01
    “…A number of errors in the past Markov model and theoretical analysis were discussed in spectrum access based on cognitive radio network (CRN).To imitate the behav ary user (PU) and secondary user (SU) factually,new models for access strategy were presented.The performance of CRN based on different access strategies were reappraised and compared by using matrix geometric theory and event scheduling of discrete events system simulation.Theoretical analysis results and simulation experiments were tally close,which confirms the reliability of proposed models.The access strategies with handoff and channel reservation efficiently decrease the call dropping probability,as while as,increase the blocking probability.And the thought for CRN can reach the maximum in the latter with the optimum number of reserved channels.…”
    Get full text
    Article
  3. 1083

    Research on secret key generation based on wireless channel characteristics in body area network by Jingjing HUANG

    Published 2021-12-01
    “…Wireless body area network (WBAN) is a human-centered wireless network.With limitations of power and computation capabilities of WBAN, the significant challenge of ensuring security is how to generate a shared key between two entities based on a lightweight symmetric cryptography.To investigate this issue, a secret key generation scheme in ultra-wideband (UWB) WBAN was designed.In this scheme, the difference of multipath relative delay and its average value were chosen as common random source to reduce key mismatch probability.Furthermore, with the aid of relay, secret key generation rate could be increased.Simulation and test results demonstrate that the proposed scheme can achieve a good tradeoff between key match probability and key generation rate.Furthermore, security analysis of the scheme was also provided to validate its feasibility.…”
    Get full text
    Article
  4. 1084

    Relations between CEO characteristics and mergers and acquisition decisions in Brazilian companies by Kamilla Tairine de Assunção Main, Vinicius Augusto Brunassi Silva

    Published 2021-01-01
    “…This paper investigates the probability of companies to perform Mergers & Acquisitions (M&As) based on the characteristics of the CEO.. …”
    Get full text
    Article
  5. 1085

    VVC coded distortion prediction model based on frame-level transform coefficient modeling of generalized Gaussian distribution by Yiyin GU, Hongkui WANG, Haibin YIN

    Published 2023-04-01
    “…In versatile video coding (VVC), a variety of advanced coding tools work together to achieve excellent coding performance.Compared with high efficient video coding (HEVC), the transform coefficient distribution (TCD) of VVC has sharper peaks.In order to solve this phenomenon, the probability density function (PDF) of frame-level TCD was modeled, and a frame-level coding distortion prediction model based on statistical modeling was proposed, which modeled frame-level distortion as a function of TCD distribution parameters and quantization parameters.The experimental results show that compared with the Laplace distribution and Cauchy distribution, the generalized Gaussian distribution has the best performance in TCD probability density fitting.The prediction results based on the generalized Gaussian distribution distortion prediction model are closest to the actual coding distortion.…”
    Get full text
    Article
  6. 1086

    Call Admission Control Based on Resource Sharing in LTE-Advanced Relay System by Jihong Zhao, Haifang Han, Hua Qu

    Published 2014-02-01
    “…A call admission control based on resource sharing in LTE-Advanced relay system was proposed.If the shared resources of the target site for new users and handover users are used up,handover users can use the reserved r esources of the target site for handover users to access system,while new users can access system by resource sharing between the sites in the cell which the target site inside.Simulation results show that compared the proposed algorithm with LTE-Advanced system on fixed bandwidth reservation scheme and LTE-Advanced relay system on fixed bandwidth reservation scheme,the proposed algorithm can effectively reduce the blocking probability of new users and dropping probability of handover users in the cell,and can improve the system resource utilization.…”
    Get full text
    Article
  7. 1087

    COVID-19, FINANCIAL RISK AND THE AIRLINE INDUSTRY by Kasım Kiracı

    Published 2021-11-01
    “…The findings indicate that in times of crisis, when the probability of financial distress and bankruptcy increases (such as with Covid-19), leverage level, asset structure, firm size, firm profitability and liquidity ratio have a significant effect on an airline’s probability of bankruptcy score.…”
    Get full text
    Article
  8. 1088

    Pattern division random access (PDRA) scheme for mMIMO systems by Xiaoming DAI, Lizhuo PANG, Zheng CHANG, Xinyue ZHANG, Yiran XING, Xiyuan WANG

    Published 2022-10-01
    “…To enhance the massive machine-type communications (mMTC) random access (RA) performance, a pattern division random access (PDRA) scheme was proposed for massive multiple-input multiple-output (mMIMO) systems.In this scheme, the pilot contention space was expanded to the pattern-domain.To enlarge the size of contention space without resorting to increasing the physical resources, the pattern-domain pilot was constructed based on the superposition of L cyclically-shifted Zadoff-Chu (ZC) sequences.Simulation results illustrate that the PDRA scheme can reduce pilot collision probability significantly, and improve the access success probability compared with the conventional RA scheme, without compromising excessively on channel estimation and data detection performance.…”
    Get full text
    Article
  9. 1089

    Research on Spectrum Access Mechanism Based on Polling Scheduling by Jin Lu, Ming Huang, Zhijun Yang

    Published 2013-11-01
    “…Based on the analysis method of embedded Markov chain and probability generating function, the key parameters of average queue length, bandwidth utilization and forced termination probability were obtained through solving the stationary distribution of equilibrium state. …”
    Get full text
    Article
  10. 1090

    Spectrum Handoff with Channel Sensing Sequencing in Cognitive Radio Network by Xingyu Zhu, Huaibei Zhou, Junyuan Huang

    Published 2013-04-01
    “…In the cognitive radio network,when the primary users show up,the secondary users should vacate the channel and find another free channel for data transmissions.This is the so-called spectrum handoff.There are two most important performance metrics for spectrum handoff:handoff delay and handoff times.A novel spectrum handoff scheme with channel sensing sequencing was proposed in order to decrease both handoff delay and handoff times.When designing the channel sensing sequence,the channel free probability was considered,and the probability that no handoff will happen in a channel was considered as well.The simulation results show that the method not only can get the minimum handoff delay as the traditional method does,but also can decrease the handoff times were significantly compared with the traditional method.…”
    Get full text
    Article
  11. 1091

    Novel virtual topology configuration algorithm for IP over WDM network by LE Zi-chun, FU Ming-lei

    Published 2007-01-01
    “…The load balancing for the whole network was chosen as the optimal objective and a novel virtual topology configuration algorithm was proposed.In the proposed algorithm,the load distribution variance was chosen as a key criterion for judging the load balancing.And the definition and the computing method of the load distribution variance were introduced.In addition,the blocking probability was chosen as the main performance parameter for comparing with other algorithms.In the optical layer,the algorithm proposed was compared with the routing with load balancing heuristics(RLBH) algorithm.Similarly,in IP layer,the algorithm was compared with the fixed-path least-congestion(FPLC) algorithm.Moreover,the numerical results of the algorithm comparison were shown and discussed.The simulation results show that the performance of the algorithm is better than RLBH algorithm and FPLC algorithm on the blocking probability.…”
    Get full text
    Article
  12. 1092

    Dynamic spectrum allocation for cognitive radio sensor networks based on improved genetic algorithm by Chang CAI, Yafang WANG, Bingmei MIAO, Hui JIANG

    Published 2017-08-01
    “…ISM (industrial scientific and medical) bands where wireless sensor network works faced with the shortage of spectrum resources problems.Aimed at this case,dynamic spectrum allocation in cognitive radio technology was applied in wireless sensor network.A dynamic frequency spectrum allocation scheme was proposed.The algorithm was a modified adaptive genetic algorithm which was based on graph coloring model.In addition,the objective functions of the algorithm were maximum bandwidth gains and minimum spectrum handoff,besides,in the crossover and mutation process,adaptive crossover probability and mutation probability was used instead of the fixed.Experimental results confirm that compared with the traditional genetic algorithm and color sensitive graph coloring algorithm,the proposed algorithm can achieve the expected goal of improving the spectral efficiency and reducing energy consumption.…”
    Get full text
    Article
  13. 1093

    Adaptive Event-Triggered Control for Complex Dynamical Network with Random Coupling Delay under Stochastic Deception Attacks by M. Mubeen Tajudeen, M. Syed Ali, Syeda Asma Kauser, Khanyaluck Subkrajang, Anuwat Jirawattanapanit, Grienggrai Rajchakit

    Published 2022-01-01
    “…The adaptive event-triggered mechanism is used to avoid the wasting of limited bandwidth. The probability of data communicated by the network is established by statistical properties and Bernoulli stochastic variables with an uncertain occurrence probability. …”
    Get full text
    Article
  14. 1094

    A Secure and Fair Joint E-Lottery Protocol by Chin-Ling Chen, Yuan-Hao Liao, Woei-Jiunn Tsaur

    Published 2014-01-01
    “…Due to the very small probability of winning prizes, the players can enhance their probability of winning by using the method of joint purchase. …”
    Get full text
    Article
  15. 1095

    Particle approximations of Wigner distributions for n arbitrary observables by Ralph Sabbagh, Olga Movilla Miangolarra, Hamid Hezari, Tryphon T. Georgiou

    Published 2025-01-01
    “…A class of signed joint probability measures for n arbitrary quantum observables is derived and studied based on quasicharacteristic functions with symmetrized operator orderings of Margenau-Hill type. …”
    Get full text
    Article
  16. 1096

    (ε,δ)-approximate Top-k query processing algorithm in wireless sensor networks by BI Ran, LI Jian-zhong, CHENG Si-yao

    Published 2011-01-01
    “…A sampling based approximate Top-k algorithm was proposed that is adaptive for any data distribution.δ≥0 and 0≤δ<1 are respectively relative error bound and failure probability bound.The theoretical analysis demonstrates that for any δ≥0 and 0≤δ<1 the probability that the relative error bound of the results returned by this algorithm is larger than ε/(1+ε) is less than δ.So the proposed algorithm can reach arbitrary precision.Furthermore,an optimal sampling algorithm was proposed that supported the approximate Top-k query,and through the technique of data filtering the en-ergy consumption of communication was reduced.Theoretical analysis and simulation show that the proposed algorithm is efficient and consumes little energy.…”
    Get full text
    Article
  17. 1097

    Stochastic bridge approach for generating correlated time series and its applications by HU Luo-quan, ZHU Hong-bo

    Published 2006-01-01
    “…There were apparently locally favorable peaks in probability density function of basic random variables with lower reflections. …”
    Get full text
    Article
  18. 1098

    Hume’s “Of scepticism with regard to reason” and the Degeneration of Knowledge in Practice by Benjamin Nelson

    Published 2024-03-01
    “…Accepting this much at the outset, Hume calls on recollected errors to show how, in practice, all knowledge degenerates to probability.…”
    Get full text
    Article
  19. 1099

    A two level multi-antenna blind spectrum detection about spatial spectrum by Zhiqiang BAO, Yanrui CUI, Xiao XU

    Published 2018-03-01
    “…In order to improve the perceptual performance,the array spatial spectrum search technology was applied to the spectrum sensing field.A blind spectrum detection algorithm based on two stage detection of spatial spectral values was proposed.Firstly,the maximum and minimum values of the spatial spectrum were used as the test statistics to detect the spectrum.Then the mean value of spatial spectrum for the undetected part was used in the second level detection.By using the advantage of the spatial matching filter,the new algorithm achieved higher detection probability under the low SNR and low sampling rate,and the threshold of detection was accurately deduced based on probability theory.The simulation and comparison results show that TDSS algorithm has better detection effects than some existing classical blind spectrum sensing algorithms.…”
    Get full text
    Article
  20. 1100

    Improving deep convolutional neural networks with mixed maxout units by Hui-zhen ZHAO, Fu-xian LIU, Long-yue LI, Chang LUO

    Published 2017-07-01
    “…The maxout units have the problem of not delivering non-max features, resulting in the insufficient of pooling operation over a subspace that is composed of several linear feature mappings,when they are applied in deep convolutional neural networks.The mixed maxout (mixout) units were proposed to deal with this constrain.Firstly,the exponential probability of the feature mappings getting from different linear transformations was computed.Then,the averaging of a subspace of different feature mappings by the exponential probability was computed.Finally,the output was randomly sampled from the max feature and the mean value by the Bernoulli distribution,leading to the better utilizing of model averaging ability of dropout.The simple models and network in network models was built to evaluate the performance of mixout units.The results show that mixout units based models have better performance.…”
    Get full text
    Article