Search

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Operations Research Transactions / Yunchouxue Xuebao is the property of Editorial office of Operations Research Transactions and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Integrating edge computing with satellite Internet of Things (SIoT) allows tasks generated by local IoT devices to be processed closer to the edge, significantly relieving the computational burden on local IoT devices. However, given the diversity of computational tasks in satellite IoT, deploying a specific computing offloading strategy for each type of task leads to wastage of computational resources due to varying requirements based on task characteristics. Moreover, the randomness in the generation of computational tasks in satellite IoT requires a long-term optimization approach; otherwise, it may result in unde-rutilization of computational resources of the devices, further increasing the task processing delay. To address these issues, this paper proposed a multi-type task computing offloading strategy based on DQN, incorporating queue theory to minimize the long-term average delay in system task processing. Additionally, to enhance the training outcomes, it redesigned the exploration method during the training phase. Finally, extensive simulation results indicate that the proposed strategy effectively reduces the average task processing delay in the system compared with other offloading strategies. [ABSTRACT FROM AUTHOR]

Aiming at the problem of difficulty in allocating channels efficiently for secondary users (SU) in complex and variable cognitive radio systems, this paper proposed a high throughput channel allocation protocol, TKMA protocol. The protocol constructed an utility matrix of user and channel based on primary user (PU) activities, SU real-time service demands, and channel conditions, etc., allocated channels with the objective of maximizing the total utility value of the SU system under the premise of guaranteeing the communication quality of the PUs, and solved the problem by using the improved Kuhn-Munkras algorithm and polling scheduling. To evaluate the performance of the protocol, it established a universal multi-user multi-channel cognitive radio system model, described the packet transmission process using queuing theory, and derived the performance indicators of SU through Markov steady-state solution. The experimental results show that the use of TKMA protocol yields better results in terms of total SU system throughput, average delay, average queue length, rejection rate and other metrics compared with the previously proposed simplification algorithm and the traditional equitable random assignment protocol, which proves the effectiveness of the proposed protocol and system model. [ABSTRACT FROM AUTHOR]

Copyright of Journal of South China University of Technology (Natural Science Edition) is the property of South China University of Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Computer Engineering & Applications is the property of Beijing Journal of Computer Engineering & Applications Journal Co Ltd. and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Railway Signalling & Communication Engineering is the property of Railway Signalling & Communication Engineering and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Journal of Chinese Institute of Food Science & Technology / Zhongguo Shipin Xuebao is the property of Journal of Chinese Institute of Food Science & Technology Periodical Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Application Research of Computers / Jisuanji Yingyong Yanjiu is the property of Application Research of Computers Edition and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Architectural Journal / Jian Zhu Xue Bao is the property of Architectural Journal Editorial Office and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Control Theory & Applications / Kongzhi Lilun Yu Yinyong is the property of Editorial Department of Control Theory & Applications and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

To solve the spectrum access decision problem in cognitive radio networks (CRNs) the spectrum access procedure of secondary users (SUs) can be modeled as a non-cooperative game. In view of the fact that the primary user (PU) has higher priority to access the radio spectrum, this paper set up the system model based on the M/G/l queueing theory with server breakdowns and analyzed the individual optimization strategy and social optimization strategy separately. Based on the analysis results, this paper proposed a pricing scheme to achieve the goal that Nash equilibrium actions of SUs lead to social welfare maximization. The simulation results indicate that the price-based spectrum access strategy can improve the efficiency of spectrum resource allocation and satisfy the need of the whole society. [ABSTRACT FROM AUTHOR]

Copyright of Control Theory & Applications / Kongzhi Lilun Yu Yinyong is the property of Editorial Department of Control Theory & Applications and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Control Theory & Applications / Kongzhi Lilun Yu Yinyong is the property of Editorial Department of Control Theory & Applications and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Operations Research Transactions / Yunchouxue Xuebao is the property of Editorial office of Operations Research Transactions and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Considering federated learning under mobile edge computing, where a global server connects a large number of mobile devices through the network to jointly train a deep neural network model. The data distribution shift caused by global class imbalance and device local class imbalance leads to the performance degradation of the standard federated averaging ( FedAvg) algorithm. This paper proposed a device selection algorithm based on the combinatorial multi-armed bandit ( CMAB) as an online learning algorithm framework, and designed a class estimation scheme to form a nonlinear reward function. Based on class estimation scheme and CMAB, in each round of communication, the global server selected the device subset with class imbalance that could be best complementary with test performance deviation across classes of global model from last communication round. Therefore, the current aggregated global model could achieve more balance and better test performance per class, and also faster convergence and more stable training dynamics. Extensive numerical results demonstrate the influence of different parameters on FedAvg under class imbalance, and verify the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

In order to solve the problem of privacy leakage of user trajectories in the LBS service, this paper proposed a privacy protection algorithm based on efficient false trajectories. First, the scheme comprehensively considered the background information of the area where the user was located, calculated the historical service request probability of each grid in a grid-divided manner, and ensured that each generated fake location had the same historical service request as the corresponding real location probability. Secondly, it combined the grid historical service request probability and the gravitational law model calculated the user location transfer probability. Finally,it generated k - 1 fake trajectories with the closest probabilities of real position transition to achieve K-anonymity. Experimental results show that this scheme can protect the users trajectory privacy more effectively. [ABSTRACT FROM AUTHOR]

Copyright of Telecommunication Engineering is the property of Telecommunication Engineering and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Multi-server authentication protocols are pivotal to remote authentication. However, many existing solutions suffer po tential attacks, lack three-factor security, and ignore anonymity . Therefore, this paper pointed out the defects and proposed an anonymous three-factor scheme. Through the attacker model, it attacked the scheme of Wen Xiang et al. and examined the new one. It guaranteed the core security of authentication using elliptic curve cryptography. The use of fuzzy extractor and verifier protected biometrics and passwords. It analyzed the new scheme' s advantages over previous schemes. Analysis shows that the former scheme is susceptible to user impersonation attack, and is not anonymous. The new protocol can prevent more attacks such as smart-card loss attack, impersonation attack, etc., and provide more functions such as anonymity and forward security. Its computational efficiency is 14. 8% higher than the predecessors. Therefore, it can be applied to a multi-server authentication network that requires high security and reliability. [ABSTRACT FROM AUTHOR]

Due to cope with relying on controllers badly and lacking of quantitative models to assist decision-making in air traffic flow management, this paper studied the delay optimization model and its solving algorithm for route network. Firstly, it established a traffic flow assignment model with the objective function of minimum flight time and capacity constraints. Secondly, considering that classical Hungarian algorithm was only suitable for small and medium-sized operations, it made the improvement of the calculation of efficiency matrix by making the maximum probability of the number of zero elements in the circle equal to the order of the efficiency matrix. Next, it constructed the cost function of the en-route by using the MIMIC queuing theory model. The function, which replaced the constant efficiency value in the efficiency matrix with a variable cost, made the efficiency matrix change with time and flow. Finally,it took part airspaces of China and the actual operational data of 2016 as examples. The results show that the algorithm can increase the access capacity by 8. 372% and the departure capacity by 8. 999%; In terms of delay optimization,it can reduce the average delay of each aircraft. In terms of algorithm performance, it has less iterations and less solution time than the classical Hungarian algorithm, and is more suitable for actual control operation. [ABSTRACT FROM AUTHOR]

Queue rules are an important component of the queuing system. They directly influence the operational efficiency of the queue system. This paper constructs the queue system simulation model with the complicated queue system as a research object. Further, considering the diversity of queue rules, we propose a genetic optimization algorithm based on queuing system simulation model, which is further modified. Analyzing the eye hospital actual data, it shows that comparing with first come first service (FCFS) rule, the queue rule designed in this paper can reduce more than half of the average hospital waiting patients and ensure the long-term stability of the system. This paper effectively combines the simulation model and the genetic optimization algorithm. It is of decisive significance to optimize queue rules of a complex system and improve the operational efficiency of a queue system. [ABSTRACT FROM AUTHOR]

ETC system used in the parking lot can effectively alleviate the traffic congestion, reduce vehicle traffic delay time and the average queue length, improve the overall lane capacity and service level. Based on the traffic flow characteristics of the parking lot, the vehicle arrival characteristics, vehicle transit process characteristics, the ETC, MTC lane capacities are analyzed. This paper presents an ETC lane capacity calculation model with MTC misappropriation rate. The M/G/K queuing theory model is used to analyze the MTC lane capacity, and the evaluation index and calculation method of parking service fee are set up. Through the actual survey of the parking lot calibration parameters and the use of Vissim simulation model, the traffic and ETC use rates in different proportions, the vehicle traffic parking lot lane average delay time are obtained. For the cases that ETC utilization rates are 30% , 50% , 70% and the traffic volume is 180 pcu/ha, optimal allocation schemes of ETC lane number are put forward, respectively, which can provide reference for the use of ETC system. [ABSTRACT FROM AUTHOR]

In order to solve the problem of low channel utilization and throughput because of burstiness on high-priority service accessing the satellite channel on account of long-range combat aircraft transmitting different priority service when it accessed satellite channel, the paper proposed a dynamic channel access strategy supporting service with priority for satellite communication network. The access strategy constructed the spectrum pool to share channel through introducing the cognitive radio technology. It set the high-priority service accessing channel freely, meanwhile, it ensured low priority business access the channel successfully through reserving spare channel. When there was some service not accessing channel, the service used the queuing model for access. The simulation results show that this strategy can effectively guarantee the successful ratio of high-priority service accessing channel, meanwhile, it effectively reduces the access delay. When the access strategy is applied, it can effectively reduce the impact of burstiness on high-priority service accessing the satellite channel, which leads to improving the comprehensive utilization rate of the satellite channel, reducing the access delay of low-priority service and guaranteeing the throughput on low-priority service accessing the satellite network. [ABSTRACT FROM AUTHOR]

Continuity of care has become an important indicator of the quality of healthcare gradually, however, patients are frequently blocked at the present stage in reality due to insufficient capacity at the next stage. Existing papers on such blocking problem assume that patients just wait in the blocking period, while filed survey in hospital prove that patients accept the service of next stage when they are blocked, and the corresponding service time between neighboring stages is related. Under the consideration of continuity of care, a queuing model and a more effective heuristic on estimating blocking probability are designed. Compared with simulation results and previous approaches, new heuristic is more accurate and stable. In addition, expanded applications of the new heuristic prove it's effectiveness in health care performance evaluation and resource allocation. [ABSTRACT FROM AUTHOR]

Copyright of Journal of Guangdong University of Technology is the property of Journal of Guangdong University of Technology and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

In order to solve closed-loop logistics network design problem under low-carbon economic environment, under carbon emission permits trade constraint, this paper used queuing theory to calculate the amount of storage of reverse logistics nodes. Considered transport costs, storage costs, construction costs, time punishment cost and carbon trading costs, it established a closed-loop logistics network design model which minimized the total cost. It designed the solving algorithm based on genetic algorithm. It verified the feasibility of logistics network design model and solution algorithm through case analysis. At last, it analyzed the effects of carbon emissions quota, the transaction price and time penalty on logistics network structure. The results show that the current carbon emissions trading environment will not change the structure of logistics network. [ABSTRACT FROM AUTHOR]

The traditional dynamic spectrum allocation (DSA) algorithms such as coloring based and game theory based algorithms had the shortcomings of high energy consumption and computational complexity, and thus were not suitable in practical. This paper proposed a high efficiency and low energy consumption DSA scheme based on queuing theory while PU and SUs coexist in the same CRN and each PU could be either active (ON) or inactive (OFF) in any given slot. Analytical expressions of some key network parameters including the average block probability and the break probability of secondary user under the proposed scheme was given. Besides, simulations are conducted to verify the effectiveness of the proposed scheme, with advantages lower energy consumption. [ABSTRACT FROM AUTHOR]

In the present paper, hyper-Erlang distribution (HErD) which is a restricted class of phase-type distribution (PH) with good versatility and analyticity and seven common distributions are used to fit the distribution of time interval between arriving passengers. From the comparison of a large number of experiments, the fitting effect of HErD is proven to be the best and the applicability of all distributions is given. Then, the fitting parameters of HErD are extracted to analyze the law of their variations, and it demonstrates that when the coefficient of variation is smaller than 1, the distribution is mixed by one exponential distribution (ED) and one 4-order Erlang distribution (ErD), in which there's a power functional relationship between the mixing ratio of ED and the square of coefficient of variation. However, when the coefficient of variation is larger than 1, the distribution is mixed by two EDs, in which there's an S functional relationship between the mixing ratio of one ED and square of coefficient of variation. As a result, the parameters of HErD are simplified into 2 scale parameters determined by the given long-term peak traffic and super- peak coefficient, and thus the PH distribution and PH queuing model can be introduced to the systemic planning and design of urban rail transit station, which will improve the rationality of the design. [ABSTRACT FROM AUTHOR]

Greedy geographic routing protocol greedy forwarding strategy, the system throughput decreased sharply when the business volume is large, the energy consumption of the network nodes seriously unbalanced, shorten the service life of the system. This paper presented a load balancing greedy forwarding strategy based on part state observable Markov decision theory, this mode set the queue length culling threshold value, it could effectively control node' s queue length at the transmission path, achieve the network load balancing by avoiding a heavily loaded node. The simulation results show that the algorithm reduces the end-to-end delay and data packets reduce loss, improve data transmission reliability and real-time on the network. [ABSTRACT FROM AUTHOR]

This paper considered the M/G/1 repairable queueing system with warm standby failure in which the "service station may fail in warm standby during idle period". By using the total probability decomposition technique and Laplace transform, we give the recursion expressions of the Laplace transform of the transient queue length distribution at any time t. And the recursion expressions of the steady state queue length distribution are also obtained. Meanwhile, we demonstrate stochastic decomposition structures of the steady state queue length distribution and the steady state waiting time. Finally, numerical examples are given to illustrate the effect of the warm standby failure parameter and repairable parameter on the expected additional queue length. [ABSTRACT FROM AUTHOR]

According to the arrival rate and service rate are both fuzzy numbers in queueing model, the method of fuzzy structuring element is applied to study membership function of characters index which is waiting time, queuing captain. The mutual conversion method is given between membership function and monotonic transformation function for the same fuzzy number. By making use of fuzzy structured element methods and fuzzy expansion principle, bivariate fuzzy number function transforms fuzzy number function with one variable. At the same time, monotonic transformation function of fuzzy number function with one variable is obtained. In generally, the characters index of queuing system index and arrival rate (service rate) are direct proportion (inverse proportion). So characters index which contains the arrival rate and service rate are both fuzzy numbers is described by bivariate fuzzy number function. In addition, monotonic transformation function of characters index may be obtained. Through the use of mutual conversion relationship between membership function and monotonic transformation function, membership function of characters index is produced. This paper's method is more simple and general by example comparison. [ABSTRACT FROM AUTHOR]

This paper discussed some job scheduling algorithms for Hadoop platform, and proposed a novel scheduling optimization algorithm based on multi-queue which provided differentiated services based on the type of jobs. Firstly, it assigned the different type of jobs to the opposite node according to its current load so as to increasing the resource efficiency of nodes. Secondly, it allowed the available resource of job queue to be occupied by the other job queues, meanwhile, the occupied resources could be reclaimed by preemptive strategies. Finally, it could prevent the ping-pong effect by the logical division of the shared queue list and the non-shared queue list. The experiments on Hadoop cloud computing platform compared the proposed algorithm with the default native algorithms. Results show that it has a significant improvement in execution efficiency and stability of job scheduling. [ABSTRACT FROM AUTHOR]

This paper considers the M/G/1 queueing system with N-policy and a replaceable repair facility in which the "repair facility subject to breakdowns" is introduced. By introducing into the "generalized repair time" of the service station, "generalized service time" of the customer and "generalized busy period" of the repair facility, we discuss the queueing indices of the system and the reliability indices of the service station. Meanwhile, the emphasis is upon obtained some reliability indices of the repair facility, such as the unavailability and the expected replacement number during (0,t] by using the total probability decomposition technique and the Laplace transform. Furthermore, some numerical examples are also given. Finally, we discuss the optimum policy N* and give an numerical example under the assumed cost structure model. [ABSTRACT FROM AUTHOR]

In this paper, the rule that multiple synchronous vacations of c repairmen is firstly introduced into the k/n(G) repairable system. Suppose that the working lifetime of each component, the repair time of each failed component and the vacation time of each repairman, has an exponential distribution with the rate λ(> 0), μ(> 0) and θ(> 0), respectively. By using quasi birth-death process and matrix-geometric solution method, we discuss the steady probability that the system is in every state, and some performance characteristics, including some reliability indices queueing indices such as the steady availability, the steady failure frequency of the system and the waiting repair time of the failed component. Furthermore, the following four special cases: 1) c = 1, θ → +∞∞; 2) c = 1, k = 1, θ → +∞; 3) c = 1, k = n, θ → +∞∞; 4) c = 1, k = n - 1, θ → +∞∞, are discussed. Finally, we give the numerical example under the case c = 2, n = 6, k = 3, λ = 1/10, θ + 1/5, θ = 1/2. [ABSTRACT FROM AUTHOR]

In this paper, the decision-making behavior is introduced into the queuing models, starting from the customer to maximize the interests, the customer optimal balking strategies in the Geom/G/1 (ES, MV) has been studied. On the premise of unobservable queue, based on a natural reward-cost structure, the overall profit function about the individual customer and the whole customers are constructed by a method of mean value analysis, then the customer equilibrium balking strategies and socially optimal balking strategies are analyzed and determined within the parameters of different ranges. At last, the conclusion is improved by numerical simulation. [ABSTRACT FROM AUTHOR]

This paper considers the discrete-time Geo/G/1 queueing system with delayed D-policy. By using the total probability decomposition technique, we study the transient and equilibrium properties of the queue length from the beginning of the any initial state, obtain both the recursion expressions of the z-transformation of the transient queue length distribution at any time n+ and the recursion expressions of the steady state queue length distribution, and then we give the stochastic decomposition of the queue length in equilibrium. The important relations between the steady state queue length distributions at different epochs (n-, n, n+) are discovered. Finally, by numerical examples we discuss the sensitivity of the steady state queue length distribution towards system parameters and illustrate the important value of the expressions of the steady state queue length distribution for calculating conveniently in the system capacity design. [ABSTRACT FROM AUTHOR]

To improve the applicability of the conflict delay model between left-turn vehicle and straight vehicle in the opposite direction at two-phase intersection, the conflict delay was studied on the basis of M3 distribution. M3 distribution of time headway for straight vehicle is more suitable than negative exponent distribution at signalized intersection. The queue delay of left-turn vehicle and the affect of the number of straight queue vehicles on conflict delay at the beginning of green were considered when M3 distribution was used in this paper. Then a new conflict delay model at two-phase intersection was put forward and it proved effective. The result shows that the conflict delay model improved closely meets with reality and it proved effective. It consummates the theory of existing conflict delay calculation and can provide the theoretical basis for setting up signal phases further. [ABSTRACT FROM AUTHOR]

The paper, with Fantawild Adventure Theme Park as a case study and adopting queuing theory in operational research, measures rational daily capacity of different items in the park according to tourists' tolerable longest waiting time, calculates rational daily capacity according to the proportional relation of tourists' waiting time, obtains rational yearly capacity according to the proportion of peak season days and tourist flows and makes a comparative analysis of the results and original design capacity. In the light of demand and supply contradictions and psychological feature of tourists' waiting, we propose implementing reposition mechanism during slack or peak seasons, introducing item spatial evacuation mechanism, initiating item capacity control management system and constructing queuing management network system in an attempt to offer references for the capacity management studies of theme parks. [ABSTRACT FROM AUTHOR]

Uncontrolled intersection vehicle delay is of great significance for evaluating the intersection service level, so that it is necessary to study a relative practical delay calculation method. This paper analyzes vehicles operating characteristic; divides the vehicle delay into waiting delay and acceleration-deceleration delay; uses probability theory to derive an iterative method which includes the average service time and service time variance of every approach ; describes the queue phenomenon of uncontrolled intersection with M/G/I queuing system; proposes the average waiting delay formula; and puts forward the acceleration-deceleration delay of uncontrolled intersection by using the method of signal intersection for reference. It is showed that the theoretically calculated values are close to observed values of delay that come from an uncontrolled intersection of shizi street and xuan-wei street in Harbin. [ABSTRACT FROM AUTHOR]

Copyright of China Textile Leader is the property of China Textile Information Center and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Copyright of Telecommunication Engineering is the property of Telecommunication Engineering and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)