Pub Date : 2020-01-01DOI: 10.33039/ami.2020.10.004
Mathias Hopp, Pål Ellingsen, Constanza Riera, P. Stănică
This paper explores the distribution of algebraic thickness of Boolean functions (that is, the minimum number of terms in the ANF of the functions in the orbit of a Boolean function, through all affine transformations), in four and five variables, and the complete distribution is presented. Additionally, a complete analysis of some complexity properties (e.g., nonlinearity, balancedness, etc.) of all relevant orbits of Boolean functions is presented. Some properties of our notion of rigid function (which enabled us to reduce significantly the computation) are shown and some open questions are proposed, providing some further explanation of one of these questions.
{"title":"Thickness distribution of Boolean functions in 4 and 5 variables and a comparison with other cryptographic properties","authors":"Mathias Hopp, Pål Ellingsen, Constanza Riera, P. Stănică","doi":"10.33039/ami.2020.10.004","DOIUrl":"https://doi.org/10.33039/ami.2020.10.004","url":null,"abstract":"This paper explores the distribution of algebraic thickness of Boolean functions (that is, the minimum number of terms in the ANF of the functions in the orbit of a Boolean function, through all affine transformations), in four and five variables, and the complete distribution is presented. Additionally, a complete analysis of some complexity properties (e.g., nonlinearity, balancedness, etc.) of all relevant orbits of Boolean functions is presented. Some properties of our notion of rigid function (which enabled us to reduce significantly the computation) are shown and some open questions are proposed, providing some further explanation of one of these questions.","PeriodicalId":43454,"journal":{"name":"Annales Mathematicae et Informaticae","volume":"37 1","pages":""},"PeriodicalIF":0.3,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72532387","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 : 2020-01-01DOI: 10.33039/ami.2020.07.010
D. Kiss, Gábor Kertész, Máté Jaskó, S. Szénási, A. Lovrics, Z. Vámossy
In vitro biological experiments and in silico individual-based computational models are widely used to understand the low-level behavior of cells and cellular functions. Many of these functions can not be directly observed, however, may be deduced from other properties that can be well measured and modeled. In this paper, we present a procedure to evaluate synthetic cell colony formation generated by an off-lattice individual-based model. The calculated shape features of the artificial cell aggregates can be related to the parameter values of the simulated agents, therefore this data can be used to quantify properties of real-life cells such as motility or binding affinity that can not be easily determined otherwise. Our experiments showed that only a few of these parameters are responsible for the difference in shape features of the colonies.
{"title":"Evaluation of colony formation dataset of simulated cell cultures","authors":"D. Kiss, Gábor Kertész, Máté Jaskó, S. Szénási, A. Lovrics, Z. Vámossy","doi":"10.33039/ami.2020.07.010","DOIUrl":"https://doi.org/10.33039/ami.2020.07.010","url":null,"abstract":"In vitro biological experiments and in silico individual-based computational models are widely used to understand the low-level behavior of cells and cellular functions. Many of these functions can not be directly observed, however, may be deduced from other properties that can be well measured and modeled. In this paper, we present a procedure to evaluate synthetic cell colony formation generated by an off-lattice individual-based model. The calculated shape features of the artificial cell aggregates can be related to the parameter values of the simulated agents, therefore this data can be used to quantify properties of real-life cells such as motility or binding affinity that can not be easily determined otherwise. Our experiments showed that only a few of these parameters are responsible for the difference in shape features of the colonies.","PeriodicalId":43454,"journal":{"name":"Annales Mathematicae et Informaticae","volume":"6 1","pages":""},"PeriodicalIF":0.3,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79942355","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 : 2020-01-01DOI: 10.33039/ami.2020.07.004
M. Zaghouani, J. Sztrik
The current paper takes into consideration a cognitive radio network with impatient customers, by the help of finite-source retrial queueing system. We consider two different types of customers (Primary and Secondary) assigned to two interconnected frequency bands. A first frequency band with a priority queue and a second one with an orbit, both are respectively dedicated for the Primary Users (PUs) and Secondary Users (SUs). In case the servers are busy, both customers (Licensed and Unlicensed) join either the queue or the orbit. Before joining the orbit, secondary customers receive a random retrial time according to Exponential distribution, which is the holding time before the next retry. Unlicensed users (impatient) are obliged to leave the system once their total waiting time exceeds a given maximum waiting time. The novelty of this work is the investigation of the abandonment and its impact on several performance measures of the system such as the mean response time and waiting time of users, probability of abandonment of SU, etc. Several figures illustrate the problem in question by the help of simulation.
{"title":"Performance evaluation of finite-source Cognitive Radio Networks with impatient customers","authors":"M. Zaghouani, J. Sztrik","doi":"10.33039/ami.2020.07.004","DOIUrl":"https://doi.org/10.33039/ami.2020.07.004","url":null,"abstract":"The current paper takes into consideration a cognitive radio network with impatient customers, by the help of finite-source retrial queueing system. We consider two different types of customers (Primary and Secondary) assigned to two interconnected frequency bands. A first frequency band with a priority queue and a second one with an orbit, both are respectively dedicated for the Primary Users (PUs) and Secondary Users (SUs). In case the servers are busy, both customers (Licensed and Unlicensed) join either the queue or the orbit. Before joining the orbit, secondary customers receive a random retrial time according to Exponential distribution, which is the holding time before the next retry. Unlicensed users (impatient) are obliged to leave the system once their total waiting time exceeds a given maximum waiting time. The novelty of this work is the investigation of the abandonment and its impact on several performance measures of the system such as the mean response time and waiting time of users, probability of abandonment of SU, etc. Several figures illustrate the problem in question by the help of simulation.","PeriodicalId":43454,"journal":{"name":"Annales Mathematicae et Informaticae","volume":"244 1","pages":""},"PeriodicalIF":0.3,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85177537","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 : 2020-01-01DOI: 10.33039/ami.2020.02.001
A. Bremner
We investigate when two four-term arithmetic progressions have an equal product of their terms. This is equivalent to studying the (arithmetic) geometry of a non-singular quartic surface. It turns out that there are many polynomial parametrizations of such progressions, and it is likely that there exist polynomial parametrizations of every positive degree. We find all such parametrizations for degrees 1 to 4 , and give examples of parametrizations for degrees 5 to 10
{"title":"On two four term arithmetic progressionswith equal product","authors":"A. Bremner","doi":"10.33039/ami.2020.02.001","DOIUrl":"https://doi.org/10.33039/ami.2020.02.001","url":null,"abstract":"We investigate when two four-term arithmetic progressions have an equal product of their terms. This is equivalent to studying the (arithmetic) geometry of a non-singular quartic surface. It turns out that there are many polynomial parametrizations of such progressions, and it is likely that there exist polynomial parametrizations of every positive degree. We find all such parametrizations for degrees 1 to 4 , and give examples of parametrizations for degrees 5 to 10","PeriodicalId":43454,"journal":{"name":"Annales Mathematicae et Informaticae","volume":"36 1","pages":""},"PeriodicalIF":0.3,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73087399","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 : 2020-01-01DOI: 10.33039/ami.2020.07.001
I. Fazekas, Sándor Pecsora
We study the eigenvalues of large perturbed matrices. We consider an Hermitian pattern matrix 𝑃 of rank 𝑘 . We blow up 𝑃 to get a large block-matrix 𝐵 𝑛 . Then we generate a random noise 𝑊 𝑛 and add it to the blown up matrix to obtain the perturbed matrix 𝐴 𝑛 = 𝐵 𝑛 + 𝑊 𝑛 . Our aim is to find the eigenvalues of 𝐵 𝑛 . We obtain that under certain conditions 𝐴 𝑛 has 𝑘 ‘large’ eigenvalues which are called structural eigenvalues. These structural eigenvalues of 𝐴 𝑛 approximate the non-zero eigenvalues of 𝐵 𝑛 . We study a graphical method to distinguish the structural and the non-structural eigenvalues. We obtain similar results for the singular values of non-symmetric matrices.
{"title":"Numerical results on noisy blown-up matrices","authors":"I. Fazekas, Sándor Pecsora","doi":"10.33039/ami.2020.07.001","DOIUrl":"https://doi.org/10.33039/ami.2020.07.001","url":null,"abstract":"We study the eigenvalues of large perturbed matrices. We consider an Hermitian pattern matrix 𝑃 of rank 𝑘 . We blow up 𝑃 to get a large block-matrix 𝐵 𝑛 . Then we generate a random noise 𝑊 𝑛 and add it to the blown up matrix to obtain the perturbed matrix 𝐴 𝑛 = 𝐵 𝑛 + 𝑊 𝑛 . Our aim is to find the eigenvalues of 𝐵 𝑛 . We obtain that under certain conditions 𝐴 𝑛 has 𝑘 ‘large’ eigenvalues which are called structural eigenvalues. These structural eigenvalues of 𝐴 𝑛 approximate the non-zero eigenvalues of 𝐵 𝑛 . We study a graphical method to distinguish the structural and the non-structural eigenvalues. We obtain similar results for the singular values of non-symmetric matrices.","PeriodicalId":43454,"journal":{"name":"Annales Mathematicae et Informaticae","volume":"9 1","pages":""},"PeriodicalIF":0.3,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74718262","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 : 2020-01-01DOI: 10.33039/ami.2020.01.002
M. Zaghouani, J. Sztrik, A. Uka
This paper deals with a Cognitive Radio Network (CRN) which is modeled using a retrial queuing system with two finite-sources. This network includes two non-independent service units treating two types of users: Primary Users (PU) and Secondary Users (SU). The primary unit has priority queue (FIFO) and a second service unit contains an orbit both units are dedicated for the Primary Users and Secondary Users, respectively. The current work highlights the unreliability of the servers as we are as-suming that both servers of this network are subject to random breakdowns and repairs. All the inter-event times in this CRN are either exponentially or non-exponentially distributed. The novelty of our investigation is to ana-lyze the effect of several distributions (Gamma, Pareto, Log-normal, Hypo-Exponential and Hyper-Exponential) of the failure and repair times on the main performance measure of the system. By the help of simulation we show some interesting results concerning to sensitivity problems.
{"title":"Simulation of the performance of CognitiveRadio Networks with unreliable servers","authors":"M. Zaghouani, J. Sztrik, A. Uka","doi":"10.33039/ami.2020.01.002","DOIUrl":"https://doi.org/10.33039/ami.2020.01.002","url":null,"abstract":"This paper deals with a Cognitive Radio Network (CRN) which is modeled using a retrial queuing system with two finite-sources. This network includes two non-independent service units treating two types of users: Primary Users (PU) and Secondary Users (SU). The primary unit has priority queue (FIFO) and a second service unit contains an orbit both units are dedicated for the Primary Users and Secondary Users, respectively. The current work highlights the unreliability of the servers as we are as-suming that both servers of this network are subject to random breakdowns and repairs. All the inter-event times in this CRN are either exponentially or non-exponentially distributed. The novelty of our investigation is to ana-lyze the effect of several distributions (Gamma, Pareto, Log-normal, Hypo-Exponential and Hyper-Exponential) of the failure and repair times on the main performance measure of the system. By the help of simulation we show some interesting results concerning to sensitivity problems.","PeriodicalId":43454,"journal":{"name":"Annales Mathematicae et Informaticae","volume":"17 1","pages":""},"PeriodicalIF":0.3,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80138264","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 : 2020-01-01DOI: 10.33039/ami.2020.01.003
N. Terai
Let m be a positive integer. Then we show that the exponential Diophantine equation (4m+1)+(21m−1) = (5m) has only the positive integer solution (x, y, z) = (1, 1, 2) under some conditions. The proof is based on elementary methods and Baker’s method.
设m为正整数。然后证明了指数型丢芬图方程(4m+1)+(21m−1)= (5m)在某些条件下只有正整数解(x, y, z) =(1,1,2)。证明是基于初等方法和贝克方法。
{"title":"On the exponential Diophantine equation (4m²+1)ˣ + (21m²-1)ʸ = (5m)ᶻ","authors":"N. Terai","doi":"10.33039/ami.2020.01.003","DOIUrl":"https://doi.org/10.33039/ami.2020.01.003","url":null,"abstract":"Let m be a positive integer. Then we show that the exponential Diophantine equation (4m+1)+(21m−1) = (5m) has only the positive integer solution (x, y, z) = (1, 1, 2) under some conditions. The proof is based on elementary methods and Baker’s method.","PeriodicalId":43454,"journal":{"name":"Annales Mathematicae et Informaticae","volume":"12 1","pages":""},"PeriodicalIF":0.3,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78222119","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 : 2020-01-01DOI: 10.33039/ami.2020.06.002
H. Belbachir, L. Németh, Soumeya Merwa Tebtoub
We propose an extension to the work of Lucca [Giovanni Lucca, Integer sequences and circle chains inside a hyperbola, Forum Geometricorum , Vol-ume 19. 2019, 11–16]. Our goal is to examine chains of ellipses inside a hyperbola, and we derive recurrence relations of centers and minor (major) axes of the ellipse chains. We also determine conditions for these recurrence sequences to consist of integer numbers.
{"title":"Integer sequences and ellipse chains inside a hyperbola","authors":"H. Belbachir, L. Németh, Soumeya Merwa Tebtoub","doi":"10.33039/ami.2020.06.002","DOIUrl":"https://doi.org/10.33039/ami.2020.06.002","url":null,"abstract":"We propose an extension to the work of Lucca [Giovanni Lucca, Integer sequences and circle chains inside a hyperbola, Forum Geometricorum , Vol-ume 19. 2019, 11–16]. Our goal is to examine chains of ellipses inside a hyperbola, and we derive recurrence relations of centers and minor (major) axes of the ellipse chains. We also determine conditions for these recurrence sequences to consist of integer numbers.","PeriodicalId":43454,"journal":{"name":"Annales Mathematicae et Informaticae","volume":"31 1","pages":""},"PeriodicalIF":0.3,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85877848","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 : 2020-01-01DOI: 10.33039/ami.2020.07.006
Ádám Vas, Oluoch Josphat Owino, L. Tóth
Our surface-based sensor network, called Distributed Sensor Network for Prediction Calculations (DSN-PC) obviously has limitations in terms of ver-tical atmospheric data. While efforts are being made to approximate these upper-air parameters from surface-level, as a first step it was necessary to test the network’s capability of making distributed computations by applying a hybrid approach. We accessed public databases like NOAA Global Forecast System (GFS) and the initial values for the 2-dimensional computational grid were produced by using both DSN-PC measurements and NOAA GFS data for each grid point. However, though the latter consists of assim-ilated and initialized (smoothed) data the stations of the DSN-PC network provide raw measurements which can cause numerical instability due to measurement errors or local weather phenomena. Previously we simultaneously interpolated both DSN-PC and GFS data. As a step forward, we wanted for our network to have a more significant role in the production of the initial values. Therefore it was necessary to apply 2D smoothing algorithms on the initial conditions. We found significant difference regarding numerical stability between calculating with raw and smoothed initial data. Applying the smoothing algorithms greatly improved the prediction reliability compared to the cases when raw data were used. The size of the grid portion used for smoothing has a significant impact on the goodness of the forecasts and it’s worth further investigation. We could verify the viability of direct integration of DSN-PC data since it provided forecast errors similar to the previous approach. In this paper we present one simple method for smoothing our initial data and the results of the weather prediction calculations.
{"title":"Improving the simultaneous application of the DSN-PC and NOAA GFS datasets","authors":"Ádám Vas, Oluoch Josphat Owino, L. Tóth","doi":"10.33039/ami.2020.07.006","DOIUrl":"https://doi.org/10.33039/ami.2020.07.006","url":null,"abstract":"Our surface-based sensor network, called Distributed Sensor Network for Prediction Calculations (DSN-PC) obviously has limitations in terms of ver-tical atmospheric data. While efforts are being made to approximate these upper-air parameters from surface-level, as a first step it was necessary to test the network’s capability of making distributed computations by applying a hybrid approach. We accessed public databases like NOAA Global Forecast System (GFS) and the initial values for the 2-dimensional computational grid were produced by using both DSN-PC measurements and NOAA GFS data for each grid point. However, though the latter consists of assim-ilated and initialized (smoothed) data the stations of the DSN-PC network provide raw measurements which can cause numerical instability due to measurement errors or local weather phenomena. Previously we simultaneously interpolated both DSN-PC and GFS data. As a step forward, we wanted for our network to have a more significant role in the production of the initial values. Therefore it was necessary to apply 2D smoothing algorithms on the initial conditions. We found significant difference regarding numerical stability between calculating with raw and smoothed initial data. Applying the smoothing algorithms greatly improved the prediction reliability compared to the cases when raw data were used. The size of the grid portion used for smoothing has a significant impact on the goodness of the forecasts and it’s worth further investigation. We could verify the viability of direct integration of DSN-PC data since it provided forecast errors similar to the previous approach. In this paper we present one simple method for smoothing our initial data and the results of the weather prediction calculations.","PeriodicalId":43454,"journal":{"name":"Annales Mathematicae et Informaticae","volume":"188 1","pages":""},"PeriodicalIF":0.3,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79398794","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 : 2020-01-01DOI: 10.33039/ami.2020.07.008
A. Kuki, T. Bérczes, Á. Tóth, J. Sztrik
A retrial queuing system with a single server is investigated in this paper. The server is subject to random breakdowns. The number of customers is finite and collision may take place. A collision occurs when a customer arrives to the busy server. In case of a collision both customers involved in the collision are sent back to the orbit. From the orbit the customers retry their requests after a random waiting time. The server can be down due to a failure. During the failed period the arriving customers are sent to the orbit, as well. The novelty of this analysis is the impatient behaviour of the customers. A customer waiting in the orbit may leave it after a random waiting time. The requests of these customers will not be served. All the random variables included in the model construction are assumed to be exponentially distributed and independent from each other. The impatient property makes the model more complex, so the derivation of a direct algorithmic solution (which was provided for the non-impatient case) is difficult. For numerical calculations the MOSEL-2 tool can be used. This tool solves the Kolmogorov system equations, and from the resulting steady-state probabilities various system characteristics and performance measures can be calculated, i.e. mean response time, mean waiting time in the orbit, utilization of the server, probability of the unserved impatient requests. Principally the effect of the impatient property is investigated in these results, which are presented graphically, as well.
{"title":"Numerical analysis of finite source Markov retrial system with non-reliable server, collision, and impatient customers","authors":"A. Kuki, T. Bérczes, Á. Tóth, J. Sztrik","doi":"10.33039/ami.2020.07.008","DOIUrl":"https://doi.org/10.33039/ami.2020.07.008","url":null,"abstract":"A retrial queuing system with a single server is investigated in this paper. The server is subject to random breakdowns. The number of customers is finite and collision may take place. A collision occurs when a customer arrives to the busy server. In case of a collision both customers involved in the collision are sent back to the orbit. From the orbit the customers retry their requests after a random waiting time. The server can be down due to a failure. During the failed period the arriving customers are sent to the orbit, as well. The novelty of this analysis is the impatient behaviour of the customers. A customer waiting in the orbit may leave it after a random waiting time. The requests of these customers will not be served. All the random variables included in the model construction are assumed to be exponentially distributed and independent from each other. The impatient property makes the model more complex, so the derivation of a direct algorithmic solution (which was provided for the non-impatient case) is difficult. For numerical calculations the MOSEL-2 tool can be used. This tool solves the Kolmogorov system equations, and from the resulting steady-state probabilities various system characteristics and performance measures can be calculated, i.e. mean response time, mean waiting time in the orbit, utilization of the server, probability of the unserved impatient requests. Principally the effect of the impatient property is investigated in these results, which are presented graphically, as well.","PeriodicalId":43454,"journal":{"name":"Annales Mathematicae et Informaticae","volume":"162 1","pages":""},"PeriodicalIF":0.3,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86185167","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
扫码关注我们
求助内容：
应助结果提醒方式：