We study the multicast capacity for hybrid wireless networks consisting of ordinary wireless nodes and base stations under Gaussian Channel model, which generalizes both the unicast capacity and broadcast capacity for...
详细信息
ISBN:
(纸本)9781424444816
We study the multicast capacity for hybrid wireless networks consisting of ordinary wireless nodes and base stations under Gaussian Channel model, which generalizes both the unicast capacity and broadcast capacity for hybrid wireless networks. We simply consider the hybrid extended network, where the ordinary wireless nodes are placed in the square region A(n) with side-length n~(1/2) according to a Poisson point process with unit intensity. In addition, m additional base stations (BSs) serving as the relay gateway are placed regularly in the region A(n) and they are connected by a high-bandwidth wired network. Three broad categories of multicast strategies are proposed in this paper. According to the different scenarios in terms of m, n and n_d, we select the optimal scheme from the three categories of strategies, and derive the achievable multicast throughput based on the optimal decision.
An approximate dynamic optimization method is proposed for a kind of semiconductor assembly job-shop scheduling based on swarm intelligence. In this method, a heuristic swarm stochastic optimization technology, i. e.,...
详细信息
An approximate dynamic optimization method is proposed for a kind of semiconductor assembly job-shop scheduling based on swarm intelligence. In this method, a heuristic swarm stochastic optimization technology, i. e., the particle swarm optimization is adopted to find an optimal operation. sequence and the schedule strategy having the minimal total make-span (TMS) in its admissible sequence space. Meanwhile, a discrete dynamic programming approach is integrated to particle fitness evaluation. The numerical example based on the simplified produce model and the actual produce data is studied to illustrate the effectiveness of the method for job-shop scheduling.
Nowadays complex information system's integrated formal models of function verification and performance evaluation lack properties constraint about space aspect. This paper presents an integrated verification mode...
详细信息
Nowadays complex information system's integrated formal models of function verification and performance evaluation lack properties constraint about space aspect. This paper presents an integrated verification model atsFPM by defining a space requirement function over the states of the considered information system. The patterns of paths which are based on regular expressions is proposed in order to specify the functional specifications. The syntax and semantic of the model atsFPM is defined. A conversion product model is obtained by the combination of the system model and the automaton of the pattern of paths which expresses the functional specifications. The verification of the model atsFPM is tackled by the performance verification technique of Markov Reward Model. Experimental results show that the atsFPM model and its verification approach can satisfy the modeling of information system and verification of functional and performance specifications.
One of the most promising advantages of Web service technology is the possibility of creating value-added services by combining existing ones. A major challenge is how to discover and select concrete service according...
详细信息
One of the most promising advantages of Web service technology is the possibility of creating value-added services by combining existing ones. A major challenge is how to discover and select concrete service according to user requirements. This paper addresses the topic of service discovery composite Web services. The main feature is that we take the process model as well as service profile into account. Firstly, the process models of Web services are translated into Petri nets. Based on this, we propose a service matchmaking algorithm, via comparing the functionality compatibility and process consistency, thus leading to more accurate matchmaking.
In this paper, we present the parallel implementation of the traffic microsimulation PMTS (Parallel Microscopic Traffic Simulation) focusing on the performance issues. The parallelization of PMTS is domain decompositi...
详细信息
ISBN:
(纸本)9781427629807
In this paper, we present the parallel implementation of the traffic microsimulation PMTS (Parallel Microscopic Traffic Simulation) focusing on the performance issues. The parallelization of PMTS is domain decomposition, which means that each processor of the PC cluster is responsible for a different geographical area of the simulation region. We describe the transportation network graph partition and information exchange between domains. We demonstrate the time cost mathematics models for PMTS: the vehicle generation, vehicle position calculation, and vehicle information exchange between domains. The workload balance is obtained by adjusting the boundary lines according to the relative load of adjacent subnetworks. All these works have been proved to be effective when PMTS put into use and the experiment results are also provided which match our analysis.
Based on the fundamental evaluation index system of intelligent optimization, a type of optimization dynamics evaluation mode for particle swarm algorithm is presented here. The mode is used for general optimization p...
详细信息
Based on the fundamental evaluation index system of intelligent optimization, a type of optimization dynamics evaluation mode for particle swarm algorithm is presented here. The mode is used for general optimization performance and particles'population dynamics. In the evaluation mode, primary indexes include optimum value, population dynamic aggregation, population center convergence and population diversity. Numerical optimization simulation based on several benchmarks is studied, and the typical population dynamic results of primary indexes show that the proposed optimization dynamics evaluation mode is effective.
To reduce the computational complexity, a novel method of standard Hough transform (SHT), named probabilistic convergent Hough transform (PCHT), is proposed in this paper. PCHT avoids unnecessary cost of SHT in comput...
详细信息
To reduce the computational complexity, a novel method of standard Hough transform (SHT), named probabilistic convergent Hough transform (PCHT), is proposed in this paper. PCHT avoids unnecessary cost of SHT in computation by intermittently detecting several points of a line through fast convergence and in memory by using a one-dimensional accumulator. Considering the inevitable error initiated by PCHT, Sensitivity of detection method is introduced to limit the error rate of detecting a fake line within the tolerable range. Experiment is done in various circumstances. Results and comparison between several line detections and PCHT are shown next, and further discussion is given in the final.
Accurate visual object tracking through long sequences is a challenging task since object's appearance changes and complex motion happens. We present mixture motion model and incorporate observation model within t...
详细信息
Accurate visual object tracking through long sequences is a challenging task since object's appearance changes and complex motion happens. We present mixture motion model and incorporate observation model within the Monte Carlo framework to achieve robust visual tracking. The mixture motion model which employs important history motion information of the target is built according to a motion measurement matrix to model the target's transition state. Meanwhile, the incorporate observation model is established by introducing SVM classification scores into normal tracking observation model. A particles filter's implementation with these mixture models is demonstrated, which leads to robust tracking results, especially in occlusion and complex scene.
A novel trust model for P2P networks, namely RETM, a Recommendation Evidence based Trust Model, is presented in this paper. It solves some problems, for instance, not invalidly aggregating incompatible recommendation ...
详细信息
A novel trust model for P2P networks, namely RETM, a Recommendation Evidence based Trust Model, is presented in this paper. It solves some problems, for instance, not invalidly aggregating incompatible recommendation information and dealing with uncertainty of information in the reputation-based P2P trust model. Before combining the evidences, RETM will filter out noisy recommendation information, and moreover the method makes RETM more robust. In addition a feedback-based probabilistic searching algorithm is proposed to find the recommendation information, which improves the searching success rate and lowers the network traffic. Theoretical analyses and experimental results show that, compared to the current some trust models, the proposed model RETM has advantages in modeling dynamic trust relationship and aggregating recommendation information, moreover, is more robust on trust security problems and more advanced in successful transaction rate.
In this paper, we perform Chinese text classification using n-gram text representation on TanCorp which is a new large corpus special for Chinese text classification more than 14,000 texts divided into 12 classes. We ...
详细信息
暂无评论