Pub Date : 2013-09-08DOI: 10.1109/BRICS-CCI-CBIC.2013.69
Y. Orlova
The paper describes the computer-aided system for automation of the initial stages of multi-component software design, which is based on the semantic analysis of text. Automation lead to increasing in the quality of software development. The paper considers an approach to automation of the initial stages of software design. Program tools, which provide automated semantic analysis of technical documentation, automated construction of models, synthesis of structure and natural language description of the program software, are developed.
{"title":"Approach to Automation of the Initial Stages of Software Design","authors":"Y. Orlova","doi":"10.1109/BRICS-CCI-CBIC.2013.69","DOIUrl":"https://doi.org/10.1109/BRICS-CCI-CBIC.2013.69","url":null,"abstract":"The paper describes the computer-aided system for automation of the initial stages of multi-component software design, which is based on the semantic analysis of text. Automation lead to increasing in the quality of software development. The paper considers an approach to automation of the initial stages of software design. Program tools, which provide automated semantic analysis of technical documentation, automated construction of models, synthesis of structure and natural language description of the program software, are developed.","PeriodicalId":306195,"journal":{"name":"2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129319471","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 : 2013-09-08DOI: 10.1109/BRICS-CCI-CBIC.2013.13
Leonardo Enzo Brito da Silva, J. A. F. Costa
This paper presents an automatic clustering system, built as a committee machine, which is used to cohesively partition the self-organizing map. In the proposed method, each expert from the committee machine analyzes the connections of the neuron grid based on a particular similarity matrix, and thus decides which ones should be pruned by gradually removing them and observing the intervals of stability. Those intervals are regarded as the ones in which the number of clusters found through connected components remain constant. The output of each expert is a connectivity matrix that effectively expresses which connections should remain as a binary true or false value. The final stage of the committee machine consists of combining the outputs of the experts, and through majority voting establish which connections should remain in the grid, and hence performing the segmentation of the map. The system was evaluated through its application to synthetic and real world data sets.
{"title":"Clustering the Self-Organizing Map Based on the Neurons' Associated Pattern Sets","authors":"Leonardo Enzo Brito da Silva, J. A. F. Costa","doi":"10.1109/BRICS-CCI-CBIC.2013.13","DOIUrl":"https://doi.org/10.1109/BRICS-CCI-CBIC.2013.13","url":null,"abstract":"This paper presents an automatic clustering system, built as a committee machine, which is used to cohesively partition the self-organizing map. In the proposed method, each expert from the committee machine analyzes the connections of the neuron grid based on a particular similarity matrix, and thus decides which ones should be pruned by gradually removing them and observing the intervals of stability. Those intervals are regarded as the ones in which the number of clusters found through connected components remain constant. The output of each expert is a connectivity matrix that effectively expresses which connections should remain as a binary true or false value. The final stage of the committee machine consists of combining the outputs of the experts, and through majority voting establish which connections should remain in the grid, and hence performing the segmentation of the map. The system was evaluated through its application to synthetic and real world data sets.","PeriodicalId":306195,"journal":{"name":"2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence","volume":"146 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122420401","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 : 2013-09-08DOI: 10.1109/BRICS-CCI-CBIC.2013.55
Michael Mitnovitsky, M. Shpitalni, M. Cohen
This paper examines a flexible flow shop problem that considers dynamic events, such as stochastic job arrivals, uncertain processing times, unexpected machine breakdowns and the possibility of processing flexibility. To achieve this goal, a new agent-based adaptive control system has been developed at the factory level, along with advanced decision-making strategies that provide responsive factories with adaptation and reconfiguration capabilities and advanced complementary scheduling abilities. The aim is to facilitate operational flexibility and increase productivity as well as offer strategic advantages such as analysis of factory development options by simulation. The feasibility of the proposed system is demonstrated by simulation under various experimental settings, among them shop utilization level, due date tightness and breakdown level.
{"title":"Operation and Control of Manufacturing Systems by Agents with Local Intelligence","authors":"Michael Mitnovitsky, M. Shpitalni, M. Cohen","doi":"10.1109/BRICS-CCI-CBIC.2013.55","DOIUrl":"https://doi.org/10.1109/BRICS-CCI-CBIC.2013.55","url":null,"abstract":"This paper examines a flexible flow shop problem that considers dynamic events, such as stochastic job arrivals, uncertain processing times, unexpected machine breakdowns and the possibility of processing flexibility. To achieve this goal, a new agent-based adaptive control system has been developed at the factory level, along with advanced decision-making strategies that provide responsive factories with adaptation and reconfiguration capabilities and advanced complementary scheduling abilities. The aim is to facilitate operational flexibility and increase productivity as well as offer strategic advantages such as analysis of factory development options by simulation. The feasibility of the proposed system is demonstrated by simulation under various experimental settings, among them shop utilization level, due date tightness and breakdown level.","PeriodicalId":306195,"journal":{"name":"2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence","volume":"548 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123244011","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 : 2013-09-08DOI: 10.1109/BRICS-CCI-CBIC.2013.85
Bhekisipho Twala, Thembinkosi Nkonyana
Mapping and classification of human settlements from remotely sensed data has attracted a lot of attention in recent years. Real world data, however, often suffer from corruptions or noise but not always known. This is the heart of information-based remote sensing models. This paper investigates the impact of incomplete remotely sensed data in the evaluation of machine learning techniques (classifiers) for the task of predicting or classifying pixels into different land cover region types. Six classifiers are empirically evaluated by artificially simulating different missing data proportions, patterns and mechanisms using a multispectral image dataset. A 4-way repeated measures design is employed to analyse the data. The simulation results suggest classifiers as having their strengths and limitations in terms of dealing with the incomplete data problem with the artificial neural network classifier as substantially inferior and naïve Bayes classifier and support vector machines representing superior approaches.
{"title":"Extracting Supervised Learning Classifiers from Possibly Incomplete Remotely Sensed Data","authors":"Bhekisipho Twala, Thembinkosi Nkonyana","doi":"10.1109/BRICS-CCI-CBIC.2013.85","DOIUrl":"https://doi.org/10.1109/BRICS-CCI-CBIC.2013.85","url":null,"abstract":"Mapping and classification of human settlements from remotely sensed data has attracted a lot of attention in recent years. Real world data, however, often suffer from corruptions or noise but not always known. This is the heart of information-based remote sensing models. This paper investigates the impact of incomplete remotely sensed data in the evaluation of machine learning techniques (classifiers) for the task of predicting or classifying pixels into different land cover region types. Six classifiers are empirically evaluated by artificially simulating different missing data proportions, patterns and mechanisms using a multispectral image dataset. A 4-way repeated measures design is employed to analyse the data. The simulation results suggest classifiers as having their strengths and limitations in terms of dealing with the incomplete data problem with the artificial neural network classifier as substantially inferior and naïve Bayes classifier and support vector machines representing superior approaches.","PeriodicalId":306195,"journal":{"name":"2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121999433","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 : 2013-09-08DOI: 10.1109/BRICS-CCI-CBIC.2013.111
Tobias Jordan, A. Presse, Paulo Cordeiro, F. Buarque, Marcelo Pita
This work presents the implementation of an agent based model concept to simulate a sample of the German society under a governmental social transfer system. Subsequently the behavior of the model is analyzed under changing conditions in order to proof that it can be used for the simulation of real societies under similar conditions. An important objective is to give evidence on economic interdependencies between individual behavior, governmental interaction and macroeconomic outcomes. The model is based on the economic concept of Homo Oeconomicus, while it widens some restrictions of this concept aiming to create a framework that resembles reality more closely. Our analysis provides evidence that the model works reasonably well and can serve as a basis for more detailed investigations.
{"title":"Computer Simulations of Small Societies Under Social Transfer Systems","authors":"Tobias Jordan, A. Presse, Paulo Cordeiro, F. Buarque, Marcelo Pita","doi":"10.1109/BRICS-CCI-CBIC.2013.111","DOIUrl":"https://doi.org/10.1109/BRICS-CCI-CBIC.2013.111","url":null,"abstract":"This work presents the implementation of an agent based model concept to simulate a sample of the German society under a governmental social transfer system. Subsequently the behavior of the model is analyzed under changing conditions in order to proof that it can be used for the simulation of real societies under similar conditions. An important objective is to give evidence on economic interdependencies between individual behavior, governmental interaction and macroeconomic outcomes. The model is based on the economic concept of Homo Oeconomicus, while it widens some restrictions of this concept aiming to create a framework that resembles reality more closely. Our analysis provides evidence that the model works reasonably well and can serve as a basis for more detailed investigations.","PeriodicalId":306195,"journal":{"name":"2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114490062","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 : 2013-09-08DOI: 10.1109/BRICS-CCI-CBIC.2013.51
J. Grobler, A. Engelbrecht
This paper investigates various strategies for the management of solution space diversity within the context of a meta-hyper heuristic algorithm. The adaptive local search meta-hyper heuristic (ALSHH), which adaptively applies a local search algorithm when the population diversity strays outside a predetermined solution space diversity profile, is proposed. ALSHH was shown to compare favourably with algorithms making use of local search and diversity maintenance strategies applied at constant intervals throughout the optimization run. Good performance is also demonstrated with respect to two other popular multi-method algorithms.
{"title":"Solution Space Diversity Management in a Meta-hyperheuristic Framework","authors":"J. Grobler, A. Engelbrecht","doi":"10.1109/BRICS-CCI-CBIC.2013.51","DOIUrl":"https://doi.org/10.1109/BRICS-CCI-CBIC.2013.51","url":null,"abstract":"This paper investigates various strategies for the management of solution space diversity within the context of a meta-hyper heuristic algorithm. The adaptive local search meta-hyper heuristic (ALSHH), which adaptively applies a local search algorithm when the population diversity strays outside a predetermined solution space diversity profile, is proposed. ALSHH was shown to compare favourably with algorithms making use of local search and diversity maintenance strategies applied at constant intervals throughout the optimization run. Good performance is also demonstrated with respect to two other popular multi-method algorithms.","PeriodicalId":306195,"journal":{"name":"2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence","volume":"213 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132129406","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 : 2013-09-08DOI: 10.1109/BRICS-CCI-CBIC.2013.78
Rodrigo Silva, H. S. Lopes, W. Godoy
Vehicle Ad hoc Network (VANET) provides an opportunity for innovation in the transportation area, enabling services for Intelligent Transportation System (ITS). Because of VANET features, such as highly dynamic networks topology and frequent discontinuity, it is desirable to establish, at a given moment, routes for fast delivery of messages, having a low probability of disconnection. This leads to a multiobjective problem. In this work we propose multiobjective heuristic algorithm, based on ACO (Ant Colony Optimization) to find routes considering the best commitment between the shortest path (number of nodes in a route) and the lowest probability of disconnection. Simulations were done with three different scenarios: static routing, static routing with obstacles, and dynamic routing. Results were very promising, obtained with small computational effort, and allowing the use of the algorithm for real-time optimization.
{"title":"A Heuristic Algorithm Based on Ant Colony Optimization for Multi-objective Routing in Vehicle Ad Hoc Networks","authors":"Rodrigo Silva, H. S. Lopes, W. Godoy","doi":"10.1109/BRICS-CCI-CBIC.2013.78","DOIUrl":"https://doi.org/10.1109/BRICS-CCI-CBIC.2013.78","url":null,"abstract":"Vehicle Ad hoc Network (VANET) provides an opportunity for innovation in the transportation area, enabling services for Intelligent Transportation System (ITS). Because of VANET features, such as highly dynamic networks topology and frequent discontinuity, it is desirable to establish, at a given moment, routes for fast delivery of messages, having a low probability of disconnection. This leads to a multiobjective problem. In this work we propose multiobjective heuristic algorithm, based on ACO (Ant Colony Optimization) to find routes considering the best commitment between the shortest path (number of nodes in a route) and the lowest probability of disconnection. Simulations were done with three different scenarios: static routing, static routing with obstacles, and dynamic routing. Results were very promising, obtained with small computational effort, and allowing the use of the algorithm for real-time optimization.","PeriodicalId":306195,"journal":{"name":"2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131959642","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 : 2013-09-08DOI: 10.1109/BRICS-CCI-CBIC.2013.42
I. Batyrshin
It is surprising that last two decades many works in time series data mining and clustering were concerned with measures of similarity of time series but not with measures of association that can be used for measuring possible direct and inverse relationships between time series. Inverse relationships can exist between dynamics of prices and sell volumes, between growth patterns of competitive companies, between well production data in oilfields, between wind velocity and air pollution concentration etc. The paper develops a theoretical basis for analysis and construction of time series shape association measures. Starting from the axioms of time series shape association measures it studies the methods of construction of measures satisfying these axioms. Several general methods of construction of such measures suitable for measuring time series shape similarity and shape association are proposed. Time series shape association measures based on Minkowski distance and data standardization methods are considered. The cosine similarity and the Pearson's correlation coefficient are obtained as partial cases of the proposed general methods that can be used also for construction of new association measures in data analysis.
{"title":"Constructing Time Series Shape Association Measures: Minkowski Distance and Data Standardization","authors":"I. Batyrshin","doi":"10.1109/BRICS-CCI-CBIC.2013.42","DOIUrl":"https://doi.org/10.1109/BRICS-CCI-CBIC.2013.42","url":null,"abstract":"It is surprising that last two decades many works in time series data mining and clustering were concerned with measures of similarity of time series but not with measures of association that can be used for measuring possible direct and inverse relationships between time series. Inverse relationships can exist between dynamics of prices and sell volumes, between growth patterns of competitive companies, between well production data in oilfields, between wind velocity and air pollution concentration etc. The paper develops a theoretical basis for analysis and construction of time series shape association measures. Starting from the axioms of time series shape association measures it studies the methods of construction of measures satisfying these axioms. Several general methods of construction of such measures suitable for measuring time series shape similarity and shape association are proposed. Time series shape association measures based on Minkowski distance and data standardization methods are considered. The cosine similarity and the Pearson's correlation coefficient are obtained as partial cases of the proposed general methods that can be used also for construction of new association measures in data analysis.","PeriodicalId":306195,"journal":{"name":"2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130214966","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 : 2013-09-08DOI: 10.1109/BRICS-CCI-CBIC.2013.96
C. Silva, Frederico Gadelha Guimarães
Power Distribution Network Reconfiguration demands the change of current state of the network in order to reach optimal operation according to some previouly defined figures of merit. This paper presents a new methodology based on Multi-Agent Systems for power distribution network reconfiguration aiming at minimizing power losses based on game theory. The principal characteristic of the game is the interpretation of the payoff matrix as having physical meaning. This way allowed better decisions to be taken in order to improve the overall performance of the network. Test cases with 100 buses/1 feeder and 83 buses/11 feeders in operation mode were taken as example of application of the proposed algorithm and to illustrate its success.
{"title":"Reconfiguration of Power Distribution Networks by Multi-agent Systems","authors":"C. Silva, Frederico Gadelha Guimarães","doi":"10.1109/BRICS-CCI-CBIC.2013.96","DOIUrl":"https://doi.org/10.1109/BRICS-CCI-CBIC.2013.96","url":null,"abstract":"Power Distribution Network Reconfiguration demands the change of current state of the network in order to reach optimal operation according to some previouly defined figures of merit. This paper presents a new methodology based on Multi-Agent Systems for power distribution network reconfiguration aiming at minimizing power losses based on game theory. The principal characteristic of the game is the interpretation of the payoff matrix as having physical meaning. This way allowed better decisions to be taken in order to improve the overall performance of the network. Test cases with 100 buses/1 feeder and 83 buses/11 feeders in operation mode were taken as example of application of the proposed algorithm and to illustrate its success.","PeriodicalId":306195,"journal":{"name":"2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132739481","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 : 2013-09-08DOI: 10.1109/BRICS-CCI-CBIC.2013.77
Bilzã Araújo, Liang Zhao
Network-based Semi-Supervised Learning (NbSSL) propagates labels in affinity-networks by taking advantage of the network topology likewise information spreading in trust networks. In NbSSL, not only the unlabeled data instances, but also the labeled ones, are able to bias the classification performance. Herein, we show some results and discussion on this phenomenon. Even the suitability of the free parameters of the NbSSL algorithms varies according to the available labeled data. Indeed, we propose a method for selecting representative data instances for labeling for NbSSL. In our sense the represent ability of a node is related to how inhomogeneous is its profile concerning the whole network. The proposed method uses Complex Networks centrality measures to identify which nodes present inhomogeneous profile. We perform this study by applying three NbSSL algorithms on Girvan-Newman and Lancichinetti-Fortunato-Radicchi modular networks. In the former, the nodes with high clustering coefficient are good representatives of the data and the nodes with high betweenness are the good representatives ones in the later. A high clustering coefficient means that the node lies in a much connected motif (clique) whereas a high betweenness means that the node lies interconnecting the modular structures. These results reveal the ability to improve the NbSSL performance by selecting representative data instances for manual labeling.
{"title":"Selecting Nodes with Inhomogeneous Profile for Labeling for Network-Based Semi-supervised Learning","authors":"Bilzã Araújo, Liang Zhao","doi":"10.1109/BRICS-CCI-CBIC.2013.77","DOIUrl":"https://doi.org/10.1109/BRICS-CCI-CBIC.2013.77","url":null,"abstract":"Network-based Semi-Supervised Learning (NbSSL) propagates labels in affinity-networks by taking advantage of the network topology likewise information spreading in trust networks. In NbSSL, not only the unlabeled data instances, but also the labeled ones, are able to bias the classification performance. Herein, we show some results and discussion on this phenomenon. Even the suitability of the free parameters of the NbSSL algorithms varies according to the available labeled data. Indeed, we propose a method for selecting representative data instances for labeling for NbSSL. In our sense the represent ability of a node is related to how inhomogeneous is its profile concerning the whole network. The proposed method uses Complex Networks centrality measures to identify which nodes present inhomogeneous profile. We perform this study by applying three NbSSL algorithms on Girvan-Newman and Lancichinetti-Fortunato-Radicchi modular networks. In the former, the nodes with high clustering coefficient are good representatives of the data and the nodes with high betweenness are the good representatives ones in the later. A high clustering coefficient means that the node lies in a much connected motif (clique) whereas a high betweenness means that the node lies interconnecting the modular structures. These results reveal the ability to improve the NbSSL performance by selecting representative data instances for manual labeling.","PeriodicalId":306195,"journal":{"name":"2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130782090","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
扫码关注我们
求助内容：
应助结果提醒方式：