{"title":"Research on Edge Detection and Description of Packaged Grain Image","authors":"Ying Lin, Xinglin Fang, Yueheng Sun, Yanhong Sun","doi":"10.1109/ISCSCT.2008.72","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.72","url":null,"abstract":"The technique core of grain reserves automatical supervision and audit system which based on video is to identify the grain warehouse scene video, and accurately gets the sum of grain quantity. The key to identifying the quantity is the shape of package, and the key to identifying shape is processing and describing the boundary of package. Based on a lot of research and experiment on the edge detection operators, this article select the canny operator and chain code to process and describe the boundary of package. Aiming at the boundary is not absolute connectivity, the closure operation of Mathematical Morphology is introduced to do pretreatment on binary image of packaged grain. Finally the boundary is absolute connectivity. Experiments show that the proposed method enhances the anti-jamming and robustness of edge detection, and satisfy precision request of packaged grain quantify recognition.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114523653","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":"Normalization for Removing Code Variations in Modular Programs","authors":"Tiantian Wang, Xiaohong Su, Peijun Ma","doi":"10.1109/ISCSCT.2008.307","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.307","url":null,"abstract":"Code variations are widely believed to impede program analysis. This paper introduces an approach for removing code variations in programs with function calls. Non-recursive programs and recursive programs are handled with different strategies. An inlining algorithm based on system dependence graph is developed to remove the module structure variation in non-recursive programs. Recursive programs are not in lined, but also normalized by performing semantic-preserving transformations on system dependence graphs. As a result, semantically equivalent constructs are transformed to the same system dependence graph representation, so that code variations are removed. This approach has been applied to similar code detection and automatic grading of student programs. Test results show that it can efficiently remove code variations and improve program analysis.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114727689","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":"Construction of Remote Experiment Framework for MR Imaging Technique","authors":"Nie Shengdong, Ren Yan-hua, L. Ying, Yu Wenwen","doi":"10.1109/ISCSCT.2008.9","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.9","url":null,"abstract":"In order to enhance the utilization rate of the existing magnetic resonance imaging (MRI) experiment instruments and to allocate the existing experimental resources fully and reasonably, we constructed the experiment framework with remote experiment ability for MRI imaging technology by means of the desktop magnetic resonance imaging apparatus which are developed by Shanghai Niumag Cooperation. This modern experimental teaching mode will fundamentally change the traditional experimental teaching idea. Meanwhile, it plays an important role in enhancing the teaching quality of the medical imaging technology, training students' comprehensive quality as well as easing the guidance of teachers' arduous work .And it also provides good teaching reform ideas for medical imaging technology.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124514449","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":"AWright-ADL for Aspectual Component Composition Platform","authors":"Bin Wang, Chunyan Wen, Wei Zhu, Jinfang Sheng","doi":"10.1109/ISCSCT.2008.357","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.357","url":null,"abstract":"Aspectual component composition platform needs a new kind of language to support the description and verification of the software architecture. Based on the extension of Wright, this paper proposes an aspectual components composition architecture description language-AWright. Since Wright fails to describe system¿s non-functional requirements and lacks corresponding elements for describing the coupling relationship between non-functional and functional requirements, the description of aspectual components, pointcuts and advices are introduced into AWright. Finally, this paper uses a medical diagnosis system described both in Wright and AWright as a case study to illustrate superiority of AWright over other architecture description languages and to show its description ability and support for aspectual component composition platform.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115941545","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":"Analysis and Design for Nonlinear Networked Control Systems with Interval Time-Varying Delay","authors":"Hongyan Chu, D. Yue","doi":"10.1109/ISCSCT.2008.367","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.367","url":null,"abstract":"This paper mainly concerns with the analysis and design for a class of nonlinear networked control systems (NCSs), which can be represented by a T-S fuzzy model with interval time-varying network delay. By using the convexity of the matrix function, the conservatism caused by enlarging¿ (t) to ¿M can be avoided. The controller parameters that guarantee the asymptotical stability and the performance of the closed-loop system are obtained by solving a set of linear matrix inequalities (LMIs). A numerical example is provided to show the effectiveness of the proposed method.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132526918","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}
Jing Wang, Yuchun Gao, Yiyang Xiong, M. Cheng, Shuai Zhu
{"title":"Identification of Severe Precipitation Radar Echo Reflectivity with Back-Propagation ANN","authors":"Jing Wang, Yuchun Gao, Yiyang Xiong, M. Cheng, Shuai Zhu","doi":"10.1109/ISCSCT.2008.365","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.365","url":null,"abstract":"In this thesis, the radar echo reflectivity of severe precipitation in the flood season of Changjiang-Huaihe area was identified by a Back-Propagation (BP) Model of Artificial Neural Network (ANN). The trained network was applied in a precipitation progress in the same area in 2001. The results illustrate that: the single hide-layer BP ANN can be used to identify the target radar echo at a high succeed rate. It is also validated that the performance of the network is influenced by following factors: the quality and input sequence of the training sample, the framework of hide layer and the learning rate.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130004212","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":"An Optimal Equitable Matching Algorithm and Modeling","authors":"Chendan, Yuxueyong","doi":"10.1109/ISCSCT.2008.333","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.333","url":null,"abstract":"This article studied on the optimal model of kidney exchange policy. Analysis yielded several bottleneck factors that affect the efficiency in the process of matching access of the kidney transplantation: ABO Blood Type, Age, Waiting time, kidney quality, etc. Taking into consideration of these factors, we developed a mathematical model of game theory and statistical method to measure the overall effectiveness of the match. This model is slightly improved by adjusting fairness policies.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134260189","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":"Stereo Matching Based on Local Invariant Region Identification","authors":"Qian Hu, Zhengqiu Yang","doi":"10.1109/ISCSCT.2008.69","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.69","url":null,"abstract":"Among the solutions for stereo matching which is regarded as one fundamental topic in computer vision, methods based on regions can overcome the drawbacks of methods using points and lines as the features since regions can more exactly reflect the inherent properties of images processed. In this paper, we propose an efficient method to extract the local invariant region, in which the affine moment invariant is also combined. Experiments prove our method is effective while easier to implement.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129376361","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":"Real-Time Image Geometric Rectification for Scene Matching Based on Aircraft Attitude","authors":"Xiaogang Yang, Fei Meng, Liyong Hu, Jun-shan Li","doi":"10.1109/ISCSCT.2008.350","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.350","url":null,"abstract":"A novel approach for scene matching real-time image geometric rectification is proposed. Based on the analysis of the reason caused geometric distortion in the process of real-time image capturing, two coordinates system are given, the real-time image distortion classification are analyzed, and the distortion mathematic models are established. Then, the geometric rectification of the real-time image is realized according to the aircraft camera¿s height and attitude angle information, including method for calculating the offset and determining the size of the new real-time image. Simulation experimental results proved the validity and the efficiency of the approach.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130992851","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":"Sure Interpolation and Its Application to Hierarchical Threshold Secret Sharing Scheme","authors":"Yanshuo Zhang, Zhuojun Liu, Guifang Huang","doi":"10.1109/ISCSCT.2008.22","DOIUrl":"https://doi.org/10.1109/ISCSCT.2008.22","url":null,"abstract":"A threshold secret sharing scheme permits a secret to be shared among participants in such a way that only qualified subsets of participants can recover the secret. Threshold secret sharing is useful in management of cryptographic keys. Based on Birkhoff interpolation, Tassa has proposed an ideal hierarchical threshold secret sharing scheme. Then based on Sure interpolation and participants' identity, we present another ideal hierarchical threshold secret sharing scheme. Sure interpolation is simple and easy interpolation method to use in hierarchical threshold secret sharing scheme. At last, we analyze the ideal threshold secret sharing scheme based on Sure interpolation, which is more easy and simple to compute and implement in the real life.","PeriodicalId":228533,"journal":{"name":"2008 International Symposium on Computer Science and Computational Technology","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133459195","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}