{"title":"Generic Construction of Certificate-Based Encryption","authors":"Yang Lu, Jiguo Li, Junmo Xiao","doi":"10.1109/ICYCS.2008.11","DOIUrl":"https://doi.org/10.1109/ICYCS.2008.11","url":null,"abstract":"In Eurocrypt 2003, Gentry introduced a new public key encryption paradigm called certificate-based encryption (CBE) to overcome the drawbacks of the conventional PKI and the identity based encryption (IBE). CBE provides an efficient implicit certification mechanism and allows a periodical update of certificate status while eliminating third-party queries for the certificate status. In addition, it also solves the key escrow problem and key distribution problem in IBE. In this paper, we propose a method to achieve generic CBE constructions from PKE and IBE, which are provably CCA-secure in the random oracle model. Compared to previous generic constructions, the security requirement of the primitive encryption schemes in our method is much weaker.","PeriodicalId":370660,"journal":{"name":"2008 The 9th International Conference for Young Computer Scientists","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122548208","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Novel Statistic-based Relaxed Grid Resource Reservation Strategy","authors":"Peng Xiao, Zhi-gang Hu, Xi Li, Liu Yang","doi":"10.1109/ICYCS.2008.117","DOIUrl":"https://doi.org/10.1109/ICYCS.2008.117","url":null,"abstract":"In grid environments, advance reservation mechanism is to provide reliable resource co-allocation and scheduling for applications. However, excessive advance reservation will bring about many negative effects for system's performance, such as lower resource utilization and higher rejection rate. To mitigate these negative effects of advance reservation, a relaxed reservation strategy is proposed, in which the reservation admission criteria is more relaxing than that of conventional reservation. The strategy is based on the facts that grid applications tend to overestimate reservation duration to ensure their completion. In the proposed relaxed reservation strategy, reservation manager might accept those reservations that are overlapping with existing ones. Experimental results show that the strategy can bring about remarkably higher resource utilization and lower rejection rate at the price of a slightly increasing of reservation violations.","PeriodicalId":370660,"journal":{"name":"2008 The 9th International Conference for Young Computer Scientists","volume":"310 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122777571","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Novel Approach for Classifying Human Cancers","authors":"Shuqin Wang, Chunbao Zhou, Y. Wu, Jianxin Wang, Chunguang Zhou, Yanchun Liang","doi":"10.1109/ICYCS.2008.215","DOIUrl":"https://doi.org/10.1109/ICYCS.2008.215","url":null,"abstract":"Various researches have shown that machine learning approaches can be successfully used to detect and classify cancer tissue samples by their gene expression patterns. In this paper, an entropy-based improved k-TSP method (Ik-TSP) is proposed. We calculate the entropy for each gene based on the gene expression profile, and then find the best threshold of entropy depending on LOOCV accuracy for each gene expression dataset. Finally we select key genes for each gene expression dataset according to the best threshold and use them to implement Ik-TSP method to classify the cancer. Compared to 7 cancer classifiers mentioned in this paper in 9 binary public gene expression datasets of human cancers, the Ik-TSP method achieves an average LOOCV accuracy of 95.39%, and improves 3% better than the k-TSP method. Simulated experimental results show that the proposed Ik-TSP method is applicable to classify human cancers.","PeriodicalId":370660,"journal":{"name":"2008 The 9th International Conference for Young Computer Scientists","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122921978","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Lightweight Snapshot-based Algorithm for Software Transactional Memory","authors":"Xiaoqiang Zhang, Lin Peng, Lunguo Xie","doi":"10.1109/ICYCS.2008.180","DOIUrl":"https://doi.org/10.1109/ICYCS.2008.180","url":null,"abstract":"Software transactional memory (STM) is a generic synchronization construct that enables automatic conversion of correct sequential objects into correct nonblocking concurrent objects. We investigate a novel lightweight snapshot-based validation and conflict detection (LSVCD) algorithm for STM that provide scaling and strong consistency. In LSVCD, each transaction maintains a local snapshot version variable used to indicate the snapshot state it views. Whether the snapshot of memory observed by a transaction is consistent or not can be verified quickly by comparing lsv with Global Version Number. LSVCD can greatly reduce the cost of read and write operations, conflict detection and validation of STM. Transactions proceed without interference or contention unless they access overlapping data sets. Experimental results show that LSVCD is simple and quite competitive, and gains a notably improvements of performance over existing STM implementation.","PeriodicalId":370660,"journal":{"name":"2008 The 9th International Conference for Young Computer Scientists","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122553943","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Chaos Study of the Lamprey Neural System via Improved Small Dataset Method","authors":"Yunlong Li, Pingjian Zhang","doi":"10.1109/ICYCS.2008.428","DOIUrl":"https://doi.org/10.1109/ICYCS.2008.428","url":null,"abstract":"This paper is concerned with the locomotion property of the Lamprey neural system that is modeled by the winnerless competition (WLC) networks. An improved small dataset method for computing the largest Lyapunov exponent is proposed and applied to chaos detection. Application to classical non-linear systems shows that the new algorithm not only works effectively but also achieves better accuracy than the Wolf method. The new algorithm is then employed to study the chaotic properties of the Lamprey neural system. In addition, phase portrait for small perturbation on initial states of the dynamic system is also drawn to aid in chaos determination. Simulation results demonstrate that under some mild external stimulus, the Lamprey neural system exhibits chaos, when external stimulus continues increasing, the Lamprey neural system could return back to steady state.","PeriodicalId":370660,"journal":{"name":"2008 The 9th International Conference for Young Computer Scientists","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122607965","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Exact Heuristic Algorithm for Traveling Salesman Problem","authors":"Dong-mei Lin, Xiangbin Wu, Dong Wang","doi":"10.1109/ICYCS.2008.43","DOIUrl":"https://doi.org/10.1109/ICYCS.2008.43","url":null,"abstract":"Natural properties of stochastic searching strategies and operations in metaheuristic algorithms have important influence on convergence performance of various metaheuristic algorithms. Through similarity analysis to two kinds of metaheuristic algorithms, exact heuristic algorithm based on branch-and-cut is put forward according to change trend of similarity between two arbitrary high-quality solutions. In the meanwhile, two conditions were given in this paper because efficiency of branch-and-cut algorithm is closely allied to complexity of solved object. New heuristic algorithm can help metaheuristic algorithms finding superior solutions than other heuristic algorithms, and accelerate metaheuristic algorithms convergence. Simulation experiments show that new heuristic algorithm is efficacious.","PeriodicalId":370660,"journal":{"name":"2008 The 9th International Conference for Young Computer Scientists","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114298325","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Application of Image Recognition Technology based on Fractal Dimension for Diesel Engine Fault Diagnosis","authors":"Yanping Cai, Shu-Chen Cheng, Yanping He, Ping Xu","doi":"10.1109/ICYCS.2008.265","DOIUrl":"https://doi.org/10.1109/ICYCS.2008.265","url":null,"abstract":"A new method of diesel engine fault diagnosis that uses image recognition technology based on fractal dimension is proposed. The Wigner-Ville distributions of six kinds of vibration acceleration signals which are acquired from diesel engine cylinder head are calculated by time-frequency analysis, and a series of time-frequency gray images can be obtained from above distributions by image processing. According to the theory of fractal, we can obtain a group of fractal texture characteristic parameters from these gray images. At the same time, in the process of pattern recognition, we adopt BP neural network to classify these image texture fractal characteristic parameters, and then we can identify diesel engine valve gap abnormal status. Experiment results show that the proposed method can distinguish different texture characteristic of time-frequency gray images which are generated from different valve gap status of diesel engine, and this method is worth for further study.","PeriodicalId":370660,"journal":{"name":"2008 The 9th International Conference for Young Computer Scientists","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116745601","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Fengliang Qi, Beihong Jin, Haibiao Chen, Zhenyue Long
{"title":"An Efficient Primitive Subscription Matching Algorithm for RFID Applications","authors":"Fengliang Qi, Beihong Jin, Haibiao Chen, Zhenyue Long","doi":"10.1109/ICYCS.2008.365","DOIUrl":"https://doi.org/10.1109/ICYCS.2008.365","url":null,"abstract":"Pub/Sub systems can facilitate monitoring and managing objects for RFID applications. To fully support RFID applications, Pub/Sub systems should provide the means of subscribing RFID tags and the corresponding efficient matching algorithm. This paper provides the management mechanism and matching algorithm for primitive subscriptions whose specification permits to subscribe RFID codes. Our approach organizes clustered subscriptions into a covering forest and then executes primitive subscription matching on the basis of multi-level predicate indexes. Experiments are also conducted to evaluate the performance and overhead of our algorithm.","PeriodicalId":370660,"journal":{"name":"2008 The 9th International Conference for Young Computer Scientists","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116997281","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Particle Clonal Genetic Algorithm Using Sequence Coding for Solving Distribution Network Reconfiguration","authors":"Yemei Qin, Ji Wang, W. Gui","doi":"10.1109/ICYCS.2008.326","DOIUrl":"https://doi.org/10.1109/ICYCS.2008.326","url":null,"abstract":"To handle massive binary-coding infeasible solutions in distribution network reconfiguration, a sequence coding is presented. A loop is a gene and the switch sequence in the loop is the gene value. To resolve mutation probability and slow later-period convergence in clonal genetic algorithm(CGA), particle clonal genetic algorithm(PCGA) is proposed. It builds particle swarm algorithm (PSO) mutation operator, and makes up premature convergence of PSO and blindness of CGA. It ensures evolution direction and range based on historical records and swarm records. Global optimal solution is found with fewer generations and shorter searching time. IEEE69 example shows that the method can save calculation time and promote search efficiency obviously.","PeriodicalId":370660,"journal":{"name":"2008 The 9th International Conference for Young Computer Scientists","volume":"22 20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128536416","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Service Authenticity in P2P File-Sharing","authors":"Lingli Deng, Yeping He, Ziyao Xu","doi":"10.1109/ICYCS.2008.132","DOIUrl":"https://doi.org/10.1109/ICYCS.2008.132","url":null,"abstract":"The open and autonomous nature of peer-to-peer (P2P) file-sharing invites the phenomenon of widespread decoys and free-riding. Reputation systems are introduced to assure data authenticity and to stimulate collaboration. We argue that, in a reputation-aided P2P file-sharing system, the faithful delivery of an authentic file depends on the authenticity of the file, its reputation (either the objective reputation of itself or the subjective reputation of its providing peer) and its index. Hence, we propose to add integrity control for the reputation and indexing storage/computation processing to enhance the authenticity of the resultant reputation values and service indexes. An integrity model is presented to articulate necessary mechanisms and rules for integrity protection. The existing proposals for P2P reputation and indexing are analyzed, accordingly.","PeriodicalId":370660,"journal":{"name":"2008 The 9th International Conference for Young Computer Scientists","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128595620","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}