Masaki Narita, Keisuke Kamada, Kanayo Ogura, B. B. Bista, T. Takata
A darknet monitoring system is developed to grasp malicious activities on the Internet in an early stage and to copewith them. The darknet monitoring system consists of network sensors deployed widely on the Internet. The sensors capture incoming unsolicited packets. A goal of this system analyzes captured malicious packets and provides effective informationfor protecting good Internet users from malicious activities. To provide effective and reliable information, sensors mustbe deployed in secret and hidden from outside. On the otherhand, attackers intend to detect sensors for evading them. This attempt is known as localization attacks to darknet monitoring systems. If actual location of sensors is revealed to attackers, itis almost impossible to grasp the latest tactics used by attackers. Thus in our previous work, we proposed a packet sampling method, which samples incoming packets based on an attribute of packets sender, to increase a tolerance to a localization attack and to keep a high quality of information publicized by the system. As a result, we almost succeeded to counter from a localization attack, which generates spike on the publicized graph to detect a sensor. However in some cases, proposed sampling method works to attacker's advantage and spikes appear clearly on the graph. Therefore, we propose advancedsampling methods, which sample incoming packets based on multiple attributes of packets sender. In this paper, we presentour improved methods and show a promising evaluation result obtained from the simulation.
{"title":"A Study of Packet Sampling Methods for Protecting Sensors Deployed on Darknet","authors":"Masaki Narita, Keisuke Kamada, Kanayo Ogura, B. B. Bista, T. Takata","doi":"10.1109/NBiS.2016.37","DOIUrl":"https://doi.org/10.1109/NBiS.2016.37","url":null,"abstract":"A darknet monitoring system is developed to grasp malicious activities on the Internet in an early stage and to copewith them. The darknet monitoring system consists of network sensors deployed widely on the Internet. The sensors capture incoming unsolicited packets. A goal of this system analyzes captured malicious packets and provides effective informationfor protecting good Internet users from malicious activities. To provide effective and reliable information, sensors mustbe deployed in secret and hidden from outside. On the otherhand, attackers intend to detect sensors for evading them. This attempt is known as localization attacks to darknet monitoring systems. If actual location of sensors is revealed to attackers, itis almost impossible to grasp the latest tactics used by attackers. Thus in our previous work, we proposed a packet sampling method, which samples incoming packets based on an attribute of packets sender, to increase a tolerance to a localization attack and to keep a high quality of information publicized by the system. As a result, we almost succeeded to counter from a localization attack, which generates spike on the publicized graph to detect a sensor. However in some cases, proposed sampling method works to attacker's advantage and spikes appear clearly on the graph. Therefore, we propose advancedsampling methods, which sample incoming packets based on multiple attributes of packets sender. In this paper, we presentour improved methods and show a promising evaluation result obtained from the simulation.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126162271","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}
Malik Najmus Siraj, N. Javaid, Qaisar Shafi, Zaheer Ahmed, U. Qasim, Z. Khan
Increase in traffic over internet by large number of mobile devices results into high energy consumption on network devices. In this paper, we address the necessity to reduce the energy consumption in a campus network that includes both wired and wireless network devices. Specifically, we propose dynamic link rate adaptation mechanism on Software Defined Network (SDN) switches and control power consumption on Access Points (APs) by using users association to an AP. Moreover, our online flow routing approach dynamically routes user traffic in order to decrease the overall energy consumption of whole network while taking in consideration Quality of Service (QoS), acceptance ratio on forwarding table and link BandWidth (BW) constraints. Our simulation result shows that our approach results in 3.69% less power consumption, and furthermore, there is no congested links nor overflow in flow table as compared to Dijkstra Ant colony Power (DAPower) that has 2 congested links for 150 users in a network, each generating 34 flows.
大量移动设备导致互联网流量增加，导致网络设备能耗高。在本文中，我们讨论了在包含有线和无线网络设备的校园网中降低能耗的必要性。具体而言，我们在软件定义网络(SDN)交换机上提出了动态链路速率自适应机制，并利用用户与AP的关联来控制接入点(AP)的功耗。此外，我们的在线流路由方法在考虑服务质量(QoS)、转发表接受率和链路带宽(BW)约束的同时，动态路由用户流量，以降低整个网络的总体能耗。我们的仿真结果表明，与Dijkstra Ant colony power (DAPower)相比，我们的方法减少了3.69%的功耗，并且在流表中没有拥塞链路和溢出，Dijkstra Ant colony power (DAPower)在一个网络中有150个用户有2个拥塞链路，每个产生34个流。
{"title":"Energy Aware Dynamic Routing Using SDN for a Campus Network","authors":"Malik Najmus Siraj, N. Javaid, Qaisar Shafi, Zaheer Ahmed, U. Qasim, Z. Khan","doi":"10.1109/NBiS.2016.80","DOIUrl":"https://doi.org/10.1109/NBiS.2016.80","url":null,"abstract":"Increase in traffic over internet by large number of mobile devices results into high energy consumption on network devices. In this paper, we address the necessity to reduce the energy consumption in a campus network that includes both wired and wireless network devices. Specifically, we propose dynamic link rate adaptation mechanism on Software Defined Network (SDN) switches and control power consumption on Access Points (APs) by using users association to an AP. Moreover, our online flow routing approach dynamically routes user traffic in order to decrease the overall energy consumption of whole network while taking in consideration Quality of Service (QoS), acceptance ratio on forwarding table and link BandWidth (BW) constraints. Our simulation result shows that our approach results in 3.69% less power consumption, and furthermore, there is no congested links nor overflow in flow table as compared to Dijkstra Ant colony Power (DAPower) that has 2 congested links for 150 users in a network, each generating 34 flows.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128320641","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 an university, students take an oral exam to check the understanding level. Especially, in a programming class, a student writes a program source code to solve a practice. Then, the student takes an oral exam. To support the ordering of the oral exam and the checking source code, this paper proposes a reservation system for oral exam. A student uploads source code files to the system. Then, the student is registered to a queue of the oral exam. The student can check the own turn because the own student ID is highlighted. A teacher checks the source code files and asks some questions to the student. Finally, the teacher grades the student and registers the grade to the system.
{"title":"A Reservation System for Oral Exam of Programming Class","authors":"Masaki Kohana, S. Okamoto","doi":"10.1109/NBiS.2016.43","DOIUrl":"https://doi.org/10.1109/NBiS.2016.43","url":null,"abstract":"In an university, students take an oral exam to check the understanding level. Especially, in a programming class, a student writes a program source code to solve a practice. Then, the student takes an oral exam. To support the ordering of the oral exam and the checking source code, this paper proposes a reservation system for oral exam. A student uploads source code files to the system. Then, the student is registered to a queue of the oral exam. The student can check the own turn because the own student ID is highlighted. A teacher checks the source code files and asks some questions to the student. Finally, the teacher grades the student and registers the grade to the system.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127061376","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 paper, we propose a method that estimates new tags from user comments on videos on the Nico Nico Douga website. On Nico Nico Douga, users can post tags and comments on videos. However, users cannot post more than 12 tags on a video, therefore, there are some important tags that could be posted but are sometimes missed. We present a technique to acquire some of these missing tags by choosing new tags that score well in a scoring method developed by us.
{"title":"Estimation of Tags via Comments on Nico Nico Douga","authors":"Hiroki Sakaji, Masaki Kohana, Akio Kobayashi, Hiroyuki Sakai","doi":"10.1109/NBiS.2016.46","DOIUrl":"https://doi.org/10.1109/NBiS.2016.46","url":null,"abstract":"In this paper, we propose a method that estimates new tags from user comments on videos on the Nico Nico Douga website. On Nico Nico Douga, users can post tags and comments on videos. However, users cannot post more than 12 tags on a video, therefore, there are some important tags that could be posted but are sometimes missed. We present a technique to acquire some of these missing tags by choosing new tags that score well in a scoring method developed by us.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132456944","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}
Hirofumi Nakakoji, Yasuhiro Fujii, Y. Isobe, Tomohiro Shigemoto, Tetsuro Kito, Naoki Hayashi, N. Kawaguchi, Naoki Shimotsuma, Hiroaki Kikuchi
In recent years, the damage from cyber attacks caused by sophisticated malware has continuously increased. It is therefore becoming more difficult to take countermeasures using traditional approaches such as antivirus and firewall products. Against the intrusion of malware, we propose an automated countermeasure technology system named Autonomous Evolution of Defense, which mitigates the risk of actual damage by controlling the internet connection for malware, and in addition optimizes the system's operating conditions. The system takes countermeasures immediately to mitigate risk without causing disruptive effects on business. However, a graylist of malicious addresses generated by malware analysis systems contains many false-positive addresses and is very "noisy" for use in blocking access based on the list. We therefore propose a new technique for improving the accuracy of the unreliable graylist of addresses using image authentication. We report here on the implementation of our system and results of evaluation.
{"title":"Proposal and Evaluation of Cyber Defense System Using Blacklist Refined Based on Authentication Results","authors":"Hirofumi Nakakoji, Yasuhiro Fujii, Y. Isobe, Tomohiro Shigemoto, Tetsuro Kito, Naoki Hayashi, N. Kawaguchi, Naoki Shimotsuma, Hiroaki Kikuchi","doi":"10.1109/NBiS.2016.25","DOIUrl":"https://doi.org/10.1109/NBiS.2016.25","url":null,"abstract":"In recent years, the damage from cyber attacks caused by sophisticated malware has continuously increased. It is therefore becoming more difficult to take countermeasures using traditional approaches such as antivirus and firewall products. Against the intrusion of malware, we propose an automated countermeasure technology system named Autonomous Evolution of Defense, which mitigates the risk of actual damage by controlling the internet connection for malware, and in addition optimizes the system's operating conditions. The system takes countermeasures immediately to mitigate risk without causing disruptive effects on business. However, a graylist of malicious addresses generated by malware analysis systems contains many false-positive addresses and is very \"noisy\" for use in blocking access based on the list. We therefore propose a new technique for improving the accuracy of the unreliable graylist of addresses using image authentication. We report here on the implementation of our system and results of evaluation.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129853247","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}
Shinji Sakamoto, Tetsuya Oda, Makoto Ikeda, L. Barolli, F. Xhafa, I. Woungang
With the fast development of wireless technologies, Wireless Mesh Networks (WMNs) are becoming an important networking infrastructure due to their low cost and increased high speed wireless Internet connectivity. In our previous work, we implemented a simulation system based on Simulated Annealing (SA) for solving node placement problem in wireless mesh networks, called WMN-SA. Also, we implemented a Particle Swarm Optimization (PSO) based simulation system, called WMN-PSO. In this paper, we compare two systems considering calculation time. From the simulation results, when the area size is 32 × 32 and 64 × 64, WMN-SA is better than WMN-PSO. When the area size is 128 × 128, WMN-SA performs better than WMN-PSO. However, WMN-SA needs more calculation time than WMN-PSO.
{"title":"Node Placement in Wireless Mesh Networks: A Comparison Study of WMN-SA and WMN-PSO Simulation Systems","authors":"Shinji Sakamoto, Tetsuya Oda, Makoto Ikeda, L. Barolli, F. Xhafa, I. Woungang","doi":"10.1109/NBiS.2016.31","DOIUrl":"https://doi.org/10.1109/NBiS.2016.31","url":null,"abstract":"With the fast development of wireless technologies, Wireless Mesh Networks (WMNs) are becoming an important networking infrastructure due to their low cost and increased high speed wireless Internet connectivity. In our previous work, we implemented a simulation system based on Simulated Annealing (SA) for solving node placement problem in wireless mesh networks, called WMN-SA. Also, we implemented a Particle Swarm Optimization (PSO) based simulation system, called WMN-PSO. In this paper, we compare two systems considering calculation time. From the simulation results, when the area size is 32 × 32 and 64 × 64, WMN-SA is better than WMN-PSO. When the area size is 128 × 128, WMN-SA performs better than WMN-PSO. However, WMN-SA needs more calculation time than WMN-PSO.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"266 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114703881","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}
Yuki Shinotsuka, Tomoyuki Ishida, K. Takahagi, Misaki Iyobe, Norio Akatsu, Kaoru Sugita, Noriki Uchida, Y. Shibata
In this paper, we propose a Zoo Walk Navigation System. This Zoo Walk Navigation System consists of the contents management application and the contents browsing application. The contents management application can register various animal information. And this contents management application has the function such as the animal guide editing function and animal quiz editing function. On the other hand, the contents browsing application can browse the various animal information registered by the contents management application. And this contents browsing application can receive the various notification from the beacon terminals. In this research, we evaluated the usefulness of a Zoo Walk Navigation System. As a result, we were able to confirm the usefulness of this system.
{"title":"Proposal of a Zoo Walk Navigation System for Regional Revitalization","authors":"Yuki Shinotsuka, Tomoyuki Ishida, K. Takahagi, Misaki Iyobe, Norio Akatsu, Kaoru Sugita, Noriki Uchida, Y. Shibata","doi":"10.1109/NBiS.2016.2","DOIUrl":"https://doi.org/10.1109/NBiS.2016.2","url":null,"abstract":"In this paper, we propose a Zoo Walk Navigation System. This Zoo Walk Navigation System consists of the contents management application and the contents browsing application. The contents management application can register various animal information. And this contents management application has the function such as the animal guide editing function and animal quiz editing function. On the other hand, the contents browsing application can browse the various animal information registered by the contents management application. And this contents browsing application can receive the various notification from the beacon terminals. In this research, we evaluated the usefulness of a Zoo Walk Navigation System. As a result, we were able to confirm the usefulness of this system.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132735940","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}
Saman Cheema, N. Javaid, S. A. Sheikh, Z. Khan, U. Qasim
In this paper we propose an energy balanced routing algorithm. Our scheme called Balanced Energy Adaptive Routing protocol, forwards data packets towards the sink through dense energy area to protect the nodes with relatively low residual energy. The key point in our proposed protocol is the presence of three conceited virtual fields. The first field, called virtual sector, is responsible for establishing the routing pattern which ensures the movement of the data packet towards the sink. Sensor node's energy is the second field which ensures that packets are always forwarded along the higher energy nodes. The third field is the residual energy field, it intends to protect the low energy nodes. Eventually the final verdict is taken with all three virtual potential fields.
{"title":"A Balanced Energy Adaptive Routing Protocol with Sector Based Node Selection in Underwater WSNs","authors":"Saman Cheema, N. Javaid, S. A. Sheikh, Z. Khan, U. Qasim","doi":"10.1109/NBiS.2016.76","DOIUrl":"https://doi.org/10.1109/NBiS.2016.76","url":null,"abstract":"In this paper we propose an energy balanced routing algorithm. Our scheme called Balanced Energy Adaptive Routing protocol, forwards data packets towards the sink through dense energy area to protect the nodes with relatively low residual energy. The key point in our proposed protocol is the presence of three conceited virtual fields. The first field, called virtual sector, is responsible for establishing the routing pattern which ensures the movement of the data packet towards the sink. Sensor node's energy is the second field which ensures that packets are always forwarded along the higher energy nodes. The third field is the residual energy field, it intends to protect the low energy nodes. Eventually the final verdict is taken with all three virtual potential fields.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122326679","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 order to improve the performance of variable air volume (VAV) air conditioning system, considering the control characteristics of the variable air volume air-conditioning system, a PID control strategy based on bacterial foraging optimization are proposed. Firstly construct the nonlinear PID controller and analyze its parameters, then apply the control strategy to optimal adjustment of PID parameters of VAV air conditioning control system. Compared with the traditional PID control, the new PID control strategy improves the performance of the system by digital simulation in the circumstances of MATLAB/Simulink.
{"title":"The Optimization of PID Control Strategy in VAV System Based on Bacterial Foraging Algorithm","authors":"Li Chen","doi":"10.1109/NBiS.2016.48","DOIUrl":"https://doi.org/10.1109/NBiS.2016.48","url":null,"abstract":"In order to improve the performance of variable air volume (VAV) air conditioning system, considering the control characteristics of the variable air volume air-conditioning system, a PID control strategy based on bacterial foraging optimization are proposed. Firstly construct the nonlinear PID controller and analyze its parameters, then apply the control strategy to optimal adjustment of PID parameters of VAV air conditioning control system. Compared with the traditional PID control, the new PID control strategy improves the performance of the system by digital simulation in the circumstances of MATLAB/Simulink.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"159 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130232279","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}
Ryousuke Iiya, Erjing Zhou, Michitoshi Niibori, M. Kamada, O. Saitou, S. Shibusawa
We present a handy information system for community bus services. Its main feature is that we have only togo around a new route as a test drive with a terminal device in order to collect and publish its geographic data such asthe positions of the stops in the Google's general transit feedspecification (GTFS) format. A template time table is recorded during the test drive which can be edited to complete a timetable for publication in the GTFS format. From the bus onduty, its real-time position is uploaded in the GTFS realtime format. Those data can be accessible by the passengers through Google. It has been planned and yet to be implemented thatvoice announcements can be recorded during the test drive withthe location data so that the announcements can be played back automatically.
{"title":"A Handy Real-Time Location System for Community Bus Service","authors":"Ryousuke Iiya, Erjing Zhou, Michitoshi Niibori, M. Kamada, O. Saitou, S. Shibusawa","doi":"10.1109/NBiS.2016.36","DOIUrl":"https://doi.org/10.1109/NBiS.2016.36","url":null,"abstract":"We present a handy information system for community bus services. Its main feature is that we have only togo around a new route as a test drive with a terminal device in order to collect and publish its geographic data such asthe positions of the stops in the Google's general transit feedspecification (GTFS) format. A template time table is recorded during the test drive which can be edited to complete a timetable for publication in the GTFS format. From the bus onduty, its real-time position is uploaded in the GTFS realtime format. Those data can be accessible by the passengers through Google. It has been planned and yet to be implemented thatvoice announcements can be recorded during the test drive withthe location data so that the announcements can be played back automatically.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127923423","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
扫码关注我们
求助内容：
应助结果提醒方式：