检索结果-内蒙古大学图书馆

arXiv 2018年

作者： Benko, Zsigmond Zlatniczki, Ádám Stippinger, Marcell Fabó, Dániel Sólyom, András Erőss, Loránd Telcs, András Somogyvári, Zoltán Department of Computational Sciences Institute for Particle and Nuclear Physics HUN-REN Wigner Research Centre for Physics Konkoly-Thege Miklós út 29-33. BudapestH-1121 Hungary Department of Computer Science and Information Theory Faculty of Electrical Engineering and Informatics Budapest University of Technology and Economics Magyar tudósok körútja 2. BudapestH-1111 Hungary Epilepsy Unit Department of Neurology National Institute of Mental Health Neurology and Neurosurgery Amerikai út 57. BudapestH-1145 Hungary Department of Functional Neurosurgery National Institute of Mental Health Neurology and Neurosurgery Amerikai út 57. BudapestH-1145 Hungary Faculty of Information Technology and Bionics Péter Pázmány Catholic University Práter u. 50/A BudapestH-1083 Hungary Department of Quantitative Methods Faculty of Business and Economics University of Pannonia Egyetem u. 10. VeszprémH-8200 Hungary Axoncord LLC Dunakeszi utca 23. Fsz. 1. ajtó BudapestH-1048 Hungary

From ancient philosophers to modern economists, biologists, and other researchers, there has been a continuous effort to unveil causal relations. The most formidable challenge lies in deducing the nature of the causal relationship: whether it is unidirectional, bidirectional, or merely apparent — implied by an unobserved common cause. While modern technology equips us with tools to collect data from intricate systems such as the planet’s ecosystem or the human brain, comprehending their functioning requires the identification and differentiation of causal relationships among the components, all without external interventions. In this context, we introduce a novel method capable of distinguishing and assigning probabilities to the presence of all potential causal relations between two or more time series within dynamical systems. The efficacy of this method is verified using synthetic datasets and applied to EEG (electroencephalographic) data recorded from epileptic patients. Given the universal applicability of our method, it holds promise for diverse scientific fields. Copyright © 2018, The Authors. All rights reserved.

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of network header compression schemes for UDP, RTP and TCP

Periodica polytechnica Electrical engineering and computer s...

引用

Periodica polytechnica electrical engineering and computer science 2016年第3期60卷 151-162页

作者： Tömösközi, Máté Seeling, Patrick Ekler, Péter Fitzek, Frank H. P. Acticom GmbH Berlin Germany Department of Electronic Systems Aalborg University Denmark Communication Networks Group Technische Universität Dresden Germany Department of Computer Science Central Michigan University Mount PleasantMI48859 United States Department of Automation and Applied Informatics Faculty of Electrical Engineering and Informatics Budapest University of Technology and Economics Hungary

Modern cellular networks utilising the Long-Term Evolution (LTE) set of standards face an ever-increasing demand for mobile data from connected devices. Header compression is employed to minimise the overhead for IP-based cellular network traffic. In this paper, we evaluate the three header compression implementations used by such networks with respect to their potential throughput increase and complexity for different mobile service scenarios. We compare RTP, UDP and TCP profile compressions regarding their compression gain and complexity. Specifically, we consider header compression as defined by (i) IP Header Compression (RFC 2507), (ii) Robust Header Compression version 1 (RFC 3095), and (iii) the recently updated Robust Header Compression version 2 (RFC 5225) with TCP/IP profile (RFC 6846).This paper presents the performance evaluation of these header compression schemes for UDP, RTP and TCP, for both IPv4 and IPv6 streams in error-free and error-prone scenarios. A comparison between the Robust Header Compression methods and IP Header Compression is also provided. Our results show that all implementations have great potential for saving bandwidth in IP-based wireless networks, even under varying channel conditions. We also present for the first time an analysis of certain RTP header fields which, depending on the transmission characteristics, could have high impact on the overall compression gain. © 2016, Technical University of Budapest. All rights reserved.

关键词： Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Search for pair production of scalar and vector leptoquarks decaying to muons and bottom quarks in proton-proton collisions at s=13 TeV

引用

Physical Review D 2024年第11期109卷 112003-112003页

作者： A. Hayrapetyan A. Tumasyan W. Adam J. W. Andrejkovic T. Bergauer S. Chatterjee K. Damanakis M. Dragicevic P. S. Hussain M. Jeitler N. Krammer A. Li D. Liko I. Mikulec J. Schieck R. Schöfbeck D. Schwarz M. Sonawane S. Templ W. Waltenberger C.-E. Wulz M. R. Darwish T. Janssen P. Van Mechelen E. S. Bols J. D’Hondt S. Dansana A. De Moor M. Delcourt H. El Faham S. Lowette I. Makarenko D. Müller A. R. Sahasransu S. Tavernier M. Tytgat S. Van Putte D. Vannerom B. Clerbaux G. De Lentdecker L. Favart D. Hohov J. Jaramillo A. Khalilzadeh K. Lee M. Mahdavikhorrami A. Malara S. Paredes L. Pétré N. Postiau L. Thomas M. Vanden Bemden C. Vander Velde P. Vanlaer M. De Coen D. Dobur Y. Hong J. Knolle L. Lambrecht G. Mestdach C. Rendón A. Samalan K. Skovpen N. Van Den Bossche J. van der Linden L. Wezenbeek A. Benecke A. Bethani G. Bruno C. Caputo C. Delaere I. S. Donertas A. Giammanco K. Jaffel Sa. Jain V. Lemaitre J. Lidrych P. Mastrapasqua K. Mondal T. T. Tran S. Wertz G. A. Alves E. Coelho C. Hensel T. Menezes De Oliveira A. Moraes P. Rebello Teles M. Soeiro W. L. Aldá Júnior M. Alves Gallo Pereira M. Barroso Ferreira Filho H. Brandao Malbouisson W. Carvalho J. Chinellato E. M. Da Costa G. G. Da Silveira D. De Jesus Damiao S. Fonseca De Souza R. Gomes De Souza J. Martins C. Mora Herrera K. Mota Amarilo L. Mundim H. Nogima A. Santoro A. Sznajder M. Thiel A. Vilela Pereira C. A. Bernardes L. Calligaris T. R. Fernandez Perez Tomei E. M. Gregores P. G. Mercadante S. F. Novaes B. Orzari Sandra S. Padula A. Aleksandrov G. Antchev R. Hadjiiska P. Iaydjiev M. Misheva M. Shopova G. Sultanov A. Dimitrov L. Litov B. Pavlov P. Petkov A. Petrov E. Shumka S. Keshri S. Thakur T. Cheng Q. Guo T. Javaid L. Yuan Z. Hu J. Liu K. Yi G. M. Chen H. S. Chen M. Chen F. Iemmi C. H. Jiang A. Kapoor H. Liao Z.-A. Liu R. Sharma J. N. Song J. Tao C. Wang J. Wang Z. Wang H. Zhang A. Agapitos Y. Ban A. Levin C. Li Q. Li Y. Mao S. J. Qian X. Sun D. Wang H. Yang L. Zhang C. Zhou Z. You N. Lu G. Bauer X. Gao D. Leggat H. Okawa Z. Lin C. Lu M. Xiao C. Avila D. A Yerevan Physics Institute Yerevan Armenia Institut für Hochenergiephysik Vienna Austria Indian Institute of Technology Madras Madras India Universiteit Antwerpen Antwerpen Belgium Vrije Universiteit Brussel Brussel Belgium Université Libre de Bruxelles Bruxelles Belgium Korea University Seoul Korea Ghent University Ghent Belgium Université Catholique de Louvain Louvain-la-Neuve Belgium Centro Brasileiro de Pesquisas Fisicas Rio de Janeiro Brazil Universidade do Estado do Rio de Janeiro Rio de Janeiro Brazil Universidade Estadual Paulista Universidade Federal do ABC São Paulo Brazil Institute for Nuclear Research and Nuclear Energy Bulgarian Academy of Sciences Sofia Bulgaria University of Sofia Sofia Bulgaria Instituto De Alta Investigación Universidad de Tarapacá Casilla 7 D Arica Chile Beihang University Beijing China Department of Physics Tsinghua University Beijing China Institute of High Energy Physics Beijing China California Institute of Technology Pasadena California USA University of Florida Gainesville Florida USA Massachusetts Institute of Technology Cambridge Massachusetts USA State Key Laboratory of Nuclear Physics and Technology Peking University Beijing China Sun Yat-Sen University Guangzhou China University of Science and Technology of China Hefei China Nanjing Normal University Nanjing China Institute of Modern Physics and Key Laboratory of Nuclear Physics and Ion-beam Application (MOE)-Fudan University Shanghai China Zhejiang University Hangzhou Zhejiang China Universidad de Los Andes Bogota Colombia Universidad de Antioquia Medellin Colombia University of Split Faculty of Electrical Engineering Mechanical Engineering and Naval Architecture Split Croatia University of Split Faculty of Science Split Croatia Institute Rudjer Boskovic Zagreb Croatia University of Cyprus Nicosia Cyprus Charles University Prague Czech Republic Escuela Politecnica Nacional Quito Ecuador Universidad San Francisco de Quito Quito Ecuador

A search for pair production of scalar and vector leptoquarks (LQs) each decaying to a muon and a bottom quark is performed using proton-proton collision data collected at s=13 TeV with the CMS detector at the CERN LHC, corresponding to an integrated luminosity of 138 fb−1. No excess above standard model expectation is observed. Scalar (vector) LQs with masses less than 1810 (2120) GeV are excluded at 95% confidence level, assuming a 100% branching fraction of the LQ decaying to a muon and a bottom quark. These limits represent the most stringent to date.

关键词： Leptoquarks Hadron colliders

来源：评论

学校读者我要写书评

暂无评论

Throughput-Optimal Link-Layer Design in Power Constrained Hybrid OW/RF Systems

Throughput-Optimal Link-Layer Design in Power Constrained Hy...

引用

作者： Chatzidiamantis, Nestor D. Georgiadis, Leonidas Sandalidis, Harilaos G. Karagiannidis, George K. Department of Electrical and Computer Engineering Aristotle University of Thessaloniki Thessaloniki54 124 Greece Department of Computer Science and Biomedical Informatics University of Thessaly Lamia35 100 Greece Department of Electrical and Computer Engineering Khalifa University Abu Dhabi127788 United Arab Emirates

The aim of this paper is to develop link layer transmission schemes for hybrid optical wireless (OW)/radio frequency (RF) systems, with constraints on both per-link and total average power consumption at the transmitter. In this context, we adopt a timeslot structure with a queue for storing the data packets for transmission and model the hybrid channel as an erasure channel with parameters varying along the time-slots according to a Markov chain. Then, a stochastic optimization problem is formulated, where intelligent decisions regarding the number of the packets admitted in the queue and the power levels used in every link, are taken by the hybrid transmitter in each slot. The objective of this formulation is to design a control policy that maximizes the transmitter throughput, while satisfying the power constraints as well. A solution is offered by using the Lyapunov optimization framework and an on-line transmission algorithm is developed. The proposed transmission algorithm takes decisions based only on the status of the queue and the statistical parameters of the OW/RF channel in each time-slot, without requiring any knowledge of the underlying Markov chain of the channel process, or the statistics of the packet arrival process. Furthermore, in order to alleviate the requirement for full feedback at the transmitter, i.e., feedback for every successfully received packet, which is critical for the accurate queue update, we extend our analysis and incorporate reduced-feedback coding schemes. The proposed transmission policy in this scenario still meets the throughput objective and satisfies the power consumption constraints, while a tradeoff between transmission delays and feedback requirements is revealed. © 2015 IEEE.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

Improving selfish routing for risk-averse players 11th

Improving selfish routing for risk-averse players

引用

11th International Conference on Web and Internet Economics, WINE 2015

作者： Fotakis, Dimitris Kalimeris, Dimitris Lianeas, Thanasis School of Electrical and Computer Engineering National Technical University of Athens Athens Greece Department of Informatics and Telecommunications National and Kapodistrian University of Athens Athens Greece Department of Electrical and Computer Engineering University of Texas at Austin AustinTX78701 United States

ISBN: (纸本)9783662489949

We investigate how and to which extent one can exploit riskaversion and modify the perceived cost of the players in selfish routing so that the Price of Anarchy (PoA) is improved. We introduce small random perturbations to the edge latencies so that the expected latency does not change, but the perceived cost of the players increases due to risk-aversion. We adopt the model of γ-modifiable routing games, a variant of routing games with restricted tolls. We prove that computing the best γ-enforceable flow is NP-hard for parallel-link networks with affine latencies and two classes of heterogeneous risk-averse players. On the positive side, we show that for parallel-link networks with heterogeneous players and for series-parallel networks with homogeneous players, there exists a nicely structured γ-enforceable flow whose PoA improves fast as γ increases. We show that the complexity of computing such a γ-enforceable flow is determined by the complexity of computing a Nash flow of the original game. Moreover, we prove that the PoA of this flow is best possible in the worst-case, in the sense that there are instances where (i) the best γ-enforceable flow has the same PoA, and (ii) considering more flexible modifications does not lead to any further improvement. © Springer-Verlag Berlin Heidelberg 2015.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

Combination of Measurements of the Top Quark Mass from Data Collected by the ATLAS and CMS Experiments at s=7 and 8 TeV

引用

Physical Review Letters 2024年第26期132卷 261902-261902页

作者： A. Hayrapetyan A. Tumasyan W. Adam J. W. Andrejkovic T. Bergauer S. Chatterjee K. Damanakis M. Dragicevic P. S. Hussain M. Jeitler N. Krammer A. Li D. Liko I. Mikulec J. Schieck R. Schöfbeck D. Schwarz M. Sonawane S. Templ W. Waltenberger C.-E. Wulz M. R. Darwish T. Janssen P. Van Mechelen E. S. Bols J. D’Hondt S. Dansana A. De Moor M. Delcourt H. El Faham S. Lowette I. Makarenko D. Müller A. R. Sahasransu S. Tavernier M. Tytgat S. Van Putte D. Vannerom B. Clerbaux G. De Lentdecker L. Favart D. Hohov J. Jaramillo A. Khalilzadeh K. Lee M. Mahdavikhorrami A. Malara S. Paredes L. Pétré N. Postiau L. Thomas M. Vanden Bemden C. Vander Velde P. Vanlaer M. De Coen D. Dobur Y. Hong J. Knolle L. Lambrecht G. Mestdach C. Rendón A. Samalan K. Skovpen N. Van Den Bossche J. van der Linden L. Wezenbeek A. Benecke G. Bruno C. Caputo C. Delaere I. S. Donertas A. Giammanco K. Jaffel Sa. Jain V. Lemaitre J. Lidrych P. Mastrapasqua K. Mondal T. T. Tran S. Wertz G. A. Alves E. Coelho C. Hensel T. Menezes De Oliveira A. Moraes P. Rebello Teles M. Soeiro W. L. Aldá Júnior M. Alves Gallo Pereira M. Barroso Ferreira Filho H. Brandao Malbouisson W. Carvalho J. Chinellato E. M. Da Costa G. G. Da Silveira D. De Jesus Damiao S. Fonseca De Souza R. Gomes De Souza J. Martins C. Mora Herrera K. Mota Amarilo L. Mundim H. Nogima A. Santoro A. Sznajder M. Thiel A. Vilela Pereira C. A. Bernardes L. Calligaris T. R. Fernandez Perez Tomei E. M. Gregores P. G. Mercadante S. F. Novaes B. Orzari Sandra S. Padula A. Aleksandrov G. Antchev R. Hadjiiska P. Iaydjiev M. Misheva M. Shopova G. Sultanov A. Dimitrov L. Litov B. Pavlov P. Petkov A. Petrov E. Shumka S. Keshri S. Thakur T. Cheng Q. Guo T. Javaid L. Yuan Z. Hu J. Liu K. Yi G. M. Chen H. S. Chen M. Chen F. Iemmi C. H. Jiang A. Kapoor H. Liao Z.-A. Liu R. Sharma J. N. Song J. Tao C. Wang J. Wang Z. Wang H. Zhang A. Agapitos Y. Ban A. Levin C. Li Q. Li Y. Mao S. J. Qian X. Sun D. Wang H. Yang L. Zhang C. Zhou Z. You N. Lu G. Bauer X. Gao D. Leggat H. Okawa Y. Zhang Z. Lin C. Lu M. Xiao C. Avila D. A. Yerevan Physics Institute Yerevan Armenia Institut für Hochenergiephysik Vienna Austria Indian Institute of Technology Madras Madras India APC Université Paris Cité CNRS/IN2P3 Paris France Universiteit Antwerpen Antwerpen Belgium Vrije Universiteit Brussel Brussel Belgium Université Libre de Bruxelles Bruxelles Belgium Korea University Seoul Korea Ghent University Ghent Belgium Université Catholique de Louvain Louvain-la-Neuve Belgium Centro Brasileiro de Pesquisas Fisicas Rio de Janeiro Brazil Universidade do Estado do Rio de Janeiro Rio de Janeiro Brazil Universidade Estadual Paulista Universidade Federal do ABC São Paulo Brazil Institute for Nuclear Research and Nuclear Energy Bulgarian Academy of Sciences Sofia Bulgaria University of Sofia Sofia Bulgaria IJCLab Université Paris-Saclay CNRS/IN2P3 91405 Orsay France Instituto De Alta Investigación Universidad de Tarapacá Casilla 7 D Arica Chile Beihang University Beijing China Department of Physics Tsinghua University Beijing China Institute of High Energy Physics Beijing China Department of Physics Oxford University Oxford United Kingdom School of Physics and Astronomy Shanghai Jiao Tong University Key Laboratory for Particle Astrophysics and Cosmology (MOE) SKLPPC Shanghai China Department of Physics Chinese University of Hong Kong Shatin N.T. Hong Kong China Department of Physics University of Michigan Ann Arbor Michigan USA State Key Laboratory of Nuclear Physics and Technology Peking University Beijing China Department of Modern Physics and State Key Laboratory of Particle Detection and Electronics University of Science and Technology of China Hefei China Department of Physics Nanjing University Nanjing China Sun Yat-Sen University Guangzhou China University of Science and Technology of China Hefei China Nanjing Normal University Nanjing China Institute of Modern Physics and Key Laboratory of Nuclear Physics and Ion-beam Application (MOE)—Fudan University Shanghai China Zhe

A combination of fifteen top quark mass measurements performed by the ATLAS and CMS experiments at the LHC is presented. The datasets used correspond to an integrated luminosity of up to 5 and 20 fb−1 of proton-proton collisions at center-of-mass energies of 7 and 8 TeV, respectively. The combination includes measurements in top quark pair events that exploit both the semileptonic and hadronic decays of the top quark, and a measurement using events enriched in single top quark production via the electroweak t channel. The combination accounts for the correlations between measurements and achieves an improvement in the total uncertainty of 31% relative to the most precise input measurement. The result is mt=172.52±0.14(stat)±0.30(syst) GeV, with a total uncertainty of 0.33 GeV.

关键词： Top quark Hadron colliders

来源：评论

学校读者我要写书评

暂无评论

Visual-based machine understanding framework for decision making on social robot 4

Visual-based machine understanding framework for decision ma...

引用

4th International Conference on Interactive Digital Media, ICIDM 2015

作者： Marzuki Sukoco, Agus Febrianti, Maria S. School of Electrical Engineering and Informatics Institut Teknologi Bandung Bandung Indonesia Computer Science Faculty Bandar Lampung University Lampung Indonesia

ISBN: (纸本)9781509016693

Social robot acts based on any perceived information to interact and communicate with humans or other robots. One essential type of information is visual-based information captured by camera. Visual data from camera is processed to extract essential information through different perspectives such as gesture detection, facial recognition, sign and object detection, and text understanding. As an intelligent agent, the social robot should be able to determine and perform socially rational action autonomously based on the processed information. In this paper, a general framework of visual-based information process to produce rational action is presented. The proposed architecture is implemented on a platform of humanoid robot as a test subject. © 2015 IEEE.

关键词： computer vision

来源：评论

学校读者我要写书评

暂无评论

Cooling Load Estimation in the Building Based On Heat Sources

引用

IOP Conference Series: Earth and Environmental Science 2017年第1期63卷

作者： Chairani S Sulistyo Widyawan Dept. of Electrical Engineering and Information Technology Faculty of Engineering Universitas Gadjah Mada Grafika Street No. 2 Kampus UGM Yogyakarta 55281 (0274) 552305 Indonesia Informatics and Business Institute Darmajaya Faculty of Computer Science Z.A. Pagar Alam Street No. 93 Labuhan Ratu Bandar Lampung Lampung 35141 Indonesia

Heating, ventilation and air conditioning (HVAC) is the largest source of energy consumption. In this research, we discuss cooling load in the room by considering the different heat source and the number of occupancy. Energy cooling load is affected by external and internal heat sources. External cooling load in this discussion include convection outdoor/exterior using the DOE-2 algorithm, calculation of heat using Thermal Analysis Research Program (TARP), and Conduction Transfer Function (CTF). The internal cooling load is calculated based on the activity of the occupants in the office, a number of occupants, heat gain from lighting, and heat gain from electrics equipment. Weather data used is Surakarta weather and design day used is Jakarta design day. We use the ASHRAE standard for building materials and the metabolic of occupants while on the activity. The results show that the number of occupancies have an influence of cooling load. A large number of occupancy will cause the cooling load is great as well.

关键词：

来源：评论

学校读者我要写书评

暂无评论

The xbr+-tree: An efficient access method for points 26th

The xbr+-tree: An efficient access method for points

引用

26th International Conference on Database and Expert Systems Applications, DEXA 2015

作者： Roumelis, George Vassilakopoulos, Michael Loukopoulos, Thanasis Corral, Antonio Manolopoulos, Yannis Department of Informatics Aristotle University of Thessaloniki Thessaloniki Greece Department of Electrical and Computer Engineering University of Thessaly Volos Greece Department of Computer Science and Biomedical Informatics University of Thessaly Lamia Greece Department of Informatics University of Almeria Almeria Spain

ISBN: (纸本)9783319228488

Spatial indexes, such as those based on Quadtree, are important in spatial databases for efficient execution of queries involving spatial constraints. In this paper, we present improvements of the xBR-tree (a member of the Quadtree family) with modified internal node structure and tree building process, called xBR+-tree. We highlight the differences of the algorithms for processing single dataset queries between the xBR and xBR+-trees and we demonstrate performance results (I/O efficiency and execution time) of extensive experimentation (based on real and synthetic datasets) on tree building process and processing of single dataset queries, using the two structures. These results show that the two trees are comparable, regarding their building performance, however, the xBR+-tree is an overall winner, regarding spatial query processing. © Springer International Publishing Switzerland 2015.

关键词： Query processing

来源：评论

学校读者我要写书评

暂无评论

Steady Success Clusters in Differential Evolution

Steady Success Clusters in Differential Evolution

引用

IEEE Symposium Series on Computational Intelligence

作者： Adam Viktorin Roman Senkerik Michal Pluhacek Ales Zamuda Faculty of Applied Informatics Tomas Bata University in Zlin T. G. Masaryka 5555 760 01 Zlin Czech Republic Faculty of Electrical Engineering and Computer Science University of Maribor Smetanova 17 2000 Maribor Slovenia

ISBN: (纸本)9781509042418

This paper presents insights into the proportions between the k-means clusters of successful Differential Evolution (DE), donor generating vectors. This is demonstrated by the high certainty that these proportions are similar - and thereby, that these cluster size proportions regularly appear. A characteristic of these proportions is that they are observed at the same specific values in different test functions. It is also shown that, when varying the number of dimensions for a fitness function, the proportions are constant. However, some of the possible dynamics of these proportions are reported later on, in the situation where the optimization algorithm is changed - for instance, control parameters like the population size parameter. This parameter significantly changes, the proportions of the most frequently successful and most unsuccessful vectors. Insights like this are useful for an understanding of the inter-generational complexity that appears within evolutionary algorithms and would thus benefit future algorithm design;for example, plausible metrics for on-line control.

关键词： Differential Evolution Clustering Complex Network Success History k-means

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：