Rough set theory, proposed by Pawlak, has been proved to be a mathematical tool to deal with vagueness and uncertainty in intelligent information processing. In this paper, we propose the concept of knowledge granulat...
详细信息
Rough set theory, proposed by Pawlak, has been proved to be a mathematical tool to deal with vagueness and uncertainty in intelligent information processing. In this paper, we propose the concept of knowledge granulation in interval-valued information systems, and discuss some important properties. From these properties, it can be shown that the proposed knowledge granulation provides important approaches to measuring the discernibility of different knowledge. It may be helpful for rule evaluation and knowledge discovery in interval-valued information systems.
In mathematics, various representations of real numbers have been investigated and all these representations are proved to be mathematically equivalent. Furthermore, it is known that all effective versions of these re...
详细信息
An adaptive output feedback control was proposed to deal with a class of nonholonomic systems in chained form with strong nonlinear disturbances and drift terms. The objective was to design adaptive nonlinear output f...
详细信息
An adaptive output feedback control was proposed to deal with a class of nonholonomic systems in chained form with strong nonlinear disturbances and drift terms. The objective was to design adaptive nonlinear output feedback laws such that the closed-loop systems were globally asymptotically stable, while the estimated parameters remained bounded. The proposed systematic strategy combined input-state-scaling with backstepping technique. The adaptive output feedback controller was designed for a general case of uncertain chained system. Furthermore, one special case was considered. Simulation results demonstrate the effectiveness of the proposed controllers.
In this work, for a wireless sensor network (WSN) of n randomly placed sensors with node density λ ∈ [1, n], we study the tradeoffs between the aggregation throughput and gathering efficiency. The gathering efficien...
详细信息
In this work, for a wireless sensor network (WSN) of n randomly placed sensors with node density λ ∈ [1, n], we study the tradeoffs between the aggregation throughput and gathering efficiency. The gathering efficiency refers to the ratio of the number of the sensors whose data have been gathered to the total number of sensors. Specifically, we design two efficient aggregation schemes, called single-hop-length (SLH) scheme and multiple-hop-length (MLH) scheme. By novelly integrating these two schemes, we theoretically prove that our protocol achieves the optimal tradeoffs, and derive the optimal aggregation throughput depending on a given threshold value (lower bound) on gathering efficiency. Particularly, we show that under the MLH scheme, for a practically important set of symmetric functions called perfectly compressible functions, including the mean, max, or various kinds of indicator functions, etc., the data from Θ(n) sensors can be aggregated to the sink at the throughput of a constant order Θ(1), implying that our MLH scheme is indeed scalable.
The present study utilized motor imaginary-based brain-computer interface technology combined with rehabilitation training in 20 stroke patients. Results from the Berg Balance Scale and the Holden Walking Classificati...
详细信息
The present study utilized motor imaginary-based brain-computer interface technology combined with rehabilitation training in 20 stroke patients. Results from the Berg Balance Scale and the Holden Walking Classification were significantly greater at 4 weeks after treatment （P 〈 0.01）, which suggested that motor imaginary-based brain-computer interface technology improved balance and walking in stroke patients.
Web services is a popular distributed systems technology and its effectiveness and efficiency rely badly on the underlying protocols. And web service protocols are designed in XML formats so the message structures wit...
详细信息
Some wafer fabrication processes are repeated processes, e.g. atomic layer deposition (ALD) process. For such processes, the wafers need to visit some processing modules for a number of times, which complicates the cy...
详细信息
Some wafer fabrication processes are repeated processes, e.g. atomic layer deposition (ALD) process. For such processes, the wafers need to visit some processing modules for a number of times, which complicates the cycle time analysis. This paper studies the cycle time analysis problem for such processes. With a Petri net model, it is found that such processes contain local cycles involving only the revisiting PMs and global cycles involving both revisiting and non-revisiting PMs. The process switches between these two types of cycles such that the process never reaches a steady state. Based on this finding, the mechanism underlying such processes is revealed and analytical expressions are given for the calculation of their cycle time. Illustrative examples are presented to show the application of the proposed approach.
We study the general scaling laws of the capacity for random wireless networks under the generalized physical model. The generality of this work is embodied in three dimensions denoted by (λ ∈ [1, n], n d ∈ [1, n]...
详细信息
We study the general scaling laws of the capacity for random wireless networks under the generalized physical model. The generality of this work is embodied in three dimensions denoted by (λ ∈ [1, n], n d ∈ [1, n], n s ∈ (1, n]). It means that: (1) We study the random network of a general node density λ ∈ [1, n], rather than only study either random dense network (RDN, λ = n) or random extended network (REN, λ = 1) as in the literature. (2) We focus on the multicast capacity to unify unicast and broadcast capacities by setting the number of destinations for each session as a general value n d ∈ [1, n]. (3)We allow the number of sessions changing in the range n s ∈ (1, n], rather than assume that n s = Θ(n) as in the *** derive the general lower bounds on the capacity for the arbitrary case of (λ, n d , n s ). Particularly, we show that for the special cases (λ = 1, n d ∈ [1, n], n s = n) and (λ = n, n d ∈ [1, n], n s = n), our schemes achieve the highest multicast throughputs proposed in the existing works.
In this paper, we proposed a novel network coding method called local-directed network coding to improve the throughput of the vehicular ad-hoc network. Different from other vehicular network coding methods, we consid...
详细信息
Web services composition (WSC) is the key techniques in its application. Dynamically selecting reliable Web services (WSs) becomes crucial to users. In fact, most works regard a Web service (WS) as the basic unit and ...
详细信息
暂无评论