It is crucial for a company to build their business model in such a way that if it needs to adapt new changes then it has enough flexibility to adapt their system without redesigning the whole business model. The business model needs to be flexible, adaptive, and integrated. Not only the system processes but also cultural and business strategies have to be coherent. This approach allows a company to handle any change in a much more adaptive way to compete in the market. In this paper, we proposed a step-by-step approach to define a new adaptive business model and based on our model, we present a scenario-based implementation as proof of concept.
{"title":"A new adaptive business model for e-commerce","authors":"Saqib Ali, B. Soh, T. Torabi","doi":"10.1109/ICITA.2005.29","DOIUrl":"https://doi.org/10.1109/ICITA.2005.29","url":null,"abstract":"It is crucial for a company to build their business model in such a way that if it needs to adapt new changes then it has enough flexibility to adapt their system without redesigning the whole business model. The business model needs to be flexible, adaptive, and integrated. Not only the system processes but also cultural and business strategies have to be coherent. This approach allows a company to handle any change in a much more adaptive way to compete in the market. In this paper, we proposed a step-by-step approach to define a new adaptive business model and based on our model, we present a scenario-based implementation as proof of concept.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"4 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":"125624455","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}
When high-resolution algorithm is applied in ship-borne radar, high-resolution algorithm's non-linearity and distributional characteristics before high-resolution processing determine background clutter's distributional characteristics after high-resolution and detector design afterwards. The statistical model of first-order Bragg lines and second order components of sea clutter is put forward. Then by using higher-order cumulative quantity's statistical verification of actually measured data, it is concluded that background noise before high-resolution conforms to normal distribution in ship-borne radar. The numerical domains distribution after high-resolution is determined by improved minimum entropy clutter characteristics recognition method based on rule AIC. This identification method has higher recognition rate. It is verified that background noise after high-resolution by pre-whitened-MUSIC conforms to lognormal distribution.
{"title":"Background noise distribution after high-resolution processing in ship-borne radar","authors":"Z. Zhong","doi":"10.1109/ICITA.2005.86","DOIUrl":"https://doi.org/10.1109/ICITA.2005.86","url":null,"abstract":"When high-resolution algorithm is applied in ship-borne radar, high-resolution algorithm's non-linearity and distributional characteristics before high-resolution processing determine background clutter's distributional characteristics after high-resolution and detector design afterwards. The statistical model of first-order Bragg lines and second order components of sea clutter is put forward. Then by using higher-order cumulative quantity's statistical verification of actually measured data, it is concluded that background noise before high-resolution conforms to normal distribution in ship-borne radar. The numerical domains distribution after high-resolution is determined by improved minimum entropy clutter characteristics recognition method based on rule AIC. This identification method has higher recognition rate. It is verified that background noise after high-resolution by pre-whitened-MUSIC conforms to lognormal distribution.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"723 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":"123850775","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}
Web technology has not been considered to be suitable for the basis of real-time system due to the lack of real-time communication capabilities. HTTP, for example, does not have a Junction that pushes out data from a Web server to Web browsers. We developed a QuickBoard Web-server system that allows users to deliver computer-screen images of any application to more than 100 Web browsers in real-time. We also developed ICMHP, a method integrating interframe compression mechanism with Web-server-side technology, from the viewpoint of reducing network traffic on web-based real-time presentation system
{"title":"Lightweight Desktop-Sharing System for Web Browsers","authors":"Satoshi Ichimura, Y. Matsushita","doi":"10.1109/ICITA.2005.171","DOIUrl":"https://doi.org/10.1109/ICITA.2005.171","url":null,"abstract":"Web technology has not been considered to be suitable for the basis of real-time system due to the lack of real-time communication capabilities. HTTP, for example, does not have a Junction that pushes out data from a Web server to Web browsers. We developed a QuickBoard Web-server system that allows users to deliver computer-screen images of any application to more than 100 Web browsers in real-time. We also developed ICMHP, a method integrating interframe compression mechanism with Web-server-side technology, from the viewpoint of reducing network traffic on web-based real-time presentation system","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"63 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":"131583023","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}
Sang-Woo Kim, Hun-Hee Lee, Chan-Ho Park, Rag Gyu Jung, H. Ryu
In this paper, a new PAPR reduction method using correlation of input data sequence is proposed in order to overcome the serious drawbacks, such as necessity of side information transmission or increase of system complexity and calculation. A new PAPR reduction method can be classified into method 1 and method 2. Method 1 reduces the correlation between the smallest sub-sequence and neighbor smallest subsequence. To consider the own correlation in detail, the method 1 reduces two cases of correlation between neighbor smallest sub-sequences and neighbor largest sub-sequences. Method 1 and method 2 has about 0.5-0.8 dB and 1-1.2 dB PAPR reduction effect respectively. If more detailed process is considered, we can achieve better PAPR reduction performance
{"title":"A PAPR Reduction Method Using the Correlation of Information in OFDM Communication System","authors":"Sang-Woo Kim, Hun-Hee Lee, Chan-Ho Park, Rag Gyu Jung, H. Ryu","doi":"10.1109/ICITA.2005.40","DOIUrl":"https://doi.org/10.1109/ICITA.2005.40","url":null,"abstract":"In this paper, a new PAPR reduction method using correlation of input data sequence is proposed in order to overcome the serious drawbacks, such as necessity of side information transmission or increase of system complexity and calculation. A new PAPR reduction method can be classified into method 1 and method 2. Method 1 reduces the correlation between the smallest sub-sequence and neighbor smallest subsequence. To consider the own correlation in detail, the method 1 reduces two cases of correlation between neighbor smallest sub-sequences and neighbor largest sub-sequences. Method 1 and method 2 has about 0.5-0.8 dB and 1-1.2 dB PAPR reduction effect respectively. If more detailed process is considered, we can achieve better PAPR reduction performance","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"40 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":"132780029","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}
W. Huang, Chun-Ta Chen, Yen-Sheng Chen, Chin-Hsing Chen
Storage devices of embedded systems must have the characteristics of small size, great capacity, low-power consumption, lightweight, non-volatility, and vibration resistance. The NAND type flash memory, briefly denoted by NandFlash, is one of the more often-used storage devices. In terms of unit price, its cost is several dozen to hundred times more expensive than the traditional hard-disk (HD) since its storage space is limited. Therefore, to increase the storage space of NandFlash is great significance. In this paper, we improved the compression layer for NandFlash, which can be coordinated with the X-RL algorithm, to avoid overhead and reduce the degree of internal fragmentation in the compressed data pages. Hence, our proposed method can improve the compression rate. In the reading phase, we use the consecutive memory allocation method, which can reduce the superfluous time caused by non-consecutive access. Therefore, our architecture is meaningful and practical for embedded system applications.
{"title":"A compression layer for NAND type flash memory systems","authors":"W. Huang, Chun-Ta Chen, Yen-Sheng Chen, Chin-Hsing Chen","doi":"10.1109/ICITA.2005.5","DOIUrl":"https://doi.org/10.1109/ICITA.2005.5","url":null,"abstract":"Storage devices of embedded systems must have the characteristics of small size, great capacity, low-power consumption, lightweight, non-volatility, and vibration resistance. The NAND type flash memory, briefly denoted by NandFlash, is one of the more often-used storage devices. In terms of unit price, its cost is several dozen to hundred times more expensive than the traditional hard-disk (HD) since its storage space is limited. Therefore, to increase the storage space of NandFlash is great significance. In this paper, we improved the compression layer for NandFlash, which can be coordinated with the X-RL algorithm, to avoid overhead and reduce the degree of internal fragmentation in the compressed data pages. Hence, our proposed method can improve the compression rate. In the reading phase, we use the consecutive memory allocation method, which can reduce the superfluous time caused by non-consecutive access. Therefore, our architecture is meaningful and practical for embedded system applications.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"31 2 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":"134228126","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}
ePortfolios and the learning artifacts they contain must be portable and accessible for the purpose of supporting life-long learning experiences. In this paper, we identify that ePortfolios must also maintain the credibility of the learning artifacts, especially assessment artifacts that are used as evidence by the learner for demonstrating a particular competency. These assessment artifacts are vulnerable to modification or alteration during transfer between distributed ePortfolio systems. As a result, we propose the use of certified assessment artifacts to detect these vulnerabilities. We also present a distributed architecture for a virtual learning environment that incorporates the sharing of certified assessment artifacts between a learning management system, and an ePortfolio system called dotFOUO that we are currently developing
{"title":"Certified Assessment Artifacts for ePortfolios","authors":"N. Carroll, R. Calvo","doi":"10.1109/ICITA.2005.94","DOIUrl":"https://doi.org/10.1109/ICITA.2005.94","url":null,"abstract":"ePortfolios and the learning artifacts they contain must be portable and accessible for the purpose of supporting life-long learning experiences. In this paper, we identify that ePortfolios must also maintain the credibility of the learning artifacts, especially assessment artifacts that are used as evidence by the learner for demonstrating a particular competency. These assessment artifacts are vulnerable to modification or alteration during transfer between distributed ePortfolio systems. As a result, we propose the use of certified assessment artifacts to detect these vulnerabilities. We also present a distributed architecture for a virtual learning environment that incorporates the sharing of certified assessment artifacts between a learning management system, and an ePortfolio system called dotFOUO that we are currently developing","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"163 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":"134067173","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}
Most ITU-T (i.e., international telecommunication union standardization sector) standards provide precise specifications for the proper operating behaviors of the systems they specify. However, such specifications are inappropriate for some standards such as the standards for audio coders used in VoIP. For such standards, ITU-T commonly supplies a set of input test data with corresponding correct output results. In this paper, we focus on the G.729 audio-coder algorithm. We use a version of G.729 code that can produce the bit-exact desired output for the given set of input test data to show that there can still be errors in the code even though the output matches the output in the ITU-T specification. We demonstrate that the given test vectors are not comprehensive enough to detect some of the obscure errors that can exist in the software. Therefore, we cannot rely solely on the given test vectors to test and validate our code.
{"title":"Incomplete test vectors fail to detect obscure VoIP software errors","authors":"Teck-Kuen Chua, D. Pheanis","doi":"10.1109/ICITA.2005.160","DOIUrl":"https://doi.org/10.1109/ICITA.2005.160","url":null,"abstract":"Most ITU-T (i.e., international telecommunication union standardization sector) standards provide precise specifications for the proper operating behaviors of the systems they specify. However, such specifications are inappropriate for some standards such as the standards for audio coders used in VoIP. For such standards, ITU-T commonly supplies a set of input test data with corresponding correct output results. In this paper, we focus on the G.729 audio-coder algorithm. We use a version of G.729 code that can produce the bit-exact desired output for the given set of input test data to show that there can still be errors in the code even though the output matches the output in the ITU-T specification. We demonstrate that the given test vectors are not comprehensive enough to detect some of the obscure errors that can exist in the software. Therefore, we cannot rely solely on the given test vectors to test and validate our code.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"254 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":"134075714","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}
Xin-Yi Tsai, Yu-Ju Chen, Huang-Chu Huang, Shang-Jen Chuang, R. Hwang
In this paper, the signal recognition by using quantum neural network (QNN) is studied and simulated. The signals with fuzziness distributed in the boundary of two different types of signals could be effectively recognized due to the structure of QNN's hidden units. To demonstrate the capability of QNN in recognition, the signals in a two-dimension (NC2) non-convex system is simulated. All the experiments are also performed by using the traditional neural network (NN) for a comparison.
{"title":"Quantum NN vs. NN in signal recognition","authors":"Xin-Yi Tsai, Yu-Ju Chen, Huang-Chu Huang, Shang-Jen Chuang, R. Hwang","doi":"10.1109/ICITA.2005.228","DOIUrl":"https://doi.org/10.1109/ICITA.2005.228","url":null,"abstract":"In this paper, the signal recognition by using quantum neural network (QNN) is studied and simulated. The signals with fuzziness distributed in the boundary of two different types of signals could be effectively recognized due to the structure of QNN's hidden units. To demonstrate the capability of QNN in recognition, the signals in a two-dimension (NC2) non-convex system is simulated. All the experiments are also performed by using the traditional neural network (NN) for a comparison.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"106 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":"115797952","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}
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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：