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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

458 篇 会议
24 篇 期刊文献
18 册 图书

馆藏范围

499 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

323 篇 工学
- 254 篇 计算机科学与技术...
- 142 篇 软件工程
- 52 篇 电气工程
- 44 篇 信息与通信工程
- 34 篇 土木工程
- 20 篇 生物医学工程（可授...
- 17 篇 建筑学
- 16 篇 材料科学与工程（可...
- 15 篇 控制科学与工程
- 13 篇 仪器科学与技术
- 12 篇 机械工程
- 11 篇 光学工程
- 10 篇 力学（可授工学、理...
- 10 篇 测绘科学与技术
- 10 篇 生物工程
- 6 篇 化学工程与技术
113 篇 理学
- 68 篇 数学
- 22 篇 物理学
- 20 篇 生物学
- 13 篇 统计学（可授理学、...
- 9 篇 化学
- 7 篇 地质学
- 7 篇 系统科学
- 6 篇 地球物理学
43 篇 管理学
- 23 篇 图书情报与档案管...
- 22 篇 管理科学与工程(可...
- 10 篇 工商管理
23 篇 医学
- 18 篇 临床医学
- 9 篇 特种医学
- 7 篇 医学技术（可授医学...
4 篇 农学
3 篇 经济学
3 篇 法学
3 篇 教育学
3 篇 文学

主题

105 篇 data structures
36 篇 data mining
22 篇 computer science
17 篇 clustering algor...
12 篇 algorithms
12 篇 internet
12 篇 algorithm design...
10 篇 structural healt...
10 篇 classification a...
10 篇 data models
9 篇 computer archite...
9 篇 image segmentati...
9 篇 protocols
9 篇 hardware
9 篇 algorithm analys...
9 篇 partitioning alg...
8 篇 discrete mathema...
8 篇 databases
7 篇 scalability
7 篇 deep learning

机构

5 篇 fujian prov univ...
5 篇 hubei univ techn...
4 篇 microsoft resear...
3 篇 chandigarh unive...
3 篇 wuhan fiberhome ...
2 篇 univ michigan an...
2 篇 institute of aer...
2 篇 engineer dxc tec...
2 篇 fermilab natl ac...
2 篇 southwest jiaoto...
2 篇 department of co...
2 篇 lovely professio...
2 篇 univ maryland de...
2 篇 int hellen univ ...
2 篇 aeronautics-tech...
2 篇 peking univ ctr ...
2 篇 lloyd institute ...
2 篇 nci frederick ca...
2 篇 college of engin...
2 篇 heriot watt univ...

作者

5 篇 ye zhiwei
3 篇 lehner wolfgang
2 篇 shatsky maxim
2 篇 monaco ernesto
2 篇 montenegro manue...
2 篇 catthoor francky
2 篇 scholz sven-bodo
2 篇 napoli amedeo
2 篇 tjortjis christo...
2 篇 chen chen
2 篇 thiele maik
2 篇 weifeng lv
2 篇 fischer ulrike
2 篇 yan lingyu
2 篇 praveen
2 篇 saxena sanjeev
2 篇 dror oranit
2 篇 tongyu zhu
2 篇 wolfson haim j.
2 篇 ouyang cheng

语言

491 篇 英文
4 篇 其他
2 篇 俄文
2 篇 中文
1 篇 乌克兰文

检索条件"任意字段=10th International Workshop on Algorithms and Data Structures"

共 500 条记录，以下是231-240 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Integrated management of 10G-PON network element using NETCONF and OpenFlow

Integrated management of 10G-PON network element using NETCO...

引用

international Conference on Network and Service Management

作者： André Berti Sassi Manuel Santos Gavidia Eder Leão Fernandes Marcelo Ribeiro Nascimento Converged Networks Corporate Department CPqD Research and Development Center in Telecommunications Campinas Brazil

this paper describes an integrated management architecture and solution for controlling network elements composed of controller, optional aggregation switch and a variable number of optical line terminals (OLTs), including multiple OLTs based on different technologies and presenting distinct features. the YANG language was used to model configuration and state data manipulated by the Network Configuration Protocol (NETCONF). the system allows the configuration of OpenFlow switches, providing greater protocol flexibility and forwarding algorithms to the aggregation network. the architecture has been implemented and tested using a real Gigabit-capable Passive Optical Network (GPON), a stacked GPON and switch equipment in a variety of scenarios.

关键词： Passive optical networks Switches Optical network units data models Ports (Computers) Software

来源：评论

学校读者我要写书评

暂无评论

Parallel frequent itemset mining on streaming data

Parallel frequent itemset mining on streaming data

引用

international Conference on Natural Computation (ICNC)

作者： Yanshan He Min Yue Electronic and Information Science Department Lanzhou Jiaotong University Lanzhou Gansu China Institute of Modern Physics Chinese Academy of Sciences Lanzhou Gansu China

ISBN: (纸本)9781479951529

Owing to the widely used of data stream, frequent itemset mining on data stream have received more attention. data stream is fast changing, massive, and potentially infinite. therefore, we have to establish new data structure and algorithm to mine it. On the base of our previous work, we propose a new paralleled frequent itemset mining algorithm for data stream based on sliding window, which is called PFIMSD. the algorithm compresses whole data in current window into PSD-trees on paralleled processor only by one-scan. Increment method is used to append or delete related branch on PSD-tree when window is sliding. the experiment shows PFIMSD algorithm has good performance on efficiency and expansibility.

关键词： data mining Algorithm design and analysis Itemsets data structures Approximation algorithms Parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Scalable user data management in multi-tenant cloud environments

Scalable user data management in multi-tenant cloud environm...

引用

international Conference on Network and Service Management

作者： Pieter-Jan Maenhaut Hendrik Moens Veerle Ongenae Filip De Turck Dept. of Information Technology Gaston Crommenlaan Ghent University Belgium Dept. of Industrial Technology and Construction Valentin Vaerwyckweg Ghent University Ghent Belgium

the rise of cloud computing and its elastic, on-demand resource provisioning introduces the need for a flexible and scalable multi-tenant architecture. In a multi-tenant application every tenant (client) makes use of shared application instances, but each tenant typically has its own user data. the shared application instance behaves like a private instance by guaranteeing both data separation and performance separation for every tenant. As the number of tenants increases, the amount of data grows. A scalable solution for the storage is needed, allowing tenant data to be divided over multiple database instances, but taking into account performance isolation and custom data assurance policies. In this paper we introduce an abstraction layer for achieving high scalability for the storage of tenant data. this layer uses data allocation algorithms to determine an acceptable allocation of tenant data to different databases. We describe a mathematical model for the allocation of tenant data which can be optimized using existing linear programming techniques, and introduce the BDAA-n and FDAA, two algorithms that will find an optimal allocation of data by iterating over the possible permutations. the proposed solutions are evaluated based on their flexibility, complexity and efficiency. the flexibility of the BDAA and FDAA makes them easy to customize and extend to fit most scenarios, but the algorithms will achieve best results for tenants with a limited number of subtenants. Linear programming is an alternative for tenants with a higher number of subtenants, but the customizability of the algorithm for specific use cases is limited due to the need for linear functions.

关键词： Resource management databases Scalability Computer architecture Elasticity Cost function Cloud computing

来源：评论

学校读者我要写书评

暂无评论

YANG2UML: Bijective transformation and simplification of YANG to UML

YANG2UML: Bijective transformation and simplification of YAN...

引用

international Conference on Network and Service Management

作者： Mario Golling Robert Koch Peter Hillmann Rick Hofstede Frank Tietze Department of Computer Science Universität der Bundeswehr München Neubiberg Germany

Specifically designed to exchange configuration information from a management platform to network components, the XML-based NETCONF protocol has become widely used. In combination with NETCONF, YANG is the corresponding protocol that defines the associated data structures, supporting virtually all network configuration protocols. YANG itself is a semantically rich language, which - in order to facilitate familiarization with the relevant subject - is often visualized using UML to involve other experts or developers and to support them by their daily work (writing applications which make use of YANG/NETCONF). To support this process, this paper presents an novel approach to optimize and simplify YANG data models, as current solutions tend to produce very complex UML diagrams. therefore, we have (i) defined a bidirectional mapping of YANG to UML, (ii) developed a strategy to reduce the numbers of objects, and (iii) created a tool that renders the created UML diagrams, closing the gap between technically improved data models and their human readability.

关键词： Unified modeling language data models XML Containers Semantics Protocols data visualization

来源：评论

学校读者我要写书评

暂无评论

Hierarchical structure invariance and optimal approximation for proximity data

Hierarchical structure invariance and optimal approximation ...

引用

the 2014 10th international Conference on Natural Computation (ICNC 2014) and the 2014 11th international Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2014)(第十届自然计算和第十一届模糊系统与知识发现国际会议)

作者： Xiao-Li Xue Li-Tan Peng Hua Tao Wei-Wei Li Xu-Qing Tang School of Science Jiangnan UniversityWuxi 214122China

ISBN: (纸本)9781479951499

Based on granular space,the hierarchical structure invariance and optimal approximation for proximity data are presented,and four results are obtained as ***,an improved algorithm for computing the hierarchical structure and the related min-transitive closure of a fuzzy proximity relation are given,and the properties of key point sequence are studied by introducing the key points and key values of a fuzzy proximity ***,two basic concepts,the hierarchical structure invariance and isomorphism of fuzzy proximity relations are introduced,and some examples are given to illustrate that the hierarchical structure of a fuzzy proximity relation is variant under three typical triangular ***,the hierarchical structure invariance theorem of fuzzy proximity relation under a mapping or transformation is ***,for a given fuzzy proximity relation,a mathematical model for obtaining the optimal approximation in order to keep its hierarchical structure is established through the use of the linear combination of its minimum fuzzy proximity relation and min-transitive *** results help us understand the hierarchical structures,and provide theories and methodologies for the structural analysis and applications of proximity data.

关键词： Approximation methods Clustering algorithms Approximation algorithms Fuzzy sets Iron Measurement Valves

来源：评论

学校读者我要写书评

暂无评论

Comparing performance of formal concept analysis and closed frequent itemset mining algorithms on real data 10

Comparing performance of formal concept analysis and closed ...

引用

10th international Conference on Concept Lattices and their Applications, CLA 2013

作者： Pisková, Lenka Horváth, Tomáš University of Pavol Jozef Šafárik Košice Slovakia

In this paper, an experimental comparison of publicly available algorithms for computing intents of all formal concepts and mining frequent closed itemsets is provided. Experiments are performed on real data sets from UCI Machine Learning Repository and FIMI Repository. Results of experiments are discussed at the end of the paper. © paper author(s), 2013.

关键词： Formal concept analysis

来源：评论

学校读者我要写书评

暂无评论

From triadic FCA to triclustering: Experimental comparison of some triclustering algorithms 10

From triadic FCA to triclustering: Experimental comparison o...

引用

10th international Conference on Concept Lattices and their Applications, CLA 2013

作者： Gnatyshak, Dmitry V. Ignatov, Dmitry I. Kuznetsov, Sergei O. National Research University Higher School of Economics Russia

In this paper we show the results of the experimental comparison of five triclustering algorithms on real-world and synthetic data wrt. resource efficiency and 4 quality measures. One of the algorithms, the OAC-triclustering based on prime operators, is presented first time in this paper. Interpretation of results for real-world datasets is provided. © paper author(s), 2013.

关键词： data mining

来源：评论

学校读者我要写书评

暂无评论

Applying user-guided, dynamic FCA to navigational searches for Earth science data and documentation 10

Applying user-guided, dynamic FCA to navigational searches f...

引用

10th international Conference on Concept Lattices and their Applications, CLA 2013

作者： Barkstrom, Bruce R. 15 Josie Ln AshevilleNC28804 United States

this paper describes data structures and algorithms that allow disciplinary taxonomic experts to embed Formal Contexts within a graph of Archive Information Packages (AIP's). the AIP's are standardized objects that provide access to the Inventoried Objects (IO's) in an archive. For an archive containing Earth science data, IO's may be physical specimens or numerical data files. they are not just textual files that provide a corpora of keywork phrases. the graph serves as a Table of Contents for the archive's collection. A data user familiar with the discipline's taxonomy having a recognizable search target can navigate through the graph to identify and access the archive's IO's. © paper author(s), 2013.

关键词： Earth sciences

来源：评论

学校读者我要写书评

暂无评论

Improving industrial collaboration with linked data and OWL 10

Improving industrial collaboration with linked data and OWL

引用

10th international workshop on OWL: Experiences and Directions, OWLED 2013 - Co-located with 10th Extended Semantic Web Conference, ESWC 2013

作者： Hladik, Jan Christl, Conny Graube, Markus Haferkorn, Frank Pfeffer, Johannes Urbas, Leon Willfort, Reinhard SAP Research Dresden Germany Institute of Automation TU Dresden Germany RST Industrie Automation GmbH Germany Innovation Service Network Germany Dresscode 21 GmbH Germany

We present a product-centric collaboration platform comprising partner companies and their customers. By employing the Linked data principles it enables them to easily publish and retrieve information about products and to include user-generated content as well as publicly available information from the Linked Open data web. Information about products is modelled as OWL ontologies, which makes it more useful and easier to understand for application developers. Self-explanatory data structures also lower the threshold for new partners interested in joining the network and contributing their products. the versatility of this approach is illustrated by two application scenarios.

关键词： Linked data

来源：评论

学校读者我要写书评

暂无评论

algorithms and Models for the Web Graph - 10th international workshop, WAW 2013, Proceedings

Algorithms and Models for the Web Graph - 10th International...

引用

10th international workshop on algorithms and Models for the Web Graph, WAW 2013

ISBN: (纸本)9783319035352

the proceedings contain 17 papers. the topics discussed include: asymmetric distribution of nodes in the spatial preferred attachment model;a spatial preferential attachment model with local clustering;a local clustering algorithm for connection graphs;on the power of adversarial infections in networks;on the choice of kernel and labeled data in semi-supervised learning methods;a nearly-sublinear method for approximating a column of the matrix exponential for matrices from large, sparse networks;evolution of the media web;random intersection graph process;alpha current flow betweenness centrality;tree nash equilibria in the network creation game;fast low-cost estimation of network properties using random walks;fast algorithms for the maximum clique problem on massive sparse graphs;a faster algorithm to update betweenness centrality after node alteration;and generalized preferential attachment: tunable power-law degree distribution and clustering coefficient.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共50页 << < 20 21 22 23 24 25 26 27 28 29 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：