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

IEEE Annual Ubiquitous Computing, Electronics & Mobile Communication Conference (UEMCON)

作者： Badar Almarri Sanguthevar Rajasekaran Chun-Hsi Huang Univ. of Connecticut - King Faisal Univ. Storrs Alhasa USA Saudi Arabia

ISBN: (纸本)9781728138862

With the evolution of sensor-empowered systems in fields ranging from smart cities (e.g., green energy) and industry (e.g., machines condition monitoring) to personal and social health and wellness (e.g., wearable devices and electroencephalography, EEG), it is vital to consider constraints related to these sensors, including power consumption and noise. Consequently, empowering intelligence (e.g. prediction of states or outcomes) in such systems becomes of high importance in order to better deal with such constraints and to reduce the effects of dimensionality and volume of sensed data. Here, we propose a sensor selection algorithm that minimizes the sensor space relying on the similarities in how sensors sense a given environment. This algorithm resulted in a significant reduction in the sensor space without notable loss of accuracy when compared against the complete set of the sensing space. We applied the proposed algorithm to two sensor-based time-series datasets of different fields of application.

关键词： Sensor selection Time-series Feature Extraction Big Data Sensor Space Reduction big data Feature extraction Sensors time series data selection algorithm health green energy Time series Electroencephalography

来源：评论

学校读者我要写书评

暂无评论

Subset-sum Based Relay selection for Multipath TCP in Cooperative LTE Networks

Subset-sum Based Relay Selection for Multipath TCP in Cooper...

引用

IEEE Global Communications Conference

作者： Dizhi Zhou Wei Song Peijian Ju Faculty of Computer Science University of New Brunswick

ISBN: (纸本)9781479913510

Pooling mobile devices in vicinity as a cooperative community offers an opportunity to enable multipath transmission for multi-homed mobile devices, even when there is no multiple access coverage. Nonetheless, the available bandwidth provided by relays can be highly varying due to a range of factors such as wireless channel fading and dynamic local traffic load at relays. As a result, it is challenging to maintain a stable multipath aggregate throughput over relays. In this paper, we propose an enhancement module within the application layer for a cooperative community in the Long Term Evolution (LTE) network. Our extension is based on the standardized multipath transport control protocol (MPTCP) [1]. Based on relay bandwidth monitoring, a dynamic relay selection algorithm is developed for adding and deleting paths so as to ensure a stable aggregate throughput in a highly varying environment. The proposed relay selection algorithm is based on a fully polynomial-time subset-sum approximation [2]. Extensive simulations are conducted to evaluate the proposed solution in different background traffic patterns. The simulation results well demonstrate the strengths in minimizing throughput outage, the number of active subflows, and performance variation.

关键词： MPTCP LTE Relay selection Subset sum Cooperative wireless networks Local thermodynamic equilibrium relay Long Term Evolution selection algorithm Wireless networks application layer Multipath transmission

来源：评论

学校读者我要写书评

暂无评论

Detection of timing loop and clock selection in a synchronous ethernet network based on hop count

Detection of timing loop and clock selection in a synchronou...

引用

3rd International Conference on Electrical, Electronics, Engineering Trends, Communication, Optimization and Sciences (EEECOS 2016)

作者： Satheesh Kumar S. Abhinav Pandit Juniper Networks India Juniper Networks USA

ISBN: (纸本)9781510863279

A Synchronous Ethernet Network consists of network element (NE) which recover clock from the underlying Ethernet PHY and the quality of clock is conveyed using Ethernet Synchronous Messaging Channel with QL information embedded in QL-TLV. This enables clock selection for the downstream node. This paper describes a method to detect Timing Loop in synchronous network by modifying the current clock selection algorithm by adding another TLV to ESMC. A new parameter `hop count' define this new TLV which is incremented by `1' on each hop as the ESMC messages propagate on a synchronous ethernet network. This paper also shows the modified clock selection algorithm which each NEs uses to select the best available clock from a set of clocks. Also this paper captures the MTIE/TDEV graph for the frequency error/noise respectively with the proposed solution.

关键词： Synchronous Ethernet Ethernet Synchronization Messaging Channel Timing Loop Hop count hop counts Timing devices Ethernet networks Humulus Loops Threshold Limit Values selection algorithm

来源：评论

学校读者我要写书评

暂无评论

A STABLE GENE selection METHOD BASED ON SAMPLE WEIGHTING 26th

A STABLE GENE SELECTION METHOD BASED ON SAMPLE WEIGHTING

引用

IEEE Canadian Conference on Electrical and Computer Engineering

作者： Guoyin Wang Juan Gao Feng Hu Chongqing Key Laboratory of Computational Intelligence Chongqing University of Posts and Telecommunications

ISBN: (纸本)9781479900312

In microarray analysis, the selection of informative gene is an essential issue for tissue classification and successful treatment because of its ability to improve the accuracy and decrease computational complexity. However, the gene subsets selected by the same method often vary significantly with some variations of the samples in the same data set. Thus, the stability of the selected genes is an aspect as important as the predictive ability to quantify a feature selection algorithm. This work is an attempt to improve the stability of feature selection methods from the point of view of sample importance. We propose an efficient mean deviation-based sample weighting algorithm to improve the stability of feature selection methods by assigning a weight to each sample according to the mean deviation of its local value in giving samples. We perform a series of experiments with four frequently studied public data sets, and the experimental results validate that the proposed method improves the stability of common feature selection algorithms such as ReliefF without sacrificing the classification performance. Furthermore, more stable gene feature sets obtained by the proposed method than the state-of-the-art ensemble method and margin-based sample weighting algorithm.

关键词： Feature selection Stability Gene expression microarray Classification performance Feature extraction Gene Feature Genes algorithms Mean deviation Dataset selection algorithm Microarray Analysis selection methods point of view

来源：评论

学校读者我要写书评

暂无评论

Bulk Recycling: Density Separation Models for Mixed Plastic Waste

Bulk Recycling: Density Separation Models for Mixed Plastic ...

引用

作者： St. Hilaire, Megan Lee University of Rhode Island

学位级别：M.S., Master of Science/Master of Surgery

Microplastic pollution is now everywhere, from the highest elevation of Mount Everest to the deepest dives of the Mariana Trench. The use of synthetic polymers has contributed to the transformation of our modern world. Nonetheless, the growing presence of plastics in the natural environment constitutes a sense of urgency to develop sustainable solutions to address the global plastic pollution crisis. Approximately 80 percent of all the plastics ever produced have been discarded. Our relationship with plastic needs rethinking. Achieving a circular economy requires a holistic approach to redesign the systems that make, use and reuse plastics. Evaluating the life cycle of plastic products is key to effective advancements in the collection, separation and sorting systems of mixed plastic waste streams. This thesis critically reviews bulk recycling methods used in industry. Recycling provides significant opportunities for recovering material resources through mechanical and/or chemical processes, which in return reduces petrochemical usage, greenhouse gas emissions, and the quantity of waste requiring disposal. Yet, recovering the resource value of mixed plastic waste streams presents critical challenges in materials identification and recycling process design. Bulk recycling models consider the selection of the best sequence for isolating target materials from a mixed material stream. This thesis models the separation of single and multiple target materials using density separation techniques to minimize the total processing volume and cost. Furthermore, a selection algorithm is implemented to calculate the processing costs of each pass, determine the minimum cost of separation, and present the optimal separation sequence.

关键词： Circular economy Density separation Plastic waste Process optimization Recycling selection algorithm

来源：评论

学校读者我要写书评

暂无评论

Reduced-Order Modeling for Dynamic Mode Decomposition Without an Arbitrary Sparsity Parameter

引用

AIAA JOURNAL 2020年第9期58卷 3919-3931页

作者： Graff, John Ringuette, Matthew J. Singh, Tarunraj Lagor, Francis D. SUNY Buffalo Dept Mech & Aerosp Engn Buffalo NY 14260 USA

Dynamic mode decomposition (DMD) yields a linear, approximate model of a system's dynamics that is built from data. This paper seeks to reduce the order of this model by identifying a reduced set of modes that best fit the output. A model selection algorithm from statistics and machine learning known as least angle regression (LARS) is adopted. LARS is modified to be complex-valued, and LARS is used to select DMD modes. The resulting algorithm is referred to as least angle regression for dynamic mode decomposition (LARS4DMD). Sparsity-promoting dynamic mode decomposition (DMDSP), a popular mode-selection algorithm, serves as a benchmark for comparison. LARS4DMD has the advantage that the sparsity parameter required for DMDSP is not needed. Numerical results from a Poiseuille flow test problem show that LARS4DMD yields reduced-order models that have comparable performance to DMDSP. Use of the LARS4DMD algorithm on particle image velocimetry data of a rotating fin confirms this conclusion on experimental data. Results further suggest that LARS4DMD may be slightly more robust to noise in the experimental data.

关键词： Particle Image Velocimetry Poiseuille Flow selection algorithm Machine Learning Singular Value Decomposition Modal Analysis Vortex Shedding Computational Fluid Dynamics Nonlinear Dynamics Navier Stokes Equations

来源：评论

学校读者我要写书评

暂无评论

Energy efficiency comparison of MIMO-based and multihop sensor networks

引用

EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING 2008年第1期000卷 732145-732145页

作者： Bravos, George Kanatas, Athanasios G. Univ Piraeus Wireless Commun Lab Dept Technol Educ & Digital Syst Piraeus 18534 Greece

Wireless sensor networks (WSNs) demand the implementation of energy-aware techniques and low-complexity protocols in all layers. Recently, a MIMO-based structure has been proposed to offer enhanced energy savings in WSNs. In this paper, we examine and compare MIMO-based WSN with a multihop transmission in terms of energy efficiency. The results depend on the network density, the channel conditions, and the distance to the destination node. We reach analytical expressions to calculate threshold values of these parameters, which determine the areas where the MIMO-based structure outperforms multihop transmission. Moreover, we present a detailed analysis of the dissipated power during a sensor node_s operation, to prove that as microelectronics develops, the MIMO-based architecture will outperform the equivalent multihop structure for most of the cases examined. Finally, we implement a simple cooperative node selection algorithm to achieve higher energy gains in the MIMO approach, and we examine how this algorithm affects the calculated thresholds. Copyright (C) 2008 G. Bravos and A. G. Kanatas.

关键词： Energy Efficiency Sensor Network Wireless Sensor Network Destination Node selection algorithm

来源：评论

学校读者我要写书评

暂无评论

Cost-Based Vertical Handover Decision algorithm for WWAN/WLAN Integrated Networks

引用

EURASIP JOURNAL ON WIRELESS COMMUNICATIONS AND NETWORKING 2009年第unknown期2009卷 372185-372185页

作者： Hong, Kunho Lee, SuKyoung Kim, LaeYoung Song, PyungJung Yonsei Univ Dept Comp Sci Seoul 120749 South Korea Elect & Telecommun Res Inst Taejon 305700 South Korea

Next generation wireless communications are expected to rely on integrated networks consisting of multiple wireless technologies. Heterogeneous networks based on Wireless Local Area Networks (WLANs) and Wireless Wide Area Networks (WWANs) can combine their respective advantages on coverage and data rates, offering a high Quality of Service (QoS) to mobile users. In such environment, multi-interface terminals should seamlessly switch from one network to another in order to obtain improved performance or at least to maintain a continuous wireless connection. Therefore, network selection algorithm is important in providing better performance to the multi-interface terminals in the integrated networks. In this paper, we propose a cost-based vertical handover decision algorithm that triggers the Vertical Handover (VHO) based on a cost function for WWAN/WLAN integrated networks. For the cost function, we focus on developing an analytical model of the expected cost of WLAN for the mobile users that enter the double-coverage area while having a connection in the WWAN. Our simulation results show that the proposed scheme achieves better performance in terms of power consumption and throughput than typical approach where WLANs are always preferred whenever the WLAN access is available. Copyright (C) 2009

关键词： Cost Function Area Network selection algorithm Mobile User Wireless Local Area Network

来源：评论

学校读者我要写书评

暂无评论

Identification of Nonlinear Systems with Reduced Volterra-series

引用

IFAC Proceedings Volumes 1994年第8期27卷 143-150页

作者： J. Kurth H. Rake Institut für Regelungstechnik RWTH Aachen Steinbachstr. 54 52056 Aachen FRG

Volterra-series are very suitable for modelling nonlinear processes, since they cover a large class of nonlinear systems. In the past, it has often been pointed out that Volterra-series are not ideal for identification due to the large number of parameters, which have to be estimated. In this paper, a new identification method will be presented which reduces the number of estimated parameters to a reasonable size by introducing basis functions. Further reduction can be achieved using a selection algorithm, which selects the most suitable basis functions from a large class of different basis functions. In simulation examples, it will be shown that many nonlinear systems can be identified with less than 20 parameters.

关键词： Identification Nonlinear systems Volterra-series Basis functions selection algorithm

来源：评论

学校读者我要写书评

暂无评论

A Linear Time algorithm for a: 收藏
分享
引用; SIAM Journal on Computing 1977年第3期6卷 481-486页; 作者： D. L. Adolphson G. N. Thomas; This paper considers a special case of the standard transportation problem obtained by restricting the number of origins to two. Necessary and sufficient conditions are established which lead to a direct construction ... 详细信息; This paper considers a special case of the standard transportation problem obtained by restricting the number of origins to two. Necessary and sufficient conditions are established which lead to a direct construction of the optimal solution. Using an extension of a recent , an is developed to solve this special case of the transportation problem in $</span> </dd> <dd class='keyword' style='display: none;'> 关键词： <a href="http://202.207.7.146/asset/search?key=K%3dtransportation+problem" title="transportation problem"> transportation problem </a>   <a href="http://202.207.7.146/asset/search?key=K%3dselection+algorithm" title="selection algorithm"> <span style = 'color:red'>selection algorithm</span> </a>   <a href="http://202.207.7.146/asset/search?key=K%3dcomputational+complexity" title="computational complexity"> computational complexity </a>   </dd> <dd class="d-more" articleid="203415308656"> <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="203415308656" datatitle="A Linear Time Algorithm for a"> <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="203415308656"> </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-203415308656" class="post"> <a href="javascript:;" onclick="showdiv(this);"> <i class="icon-edit"></i>我要写书评 </a> </span> </div> <div id="commentlist-203415308656" class="discuss-list"> <dl class="no-data">暂无评论</dl> </div> <div class="search-op-bottom" id="pagelist-203415308656" style="display:none;"> <div class="articlePages pager-203415308656"></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=Selection algorithm"> <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="22"> <input type="hidden" id="hidFr" name="hidFr" value=""> <input type="hidden" id="hidshowRule" name="hidshowRule" value="主题词=Selection algorithm"> <input type="hidden" id="hidRule" name="hidRule" value="subject:"selection algorithm""> <input type="hidden" id="hidshowAllRule" name="hidshowRuleCluster" value="主题词=Selection algorithm"> <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">共26页</span> <span class="page"> <a href="/asset/search?key=K%3DSelection+algorithm&page=1" onclick="javascript:void(0);" title="首页"><<</a>  <a href="/asset/search?key=K%3DSelection+algorithm&page=21" onclick="javascript:void(0);" title="上一页"><</a> <span class="page_num"> <a href="/asset/search?key=K%3DSelection+algorithm&page=17" onclick="javascript:void(0);" class="">17</a> <a href="/asset/search?key=K%3DSelection+algorithm&page=18" onclick="javascript:void(0);" class="">18</a> <a href="/asset/search?key=K%3DSelection+algorithm&page=19" onclick="javascript:void(0);" class="">19</a> <a href="/asset/search?key=K%3DSelection+algorithm&page=20" onclick="javascript:void(0);" class="">20</a> <a href="/asset/search?key=K%3DSelection+algorithm&page=21" onclick="javascript:void(0);" class="">21</a> <a href="javascript:void(0);" onclick="javascript:void(0);" class="current">22</a> <a href="/asset/search?key=K%3DSelection+algorithm&page=23" onclick="javascript:void(0);" class="">23</a> <a href="/asset/search?key=K%3DSelection+algorithm&page=24" onclick="javascript:void(0);" class="">24</a> <a href="/asset/search?key=K%3DSelection+algorithm&page=25" onclick="javascript:void(0);" class="">25</a> <a href="/asset/search?key=K%3DSelection+algorithm&page=26" onclick="javascript:void(0);" class="">26</a> </span> <a href="/asset/search?key=K%3DSelection+algorithm&page=23" onclick="javascript:void(0);" title="下一页">></a>  <a href="/asset/search?key=K%3DSelection+algorithm&page=26" onclick="javascript:void(0);" title="末页">>></a> </span> <input type="hidden" id="hidPageCount" value="252"> </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":"0c1aad352b2a43d0bc25f722f14d6769","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.230","user_session_id":"0c1aad352b2a43d0bc25f722f14d6769","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%3DSelection+algorithm&page=22","page_url":"http://202.207.7.146/asset/search?key=K%3DSelection+algorithm&page=22","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":"0c1aad352b2a43d0bc25f722f14d6769","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.230","user_session_id":"0c1aad352b2a43d0bc25f722f14d6769","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%3DSelection+algorithm&page=22","page_url":"http://202.207.7.146/asset/search?key=K%3DSelection+algorithm&page=22","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(); });$

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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