This paper proposes an online cake-cutting protocol without a long wait. Cake-cutting protocols are used to fairly divide a heterogeneous divisible good among some number of people. Though many protocols have been proposed, most of them assume that all people must simultaneously execute one protocol. Walsh proposed an online cake-cutting protocol, in which each player can join to the protocol at any time and leave when his portion of the cake is assigned. However, each player must wait until another player arrives, thus each player's waiting time is unbounded when no other player arrives. A deadlock might occur if the number of actually arriving players is unknown. This paper proposes a new online cake-cutting protocol without above blocking of players by introducing a discount factor to the utilities. Each player must wait for a fixed constant time if no other player arrives. The protocol is truthful, immediately envy-free, and meta-envy-free for risk-adverse players.
{"title":"A Non-blocking Online Cake-Cutting Protocol","authors":"K. Kubo, Yoshifumi Manabe","doi":"10.1109/MCSI.2016.055","DOIUrl":"https://doi.org/10.1109/MCSI.2016.055","url":null,"abstract":"This paper proposes an online cake-cutting protocol without a long wait. Cake-cutting protocols are used to fairly divide a heterogeneous divisible good among some number of people. Though many protocols have been proposed, most of them assume that all people must simultaneously execute one protocol. Walsh proposed an online cake-cutting protocol, in which each player can join to the protocol at any time and leave when his portion of the cake is assigned. However, each player must wait until another player arrives, thus each player's waiting time is unbounded when no other player arrives. A deadlock might occur if the number of actually arriving players is unknown. This paper proposes a new online cake-cutting protocol without above blocking of players by introducing a discount factor to the utilities. Each player must wait for a fixed constant time if no other player arrives. The protocol is truthful, immediately envy-free, and meta-envy-free for risk-adverse players.","PeriodicalId":421998,"journal":{"name":"2016 Third International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116545937","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In recent years, there has been observed an increase of interest in maintaining proper air quality in spaces occupied by people. Various strategies offer to provide the relevant information. In this work we consider attaining it on the basis of indoor air behavior episodes, which are evident from observations or measurements made over a period of time. Initially we focused on the automatic detection of events, which are building blocks of episodes. Events were defined as circumstances when indoor air remained under a fixed influence e.g. from a particular combination of factors affecting it. To reach the objective we applied change point analysis to the time series of a selected indoor air parameter, which was monitored in a continuous manner. There were examined two algorithms of change point detection coupled with the refining criteria, proposed using the domain knowledge. It was demonstrated that change point analysis of CO2 concentration time series allows to distinguish events associated with building use by occupants.
{"title":"Detection of Occupancy Events from Indoor Air Monitoring Data","authors":"A. Szczurek, M. Maciejewska","doi":"10.1109/MCSI.2016.050","DOIUrl":"https://doi.org/10.1109/MCSI.2016.050","url":null,"abstract":"In recent years, there has been observed an increase of interest in maintaining proper air quality in spaces occupied by people. Various strategies offer to provide the relevant information. In this work we consider attaining it on the basis of indoor air behavior episodes, which are evident from observations or measurements made over a period of time. Initially we focused on the automatic detection of events, which are building blocks of episodes. Events were defined as circumstances when indoor air remained under a fixed influence e.g. from a particular combination of factors affecting it. To reach the objective we applied change point analysis to the time series of a selected indoor air parameter, which was monitored in a continuous manner. There were examined two algorithms of change point detection coupled with the refining criteria, proposed using the domain knowledge. It was demonstrated that change point analysis of CO2 concentration time series allows to distinguish events associated with building use by occupants.","PeriodicalId":421998,"journal":{"name":"2016 Third International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"320 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116730042","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In the present paper, the desired Data/Info that the operational officers need is examined, both during the design phase and during the execution of operational missions. This information has been developed and organized by several military and civilian authorities and organizations at national and international level, but there are severe problems in acquiring external collections of Data/Info. In addition, the observatories of information and repositories of data have collapsed by their large volume. The most significant note is the fact that the desired Data/Info is directly or indirectly georeferenced, very high volume, complex, diversified, with internal correlations and therefore requires special handling. Operational officers' duty is supported by useful and powerful tools such as Geographical Information Systems, which resolve complex geographical problems in order to take accurate and timely decisions. Nowadays, organizing of Support Systems for designing, monitoring and controlling of operational procedures follow ad hoc heuristic methodologies and forms of internal architectures, which are not able to handle large volume of data core (information), to achieve upgrading, thematic augmentation or shift and do not present the required desirable inner interoperability. The complexity of these Systems does not, also, permit the increasing or modification of the range of the data core (information) functions. There are many technical difficulties in organizing large sets of Data/Info in a single (even composite) Information System. It is imperative, by a systematic and orthological way to construct suitable organized georeferenced data cores (and programs) in order to support the operational procedures for a significant number of different missions. It is possible a general, common and adaptable core program to be constructed based on the aforementioned core data.
{"title":"Panspermia of GeoData in Support Systems for Design and Execution of Operational Procedures","authors":"George Tsavdaridis, E. Koukoutsis, N. Karadimas","doi":"10.1109/MCSI.2016.046","DOIUrl":"https://doi.org/10.1109/MCSI.2016.046","url":null,"abstract":"In the present paper, the desired Data/Info that the operational officers need is examined, both during the design phase and during the execution of operational missions. This information has been developed and organized by several military and civilian authorities and organizations at national and international level, but there are severe problems in acquiring external collections of Data/Info. In addition, the observatories of information and repositories of data have collapsed by their large volume. The most significant note is the fact that the desired Data/Info is directly or indirectly georeferenced, very high volume, complex, diversified, with internal correlations and therefore requires special handling. Operational officers' duty is supported by useful and powerful tools such as Geographical Information Systems, which resolve complex geographical problems in order to take accurate and timely decisions. Nowadays, organizing of Support Systems for designing, monitoring and controlling of operational procedures follow ad hoc heuristic methodologies and forms of internal architectures, which are not able to handle large volume of data core (information), to achieve upgrading, thematic augmentation or shift and do not present the required desirable inner interoperability. The complexity of these Systems does not, also, permit the increasing or modification of the range of the data core (information) functions. There are many technical difficulties in organizing large sets of Data/Info in a single (even composite) Information System. It is imperative, by a systematic and orthological way to construct suitable organized georeferenced data cores (and programs) in order to support the operational procedures for a significant number of different missions. It is possible a general, common and adaptable core program to be constructed based on the aforementioned core data.","PeriodicalId":421998,"journal":{"name":"2016 Third International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129149901","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The purpose of the study is to analyze the accounting equation and develop a new model, based on the dual concept of monetary units and the structure of assets and claims on assets. The analysis uses the identity and characteristic functions along with a coordinate transformation, to show that the assets-claims on assets relationship involves a change in claims on assets value. The identity function represents the dual concept of the monetary units and the characteristic function relates both sides of the accounting equation. A different number of dimensions arise on each side of the equation, and a coordinate transformation is applied to have both sides of the equation with two dimensions. This transformation results in a change in the value of claims on assets. Finally, a computation using a probability density function or kernel is proposed to allow approaching the coefficients of the new model. Results show that the accounting equation consists of a series of addition functions to sum up all the monetary units and that a new model with a probability density function can help in the analysis of the assets-claims on assets relationship.
{"title":"The Accounting Equation and Claims on Assets Value Change","authors":"F. Juárez","doi":"10.1109/MCSI.2016.053","DOIUrl":"https://doi.org/10.1109/MCSI.2016.053","url":null,"abstract":"The purpose of the study is to analyze the accounting equation and develop a new model, based on the dual concept of monetary units and the structure of assets and claims on assets. The analysis uses the identity and characteristic functions along with a coordinate transformation, to show that the assets-claims on assets relationship involves a change in claims on assets value. The identity function represents the dual concept of the monetary units and the characteristic function relates both sides of the accounting equation. A different number of dimensions arise on each side of the equation, and a coordinate transformation is applied to have both sides of the equation with two dimensions. This transformation results in a change in the value of claims on assets. Finally, a computation using a probability density function or kernel is proposed to allow approaching the coefficients of the new model. Results show that the accounting equation consists of a series of addition functions to sum up all the monetary units and that a new model with a probability density function can help in the analysis of the assets-claims on assets relationship.","PeriodicalId":421998,"journal":{"name":"2016 Third International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130374888","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 unique characteristics of the laser pulses as a processing tool in the field of high performance, solution processed and flexible bulk heterojunction organic solar cells (OSCs), as a case study in the research activities of the nanoelectronics & organic electronics research activities, are presented. The proposed techniques is strongly believed open new avenues towards the design and construction of the next generation OSCs.
{"title":"Advanced Laser Processes for Energy Production","authors":"K. Petridis, Emannuel Kymakis, Emannuel Stratakis","doi":"10.1109/MCSI.2016.012","DOIUrl":"https://doi.org/10.1109/MCSI.2016.012","url":null,"abstract":"The unique characteristics of the laser pulses as a processing tool in the field of high performance, solution processed and flexible bulk heterojunction organic solar cells (OSCs), as a case study in the research activities of the nanoelectronics & organic electronics research activities, are presented. The proposed techniques is strongly believed open new avenues towards the design and construction of the next generation OSCs.","PeriodicalId":421998,"journal":{"name":"2016 Third International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115944586","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 use of nonlinear model such as Hammerstein model in MPC will lead necessarily to a nonlinear cost function and so that a nonconvex one. Consequently, the use of a convenient optimization method to solve the resulting nonconvex problem is required. The use of the based gradient method (BGM) requires a higher computation time. Therefore the use of this type of algorithms can't be applied for system with fast dynamic. The Nelder Mead (NM) algorithm is a deterministic optimization method that does not require derivative computation. This method is able to determine the control sequence, solution of the MPC optimization problem with a low computation burden and computation time. A comparative study between the NM algorithm and the BGM based on computation time is established. These two algorithm are implemented on a SISO and a MIMO Hammerstein model.
{"title":"Fast Extremum Seeking of Model Predictive Control Based on Hammerstein Model","authors":"Chagra Wassila, Degachi Hajer, Ksouri Moufida","doi":"10.1109/MCSI.2016.056","DOIUrl":"https://doi.org/10.1109/MCSI.2016.056","url":null,"abstract":"The use of nonlinear model such as Hammerstein model in MPC will lead necessarily to a nonlinear cost function and so that a nonconvex one. Consequently, the use of a convenient optimization method to solve the resulting nonconvex problem is required. The use of the based gradient method (BGM) requires a higher computation time. Therefore the use of this type of algorithms can't be applied for system with fast dynamic. The Nelder Mead (NM) algorithm is a deterministic optimization method that does not require derivative computation. This method is able to determine the control sequence, solution of the MPC optimization problem with a low computation burden and computation time. A comparative study between the NM algorithm and the BGM based on computation time is established. These two algorithm are implemented on a SISO and a MIMO Hammerstein model.","PeriodicalId":421998,"journal":{"name":"2016 Third International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129970697","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}
Bendato Ilaria, Cassettari Lucia, Fioribello Simone, Giribone Pier Giuseppe
The optimal conditions evaluation in complex stochastic systems modelled through Discrete Event Simulation is often extremely costly in computational terms. Especially when the number of variables involved is high, as in the case of manufacturing systems, the duration of each simulation run can last even several hours of calculation. It therefore becomes very important to use an optimal search method that allows the experimenter to reduce as much as possible the number of function evaluations analysed. With this goal, the Authors compared the performance of a new nature-inspired Heuristic called Attraction Force Optimization (AFO), with those of traditional algorithms, applying these different methodologies to a real industrial case. The authors believe that the obtained results could be of great interest to the scientific community and the AFO heuristic can become a valuable reference for discrete event simulation-based optimization problems.
{"title":"Optimization of Stochastic Discrete Event Simulation Models Using \"AFO\" Heuristic","authors":"Bendato Ilaria, Cassettari Lucia, Fioribello Simone, Giribone Pier Giuseppe","doi":"10.1109/MCSI.2016.029","DOIUrl":"https://doi.org/10.1109/MCSI.2016.029","url":null,"abstract":"The optimal conditions evaluation in complex stochastic systems modelled through Discrete Event Simulation is often extremely costly in computational terms. Especially when the number of variables involved is high, as in the case of manufacturing systems, the duration of each simulation run can last even several hours of calculation. It therefore becomes very important to use an optimal search method that allows the experimenter to reduce as much as possible the number of function evaluations analysed. With this goal, the Authors compared the performance of a new nature-inspired Heuristic called Attraction Force Optimization (AFO), with those of traditional algorithms, applying these different methodologies to a real industrial case. The authors believe that the obtained results could be of great interest to the scientific community and the AFO heuristic can become a valuable reference for discrete event simulation-based optimization problems.","PeriodicalId":421998,"journal":{"name":"2016 Third International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127815541","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 Axelrod model for the evolution of cultural domains is a stochastic spatial process, with parameters the number of cultural features f and their states q, that has been studied primarily by numerical simulations in social sciences and statistical physics. It may also be viewed as an asynchronous cellular automaton that exhibits a phase transition or, for a certain range of its parameters, as a distributed consensus (albeit, non-optimal) algorithm. Recently, rigorous results on this model were achieved, which are useful to benchmark simulations or for comparison with the numerical findings. We review these results in one and two dimensions and we also offer a heuristic for an open problem. Namely, our heuristic indicates that consensus is reached in one dimension if f = q = 3, conditional on the existence of an appropriately defined infinite open path in the initial configuration.
{"title":"Average Domain Size Scales Like Population Size in the Absorbing Configurations of the One-Dimensional Axelrod Model with Three Features and Three States","authors":"S. Scarlatos","doi":"10.1109/MCSI.2016.051","DOIUrl":"https://doi.org/10.1109/MCSI.2016.051","url":null,"abstract":"The Axelrod model for the evolution of cultural domains is a stochastic spatial process, with parameters the number of cultural features f and their states q, that has been studied primarily by numerical simulations in social sciences and statistical physics. It may also be viewed as an asynchronous cellular automaton that exhibits a phase transition or, for a certain range of its parameters, as a distributed consensus (albeit, non-optimal) algorithm. Recently, rigorous results on this model were achieved, which are useful to benchmark simulations or for comparison with the numerical findings. We review these results in one and two dimensions and we also offer a heuristic for an open problem. Namely, our heuristic indicates that consensus is reached in one dimension if f = q = 3, conditional on the existence of an appropriately defined infinite open path in the initial configuration.","PeriodicalId":421998,"journal":{"name":"2016 Third International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129395863","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}
Y. L. Karnavas, I. Chasiotis, Emmanouil D. Peponakis
Aim of this work is the development of a competitive alternate design topology (in terms of power density) of a small permanent magnet dc (PMDC) motor found in automotive applications. Initially, a real industrial motor is measured, designed and simulated, while its measurements and the relevant manufacturer data are considered as a benchmark. In turn, through custom developed software, a redesigned configuration is proposed regarding the structural (stator, rotor, magnets) geometry and magnet material. The resulting geometry was obtained through a constrained optimization algorithm having as goal the minimization of the overall volume and it was further verified by commercial finite element method (FEM) analysis software. Also, the new model is compared with the benchmark motor. Last but not least, FEM analysis was used for thermal behavior evaluation. The overall results reveal that the energy density and the performance of the proposed topology were substantially increased, while the cost was remained low.
{"title":"Optimization of Standard PMDC Motors Used in Automotive Applications for Higher Power Density","authors":"Y. L. Karnavas, I. Chasiotis, Emmanouil D. Peponakis","doi":"10.1109/MCSI.2016.013","DOIUrl":"https://doi.org/10.1109/MCSI.2016.013","url":null,"abstract":"Aim of this work is the development of a competitive alternate design topology (in terms of power density) of a small permanent magnet dc (PMDC) motor found in automotive applications. Initially, a real industrial motor is measured, designed and simulated, while its measurements and the relevant manufacturer data are considered as a benchmark. In turn, through custom developed software, a redesigned configuration is proposed regarding the structural (stator, rotor, magnets) geometry and magnet material. The resulting geometry was obtained through a constrained optimization algorithm having as goal the minimization of the overall volume and it was further verified by commercial finite element method (FEM) analysis software. Also, the new model is compared with the benchmark motor. Last but not least, FEM analysis was used for thermal behavior evaluation. The overall results reveal that the energy density and the performance of the proposed topology were substantially increased, while the cost was remained low.","PeriodicalId":421998,"journal":{"name":"2016 Third International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"1654 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129313142","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this work an algorithm for the optimization of signal setting on urban network is proposed. Signal setting are designed based on a given flow in the network. However, the flow in the network is also influenced by the route choice decisions. This paper deals with traffic signal setting with demand assignment. All approaches proposed in literature to address this problem are based on equilibrium assignment, well established in literature as well as in practice. In order to improve the coordination of signal setting with traffic assignment, this paper proposed a traffic control algorithm considering traffic assignment. We proposed the platoon model to simulate the demand assignment and we developed the surrogate method to optimize the signal setting. The surrogate approach is compared with the genetic algorithm, a well known method. The objective function used in this work is a weighted sum of the delays caused by the signalized intersections, and it is calculated by platoon model via simulation. Numerical experiments on real networks are reported.
{"title":"An Optimizing Algorithm to Minimize the Delay Signal Setting Problem","authors":"L. Adacher, A. Gemma","doi":"10.1109/MCSI.2016.044","DOIUrl":"https://doi.org/10.1109/MCSI.2016.044","url":null,"abstract":"In this work an algorithm for the optimization of signal setting on urban network is proposed. Signal setting are designed based on a given flow in the network. However, the flow in the network is also influenced by the route choice decisions. This paper deals with traffic signal setting with demand assignment. All approaches proposed in literature to address this problem are based on equilibrium assignment, well established in literature as well as in practice. In order to improve the coordination of signal setting with traffic assignment, this paper proposed a traffic control algorithm considering traffic assignment. We proposed the platoon model to simulate the demand assignment and we developed the surrogate method to optimize the signal setting. The surrogate approach is compared with the genetic algorithm, a well known method. The objective function used in this work is a weighted sum of the delays caused by the signalized intersections, and it is calculated by platoon model via simulation. Numerical experiments on real networks are reported.","PeriodicalId":421998,"journal":{"name":"2016 Third International Conference on Mathematics and Computers in Sciences and in Industry (MCSI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132433605","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
扫码关注我们
求助内容：
应助结果提醒方式：