This paper discusses propagation of perturbations along traffic flow modeled by a modified second-order macroscopic model through the wavefront expansion technique. The coefficients in this expansion satisfy a sequence of transport equations that can be solved analytically. One of these analytic solutions yields information about wavefront shock. Numerical simulations based on a Pade approximation of this expansion were done at the end of this paper and results showed that propagation of perturbations at traffic flow speed conforms to the theoretical analysis results.
{"title":"Wave propagation of the traffic flow dynamic model based on wavefront expansion.","authors":"Li Li, Peng-fei Shi","doi":"10.1631/jzus.2004.1398","DOIUrl":"https://doi.org/10.1631/jzus.2004.1398","url":null,"abstract":"<p><p>This paper discusses propagation of perturbations along traffic flow modeled by a modified second-order macroscopic model through the wavefront expansion technique. The coefficients in this expansion satisfy a sequence of transport equations that can be solved analytically. One of these analytic solutions yields information about wavefront shock. Numerical simulations based on a Pade approximation of this expansion were done at the end of this paper and results showed that propagation of perturbations at traffic flow speed conforms to the theoretical analysis results.</p>","PeriodicalId":85042,"journal":{"name":"Journal of Zhejiang University. Science","volume":"5 11","pages":"1398-404"},"PeriodicalIF":0.0,"publicationDate":"2004-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.2004.1398","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"24770448","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 two dimensional problem of simply supported laminated isotropic strips with viscoelastic interfaces and under static loading was studied. Exact solution was derived based on the exact elasticity equation and the Kevin-Voigt viscoelastic interfacial model. Numerical computations were performed for a strip consisting of three layers of equal thickness. Results indicated that the response of the laminate was very sensitive to the presence of viscoelastic interfaces.
{"title":"Time-dependent response of laminated isotropic strips with viscoelastic interfaces.","authors":"Wei Yan, Wei-qiu Chen","doi":"10.1631/jzus.2004.1318","DOIUrl":"https://doi.org/10.1631/jzus.2004.1318","url":null,"abstract":"<p><p>The two dimensional problem of simply supported laminated isotropic strips with viscoelastic interfaces and under static loading was studied. Exact solution was derived based on the exact elasticity equation and the Kevin-Voigt viscoelastic interfacial model. Numerical computations were performed for a strip consisting of three layers of equal thickness. Results indicated that the response of the laminate was very sensitive to the presence of viscoelastic interfaces.</p>","PeriodicalId":85042,"journal":{"name":"Journal of Zhejiang University. Science","volume":"5 11","pages":"1318-21"},"PeriodicalIF":0.0,"publicationDate":"2004-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.2004.1318","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"24771057","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}
How to share experience and resources among learners is becoming one of the hottest topics in the field of E-Learning collaborative techniques. An intuitive way to achieve this objective is to group learners which can help each other into the same community and help them learn collaboratively. In this paper, we proposed a novel community self-organization model based on multi-agent mechanism, which can automatically group learners with similar preferences and capabilities. In particular, we proposed award and exchange schemas with evaluation and preference track records to raise the performance of this algorithm. The description of learner capability, the matchmaking process, the definition of evaluation and preference track records, the rules of award and exchange schemas and the self-organization algorithm are all discussed in this paper. Meanwhile, a prototype has been built to verify the validity and efficiency of the algorithm. Experiments based on real learner data showed that this mechanism can organize learner communities properly and efficiently; and that it has sustainable improved efficiency and scalability.
{"title":"A novel self-organizing E-Learner community model with award and exchange mechanisms.","authors":"Fan Yang, Rui-min Shen, Peng Han","doi":"10.1631/jzus.2004.1343","DOIUrl":"https://doi.org/10.1631/jzus.2004.1343","url":null,"abstract":"<p><p>How to share experience and resources among learners is becoming one of the hottest topics in the field of E-Learning collaborative techniques. An intuitive way to achieve this objective is to group learners which can help each other into the same community and help them learn collaboratively. In this paper, we proposed a novel community self-organization model based on multi-agent mechanism, which can automatically group learners with similar preferences and capabilities. In particular, we proposed award and exchange schemas with evaluation and preference track records to raise the performance of this algorithm. The description of learner capability, the matchmaking process, the definition of evaluation and preference track records, the rules of award and exchange schemas and the self-organization algorithm are all discussed in this paper. Meanwhile, a prototype has been built to verify the validity and efficiency of the algorithm. Experiments based on real learner data showed that this mechanism can organize learner communities properly and efficiently; and that it has sustainable improved efficiency and scalability.</p>","PeriodicalId":85042,"journal":{"name":"Journal of Zhejiang University. Science","volume":"5 11","pages":"1343-51"},"PeriodicalIF":0.0,"publicationDate":"2004-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.2004.1343","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"24771061","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}
This paper proposes a Genetic Programming-Based Modeling (GPM) algorithm on chaotic time series. GP is used here to search for appropriate model structures in function space, and the Particle Swarm Optimization (PSO) algorithm is used for Nonlinear Parameter Estimation (NPE) of dynamic model structures. In addition, GPM integrates the results of Nonlinear Time Series Analysis (NTSA) to adjust the parameters and takes them as the criteria of established models. Experiments showed the effectiveness of such improvements on chaotic time series modeling.
{"title":"Genetic programming-based chaotic time series modeling.","authors":"Wei Zhang, Zhi-ming Wu, Gen-ke Yang","doi":"10.1631/jzus.2004.1432","DOIUrl":"https://doi.org/10.1631/jzus.2004.1432","url":null,"abstract":"<p><p>This paper proposes a Genetic Programming-Based Modeling (GPM) algorithm on chaotic time series. GP is used here to search for appropriate model structures in function space, and the Particle Swarm Optimization (PSO) algorithm is used for Nonlinear Parameter Estimation (NPE) of dynamic model structures. In addition, GPM integrates the results of Nonlinear Time Series Analysis (NTSA) to adjust the parameters and takes them as the criteria of established models. Experiments showed the effectiveness of such improvements on chaotic time series modeling.</p>","PeriodicalId":85042,"journal":{"name":"Journal of Zhejiang University. Science","volume":"5 11","pages":"1432-9"},"PeriodicalIF":0.0,"publicationDate":"2004-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.2004.1432","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"24771509","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 development of modern industry, sheet-metal parts in mass production have been widely applied in mechanical, communication, electronics, and light industries in recent decades; but the advances in sheet-metal part design and manufacturing remain too slow compared with the increasing importance of sheet-metal parts in modern industry. This paper proposes a method for automatically extracting features from an arbitrary solid model of sheet-metal parts; whose characteristics are used for classification and graph-based representation of the sheet-metal features to extract the features embodied in a sheet-metal part. The extracting feature process can be divided for valid checking of the model geometry, feature matching, and feature relationship. Since the extracted features include abundant geometry and engineering information, they will be effective for downstream application such as feature rebuilding and stamping process planning.
{"title":"Automatically extracting sheet-metal features from solid model.","authors":"Zhi-jian Liu, Jian-jun Li, Yi-lin Wang, Cai-yuan Li, Xiang-zhi Xiao","doi":"10.1631/jzus.2004.1456","DOIUrl":"https://doi.org/10.1631/jzus.2004.1456","url":null,"abstract":"<p><p>With the development of modern industry, sheet-metal parts in mass production have been widely applied in mechanical, communication, electronics, and light industries in recent decades; but the advances in sheet-metal part design and manufacturing remain too slow compared with the increasing importance of sheet-metal parts in modern industry. This paper proposes a method for automatically extracting features from an arbitrary solid model of sheet-metal parts; whose characteristics are used for classification and graph-based representation of the sheet-metal features to extract the features embodied in a sheet-metal part. The extracting feature process can be divided for valid checking of the model geometry, feature matching, and feature relationship. Since the extracted features include abundant geometry and engineering information, they will be effective for downstream application such as feature rebuilding and stamping process planning.</p>","PeriodicalId":85042,"journal":{"name":"Journal of Zhejiang University. Science","volume":"5 11","pages":"1456-65"},"PeriodicalIF":0.0,"publicationDate":"2004-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.2004.1456","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"24771512","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}
World Wide Web (WWW) is a vast repository of information, including a great deal of geographic information. But the location and retrieval of geographic information will require a significant amount of time and effort. In addition, different users usually have different views and interests in the same information. To resolve such problems, this paper first proposed a model of geographic information gathering based on multi-Agent (MA) architecture. Then based on this model, we construct a prototype system with GML (Geography Markup Language). This system consists of three tiers-Client, Web Server and Data Resource. Finally, we expatiate on the process of Web Server.
{"title":"A multi-agent system architecture for geographic information gathering.","authors":"Gang-Yi Gao, Shen-Kang Wang","doi":"10.1631/jzus.2004.1367","DOIUrl":"https://doi.org/10.1631/jzus.2004.1367","url":null,"abstract":"<p><p>World Wide Web (WWW) is a vast repository of information, including a great deal of geographic information. But the location and retrieval of geographic information will require a significant amount of time and effort. In addition, different users usually have different views and interests in the same information. To resolve such problems, this paper first proposed a model of geographic information gathering based on multi-Agent (MA) architecture. Then based on this model, we construct a prototype system with GML (Geography Markup Language). This system consists of three tiers-Client, Web Server and Data Resource. Finally, we expatiate on the process of Web Server.</p>","PeriodicalId":85042,"journal":{"name":"Journal of Zhejiang University. Science","volume":"5 11","pages":"1367-73"},"PeriodicalIF":0.0,"publicationDate":"2004-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.2004.1367","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"24770444","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}
This paper presents a methodology for off-line handwritten Chinese character recognition based on mergence of consecutive segments of adaptive duration. The handwritten Chinese character string is partitioned into a sequence of consecutive segments, which are combined to implement dissimilarity evaluation within a sliding window whose durations are determined adaptively by the integration of shapes and context of evaluations. The average stroke width is estimated for the handwritten Chinese character string, and a set of candidate character segmentation boundaries is found by using the integration of pixel and stroke features. The final decisions on segmentation and recognition are made under minimal arithmetical mean dissimilarities. Experiments proved that the proposed approach of adaptive duration outperforms the method of fixed duration, and is very effective for the recognition of overlapped, broken, touched, loosely configured Chinese characters.
{"title":"An approach to offline handwritten Chinese character recognition based on segment evaluation of adaptive duration.","authors":"Guo-hong Li, Peng-fei Shi","doi":"10.1631/jzus.2004.1392","DOIUrl":"https://doi.org/10.1631/jzus.2004.1392","url":null,"abstract":"<p><p>This paper presents a methodology for off-line handwritten Chinese character recognition based on mergence of consecutive segments of adaptive duration. The handwritten Chinese character string is partitioned into a sequence of consecutive segments, which are combined to implement dissimilarity evaluation within a sliding window whose durations are determined adaptively by the integration of shapes and context of evaluations. The average stroke width is estimated for the handwritten Chinese character string, and a set of candidate character segmentation boundaries is found by using the integration of pixel and stroke features. The final decisions on segmentation and recognition are made under minimal arithmetical mean dissimilarities. Experiments proved that the proposed approach of adaptive duration outperforms the method of fixed duration, and is very effective for the recognition of overlapped, broken, touched, loosely configured Chinese characters.</p>","PeriodicalId":85042,"journal":{"name":"Journal of Zhejiang University. Science","volume":"5 11","pages":"1392-7"},"PeriodicalIF":0.0,"publicationDate":"2004-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.2004.1392","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"24770447","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}
A stochastic optimal control strategy for partially observable nonlinear quasi Hamiltonian systems is proposed. The optimal control forces consist of two parts. The first part is determined by the conditions under which the stochastic optimal control problem of a partially observable nonlinear system is converted into that of a completely observable linear system. The second part is determined by solving the dynamical programming equation derived by applying the stochastic averaging method and stochastic dynamical programming principle to the completely observable linear control system. The response of the optimally controlled quasi Hamiltonian system is predicted by solving the averaged Fokker-Planck-Kolmogorov equation associated with the optimally controlled completely observable linear system and solving the Riccati equation for the estimated error of system states. An example is given to illustrate the procedure and effectiveness of the proposed control strategy.
{"title":"On stochastic optimal control of partially observable nonlinear quasi Hamiltonian systems.","authors":"Wei-qiu Zhu, Zu-guang Ying","doi":"10.1631/jzus.2004.1313","DOIUrl":"https://doi.org/10.1631/jzus.2004.1313","url":null,"abstract":"<p><p>A stochastic optimal control strategy for partially observable nonlinear quasi Hamiltonian systems is proposed. The optimal control forces consist of two parts. The first part is determined by the conditions under which the stochastic optimal control problem of a partially observable nonlinear system is converted into that of a completely observable linear system. The second part is determined by solving the dynamical programming equation derived by applying the stochastic averaging method and stochastic dynamical programming principle to the completely observable linear control system. The response of the optimally controlled quasi Hamiltonian system is predicted by solving the averaged Fokker-Planck-Kolmogorov equation associated with the optimally controlled completely observable linear system and solving the Riccati equation for the estimated error of system states. An example is given to illustrate the procedure and effectiveness of the proposed control strategy.</p>","PeriodicalId":85042,"journal":{"name":"Journal of Zhejiang University. Science","volume":"5 11","pages":"1313-7"},"PeriodicalIF":0.0,"publicationDate":"2004-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.2004.1313","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"24771056","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}
A new framework for consciousness is introduced based upon traditional artificial neural network models. This framework reflects explicit connections between two parts of the brain: one global working memory and distributed modular cerebral networks relating to specific brain functions. Accordingly this framework is composed of three layers, physical mnemonic layer and abstract thinking layer, which cooperate together through a recognition layer to accomplish information storage and cognition using algorithms of how these interactions contribute to consciousness: (1) the reception process whereby cerebral subsystems group distributed signals into coherent object patterns; (2) the partial recognition process whereby patterns from particular subsystems are compared or stored as knowledge; and (3) the resonant learning process whereby global workspace stably adjusts its structure to adapt to patterns' changes. Using this framework, various sorts of human actions can be explained, leading to a general approach for analyzing brain functions.
{"title":"A hybrid neural network model for consciousness.","authors":"Jie Lin, Xiao-gang Jin, Jian-gang Yang","doi":"10.1631/jzus.2004.1440","DOIUrl":"https://doi.org/10.1631/jzus.2004.1440","url":null,"abstract":"<p><p>A new framework for consciousness is introduced based upon traditional artificial neural network models. This framework reflects explicit connections between two parts of the brain: one global working memory and distributed modular cerebral networks relating to specific brain functions. Accordingly this framework is composed of three layers, physical mnemonic layer and abstract thinking layer, which cooperate together through a recognition layer to accomplish information storage and cognition using algorithms of how these interactions contribute to consciousness: (1) the reception process whereby cerebral subsystems group distributed signals into coherent object patterns; (2) the partial recognition process whereby patterns from particular subsystems are compared or stored as knowledge; and (3) the resonant learning process whereby global workspace stably adjusts its structure to adapt to patterns' changes. Using this framework, various sorts of human actions can be explained, leading to a general approach for analyzing brain functions.</p>","PeriodicalId":85042,"journal":{"name":"Journal of Zhejiang University. Science","volume":"5 11","pages":"1440-8"},"PeriodicalIF":0.0,"publicationDate":"2004-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.2004.1440","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"24771510","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}
This paper discusses the existence and uniqueness of the generalized solution in the sense of Colombeau to the Benjamin-Ono (B-O) equation and the relationship between the new generalized solution and the classical solution.
{"title":"Generalized solutions to the Benjamin-Ono equations in sense of Colombeau.","authors":"Xiao-gang Jin, Jian-gang Yang, Jie Lin","doi":"10.1631/jzus.2004.1466","DOIUrl":"https://doi.org/10.1631/jzus.2004.1466","url":null,"abstract":"<p><p>This paper discusses the existence and uniqueness of the generalized solution in the sense of Colombeau to the Benjamin-Ono (B-O) equation and the relationship between the new generalized solution and the classical solution.</p>","PeriodicalId":85042,"journal":{"name":"Journal of Zhejiang University. Science","volume":"5 11","pages":"1466-70"},"PeriodicalIF":0.0,"publicationDate":"2004-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1631/jzus.2004.1466","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"24771513","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}