Advanced Materials Research
Vols. 356-360
Vols. 356-360
Advanced Materials Research
Vols. 354-355
Vols. 354-355
Advanced Materials Research
Vols. 347-353
Vols. 347-353
Advanced Materials Research
Vol. 346
Vol. 346
Advanced Materials Research
Vol. 345
Vol. 345
Advanced Materials Research
Vols. 343-344
Vols. 343-344
Advanced Materials Research
Vols. 341-342
Vols. 341-342
Advanced Materials Research
Vol. 340
Vol. 340
Advanced Materials Research
Vol. 339
Vol. 339
Advanced Materials Research
Vol. 338
Vol. 338
Advanced Materials Research
Vol. 337
Vol. 337
Advanced Materials Research
Vols. 335-336
Vols. 335-336
Advanced Materials Research
Vols. 332-334
Vols. 332-334
Advanced Materials Research Vols. 341-342
Paper Title Page
Abstract: In this paper, we present a selection decode-and- forward (S-DF) cooperation scheme where only the “best” relay, which is selected as the one who can decode correctly its received signal from source node and can achieve the highest instantaneous signal-to-noise ratio (SNR) at the destination, participates in relaying the source’s signal. We derive a novel exact closed-form expression of outage probability for the S-DF scheme over Rayleigh fading channels, based on which an asymptotic outage analysis is further presented in high SNR regime, showing that given M potential relays, M+1 diversity order is achieved by source node. Consequently, the proposed S-DF scheme with the best relay selection can achieve the full diversity at the expense of just two channels only regardless of the number of candidate relays.
509
Abstract: We proposed a novel decoding algorithm for Analog Codes (Reed-Solomon Codes over complex numbers), the syndrome repairing (SR) algorithm, for gross error correction in signal transmission. Simulations show that, if the number of gross errors is not too large and the amplitude of background noise is small enough (compared to the amplitude of gross errors), the SR algorithm recovers the original signal with nearly the same accuracy as if no gross errors occur upon transmission. In particular, if the transmission is background-noise-free, then the recovery is exact.
514
Abstract: Because of the special position of electric power industry in national economy and social life, electric power information security has been given particular attention. In recent years, the security defense of Electric Power Information System has been all under the principle of security area classification, which applies different security defense measures for the information systems in different security level. However, because of lacking theory guidance, the recent method of security area classification is not in accord with the requirements of real production and management, and security threaten occurs at times. In order to meet the requirements of real production and management and the needs of security area classification defense in Electric Power Information System, based on the theory of network business security, a new security area classification model of Electric Power Information System has been proposed, and the access rules of the information transmission and sharing between different security areas have also been proposed. The new security area classification model can provide theoretical basis for security area classification in Electric Power Information System, and can deal with the conflict between the requirements of real production and the needs of information security.
519
Abstract: OFDM is the core technique of the fourth generation mobile communication technology. In this paper ,a OFDM communication system model is designed base on the analysis of the basic principles of OFDM and the dynamic simulation for the system model is implemented by use of Simulink. The simulation results indicated that the system error performance is related to the choice of RS coding and the selection of LS/MMSE channel estimation means can affect the performance also, the BER performance of OFDM system can be greatly improve by selecting the encoding and channel estimation method properly.
524
Abstract: In this paper, a new algorithm named TCSP is proposed to mine sequential patterns with different time constraints. It scans the database into memory and constructs time-index sets for efficient processing. It mines the desired sequential patterns without generating any candidates. We have evaluated the new algorithm with the well-known GSP algorithm and the DELISP algorithm for various datasets and constraints. The comprehensive experiments show that the TCSP algorithm works better and it has good scalability.
530
Abstract: With the development of technology concerning face recognition, it has aroused great attentions from related scientists and is envisioned to be widely applied in various fields in the future. In this paper we are going to describe an effective way for detecting face in the statistic images. The proposed method will firstly detect face region via using the color model, which has been described in my previous paper [1] so as to locate the candidate pixels. Then we analyze the gray value distribution of candidate pixels to segment a more accurate region. Finally the face region is likely to be obtained after the exclusion of superfluous skin region.
535
Abstract: Although the majority of images are recorded in color format nowadays, computer vision research is still mostly restricted to luminance-based feature detection. In this paper, we combine the features based on the color tensor with photometric invariant derivatives to arrive at photometric invariant features. The combination of the photometric invariance theory and tensor based features allows for detection of a variety of features such as photometric invariant edges, corners. Experiments show that the proposed features are robust to scene incidental events and perform well in real-world scene.
540
Abstract: Traditional Graph-Cut algorithm traverses all pixels at each time of computation; consequently, it consumes a lot of time. This paper improves on Graph-Cut algorithm based on characteristics of Watershed. The basic theory is to insert watershed into Graph-Cut to conduct pre-segmentation on image. With watershed, image is divided into regions which have different sizes and pixel color similarities. Images processed by watershed algorithm are converted into weighted undirected graph; and then translate energy function on pixel into that graph on separate regions after pre-segmentation. Performance of test programs has proved that the improved Graph-Cut algorithm can increase workload of user interaction mark effectively. As long as workload considered in the interaction process, improved Graph-Cut algorithm can achieve ideal segmentation effect even on complex background.
546
Abstract: Software quality measurement is closely connected with process and product. With measurement and analysis on software process data, improvement and control on software can be achieved. Effective process performance model plays key role in understanding and controlling. Introduction of GQM model into software measurement process can achieve controllability and testability of software process. GQM uses organization target as measurement index to achieve measurement of software process quantitative. The core idea of CMM/CMMI is to build fact-based management and CMM/CMMI software process management is built on the basis of software measurement. Combining with CMM/CMMI measurement idea, GQM model was expanded to achieve a kind of improved process performance model.
550
Abstract: The aim of this paper is to present a novel physically-based method for curve deformation. It is an energy-based method considering stretching energy, bending energy and twisting energy of the curve. By combining the space deformation and energy-based technique, the curve deformation is converted into an optimization with linear constraints. Experimental results illustrate that the presented model is a shape-preserving method, which can produce realistic curve deformation.
555