Pub Date : 2010-04-16DOI: 10.1109/ICIME.2010.5477499
Xiaofeng Wang, Fengling Zhang
The rise of frame theory in applied mathe-unities is due to the flexibility and redundancy of frames. In this work, the notion of a generalized multiresolution structure of L2(R) is proposed. The definition of multiple pseudoframes for subspaces of L2(R) is given. The construction of a generalized multiresolution structure of Paley-Wiener subspaces of L2(R) is investigated. The sufficient condition for the existence of multiple pseudoframes for subspaces of L2(R) is derived based on such a generalized multiresolution structure. The pyramid decomposition scheme is also obtained.
{"title":"Subspace Affine Pseudoframes with a Generalized Multiresolution Structure and the Pyramid Decomposition Scheme","authors":"Xiaofeng Wang, Fengling Zhang","doi":"10.1109/ICIME.2010.5477499","DOIUrl":"https://doi.org/10.1109/ICIME.2010.5477499","url":null,"abstract":"The rise of frame theory in applied mathe-unities is due to the flexibility and redundancy of frames. In this work, the notion of a generalized multiresolution structure of L2(R) is proposed. The definition of multiple pseudoframes for subspaces of L2(R) is given. The construction of a generalized multiresolution structure of Paley-Wiener subspaces of L2(R) is investigated. The sufficient condition for the existence of multiple pseudoframes for subspaces of L2(R) is derived based on such a generalized multiresolution structure. The pyramid decomposition scheme is also obtained.","PeriodicalId":135441,"journal":{"name":"2009 International Conference on Computational Intelligence and Software Engineering","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116691634","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 : 2009-12-28DOI: 10.1109/CISE.2009.5362716
Liang Li, Shibao Lu, Xuesong Chu, Guangming Yu
The parameters used in harmony search algorithm and particle swarm optimization are found to be of importance to the results, however, there are no theoretical bases or formulae to determine the values of the parameters. A combinatorial method is proposed which combing the harmony search procedure and the particle swarm optimization for the determination of critical slip surfaces of soil slopes. The individuals in the harmony memory are divided into two equal groups, one of which is used to perform the particle swarm optimization algorithm, and the other is adopted in the generation of new harmony in harmony search algorithm, the optimums found by these two groups are compared and communal learning mechanism is formed. In addition, the dynamic adaptation strategy for the determination of values of parameters in these two algorithms is proposed. This combinatorial search algorithm is demonstrated to be efficient and effective for the slope stability analysis. KeywordsArtificial intelligence; Harmony search algorithm; Particle swarm optimization; Slope stability analysis
{"title":"A Combinatorial Search Method Based on Harmony Search Algorithm and Particle Swarm Optimization in Slope Stability Analysis","authors":"Liang Li, Shibao Lu, Xuesong Chu, Guangming Yu","doi":"10.1109/CISE.2009.5362716","DOIUrl":"https://doi.org/10.1109/CISE.2009.5362716","url":null,"abstract":"The parameters used in harmony search algorithm and particle swarm optimization are found to be of importance to the results, however, there are no theoretical bases or formulae to determine the values of the parameters. A combinatorial method is proposed which combing the harmony search procedure and the particle swarm optimization for the determination of critical slip surfaces of soil slopes. The individuals in the harmony memory are divided into two equal groups, one of which is used to perform the particle swarm optimization algorithm, and the other is adopted in the generation of new harmony in harmony search algorithm, the optimums found by these two groups are compared and communal learning mechanism is formed. In addition, the dynamic adaptation strategy for the determination of values of parameters in these two algorithms is proposed. This combinatorial search algorithm is demonstrated to be efficient and effective for the slope stability analysis. KeywordsArtificial intelligence; Harmony search algorithm; Particle swarm optimization; Slope stability analysis","PeriodicalId":135441,"journal":{"name":"2009 International Conference on Computational Intelligence and Software Engineering","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115135288","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 : 2009-12-28DOI: 10.1109/CISE.2009.5363101
Shaohua Wang, F. Bian
Coordination decision is the important problem of E- Government currently. Multi-agent is a problem solving networks by the formation of collaborative among many agents. It can enhance the capacity of the entire system through the task decomposition and task coordination. Mobile-agent, is a software that can autonomous migrate from one host to another host in heterogeneous network, and have interactive function with other agent or resources. Mobile-agent is independent of the specific host and Transport Protocol for the conduct of seamless system integration to provide an extremely favorable conditions. This paper presents a framework of coordination decision system of E-Government based on multi-agent system, then illustrates the the working model and process of entities among the framework,and discuss a example.
{"title":"Coordination Decision System Based on Multi-Agent","authors":"Shaohua Wang, F. Bian","doi":"10.1109/CISE.2009.5363101","DOIUrl":"https://doi.org/10.1109/CISE.2009.5363101","url":null,"abstract":"Coordination decision is the important problem of E- Government currently. Multi-agent is a problem solving networks by the formation of collaborative among many agents. It can enhance the capacity of the entire system through the task decomposition and task coordination. Mobile-agent, is a software that can autonomous migrate from one host to another host in heterogeneous network, and have interactive function with other agent or resources. Mobile-agent is independent of the specific host and Transport Protocol for the conduct of seamless system integration to provide an extremely favorable conditions. This paper presents a framework of coordination decision system of E-Government based on multi-agent system, then illustrates the the working model and process of entities among the framework,and discuss a example.","PeriodicalId":135441,"journal":{"name":"2009 International Conference on Computational Intelligence and Software Engineering","volume":"199 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115161830","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 : 2009-12-28DOI: 10.1109/CISE.2009.5363901
Zhang Lin, Lianglong Da, Yanxia Zhou
Computational ocean acoustics is an important aspect of oceanographic physics. In this paper, a new ocean acoustic model is developed in computational oceanographic physics, which is called ray-mode-parabolic equation (RMPE) theory. The RMPE solution is expressed in terms of the normal modes in vertical direction and the mode coefficients in horizontal direction. The model is based on the beam-displacement ray- mode (BDRM) theory and the parabolic equation (PE) method. By using the BDRM theory, the normal mode analysis can be processed efficiently and rapidly. The PE method is used to solve the wave equations for mode coefficients. The numerical simulations on sound propagation and the comparison with experimental data from a sloping-bottom area in South China Sea are discussed. The results show that it is efficient and practical to apply this model to solving problems involing underwater sound propagation in range-dependent ocean.
{"title":"A New Ocean Acoustic Model in Computational Oceanographic Physics","authors":"Zhang Lin, Lianglong Da, Yanxia Zhou","doi":"10.1109/CISE.2009.5363901","DOIUrl":"https://doi.org/10.1109/CISE.2009.5363901","url":null,"abstract":"Computational ocean acoustics is an important aspect of oceanographic physics. In this paper, a new ocean acoustic model is developed in computational oceanographic physics, which is called ray-mode-parabolic equation (RMPE) theory. The RMPE solution is expressed in terms of the normal modes in vertical direction and the mode coefficients in horizontal direction. The model is based on the beam-displacement ray- mode (BDRM) theory and the parabolic equation (PE) method. By using the BDRM theory, the normal mode analysis can be processed efficiently and rapidly. The PE method is used to solve the wave equations for mode coefficients. The numerical simulations on sound propagation and the comparison with experimental data from a sloping-bottom area in South China Sea are discussed. The results show that it is efficient and practical to apply this model to solving problems involing underwater sound propagation in range-dependent ocean.","PeriodicalId":135441,"journal":{"name":"2009 International Conference on Computational Intelligence and Software Engineering","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115663937","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 : 2009-12-28DOI: 10.1109/CISE.2009.5366930
Hailang He, Tongcheng Huang, Bing Xie, Xingliang Li
Space division multiple access(SDMA) is a technique that can be superimposed on traditional multiple access schemes to increase the system capacity, such as frequency division multiple access(FDMA), time division multiple access(TDMA) or code division multiple access(CDMA). SDMA technology employs antenna arrays and multi- dimensional nonlinear signal processing techniques to provide significant increases capacity and quality of many wireless communication systems. Several works have been carried out to examine the improvement in the system capacity provided by SDMA. Based on the theoretical analysis and simulate model, the blocking probability of the proposed scheme is simulated and compared in this paper.
{"title":"Blocking Probability Simulation Based on SDMA Systems","authors":"Hailang He, Tongcheng Huang, Bing Xie, Xingliang Li","doi":"10.1109/CISE.2009.5366930","DOIUrl":"https://doi.org/10.1109/CISE.2009.5366930","url":null,"abstract":"Space division multiple access(SDMA) is a technique that can be superimposed on traditional multiple access schemes to increase the system capacity, such as frequency division multiple access(FDMA), time division multiple access(TDMA) or code division multiple access(CDMA). SDMA technology employs antenna arrays and multi- dimensional nonlinear signal processing techniques to provide significant increases capacity and quality of many wireless communication systems. Several works have been carried out to examine the improvement in the system capacity provided by SDMA. Based on the theoretical analysis and simulate model, the blocking probability of the proposed scheme is simulated and compared in this paper.","PeriodicalId":135441,"journal":{"name":"2009 International Conference on Computational Intelligence and Software Engineering","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123054526","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 : 2009-12-28DOI: 10.1109/CISE.2009.5366890
Qing Xiong, Jian Hu, Si-ming Zhao
the effects of low intensity of heating treatments and storage conditions on growth properties of mould in rice were investigated and a model was obtained to describe the growth properties of mould. The parameters of growth properties of rice mould were obtained in order to provide the information for the control of rice mould. The rice samples were treated with traditional heating and microwave radiation, then were stored in the conditions of 20~35 °C and 75%~97%(Relative Humidity) for 30 days. Rice mould counts were enumerated periodically. There were lag phases for the rice mould during storage. The growth properties of rice mould were fitted to Gompertz equation precisely. The growth rate constant was between 0.015 ~0.6 d and was influenced by heating methods and storage conditions. The growth rate constant of rice mould treated by the two heating methods was lower than that of the control, whereas the amplitude difference between the treatments and control was reduced as the temperature risen, and the value of the mould treated by microwave radiation was bigger than that of traditional heating. The equivalent mould counts increased as the temperature risen, the values of mould treated with heating are higher in comparison with the control and the difference was more obvious when the treated mould were stored in low temperature and low relative humidity.
{"title":"Effects of Heating and Storage Conditions on Growth Properties of Mould in Rice","authors":"Qing Xiong, Jian Hu, Si-ming Zhao","doi":"10.1109/CISE.2009.5366890","DOIUrl":"https://doi.org/10.1109/CISE.2009.5366890","url":null,"abstract":"the effects of low intensity of heating treatments and storage conditions on growth properties of mould in rice were investigated and a model was obtained to describe the growth properties of mould. The parameters of growth properties of rice mould were obtained in order to provide the information for the control of rice mould. The rice samples were treated with traditional heating and microwave radiation, then were stored in the conditions of 20~35 °C and 75%~97%(Relative Humidity) for 30 days. Rice mould counts were enumerated periodically. There were lag phases for the rice mould during storage. The growth properties of rice mould were fitted to Gompertz equation precisely. The growth rate constant was between 0.015 ~0.6 d and was influenced by heating methods and storage conditions. The growth rate constant of rice mould treated by the two heating methods was lower than that of the control, whereas the amplitude difference between the treatments and control was reduced as the temperature risen, and the value of the mould treated by microwave radiation was bigger than that of traditional heating. The equivalent mould counts increased as the temperature risen, the values of mould treated with heating are higher in comparison with the control and the difference was more obvious when the treated mould were stored in low temperature and low relative humidity.","PeriodicalId":135441,"journal":{"name":"2009 International Conference on Computational Intelligence and Software Engineering","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123148428","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 : 2009-12-28DOI: 10.1109/CISE.2009.5366632
Yinan Lu, Yong Quan, Zhenhua Zhang, G. Wang
This paper describes an improved segmentation algorithm based on Minimum Spanning Tree (MST) for contentbased image retrieval system. MST segmentation is computationally efficient and captures both global and local image information, but it is prone to incur over-segmentation because of its neighbor system. To address this problem, an adaptive neighbor mode in the improved segmentation is defined by adding links between non-neighbor pixels of an image. The meaningful regions of an image are segmented automatically, and the region-based color features are exacted for the dominant segmented regions. The texture features are exacted using the Gabor filters, and are combined with the color features for retrieval The Experiments are performed using a medical database containing 370 images and the experimental results are shown and described finally. Keywords-MST segmentation; image retrieval; Gabor filter
{"title":"MST Segmentation for Content-Based Medical Image Retrieval","authors":"Yinan Lu, Yong Quan, Zhenhua Zhang, G. Wang","doi":"10.1109/CISE.2009.5366632","DOIUrl":"https://doi.org/10.1109/CISE.2009.5366632","url":null,"abstract":"This paper describes an improved segmentation algorithm based on Minimum Spanning Tree (MST) for contentbased image retrieval system. MST segmentation is computationally efficient and captures both global and local image information, but it is prone to incur over-segmentation because of its neighbor system. To address this problem, an adaptive neighbor mode in the improved segmentation is defined by adding links between non-neighbor pixels of an image. The meaningful regions of an image are segmented automatically, and the region-based color features are exacted for the dominant segmented regions. The texture features are exacted using the Gabor filters, and are combined with the color features for retrieval The Experiments are performed using a medical database containing 370 images and the experimental results are shown and described finally. Keywords-MST segmentation; image retrieval; Gabor filter","PeriodicalId":135441,"journal":{"name":"2009 International Conference on Computational Intelligence and Software Engineering","volume":"126 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123152434","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 : 2009-12-28DOI: 10.1109/CISE.2009.5362682
Zhichao Wen, Bo Zhou, Di Wu
there are lots of sensitive and confidential data in financial field, such as credit card number, stock number, fund number and so on. Therefore, top level security requirement is always required in financial systems, where a good access control framework is necessary. Traditional role-based access control frameworks lack of control in data access granularity and often slow down the system, even though it provides an efficient access control model which can restrict users' operation according to their roles. They can hardly meet the requirements in large financial system. This article proposes and implements a Three- Layer Role-based Access Control framework (TL-RBAC) which can perfectly meet the requirements in large financial system. TL-RBAC implements access control in three layers: web pages, operations and data. Coarse-grained access control in web pages layer is used to filter anonymous attacks such as web scan and DoS attacks. Fine-grained access control in operations and data layers guarantee that the user cannot do operations and access data out of his privilege. Performance testing report of the system shows that TL-RBAC meets the performance requirement in terms of system throughput and time per operation. In order to meet security requirements of the financial system without system performance depreciation, this paper extend traditional RBAC model, designs and implements a Three-Layer Role-based Access Control (TL-RBAC). The first layer is coarse-grained access control to web pages implements by SiteMinder, which is an access control production of CA. The second layer is in web application, it makes access control by associating users and their operations. The third layer is fine-grained access control implements through database store procedure. Coarse-grained access control layer is used to filter illegal operation and hackers' attack in large scale to accelerate frequent access control. Fine-grained access control is used to bind user to the data within his privilege. In this case, user can't do any operations beyond his privilege under TL-RBAC framework and also achieves great performances in terms of throughput and time per operation.
{"title":"Three-Layers Role-Based Access Control Framework in Large Financial Web Systems","authors":"Zhichao Wen, Bo Zhou, Di Wu","doi":"10.1109/CISE.2009.5362682","DOIUrl":"https://doi.org/10.1109/CISE.2009.5362682","url":null,"abstract":"there are lots of sensitive and confidential data in financial field, such as credit card number, stock number, fund number and so on. Therefore, top level security requirement is always required in financial systems, where a good access control framework is necessary. Traditional role-based access control frameworks lack of control in data access granularity and often slow down the system, even though it provides an efficient access control model which can restrict users' operation according to their roles. They can hardly meet the requirements in large financial system. This article proposes and implements a Three- Layer Role-based Access Control framework (TL-RBAC) which can perfectly meet the requirements in large financial system. TL-RBAC implements access control in three layers: web pages, operations and data. Coarse-grained access control in web pages layer is used to filter anonymous attacks such as web scan and DoS attacks. Fine-grained access control in operations and data layers guarantee that the user cannot do operations and access data out of his privilege. Performance testing report of the system shows that TL-RBAC meets the performance requirement in terms of system throughput and time per operation. In order to meet security requirements of the financial system without system performance depreciation, this paper extend traditional RBAC model, designs and implements a Three-Layer Role-based Access Control (TL-RBAC). The first layer is coarse-grained access control to web pages implements by SiteMinder, which is an access control production of CA. The second layer is in web application, it makes access control by associating users and their operations. The third layer is fine-grained access control implements through database store procedure. Coarse-grained access control layer is used to filter illegal operation and hackers' attack in large scale to accelerate frequent access control. Fine-grained access control is used to bind user to the data within his privilege. In this case, user can't do any operations beyond his privilege under TL-RBAC framework and also achieves great performances in terms of throughput and time per operation.","PeriodicalId":135441,"journal":{"name":"2009 International Conference on Computational Intelligence and Software Engineering","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124469000","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 : 2009-12-28DOI: 10.1109/CISE.2009.5365415
Mei Li, Huacan He, Yi Jin, Shu-bao Liu
Ternary logic optical processor which is completed according to Decreased-Radix Design Principle (DRDP) can construct all dualistic ternary logic operators (add up to19683 kinds). There is no carry propagation of addition of Modified Signed Digit (MSD) representation and the computation only needs several dualistic ternary logical transformations. Thus, MSD addition completed by ternary logic optical processor can be fully-parallel and no carry. The principle, working steps and experiment results of this new method are discussed. Keywords-parallel additon; MSD; ternary logic optical processor; DRDP
{"title":"MSD Addition by Ternary Logic Optical Processor","authors":"Mei Li, Huacan He, Yi Jin, Shu-bao Liu","doi":"10.1109/CISE.2009.5365415","DOIUrl":"https://doi.org/10.1109/CISE.2009.5365415","url":null,"abstract":"Ternary logic optical processor which is completed according to Decreased-Radix Design Principle (DRDP) can construct all dualistic ternary logic operators (add up to19683 kinds). There is no carry propagation of addition of Modified Signed Digit (MSD) representation and the computation only needs several dualistic ternary logical transformations. Thus, MSD addition completed by ternary logic optical processor can be fully-parallel and no carry. The principle, working steps and experiment results of this new method are discussed. Keywords-parallel additon; MSD; ternary logic optical processor; DRDP","PeriodicalId":135441,"journal":{"name":"2009 International Conference on Computational Intelligence and Software Engineering","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114660999","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 : 2009-12-28DOI: 10.1109/CISE.2009.5366389
Chao Yi
According to the foreign classical models of the trust development, the paper firstly explores the dynamic development model of the trust between the entrepreneur and the venture capitalist; secondly, the paper proposes two kinds of the trust using way: the exploiting and the exploratory; finally, the paper empirically examines the positive impact of the trust’s development and the using way on entrepreneurial performance through the data investigation, which has drawn the corresponding conclusion. Keywords-entrepreneur;venture capitalist; trust; entrepreneurial performance
{"title":"An Impact Study of Trust between Entrepreneur and Venture Capitalist on Entrepreneurial Performance","authors":"Chao Yi","doi":"10.1109/CISE.2009.5366389","DOIUrl":"https://doi.org/10.1109/CISE.2009.5366389","url":null,"abstract":"According to the foreign classical models of the trust development, the paper firstly explores the dynamic development model of the trust between the entrepreneur and the venture capitalist; secondly, the paper proposes two kinds of the trust using way: the exploiting and the exploratory; finally, the paper empirically examines the positive impact of the trust’s development and the using way on entrepreneurial performance through the data investigation, which has drawn the corresponding conclusion. Keywords-entrepreneur;venture capitalist; trust; entrepreneurial performance","PeriodicalId":135441,"journal":{"name":"2009 International Conference on Computational Intelligence and Software Engineering","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114664774","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
扫码关注我们
求助内容：
应助结果提醒方式：