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

CONCURRENT APPLICATIVE IMPLEMENTATIONS OF nondeterministic algorithms

COMPUTER LANGUAGES 1983年第2期8卷 61-68页

作者： SALTER, R Mathematics Department Oberlin College Oberlin OH 44074 U.S.A.

In this paper we introduce a methodology for utilizing concurrency in place of backtracking in the implementation of nondeterministic algorithms. This is achieved in an applicative setting through the use of the Friedman-Wise multiprogramming primitive frons, and a paradigm which views the action of nondeterministic algorithms as one of data structure construction. The element by element nondeterminism arising from a linearized search is replaced by a control structure which is oriented towards constructing sets of partial computations. This point of view is facilitated by the use of suspensions, which allow control disciplines to be embodied in the form of conceptual data structures that in reality manifest themselves only for purposes of control. We apply this methodology to the class of problems usually solved through the use of simple backtracking (e.g. “eight queens”), and to a problem presented by Lindstrom to illustrate the use of coroutine controlled backtracking, to produce backtrack-free solutions. Our solution to the latter illustrates the coroutine capability of suspended structures, but also demonstrates a need for further investigations into resolving problems of process communication in applicative languages.

关键词： nondeterministic algorithms Concurrency Multiprocessing Multisets Suspended structures Applicative languages

来源：评论

学校读者我要写书评

暂无评论

Properties and application of nondeterministic quantum query algorithms - art. no. 657310

Properties and application of nondeterministic quantum query...

引用

Conference on Quantum Information and Computation V

作者： Dubrovska, Alina Univ Latvia Dept Comp Sci LV-1459 Riga Latvia

ISBN: (纸本)9780819466952

Many quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given by a black box. As in the classical version of decision trees, different kinds of quantum query algorithms are possible: exact, with bounded error and even nondeterministic. In this paper, we study the latter class of algorithms. We introduce a new notion in addition to already studied nondeterministic algorithms and introduce dual nondeterministic quantum query algorithms. We examine properties of such algorithms and prove relations with exact and nondeterministic quantum query algorithm complexity. As a result and as an example of the application of discovered properties, we demonstrate a gap of n vs. 2 between classical deterministic and dual nondeterministic quantum query complexity for a specific Boolean function. Finally, we show an approach how to construct examples where quantum nondeterministic complexity of an algorithm is O(1), however classical deterministic algorithm for the same function would require 0(n) queries.

关键词： quantum computing quantum query algorithms complexity theory Boolean functions nondeterministic algorithms

来源：评论

学校读者我要写书评

暂无评论

nondeterministic dynamic programming on a parallel coprocessing system

引用

APPLIED MATHEMATICS AND COMPUTATION 2001年第1-3期120卷 139-147页

作者： Lew, A Univ Hawaii Manoa Dept Informat & Comp Sci Innovat Compuat Lab Honolulu HI 96822 USA

We describe how nondeterministic dynamic programming (DP) algorithms can be designed for a new class of parallel coprocessing systems using "functional memory", an architecture based upon dataflow computer principles. We also show how Petri nets can be used to model and express such parallel DP algorithms. Finally, we discuss architectural improvements that would facilitate the processing of Petri net models of nondeterministic DP algorithms on functional memory computers (FMC). (C) 2001 Elsevier Science Inc. All rights reserved.

关键词： dynamic programming nondeterministic algorithms parallel processing petri nets computer architecture

来源：评论

学校读者我要写书评

暂无评论

A nondeterministic PARALLEL ALGORITHM FOR GENERAL UNSYMMETRIC SPARSE LU FACTORIZATION

引用

SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS 1990年第3期11卷 383-402页

作者： DAVIS, TA YEW, PC EUROPEAN CTR RES & ADV TRAINING SCI COMPUTAT F-31057 TOULOUSEFRANCE

A parallel algorithm for the direct LU factorization of general unsymmetric sparse matrices is presented. The algorithm D2 is based on a new nondeterministic parallel pivot search that finds a compatible pivot setSS{\... 详细信息

S

${\bf S}$ of size m, followed by a parallel rank-m update. These two steps alternate until switching to dense matrix code or until the matrix is factored. The algorithm is based on a shared-memory multiple-instruction-multiple-data (MIMD) model and takes advantage of both concurrency and (gather-scatter) vectorization. The detection of parallelism due

关键词： 65F50 65W05 65F05 65-04 68-04 LU factorization general unsymmetric sparse matrices parallel algorithms nondeterministic algorithms synchronization techniques

来源：评论

学校读者我要写书评

暂无评论

Engineering Simulated Evolution for Virtual Machine Assignment Problem

引用

APPLIED INTELLIGENCE 2015年第2期43卷 296-307页

作者： Sait, Sadiq M. Shahid, Kh. Shahzada King Fahd Univ Petr & Minerals Dept Comp Engn Res Inst Dhahran 31261 Saudi Arabia King Fahd Univ Petr & Minerals Ctr Commun & IT Res Res Inst Dhahran 31261 Saudi Arabia King Fahd Univ Petr & Minerals Dept Comp Engn Dhahran 31261 Saudi Arabia

Cloud computing is a rapidly growing services business in today's IT market. Its sharp growth is producing many challenges for cloud managers. One primary concern is to efficiently manage the cloud resources, i.e., to maximize utilization of hardware with minimum power consumption. Virtual Machine (VM) consolidation is a very helpful approach to achieve these goals. In this context, we investigate the VM assignment problem. We describe the engineering of a nondeterministic iterative heuristic known as Simulated Evolution (SimE) to solve the well-known NP-hard problem of assigning VMs to hardware hosts. A 'goodness' function which is related to the target objective of the problem is defined. It guides the moves and helps traverse the search space in an intelligent manner. In the process of evolution, VMs with high goodness value have a smaller probability of getting perturbed, while those with lower goodness value may be reallocated via a compound move. Results are compared with those published in previous studies, and it is found that the proposed approach is efficient both in terms of solution quality and computational time demand.

关键词： Combinatorial optimization Evolutionary metaheuristic Simulated evolution Virtual machine placement NP-hard nondeterministic algorithms

来源：评论

学校读者我要写书评

暂无评论

Using nondeterminism to design efficient deterministic algorithms

引用

ALGORITHMICA 2004年第2期40卷 83-97页

作者： Chen, JN Friesen, DK Jia, WJ Kanj, IA Texas A&M Univ Dept Comp Sci College Stn TX 77843 USA City Univ Hong Kong Dept Comp Engn & Informat Technol Kowloon Hong Kong Peoples R China DePaul Univ Sch CTI Chicago IL 60604 USA

In this paper we illustrate how nondeterminism can be used conveniently and effectively in designing efficient deterministic algorithms. In particular, our method gives a parameterized algorithm of running time O((5.7 k)(k) n) for the 3-D matching problem, which significantly improves the previous algorithm by Downey et al. The algorithm can be generalized to yield an improved algorithm for the r-D matching problem for any positive integer r. The method can also be employed in designing deterministic algorithms for other optimization problems as well.

关键词： three-dimensional matching parameterized algorithms nondeterministic algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimal multi-dimensional vector bin packing using simulated evolution

引用

JOURNAL OF SUPERCOMPUTING 2017年第12期73卷 5516-5538页

作者： Sait, Sadiq M. Shahid, Kh. Shahzada King Fahd Univ Petr & Minerals Ctr Commun & IT Res Res Inst Dhahran 31261 Saudi Arabia King Fahd Univ Petr & Minerals Dept Comp Engn Dhahran 31261 Saudi Arabia

The use of the evolutionary heuristic simulated evolution for the optimization of the multi-dimensional vector bin packing problem, which is encountered in several industrial applications, is described. These applications range from production planning and steel fabrication to assignment of virtual machines (VMs) onto physical hosts at cloud-based data centers. The dimensions of VMs can include demands of CPU, memory, bandwidth, disk space etc. The generalized goodness functions that aid traversing the search space in an intelligent manner are designed to cater to the multidimensional nature of items (VMs). The efficiency of heuristics is tested by considering phase transition in the generation of difficult test cases. The quality of the heuristics is judged by determining how close the solution is to the estimated lower bound. A new implementation of a tighter lower bound is proposed. Experiments show that superior quality results are obtained by employing the proposed strategy.

关键词： Combinatorial optimization Evolutionary metaheuristic Simulated evolution Virtual machine placement NP-hard nondeterministic algorithms Vector bin packing problem

来源：评论

学校读者我要写书评

暂无评论

Dynamic programming on a functional memory computer

引用

COMPUTERS & MATHEMATICS WITH APPLICATIONS 1999年第11-12期37卷 17-22页

作者： Lew, A Halverson, R Univ Hawaii Manoa Dept Informat & Comp Sci Innovat Computat Lab Honolulu HI 96822 USA

In a previous paper [1], we described the solution of dynamic programming problems on a new class of parallel processing systems, the Hawaii Parallel Computer (HPC). The HPC has a novel architecture distinguished by its incorporation of field programmable gate arrays to evaluate expressions and by its use of a decision-table data structure to represent computer programs. As specific examples, we showed how the HPC can be used to implement dynamic programming solutions of shortest-path and traveling-salesman problems. In that earlier implementation, we simply adapted algorithms intended for execution on conventional deterministic von Neumann computers. More recently, we designed a successor to the HPC, a "functional memory" computer, which includes constructs for nondeterministic computation. In this paper, we discuss how dynamic programming;algorithms can be adapted to take advantage of this nondeterminism. (C) 1999 Elsevier Science Ltd. All rights reserved.

关键词： dynamic programming reconfigurable combinatorial logic parallel processing nondeterministic algorithms decision tables

来源：评论

学校读者我要写书评

暂无评论

1ST SPECIALIZE THEN GENERALIZE

引用

COMMUNICATIONS OF THE ACM 1992年第3期35卷 34-39页

作者： COHEN, J UNIV AIX MARSEILLES MARSEILLE FRANCE BROWN UNIV PROVIDENCE RI 02912 USA MIT CAMBRIDGE MA 02139 USA

来源：评论

学校读者我要写书评

暂无评论

ON THE ACCEPTING DENSITY HIERARCHY IN NP: 收藏
分享
引用; SIAM JOURNAL ON COMPUTING 1982年第2期11卷 344-349页; 作者： MORAN, S; Let AlAlAl be a polynomial time nondeterministic algorithm accepting a set A, and let a∈Aa∈Aa \in; Let $Al$ be a polynomial time algorithm accepting a set A, and let $a \in</span> </dd> <dd class='keyword' style='display: none;'> 关键词： <a href="http://202.207.7.146/asset/search?key=K%3dnondeterministic+algorithms" title="nondeterministic algorithms"> <span style = 'color:red'>nondeterministic algorithms</span> </a>   <a href="http://202.207.7.146/asset/search?key=K%3dP" title="P"> P </a>   <a href="http://202.207.7.146/asset/search?key=K%3dNP" title="NP"> NP </a>   <a href="http://202.207.7.146/asset/search?key=K%3dprobabilistic+algorithms" title="probabilistic algorithms"> probabilistic <span style = 'color:red'>algorithms</span> </a>   <a href="http://202.207.7.146/asset/search?key=K%3dalgorithms+with+oracles" title="algorithms with oracles"> <span style = 'color:red'>algorithms</span> with oracles </a>   </dd> <dd class="d-more" articleid="203414486477"> <a class="sub-arrow asource" href="javascript:void(0);"> <i class="icon-link"></i>来源： </a> <a class="adiscuss more-right" href="javascript:void(0);" datatype="3" dataid="203414486477" datatitle="ON THE ACCEPTING DENSITY HIERARCHY IN NP"> <i class="icon-commenting-o"></i>评论 <span class="stars" title="平均0.0分"> </span> </a> </dd> <dd class="d-more-content" style="display: none;"> </dd> <div class="source" style="display: none;" bookid="" articleid="203414486477"> </div> <dd class="d-more-content" style="display: none;"> <div class="discuss-content"> <div class="discuss"> <div class="discuss-sel"> <a class="current" href="javascript:;">学校读者</a> <span id="post-203414486477" class="post"> <a href="javascript:;" onclick="showdiv(this);"> <i class="icon-edit"></i>我要写书评 </a> </span> </div> <div id="commentlist-203414486477" class="discuss-list"> <dl class="no-data">暂无评论</dl> </div> <div class="search-op-bottom" id="pagelist-203414486477" style="display:none;"> <div class="articlePages pager-203414486477"></div> </div> </div> </div> </dd> </dl> </div> <span id="noMoreDiv" style="display: none">没有更多数据了...</span> <span id="zkfwcount" style="display: none;"></span>  <div id="ajaxBefroeDiv" class="more"><a href="javascript:void(0);">下一页</a> </div> <input type="hidden" id="hidKey" name="hidKey" value="K=nondeterministic algorithms"> <input type="hidden" id="hidCf" name="hidCf" value=""> <input type="hidden" id="hidRf" name="hidRf" value=""> <input type="hidden" id="hidSo" name="hidSo" value="0"> <input type="hidden" id="hidLs" name="hidLs" value="0"> <input type="hidden" id="hidPi" name="hidPi" value="1"> <input type="hidden" id="hidFr" name="hidFr" value=""> <input type="hidden" id="hidshowRule" name="hidshowRule" value="主题词=nondeterministic algorithms"> <input type="hidden" id="hidRule" name="hidRule" value="subject:"nondeterministic algorithms""> <input type="hidden" id="hidshowAllRule" name="hidshowRuleCluster" value="主题词=nondeterministic algorithms"> <input type="hidden" id="hidSearchMode" name="hidSearchMode" value="0"> <div class="search-op-bottom"> <div class="search-op-sel"> <a href="javascript:void(0);" onclick="g_selectedAll();"><i class="icon-check"></i>全选</a> <a href="javascript:void(0);" onclick="g_clearAll();"><i class="icon-check-empty"></i>清除本页</a> <a href="javascript:void(0);" onclick="g_clearAllIds();"><i class="icon-all-empty"></i>清除全部</a> <a href="javascript:void(0);" class="exportlink" onclick="g_exportList();"><i class="icon-export"></i>题录导出</a> <a href="javascript:void(0);" class="save-result" onclick="showModoul();"><i class="icon-save"></i>标记到“检索档案”<i title="标记当前检索页的文献，保存到个人资源库的“检索档案”。永久保存您的研究轨迹！" class="icon-question-circle-o"></i></a> </div> <span id="pageSpan" class="pages"> <div class="pages"> <span class="total">共2页</span> <span class="page"> <a href="javascript:void(0);" onclick="javascript:void(0);" title="首页"><<</a>  <a href="javascript:void(0);" onclick="javascript:void(0);" title="上一页"><</a> <span class="page_num"> <a href="javascript:void(0);" onclick="javascript:void(0);" class="current">1</a> <a href="/asset/search?key=K%3Dnondeterministic+algorithms&page=2" onclick="javascript:void(0);" class="">2</a> </span> <a href="/asset/search?key=K%3Dnondeterministic+algorithms&page=2" onclick="javascript:void(0);" title="下一页">></a>  <a href="/asset/search?key=K%3Dnondeterministic+algorithms&page=2" onclick="javascript:void(0);" title="末页">>></a> </span> <input type="hidden" id="hidPageCount" value="11"> </div> </span> </div> <div class="tools"> <div style="display: none;"> <a class="tools-btn" href="javascript:void(0)" id="btnRetrieveReport">检索报告</a> <a class="tools-btn" href="javascript:void(0)" id="btnGoToCompare" style="display: none;">对象比较</a> <a class="tools-btn" href="javascript:void(0)" id="btnMergeTool" style="display: none">合并检索<span id="selectMergeSearch" class="sel-num" style="display: none;">0</span></a> <div class="cluster-selected" id="divClusterTool" style="display: none;"> <input type="hidden" name="selectCondition" id="selectCondition" value="" autocomplete="off"> <ul id="cplist" class="cluster-selected-list"></ul> <div class="submit"> <a id="hideCondition" href="javascript:void(0)" class="clear-btn">隐藏</a> <a id="clearAllCondition" href="javascript:void(0)" class="clear-btn">清空</a> </div> </div> <div class="cluster-selected" id="divMergeSearch" style="display: none"> <ul class="cluster-selected-list" id="ulMergeSearch"></ul> <div class="submit"> <a class="submit-btn2" href="javascript:void(0)" id="btnMergeSearch">合并搜索</a> </div> </div> </div> <a class="tools-btn" href="javascript:void(0)" id="go-to-top" style="display: block;"> 回到顶部 </a> </div> <div class="cluster-tools"> <a href="javascript:void(0)" id="submitExecute">执行限定条件<span id="selectNumber" class="sel-num" style="display: none;"></span></a> </div>  <div id="commentDiv" class="layer-box" style="display: none;width:100%;"> <input id="hidcomment" type="hidden" value=""> <input id="hidcommentTitle" type="hidden" value=""> <input id="hidcommentType" type="hidden" value=""> <div class="layer-content"> <div class="content-input lb-2"> <div class="input-line"> <div class="input-label">内容：</div> <div class="input"> <textarea id="txtcontent" name="txtcontent" style="width: 100%; height: 149px" rows="12" cols="80"></textarea> </div> </div> <div class="input-line"> <div class="input-label">评分：</div> <div id="star" class="stars"></div> <input id="hidscore" type="hidden"> </div> <div class="submit"> <input type="button" class="re-nextbtn" value="确定" onclick="submitComment()"> </div> </div> </div> </div>  <div class="layer-box save" id="pagesearch-save" style="display: none;width:400px;"> <div class="layer-content"> <div class="save-select"> <h2> 请选择保存的检索档案：<span class="h-op"> <button onclick="createFL('fl')" id="cfl"><i class="icon-plus"></i>新增检索档案</button> <input type="text" id="txtname" style="display: none"> <input type="hidden" id="hidname" style="display: none" value=""> <input type="hidden" id="hidref" value="0"> <button onclick="sureQueryDocument()" id="btnCreateFL" style="display: none">确定</button> <button class="cancel" onclick="cancelQueryDocument()" id="btnCancel" style="display: none">取消</button> </span> </h2> <ul id="searchul"> <li><a data="" class="current" href="javascript:void(0);" rel="3161" onclick="liClick(this)"></a></li> </ul> </div> <div class="submit"> <input type="button" value="保存" onclick="saveResult();" name="" class="btn-s"> </div> </div> </div>  <div class="layer-box save" id="pagesearch-save-detail" style="display: none;width:400px;"> <div class="layer-content"> <div class="save-select"> <h2> 请选择收藏分类：<span class="h-op"> <button onclick="createFL('sc')" id="csc"><i class="icon-plus"></i>新增自定义分类</button> <input type="text" id="txtnamedetail" style="display: none"> <input type="hidden" id="hidnamedetail" style="display: none" value=""> <button onclick="sureDetail()" id="btnSureDetail" style="display: none">确定</button> <button class="cancel" onclick="cancelDetail()" id="btnCancelDetail" style="display: none">取消</button> </span> </h2> <ul id="ulcollection"> </ul> </div> <div class="submit"> <input type="button" value="保存" onclick="addCollection();" name="" class="btn-s"> </div> </div> </div>  <div class="layer-box save" id="pagesearch-save-dy" style="display: none;width:350px;margin-left:0px;margin-top:0px"> <div class="layer-content"> <div class="sinput"> <strong>订阅名称：</strong> <input type="text" id="txtdyname" maxlength="50" value="新的检索订阅…" class="watermark"> </div> <div class="submit"> <input type="button" value="保存" onclick="saveDy();" name="" class="btn-s"> </div> </div> </div>  <div class="layer-box apply" style="position: fixed; width: 350px; display: none;" id="cquborrow"> <div class="close"><a href="javascript:void(0);" onclick="jQuery('#cquborrow').hide()"><i class="icon-remove"></i></a></div> <input type="hidden" id="Hidden1" value=""> <h5 class="layer-title"> <span>通借通还</span> </h5> <div class="layer-content"> <p class="intro">温馨提示：</p> <div class="sinput"> <strong>图书名称：</strong> </div> <div class="sinput"> <strong>借书校区：</strong> </div> <div class="sinput"> <strong>取书校区：</strong> </div> <div class="sinput"> <strong>手机号码：</strong> <input type="text" id="Text4" placeholder="请输入电话" value="15310096672"> </div> <div class="sinput"> <strong>邮箱地址：</strong> <input type="text" id="Text5" placeholder="请输入电话" value="15310096672"> </div> <div class="sinput"> <strong>一卡通帐号：</strong> <input type="text" id="Text6" placeholder="请输入电话" value="15310096672"> </div> <div class="submit"> <input type="button" value="提交请求" onclick="SaveBorrow(this);" name="" class="btn-s"> </div> </div> </div>  <div class="layer-box apply" id="pagesearch-save-zj" style="position: fixed; width: 350px; display: none;margin-top:0px"> <input type="hidden" id="hidarticleids" value=""> <div class="layer-content"> <p class="intro">电话和邮箱必须正确填写，我们会与您联系确认。</p> <div class="sinput"> <strong>联 系  人：</strong> <input type="text" id="txtUserName" placeholder="请输入联系人" readonly="readonly" value=""> </div> <div class="sinput"> <strong>所在院系：</strong> <input type="text" id="txtDepartment" placeholder="请输入院系" readonly="readonly" value=""> </div> <div class="sinput"> <strong>联系邮箱：</strong> <input type="text" id="txtEmail" placeholder="请输入邮箱" value=""> </div> <div class="sinput"> <strong>联系电话：</strong> <input type="text" id="txtPhone" placeholder="请输入电话" value=""> </div> <div class="submit"> <input type="button" value="提交申请" onclick="saveNewZj(this);" name="" class="btn-s"> </div> </div> </div>  <div class="layer-box quote" id="pagesearch-quote" style="display: none;width:700px;"> <div class="layer-content"> </div> </div> <input type="hidden" id="hidtitle" value=""> <input type="hidden" id="hidtype" value=""> <input type="hidden" id="hidsubject" value=""> <input type="hidden" id="hidid" value=""> </div> </div> </div> <input id="hidUserKey" type="hidden" value=""> <input id="hidUserStatus" type="hidden" value="0"> </div> </div> <div id="footer"> <div class="l-width"> <div class="content"> <p>版权所有：内蒙古大学图书馆技术提供：维普资讯• 智图</p> <p>内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021 </p> </div> </div> </div> <div class="footer-code-show" id="footer-code-show" style="display:none"> <img src="/images/site/cd_cx.jpg" /> <a class="close" href="javascript:void(0);" onclick="jQuery('#footer-code-show').hide();jQuery('#lay-bg').hide();"></a> </div> <div class="layer-bg" id="lay-bg" style="display:none"></div> <input type="hidden" value="[{"site_type":0,"site_id":3,"log_type":1,"user_key":"","reader_number":"","nickname":"","login_name":"","reader_name":"","reader_type":"","edu_background":"","reader_title":"","department_name":"","specialty_name":"","page_board_id":10000,"page_object_id":0,"article_id":"","content_id":0,"full_class_ids":"","article_type":0,"title":"","subject":"","classes":"","zh_classes":"","user_ip_address":"216.73.216.194","user_session_id":"","provided_id":"0","provider":null,"resource_id":"0","source_flag":"0","grade_name":"","jounal_id":"","page_path_url":"http://202.207.7.146/asset/search","page_params":"?key=K%3Dnondeterministic+algorithms","page_url":"http://202.207.7.146/asset/search?key=K%3Dnondeterministic+algorithms","refer_url":"","user_browser":"Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)","login_type":0,"login_flag":0,"keyword":"","page_content_type":0,"article_date":0,"createtype":0,"remark":"智图访问记录","record_source":"数字图书馆","access_device":0},{"site_type":0,"site_id":3,"log_type":3,"user_key":"","reader_number":"","nickname":"","login_name":"","reader_name":"","reader_type":"","edu_background":"","reader_title":"","department_name":"","specialty_name":"","page_board_id":10000,"page_object_id":0,"article_id":"","content_id":0,"full_class_ids":"","article_type":0,"title":"","subject":"","classes":"","zh_classes":"","user_ip_address":"216.73.216.194","user_session_id":"","provided_id":"0","provider":"0","resource_id":"0","source_flag":"0","grade_name":"","jounal_id":"","page_path_url":"http://202.207.7.146/asset/search","page_params":"?key=K%3Dnondeterministic+algorithms","page_url":"http://202.207.7.146/asset/search?key=K%3Dnondeterministic+algorithms","refer_url":"","user_browser":"Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)","login_type":2,"login_flag":0,"keyword":"","page_content_type":10005,"article_date":0,"createtype":0,"remark":"智图访问记录","record_source":"数字图书馆","access_device":0}]" id="log" /> <script> //检索框 require(["search"], function (search) { search.searching(); }); //高级检索 require(["advancedsearch"], function (advancedsearch) { advancedsearch.advanced(); }); //学科分类图 require(["subjectcategory"], function (subjectcategory) { subjectcategory.domainchoose(); });$

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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