Monitoring online transactions or tracking users' behavior will generate large-scale archived streaming data in scientific experiments, inner-network audit logs and so on. These archived systems may scale up to petabytes (1015 Bytes). Storing and analyzing the structural data in such scale calls forth at least three challenging issues: data reliability, data storing and analyzing performance, and tradeoff between high reliability and high performance. Based on analyzing the characteristics of the archived streaming data, we propose a novel high reliable log-free database architecture, ArchDB. In order to meet the three challenges, this paper designs optimized data placement policy, data block size and data archiving occasion, pipelining and parallelizing archiving procedure. The experimental results show ArchDB can double the insertion performance and speed up the recovery process by a factor of the parallel recovery degree.
{"title":"ArchDB: Towards Parallelized Recovery in Massive Archived Databases","authors":"Kai Du, Zhijian Yuan, Shuqiang Yang, Huaimin Wang","doi":"10.1109/FGCNS.2008.79","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.79","url":null,"abstract":"Monitoring online transactions or tracking users' behavior will generate large-scale archived streaming data in scientific experiments, inner-network audit logs and so on. These archived systems may scale up to petabytes (1015 Bytes). Storing and analyzing the structural data in such scale calls forth at least three challenging issues: data reliability, data storing and analyzing performance, and tradeoff between high reliability and high performance. Based on analyzing the characteristics of the archived streaming data, we propose a novel high reliable log-free database architecture, ArchDB. In order to meet the three challenges, this paper designs optimized data placement policy, data block size and data archiving occasion, pipelining and parallelizing archiving procedure. The experimental results show ArchDB can double the insertion performance and speed up the recovery process by a factor of the parallel recovery degree.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114980847","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}
There is increasing interest in clustering, owing to improvements in computer capacity and expanding accessible information, circa 1990s. This paper aims to increase cohesion of clustering borrowing from techniques of pagerank showing the links among pages by assigning numerical values to the relevance of pages linked in Web pages. There are cases that need to be referenced in other documents because of any index in academic information. The greater the frequency of referenced academic information, the higher the probability that the referenced index of the document is relevant. Relations among documents referencing each other, are calculated via literature citing each document. The method of increasing the cohesion of clustering involves controlling the distance between two documents based on the values.
{"title":"Clustering Algorithm Using Quoting Relation of Documents","authors":"Hyejin Jeong","doi":"10.1109/FGCNS.2008.77","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.77","url":null,"abstract":"There is increasing interest in clustering, owing to improvements in computer capacity and expanding accessible information, circa 1990s. This paper aims to increase cohesion of clustering borrowing from techniques of pagerank showing the links among pages by assigning numerical values to the relevance of pages linked in Web pages. There are cases that need to be referenced in other documents because of any index in academic information. The greater the frequency of referenced academic information, the higher the probability that the referenced index of the document is relevant. Relations among documents referencing each other, are calculated via literature citing each document. The method of increasing the cohesion of clustering involves controlling the distance between two documents based on the values.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132748980","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 Purpose of this study is to investigate the factors affecting the adoption of on-line banking service. Based on prior studies, this study identified usefulness, ease of use, innovativeness, social influence, quality, cost as affecting factors of on-line banking service and considered moderating effects of service types between Internet banking service and mobile banking service. Result shows that usefulness, ease of use, innovativeness, social influence, quality, and cost are all significantly related to the adoption of on-line banking service. Social influence and cost were found to have different impact on between Internet banking service and mobile banking service.
{"title":"Adoption of On-line Banking Service Considering the Moderate Effects of On-line Banking Service Type","authors":"Byoungho Jun, Pil-Koo Han, J. Choi, B. Kang","doi":"10.1109/FGCNS.2008.98","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.98","url":null,"abstract":"The Purpose of this study is to investigate the factors affecting the adoption of on-line banking service. Based on prior studies, this study identified usefulness, ease of use, innovativeness, social influence, quality, cost as affecting factors of on-line banking service and considered moderating effects of service types between Internet banking service and mobile banking service. Result shows that usefulness, ease of use, innovativeness, social influence, quality, and cost are all significantly related to the adoption of on-line banking service. Social influence and cost were found to have different impact on between Internet banking service and mobile banking service.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125042199","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, a method to estimate and track the distance and velocity of an obstacle on the road based on a stereo vision system is presented. The distance and velocity can be calculated using the disparity in the stereo vision system. However, the quantization error of the pixels causes a deterioration in accuracy. The sub-pixel interpolation is used to compensate for the error, and then, the distance and velocity are tracked with a strong tracking extended Kalman filter using a constant velocity model (STEKF-CVM). The Monte-Carlo simulation results show that the performance of STEKF-CVM is better than that of other filters.
{"title":"Tracking Distance and Velocity Using a Stereo Vision System","authors":"Y. Lim, Chung-Hee Lee, Soon Kwon, Jong-hun Lee","doi":"10.1109/FGCNS.2008.42","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.42","url":null,"abstract":"In this paper, a method to estimate and track the distance and velocity of an obstacle on the road based on a stereo vision system is presented. The distance and velocity can be calculated using the disparity in the stereo vision system. However, the quantization error of the pixels causes a deterioration in accuracy. The sub-pixel interpolation is used to compensate for the error, and then, the distance and velocity are tracked with a strong tracking extended Kalman filter using a constant velocity model (STEKF-CVM). The Monte-Carlo simulation results show that the performance of STEKF-CVM is better than that of other filters.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130166515","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 proposed web performance enhancement of the e-business system using the SSD (Solid State Drive). In the e-business system, transactions must be strictly ordered, should occur at a fixed point time, and not be lost. We approached to solve e-business problem by using software and hardware techniques such as SSD. X-internet has advantage of C/S and Web applications. Since X-internet technique enables to reduce the loading time of web pages, X-internet is useful to enhance performance of the e-business system. SSD is a storage device that uses DRAM or NAND Flash as primary storage media. Since the SSD stores and accesses data directly to memory chips, which results in storage speeds far greater than conventional magnetic storage devices (HDD). Therefore x-internet techniques can be used to solve confused browsing and poor UI, and SSD can be used to solve I/O bottleneck of the e-business system.
{"title":"Web Performance Enhancement of E-business System Using the SSD","authors":"Daesik Ko, Seung-Kook Cheong","doi":"10.1109/FGCNS.2008.100","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.100","url":null,"abstract":"In this paper, we proposed web performance enhancement of the e-business system using the SSD (Solid State Drive). In the e-business system, transactions must be strictly ordered, should occur at a fixed point time, and not be lost. We approached to solve e-business problem by using software and hardware techniques such as SSD. X-internet has advantage of C/S and Web applications. Since X-internet technique enables to reduce the loading time of web pages, X-internet is useful to enhance performance of the e-business system. SSD is a storage device that uses DRAM or NAND Flash as primary storage media. Since the SSD stores and accesses data directly to memory chips, which results in storage speeds far greater than conventional magnetic storage devices (HDD). Therefore x-internet techniques can be used to solve confused browsing and poor UI, and SSD can be used to solve I/O bottleneck of the e-business system.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129636800","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}
Kinam Park, WonHee Yu, Heuiseok Lim, Soonyoung Jung
This study is intended to design and implement an automatic lexical acquisition model based on cognitive neuroscience referring to the theory that mental lexicon structure is represented with full-listing and morphemic and that lexical forms accessed to mental lexicon upon word cognition takes a hybrid type. As the result of the study, we could simulate the lexical acquisition process of linguistic input through experiments and studying, and suggest a theoretical foundation for the order of acquitting certain grammatical categories. Also, the model of this study has shown proofs with which we can infer the type of the mental lexicon of the human cerebrum through full-list dictionary and decomposition dictionary which were automatically produced in the study.
{"title":"Neuro-Cognitive Computational Model of Automatic Lexical Acquisition","authors":"Kinam Park, WonHee Yu, Heuiseok Lim, Soonyoung Jung","doi":"10.1109/FGCNS.2008.123","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.123","url":null,"abstract":"This study is intended to design and implement an automatic lexical acquisition model based on cognitive neuroscience referring to the theory that mental lexicon structure is represented with full-listing and morphemic and that lexical forms accessed to mental lexicon upon word cognition takes a hybrid type. As the result of the study, we could simulate the lexical acquisition process of linguistic input through experiments and studying, and suggest a theoretical foundation for the order of acquitting certain grammatical categories. Also, the model of this study has shown proofs with which we can infer the type of the mental lexicon of the human cerebrum through full-list dictionary and decomposition dictionary which were automatically produced in the study.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124473966","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}
At July 2008, the nationwide DMB (digital multimedia broadcasting) has got started. As DMB device's volume of sales has been over 12 million already, the development of rapidly changing network systems has increased the dangers of infringing the copyright of DMB contents. For solving this problem, we suggest that real-time encryption algorithm without additional expenses, and implemented that on PMP. We used the SEED algorithm for encryption. As the experimental result, we confirmed that the real-time encryption and decryption of DMB videos were working well. Also confirmed that recorded contents in PMP were not replayed in other devices, and also the contents recorded by other devices were not played in PMP. Suggested algorithms can be useful in the VOD, IPTV or cable TV.
{"title":"The Recording Method of Real Time DMB Encryption for PMP","authors":"Seong-Yeon Lee, Gyeong-Yeon Cho, Jong-Nam Kim","doi":"10.1109/FGCNS.2008.47","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.47","url":null,"abstract":"At July 2008, the nationwide DMB (digital multimedia broadcasting) has got started. As DMB device's volume of sales has been over 12 million already, the development of rapidly changing network systems has increased the dangers of infringing the copyright of DMB contents. For solving this problem, we suggest that real-time encryption algorithm without additional expenses, and implemented that on PMP. We used the SEED algorithm for encryption. As the experimental result, we confirmed that the real-time encryption and decryption of DMB videos were working well. Also confirmed that recorded contents in PMP were not replayed in other devices, and also the contents recorded by other devices were not played in PMP. Suggested algorithms can be useful in the VOD, IPTV or cable TV.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122715802","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 current paper, exponential synchronization is discussed for chaotic neural networks with time-varying delays. Based on Lyapunov stability theory and linear matrix inequality (LMI), a nonlinear feedback control scheme is designed to synchronize the drive system and the response one. The obtained sufficient conditions are in the forms of LMI, so much easier to verify. Moreover, numerical simulation shows the effectiveness of this nonlinear control scheme.
{"title":"Synchronization of Delayed Chaotic Neural Networks by LMI","authors":"R. Wu, Weiwei Zhang","doi":"10.1109/FGCNS.2008.117","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.117","url":null,"abstract":"In the current paper, exponential synchronization is discussed for chaotic neural networks with time-varying delays. Based on Lyapunov stability theory and linear matrix inequality (LMI), a nonlinear feedback control scheme is designed to synchronize the drive system and the response one. The obtained sufficient conditions are in the forms of LMI, so much easier to verify. Moreover, numerical simulation shows the effectiveness of this nonlinear control scheme.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123107739","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}
Alibaba.com is one of the leading B2B e-Commerce companies in China. It provides an e-Marketplace connecting small and medium-sized buyers and suppliers both in China and around the world. Alibaba.com has grown admirably from its initial beginning as a general e-Market to a giant e-Marketplace. During its rapid growth, it has incurred challenges and becomes more expose to a greater competition. Currently the quality of its services and achieving profitability remain Alibaba's greatest challenges. In this paper we examine the key factors of Alibabapsilas success, including strong brand, providing customers with outstanding value and a superior shopping experience, massive sales volume and realizing economies of scale.
{"title":"A Model for Value-Added e-Market Provisioning: Case Study from Alibaba.com","authors":"Honghong Qing","doi":"10.1109/FGCNS.2008.93","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.93","url":null,"abstract":"Alibaba.com is one of the leading B2B e-Commerce companies in China. It provides an e-Marketplace connecting small and medium-sized buyers and suppliers both in China and around the world. Alibaba.com has grown admirably from its initial beginning as a general e-Market to a giant e-Marketplace. During its rapid growth, it has incurred challenges and becomes more expose to a greater competition. Currently the quality of its services and achieving profitability remain Alibaba's greatest challenges. In this paper we examine the key factors of Alibabapsilas success, including strong brand, providing customers with outstanding value and a superior shopping experience, massive sales volume and realizing economies of scale.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132149205","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}
Edge detection plays an important role in digital image processing. Based on the non-decimated wavelet which is shift invariant, in this paper, we develop a new edge detecting technique using hidden Markov chain (HMC) model. With this proposed model (NWHMC), each wavelet coefficient contains a hidden state, herein, we adopt Laplacian model and Gaussian model to represent the information of the state ldquobigrdquo and the state ldquosmall.rdquo The model can be trained by EM algorithm, and then we employ Viterbi algorithm to reveal the hidden state of each coefficient according to MAP estimation. The detecting results of several images are provided to evaluate the algorithm. In addition, the algorithm can be applied to noisy images efficiently.
{"title":"Image Edge Detection Using Hidden Markov Chain Model Based on the Non-Decimated Wavelet","authors":"Renqi Zhang, Wanli Ouyang, W. Cham","doi":"10.1109/FGCNS.2008.20","DOIUrl":"https://doi.org/10.1109/FGCNS.2008.20","url":null,"abstract":"Edge detection plays an important role in digital image processing. Based on the non-decimated wavelet which is shift invariant, in this paper, we develop a new edge detecting technique using hidden Markov chain (HMC) model. With this proposed model (NWHMC), each wavelet coefficient contains a hidden state, herein, we adopt Laplacian model and Gaussian model to represent the information of the state ldquobigrdquo and the state ldquosmall.rdquo The model can be trained by EM algorithm, and then we employ Viterbi algorithm to reveal the hidden state of each coefficient according to MAP estimation. The detecting results of several images are provided to evaluate the algorithm. In addition, the algorithm can be applied to noisy images efficiently.","PeriodicalId":370780,"journal":{"name":"2008 Second International Conference on Future Generation Communication and Networking Symposia","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128369312","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
扫码关注我们
求助内容：
应助结果提醒方式：