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.
Recent years have witnessed the dramatically increased interest in face generation with generative adversarial networks (GANs). A number of successful GAN algorithms have been developed to produce vivid face images to...
详细信息
This paper aims at developing a clustering approach with spectral images directly from CASSI compressive measurements. The proposed clustering method first assumes that compressed measurements lie in the union of mult...
详细信息
A critical function of wireless sensor networks (WSNs) is data gathering. While, one is often only interested in collecting a relevant function of the sensor measurements at a sink node, rather than downloading all th...
详细信息
ISBN:
(纸本)9781424499199
A critical function of wireless sensor networks (WSNs) is data gathering. While, one is often only interested in collecting a relevant function of the sensor measurements at a sink node, rather than downloading all the data from all the sensors. This paper studies the capacity of computing and transporting the specific functions of sensor measurements to the sink node, called aggregation capacity, for WSNs. It focuses on random WSNs that can be classified into two types: random extended WSN and random dense WSN. All existing results about aggregation capacity are studied for dense WSNs, including random cases and arbitrary cases, under the protocol model (ProM) or physical model (PhyM). In this paper, we propose the first aggregation capacity scaling laws for random extended WSNs. We point out that unlike random dense WSNs, for random extended WSNs, the assumption made in ProM and PhyM that each successful transmission can sustain a constant rate is over-optimistic and unpractical due to transmit power *** derive the first result on aggregation capacity for random extended WSNs under the generalized physical model. Particularly, we prove that, for the type-sensitive perfectly compressible functions and type-threshold perfectly compressible functions, the aggregation capacities for random extended WSNs with n nodes are of order Θ ((log n) -β/2-1 ) and Θ (((log n) -β/2 )/(log log n)), respectively, where β >; 2 denotes the power attenuation exponent in the generalized physical model.
There are wafer fabrication processes in cluster tools that require revisiting. It is shown that swapping is efficient in operating a dual-arm cluster tool. For dual-arm cluster tools with wafer revisiting, if a swap ...
详细信息
There are wafer fabrication processes in cluster tools that require revisiting. It is shown that swapping is efficient in operating a dual-arm cluster tool. For dual-arm cluster tools with wafer revisiting, if a swap strategy is applied, it forms a three wafer periodical process with three wafers completed in each period. Such a period contains three cycles in a revisiting process and another three cycles in non-revisiting process. Hence, analysis and scheduling of dual-arm cluster tools with wafer revisiting become very complicated. In this work, a Petri net model is developed to describe the operations of such tools. Based on it, it is found that if a swap strategy is applied to a dual-arm cluster tool with wafer revisiting, it is always in a transient state. A systematic method is presented to analyze its performance.
Person re-identification, as the basic task of a multi-camera surveillance system, plays an important role in a variety of surveillance applications. However, the current mainstream person re-identification model base...
详细信息
Convolution neural networks (CNNs) have succeeded in compressive image sensing. However, due to the inductive bias of locality and weight sharing, the convolution operations demonstrate the intrinsic limitations in mo...
详细信息
For Dubois rough fuzzy sets, the membership of the lower or upper approximations is defined as the elements memberships' infimum or supsmum in equivalent class. As a result of not considering the elements whose me...
详细信息
For Dubois rough fuzzy sets, the membership of the lower or upper approximations is defined as the elements memberships' infimum or supsmum in equivalent class. As a result of not considering the elements whose memberships are between the minimum and maximum, some useful information of these elements may be lost in the information processing. The paper presents a new operator of rough fuzzy sets that every element's membership in equivalent class is taken into account. Based on the new operator, algebra properties are put forward and rough fuzzy membership is defined. Moreover, the paper presents accurate degree, classified quality, dependence degree and attribute reduction algorithm. At last, an example proves that the algorithm is efficient.
In this paper we explore non-orthogonal multiple access (NOMA) in millimeter-wave (mmWave) communications (mmWave-NOMA). In particular, we consider a typical problem, i.e., maximization of the sum rate of a 2-user mmW...
详细信息
We study the asymptotic networking-theoretic multicast capacity bounds for random extended networks (REN) under Gaussian channel model, in which all wireless nodes are individually power-constrained. During the transm...
详细信息
We study the asymptotic networking-theoretic multicast capacity bounds for random extended networks (REN) under Gaussian channel model, in which all wireless nodes are individually power-constrained. During the transmission, the power decays along path with attenuation exponent α >; 2. In REN, n nodes are randomly distributed in the square region of side length √n. There are n s randomly and independently chosen multicast sessions. Each multicast session has n d + 1 randomly chosen terminals, including one source and n d destinations. By effectively combining two types of routing and scheduling strategies, we analyze the asymptotic achievable throughput for all n s = ω(1) and nd. As a special case of our results, we show that for n s = Θ(n), the per-session multicast capacity for REN is of order Θ(1/√n d n) when nd = O(n/(log n) a+1 ) and is of order Θ(1/n d · (log n) -n/2 ) when n d = Ω(n/log n).
暂无评论