Automatic discovery of part-whole relations is a fundamental problem in the area of information extraction. In this paper, we present an unsupervised approach to learning lexical patterns from online encyclopedia for ...
详细信息
Reducing the flow latency is of great importance in traffic management, which benefits both service providers and end users. Routing design and flow scheduling are typical ways to improve the flow transmission efficie...
详细信息
Reducing the flow latency is of great importance in traffic management, which benefits both service providers and end users. Routing design and flow scheduling are typical ways to improve the flow transmission efficiency. However, existing studies usually consider them separately, due to the complexity of joint consideration. Here, we propose a latency-aware routing scheme with bandwidth assignment in the Software Defined Networks, which can efficiently reduce the flow latency with a moderate complexity, to combine the routing and scheduling together.
Communication privacy and latency perceived by users have become great concerns for delay-sensitive Internet services. Existing anonymous communication systems either provide high anonymity at an expense of prolonged ...
详细信息
Communication privacy and latency perceived by users have become great concerns for delay-sensitive Internet services. Existing anonymous communication systems either provide high anonymity at an expense of prolonged latency (e.g., mix-net), or offer better real-time performance by sacrificing the ability against traffic analysis attacks (e.g., Onion Routing). The emerging Software-Defined Networking (SDN) introduces additional challenges to communication anonymity, due to the existence of a centralized controller that has a global view of the entire network traffic. In this paper, we propose a new anonymous communication scheme for delay-sensitive services under SDN scenarios, which can simultaneously protect communication privacy and reduce the end-to-end latency. A self-adaptive method based on the mix-net framework is designed to dynamically modify the waiting threshold of mix nodes, which helps to reduce the communication latency. In order to preserve the degree of anonymity, the self-adaptive method is incorporated with a random walking strategy for packets forwarding. Both theoretical analysis and experimental results prove that our scheme provides a moderate degree of anonymity and effectively reduces the latency derived from mix-net by up to 50%.
The matrix factorization algorithms such as the matrix factorization technique (MF), singular value decomposition (SVD) and the probability matrix factorization (PMF) and so on, are summarized and compared. Based on t...
详细信息
Recently, researchers have discovered unexpected bumps in the detection rate curve of yet another steganographic scheme (YASS). We refer to this abnormal phenomenon as non-monotonic security performance. This paper fi...
详细信息
Conventional change detection approaches are mainly based on per-pixel processing,which ignore the sub-pixel spectral variation resulted from spectral *** for medium-resolution remote sensing images used in urban land...
详细信息
Conventional change detection approaches are mainly based on per-pixel processing,which ignore the sub-pixel spectral variation resulted from spectral *** for medium-resolution remote sensing images used in urban landcover change monitoring,land use/cover components within a single pixel are usually complicated and heterogeneous due to the limitation of the spatial ***,traditional hard detection methods based on pure pixel assumption may lead to a high level of omission and commission errors inevitably,degrading the overall accuracy of change *** order to address this issue and find a possible way to exploit the spectral variation in a sub-pixel level,a novel change detection scheme is designed based on the spectral mixture analysis and decision-level *** spectral mixture model is selected for spectral unmixing,and change detection is implemented in a sub-pixel level by investigating the inner-pixel subtle changes and combining multiple composition *** proposed method is tested on multi-temporal Landsat Thematic Mapper and China–Brazil Earth Resources Satellite remote sensing images for the land-cover change detection over urban *** effectiveness of the proposed approach is confirmed in terms of several accuracy indices in contrast with two pixel-based change detection methods(*** vector analysis and principal component analysis-based method).In particular,the proposed sub-pixel change detection approach not only provides the binary change information,but also obtains the characterization about change direction and intensity,which greatly extends the semantic meaning of the detected change targets.
This paper is aimed at extraction of ontology concept from four diagnostics information. Due to the diversity and complexity of the four diagnostics information, there are still some difficulties when practicing ontol...
详细信息
Discriminant neighborhood embedding (DNE) algorithm is one of supervised linear dimensionality reduction methods. Its nonlinear version kernel discriminant neighborhood embedding (KDNE) is expected to behave well on c...
详细信息
Discriminant neighborhood embedding (DNE) algorithm is one of supervised linear dimensionality reduction methods. Its nonlinear version kernel discriminant neighborhood embedding (KDNE) is expected to behave well on classification tasks. However, since KDNE constructs an adjacent graph in the original space, the adjacency graph could not represent the adjacent information in the kernel mapping space. By introducing hidden space, this paper proposes a novel nonlinear method for DNE, called hidden space discriminant neighborhood embedding (HDNE). This algorithm first maps the data in the original space into a high dimensional hidden space by a set of nonlinear hidden functions, and then builds an adjacent graph incorporating neighborhood information of the dataset in the hidden space. Finally, DNE is used to find a transformation matrix which would map the data in the hidden space to a low-dimensional subspace. The proposed method is applied to ORL face and MNIST handwritten digit databases. Experimental results show that the proposed method is efficiency for classification tasks.
Coding practice is the most efficient way in learning of programming related courses. In this paper, we propose a programming related courses' E-learning platform based on online judge. This platform is designed a...
详细信息
For mining useful data from mass data generated by Internet of things, analyses shortages of the traditional Apriori algorithm which has a lower mining efficiency and occupies the larger memory space. So, MapReduce mo...
详细信息
暂无评论