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}
In the online retrieving valuable information in special databases, it is important to protect the privacy of users preventing the server from knowing the information what the users retrieve. The problem was not solved until the privacy information retrieval (PIR) schemes were presented. A PIR scheme allows a user to retrieve a date item from online database while hiding the index of the data item from the database server. However, retrieving valuable information is another problem needs to be solved. Most transactions are completed by credit card through delivering its number and membership in the Internet to the server. Then the server knows the privacy of users. It becomes a challenge to private information retrieval (PIR) schemes considering the e-payment need. In this paper, we propose a new PIR scheme, which use a secure coprocessor (SC), with e-payment scheme for protecting the privacy of customers in querying valuable information. The scheme does not reveal personal information or buying information of customers in the Internet environment, it can really protect the customers' privacy. Comparing with previous PIR schemes, the scheme, combined with e-payment scheme in retrieving valuable information in special database, is more practical than previous PIR schemes in the Internet applications because of considering e-payment need
{"title":"Protecting Customer’s Privacy in Querying Valuable Information Combined with E-Payment Scheme","authors":"Chun-Hua Chen, Chi-Min Lan, G. Horng","doi":"10.1109/ICITA.2005.222","DOIUrl":"https://doi.org/10.1109/ICITA.2005.222","url":null,"abstract":"In the online retrieving valuable information in special databases, it is important to protect the privacy of users preventing the server from knowing the information what the users retrieve. The problem was not solved until the privacy information retrieval (PIR) schemes were presented. A PIR scheme allows a user to retrieve a date item from online database while hiding the index of the data item from the database server. However, retrieving valuable information is another problem needs to be solved. Most transactions are completed by credit card through delivering its number and membership in the Internet to the server. Then the server knows the privacy of users. It becomes a challenge to private information retrieval (PIR) schemes considering the e-payment need. In this paper, we propose a new PIR scheme, which use a secure coprocessor (SC), with e-payment scheme for protecting the privacy of customers in querying valuable information. The scheme does not reveal personal information or buying information of customers in the Internet environment, it can really protect the customers' privacy. Comparing with previous PIR schemes, the scheme, combined with e-payment scheme in retrieving valuable information in special database, is more practical than previous PIR schemes in the Internet applications because of considering e-payment need","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"52 27","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113990528","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}
With the increasing popularity of mobile computing platforms such as personal digital assistants (PDAs) and smart mobile phones, applications originally designed for higher-performance devices are moving onto these resource-constrained mobile devices. Given that these devices have severely restricted processing power, memory, and user interface capabilities, applications intended for these devices have to be carefully designed and implemented to achieve acceptable performance. In this paper we report on our experience with the development of the MacauMap application, a mobile digital map application that runs on PDAs and smart mobile phones. Memory requirements were kept low through a special data format. The main challenge of satisfactory map drawing speed was addressed through a variety of techniques developed for this application. We present the MacauMap application, introduce its design, and conclude with lessons learned from its development
{"title":"Performance Tuning in the MacauMap Mobile Map Application","authors":"R. Biuk-Aghai","doi":"10.1109/ICITA.2005.216","DOIUrl":"https://doi.org/10.1109/ICITA.2005.216","url":null,"abstract":"With the increasing popularity of mobile computing platforms such as personal digital assistants (PDAs) and smart mobile phones, applications originally designed for higher-performance devices are moving onto these resource-constrained mobile devices. Given that these devices have severely restricted processing power, memory, and user interface capabilities, applications intended for these devices have to be carefully designed and implemented to achieve acceptable performance. In this paper we report on our experience with the development of the MacauMap application, a mobile digital map application that runs on PDAs and smart mobile phones. Memory requirements were kept low through a special data format. The main challenge of satisfactory map drawing speed was addressed through a variety of techniques developed for this application. We present the MacauMap application, introduce its design, and conclude with lessons learned from its development","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"39 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":"115657165","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}
Software agent technology is currently based on fixed ontologies and languages, hand-crafted for a particular application. The advent of massively distributed systems however calls for not only a common language between all agents involved but also the ability to autonomously adapt and form concepts about novel experiences and events. We propose a method by which agents can autonomously form new concepts grounded in their own experience. This is an improvement on previous approaches because it can tackle a much wider range of conceptual types and provides an efficient, accurate representation which can be used in a rule based system or conceptual framework.
{"title":"Autonomous concept formation in software agents for extending ontologies","authors":"Elise Langham, S. Bullock","doi":"10.1109/ICITA.2005.85","DOIUrl":"https://doi.org/10.1109/ICITA.2005.85","url":null,"abstract":"Software agent technology is currently based on fixed ontologies and languages, hand-crafted for a particular application. The advent of massively distributed systems however calls for not only a common language between all agents involved but also the ability to autonomously adapt and form concepts about novel experiences and events. We propose a method by which agents can autonomously form new concepts grounded in their own experience. This is an improvement on previous approaches because it can tackle a much wider range of conceptual types and provides an efficient, accurate representation which can be used in a rule based system or conceptual framework.","PeriodicalId":371528,"journal":{"name":"Third International Conference on Information Technology and Applications (ICITA'05)","volume":"15 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":"115710939","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
扫码关注我们
求助内容：
应助结果提醒方式：