Skip to Content

Instrukcja korzystania z Biblioteki

Serwisy:

Ukryty Internet | Wyszukiwarki specjalistyczne tekstów i źródeł naukowych | Translatory online | Encyklopedie i słowniki online

Translator:

Kosmos
Astronomia Astrofizyka
Inne

Kultura
Sztuka dawna i współczesna, muzea i kolekcje

Metoda
Metodologia nauk, Matematyka, Filozofia, Miary i wagi, Pomiary

Materia
Substancje, reakcje, energia
Fizyka, chemia i inżynieria materiałowa

Człowiek
Antropologia kulturowa Socjologia Psychologia Zdrowie i medycyna

Wizje
Przewidywania Kosmologia Religie Ideologia Polityka

Ziemia
Geologia, geofizyka, geochemia, środowisko przyrodnicze

Życie
Biologia, biologia molekularna i genetyka

Cyberprzestrzeń
Technologia cyberprzestrzeni, cyberkultura, media i komunikacja

Działalność
Wiadomości | Gospodarka, biznes, zarządzanie, ekonomia

Technologie
Budownictwo, energetyka, transport, wytwarzanie, technologie informacyjne

Journal of Computers

A geometric dimensional measurement system for form and position error detection of shearer rotational parts is developed in this paper with the error evaluation principle based on the minimum zone method. The system is characterized by using the charge coupled device (CCD) image sensor to capture image signals, and then using image processing techniques to extract useful signals from the image data signal. By focusing on image processing technology and error separation technology, the system can reduce the previous dependence on the baseline data collection, improve the accuracy and robustness of data collection, and simplify data collection platform.

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081232043209 2013/12/05 - 17:47

This paper proposes a new Accelerated Degradation Testing (ADT) life prediction method utilizing a multidimensional composite time series modeling procedure to take into account the integrated effect of system’s multiple performance parameters along with the random effect of environmental variables for equivalent damage in ADT. In this paper, system performance parameter ADT data are treated as a multidimensional composite time series model to predict system failure time. First, this paper decomposes these multiple performance parameters useful for ADT into three classes as trend, cyclical or random components, and describes them with a combined multi-dependent variable regressive model, hidden periodic model and multivariate auto-regression model. Second, according to standard practice, this paper assumes that the failure of such a system obeys a competing failure rule, that is, for an individual unit there is one primary controlling variable that will indicate failure even though others degrade they do not meet any failure criterion. Failure time at each test-stress level is predicted by using the best linear unbiased prediction of the multidimensional composite time series model. Finally, the reliability at use-stress level is estimated from a failure time distribution evaluation based on the failure time predictions at each test-stress level providing a relationship between failure time and test-stress levels.

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081232103215 2013/12/05 - 17:47

The paper introduces an isolated word speech recognition system in which the speech signal is acquired in real time. Half Raised-Sine function is applied to the MFCC parameters of the audio files, and improved DTW algorithm is implemented. Simulation results show that compared the conventional DTW with the improved DTW algorithm, the latter can obtain a better recognition rate and faster response time. Finally, the system was implemented on FPGA and yields satisfactory performance.

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081232163222 2013/12/05 - 17:47

Brand attachment is a relationship between the enterprise and consumers which is of a higher level and stronger strength than repeated purchase behavior. Virtual brand community provides a medium of exchange for brand information, experience and feeling for customers, can supply extra brand involvement and brand value, and is an important carrier of the establishment of brand attachment relationship. This paper explores and builds the model of relationship between characteristics of virtual brand community and brand attachment. The characteristics of virtual brand community include participation of community members, quality of information system and community service management etc. And through the survey of random samples of 145 Nokia BBS members, we have found that “community service management, community participation degree and frequency” has significantly positive influence on brand attachment. Therefore, to improve community management and to attract wide participation of users is an effective way of strengthening the brand attachment of consumers to Nokia.

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081232233229 2013/12/05 - 17:47

The paper discusses the connotation and constituent factors of the efficiency of social network (ESN). Applying the theory of structural holes, the study analyzes impact factors of ESN on the structural level, the resources level and the strategic level such as structural autonomy, nonredundancy and structural holes strategy.The effect mechanism model of ESN is established according to the active routes among constituent factors and impact factors. Data collected from 266 samples is used to validate the theoretical model by the structural equation model (SEM). In the light of the result of the operation, causation and interrelation among factors is researched. Based on this, the paper gives practice propositions of raising ESN.

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081232303237 2013/12/05 - 17:47

In PKC 2012, a public key encryption based on new multivariate quadratic assumptions is proposed. The compactness and security of the algorithm illumined us in applying it in proxy re-encryption scheme. In this paper, a novel unidirectional PRE scheme (NMQ-PRE) is constructed based on new multivariate quadratic assumptions. The new scheme is a formal PRE scheme and compact in cryptographic protocols. By applying the nature property of multivariate quadratic assumptions, NMQ-PRE is proved chosen ciphertext attack in standard model. Compared with the traditional PRE scheme based on RSA or pairings, NMQ-PRE is computationally efficient and simpler. Finally, a NMQ-PRE scheme for message block is built for application convenience, such as file sharing or mail forwarding.

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081232383242 2013/12/05 - 17:47

Audio mixing greatly degrades the watermarking security. Consequently, it is of importance to introduce mixing-attack-proof audio watermarking algorithms. This article investigates audio mixing attack. A randomized embedding spread spectrum audio watermarking algorithm is accordingly proposed to improve the watermark immunity to mixing attacks. First,  balanced modulation is introduced to get rid of the host signal interference and improve the correlation score stability. With more stable correlation scores, a randomized pseudo-noise embedding strategy is proposed to decrease the interference among different mixed components and bit error rate. To further improve the synchronization performances, a multiple synchronization strategy which simultaneously synchronizes different mixed components is also proposed. The experimental results indicate that the proposed algorithm shows a strong level immunity to mixing attacks and it can resist the mixing attack with up to 5 mixed components.

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081232433250 2013/12/05 - 17:47

Even though support vector clustering (SVC) is able to handle arbitrary cluster shapes effectively, its popularity is frequently degraded by highly intensive time complexity, poor label performance and even instability for efficiency. To overcome such problems, a fast and stable cluster labeling (FSCL) method is proposed. Based on stable equilibrium points, the FSCL first finds an appropriate division of support vectors. With a nonlinear sample sequence strategy presented here, the connected components profiled by support vectors (SVs) can be determined in terms of sampling all stable equilibrium point pairs; and the FSCL prefers a density centroid constructed by one subset of SVs, along with a stable equilibrium point, to represent a component while avoiding local optimization. Finally, the remaining data points can be assigned the label of the nearest components with respect to a weighted distance. Time complexity analysis and comparative experiments suggest that the FSCL improves both the efficiency and clustering quality significantly while guaranteeing stability.  

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081232513256 2013/12/05 - 17:47

Two-factor authentication using password and smart card could reduce the risk than the use of a password alone. Recently, Chen et al. proposed a two-factor remote user authentication protocol using password and smart card and provide the criteria of authentication protocols. They claimed their protocol is secure against certain known attacks. In this paper, the authors showed that Chen et al.’s scheme is still vulnerable to the off-line password guessing attack, privileged administrator attack, key control attack and lacks of forward security. To solve these security problems, we propose an efficient two-factor authentication and key agreement protocol.

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081232573263 2013/12/05 - 17:47

In order to improve the fire detection efficiency of large-scale and complex environment, the paper built a model of flame detection on visual selective attention method. In this model, saliency regions are obtained by Fourier spatial and temporal spectral residual, saliency objects are generated  by using a object detection method based on the weight of the color space clustering, and saliency points are found by difference block inverse probability .According to the  rules of flame’s color we can judge the risk of fire. The experimental results show that the flame detecting  method  can find different flames in wild  scenes ,and  it is very accurate, effective  and robust.

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081232643271 2013/12/05 - 17:47

with the wide application of probabilistic systems, the performance analysis for probabilistic system with model checking have attracted wide attention. For conditional probability formulae of complex parametric system, this paper proposes a counterexample generation method of conditional probability properties based on continuous time probabilistic model. We use continuous time Markov reward model with comprehensive feature representation ability as the system model need to be verified, give satisfiability probability solution algorithm of probabilistic computation tree logic multiple constraints until formulae path properties after model pretreatment, put forward the counterexample generation method of conditional probability on multiple constraints until formulae and give the example analysis. The theoretical analysis and example result show that the feasibility and validity of the method.

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081232723279 2013/12/05 - 17:47

An Intrusion detection system (IDS) is an important network security component that is used to monitor network traffic and detect attack attempts. A signature based intrusion detection system relies on a set of predefined signatures to detect an attack. Due to “zero-day” attacks (i.e. new unknown attacks) conventional IDS will not be able to detect these new attacks until the signatures are updated. Writing efficient new signatures to update the IDS signature database requires that the attack is first detected then studied and analyzed. These new rules should be general enough to include any modification of the attack pattern and specific so that normal traffic remains unblocked. Writing these signatures manually requires significant effort, time and knowledge to work properly. In this paper, a web based honeypot is used to generate SNORT intrusion detection system signatures (Rules) for HTTP traffic automatically. These new rules are integrated into the IDS signatures data base. We then verify the efficiency of the modified rules and show that the new rules are able to detect and block these attacks.

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081232803286 2013/12/05 - 17:47

Large scale scene rendering is essential to Visualization Navigation, and needs optimized organization strategy. Combining Kalman prediction and equal interval organization measure, a render data optimized organization strategy was proposed. Kalman prediction was adopt to estimate scheduling region, which optimizes rendering data organization. Organization data amount is decreased and visualization effect is meliorated.

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081232873292 2013/12/05 - 17:47

This paper describes a multi-grain parallel accelerate system for H.264 encoder on UltraSPARC T2 processor. This system integrates pipeline parallelism, frame-level, slice-level, macroblock-level data parallelism and SIMD technology.We use x264, an H.264 video encoder to implement our parallel accelerate system. Our implementation of parallel accelerate system achieves speedup between 10.1x and 11.5x and only causes 1.04x bit rate increase on UltraSPARC T2 processor.

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081232933297 2013/12/05 - 17:47

An interesting application of wireless MANETs that is emerging with a high potential for research and development is the inter-vehicle communication where nodes collect and distribute traffic information while moving in urban areas. Broadcasting is a key component to vehicular communication with the aim of high coverage and low medium consumption. Existing broadcasting schemes, however, result in redundancy and medium contention. In this paper a broadcasting scheme with intelligent neighbourhood sensing is produced and tested in two Vehicle Ad Hoc Network (VANET) contexts. Simulation results show that our scheme reduces the amount of unneeded transmissions through the medium even under high density with high traffic loads while maintaining comparable network coverage.

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081232983304 2013/12/05 - 17:47

Information is becoming a crucial if not the most important resource of the economy and the society at large. Information differs radically from other resources; for instance, it can be copied without cost, it can be communicated at the speed of light, and it can be destroyed without leaving traces. This poses new challenges for the protection of this new resource and of intellectual property in general. Information security, in particular cryptography, is an enabling technology that is vital for the development of the information society. Information Security for protecting information in potentially hostile environments is a crucial factor in the growth of information-based processes in industry, business, and administration. Cryptography is a key technology for achieving information security in communications, computer systems, electronic commerce, and in the emerging information society. After peer review, the guest editors accepted 25 final accepted papers from 102 online submissions for the special issue to reflect the current development of information security and cryptology technology.The first paper by Dongsheng Ning, Xiaoyan Xu, Yanping Yu, Xinxin Liu and Xiaoyan Wang is entitled “UWB-based Receiver Initiated MAC Protocol with Packet Aggregation and Selective Retransmission”. The authors proposes a UWB-based MAC protocol for wireless multimedia networks named as UWB-based Receiver initiated MAC protocol with Packet aggregation and Selective retransmission (URMPS), which can reduce long acquisition time and large overhead, and support more concurrent transmissions. The receiver initiated request, packet aggregation and selective retransmission are used to reduce synchronization acquisition time and overhead. The combination of mutually exclusive area and time-hopping (TH) code is to mitigate the interference caused by concurrent transmissions of multiple nodes. The simulation results run over NS-2 show that URMPS protocol performs better in terms of network throughput and delay compared to S-MAC.The second paper by Ting Han, Shoushan Luo, Hongliang Zhu, Yang Xin and Yong Peng is entitled “A Novel Trust Evaluation Model Based on Gray Clustering Theory for Routing Networks”. In this paper, by learning trust relationship from routing network, a trust evaluation model based on Grey Clustering Theory is proposed. The model adopts improved Bayes theory to evaluate the behavior trust. By introducing Grey Clustering Theory, the model clusters the recommend node to different trust classes according to recommend credibility and calculates the recommend weight to resistance the fraud recommends information from the deceptive node. Simulation results show that trust evaluation model based on Grey Clustering Theory cannot only effectively evaluate the routing node behavior but also has better anti-attack performance, anti-deception performance and higher attack node detection rate.The third paper by Wentao Cui, Kai Niu, Qian Wan, Weiling Wu is entitled “A Robust and Efficient Clustering Algorithm for Network MIMO System”. The authors propose a heuristic algorithm to dynamically bind together some base stations, which can adjust itself to the ever-changing interference condition. Through utilizing the predefined connection graph, the complexity of proposed scheme is reduced while retaining a similar performance to exhaustive searching algorithm. Compared with other previous clustering methods, the proposed one demonstrates its robustness against the unrealistic feedback channel and mostly matches the performance gain produced by exhaustive searching clustering strategy.The fourth paper by Mingzhi Cheng, Yanping Du, Yan Wang, Minchao Xi and Kaiguo Yuan is entitled “Video Watermarking Algorithm Based on Relative Relationship of DCT Coefficients”. The paper proposes a video watermarking algorithm based on relative relationship of DCT coefficients. By modification of coefficients on chosen positions, the robustness of watermark embedding is ensured. Meanwhile, as the relationship of coefficients remains unchanged, the quality of video is not affected. The analysis results show that the performance of proposed algorithm is better than the typical algorithms.The fifth paper by Dan Li, Peng Cao, Yucui Guo, and Min Lei is entitled “Time Weight Update Model Based on the Memory Principle in Collaborative Filtering”. In this paper, the change of users’ interests is considered as the memory process, and a time weight iteration model is designed based on memory principle. For a certain user, the proposed model introduces the time weight for each item, and updates the weight by computing the similarity with the items chosen in a recent period. In the recommend process, the weight will be applied to the prediction algorithm. Experimental results show that the modified algorithm can optimize the result of the recommendation in a certain extent, and performs better than traditional collaborative filtering.The sixth paper by Ming Chen, Shupeng Wang and Liang Tian is entitled “A High-precision Duplicate Image Deduplication Approach”. The paper proposes a high-precision duplicate image deduplication approach. The main idea of the proposed approach is eliminating the duplicate images by five stages including feature extraction, high-dimension indexing, accuracy optimization, centroid selection and deduplication evaluation. Experimental results demonstrate: in a real dataset, the proposed approach not only effectively saves storage space, but also significantly improves the retrieval precision of duplicate images.The seventh paper by Qinlong Huang, Zhaofeng Ma, Jingyi Fu, Xinxin Niu and Yixian Yang is entitled “Attribute Based DRM Scheme with Efficient Revocation in Cloud Computing”. The authors propose an attribute-based DRM scheme in cloud computing by combining the techniques of ciphertext-policy attribute-based encryption (CP-ABE) and proxy re-encryption (PRE). The users who satisfy the access policy can recover the content master key, and then obtain assistant key from the key server and decrypt the content in the proposed scheme. Furthermore, the proposed scheme achieves efficient attribute and user revocation by allowing the attribute authority to delegate the key server to refuse to issue the assistant key for the revoked users. The security and performance analyses indicate that the proposed scheme is secure, efficient, and privacy-preserving.The eighth paper by Chiqiang Xing, Julong Lan and Yuxiang Hu is entitled “Virtual Network With Security Guarantee Embedding Algorithms”. The paper firstly presents two security threats of virtual network and investigate them in depth, then proposes a novel virtual network with security guarantee that will take the trust value and security protection level as the new security constraints during its embedding. The simulation results show that the algorithm is effective.The ninth paper by Wei Wang, Feng Zeng, Honglin Yuan and Xintao Duan is entitled “Identifying Image Composites by Detecting Discrepancies in Defocus and Motion Blur”. The paper proposes a novel algorithm of detecting splicing in blurred images, which use blur parameters estimation through the cepstrum characteristics of blurred images in order to restore the spliced region and the rest of the image. The paper also develops a new measure to assist in inconsistent region segmentation in restored images that contain large amounts of ringing effect. Experimental results show efficacy of the proposed method even if the images to be tested have been noised with different levels. Compared with other existing algorithms, the proposed method has better robustness against Gaussian noise.The tenth paper by Wen’an Zhou, Yiyu Zhang, Pei Qin, Wei Chen and Xu Li is entitled “Joint Scheduling Algorithms for LTE-A CoMP System”. This paper investigates a novel type of Joint Scheduling algorithm for LTE-A CoMP system in a time and frequency selective fading channel. Two algorithms named SEB (Spectrum Efficiency Based) and JSB (Joint Score-Based) are proposed. Based on the spectrum efficiency optimization and the spectrum efficiency & users’ fairness co-optimization, the authors formulate the optimization problems and give out the greedy- algorithm-based solutions.  They try to select the best user and the best transmission method (CoMP or Non-CoMP) dynamically on every different time and frequency band to get better performance. From the simulation results, it is proven obviously superior to other CoMP scheduling algorithms, despite its overall throughput loss as compared with SEB.The eleventh paper by Yongli An, Yang Xiao, Dong Wang and Zhanlin Ji is entitled “Security Spectrum Auction Framework for Cognitive Radio Networks”. The paper proposes a security mechanism for the multi-user cognitive spectrum auction networks. This security auction framework is based on position information. The authors use this security spectrum auction framework to increase the total system revenue and prevent collusion. The simulation results show that the security spectrum auction framework can greatly improve spectrum efficiency.The twelfth paper by Li-hong Zhu and Quan Zhou is entitled “A Novel Framework for Robust Lossless Data Hiding”. The paper proposes a novel pragmatic framework for robust lossless data hiding (RLDH). It included pre-processing, side information storage, lossless data hiding (LDH) and RLDH, has better solved the specific problem in RLDH. Provide a new idea for the application of RLDH. In comparison with the existing RLDH methods, the proposed algorithm achieved better performance in terms of image quality and robustness.The thirteenth paper by Jianhua Wu, Fangfang Guo and Nanrun Zhou is entitled “Single-Channel Color Image Encryption Using the Reality-Preserving Fractional Discrete Cosine Transform in YCbCr Space”. A novel single-channel color image encryption algorithm is proposed, which utilizes the reality-preserving fractional discrete cosine transform in YCbCr space. The proposed algorithm enlarges the key space by employing the generating sequence as an extra key in addition to the fractional orders. Simulation results and security analysis demonstrate the proposed algorithm is feasible, effective and secure. The robustness to noise attack is also guaranteed to some extent.The fourteenth paper by Jianni Xushuai, Zhihong Zhou, Wen Qin, Qiongxi Jiang and Nanrun Zhou is entitled “Multi-Party Concurrent Signature Scheme Based on Designated Verifiers”. A new multi-party concurrent signature (MPCS) scheme based on designated verifiers is introduced, which features fairness and unforgeability based on the hardness of the Computational Diffie-Hellman (CDH) assumption in the random oracle model. In this scheme, each signer has the right to choose randomly his/her own individual keystone and retrieve all other individual keystones by the Extraction algorithm. If all signers release their own individual keystones, all signatures can be bound. There is not a decisive signer or a more power signer in selecting and releasing keystones. Therefore, the situation of keystones switched by dishonest signers can be effectively avoided and the fairness of the MPCS scheme is also apparently improved. The proposed MPCS scheme is proved to be secure and can counteract the adaptive chosen message attack.The fifteenth paper by Shushan Hu, Cunchen Tang, Riji Yu, Xiaojun Wang and Mei Lei is entitled “Scalable Distributed Address Assignment for Low Rate Wireless Personal Area Network”. In this paper, a Scalable Distributed Address Assignment Mechanism (SDAAM) is designed, which adopts adaptive approach to handle the variability present in the topology of wireless networks. In the proposed approach, every newly arrived node can be correctly configured regardless of the current network topology so that it can communicate with other nodes within the same network. Another important advantage of SDAAM is its handling of unexpected events which may arise due to migration or departure of nodes in the network. Detailed description about SDAAM is presented and its effectiveness and high flexibility is demonstrated based on the simulation program.The sixteenth paper by Zuowen Tan and Jianfeng Wang is entitled “Security Analysis on a Timestamp-based Remote User Authentication Scheme”. The paper analyzes that Awasthi et al.’s scheme suffers from offline password guessing attacks, password compromise to the server, impersonation attack and important message leakage attacks. In addition, Awasthi et al.’s scheme has poor reparability.The seventeenth paper by Hai Fang, Quan Zhou, and Kaijia Li is entitled “Robust Watermarking Scheme for Multispectral Images Using Discrete Wavelet Transform and Tucker Decomposition”. In this paper, a robust multispectral image watermarking technique based on the discrete wavelet transform (DWT) and the tucker decomposition (TD) is proposed. The core idea behind the proposed technique is to apply TD on the DWT coefficients of spectral bands of multispectral images. The experimental results on LANDSAT images show the proposed approach is robust against various types of attacks such as lossy compression, cropping, addition of noise etc.The eighteenth paper by Yi Sun, Xingyuan Chen and Xuehui Du is entitled “An Efficient Elliptic Curve Discrete Logarithm based Trapdoor Hash Scheme without Key Exposure”. An efficient trapdoor hash scheme without key exposure based on elliptic curve discrete logarithm is put forward and its security is analyzed, the scheme satisfies the five properties of trapdoor hash functions: effective calculation, trapdoor collision, collision resistance, key exposure resistance and semantic security. Through comparing and analyzing with the existing schemes, it shows that the proposed scheme, which has only multiplicative complexity and removes the operations of computing finite field element inverse, is more advantage in terms of safety and efficiency. Moreover, the scheme supports batch computation that it can greatly improve the efficiency of verification.The nineteenth paper by Aidi Zhang, Nanrun Zhou and Lihua Gong is entitled “Color Image Encryption Algorithm Combining Compressive Sensing with Arnold Transform”. A new color image encryption algorithm combining compressive sensing with Arnold transform is proposed, which can encrypt the color image into a gray image. Considering the dimensional reduction and random projection of compressive sensing, the authors utilize compressive sensing to encrypt and compress the three color components of color image simultaneously. The three encrypted and compressed color components’ dimensions are smaller than the original image, thus they can be grouped into a gray image, and then the gray image is scrambled by Arnold transform to enhance the security. The proposed algorithm can also be applied in the multiple-image encryption. The experimental results show the validity and the reliability of the proposed algorithm.The twentieth paper by Yongwei Wang, Kaiguo Yuan, Yunan Liu, Hongyong Jia and Wei Qiu is entitled “Multi-source Data Fusion Approach Based on Improved Evidence Theory”. A multi-source data fusion method based on dissimilarity matrix and evidence theory is proposed. First, using the weighted Euclidean distance, evidence dissimilarity matrix is constructed. Second, dissimilarity between the evidences is measured. Third, using dissimilarity matrix, supporting degree, credibility and weight of evidence are calculated, and the original evidences are modified. Finally, using the improved combination rule, the information fusion is completed. Experimental results show that proposed method is superior to the existing typical methods in accuracy, discrimination and accuracy of fusion results.The twenty-first paper by Jing Liu, Guo-sheng Xu, Da Xiao, Li-ze Gu and Xin-xin Niu is entitled “A Semi-supervised Ensemble Approach For Mining Data Streams”. A semi-supervised ensemble approach for mining data streams is presented in this paper. Data streams are divided into data chunks to deal with the infinite length. An ensemble classification model E is trained with existing labeled data chunks and decision boundary is constructed using E for detecting novel classes. New labeled data chunks are used to update E while unlabeled ones are used to construct unsupervised models. Classes are predicted by a semi-supervised model Ex which is consist of E and unsupervised models in a maximization consensus manner, so better performance can be achieved by using the constraints from unsupervised models with limited labeled instances. Experiments with different datasets demonstrate that the proposed method outperforms conventional methods in mining data streams.The twenty-second paper by Ya-li Liu, Xiao-lin Qin, Chao Wang and Bo-han Li is entitled “A Lightweight RFID Authentication Protocol based on Elliptic Curve Cryptography”. The paper proposes a robust authentication protocol based on Elliptic Curve Cryptography (ECC), which meets the requirement of resource-limited RFID systems. The proposed protocol achieves mutual authentication and possesses lightweight feature by reducing the computation cost over the tag end. Moreover, the proposed protocol possesses remarkable security properties in RFID system and the immunity against the possible malicious attacks as well as an excellent performance through the detailed security analysis. Performance evaluation and function comparison demonstrate that the proposed protocol makes a balance between cost and security in RFID authentication protocol. Compared to the previous relevant RFID authentication protocols, the proposed protocol improves efficiency, enhances robustness, which is well suitable for RFID tags with the scarceness of resources.The twenty-third paper by Wei Li, Zhi Tao, Dawu Gu, Yi Wang, Zhiqiang Liu and Ya Liu is entitled “Differential Fault Analysis on the MD5 Compression Function”. The paper proposes a new differential fault analysis on the MD5 compression function in the word-oriented random fault model. The simulating experimental results show that 144 random faults on average are required to obtain the current input message block. The proposed method not only increases the efficiency of fault injection, but also decreases the number of fault hash values. It provides a new reference for the security analysis of the same structure of the hash compression functions.The twenty-fourth paper by Jia Zhang, Dongfeng Yuan and Haixia Zhang is entitled “On Stochastic Cell Association Scheme Over Carrier Aggregated Heterogenous Networks”. In the paper, a cell association scheme based on stochastic control theory is explored to attain improved network performance in carrier aggregated HetNets. Simulation results have shown the advantages of the proposed scheme under different kinds of carrier deployments across multiple tiers.The twenty-fifth paper by Wunan Wan and Wang Suo is entitled “An Efficient MDS Array Code on Toleration Triple Node Failures in Storage System”. A new class of Maximum Distance Separable (MDS) array codes is presented for correcting triple storage failures, which is an extension of the double-erasure-correcting EVENODD code and is called the HDD-EOD code. The encoding and decoding procedures are described by geometrical line graph, which are easily implemented by soft hardware. The analysis shows that the HDD-EOD code provides better decoding performance and higher reliability compared to other popular codes. Thus the HDD-EOD code is practically very meaningful for storage systems.

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081127312734 2013/11/08 - 21:43

The media access control(MAC) protocol plays an important role in UWB-based wireless multimedia sensor networks (WMSNs). The problems of long acquisition time, large overhead and high collision probability have been addressed most when designing such MAC protocols. To reduce long acquisition time and large overhead, and to support more concurrent transmissions, we proposed a UWB-based MAC protocol for wireless multimedia networks named as UWB-based Receiver initiated MAC protocol with Packet aggregation and Selective retransmission (URMPS). The receiver initiated request, packet aggregation and selective retransmission are used to reduce synchronization acquisition time and overhead. The combination of mutually exclusive area and time-hopping(TH) code is to mitigate the interference caused by concurrent transmissions of multiple nodes. The simulation results run over NS-2 show that URMPS protocol performs better in terms of network throughput and delay compared to S-MAC. By incorporating all of above technologies into URMPS, the objective of improving the network throughput and reducing the network delay is achieved. Meanwhile, it can be used in the networks with moderate data traffic.

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081127352742 2013/11/08 - 21:43

The trust solutions to routing networks are faced with the evaluation of behavior trust and how to exactly evaluate the behaviors under the circumstance of existing recommend deceptive behavior such as providing fake or misleading recommendation. In this paper, by learning trust relationship from routing network, a trust evaluation model based on Grey Clustering Theory is proposed. The model adopts improved Bayes theory to evaluate the behavior trust. By introducing Grey Clustering Theory, the model clusters the recommend node to different trust classes according to recommend credibility and calculates the recommend weight to resistance the fraud recommends information from the deceptive node. Simulation results show that trust evaluation model based on Grey Clustering Theory cannot only effectively evaluate the routing node behavior but also has better anti-attack performance, anti-deception performance and higher attack node detection rate.

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081127432749 2013/11/08 - 21:43

In a practical network MIMO system, a limited number of transceivers form a super virtual cell, called cluster, to cooperatively transmit data to extremely improve the system performance in terms of sum capacity, user fairness, and coverage area. Clustering algorithm is thus identified as a key enabler to reap such enormous coordinated transmission gain. In this paper, a heuristic algorithm is proposed to dynamically bind together some base stations, which can adjust itself to the ever-changing interference condition. Through utilizing the predefined connection graph, the complexity of proposed scheme is reduced while retaining a similar performance to exhaustive searching algorithm. Compared with other previous clustering methods, the proposed one demonstrates its robustness against the unrealistic feedback channel and mostly matches the performance gain produced by exhaustive searching clustering strategy.

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081127502755 2013/11/08 - 21:43

A video watermarking algorithm based on relative relationship of DCT coefficients is proposed in this paper. By modification of coefficients on chosen positions, the robustness of watermark embedding is ensured. Meanwhile, as the relationship of coefficients remains unchanged, the quality of video is not affected. The analysis results shows that the performance of proposed algorithm is better than the typical algorithms.

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081127562762 2013/11/08 - 21:43

Collaborative filtering is the most widely used technology in the recommender systems. Existing collaborative filtering algorithms do not take the time factor into account. However, users’ interests always change with time, and traditional collaborative filtering cannot reflect the changes. In this paper, the change of users’ interests is considered as the memory process, and a time weight iteration model is designed based on memory principle. For a certain user, the proposed model introduces the time weight for each item, and updates the weight by computing the similarity with the items chosen in a recent period. In the recommend process, the weight will be applied to the prediction algorithm. Experimental results show that the modified algorithm can optimize the result of the recommendation in a certain extent, and performs better than traditional collaborative filtering.

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081127632767 2013/11/08 - 21:43

Deduplication has been widely used in backup systems and archive systems to improve storage utilization effectively. However the traditional deduplication technology can only eliminate exactly the same images, but it is unavailable to duplicate images which have the same visual perceptions but different codes. To address the above problem, this paper proposes a high-precision duplicate image deduplication approach. The main idea of the proposed approach is eliminating the duplicate images by five stages including feature extraction, high-dimension indexing, accuracy optimization, centroid selection and deduplication evaluation. Experimental results demonstrate: in a real dataset, the proposed approach not only effectively saves storage space, but also significantly improves the retrieval precision of duplicate images. In addition, the selection of the centroid images can meet the requirements of people’s perception. 

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081127682775 2013/11/08 - 21:43

The existing digital rights management (DRM) schemes in cloud computing introduce a heavy computation overhead on the content provider for key distribution. In this paper, we propose an attribute-based DRM scheme in cloud computing by combining the techniques of ciphertext-policy attribute-based encryption (CP-ABE) and proxy re-encryption (PRE). We first divide the content encryption key into two parts, content master key and assistant key. Then we enforce access policies based on attributes to distribute the content master key securely. Thus the users who satisfy the access policy can recover the content master key, and then obtain assistant key from the key server and decrypt the content. Furthermore, we achieve efficient attribute and user revocation by allowing the attribute authority to delegate the key server to refuse to issue the assistant key for the revoked users. The security and performance analyses indicate that the proposed scheme is secure, efficient, and privacy-preserving. 

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081127762781 2013/11/08 - 21:43

Network virtualization has been widely concerned as the new technology to remedy the current ossification Internet architecture. Previous virtual network (VN) embedding algorithms focus on optimizing the use of resources with regard to performance with constraints on virtual nodes and links. There are few researches to analyze the security threat to the virtual network. In this paper, we first present two security threats of virtual network and investigate them in depth. Then we propose a novel virtual network with security guarantee that will take the trust value and security protection level as the new security constraints during its embedding. The virtual network with security guarantee embedding algorithm is given at last, and the simulation results show that the algorithm is effective.

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081127822788 2013/11/08 - 21:43

Image manipulation has become commonplace in today's social context. One of the most common types of image forgeries is image compositing. In recent years, researchers have proposed various methods for detecting such splicing. Most prior approaches to detecting blur post-processing operation suffer from their inability to identify the spliced region when the background region contained nature blur. In this study, we propose a novel algorithm of detecting splicing in blurred images. We use blur parameters estimation through the cepstrum characteristics of blurred images in order to restore the spliced region and the rest of the image. We also develop a new measure to assist in inconsistent region segmentation in restored images that contain large amounts of ringing effect. Experimental results show efficacy of the proposed method even if the images to be tested have been noised with different levels. Compared with other existing algorithms, the proposed method has better robustness against gaussian noise.

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081127892794 2013/11/08 - 21:43

This paper investigates a novel type of Joint Scheduling algorithm for LTE-A CoMP system in a time and frequency selective fading channel. Two algorithms named SEB (Spectrum Efficiency Based) and JSB (Joint Score-Based) are proposed. Based on the spectrum efficiency optimization and the spectrum efficiency & users’ fairness co-optimization, we formulate the optimization problems and give out the greedy-algorithm-based solutions.  They try to select the best user and the best transmission method (CoMP or Non-CoMP) dynamically on every different time and frequency band to get better performance. It is proven by the simulation that 1) the best spectrum efficient can be achieved when SEB is used, especially when the channel quality is poor; 2) when taking the users’ fairness into account, JSB outperforms other scheduling algorithms. 

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081127952801 2013/11/08 - 21:43

Spectrum auction is an effective way to improve spectrum efficiency in cognitive networks. All traditional auction framework such as VCG price auction framework and second price auction framework face security risks. Collusion is the most important risk in multi-user cognitive networks. In this paper, we propose a security mechanism for the multi-user cognitive spectrum auction networks. This security auction framework is based on position information. We use this security spectrum auction framework to increase the total system revenue and prevent collusion. The simulation results show that the security spectrum auction framework can greatly improve spectrum efficiency. Besides, the auction process will be safer and fairer. In particular, when users are uniformly distributed, the proposed auction framework will obtain more seller revenue.

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081128022808 2013/11/08 - 21:43

Histogram-based lossless data hiding (LDH) has been recognized as an effective and efficient way in the field of data hiding. Recently, a LDH method using the statistical quantity histogram (SQH) has been a hotspot for its good performance, which can extract secret correctly even if stego-image has some extent distortion. However, this method has some shortcoming which limits its application in practice. For this purpose, we develop a novel framework, which consists of the following three components:1) In order to overcome the shortcomings of traditional SQH, proposing a pre-processing method to construct a suitable carrier for information embedding; 2)Applying LDH method to restore the bitmap information ,which will be used for reversibly recovering the host image; 3) Presenting a robust lossless hiding algorithm, which guarantees host images can be recovered losslessly in the case of stego-image remains intact, on the contrary, the secret information can also be resistant to a certain degree of JPEG2000 attacks. Thorough experiments over different kinds of images demonstrate the effectiveness of the proposed framework.

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081128092815 2013/11/08 - 21:43

A novel single-channel color image encryption algorithm is proposed, which utilizes the reality-preserving fractional discrete cosine transform in YCbCr space. The color image to be encrypted is decomposed into Y, Cb, and Cr components, which are then separately transformed by Discrete Cosine Transform (DCT). The resulting three spectra sequences, obtained by zig-zag scanning the spectra matrices, are truncated and the lower frequency coefficients of the three components are scrambled up into a single matrix of the same size with the original color image.  Then the obtained single matrix is encrypted by the fractional discrete cosine transform, which is a kind of encryption with secrecy of pixel value and pixel position simultaneously. The encrypted image is convenient for display, transmission and storage, thanks to the reality-preserving property of the fractional discrete cosine transform. Additionally, the proposed algorithm enlarges the key space by employing the generating sequence as an extra key in addition to the fractional orders. Simulation results and security analysis demonstrate the proposed algorithm is feasible, effective and secure. The robustness to noise attack is also guaranteed to some extent.

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081128162822 2013/11/08 - 21:43

Fair exchange signature is of importance in the field of the open-network-based security applications. A new multi-party concurrent signature (MPCS) scheme based on designated verifiers is introduced, which features fairness and unforgeability based on the hardness of the Computational Diffie-Hellman (CDH) assumption in the random oracle model. In this scheme, each signer has the right to choose randomly his/her own individual keystone and retrieve all other individual keystones by the Extraction algorithm. If all signers release their own individual keystones, all signatures can be bound. There is not a decisive signer or a more power signer in selecting and releasing keystones. Therefore, the situation of keystones switched by dishonest signers can be effectively avoided and the fairness of the MPCS scheme is also apparently improved. Our MPCS scheme is proved to be secure and can counteract the adaptive chosen message attack. 

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081128232830 2013/11/08 - 21:43

IEEE 802.15.4 protocol provides a low data rate and low energy consumption solution for wireless sensor networks which are the basis of the Internet of Things. However, the variable topology of wireless networks requires high flexibility and robustness to be achieved by network configuration mechanisms. In this paper, a Scalable Distributed Address Assignment Mechanism (SDAAM) is designed, which adopts adaptive approach to handle the variability present in the topology of wireless networks. In the proposed approach, every newly arrived node can be correctly configured regardless of the current network topology so that it can communicate with other nodes within the same network. Another important advantage of SDAAM is its handling of unexpected events which may arise due to migration or departure of nodes in the network. Detailed description about SDAAM is presented and its effectiveness and high flexibility is demonstrated based on the simulation program.

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081128312837 2013/11/08 - 21:43

In recent years, many password-based remote user authentication schemes have been presented. In 2003, Shen et al. proposed a timestamp-based password authentication scheme using smart cards. In their scheme, the server does not need to maintain any verification table and only stores a secret key. However, Awasthi et al. found that Shen et al.’s scheme is vulnerable to impersonation attacks with the stolen card. Awasthi et al. proposed an improved remote user authentication scheme based smart cards. Unfortunately, the improved version is still insecure. We show that Awasthi et al.’s scheme is vulnerable to offline password guessing attacks, password compromise to the server, impersonation attack and important message leakage attacks. In addition, Awasthi et al.’s scheme has poor reparability.

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081128382843 2013/11/08 - 21:43

Watermarking represents a potentially effective tool for the protection and verification of ownership rights in remote sensing images. Multispectral images (MSIs) are the main type of images acquired by remote sensing radiometers. In this paper, a robust multispectral image watermarking technique based on the discrete wavelet transform (DWT) and the tucker decomposition (TD) is proposed. The core idea behind our proposed technique is to apply TD on the DWT coefficients of spectral bands of multispectral images. We use DWT to effectively separate multispectral images into different sub-images and TD to efficiently compact the energy of sub-images. Then watermark is embedded in the elements of the last frontal slices of the core tensor with the smallest absolute value. The core tensor has a good stability and represents the multispectral image properties. The experimental results on LANDSAT images show the proposed approach is robust against various types of attacks such as lossy compression, cropping, addition of noise etc.

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081128442850 2013/11/08 - 21:43

The trapdoor hash function plays essential role in constructing certain secure digital signature, and signature scheme that composed by trapdoor hash function is widely applied in different fields. However, the key exposure problem of trapdoor hash scheme has brought great distress. In this paper, an efficient trapdoor hash scheme without key exposure based on elliptic curve discrete logarithm is put forward and its security is analyzed, the scheme satisfies the five properties of trapdoor hash functions: effective calculation, trapdoor collision, collision resistance, key exposure resistance and semantic security. Through comparing and analyzing with the existing schemes, it shows that the proposed scheme, which has only multiplicative complexity and removes the operations of  computing finite field element inverse, is more advantage in terms of safety and efficiency. Moreover, the scheme supports batch computation that it can greatly improve the efficiency of verification.

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081128512856 2013/11/08 - 21:43

A new color image encryption algorithm combining compressive sensing with Arnold transform is proposed, which can encrypt the color image into a gray image. Considering the dimensional reduction and random projection of compressive sensing, we utilize compressive sensing to encrypt and compress the three color components of color image simultaneously. The three encrypted and compressed color components’ dimensions are smaller than the original image, thus they can be grouped into a gray image, and then the gray image is scrambled by Arnold transform to enhance the security. The proposed algorithm can also be applied in the multiple-image encryption. The experimental results show the validity and the reliability of the proposed algorithm.

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081128572863 2013/11/08 - 21:43

The classical evidence theory can result in paradox in the process of information fusion. To resolve this problem, a multi-source data fusion method based on dissimilarity matrix and evidence theory is proposed. First, using the weighted Euclidean distance, evidence dissimilarity matrix is constructed. Second, dissimilarity between the evidences is measured. Third, using dissimilarity matrix, supporting degree, credibility and weight of evidence are calculated, and the original evidences are modified. Finally, using the improved combination rule, the information fusion is completed. Experimental results show that new method is superior to the existing typical methods in accuracy, discrimination and accuracy of fusion results. 

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081128642872 2013/11/08 - 21:43

There are many challenges in mining data streams, such as infinite length, evolving nature and lack of labeled instances. Accordingly, a semi-supervised ensemble approach for mining data streams is presented in this paper. Data streams are divided into data chunks to deal with the infinite length. An ensemble classification model E is trained with existing labeled data chunks and decision boundary is constructed using E for detecting novel classes. New labeled data chunks are used to update E while unlabeled ones are used to construct unsupervised models. Classes are predicted by a semi-supervised model Ex which is consist of E and unsupervised models in a maximization consensus manner, so better performance can be achieved by using the constraints from unsupervised models with limited labeled instances. Experiments with different datasets demonstrate that our method outperforms conventional methods in mining data streams.

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081128732879 2013/11/08 - 21:43

The security and privacy of the tag carrier has become the bottle neck of Radio Frequency Identification (RFID) system development further. In this paper, we propose a robust authentication protocol based on Elliptic Curve Cryptography (ECC), which meets the requirement of resource-limited RFID systems. Our protocol achieves mutual authentication and possesses lightweight feature by reducing the computation cost over the tag end. Moreover, the proposed protocol possesses remarkable security properties in RFID system and the immunity against the possible malicious attacks as well as an excellent performance through the detailed security analysis. Performance evaluation and function comparison demonstrate that our protocol makes a balance between cost and security in RFID authentication protocol. Compared to the previous relevant RFID authentication protocols, our protocol improves efficiency, enhances robustness, which is well suitable for RFID tags with the scarceness of resources. 

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081128802887 2013/11/08 - 21:43

The MD5, proposed by R. Riverst in 1992, is a widely used hash function with Merkle-Damgard structure. In the literature, many studies have been devoted to classical cryptanalysis on the MD5, such as the collision attack, the preimage attack etc. In this paper, we propose a new differential fault analysis on the MD5 compression function in the word-oriented random fault model. The simulating experimental results show that 144 random faults on average are required to obtain the current input message block. Our method not only increases the efficiency of fault injection, but also decreases the number of fault hash values. It provides a new reference for the security analysis of the same structure of the hash compression functions. 

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081128882894 2013/11/08 - 21:43

Triggered by the ever growing demand of wireless data rate, modern cellular network is in the middle of a paradigm shift. By deploying small cells underlaying current macrocells, a heterogeneous network (HetNet) architecture is formed with great potentials to improve system capacity and reduce overall energy consumption in the mean time. However, such layout is challenged by the co-tier and crosstier interference and uneven traffic loads due to the massive deployment of small cells. In this work, a cell association scheme based on stochastic control theory is explored to attain improved network performance in carrier aggregated HetNets. Simulation results have shown the advantages of the proposed scheme under different kinds of carrier deployments across multiple tiers.

http://ojs.academypublisher.com/index.php/jcp/article/view/jcp081128952901 2013/11/08 - 21:43