In this paper, a SVD based multicell MU-MIMO uplink transmission and joint detection (JD) scheme is presented. It can decompose the MU-MIMO system into SU-MIMO channel and then the simplified JD algorithm can be performed at the cooperative eNBs. The pairwise error probability (PEP) of each link is derived and the system capacity with perfect CSI is analyzed. Simulation results show that this scheme is a feasible transmission solution for multicell MU-MIMO uplink.
Attribute reduction is crucial in concept lattice studies, and its significant theoretical foundation is the judgment of consistent set. Based on improved theorems for judgment of consistent set and the definition of attribute reduction, a new algorithm for attribute reduction is proposed. Comparing to original one, the new algorithm is simple and efficient.
When clustering data of high dimension, most of the existing algorithms cannot reach people's expectation due to the curse of dimensionality. In high-dimensional space, clusters are often hidden in subspaces of the attributes. The distribution of clusters is dense in the subspace and each attribute of the subspace. So objects belonged to the same subspace have similar density on each attribute. Based on this idea a novel subspace clustering algorithm SC2D is proposed. By introducing the definition of dimensional density, SC2D puts objects into the same cluster if they have similar dimensional density. And then clusters are separated from each other if there are more than one cluster in the same subspace. Experiments on both artificial and real-world data have demonstrated that SC2D algorithm can achieve desired results.
In order to extract all the billiard objects from Snooker videos, an effective algorithm of the billiard segmentation is proposed in this paper. This method is divided into the follow two steps: first, we use an automatic segmentation method of local peak edges to extract the Snooker table, this step is mainly served for the image preprocessing; and then is the detection of video objects. Through image preprocessing, morphological processing and clustering, we can achieve the candidate areas of billiard balls. With the color space conversion between HSV and RGB and histogram equalization in digital image processing, the billiard areas of accurate detection are derived from the characteristics of the candidate areas. Experimental results are represented in three dimensional reconstruction scenes.
A novel method is proposed for speech model, which is used for speech transformation and speech recognition. This method divides segmentations of a speech into an adaptive segment, in which its speech wave is integrated and has approximate periods. A speech is divided into voiced speech and unvoiced speech by voice activity detection, which is widely used in speech dividing. This speech model mainly deals with sonant, which is divided into approximate periodical waves in our currently work. Segment's parameter contains primary periods' parameter, secondary periods' parameter and the length of the segment. Primary periodic signal's expandability is to form speech segmentation. The paper also gives some results of experiments to show the effectively of the model. The accuracy and few coefficients of model are due to using Morlet wavelet to extract primary periods.
Collaborative filtering techniques are currently being successfully used in personalized recommendation system, in order to obtain more accurate information for users, this paper constructs domain ontology, utilizing the mapping of domain ontology and the concept in user interest ontology, constructs users interest ontology, explores user interest model, and then produce recommendation based on the similarity calculations of user interest ontology and user ontology.
Searching on the Internet today can be compared to dragging a net across the surface of the ocean. While a great deal may be caught in the net, there is still a wealth of information that is deep, and therefore, missed. Deep Web sources store their content in searchable databases that only produce result dynamically in response to a direct request. In this paper, we proposed an automatic classification algorithm of Deep Web sources based on iterative self-organizing data analysis techniques algorithm (ISODATA) in order to facilitate users to browse this valuable information.
Open and anonymous communication networks like Peer-to-peer (P2P) systems promise to eliminate the scalability concerns and central vulnerability points. But P2P systems are often insecure and provide an opportunity for viruses and distributed denial of service (DDoS) activities to spread due to the fact that there is no method to verify the trustworthiness of users and shared files. To make such P2P networks more resilient against the attacks, this paper proposes the use of reputation systems in which the trust will cover both data and users. Therefore, the reputation-based P2P security can lead to auto-adaptive secure operating systems that automatically change the trust levels of the user and the data that the user provides.
In this paper, a simple and robust zero-watermarking algorithm using balanced multiwavelet transform is proposed. The latter transform we use achieves simultaneous orthogonality and symmetry without requiring any input prefiltering or border extending. This reduction in computational complexity makes the transform a good candidate for real-time watermarking implementations. Novelty of the system lies in 1) the use of a new multiwavelet suitable for watermarking, 2) the proposition of the average subimage of low frequency in multiwavelet domain, 3) zero watermarks generated from the average subimage in multiwavelet domain. The original image is transformed using the new multiwavelet and flags are created with the secret key. Then the extracted flags using the same key are compared with the original ones to confirm the copyright of digital products. Theoretical analysis and simulation results show that the proposed watermarking system has excellent robustness against various watermark attacks including slightly geometric modifications with the high quality of the watermarked image.
Iris recognition is one of the most reliable methods of biometrics personal identification. Poor quality iris image will be rejected by recognition system, which will result in the failure of recognition. Therefore iris image quality assessment is very essential to the iris recognition system. In this paper, a multiple step algorithm of iris image quality assessment is proposed to distinguish two kinds of poor quality images, i.e. defocus and occlusion. Experimental results show that the proposed algorithm is fast and efficient for iris image quality assessment.
In the last decade, particle swam optimization (PSO) become popular for its simple concept, easy implementation and effectiveness. In order to enhance the performance of PSO, this paper presents an improved PSO variant, called IPSO, by hybridization of standard PSO and a mutation scheme. Simulation studies on ten famous benchmark problems show that IPSO surpasses standard PSO in all test cases.
Spider is a program for obtaining internet resources. For monitoring spider visits to your website, Decision Tree, Bayesian Network and other Spider Detection Techniques (SDT) are proposed. At present, the evaluation of these detection techniques mainly relies on manual analysis of web log data to calculate the recall rate and precision rate. In order to avoid subjectivity caused by manual analysis, an Evaluation Method based on Trap detection technique of spider (EMT) is proposed in this paper which can evaluate the detecting capability of SDT. The traps layout information on the website and the process information of users accessing website resources are used to calculate relevant parameters, indicators and error range of EMT according to the binomial distribution theory. The Experiment results indicate that EMT and the artificial analysis method have consistent conclusion.
In the environment of the human working life, all kinds of unexpected events often occurred, to improve the emergency response capabilities and establish fast and efficient electronic incident command system is to be completed by all levels of government affairs, in which the security of information exchange is one of the key issues; in view of this, the needs of information exchange in the emergency system were introduced; the transfer process and encryption of information exchange business and the problem of multi-digital signature to be solved in the emergency system was analyzed; the information exchange model and its affairs which must be achieved in the emergency system was given; the detailed design of a multi-user information signature algorithm, authentication algorithm, and an undeniable sign of the algorithms in each agreement, the algorithm is the agreement of the relevant parameters and algorithms calculation complexity was analyzed. The secure transmission problem of information exchange in the emergency system was resolved; the efficiency and reliability of emergency command system was improved.
Multiple Input Multiple Output-Orthogonal Frequency Division Multiplexing (MIMO-OFDM) has become one of the key technologies for the B3G & 4G broadband wireless communications. As MIMO could increase the capacity of the wireless communication system considerably compared with Single Input Single Output (SISO) and OFDM could obtain good performances in multipath frequency-selective fading channels, we combine them together with the Space-Time Block Coding (STBC) scheme and the Nakagami-m fading model. The Nakagami-m (0.5 ≤ m <; ∞) fading model, covering a series of channel conditions in different fading parameters, brings greater flexibility and accuracy than normal, logistic and other distributions. From the simulation figures, we can draw the conclusion that the scheme could better performances of the system's bit error rate (BER) and capacity greatly, thus improving the whole system's performances.
Web server log files registered browsing patterns of users, in order to extract users with similar accessing patterns, providing personal service for them. In this paper, a new method of analysis on web log is proposed. A User-URL matrix is created and a weighted matrix is introduced, additionally, a multimarker propagation algorithm based on weighted matrix cluster is proposed. The experiments show that this algorithm has high-performance and reliability to cluster users and pages in web log mining.
In a variety of text classification algorithm, KNN is a competitive one with simple implementation and high efficiency. However, with the expansion of the size of the text, the runtime of KNN will grow rapidly that cannot be afford. In this paper, we improve the KNN by introducing the kd-tree storage structure and reducing the sample space through the sample clustering methods. And experiment shows that the runtime of improved KNN algorithm reduce apparently.
Forest-fire hazard is very serious, so at home and abroad they pay great attention to the study of forest-fire, such as the prevention of forest-fire. Processing the forest-fire image of detected by using the technology of pseudo-color to improve the amount of useful information is one of the most important of forest-fire detection. By a full studying of pseudo-color coded to the forest-fire image, it introduces a gray-scale-color transformation algorithm which is based on the local histogram equalization. The algorithm achieved a highlight of important characteristics of forest-fire and an attenuation of unimportant characteristics, it also converts the grayscale images of the forest-fire detector to the color images which are more suitable for our identification. The algorithm improves the accuracy of our analysis of forest-fire.
The energy moments based on Discrete Cosine Transform are presented as an efficient feature descriptor. Based on this, a new approach for image retrieval using integrated annular color moments and energy moments features is proposed. The experimental results show that the proposed method is not only very robust in terms of scale and rotation invariance but also efficient.
