Pub Date : 2011-07-13DOI: 10.1109/CEEC.2011.5995833
M. Alenezi, M. Reed
Denial of Service (DoS) is a significant security threat in the internet. The availability of different forms of DoS makes devising solutions hard. The attackers could hide their identity behind legitimate users or spoof the source address of the packets. Therefore, differentiating between legitimate packets and attacker packets becomes difficult. The traceback of the origin of the attack plays a major role in DoS mitigation. In this paper, different traceback methodologies are introduced. In addition, our key observations about one of the techniques, which could help in an enhancement, are presented.
{"title":"IP traceback methodologies","authors":"M. Alenezi, M. Reed","doi":"10.1109/CEEC.2011.5995833","DOIUrl":"https://doi.org/10.1109/CEEC.2011.5995833","url":null,"abstract":"Denial of Service (DoS) is a significant security threat in the internet. The availability of different forms of DoS makes devising solutions hard. The attackers could hide their identity behind legitimate users or spoof the source address of the packets. Therefore, differentiating between legitimate packets and attacker packets becomes difficult. The traceback of the origin of the attack plays a major role in DoS mitigation. In this paper, different traceback methodologies are introduced. In addition, our key observations about one of the techniques, which could help in an enhancement, are presented.","PeriodicalId":409910,"journal":{"name":"2011 3rd Computer Science and Electronic Engineering Conference (CEEC)","volume":"15 12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127644788","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 : 2011-07-13DOI: 10.1109/CEEC.2011.5995835
S. Masry, E. Tsang
Event Calculus is a new approach in defining and formalizing market mechanisms in a scientific way. The usage of formal logic reduces ambiguity and allows for accurate reasoning and studying of micro-behaviour. Using a simple event-calculus based market model, we simulate the clearance dynamics of a double-auction market. In this paper, we demonstrate the power of event calculus in defining and explaining step by step the consequences of placing an order into the market and the resulting market state transitions. Using the same logic, we show how market stability and risk can be assessed, by examining the potential effect of large orders on the market. The model used here is much simpler than the complex real market. However, this paper illustrates the high potentiality of a new approach like event-calculus in studying and formalizing complex market models.
{"title":"Simulating market clearance dynamics under a simple event calculus market model","authors":"S. Masry, E. Tsang","doi":"10.1109/CEEC.2011.5995835","DOIUrl":"https://doi.org/10.1109/CEEC.2011.5995835","url":null,"abstract":"Event Calculus is a new approach in defining and formalizing market mechanisms in a scientific way. The usage of formal logic reduces ambiguity and allows for accurate reasoning and studying of micro-behaviour. Using a simple event-calculus based market model, we simulate the clearance dynamics of a double-auction market. In this paper, we demonstrate the power of event calculus in defining and explaining step by step the consequences of placing an order into the market and the resulting market state transitions. Using the same logic, we show how market stability and risk can be assessed, by examining the potential effect of large orders on the market. The model used here is much simpler than the complex real market. However, this paper illustrates the high potentiality of a new approach like event-calculus in studying and formalizing complex market models.","PeriodicalId":409910,"journal":{"name":"2011 3rd Computer Science and Electronic Engineering Conference (CEEC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131287041","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 : 2011-07-13DOI: 10.1109/CEEC.2011.5995828
Adam J. Hill, M. Hawksford
Low-frequency acoustical responses are naturally position dependent across wide listening areas. This is predominantly due to room modes in small, closed spaces. Numerous methodologies have been proposed targeting room mode compensation to give an objectively even response across all listening locations. These techniques cannot guarantee, however, that every listener receives an equally pleasing subjective response. Chameleon subwoofer arrays (CSA) were originally developed to minimize low-frequency spatiotemporal variations by addressing frequency response errors at multiple listening locations using a subwoofer system consisting of multiple degrees of freedom. The CSA system can alternatively be utilized to control listening locations independently, allowing each listener to adjust their localized low-frequency response to their liking. This alternate CSA implementation is evaluated using a bespoke finite-difference time-domain (FDTD) algorithm for small home theater applications.
{"title":"Individualized low-frequency response manipulation for multiple listeners using chameleon subwoofer arrays","authors":"Adam J. Hill, M. Hawksford","doi":"10.1109/CEEC.2011.5995828","DOIUrl":"https://doi.org/10.1109/CEEC.2011.5995828","url":null,"abstract":"Low-frequency acoustical responses are naturally position dependent across wide listening areas. This is predominantly due to room modes in small, closed spaces. Numerous methodologies have been proposed targeting room mode compensation to give an objectively even response across all listening locations. These techniques cannot guarantee, however, that every listener receives an equally pleasing subjective response. Chameleon subwoofer arrays (CSA) were originally developed to minimize low-frequency spatiotemporal variations by addressing frequency response errors at multiple listening locations using a subwoofer system consisting of multiple degrees of freedom. The CSA system can alternatively be utilized to control listening locations independently, allowing each listener to adjust their localized low-frequency response to their liking. This alternate CSA implementation is evaluated using a bespoke finite-difference time-domain (FDTD) algorithm for small home theater applications.","PeriodicalId":409910,"journal":{"name":"2011 3rd Computer Science and Electronic Engineering Conference (CEEC)","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115059479","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 : 2011-07-13DOI: 10.1109/CEEC.2011.5995817
Isara Kongmee, R. Strachan, A. Pickard, C. Montgomery
Massively Multiplayer Online Role Playing Games (MMORPGs) bring players together in a large virtual community. This type of online gaming can serve many purposes such as entertainment, social interaction, information exchange and education and is now an integral part of many people's lives particularly the younger generation. This research study investigates the use of openly available MMORPGs to supplement second language teaching for higher education students. MMORPGs provide informal virtual worlds in which students can communicate in their second language with people from across the globe. The research approach combines ethnography and action research in the virtual and real worlds. In the real world the researcher observes the interaction with the MMORPGs by the students both through their informal discussion in the classroom and through screen video captures of their game play in the MMORPG. In addition the researcher takes on the role of a character within the MMORPG allowing for observation inside the virtual world from the viewpoint of another game character. Through action research, the researcher observes, plans and then interacts with the students' MMORPG characters within the game. This enables the researcher to provide anonymous but tailored support to the students including advice on the game play, a confidence boost where needed, a friendly face where needed and some support around language issues. In the real world, action research is also used to provide tutorial exercises and discussions based on the students' experiences with the MMORPG, facilitating further enhancement opportunities for their language development. This paper concludes that MMORPGs provide a safe, relaxed and engaging environment in which students can practice and improve their language skills.
{"title":"Moving between virtual and real worlds: Second language learning through Massively Multiplayer Online Role Playing Games (MMORPGs)","authors":"Isara Kongmee, R. Strachan, A. Pickard, C. Montgomery","doi":"10.1109/CEEC.2011.5995817","DOIUrl":"https://doi.org/10.1109/CEEC.2011.5995817","url":null,"abstract":"Massively Multiplayer Online Role Playing Games (MMORPGs) bring players together in a large virtual community. This type of online gaming can serve many purposes such as entertainment, social interaction, information exchange and education and is now an integral part of many people's lives particularly the younger generation. This research study investigates the use of openly available MMORPGs to supplement second language teaching for higher education students. MMORPGs provide informal virtual worlds in which students can communicate in their second language with people from across the globe. The research approach combines ethnography and action research in the virtual and real worlds. In the real world the researcher observes the interaction with the MMORPGs by the students both through their informal discussion in the classroom and through screen video captures of their game play in the MMORPG. In addition the researcher takes on the role of a character within the MMORPG allowing for observation inside the virtual world from the viewpoint of another game character. Through action research, the researcher observes, plans and then interacts with the students' MMORPG characters within the game. This enables the researcher to provide anonymous but tailored support to the students including advice on the game play, a confidence boost where needed, a friendly face where needed and some support around language issues. In the real world, action research is also used to provide tutorial exercises and discussions based on the students' experiences with the MMORPG, facilitating further enhancement opportunities for their language development. This paper concludes that MMORPGs provide a safe, relaxed and engaging environment in which students can practice and improve their language skills.","PeriodicalId":409910,"journal":{"name":"2011 3rd Computer Science and Electronic Engineering Conference (CEEC)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126137666","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 : 2011-07-13DOI: 10.1109/CEEC.2011.5995832
J. Oyekan, Bowen Lu, Huosheng Hu, Dongbing Gu
This paper presents the RoboShoalSim, a robot simulator that was developed for the EU Robotic fish shoal project to monitor pollution levels in sea ports around the world. The simulator is different from those in use in that it incorporates not only pollution models of the pollutant in the simulated port but uses computational fluid dynamics of the sea port to generate closer to reality pollutant dynamics. In addition, a physic engine is used with the aim of studying the effects of the Robotic fishes dynamics on the pollutant plume structure. In this paper, the general architecture is described, with preliminary examples of utilization.
{"title":"Using CFD in robotic simulators for pollution monitoring","authors":"J. Oyekan, Bowen Lu, Huosheng Hu, Dongbing Gu","doi":"10.1109/CEEC.2011.5995832","DOIUrl":"https://doi.org/10.1109/CEEC.2011.5995832","url":null,"abstract":"This paper presents the RoboShoalSim, a robot simulator that was developed for the EU Robotic fish shoal project to monitor pollution levels in sea ports around the world. The simulator is different from those in use in that it incorporates not only pollution models of the pollutant in the simulated port but uses computational fluid dynamics of the sea port to generate closer to reality pollutant dynamics. In addition, a physic engine is used with the aim of studying the effects of the Robotic fishes dynamics on the pollutant plume structure. In this paper, the general architecture is described, with preliminary examples of utilization.","PeriodicalId":409910,"journal":{"name":"2011 3rd Computer Science and Electronic Engineering Conference (CEEC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125228289","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 : 2011-07-13DOI: 10.1109/CEEC.2011.5995834
Muhammad Younas Khan
The purpose of this paper is to present in contemporary terminology, a new approach to introduce free objects of a band, like free normal bands, free rectangular bands and free bands through graphs. The cardinalities of the free objects are also calculated, first for complete graphs. After removing of edges the resulting graphs become incomplete and regular. Green's relations for free objects are also discussed and explained by an egg-box diagram. They may provide a way for codes through graphs.
{"title":"Free objects of a band arising from graphs","authors":"Muhammad Younas Khan","doi":"10.1109/CEEC.2011.5995834","DOIUrl":"https://doi.org/10.1109/CEEC.2011.5995834","url":null,"abstract":"The purpose of this paper is to present in contemporary terminology, a new approach to introduce free objects of a band, like free normal bands, free rectangular bands and free bands through graphs. The cardinalities of the free objects are also calculated, first for complete graphs. After removing of edges the resulting graphs become incomplete and regular. Green's relations for free objects are also discussed and explained by an egg-box diagram. They may provide a way for codes through graphs.","PeriodicalId":409910,"journal":{"name":"2011 3rd Computer Science and Electronic Engineering Conference (CEEC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125094450","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 : 2011-07-13DOI: 10.1109/CEEC.2011.5995829
L. Alonso-Valerdi, F. Sepulveda
Brain-Computer Interfaces (BCI) give rise to a communication means between individuals with severe motor disorders, and their external world via the measurement of the electroencephalographic (EEG) activity. BCI users may control this activity by concentrating on a specific mental task. Motor imagery (MI) executions have become the most used mental task by BCI-groups. Despite a large number of references describing the theoretical framework of MI-based BCIs, there is not enough information related to the available computer software that could be suitable to develop a specific-purpose, efficient and straightforward BCI. Therefore, the aims of this paper are: (1) to develop a MI-based BCI system making use of Python programming language, and (2) to study MI signals of three users via the proposed BCI system in order to adapt a computer for posterior applications. The use of Python along with plug-ins for developing MI-based BCI systems is not only feasible, but also it is proficient. Moreover, the Python community provides extensive variety of tools to design compelling systems.
{"title":"Python in Brain-Computer Interfaces (BCI): Development of a BCI based on Motor imagery","authors":"L. Alonso-Valerdi, F. Sepulveda","doi":"10.1109/CEEC.2011.5995829","DOIUrl":"https://doi.org/10.1109/CEEC.2011.5995829","url":null,"abstract":"Brain-Computer Interfaces (BCI) give rise to a communication means between individuals with severe motor disorders, and their external world via the measurement of the electroencephalographic (EEG) activity. BCI users may control this activity by concentrating on a specific mental task. Motor imagery (MI) executions have become the most used mental task by BCI-groups. Despite a large number of references describing the theoretical framework of MI-based BCIs, there is not enough information related to the available computer software that could be suitable to develop a specific-purpose, efficient and straightforward BCI. Therefore, the aims of this paper are: (1) to develop a MI-based BCI system making use of Python programming language, and (2) to study MI signals of three users via the proposed BCI system in order to adapt a computer for posterior applications. The use of Python along with plug-ins for developing MI-based BCI systems is not only feasible, but also it is proficient. Moreover, the Python community provides extensive variety of tools to design compelling systems.","PeriodicalId":409910,"journal":{"name":"2011 3rd Computer Science and Electronic Engineering Conference (CEEC)","volume":"31 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123156192","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 : 2011-07-13DOI: 10.1109/CEEC.2011.5995836
Rashida Adeeb Khanum, Muhammad Asif Jan
JADE is a recent adaptive version of nature inspired algorithm, Differential Evolution (DE). It has shown considerable performance improvement on a set of well studied benchmark functions. This paper studies whether the performance of JADE can be improved further by changing its random population initialization with centroid based population initialization. The new algorithm is known as Centroid-based Initialized JADE (ciJADE). ciJADE not only initialize JADE from centroids of the random parents, it also reflects the worst ten percent of the centroids population. ciJADE is tested on fourteen CEC2005 competition test problems. Experimental results show that ciJADE has significantly improved the performance of JADE on various problems.
{"title":"Centroid-based Initialized JADE for global optimization","authors":"Rashida Adeeb Khanum, Muhammad Asif Jan","doi":"10.1109/CEEC.2011.5995836","DOIUrl":"https://doi.org/10.1109/CEEC.2011.5995836","url":null,"abstract":"JADE is a recent adaptive version of nature inspired algorithm, Differential Evolution (DE). It has shown considerable performance improvement on a set of well studied benchmark functions. This paper studies whether the performance of JADE can be improved further by changing its random population initialization with centroid based population initialization. The new algorithm is known as Centroid-based Initialized JADE (ciJADE). ciJADE not only initialize JADE from centroids of the random parents, it also reflects the worst ten percent of the centroids population. ciJADE is tested on fourteen CEC2005 competition test problems. Experimental results show that ciJADE has significantly improved the performance of JADE on various problems.","PeriodicalId":409910,"journal":{"name":"2011 3rd Computer Science and Electronic Engineering Conference (CEEC)","volume":"252 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122061943","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 : 2011-07-13DOI: 10.1109/CEEC.2011.5995823
Ian Mothersole, M. Reed
In a network where multiple packet filtering firewalls exist, it can be beneficial to distribute the filtering rules in a certain way, for example, move all the rules towards the edge (main gateway) of the network, or to evenly distribute the rules over the firewalls. Configuring firewalls is a complex task and can be very error prone. To move rules between firewalls, many factors need to be considered to ensure the global security policy remains unchanged. In this paper we present a novel method which describes how to move rules between the firewalls and what, if any, changes need to be made to the rule(s). With this work we have also presented a generic network model which can be applied to any network topology and therefore allows the method for moving rules to be applied to any network topology (so long as it meets the criteria). Applications of the work include improving the network bandwidth utilisation, when unwanted traffic is filtered out early, and also improving the processing loads on each firewall, thus reducing delays and increasing traffic throughput. Factors to be considered when moving filtering rules include the relationships which can exist between filtering rules. Naive removal and insertion of filtering rules can alter inter-rule relationships and therefore also alter the security policy - the method we present ensures the security policy remains unchanged.
{"title":"A method for moving rules in a network with multiple packet filters","authors":"Ian Mothersole, M. Reed","doi":"10.1109/CEEC.2011.5995823","DOIUrl":"https://doi.org/10.1109/CEEC.2011.5995823","url":null,"abstract":"In a network where multiple packet filtering firewalls exist, it can be beneficial to distribute the filtering rules in a certain way, for example, move all the rules towards the edge (main gateway) of the network, or to evenly distribute the rules over the firewalls. Configuring firewalls is a complex task and can be very error prone. To move rules between firewalls, many factors need to be considered to ensure the global security policy remains unchanged. In this paper we present a novel method which describes how to move rules between the firewalls and what, if any, changes need to be made to the rule(s). With this work we have also presented a generic network model which can be applied to any network topology and therefore allows the method for moving rules to be applied to any network topology (so long as it meets the criteria). Applications of the work include improving the network bandwidth utilisation, when unwanted traffic is filtered out early, and also improving the processing loads on each firewall, thus reducing delays and increasing traffic throughput. Factors to be considered when moving filtering rules include the relationships which can exist between filtering rules. Naive removal and insertion of filtering rules can alter inter-rule relationships and therefore also alter the security policy - the method we present ensures the security policy remains unchanged.","PeriodicalId":409910,"journal":{"name":"2011 3rd Computer Science and Electronic Engineering Conference (CEEC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125942687","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 : 2011-07-13DOI: 10.1109/CEEC.2011.5995827
M. A. Zeb, M. Fasli
Although the World Wide Web has evolved to be an enormous source of information over the last decade, finding the required information poses a significant challenge to users as there is simply too much information available. Therefore systems that enable users to perform personalised information searches are becoming increasingly important. This paper presents a mechanism which provides recommendations based on a user profile that adapts to the changing interests of the user. Taking the multiple and diverse user interests into consideration, such as the short-term, long-term and periodic interests, the proposed mechanism constructs a user profile that evolves according to these interests. Articles from different news sources are presented to the users that they have subscribed to through an RSS aggregator and are ranked according to the user's profile. The mechanism adapts the user profile according to the changing user interests automatically and makes recommendations based on this profile.
{"title":"Adaptive user profiling for deviating user interests","authors":"M. A. Zeb, M. Fasli","doi":"10.1109/CEEC.2011.5995827","DOIUrl":"https://doi.org/10.1109/CEEC.2011.5995827","url":null,"abstract":"Although the World Wide Web has evolved to be an enormous source of information over the last decade, finding the required information poses a significant challenge to users as there is simply too much information available. Therefore systems that enable users to perform personalised information searches are becoming increasingly important. This paper presents a mechanism which provides recommendations based on a user profile that adapts to the changing interests of the user. Taking the multiple and diverse user interests into consideration, such as the short-term, long-term and periodic interests, the proposed mechanism constructs a user profile that evolves according to these interests. Articles from different news sources are presented to the users that they have subscribed to through an RSS aggregator and are ranked according to the user's profile. The mechanism adapts the user profile according to the changing user interests automatically and makes recommendations based on this profile.","PeriodicalId":409910,"journal":{"name":"2011 3rd Computer Science and Electronic Engineering Conference (CEEC)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117084017","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
扫码关注我们
求助内容：
应助结果提醒方式：