Pub Date : 2010-10-31DOI: 10.4156/JCIT.VOL5.ISSUE8.26
Xueying Tian
As an effective way to share corporate social responsibility, corporate donation comes forth rapidly and has become a tendency. Based on the relative study, we construct the theoretical model and analyze the relationship between corporate donation and corporate competitive advantage. The results are listed that five donation characteristics, that is, donation aims, donation methods, donation sums, donation fields and selected non-profit organizations influence corporate competitive advantage by affecting three dimensions of corporate social capital.
{"title":"Influence of Philanthropy Donation on Competitive Advantage: From the Perspective of Corporate Social Capital","authors":"Xueying Tian","doi":"10.4156/JCIT.VOL5.ISSUE8.26","DOIUrl":"https://doi.org/10.4156/JCIT.VOL5.ISSUE8.26","url":null,"abstract":"As an effective way to share corporate social responsibility, corporate donation comes forth rapidly and has become a tendency. Based on the relative study, we construct the theoretical model and analyze the relationship between corporate donation and corporate competitive advantage. The results are listed that five donation characteristics, that is, donation aims, donation methods, donation sums, donation fields and selected non-profit organizations influence corporate competitive advantage by affecting three dimensions of corporate social capital.","PeriodicalId":360193,"journal":{"name":"J. Convergence Inf. Technol.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134340215","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-10-31DOI: 10.4156/JCIT.VOL5.ISSUE8.12
Yunni Xia, Z. OuYang, Yanxin Wu, Ruilong Yang
Web Service Choreography Description Language is a main-stream standard for the description of peer-to-peer collaborations for the participants for service composition. To predict the performance of composite service processes gives the way to tell whether the process meet the non-functional requirements, and to choose the process with better performance from those with identical function. Unfortunately, very limited research attention is paid to performance of service choreography. In this paper, we propose a translation-based approach for performance prediction of composite service. To translate a composite service into a state-transition model for quantitative analysis, we first give a set of translation rules to map service choreography elements into general-stochastic-petri-nets (GSPN). Based on the GSPN representation, we introduce the prediction algorithm to calculate the expectedprocess-normal-completion-time. In the case study, we also obtain experimental results using the WSCDL+ execution engine and validate the accuracy of theoretical results by showing 95% confidence intervals derived from experimental results perfectly cover theoretical prediction values.
{"title":"Determing Performance of Choreography-based Composite Services","authors":"Yunni Xia, Z. OuYang, Yanxin Wu, Ruilong Yang","doi":"10.4156/JCIT.VOL5.ISSUE8.12","DOIUrl":"https://doi.org/10.4156/JCIT.VOL5.ISSUE8.12","url":null,"abstract":"Web Service Choreography Description Language is a main-stream standard for the description of peer-to-peer collaborations for the participants for service composition. To predict the performance of composite service processes gives the way to tell whether the process meet the non-functional requirements, and to choose the process with better performance from those with identical function. Unfortunately, very limited research attention is paid to performance of service choreography. In this paper, we propose a translation-based approach for performance prediction of composite service. To translate a composite service into a state-transition model for quantitative analysis, we first give a set of translation rules to map service choreography elements into general-stochastic-petri-nets (GSPN). Based on the GSPN representation, we introduce the prediction algorithm to calculate the expectedprocess-normal-completion-time. In the case study, we also obtain experimental results using the WSCDL+ execution engine and validate the accuracy of theoretical results by showing 95% confidence intervals derived from experimental results perfectly cover theoretical prediction values.","PeriodicalId":360193,"journal":{"name":"J. Convergence Inf. Technol.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132358468","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-10-31DOI: 10.4156/JCIT.VOL5.ISSUE8.3
Shouju Li, Li Wu, Fuzheng Qu, Wei Sun
A calibration process is developed to determine the parameter values. Three-axial compressions tests in laboratory and neural network are used to determine the material internal friction angle and stiffness, respectively. These tests are repeated numerically using PFC models with different sets of particle friction coefficients and particle stiffness values. Three-axial compressions tests are found to be dependent on both the particle friction coefficient and the particle stiffness. The compression test results can be used to determine a unique set of particle friction and particle stiffness values. The calibration process is validated by modelling filling process of head chamber of shield machine. It is shown that the parameter estimation procedure proposed in the paper can accurately predict the deformation characteristics and flow patterns of conditioned soils.
{"title":"Parameter Estimation of Particle Flow Model for Soils Using Neural Networks","authors":"Shouju Li, Li Wu, Fuzheng Qu, Wei Sun","doi":"10.4156/JCIT.VOL5.ISSUE8.3","DOIUrl":"https://doi.org/10.4156/JCIT.VOL5.ISSUE8.3","url":null,"abstract":"A calibration process is developed to determine the parameter values. Three-axial compressions tests in laboratory and neural network are used to determine the material internal friction angle and stiffness, respectively. These tests are repeated numerically using PFC models with different sets of particle friction coefficients and particle stiffness values. Three-axial compressions tests are found to be dependent on both the particle friction coefficient and the particle stiffness. The compression test results can be used to determine a unique set of particle friction and particle stiffness values. The calibration process is validated by modelling filling process of head chamber of shield machine. It is shown that the parameter estimation procedure proposed in the paper can accurately predict the deformation characteristics and flow patterns of conditioned soils.","PeriodicalId":360193,"journal":{"name":"J. Convergence Inf. Technol.","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116598178","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-10-31DOI: 10.4156/JCIT.VOL5.ISSUE8.7
Youfu Wu, Jing Wu
Moments are widely used in pattern recognition, image processing, and computer vision and multi resolution analysis. In this paper, we first printout Gaussian-Hermite moments, and propose a new method to extract the object’s features based on Gaussian-Hermite moments. Following, for training ART neural network, the moment features were inputted to ART as its parameters; so that, a classifier was realized for recognizing the moving objects. The experiment results are reported also, which show the good performance of our method.
{"title":"Recognizing Moving Objects Based on Gaussian-Hermite Moments and ART Neural Networks","authors":"Youfu Wu, Jing Wu","doi":"10.4156/JCIT.VOL5.ISSUE8.7","DOIUrl":"https://doi.org/10.4156/JCIT.VOL5.ISSUE8.7","url":null,"abstract":"Moments are widely used in pattern recognition, image processing, and computer vision and multi resolution analysis. In this paper, we first printout Gaussian-Hermite moments, and propose a new method to extract the object’s features based on Gaussian-Hermite moments. Following, for training ART neural network, the moment features were inputted to ART as its parameters; so that, a classifier was realized for recognizing the moving objects. The experiment results are reported also, which show the good performance of our method.","PeriodicalId":360193,"journal":{"name":"J. Convergence Inf. Technol.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125869476","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-10-31DOI: 10.4156/JCIT.VOL5.ISSUE8.13
Chein-Shung Hwang
Recommender systems have been emerging as a powerful technique of e-commerce. The majority of existing recommender systems uses an overall rating value on items for evaluating user’s preference opinions. Because users might express their opinions based on some specific features of the item, recommender systems solely based on a single criterion could produce recommendations that do not meet user needs. In this paper, we propose a mechanism for integrating multiple criteria into the Collaborative Filtering (CF) algorithm. Specifically, we present the implementation of Genetic Algorithms (GA) for optimal feature weighting. The proposed system consists of two main parts. First, the weight of each user toward each feature is computed by using GAs. The feature weights are then incorporated into the collaborative filtering process to provide recommendations. Empirical studies have shown that our weighting scheme can be incorporated to improve the performance of multicriteria CF.
{"title":"Genetic Algorithms for Feature Weighting in Multi-criteria Recommender Systems","authors":"Chein-Shung Hwang","doi":"10.4156/JCIT.VOL5.ISSUE8.13","DOIUrl":"https://doi.org/10.4156/JCIT.VOL5.ISSUE8.13","url":null,"abstract":"Recommender systems have been emerging as a powerful technique of e-commerce. The majority of existing recommender systems uses an overall rating value on items for evaluating user’s preference opinions. Because users might express their opinions based on some specific features of the item, recommender systems solely based on a single criterion could produce recommendations that do not meet user needs. In this paper, we propose a mechanism for integrating multiple criteria into the Collaborative Filtering (CF) algorithm. Specifically, we present the implementation of Genetic Algorithms (GA) for optimal feature weighting. The proposed system consists of two main parts. First, the weight of each user toward each feature is computed by using GAs. The feature weights are then incorporated into the collaborative filtering process to provide recommendations. Empirical studies have shown that our weighting scheme can be incorporated to improve the performance of multicriteria CF.","PeriodicalId":360193,"journal":{"name":"J. Convergence Inf. Technol.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129475007","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-10-31DOI: 10.4156/JCIT.VOL5.ISSUE8.11
Kaipeng Liu, Binxing Fang, Weizhe Zhang
The rapidly increasing popularity of social tagging systems and growing amount of users and resources make it a difficult task to find expert users and relevant resources in folksonomies. In this paper, we propose a bipartite graph-based dynamic ranking algorithm, RicoRank (Relevance and Importance inCOrporated RANK), for improving search performance in folksonomies. We combine both the query relevance and importance effectively to generate the final ranking score. We derive the query relevance from a smoothed probabilistic generative model that demonstrates user interest and resource content. We characterize the importance with the mutual reinforcement between users and resources. We assign each mutual reinforcing relation with a weight corresponding to the coherence between the associated tags, the user interest and the resource content. Finally, we employ an iterative procedure, which incorporates well with both query relevance and importance, to simultaneously compute the ranking scores of users and resource. We conduct experiments on a dataset collected from a real-world system. Experimental results on both user expertise and resource quality ranking show a convincing performance of the proposed algorithm.
随着社会标签系统的迅速普及以及用户和资源的不断增加，在大众分类法中寻找专家用户和相关资源变得非常困难。本文提出了一种基于二部图的动态排序算法RicoRank (Relevance and Importance inCOrporated RANK)，以提高大众分类法的搜索性能。我们将查询相关性和重要性有效地结合起来，生成最终的排名分数。我们从一个平滑的概率生成模型中获得查询相关性，该模型展示了用户兴趣和资源内容。我们用用户和资源之间的相互强化来描述其重要性。我们为每个相互增强的关系分配一个权重，对应于相关标签、用户兴趣和资源内容之间的一致性。最后，我们采用了一个结合查询相关性和重要性的迭代过程，同时计算用户和资源的排名分数。我们在从现实世界系统收集的数据集上进行实验。在用户专业度和资源质量排序方面的实验结果表明，该算法具有令人信服的性能。
{"title":"Incorporating Relevance and Importance for Dynamic Ranking in Folksonomies","authors":"Kaipeng Liu, Binxing Fang, Weizhe Zhang","doi":"10.4156/JCIT.VOL5.ISSUE8.11","DOIUrl":"https://doi.org/10.4156/JCIT.VOL5.ISSUE8.11","url":null,"abstract":"The rapidly increasing popularity of social tagging systems and growing amount of users and resources make it a difficult task to find expert users and relevant resources in folksonomies. In this paper, we propose a bipartite graph-based dynamic ranking algorithm, RicoRank (Relevance and Importance inCOrporated RANK), for improving search performance in folksonomies. We combine both the query relevance and importance effectively to generate the final ranking score. We derive the query relevance from a smoothed probabilistic generative model that demonstrates user interest and resource content. We characterize the importance with the mutual reinforcement between users and resources. We assign each mutual reinforcing relation with a weight corresponding to the coherence between the associated tags, the user interest and the resource content. Finally, we employ an iterative procedure, which incorporates well with both query relevance and importance, to simultaneously compute the ranking scores of users and resource. We conduct experiments on a dataset collected from a real-world system. Experimental results on both user expertise and resource quality ranking show a convincing performance of the proposed algorithm.","PeriodicalId":360193,"journal":{"name":"J. Convergence Inf. Technol.","volume":"2 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129778682","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-10-31DOI: 10.4156/JCIT.VOL5.ISSUE8.22
C. Wan, A. Hu, Juan Zhang
This paper proposes a novel authentication protocol for wireless access security. Current symmetric key based authentication schemes are vulnerable to a variety of attacks such as the denialof-service attacks and the domino effect attacks, while public key based authentication schemes are costly. This paper designed a novel elliptic curve based authentication scheme that can avoid the certificate verification cost while still enjoys strong security properties of public key based schemes.
{"title":"A Novel Authentication Protocol for Wireless Access Security","authors":"C. Wan, A. Hu, Juan Zhang","doi":"10.4156/JCIT.VOL5.ISSUE8.22","DOIUrl":"https://doi.org/10.4156/JCIT.VOL5.ISSUE8.22","url":null,"abstract":"This paper proposes a novel authentication protocol for wireless access security. Current symmetric key based authentication schemes are vulnerable to a variety of attacks such as the denialof-service attacks and the domino effect attacks, while public key based authentication schemes are costly. This paper designed a novel elliptic curve based authentication scheme that can avoid the certificate verification cost while still enjoys strong security properties of public key based schemes.","PeriodicalId":360193,"journal":{"name":"J. Convergence Inf. Technol.","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124974413","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-10-31DOI: 10.4156/JCIT.VOL5.ISSUE8.20
J. Bae
In this study, performance of classification techniques is compared in order to predict dividend policy decisions. We first analyzed the feasibility of all available companies listed in the Korea Exchange (KRX) market as dividend data sets by using classification techniques. Then we developed a prediction model based on support vector machines (SVM). We compare the classification accuracy performance between our SVM model and artificial intelligence techniques, and suggest a better dividend policy forecasting model to help a chief executive officer (CEO) or a board of directors (BOD) make better decision in a corporate dividend policy. The experiments demonstrate that the SVM model always outperforms other models in the performance of dividend policy forecasting, and hence we can predict future dividend policy more correctly than any other models. This enhancement in predictability of future dividend policy can significantly contribute to the correct valuation of a company, and hence those people from investors to financial managers to any decision makers of a company can make use of the SVM model for the better financing and investing decision making which can lead to higher profits and firm values eventually. Moreover, this is particularly important for people who want to obtain a high level of accuracy in advanced areas such as financial decision makings.
{"title":"Forecasting Decisions on Dividend Policy of South Korea Companies Listed in the Korea Exchange Market Based on Support Vector Machines","authors":"J. Bae","doi":"10.4156/JCIT.VOL5.ISSUE8.20","DOIUrl":"https://doi.org/10.4156/JCIT.VOL5.ISSUE8.20","url":null,"abstract":"In this study, performance of classification techniques is compared in order to predict dividend policy decisions. We first analyzed the feasibility of all available companies listed in the Korea Exchange (KRX) market as dividend data sets by using classification techniques. Then we developed a prediction model based on support vector machines (SVM). We compare the classification accuracy performance between our SVM model and artificial intelligence techniques, and suggest a better dividend policy forecasting model to help a chief executive officer (CEO) or a board of directors (BOD) make better decision in a corporate dividend policy. The experiments demonstrate that the SVM model always outperforms other models in the performance of dividend policy forecasting, and hence we can predict future dividend policy more correctly than any other models. This enhancement in predictability of future dividend policy can significantly contribute to the correct valuation of a company, and hence those people from investors to financial managers to any decision makers of a company can make use of the SVM model for the better financing and investing decision making which can lead to higher profits and firm values eventually. Moreover, this is particularly important for people who want to obtain a high level of accuracy in advanced areas such as financial decision makings.","PeriodicalId":360193,"journal":{"name":"J. Convergence Inf. Technol.","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121663708","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-10-31DOI: 10.4156/JCIT.VOL5.ISSUE8.15
Kai Yang, Jianfeng Ma
Clustering route is an important routing way. Combined the characteristics of WMN with clustering route commonly used in wireless mobile networks, a cluster-based hierarchical wireless mesh network architecture was proposed. At the same time, this paper presented a corresponding routing protocol lHierarchical Hybrid Routing Protocol (HHRP), which combines the advantages of proactive routing and reactive routing, and its route maintenance uses local route discovery mechanism. Simulation results using OPNET show that this clustering scheme is more suitable for hybrid wireless mesh network, and the proposed routing has less end-to-end delay, less route cost ratio and more packet delivery ratio, compared with AODV.
{"title":"A Hierarchical Hybrid Routing Protocol for Wireless Mesh Network","authors":"Kai Yang, Jianfeng Ma","doi":"10.4156/JCIT.VOL5.ISSUE8.15","DOIUrl":"https://doi.org/10.4156/JCIT.VOL5.ISSUE8.15","url":null,"abstract":"Clustering route is an important routing way. Combined the characteristics of WMN with clustering route commonly used in wireless mobile networks, a cluster-based hierarchical wireless mesh network architecture was proposed. At the same time, this paper presented a corresponding routing protocol lHierarchical Hybrid Routing Protocol (HHRP), which combines the advantages of proactive routing and reactive routing, and its route maintenance uses local route discovery mechanism. Simulation results using OPNET show that this clustering scheme is more suitable for hybrid wireless mesh network, and the proposed routing has less end-to-end delay, less route cost ratio and more packet delivery ratio, compared with AODV.","PeriodicalId":360193,"journal":{"name":"J. Convergence Inf. Technol.","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127518421","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2010-10-31DOI: 10.4156/JCIT.VOL5.ISSUE8.24
Yongheng Chen, Wanli Zuo, Fengling He, Kerui Chen
Chip Multi-Processor (CMP) could support more than two threads to execute simultaneously, and some executing units are owned by each core. Because threads share various resources of CMP, such as L2-Cache, among many threads, CMP system is inherently different from multiprocessors system and, CMP is also different from simultaneously multithreading (SMT). In this paper a novel and complete approach on how to parallelism for relational database multithreaded query execution that strives for maximum resource utilization for both CPU and disk activities. The focus of this approach is on how to use the multithreaded parallel technique to optimize and process queries based on multicore architecture. A set of algorithms for implementing and optimizing the best query plan, such as the algorithms for scheduling and parallel executing the query plan, the algorithms for allocating thread to sub-query and memory to the buffers between operations in pipelining execution, are proposed in this method. Additionally this paper analysis and optimize the implementation of parallel buffers and multithread. In the experiments, this paper evaluates performance of the parallel buffers and tests the coordination of the multithread.
{"title":"Optimization Strategy of Parallel Query Processing Based on Multi-core Architecture","authors":"Yongheng Chen, Wanli Zuo, Fengling He, Kerui Chen","doi":"10.4156/JCIT.VOL5.ISSUE8.24","DOIUrl":"https://doi.org/10.4156/JCIT.VOL5.ISSUE8.24","url":null,"abstract":"Chip Multi-Processor (CMP) could support more than two threads to execute simultaneously, and some executing units are owned by each core. Because threads share various resources of CMP, such as L2-Cache, among many threads, CMP system is inherently different from multiprocessors system and, CMP is also different from simultaneously multithreading (SMT). In this paper a novel and complete approach on how to parallelism for relational database multithreaded query execution that strives for maximum resource utilization for both CPU and disk activities. The focus of this approach is on how to use the multithreaded parallel technique to optimize and process queries based on multicore architecture. A set of algorithms for implementing and optimizing the best query plan, such as the algorithms for scheduling and parallel executing the query plan, the algorithms for allocating thread to sub-query and memory to the buffers between operations in pipelining execution, are proposed in this method. Additionally this paper analysis and optimize the implementation of parallel buffers and multithread. In the experiments, this paper evaluates performance of the parallel buffers and tests the coordination of the multithread.","PeriodicalId":360193,"journal":{"name":"J. Convergence Inf. Technol.","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134287311","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
扫码关注我们
求助内容：
应助结果提醒方式：