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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

998 篇 会议
68 册 图书
10 篇 期刊文献

馆藏范围

1,076 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

697 篇 工学
- 568 篇 计算机科学与技术...
- 497 篇 软件工程
- 147 篇 控制科学与工程
- 132 篇 信息与通信工程
- 89 篇 电气工程
- 70 篇 机械工程
- 59 篇 动力工程及工程热...
- 51 篇 生物工程
- 48 篇 交通运输工程
- 44 篇 电子科学与技术（可...
- 37 篇 安全科学与工程
- 27 篇 光学工程
- 25 篇 生物医学工程（可授...
- 23 篇 仪器科学与技术
- 22 篇 化学工程与技术
- 19 篇 材料科学与工程（可...
- 17 篇 建筑学
- 17 篇 土木工程
393 篇 理学
- 299 篇 数学
- 59 篇 生物学
- 54 篇 系统科学
- 48 篇 物理学
- 39 篇 统计学（可授理学、...
- 28 篇 化学
195 篇 管理学
- 148 篇 管理科学与工程(可...
- 77 篇 工商管理
- 70 篇 图书情报与档案管...
40 篇 教育学
- 40 篇 教育学
37 篇 经济学
- 37 篇 应用经济学
23 篇 法学
- 20 篇 社会学
16 篇 医学
13 篇 农学
2 篇 文学
2 篇 军事学

主题

66 篇 software enginee...
65 篇 linear programmi...
53 篇 programming
40 篇 software enginee...
33 篇 artificial intel...
29 篇 optimization
26 篇 dynamic programm...
25 篇 programming tech...
24 篇 costs
22 篇 computational mo...
19 篇 programming lang...
18 篇 programming prof...
18 篇 integer programm...
18 篇 logics and meani...
17 篇 training
16 篇 computer communi...
16 篇 students
14 篇 machine learning
14 篇 engineering educ...
13 篇 computer science

机构

4 篇 department of sy...
4 篇 zhejiang univers...
4 篇 school of comput...
4 篇 state grid sichu...
4 篇 school of inform...
4 篇 school of mechan...
3 篇 school of automa...
3 篇 school of inform...
3 篇 school of comput...
3 篇 cent res inst el...
3 篇 eindhoven univer...
3 篇 department of co...
3 篇 college of infor...
3 篇 school of electr...
3 篇 school of comput...
3 篇 school of inform...
3 篇 polytechnic inst...
3 篇 department of co...
3 篇 school of inform...
3 篇 school of inform...

作者

4 篇 hideki katagiri
4 篇 sanxing cao
4 篇 yin guodong
3 篇 zhang tao
3 篇 laksono pringgo ...
3 篇 chen hao
3 篇 kosuke kato
3 篇 rosyidi cucuk nu...
3 篇 miller j
3 篇 takano hirotaka
3 篇 asano hiroshi
3 篇 liu wei
3 篇 zhang chen
3 篇 shen tong
3 篇 smith m
3 篇 el-kenawy el-say...
3 篇 yang liu
3 篇 martin a
3 篇 abotaleb mostafa
3 篇 mugridge r

语言

1,033 篇 英文
41 篇 其他
6 篇 中文
1 篇 西班牙文

检索条件"任意字段=6th International Conference on the Art, Science, and Engineering of Programming, Programming 2022"

共 1076 条记录，以下是761-770 订阅

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

详细简洁

排序：

Proxy signature scheme based on isomorphisms of polynomials

Proxy signature scheme based on isomorphisms of polynomials

引用

6th international conference on Network and System Security, NSS 2012

作者： Tang, Shaohua Xu, Lingling School of Computer Science and Engineering South China University of Technology Guangzhou China

ISBN: (纸本)9783642346002

the proxy signatures are important cryptosystems that are widely adopted in different applications. Most of the proxy signature schemes so far are based on the hardness of integer factoring, discrete logarithm, and/or elliptic curve. However, Shor proved that the emerging quantum computers can solve the problem of prime factorization and discrete logarithm in polynomial-time, which threatens the security of current RSA, ElGamal, ECC, and the proxy signature schemes based on these problems. We propose a novel proxy signature scheme based on the problem of Isomorphism of Polynomials (IP) which belongs to a major category of Multivariate Public Key Cryptography (MPKC). through security discussion, our scheme can reach the same security level as the signature scheme based on IP problem. the most attractive advantage of our scheme should be its feature to potentially resist the future quantum computing attacks. Our scheme also owns some important properties of proxy signature schemes, such as strong unforgeability, strong identifiability, strong undeniability, secret-key's dependence, distinguishability, etc. the scheme is implemented in C/C++ programming language, and the performance shows that the scheme is efficient. the parameters we choose can let security level of the scheme up to 2 86.59. © 2012 Springer-Verlag.

关键词： Quantum computers

来源：评论

学校读者我要写书评

暂无评论

Query rewriting under ontology contraction 6th

Query rewriting under ontology contraction

引用

6th international conference on Web Reasoning and Rule Systems, RR 2012

作者： Tsalapati, Eleni Stoilos, Giorgos Stamou, Giorgos Koletsos, George School of Electrical and Computer Engineering National Technical University of Athens Zographou Campus Athens15780 Greece

ISBN: (纸本)9783642332029

Conjunctive query (CQ) answering is a key reasoning service for ontology-based data access. One of the most prominent approaches to conjunctive query answering is query rewriting where a wide variety of systems has been proposed the last years. All of them accept as input a fixed CQ q and ontology O and produce a rewriting for q,O. However, in many real world applications ontologies are very often dynamic—that is, new axioms can be added or existing ones removed frequently. In this paper we study the problem of computing a rewriting for a CQ over an ontology that has been contracted (i.e., some of its axioms have been removed) given a rewriting for the input CQ and ontology. Our goal is to compute a rewriting directly from the input rewriting and avoid computing one from scratch. We study the problem theoretically and provide sufficient conditions under which this process is possible. Moreover, we present a practical algorithm which we implemented and evaluated against other state-of-the-art systems obtaining encouraging results. Finally, axiom removal can also be relevant to ontology design. For each test ontology we study how much the removal of an axiom affects the size of the rewriting and the performance of systems. If the removal of a single axiom causes a significant decrease either in the size or in the computation time then this part of the ontology can be re-modelled. © Springer-Verlag Berlin Heidelberg 2012.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Analysis on battery storage utilization in decentralized solar energy networks based on a mathematical programming model

Analysis on battery storage utilization in decentralized sol...

引用

international Symposium on Soft Computing and Intelligent Systems (SCIS)

作者： Shinya Kato Hide Nishihara Ittetsu Taniguchi Masahiro Fukui Kazutoshi Sakakibara College of Science and Engineering Ritsumeikan University Shiga Japan College of Information Science and Engineering Ritsumeikan University Shiga Japan

We study a decentralized solar energy network composed of multiple clusters, which correspond to households equipped with PV units, rechargeable batteries, electrical appliances, and an electric power router. Decentralized solar energy network is a new grid systems toward independence from existing power grid, and solar energy is main energy source for the decentralized energy network. Each cluster has a battery storage to use the renewable energy effectively, where battery degradation cannot be overlooked for long-term, persistent operation. this paper proposes an optimal power distribution minimizing the battery degradation on decentralized energy network. Because the battery degradation is unavoidable phenomenon for the battery utilization, we solve the optimal power distribution to keep the degradation minimum. the proposed approach limits the charge/discharge speeds and cycles at mixed integer programming formulation and achieves the optimal utilization of the renewable energy with less charge/discharge cycles. Experimental results using the real measured data of the power generation and consumption show the connection between the parameters for the battery degradation and the system performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An interactive approach to multiobjective tour route planning problems

An interactive approach to multiobjective tour route plannin...

引用

international Symposium on Soft Computing and Intelligent Systems (SCIS)

作者： Hideki Katagiri Takeshi Uno Kosuke Kato Hiroshi Tsuda Hiroe Tsubaki Graduate School of Engineering Hiroshima University HigashiHiroshima Hiroshima Japan Institute of Socio-Arts and Sciences University of Tokushima Tokushima Japan Faculty of Applied Information Science Hiroshima Institute of Technology Hiroshima Japan Faculty of Science and Engineering Department of Mathematical Sciences Doshisha University Kyotanabe Japan Institute of Statistical Mathematics Tachikawa Tokyo Japan

this paper considers a new multiobjective tour route planning problem in order to maximize the sum of values of tourist spots to be visited and to minimize the tiredness caused by moving from place to place. the planning is formulated as a multiobjective 0-1 programming problem, and an interactive algorithm is provided to find a satisficing solution of tourists which takes account of their preferences.

关键词：

来源：评论

学校读者我要写书评

暂无评论

DecisionAI:A Framework to Automate the Decision Making Process

DecisionAI:A Framework to Automate the Decision Making Proce...

引用

2012 IEEE 6th international conference on Information and Automation for Sustainability（ICIAFS2012）

作者： K.T.Buddhika D.P.Jayamanne P.P.WIjegunawardana R.C.Gunasekera U.Kohomban Department of Computer Science and Engineering University of Moratuwa MoratuwaSri Lanka CodeGen International pvt.Ltd Sri Lanka

Accurate decision making is the key to make a business *** support systems are used to make the decision making process accurate and *** though there are many business specific decision support systems they cannot be used for general purpose decision making or outside their *** provides a framework which can be used in any decision making domain with similar decision *** provides a good solution to many decision making problems in the industry allowing detailed analysis of data with the integrated intelligence.

关键词： Neural networks Optimization linear programming decision framework

来源：评论

学校读者我要写书评

暂无评论

Universally composable oblivious transfer from lossy encryption and the McEliece assumptions

Universally composable oblivious transfer from lossy encrypt...

引用

6th international conference on Information theoretic Security, ICITS 2012

作者： David, Bernardo Machado Nascimento, Anderson C. A. Müller-Quade, Jörn Department of Electrical Engineering University of Brasilia Brazil Institute of Cryptography and Security Faculty of Informatics Karlsruhe Institute of Technology Germany

ISBN: (纸本)9783642322839

Oblivious transfer (OT) is a primitive of great importance in two-party and multi-party computation. We introduce a general construction of universally composable (UC) oblivious transfer protocols based on lossy cryptosystems in the common reference string (CRS) model, yielding protocols under several assumptions. In order to achieve this, we show that for most known lossy encryption constructions it is possible to distinguish between lossy and injective public keys given the corresponding secret key, similarly to dual-mode encryption in messy mode. Furthermore, we adapt the techniques of our general construction to obtain the first UC secure OT protocol based on the McEliece assumptions, which are coding theory based assumptions that until now have resisted quantum attacks, thus introducing the first UC secure OT protocol based on coding assumptions. However, differently from previous results based on dual-mode encryption, our scheme does not require a trapdoor for opening lossy ciphertexts, relying instead on CRS manipulation and cut-and-choose techniques to construct the simulators. In both constructions we circumvent the need for universally composable string commitment schemes, which are required by previous black-box compilers. © 2012 Springer-Verlag.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

A stackelberg location on a network with fuzzy random demand quantities using necessity measure

A stackelberg location on a network with fuzzy random demand...

引用

international Symposium on Soft Computing and Intelligent Systems (SCIS)

作者： Takeshi Uno Hideki Katagiri Kosuke Kato Institute of Socio-Arts and Sciences University of Tokushima Tokushima Japan Graduate School of Engineering Hiroshima University Hiroshima Japan Faculty of Applied Information Science Hiroshima Institute of Technology Hiroshima Japan

this paper focuses on a competitive facility location problem between leader and follower on a network with demands whose weights are given uncertainly and vaguely. By representing them as fuzzy random variables, the optimal location problem can be formulated as a fuzzy random programming problem for finding Stackelberg equilibrium. For solving the problem, it is reformulated as the problem to find the optimal solutions maximizing a degree of necessity under some chance constraint for the leader. theorems for its complexity are shown based upon the characteristics of the facility location.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Estimation of Distribution Algorithm for green resource allocation in cognitive radio systems

Estimation of Distribution Algorithm for green resource allo...

引用

international conference on Signal Processing and Communication Systems, ICSPCS

作者： Muhammad Naeem Saeed Ashrafinia Daniel Lee Department of Electrical and Computer Engineering Ryerson University Toronto ONT Canada School of Engineering Science Simon Fraser University Burnaby BC Canada

ISBN: (纸本)9781467323925

In this paper, we formulate a resource allocation optimization problem for a cooperative relay-assisted cognitive radio system, comprising a single source node, multiple relays and multiple destinations. Our formulation takes into account the effects of the resource allocation on CO 2 emission, and we refer to it as a green resource allocation problem. the green resource allocation problem is formulated as a non-linear multi-objective optimization problem. We modify the objective function by applying the weighted sum method, which results in a non-convex mixed integer non-linear programming problem. We propose a hybrid evolutionary scheme that utilizes an enhanced version of Estimation of Distributions Algorithm to solve this optimization problem. Simulation results demonstrate the efficiency of our evolutionary algorithm approach in comparison to other schemes such as GA and EDA.

关键词： Estimation optimization version Resource utilization Allocation Algorithm Radio systems management of resources Cognitive radio green Non-Convex

来源：评论

学校读者我要写书评

暂无评论

Distance measure adaptation based on local feature weighting

Distance measure adaptation based on local feature weighting

引用

international IEEE conference on Intelligent Systems, IS

作者： Mohammad Reza Moosavi Zahra Yeganehfard Alireza Kazemi Mohammad Hadi Sadreddini Mansoor Zolghadri Jahromi Department of Computer Science and Engineering Shiraz University Shiraz Iran

the performance of Nearest Neighbor (NN) classifier is highly dependent on the distance function used to find the NN of an input test pattern. Many of the proposed algorithms try to optimize the accuracy of the NN rule using a weighted distance function. Here, in the proposed method the distance function is defined in a parametric form to incorporate the local relevancy of the features in the decision boundary of the prototype. the local weight of each feature is determined according to the amount of information it provides about discrimination of different classes for each prototype. In this method a novel learning algorithm tunes the weight vector of the prototypes. the learning method uses an entropy based objective function that is optimized by a gradient-descent technique. A new entropy measure is proposed in which the decision boundary of a prototype is a fuzzy region. We show that our scheme has comparable or better performance than some recent methods proposed in the literature.

关键词： Prototypes Entropy Linear programming Accuracy Vectors Training Optimization

来源：评论

学校读者我要写书评

暂无评论

Metabolite biomarker discovery for metabolic diseases by flux analysis

Metabolite biomarker discovery for metabolic diseases by flu...

引用

IEEE international conference on Systems Biology

作者： Limin Li Hao Jiang Wai-Ki Ching Vassilis S. Vassiliadis Institute of Information and System Science Xi'an Jiaotong University Xi'an China Advanced Modeling and Applied Computing Laboratory Department of Mathematics University of Hong Kong Hong Kong China Department of Chemical Engineering and Biotechnology University of Cambridge Cambridge UK

Metabolites can serve as biomarkers and their identification has significant importance in the study of biochemical reaction and signalling networks. Incorporating metabolic and gene expression data to reveal biochemical networks is a considerable challenge, which attracts a lot of attention in recent research. In this paper, we propose a promising approach to identify metabolic biomarkers through integrating available biomedical data and disease-specific gene expression data. A Linear programming (LP) based method is then utilized to determine flux variability intervals, therefore enabling the analysis of significant metabolic reactions. A statistical approach is also presented to uncover these metabolites. the identified metabolites are then verified by comparing with the results in the existing literature. the proposed approach here can also be applied to the discovery of potential novel biomarkers.

关键词： Biochemistry Diabetes Humans Obesity Gene expression Bioinformatics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共108页 << < 73 74 75 76 77 78 79 80 81 82 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：