In this investigation we discuss powerful yet efficient retrieval mechanism for news stream. Difficulty comes from the fact how to manage incremental information while keeping efficiency. Recently random projection has been paid much attention on dynamic dimensionality reduction. We show this novel technique is really useful for querying news stream in terms of cost and accuracy. We examine some experimental results and excellent efficiency in computation and memory usage.
{"title":"Querying on news stream by using random projection","authors":"H. Oh'uchi, T. Miura, I. Shioya","doi":"10.1109/ICITA.2005.229","DOIUrl":"https://doi.org/10.1109/ICITA.2005.229","url":null,"abstract":"In this investigation we discuss powerful yet efficient retrieval mechanism for news stream. Difficulty comes from the fact how to manage incremental information while keeping efficiency. Recently random projection has been paid much attention on dynamic dimensionality reduction. We show this novel technique is really useful for querying news stream in terms of cost and accuracy. We examine some experimental results and excellent efficiency in computation and memory usage.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"401 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114930602","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}
Extensible Markup Language (XML) has become a standard for data representation and exchange over the Internet. XML schemas are often used to define vocabularies of XML document types and to validate whether the XML documents adhere to the rules defined in the XML schemas. Since XML schemas are textual, programmatic, logical-level schemas, users of XML schemas often find it difficult to understand and communicate with each other the structure and content of the XML schemas and documents as the XML schemas grow in complexity. A solution to the problem would be to convert the logical-level XML schemas developed back to conceptual-level Unified Modeling Language diagrams to facilitate easy understanding and communication. This research paper provides an overview of research on reverse engineering XML schemas into UML diagrams.
{"title":"An overview of research on reverse engineering XML schemas into UML diagrams","authors":"A. Yu, R. Steele","doi":"10.1109/ICITA.2005.69","DOIUrl":"https://doi.org/10.1109/ICITA.2005.69","url":null,"abstract":"Extensible Markup Language (XML) has become a standard for data representation and exchange over the Internet. XML schemas are often used to define vocabularies of XML document types and to validate whether the XML documents adhere to the rules defined in the XML schemas. Since XML schemas are textual, programmatic, logical-level schemas, users of XML schemas often find it difficult to understand and communicate with each other the structure and content of the XML schemas and documents as the XML schemas grow in complexity. A solution to the problem would be to convert the logical-level XML schemas developed back to conceptual-level Unified Modeling Language diagrams to facilitate easy understanding and communication. This research paper provides an overview of research on reverse engineering XML schemas into UML diagrams.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133612921","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}
T. Kitasuka, K. Hisazumi, Tsuneo Nakanishi, Akira Fukuda
For increasing needs of positioning technology, easy and simple indoor positioning system is desired. Wireless LAN based positioning system is a major candidate of indoor positioning technology. Conventional WLAN based systems require high installation cost or long site calibration before use. In this paper, we describe the implementation of simple WLAN based indoor positioning system WiPS. WiPS uses RSSI between terminals to avoid site calibration. We perform an experiment called a flag game, in which the person raises and lowers the PDA held in each hand. WiPS determines each hand is up or down. As results of the experiment, WiPS detects the movement of PDA in 4.8 sec. on an average
{"title":"WiPS: Location and Motion Sensing Technique of IEEE 802.11 Devices","authors":"T. Kitasuka, K. Hisazumi, Tsuneo Nakanishi, Akira Fukuda","doi":"10.1109/ICITA.2005.312","DOIUrl":"https://doi.org/10.1109/ICITA.2005.312","url":null,"abstract":"For increasing needs of positioning technology, easy and simple indoor positioning system is desired. Wireless LAN based positioning system is a major candidate of indoor positioning technology. Conventional WLAN based systems require high installation cost or long site calibration before use. In this paper, we describe the implementation of simple WLAN based indoor positioning system WiPS. WiPS uses RSSI between terminals to avoid site calibration. We perform an experiment called a flag game, in which the person raises and lowers the PDA held in each hand. WiPS determines each hand is up or down. As results of the experiment, WiPS detects the movement of PDA in 4.8 sec. on an average","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133622451","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}
The cerebellar model articulation controller (CMAC) is a popular auto-associate memory feed forward neural network model. Since it was proposed, many researchers have introduced fuzzy logic to CMAC and called FCMAC. In FCMAC, the input data is fuzzificated into fuzzy sets before fed into CMAC. This paper proposes self-organizing fuzzification (SOF) technique to form fuzzy sets in the fuzzification phase. The proposed SOF technique uses raw numerical values of a training data set with no preprocessing and obtains dynamic partition-base clusters without prior knowledge of number of clusters. It also provides CMAC a consistent fuzzy rule base. Truth value restriction inference scheme (TVR) is employed in the defuzzification phase. Our experiments are conducted on some benchmark datasets, and the results show that our method outperforms the existing model with higher ability to handle uncertainty in the inference process
{"title":"Self-Organizing Gaussian Fuzzy CMAC with Truth Value Restriction","authors":"M. N. Nguyen, D. Shi, Hiok Chai Quek","doi":"10.1109/ICITA.2005.250","DOIUrl":"https://doi.org/10.1109/ICITA.2005.250","url":null,"abstract":"The cerebellar model articulation controller (CMAC) is a popular auto-associate memory feed forward neural network model. Since it was proposed, many researchers have introduced fuzzy logic to CMAC and called FCMAC. In FCMAC, the input data is fuzzificated into fuzzy sets before fed into CMAC. This paper proposes self-organizing fuzzification (SOF) technique to form fuzzy sets in the fuzzification phase. The proposed SOF technique uses raw numerical values of a training data set with no preprocessing and obtains dynamic partition-base clusters without prior knowledge of number of clusters. It also provides CMAC a consistent fuzzy rule base. Truth value restriction inference scheme (TVR) is employed in the defuzzification phase. Our experiments are conducted on some benchmark datasets, and the results show that our method outperforms the existing model with higher ability to handle uncertainty in the inference process","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132856348","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}
In this paper, we propose an efficient power saving protocol for multi-hop mobile ad hoc networks, called p-MANET. Our design is expected as a new foundation MAC layer power saving protocol. The main goals of p-MANET protocol are to reduce significant power consumption and transmission latency, and to achieve efficient power saving. Each mobile node in p-MANET only needs to become active during one beacon interval for every n interval where n is the size of a super frame. Thus, efficient power saving is expected. p-MANET also yields low transmission latency because that every mobile node is aware of the active beacon intervals of its neighbors such that it can easily choose a neighbor in active mode or with the least remaining time to wake up to forward packets. Simulations are also conducted to show the efficiency of the proposed p-MANET
{"title":"p-MANET: Efficient Power Saving Protocol for Multi-Hop Mobile Ad Hoc Networks","authors":"Chiung-Ying Wang, Chi-Jen Wu, Guan-Nan Chen, Ren-Hung Hwang","doi":"10.1109/ICITA.2005.204","DOIUrl":"https://doi.org/10.1109/ICITA.2005.204","url":null,"abstract":"In this paper, we propose an efficient power saving protocol for multi-hop mobile ad hoc networks, called p-MANET. Our design is expected as a new foundation MAC layer power saving protocol. The main goals of p-MANET protocol are to reduce significant power consumption and transmission latency, and to achieve efficient power saving. Each mobile node in p-MANET only needs to become active during one beacon interval for every n interval where n is the size of a super frame. Thus, efficient power saving is expected. p-MANET also yields low transmission latency because that every mobile node is aware of the active beacon intervals of its neighbors such that it can easily choose a neighbor in active mode or with the least remaining time to wake up to forward packets. Simulations are also conducted to show the efficiency of the proposed p-MANET","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"176 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132249470","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}
One of the features in JPEG2000 is ROI (region of interest) coding technique. Since the shape of interested region is manually optional in the coding process, the disturbance of uninterested regions to the retrieval process could be controlled to be very small if we retrieve images based on ROI content. This paper presents a novel and effective scheme for remote sensing image retrieval, which does not need to decode JPEG2000's code stream completely. We extract the spectral features of the objects based on the properties that objects would reflect different waves in different wave bands. The subsequent retrieval is based on this kind of spectral features. In addition, we design a new measurement scheme by which similarity between two images is computed and then the retrieval is realized based on the measurement. Experimental results show that our method is accurate and efficient. It also shows obviously that our method costs much less time than the traditional ones
{"title":"A Method of Remote Sensing Image Retrieval Based on ROI","authors":"Lei Niu, L. Ni, Wei Lu, Yuan Miao","doi":"10.1109/ICITA.2005.24","DOIUrl":"https://doi.org/10.1109/ICITA.2005.24","url":null,"abstract":"One of the features in JPEG2000 is ROI (region of interest) coding technique. Since the shape of interested region is manually optional in the coding process, the disturbance of uninterested regions to the retrieval process could be controlled to be very small if we retrieve images based on ROI content. This paper presents a novel and effective scheme for remote sensing image retrieval, which does not need to decode JPEG2000's code stream completely. We extract the spectral features of the objects based on the properties that objects would reflect different waves in different wave bands. The subsequent retrieval is based on this kind of spectral features. In addition, we design a new measurement scheme by which similarity between two images is computed and then the retrieval is realized based on the measurement. Experimental results show that our method is accurate and efficient. It also shows obviously that our method costs much less time than the traditional ones","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134280830","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}
This paper presents the results of the investigation of a chaotic multi-user modulation method, called chaotic phase shift keying. Only one chaotic sequence generator exists in each transmitter and receiver. We present the theory behind their operations, as well as the bit error rate derivation. It was found to have better performances, confirmed by analytical and simulation results, than the chaotic shift keying (CSK) system, which requires two chaotic sequence generators in each transmitter and receiver.
{"title":"Investigation on operations of a secure communication system based on the chaotic phase shift keying scheme","authors":"G. S. Sandhu, S. Berber","doi":"10.1109/ICITA.2005.164","DOIUrl":"https://doi.org/10.1109/ICITA.2005.164","url":null,"abstract":"This paper presents the results of the investigation of a chaotic multi-user modulation method, called chaotic phase shift keying. Only one chaotic sequence generator exists in each transmitter and receiver. We present the theory behind their operations, as well as the bit error rate derivation. It was found to have better performances, confirmed by analytical and simulation results, than the chaotic shift keying (CSK) system, which requires two chaotic sequence generators in each transmitter and receiver.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128999661","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}
Pervasive computing is one of the hottest research areas in development of information technology. Among the identified key requirements for the software infrastructure of pervasive computing, such as adaptability, configurability, context and environment awareness, we focus the effort of study on the technology of reflection. In this paper, we introduce PURPLE, a reflective middleware platform which is designed and implemented to fit the very requirement of pervasive computing. And a performance analysis is given to evaluate the work.
{"title":"PURPLE: a reflective middleware for pervasive computing","authors":"Zhang Kuo, Wang Xiaoge, Wu Yanni, Zheng Zhenkun","doi":"10.1109/ICITA.2005.225","DOIUrl":"https://doi.org/10.1109/ICITA.2005.225","url":null,"abstract":"Pervasive computing is one of the hottest research areas in development of information technology. Among the identified key requirements for the software infrastructure of pervasive computing, such as adaptability, configurability, context and environment awareness, we focus the effort of study on the technology of reflection. In this paper, we introduce PURPLE, a reflective middleware platform which is designed and implemented to fit the very requirement of pervasive computing. And a performance analysis is given to evaluate the work.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"121 15","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114046471","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}
In this paper, adaptive identification and control of nonlinear dynamical systems are investigated using two synaptic weight neural networks (TSWNN). Firstly, a novel approach to train the TWSWNN is introduced, which employs an adaptive fuzzy generalized learning vector quantization (AFGLVQ) technique and recursive least squares algorithm with variable forgetting factor (VRLS). The AFGLVQ adjusts the kernels of the TSWNN while the VRLS updates the connection weights of the network. The identification algorithm has the properties of rapid convergence and persistent adaptability that make it suitable for real-time control. Secondly, on the basis of the one-step ahead TSWNN predictor, the control law is optimized iteratively through a numerical stable Davidon's least squares-based (SDLS) minimization approach. A nonlinear example is simulated to demonstrate the effectiveness of the identification and control algorithms
{"title":"Application of Two Synaptic Weight Neural Networks for Nonlinear Control","authors":"Wenming Cao, Shoujue Wang","doi":"10.1109/ICITA.2005.72","DOIUrl":"https://doi.org/10.1109/ICITA.2005.72","url":null,"abstract":"In this paper, adaptive identification and control of nonlinear dynamical systems are investigated using two synaptic weight neural networks (TSWNN). Firstly, a novel approach to train the TWSWNN is introduced, which employs an adaptive fuzzy generalized learning vector quantization (AFGLVQ) technique and recursive least squares algorithm with variable forgetting factor (VRLS). The AFGLVQ adjusts the kernels of the TSWNN while the VRLS updates the connection weights of the network. The identification algorithm has the properties of rapid convergence and persistent adaptability that make it suitable for real-time control. Secondly, on the basis of the one-step ahead TSWNN predictor, the control law is optimized iteratively through a numerical stable Davidon's least squares-based (SDLS) minimization approach. A nonlinear example is simulated to demonstrate the effectiveness of the identification and control algorithms","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122856889","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}
Image shape coding is a core technique in MPEG-4. In the paper, we present a quad-tree-based technique for image object shape coding. Quad tree has been used to represent the image content since long time ago, it describes the hierarchy of various sizes of rectangular blocks that collectively constitute the image object area. Quad tree structure can be quite complicate to describe an image object with unsmooth boundary. We propose a block compensation and a run-length scheme to effectively attack the problem. Experimental results show that the algorithm is quite efficient in comparison with other methods.
{"title":"Quad-tree-based image shape coding with block compensation","authors":"Lih-Yang Wang, Ching-Hui Lai, Kuan-Ren Pan","doi":"10.1109/ICITA.2005.227","DOIUrl":"https://doi.org/10.1109/ICITA.2005.227","url":null,"abstract":"Image shape coding is a core technique in MPEG-4. In the paper, we present a quad-tree-based technique for image object shape coding. Quad tree has been used to represent the image content since long time ago, it describes the hierarchy of various sizes of rectangular blocks that collectively constitute the image object area. Quad tree structure can be quite complicate to describe an image object with unsmooth boundary. We propose a block compensation and a run-length scheme to effectively attack the problem. Experimental results show that the algorithm is quite efficient in comparison with other methods.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122993470","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
扫码关注我们
求助内容：
应助结果提醒方式：