{"title":"Research and Design of Educational Resource Information Center for Investors Based on J2EE","authors":"K. Cao, Xiaoyu Zhu","doi":"10.1109/ICYCS.2008.167","DOIUrl":"https://doi.org/10.1109/ICYCS.2008.167","url":null,"abstract":"Nowadays, the education for investors is becoming more and more important throughout nations, and China also wants to put it forward into the national educational system. With the development of IT, the original ways of education has changed greatly. This article presents a loose coupling and easily integrated way to build educational resource information center for investors (ERICI) against the problems of isomerism, mutual manipulation, and expansibility of investors educational application (IEA). This application will peel off general service for investors from different IEAs, and band them together in the aspects of interface, operation and data, therefore to share and optimize the information resource.","PeriodicalId":370660,"journal":{"name":"2008 The 9th International Conference for Young Computer Scientists","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129690105","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":"Hash Function Construction Based on Chaotic Coupled Map Network","authors":"Yurong Song, Guoping Jiang","doi":"10.1109/ICYCS.2008.134","DOIUrl":"https://doi.org/10.1109/ICYCS.2008.134","url":null,"abstract":"Based on the Chaotic Coupled Map Network (CCMN), a novel scheme for constructing hash functions is proposed in this paper, which transforms messages and establishes a mapping form transformed messages to the parameters of CCMN. Through chaotic iterations, quantization and exclusive-or (XOR) operations, the algorithm can construct hash value with arbitrary length. The analysis and simulation results show that the CCMN-Hash algorithm is extremely sensitive to initial values and coupled factor, and the CCMN-Hash also has good properties, such as excellent one-way, confusion and diffusion and strong collision resistance.","PeriodicalId":370660,"journal":{"name":"2008 The 9th International Conference for Young Computer Scientists","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115976441","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":"Integrated Application of Project Cases in Programming Course","authors":"Rongchun Chen, Li Xue","doi":"10.1109/ICYCS.2008.417","DOIUrl":"https://doi.org/10.1109/ICYCS.2008.417","url":null,"abstract":"With rapid development of information technology, the integration of special disciplines and information technology becomes more and more obvious. As for computer teaching to non-computer majors in universities, it has become the urgent demand to serve different specialties and concentrate on application. In recent years, our university has done a lot of new exploration and reform on computer education, and accumulated some experience, one of which is attempting to introduce case teaching into programming courses. According to the characteristic of object-oriented programming subject and the features of the case-based teaching, the dissertation researches into the case-based teaching in the teaching on object-oriented programming with the action research method so as to provide experience and suggestion for the program design teaching, which promotes development of the computer teaching and enriches the teaching methods.","PeriodicalId":370660,"journal":{"name":"2008 The 9th International Conference for Young Computer Scientists","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134206334","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":"Enforcement of Spatial Separation of Duty Constraint","authors":"Weihe Chen, Zhu Tang, Shiguang Ju","doi":"10.1109/ICYCS.2008.223","DOIUrl":"https://doi.org/10.1109/ICYCS.2008.223","url":null,"abstract":"Securing access to data in location-based services and mobile applications pose interesting security requirements against spatially aware access control systems. In particular, the permissions assigned to users depend on their physical positions in a reference space. When a session is established in a spatial regionby users, some spatial constraints related to thissession will be triggered and control the session process during its life automatically. There are often multiple mutually exclusive spatial roles (MESR)constraints that can enforce the same spatial separation of duty policy (SSoD). Although the different MESR constraints can enforce the same effect on the same session, we have found that the different MESR constraints are varying greatly in the enforcement efficiency. The more precise the MESR sets are defined for enforcing an SSoD policy, the less overhead the system is suffered. In this paper, we argue that enforcement of SSoD policies is realized by specifying minimal MESR constraints. By comparing the different MESR constraints which can enforce the same SSoD, we conclude the minimal MESR constraints can avoid redundant restrictiveness effectively and enforce the SSoD policy precisely. We also present an algorithm that generates all minimal MESR constraints that are precise for enforcing oneSSoD policy.","PeriodicalId":370660,"journal":{"name":"2008 The 9th International Conference for Young Computer Scientists","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132960263","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 Search Method for the Network of Interpersonal Trust","authors":"Zhenhai Yang, Sheng Ge, Gang Li","doi":"10.1109/ICYCS.2008.67","DOIUrl":"https://doi.org/10.1109/ICYCS.2008.67","url":null,"abstract":"It is difficult to effectively search for online cooperation because of the complex structure and information asymmetry of the interpersonal trust network. A search method designed in this paper is aiming at finding appropriate persons and their trust related information through the trust ties. Considering the features of the interpersonal trust network, this method extended a search algorithm of the complex network. And the method designed the transition trust formulas to provide the values of trust and trust incidents of the results in order to establish the quick trust between the search sponsor and results. This method adopted a private data protection to ensure the privacy of the search information. The search method could find out credit people and relevant trust information through the trust ties in the network of interpersonal trust, to promote the trust ties growth and the online corporation.","PeriodicalId":370660,"journal":{"name":"2008 The 9th International Conference for Young Computer Scientists","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127212201","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 Secure Network Admission and Routing Model Based on Trust Theory","authors":"Chi Guo, Lei Zhao, Lina Wang, Zhejun Fang","doi":"10.1109/ICYCS.2008.452","DOIUrl":"https://doi.org/10.1109/ICYCS.2008.452","url":null,"abstract":"This paper presents a trust-based model for secure network admission and trustworthy routing. Firstly, a dynamic routing trust model based on trust relationship and routing behaviors is brought forward. The model not only supports trust network connection, but also gives a comprehensive assessment to the network security and efficiency affected by router access according to routers' interactive behaviors. Secondly, the trust degree between any two routers can be notified to all by a dependable flooding algorithm. Finally, a new routing strategy called by \"minimal trust routing entropy\" is proposed, which is good at avoiding nodes with low trust while taking into account the routing efficiency. This model can be used for the next-generation connection-oriented Internet which is controllable and trustworthy.","PeriodicalId":370660,"journal":{"name":"2008 The 9th International Conference for Young Computer Scientists","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131303060","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":"Concept Granular System and Granular Concept Lattice","authors":"Hong Li","doi":"10.1109/ICYCS.2008.233","DOIUrl":"https://doi.org/10.1109/ICYCS.2008.233","url":null,"abstract":"This paper, based on the authorpsilas new model of granular computing--the theory of granular set, puts forward the concept of granular family, granular system, concept granular system, granular concept, through upgrading the mapping to the power set and mapping from one-way to two-way. And, they are described respectively, the concept of which is the description of concept granular system in the form of five-tuple array, that is, (U, D, L, H, J), where U is the universe of the problem discussed, D describes all the elements in U, L is the operator from 2U to 2D, H is the operator from 2D to 2U, and J restricts the L and H, its restrict form goes as follows: .From this model, some basic mathematical laws of the concept granular system are given, it proves that all of the granular concepts constitute a complete lattice - concept granular lattice, thus extending the granular set theory and improving the granular set theory.","PeriodicalId":370660,"journal":{"name":"2008 The 9th International Conference for Young Computer Scientists","volume":"240 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123375092","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":"Practice and Discussion on a New Teaching Mode of “Case Guide Learning” in Basic of Database Application","authors":"Xiaoqing Feng, Jianping Han","doi":"10.1109/ICYCS.2008.278","DOIUrl":"https://doi.org/10.1109/ICYCS.2008.278","url":null,"abstract":"Basic of database application is one of basic and important computer courses in finance colleges. However, the effectiveness of the course is not desirable because there are large amount of knowledge in classes and students are acquired to resolve problems by using comprehensive knowledge. A new teaching mode of \"case guide learning\" is proposed in the paper. Case guide learning (CGL) is a teach method that student is center and active learning. Furthermore, how to choose a good case and carry out heuristic discussion are expounded in detail. At the same time, we intensify effectiveness of case using classroom online, proposed a new teaching system that composed of classroom online and offline. The practice shows that this kind of new teaching method has gained better teaching results.","PeriodicalId":370660,"journal":{"name":"2008 The 9th International Conference for Young Computer Scientists","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121208344","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 Linux-based Development and Application of Automatic Test System","authors":"Wen Ding, Qing Wu, Weihua Hu, Zhiling Hu, Hongbiao Xie","doi":"10.1109/ICYCS.2008.483","DOIUrl":"https://doi.org/10.1109/ICYCS.2008.483","url":null,"abstract":"With the rapid development of information technology, it is a trend to apply computer automatic evaluation technology into basic computer teaching. According to the actual teaching situation of Linux platform in Zhejiang province, we have researched and developed a Linux-based automatic test system. This paper details the composition structure of the system, including test bank management module, examinee module, supervision terminal module, judging module, results processing module. Then the key technologies used in the system are proposed. After that, we give a introduction of the system application in computer grade examination of Zhejiang province. Finally we draw a conclusion and present the future work.","PeriodicalId":370660,"journal":{"name":"2008 The 9th International Conference for Young Computer Scientists","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125604965","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":"The Exploration and Practice of Embedded System Curriculum in Computer Science field","authors":"Zhenkuan Pan, Yanbin Fan","doi":"10.1109/ICYCS.2008.288","DOIUrl":"https://doi.org/10.1109/ICYCS.2008.288","url":null,"abstract":"The particularity of talent needed for different research and development levels in embedded field is realized and the status of talent required for embedded industry is clarified through the deep and wide enterprise investigation and the process of embedded products development. Furthermore, talent in embedded field can be divided into four types, hardware design talent, drive layer design talent, secondary development talent and application software development talent. Based on computer specialty, appropriate curriculum system is established, which is more combined with computer specialty and fit for the cultivation of embedded system talent needed for the society. This paper further elaborates teaching planning of related courses, curriculum and teaching programs of the relationship between courses.Finally, the practice results and recommendations about this curriculum are given.","PeriodicalId":370660,"journal":{"name":"2008 The 9th International Conference for Young Computer Scientists","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130322027","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}