Pub Date : 2019-11-11DOI: 10.14220/9783737004312.front
Title Pages Of Issue
{"title":"Title pages","authors":"Title Pages Of Issue","doi":"10.14220/9783737004312.front","DOIUrl":"https://doi.org/10.14220/9783737004312.front","url":null,"abstract":"<jats:p />","PeriodicalId":255806,"journal":{"name":"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130756568","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}
Pub Date : 2018-12-03DOI: 10.14220/9783737008556.front
H. Osborn
{"title":"Title pages","authors":"H. Osborn","doi":"10.14220/9783737008556.front","DOIUrl":"https://doi.org/10.14220/9783737008556.front","url":null,"abstract":"","PeriodicalId":255806,"journal":{"name":"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123210466","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}
Pub Date : 2018-12-03DOI: 10.14220/9783737009201.front
{"title":"Title pages","authors":"","doi":"10.14220/9783737009201.front","DOIUrl":"https://doi.org/10.14220/9783737009201.front","url":null,"abstract":"","PeriodicalId":255806,"journal":{"name":"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133708770","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}
Pub Date : 2010-09-20DOI: 10.1109/ICACTE.2010.5579408
A. Etemadi, M. Ebadzadeh, Mehdi Eatemadi
Decision trees are some kinds of learning structures which are used to provide approximations on the accurate solutions for new instances using learning data classifications. The core part in a Decision Tree Learning Algorithm is the approach taken in each phase for choosing better attributes. In this paper we tried to develop a new approach for selecting better attributes in training phase of a decision tree using DNA-base algorithms with lower complexity in arithmetic operators.
{"title":"Identifying the best attributes for Decision Tree Learning Algorithms, inspired by DNA concepts, in computer science","authors":"A. Etemadi, M. Ebadzadeh, Mehdi Eatemadi","doi":"10.1109/ICACTE.2010.5579408","DOIUrl":"https://doi.org/10.1109/ICACTE.2010.5579408","url":null,"abstract":"Decision trees are some kinds of learning structures which are used to provide approximations on the accurate solutions for new instances using learning data classifications. The core part in a Decision Tree Learning Algorithm is the approach taken in each phase for choosing better attributes. In this paper we tried to develop a new approach for selecting better attributes in training phase of a decision tree using DNA-base algorithms with lower complexity in arithmetic operators.","PeriodicalId":255806,"journal":{"name":"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115283246","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}
Pub Date : 2010-09-20DOI: 10.1109/ICACTE.2010.5579694
Li Wen-ze, Xu Tao
Although vocabulary algorithm is better than bigram segmentation algorithm, the means to achieve it is rarer. This paper presents a method of arranging a new vocabulary-based indexing system which enhances the quality of the index and resolves the problem of bad retrieval accuracy and low efficiency of vertical search engine.
{"title":"Research and design of an efficient Chinese indexing system","authors":"Li Wen-ze, Xu Tao","doi":"10.1109/ICACTE.2010.5579694","DOIUrl":"https://doi.org/10.1109/ICACTE.2010.5579694","url":null,"abstract":"Although vocabulary algorithm is better than bigram segmentation algorithm, the means to achieve it is rarer. This paper presents a method of arranging a new vocabulary-based indexing system which enhances the quality of the index and resolves the problem of bad retrieval accuracy and low efficiency of vertical search engine.","PeriodicalId":255806,"journal":{"name":"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115381552","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}
Pub Date : 2010-09-20DOI: 10.1109/ICACTE.2010.5579363
Shih-Kuan Liao, Bao Liu
Traditional optical flow techniques applied to object tracking generally perform global searching and calculations of brightness and light intensity of the object in the image. In addition, traditional optical flow techniques assume that the light intensity is constant across a series of consecutive images. The goal is to obtain the displacement and moving direction of an object in a series of images. However, most of important information lies in the regions where optical flows vary significantly. Having relatively small optical flow variations usually implies that the information lying in this region is not important. As traditional optical flow techniques employs global searching to obtain optical flow values, the total computations are time consuming and most of time is spent on unimportant regions. If it is acceptable to exclude part of unimportant information then the overall algorithm can omit part of computations and hence shorten the time needed to calculate optical flow field. To speed up the optical flow calculation, this study proposes an edge-based algorithm for obtaining optical flows. The main ideas are to segments out objects in each of consecutive images and then compare every object's centroid with circumference to identify matching objects of each image. According to the movement data of corresponding objects in each image, optical flow field can be formed and as a result objects can be tracked. Finally, the proposed algorithm in this study has been experimented to effectively decrease computation time while preserving useful information.
{"title":"An edge-based approach to improve optical flow algorithm","authors":"Shih-Kuan Liao, Bao Liu","doi":"10.1109/ICACTE.2010.5579363","DOIUrl":"https://doi.org/10.1109/ICACTE.2010.5579363","url":null,"abstract":"Traditional optical flow techniques applied to object tracking generally perform global searching and calculations of brightness and light intensity of the object in the image. In addition, traditional optical flow techniques assume that the light intensity is constant across a series of consecutive images. The goal is to obtain the displacement and moving direction of an object in a series of images. However, most of important information lies in the regions where optical flows vary significantly. Having relatively small optical flow variations usually implies that the information lying in this region is not important. As traditional optical flow techniques employs global searching to obtain optical flow values, the total computations are time consuming and most of time is spent on unimportant regions. If it is acceptable to exclude part of unimportant information then the overall algorithm can omit part of computations and hence shorten the time needed to calculate optical flow field. To speed up the optical flow calculation, this study proposes an edge-based algorithm for obtaining optical flows. The main ideas are to segments out objects in each of consecutive images and then compare every object's centroid with circumference to identify matching objects of each image. According to the movement data of corresponding objects in each image, optical flow field can be formed and as a result objects can be tracked. Finally, the proposed algorithm in this study has been experimented to effectively decrease computation time while preserving useful information.","PeriodicalId":255806,"journal":{"name":"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)","volume":"199 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115433975","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}
Pub Date : 2010-09-20DOI: 10.1109/ICACTE.2010.5579375
Yuan Mingyang, Meng Fei, Xu Qiuxiao
Residential areas are the gathering of human activities. It has great significance to master the spatial distribution information timely and accurately by RS in disaster assessment, urban expansion and environmental change research. In this paper, taking Longkou city as an example, we find corresponding models to quickly extract residential areas by studying the image features, spatial features and spatial relations, furthermore, we use the spectral characteristics and GIS information to build knowledge base for the extraction.
{"title":"Residential areas extraction based on the spectral characteristics and GIS assistant information","authors":"Yuan Mingyang, Meng Fei, Xu Qiuxiao","doi":"10.1109/ICACTE.2010.5579375","DOIUrl":"https://doi.org/10.1109/ICACTE.2010.5579375","url":null,"abstract":"Residential areas are the gathering of human activities. It has great significance to master the spatial distribution information timely and accurately by RS in disaster assessment, urban expansion and environmental change research. In this paper, taking Longkou city as an example, we find corresponding models to quickly extract residential areas by studying the image features, spatial features and spatial relations, furthermore, we use the spectral characteristics and GIS information to build knowledge base for the extraction.","PeriodicalId":255806,"journal":{"name":"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115501088","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}
Pub Date : 2010-09-20DOI: 10.1109/ICACTE.2010.5579705
Song Renjie, Yue Yiyang
At present, there are two different research in the forefront of studying the virtual campus roaming, they are geometric model-based virtual reality technology and image-based virtual reality technology [1]. Based on geometric model-based virtual reality technology, the paper has designed and realized a desktop virtual campus cruising system that has real-time interactivity, immersion and telepresence by using the combination of VRML and 3ds MAX in the computer environment. The paper also gives the detailed description of scene modeling, roaming implementation, the realization of human-computer interaction function, and collision detection.
{"title":"Implementation of 3D virtual campus cruising system based on VRML","authors":"Song Renjie, Yue Yiyang","doi":"10.1109/ICACTE.2010.5579705","DOIUrl":"https://doi.org/10.1109/ICACTE.2010.5579705","url":null,"abstract":"At present, there are two different research in the forefront of studying the virtual campus roaming, they are geometric model-based virtual reality technology and image-based virtual reality technology [1]. Based on geometric model-based virtual reality technology, the paper has designed and realized a desktop virtual campus cruising system that has real-time interactivity, immersion and telepresence by using the combination of VRML and 3ds MAX in the computer environment. The paper also gives the detailed description of scene modeling, roaming implementation, the realization of human-computer interaction function, and collision detection.","PeriodicalId":255806,"journal":{"name":"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115502159","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}
Pub Date : 2010-09-20DOI: 10.1109/ICACTE.2010.5578964
Sheng Luo
In this paper, the manual and automatic extraction of shoe last landmarks, including landmarks design, are discussed on the base of key sizes which are used in the shoe last design. The effect is evaluated from the following three aspects: the approximation rate of area, the cumulative variance of various landmarks, and the variety of principal shape vectors. Experimental results indicate that the manual approach is more suitable because fewer landmarks are required than the automatic approach. There are three contributions of this paper: 1) critical shape points are provided for shoe last and foot shapes analysis; 2) a method for landmarks selecting and extracting is suggested; and 3) three benchmarks to evaluate the effect are proposed.
{"title":"Landmark design in 3D PDM for PCA of shoe last","authors":"Sheng Luo","doi":"10.1109/ICACTE.2010.5578964","DOIUrl":"https://doi.org/10.1109/ICACTE.2010.5578964","url":null,"abstract":"In this paper, the manual and automatic extraction of shoe last landmarks, including landmarks design, are discussed on the base of key sizes which are used in the shoe last design. The effect is evaluated from the following three aspects: the approximation rate of area, the cumulative variance of various landmarks, and the variety of principal shape vectors. Experimental results indicate that the manual approach is more suitable because fewer landmarks are required than the automatic approach. There are three contributions of this paper: 1) critical shape points are provided for shoe last and foot shapes analysis; 2) a method for landmarks selecting and extracting is suggested; and 3) three benchmarks to evaluate the effect are proposed.","PeriodicalId":255806,"journal":{"name":"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115639253","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}
Pub Date : 2010-09-20DOI: 10.1109/ICACTE.2010.5579373
Zhonglei Fan, Xiangmo Zhao
Most modern file systems provide journaling method instead of traditional file system check routine for fast recovery and consistency guarantee from unexpected crashes. For clustered file systems with shared storage, to improve the performance of journaling, each node gets its own journal space and each journal can be on its own disk for greater parallelism. After a failure, file system consistency is restored quickly by simply re-applying all updates recorded in the failed node's journal. However, for file system operations involving multiple nodes, this method may not be efficient enough as lock mechanism has to be employed in most cases, which may cause poorer performance and more recovery time. By introducing specific journal storage to record the transactions involving multiple nodes, an enhanced lock-free journaling method is presented in this paper, which can improve the performance of journaling operations involving multiple nodes, and then shortens recovery time from crashes. A Linux-based concept-proofing implementation has been applied in self-developed clustered file system.
{"title":"An enhanced journaling method for clustered file system with shared storage","authors":"Zhonglei Fan, Xiangmo Zhao","doi":"10.1109/ICACTE.2010.5579373","DOIUrl":"https://doi.org/10.1109/ICACTE.2010.5579373","url":null,"abstract":"Most modern file systems provide journaling method instead of traditional file system check routine for fast recovery and consistency guarantee from unexpected crashes. For clustered file systems with shared storage, to improve the performance of journaling, each node gets its own journal space and each journal can be on its own disk for greater parallelism. After a failure, file system consistency is restored quickly by simply re-applying all updates recorded in the failed node's journal. However, for file system operations involving multiple nodes, this method may not be efficient enough as lock mechanism has to be employed in most cases, which may cause poorer performance and more recovery time. By introducing specific journal storage to record the transactions involving multiple nodes, an enhanced lock-free journaling method is presented in this paper, which can improve the performance of journaling operations involving multiple nodes, and then shortens recovery time from crashes. A Linux-based concept-proofing implementation has been applied in self-developed clustered file system.","PeriodicalId":255806,"journal":{"name":"2010 3rd International Conference on Advanced Computer Theory and Engineering(ICACTE)","volume":"160 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115711860","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：