Pub Date : 2005-07-11DOI: 10.1109/ICACT.2005.245840
Keumsang Lim, HyangDuck Cho, Jaehwan Kim, Wooshik Kim
This paper describes the design of a direct sequence spread spectrum (DSSS) modem for a flight termination system using VHDL [R.K. Ducek, 2001] and FPGAs. The advantages of DSSS FTS includes the immunity from interference signals and anti-jamming effect. The error correcting scheme of a FTS uses (15,11) Reed-Solomon code. The spread codes of the inphase (I) and quadrature (Q) channel sequence can be generated using a gold sequence generator. The main algorithm is implemented in Altera APEX20K100E FPGAs
{"title":"A study on the implementation of the DSSS modem for a flight termination system","authors":"Keumsang Lim, HyangDuck Cho, Jaehwan Kim, Wooshik Kim","doi":"10.1109/ICACT.2005.245840","DOIUrl":"https://doi.org/10.1109/ICACT.2005.245840","url":null,"abstract":"This paper describes the design of a direct sequence spread spectrum (DSSS) modem for a flight termination system using VHDL [R.K. Ducek, 2001] and FPGAs. The advantages of DSSS FTS includes the immunity from interference signals and anti-jamming effect. The error correcting scheme of a FTS uses (15,11) Reed-Solomon code. The spread codes of the inphase (I) and quadrature (Q) channel sequence can be generated using a gold sequence generator. The main algorithm is implemented in Altera APEX20K100E FPGAs","PeriodicalId":293442,"journal":{"name":"The 7th International Conference on Advanced Communication Technology, 2005, ICACT 2005.","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124554033","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 : 2005-07-11DOI: 10.1109/ICACT.2005.246217
G. Lee, J. Choi
In this paper, we describe the relationship of labels and resources for generalized multiprotocol label switching (GMPLS). We also discuss the resource hierarchy for GMPLS for heterogeneous interfaces. In particular, we propose methods for resource mapping at incoming and outgoing switching interfaces where data flows with labels of different granularities are aggregated into a single large bandwidth. To reserve bandwidth with different granularities, each node performs logical resource aggregation using label association to map incoming labels onto outgoing labels. Using this concept, we can control and manage data flows with several labels, i.e. different resources, inside a GMPLS control domain
{"title":"Resource mapping for GMPLS with heterogeneous interfaces","authors":"G. Lee, J. Choi","doi":"10.1109/ICACT.2005.246217","DOIUrl":"https://doi.org/10.1109/ICACT.2005.246217","url":null,"abstract":"In this paper, we describe the relationship of labels and resources for generalized multiprotocol label switching (GMPLS). We also discuss the resource hierarchy for GMPLS for heterogeneous interfaces. In particular, we propose methods for resource mapping at incoming and outgoing switching interfaces where data flows with labels of different granularities are aggregated into a single large bandwidth. To reserve bandwidth with different granularities, each node performs logical resource aggregation using label association to map incoming labels onto outgoing labels. Using this concept, we can control and manage data flows with several labels, i.e. different resources, inside a GMPLS control domain","PeriodicalId":293442,"journal":{"name":"The 7th International Conference on Advanced Communication Technology, 2005, ICACT 2005.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130328462","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 : 2005-07-11DOI: 10.1109/ICACT.2005.245846
Hyunjang Kong, M. Hwang, Pankoo Kim
As modern techniques improve, people usually intend to store and manage the information in the personal computer. The image data is especially given a great deal of weight of information because of the development of the scan system and popularization of the digital camera and the cellphone's camera. Therefore many images belong to the person. However, most image management systems are still based on the text annotations in creating, storing and retrieving the images. In this paper, we suggest a new system model for managing the persona images using the ontologies. Finally, we could expect more efficient retrieval of images in the personalized image management system (PIMS)
{"title":"PIMS(personalized image management system) using ontologies","authors":"Hyunjang Kong, M. Hwang, Pankoo Kim","doi":"10.1109/ICACT.2005.245846","DOIUrl":"https://doi.org/10.1109/ICACT.2005.245846","url":null,"abstract":"As modern techniques improve, people usually intend to store and manage the information in the personal computer. The image data is especially given a great deal of weight of information because of the development of the scan system and popularization of the digital camera and the cellphone's camera. Therefore many images belong to the person. However, most image management systems are still based on the text annotations in creating, storing and retrieving the images. In this paper, we suggest a new system model for managing the persona images using the ontologies. Finally, we could expect more efficient retrieval of images in the personalized image management system (PIMS)","PeriodicalId":293442,"journal":{"name":"The 7th International Conference on Advanced Communication Technology, 2005, ICACT 2005.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123624788","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 : 2005-07-11DOI: 10.1109/ICACT.2005.246134
Sun Ok Park, Il-Jin Lee, J. Han, Miyoung Huh, Shin-Gak Kang
Internet users are rapidly increased and various services which use Internet are invented. IM (instant messaging) and presence service is one of them. IM and presence is looked upon as a major killer application in the field of IP telephony. In this paper, we describe about the standard technologies for SIP-based IMPP service and about XCAP (XML configuration access protocol) technologies. And then we describe service scenarios and models for SIP-based IMPP services. And finally, we suggest authorization policy and resource list manipulation mechanism using XCAP. And suggests XCAP client system. IMPP service is expecting to contribute in new service creation being integrated with various service such as conference and instant messaging services
{"title":"A study on XCAP client system for SIP-based IMPP services","authors":"Sun Ok Park, Il-Jin Lee, J. Han, Miyoung Huh, Shin-Gak Kang","doi":"10.1109/ICACT.2005.246134","DOIUrl":"https://doi.org/10.1109/ICACT.2005.246134","url":null,"abstract":"Internet users are rapidly increased and various services which use Internet are invented. IM (instant messaging) and presence service is one of them. IM and presence is looked upon as a major killer application in the field of IP telephony. In this paper, we describe about the standard technologies for SIP-based IMPP service and about XCAP (XML configuration access protocol) technologies. And then we describe service scenarios and models for SIP-based IMPP services. And finally, we suggest authorization policy and resource list manipulation mechanism using XCAP. And suggests XCAP client system. IMPP service is expecting to contribute in new service creation being integrated with various service such as conference and instant messaging services","PeriodicalId":293442,"journal":{"name":"The 7th International Conference on Advanced Communication Technology, 2005, ICACT 2005.","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114523765","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 : 2005-07-11DOI: 10.1109/ICACT.2005.246144
Wonjae Lee, Jinmee Kim, Hak-Young Kim
This paper deals with the implementation of the node agent for monitoring and remote job execution in a VOD cluster. The Internet Server Group of ETRI is developing the high performance VOD server. When the VOD servers are clustered for scalability, the system information of server nodes should be collected and managed. The node agent on each node collects the node information and reports it to the job manager. The node agent is implemented in Python, which is a very high level language. Programming in Python was productive
{"title":"Implementation of the node agent for monitoring and remote job execution","authors":"Wonjae Lee, Jinmee Kim, Hak-Young Kim","doi":"10.1109/ICACT.2005.246144","DOIUrl":"https://doi.org/10.1109/ICACT.2005.246144","url":null,"abstract":"This paper deals with the implementation of the node agent for monitoring and remote job execution in a VOD cluster. The Internet Server Group of ETRI is developing the high performance VOD server. When the VOD servers are clustered for scalability, the system information of server nodes should be collected and managed. The node agent on each node collects the node information and reports it to the job manager. The node agent is implemented in Python, which is a very high level language. Programming in Python was productive","PeriodicalId":293442,"journal":{"name":"The 7th International Conference on Advanced Communication Technology, 2005, ICACT 2005.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114632139","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 : 2005-07-11DOI: 10.1109/ICACT.2005.245949
Young-Chul Kim, Taek-Yong Kim
In this paper, considerations on the algorithm that makes the use of general tree structure to enable readily modifiable UI menu structure in an efficient way in terms of time and resource (available memory) of CPUs are described. First, it describes the importance of UI (user interface) and why UI menu structure must be readily modifiable. Following chapter introduces a few data structure as well as general tree type and why general tree is used to meet the goal. Then, source code written in C illustrates how the general tree is used to be able to modify the UI menu structure with some of examples. The primary goal of the algorithm is to help end-users and programmers to be able to modify the UI menu structure. For the end-users, the algorithm lets CPUs finish the task (modifying UI menu structure) instantaneously so that the user is not annoyed with waiting time. For the algorithm is very simple, programmers can use the algorithm easily
{"title":"Application of general tree structure for readily modifiable UI menu structure","authors":"Young-Chul Kim, Taek-Yong Kim","doi":"10.1109/ICACT.2005.245949","DOIUrl":"https://doi.org/10.1109/ICACT.2005.245949","url":null,"abstract":"In this paper, considerations on the algorithm that makes the use of general tree structure to enable readily modifiable UI menu structure in an efficient way in terms of time and resource (available memory) of CPUs are described. First, it describes the importance of UI (user interface) and why UI menu structure must be readily modifiable. Following chapter introduces a few data structure as well as general tree type and why general tree is used to meet the goal. Then, source code written in C illustrates how the general tree is used to be able to modify the UI menu structure with some of examples. The primary goal of the algorithm is to help end-users and programmers to be able to modify the UI menu structure. For the end-users, the algorithm lets CPUs finish the task (modifying UI menu structure) instantaneously so that the user is not annoyed with waiting time. For the algorithm is very simple, programmers can use the algorithm easily","PeriodicalId":293442,"journal":{"name":"The 7th International Conference on Advanced Communication Technology, 2005, ICACT 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124102583","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 : 2005-07-11DOI: 10.1109/ICACT.2005.246077
Kyekyung Kim, SooHyun Cho, Hae Jin Kim, Jae Yeon Lee
This paper is to introduce detecting and tracking moving object using an active camera, which is mounted on mobile robot. Motion of camera is analyzed and compensated by comparing edge features among consecutive image frames. Candidate regions of moving object are found by differencing between transformed ith image and t-1th image. Moving object is finally decided by combined feature set and motion analysis. Object is tracked by matching object components in ROI. We have experimented detecting and tracking moving object with an active camera, which is pan/tilt/zoom and single camera
{"title":"Detecting and tracking moving object using an active camera","authors":"Kyekyung Kim, SooHyun Cho, Hae Jin Kim, Jae Yeon Lee","doi":"10.1109/ICACT.2005.246077","DOIUrl":"https://doi.org/10.1109/ICACT.2005.246077","url":null,"abstract":"This paper is to introduce detecting and tracking moving object using an active camera, which is mounted on mobile robot. Motion of camera is analyzed and compensated by comparing edge features among consecutive image frames. Candidate regions of moving object are found by differencing between transformed ith image and t-1th image. Moving object is finally decided by combined feature set and motion analysis. Object is tracked by matching object components in ROI. We have experimented detecting and tracking moving object with an active camera, which is pan/tilt/zoom and single camera","PeriodicalId":293442,"journal":{"name":"The 7th International Conference on Advanced Communication Technology, 2005, ICACT 2005.","volume":"450 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127610109","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 : 2005-07-11DOI: 10.1109/ICACT.2005.246018
Jisue Kim, Jumyoung Kim, Sung-Jin Heo, Ki-Hyuk Nam, W. Choi
The on-demand S/W streaming service is the ASP (application service providers) solution that provides applications which clients want to use when clients request the service. It enables users to execute applications without installing them, by streaming the application data from servers as needed. We use a special server designed for high-quality and high-performance Internet-based content services. It is called NGIS (next generation Internet server). The existing SAV streaming engine is modified and customized to utilize the NGIS' unique hardware which is the NS (network/storage) add-on card that consists of a SCSI controller, a network interface card and a dedicated memory. In this paper, the server's response ration and application's response ratio are measured and analyzed
{"title":"Measurement and analysis of the on-demand S/W streaming server performance","authors":"Jisue Kim, Jumyoung Kim, Sung-Jin Heo, Ki-Hyuk Nam, W. Choi","doi":"10.1109/ICACT.2005.246018","DOIUrl":"https://doi.org/10.1109/ICACT.2005.246018","url":null,"abstract":"The on-demand S/W streaming service is the ASP (application service providers) solution that provides applications which clients want to use when clients request the service. It enables users to execute applications without installing them, by streaming the application data from servers as needed. We use a special server designed for high-quality and high-performance Internet-based content services. It is called NGIS (next generation Internet server). The existing SAV streaming engine is modified and customized to utilize the NGIS' unique hardware which is the NS (network/storage) add-on card that consists of a SCSI controller, a network interface card and a dedicated memory. In this paper, the server's response ration and application's response ratio are measured and analyzed","PeriodicalId":293442,"journal":{"name":"The 7th International Conference on Advanced Communication Technology, 2005, ICACT 2005.","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127748773","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 : 2005-07-11DOI: 10.1109/ICACT.2005.245829
M. Haspel
This paper extends the DOVETAIL technique for construction of families of complex spreading sequences for use in multiuser asynchronous spread spectrum, SS/CDMA, communication, to extraction of derived real-valued spreading sequence families, intended for similar application. It is shown here that the preferred characteristics of the complex family, in terms of probability of error, are partially carried over to the real and imaginary components when considered to be real-valued sequences, and intermediate improvement in probability of error is retained. Clearly the use of real-valued sequences results in reduced complexity in implementation. The improvement in probability of error is gauged with reference to two Gaussian approximations from the literature for the interference limited case, as well as with reference to control experiment randomly drawn sequences constructed by cointossing and drawing from the Gaussian distribution. The focus on the interference limited case where noise is suppressed allows one to observe the improvement yielded by the technique. The major parameters of the system are N, the sequence length, and q, the family size. Results from simulations are presented, demonstrating enhanced performance. The Gaussian approximations used for comparison are shown to underestimate the probability of error for the control experiment sequences while the generated real sequences have augmented performance with the complex sequences superior
{"title":"Families of spreading sequences for multiuser asynchronous SS/CDMA communication","authors":"M. Haspel","doi":"10.1109/ICACT.2005.245829","DOIUrl":"https://doi.org/10.1109/ICACT.2005.245829","url":null,"abstract":"This paper extends the DOVETAIL technique for construction of families of complex spreading sequences for use in multiuser asynchronous spread spectrum, SS/CDMA, communication, to extraction of derived real-valued spreading sequence families, intended for similar application. It is shown here that the preferred characteristics of the complex family, in terms of probability of error, are partially carried over to the real and imaginary components when considered to be real-valued sequences, and intermediate improvement in probability of error is retained. Clearly the use of real-valued sequences results in reduced complexity in implementation. The improvement in probability of error is gauged with reference to two Gaussian approximations from the literature for the interference limited case, as well as with reference to control experiment randomly drawn sequences constructed by cointossing and drawing from the Gaussian distribution. The focus on the interference limited case where noise is suppressed allows one to observe the improvement yielded by the technique. The major parameters of the system are N, the sequence length, and q, the family size. Results from simulations are presented, demonstrating enhanced performance. The Gaussian approximations used for comparison are shown to underestimate the probability of error for the control experiment sequences while the generated real sequences have augmented performance with the complex sequences superior","PeriodicalId":293442,"journal":{"name":"The 7th International Conference on Advanced Communication Technology, 2005, ICACT 2005.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127880237","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 : 2005-07-11DOI: 10.1109/ICACT.2005.246133
Il-Jin Lee, Sun Ok Park, Wook Hyun, Shin-Gak Kang
XCAP (XML configuration access protocol) is protocol for communication between XCAP client and XCAP server. XCAP allows a client to read, write and modify application configuration data, stored in XML format on a server. XCAP maps XML document subtrees and element attributes to HTTP URIs, so that these components can be directly accessed by HTTP. In this paper, we study on XCAP server behaviors SIP-based IMPP services in order to buddy list control
{"title":"A study on buddy list control in XCAP server system for SIP-based IMPP services","authors":"Il-Jin Lee, Sun Ok Park, Wook Hyun, Shin-Gak Kang","doi":"10.1109/ICACT.2005.246133","DOIUrl":"https://doi.org/10.1109/ICACT.2005.246133","url":null,"abstract":"XCAP (XML configuration access protocol) is protocol for communication between XCAP client and XCAP server. XCAP allows a client to read, write and modify application configuration data, stored in XML format on a server. XCAP maps XML document subtrees and element attributes to HTTP URIs, so that these components can be directly accessed by HTTP. In this paper, we study on XCAP server behaviors SIP-based IMPP services in order to buddy list control","PeriodicalId":293442,"journal":{"name":"The 7th International Conference on Advanced Communication Technology, 2005, ICACT 2005.","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128121330","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
扫码关注我们
求助内容：
应助结果提醒方式：