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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,767 篇 期刊文献
1,316 篇 会议
20 册 图书

馆藏范围

3,103 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,123 篇 工学
- 1,530 篇 计算机科学与技术...
- 1,200 篇 软件工程
- 461 篇 信息与通信工程
- 295 篇 生物工程
- 280 篇 电气工程
- 262 篇 控制科学与工程
- 240 篇 光学工程
- 220 篇 电子科学与技术（可...
- 214 篇 生物医学工程（可授...
- 111 篇 机械工程
- 104 篇 化学工程与技术
- 100 篇 仪器科学与技术
- 70 篇 材料科学与工程（可...
- 66 篇 网络空间安全
- 58 篇 动力工程及工程热...
1,239 篇 理学
- 523 篇 数学
- 485 篇 物理学
- 324 篇 生物学
- 172 篇 统计学（可授理学、...
- 159 篇 化学
- 87 篇 系统科学
- 56 篇 地球物理学
499 篇 管理学
- 291 篇 管理科学与工程(可...
- 219 篇 图书情报与档案管...
- 118 篇 工商管理
202 篇 医学
- 174 篇 临床医学
- 144 篇 基础医学(可授医学...
- 85 篇 药学(可授医学、理...
- 75 篇 公共卫生与预防医...
86 篇 法学
- 65 篇 社会学
42 篇 农学
39 篇 经济学
31 篇 教育学
10 篇 文学
10 篇 艺术学
3 篇 军事学

主题

82 篇 deep learning
77 篇 semantics
77 篇 feature extracti...
68 篇 machine learning
67 篇 computational mo...
58 篇 training
42 篇 federated learni...
42 篇 accuracy
39 篇 data models
38 篇 deep neural netw...
36 篇 graph neural net...
35 篇 artificial intel...
33 篇 computer science
32 篇 image segmentati...
31 篇 data mining
30 篇 convolution
30 篇 servers
30 篇 predictive model...
29 篇 optimization
28 篇 cloud computing

机构

103 篇 national enginee...
80 篇 school of comput...
51 篇 school of comput...
44 篇 infn sezione di ...
44 篇 north-west unive...
44 篇 université de st...
43 篇 institut univers...
43 篇 tno technical sc...
42 篇 university of ch...
41 篇 department of ph...
41 篇 faculty of scien...
41 篇 departamento de ...
41 篇 department for p...
41 篇 department of ph...
41 篇 yerevan physics ...
41 篇 national centre ...
40 篇 kirchhoff-instit...
40 篇 graduate school ...
40 篇 institute of phy...
39 篇 dipartimento di ...

作者

81 篇 hai jin
77 篇 jin hai
44 篇 chen a.
44 篇 benoit d.m.
44 篇 ferrara g.
44 篇 ardid m.
44 篇 calvo d.
44 篇 eddymaoui a.
41 篇 gagliardini s.
39 篇 gal t.
39 篇 bozza c.
39 篇 díaz a.f.
39 篇 boumaaza j.
38 篇 coleiro a.
38 篇 gozzini s.r.
38 篇 dallier r.
38 篇 benhassi m.
38 篇 boettcher m.
37 篇 enzenhöfer a.
37 篇 celli s.

语言

2,750 篇 英文
317 篇 其他
41 篇 中文
1 篇 日文

检索条件"机构=School of Computer Science and Technology and Hopcroft Center on Computing Science"

共 3103 条记录，以下是2801-2810 订阅

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

详细简洁

排序：

The Adaptive Multicast Data Origin Authentication Protocol

The Adaptive Multicast Data Origin Authentication Protocol

引用

第二届中国互联网学术年会

作者： Liehuang Zhu Hao Yang Zhenghe Yang Beijing Engineering Research Center of Massive Language Information Processing and Cloud Computing Application School of Computer Science and Technology Beijing Institute of Technology China Beijing

Most multicast data origin authentication schemes work under the fixed parameters without taking the problem of changeable network environment into ***,the network conditions will obviously influence the efficiency of a protocol such as the time delay and the overhead considering the packet loss rate or something *** adjusting the parameters adaptively to achieve the ideal state with the dynamic network is *** achieve a high authentication rate and adapt to the changeable and unstable network environment,we proposed a multicast data origin authentication protocol which is adaptive depending on the packet error rates as well as the time delay,and is robust against the packet loss and *** model can estimate a more appropriate packet error rate and make the time delay lower according to the feedback values got from the receivers using the Markov chain so that it can be ***’s more,the IDA (Information Dispersal Algorithm) and the Merkle HASH tree are also combined to resist the packet loss or *** strategy is especially efficient in terms of not only the adaptation of dynamic network but also the shortcut of overhead and delay,because the reliable intelligent algorithm is included in and only the necessary parts are involved in to authenticate.

关键词： Authentication adaptive estimate packet error rate time delay Markov chain

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Replication Mechanism to Reduce Response-Time of I/O Operations in High Performance computing Clusters

A Dynamic Replication Mechanism to Reduce Response-Time of I...

引用

IEEE International Conference on Social computing (SocialCom)

作者： Ehsan Mousavi Khaneghah Seyedeh Leili Mirtaheri Lucio Grandinetti Amir Saman Memaripour Mohsen Sharifi Center of High Performance Computing for Parallel and Distributed Processing University of Calabria Rende Italy School of Computer Engineering Iran University of Science and Technology Tehran Iran

ISBN: (纸本)9781479915194

Extraordinary large datasets of high performance computing applications require improvement in existing storage and retrieval mechanisms. Moreover, enlargement of the gap between data processing and I/O operations' throughput will bound the system performance to storage and retrieval operations and remarkably reduce the overall performance of high performance computing clusters. File replication is a way to improve the performance of I/O operations and increase network utilization by storing several copies of every file. Furthermore, this will lead to a more reliable and fault-tolerant storage cluster. In order to improve the response time of I/O operations, we have proposed a mechanism that estimates the required number of replicas for each file based on its popularity. Besides that, the remaining space of storage cluster is considered in the evaluation of replication factors and the number of replicas is adapted to the storage state. We have implemented the proposed mechanism using HDFS and evaluated it using MapReduce framework. Evaluation results prove its capability to improve the response time of read operations and increase network utilization. Consequently, this mechanism reduces the overall response time of read operations by considering files' popularity in replication process and adapts the replication factor to the cluster state.

关键词： Time factors High performance computing Bandwidth Reliability Throughput System performance History

来源：评论

学校读者我要写书评

暂无评论

A mathematical model for empowerment of Beowulf clusters for exascale computing

A mathematical model for empowerment of Beowulf clusters for...

引用

International Conference on High Performance computing & Simulation (HPCS)

作者： Seyedeh Leili Mirtaheri Ehsan Mousavi Khaneghah Lucio Grandinetti Mohsen Sharifi Center of High Performance Computing for Parallel and Distributed Processing University of Calabria Rende Italy School of Computer Engineering Iran University of Science and Technology Tehran Iran

High-performance computing (HPC) clusters are currently faced with two major challenges - namely, the dynamic nature of new generation of applications and the heterogeneity of platforms - if they are going to be useful for exascale computing. Processes running these applications may well demand unpredictable requirements and changes to system configuration and capabilities at runtime, thereby requiring fast system response without sacrificing the transparency and integrity of the reconfigured empowered system that is running on a heterogeneous platform. While a challenge in and of itself, platform heterogeneity is both useful and instrumental in the handling of unpredictable requests. The realization of such a dynamically reconfigurable and heterogeneous HPC cluster system for exascale computing requires a model to guide running processes to determine if they need empowerment of the current cluster, and if yes, by how much. To show the feasibility of empowerment of traditional HPC clusters for exascale computing, we have selected Beowulf as a noble candidate cluster and present a mathematical model for the empowerment of Beowulf clusters for exascale computing (EBEC). We have developed the model in line with Beowulf's cluster approach and by using vector space algebra. In contrast to traditional hardware-oriented approaches to improvise the performance of clusters, we use a software approach to the development of the proposed model by emphasizing processes, which act as the creators of the cluster and thus should decide on system (re)configuration, as the principal building blocks of the system. We have also adopted a new approach to heterogeneity by considering heterogeneity at different levels including hardware, system software, application software, and system functionality. In addition to support for heterogeneity and dynamic reconfiguration, the proposed model includes support for scalability that is crucial to exascale computing too.

关键词： Vectors Mathematical model Hardware Runtime computers Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Architecture for resource controllable NVE to meet service providers' dynamic QoS demands

Architecture for resource controllable NVE to meet service p...

引用

International Conference on the Network of the Future (NOF)

作者： Masayoshi Shimamura Hiroaki Yamanaka Yoshiyuki Uratani Akira Nagata Shuji Ishii Katsuyoshi Iida Eiji Kawai Masato Tsuru Global Scientific Information and Computing Center Tokyo Institute of Technology Network Testbed Research and Development Promotion Center National Institute of Information and Communications Technology Graduate School of Computer Science and Systems Engineering

To accommodate a wide variety of application services, the network virtualization environment (NVE) has received much attention. In an NVE, infrastructure providers (InPs) provide service providers (SPs) with virtual networks (VNs) using the InPs' substrate resources for the SPs' application services. Service providers have flexible requirements of topology, quality of service (QoS), and their dynamic changes on VNs. To meet all these requirements, traditional approaches based on performance guarantee relying only on InPs are inefficient and sometimes infeasible because they result in significant operational cost. We propose an architecture in which SPs can select appropriate resources from available resources and dynamically use the allocated resources depending on their application characteristics and user situations to meet their demands. In the proposed architecture, SPs can improve VN performance through resource control, and InPs are not required to have any performance guaranteed networks. Therefore, the proposed architecture can balance QoS and resource efficiency. We also present the basic design of the proposed architecture and show use cases and a prototype implementation using OpenFlow technologies.

关键词： Indium phosphide Servers Quality of service Topology Bandwidth Prototypes Control systems

来源：评论

学校读者我要写书评

暂无评论

Efficient public key cryptosystem resilient to key leakage chosen ciphertext attacks 1

引用

Cryptographers' Track at the RSA Conference 2013, CT-RSA 2013

作者： Liu, Shengli Weng, Jian Zhao, Yunlei Dept. of Computer Science and Engineering Shanghai Jiao Tong University Shanghai 200240 China Department of Computer Science Emergency Technology Research Center of Risk Evaluation and Prewarning on Public Network Security Jinan University China Software School Fudan University Shanghai 201203 China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing 100093 China Shanghai Key Laboratory of Scalable Computing and Systems Shanghai China

ISBN: (数字)9783642360954

ISBN: (纸本)9783642360947

Leakage-resilient public key encryption (PKE) schemes are designed to resist "memory attacks", i.e., the adversary recovers the cryptographic key in the memory adaptively, but subject to constraint that the total amount of leaked information about the key is bounded by some parameter λ. Among all the IND-CCA2 leakage-resilient PKE proposals, the leakage-resilient version of the Cramer-Shoup cryptosystem (CS-PKE), referred to as the KL-CS-PKE scheme proposed by Naor and Segev in Crypto09, is the most practical one. But, the key leakage parameter λ and plaintext length m of KL-CS-PKE are subject to λ + m ≤ log q - ω(log κ), where κ is security parameter and q is the prime order of the group on which the scheme is based. Such a dependence between λ and m is undesirable. For example, when λ (resp., m) approaches to log q, m (resp., λ) approaches to 0. In this paper, we designed a new variant of CS-PKE that is resilient to key leakage chosen ciphertext attacks. Our proposal is λ ≤ log q - ω(log κ) leakage-resilient, and the leakage parameter λ is independent of the plaintext space that has the constant size q (exactly the same as that in CS-PKE). The performance of our proposal is almost as efficient as the original CS-PKE. As far as we know, this is the first leakage-resilient CS-type cryptosystem whose plaintext length is independent of the key leakage parameter, and is also the most efficient IND-CCA2 PKE scheme resilient to up to log q - ω(log κ) leakage. © 2013 Springer-Verlag.

关键词： Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

Undo the codebook bias by linear transformation for visual applications 13

Undo the codebook bias by linear transformation for visual a...

引用

21st ACM International Conference on Multimedia, MM 2013

作者： Zhang, Chunjie Zhang, Yifan Wang, Shuhui Pang, Junbiao Liang, Chao Huang, Qingming Tian, Qi School of Computer and Control Engineering University of Chinese Academy of Sciences 100049 Beijing China National Laboratory of Pattern Recognition Institute of Automation Chinese Academy of Sciences Beijing China Key Lab of Intell. Info. Process Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China College of Computer Science and Technology Beijing University of Technology 100124 Beijing China School of Computer National Engineering Research Center for Multimedia Software Wuhan University 430072 Wuhan China Department of Computer Sciences University of Texas at San Antonio San Antonio TX 78249 United States

ISBN: (纸本)9781450324045

The bag of visual words model (BoW) and its variants have demonstrate their effectiveness for visual applications and have been widely used by researchers. The BoW model first extracts local features and generates the corresponding codebook, the elements of a codebook are viewed as visual words. The local features within each image are then encoded to get the final histogram representation. However, the codebook is dataset dependent and has to be generated for each image dataset. This costs a lot of computational time and weakens the generalization power of the BoW model. To solve these problems, in this paper, we propose to undo the dataset bias by codebook linear transformation. To represent every points within the local feature space using Euclidean distance, the number of bases should be no less than the space dimensions. Hence, each codebook can be viewed as a linear transformation of these bases. In this way, we can transform the pre-learned codebooks for a new dataset. However, not all of the visual words are equally important for the new dataset, it would be more effective if we can make some selection using sparsity constraints and choose the most discriminative visual words for transformation. We propose an alternative optimization algorithm to jointly search for the optimal linear transformation matrixes and the encoding parameters. Image classification experimental results on several image datasets show the effectiveness of the proposed method. Copyright © 2013 ACM.

关键词： Linear transformations

来源：评论

学校读者我要写书评

暂无评论

Pre-Ictal phase detection algorithm based on one dimensional EEG signals and two dimensional formed images analysis

Pre-Ictal phase detection algorithm based on one dimensional...

引用

2013 11th International Conference on High Performance computing and Simulation, HPCS 2013

作者： Zeljkovic, Vesna Valev, Ventzeslav Tameze, Claude Bojic, Milena School of Engineering and Computing Sciences New York Institute of Technology Nanjing Campus United States Institute of Mathematics and Informatics Bulgarian Academy of Sciences Sofia Bulgaria Department of Mathematics and Computer Science Lincoln University PA United States University Clinic for Internal Diseases Clinical Hospital Center 'Dr Dragisa Misovic - Dedinje Belgrade Serbia

ISBN: (纸本)9781479908363

Over 50 million persons worldwide are affected by epilepsy. It can affect equally young babies as well as old people. Epilepsy is a brain disorder characterized by the neurobiological, cognitive, psychological and social consequences. It is known for sudden, unexpected transitions from normal to pathological behavioral states called epileptic seizures. Epilepsy poses a significant burden to society due to associated healthcare cost to treat and control the unpredictable and spontaneous occurrence of seizures. There is a need for a quick screening process that could help neurologists diagnose and determine the patient's treatment. Electroencephalogram has been traditionally used to diagnose patients by evaluating those brain functions that might correspond to epilepsy. This research focuses on developing new classification technique and the prediction of pre-ictal states that announce epileptic seizures, from the online EEG data analysis. The idea is to place electrodes on critical regions on the patient's head that would wirelessly communicate with the EEG recorder and the unit that performs online automated pre-ictal state detection based on obtained EEG signal. The patient should get timely alert about the possible seizure attack so that she/he can stop with its activities and take safety precautions. © 2013 IEEE.

关键词： Image processing

来源：评论

学校读者我要写书评

暂无评论

ONSTR: The ontology for newborn screening follow-up and translational research 4

ONSTR: The ontology for newborn screening follow-up and tran...

引用

4th International Conference on Biomedical Ontology, ICBO 2013

作者： Nikolic, Snezana Shankar, Prabhu Arabandi, Sivaram Dhawan, Akshaye Sunderraman, Rajshekhar Navathe, Sham Malhotra, Kunal Singh, Rani H. Deparment of Human Genetics Emory University School of Medicine AtlantaGA United States Department of Pediatrics Emory University School of Medicine AtlantaGA United States Emory Children's Center Emory University Children's Healthcare of Atlanta AtlantaGA United States OntoPro LLC HoustonTX United States Department of Mathematics and Computer Science Ursinus College CollegevillePA United States Department of Computer Science Georgia State University AtlantaGA United States College of Computing Georgia Institute of Technology AtlantaGA United States

Translational research in the field of newborn screening system requires integration of data generated during various phases of life long treatment of patients identified and diagnosed through newborn dried blood spot screening (NDBS). In this paper, we describe the Ontology for Newborn Screening Follow-up and Translational Research (ONSTR). ONSTR is an application ontology for representing data entities, practices and knowledge in the domain of newborn screening short- and long-term follow-up of patients diagnosed with inheritable and congenital disorders. It will serve as a core of the data integration framework in the Newborn Screening Follow-up Data Integration Collaborative (NBSDC), designed to support Semantic Web tools and applications with the goal of helping clinicians involved in translational research. Here, we describe the ONSTR domain, our top-down bottom-up methodological approach to ontology modelling using phenylketonuria (PKU) as an exemplar, and some of the lessons learned. We provide an illustration of our ontological model of three important aspects of PKU: 1) the etiology, 2) the phenylalanine hydroxylase enzyme dysfunction underlying PKU and 3) the disambiguation of terms central to PKU appearing in the literature. In modelling of the mechanism of phenylalanine hydroxylase enzyme (PAH enzyme) dysfunction, we encountered limitations in using Gene Onotology (GO) process classes, in terms of their over-granularity and the lack of representations of process participants. As a solution to this problem and in order to accurately represent this process, we created a hybrid model of enzyme mediated biochemical reactions. This model of PKU and enzymatic reactions will serve as a prototype for modelling other inherited metabolic disorders (IMDs) and enzymatic processes of importance to clinical and translational research in the NBDS long-term follow-up domain. This initial work provides the ontological foundation for automated reasoning, integration and

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

DoS and DDoS in Named Data Networking

DoS and DDoS in Named Data Networking

引用

International Conference on computer Communications and Networks (ICCCN)

作者： Paolo Gasti Gene Tsudik Ersin Uzun Lixia Zhang School of Engineering and Computing Sciences New York Institute of Technology USA School of Information and Computer Sciences University of California Irvine USA Palo Alto Research Center USA Computer Science Department University of California Los Angeles USA

With the growing realization that current Internet protocols are reaching the limits of their senescence, several on-going research efforts aim to design potential next-generation Internet architectures. Although they vary in maturity and scope, in order to avoid past pitfalls, these efforts seek to treat security and privacy as fundamental requirements. Resilience to Denial-of-Service (DoS) attacks that plague today's Internet is a major issue for any new architecture and deserves full attention. In this paper, we focus on DoS in Named Data Networking (NDN) - a specific candidate for next-generation Internet architecture designs. By naming data instead of its locations, NDN transforms data into a first-class entity and makes itself an attractive and viable approach to meet the needs for many current and emerging applications. It also incorporates some basic security features that mitigate classes of attacks that are commonly seen today. However, NDN's resilience to DoS attacks has not been analyzed to-date. This paper represents a first step towards assessment and possible mitigation of DoS in NDN. After identifying and analyzing several new types of attacks, it investigates their variations, effects and counter-measures. This paper also sheds some light on the debate about relative virtues of self-certifying, as opposed to human-readable, names in the context of content-centric networking.

关键词： computer crime Internet Public key computer architecture IP networks Electronic mail Bandwidth

来源：评论

学校读者我要写书评

暂无评论

引用

28th Annual ACM Symposium on Applied computing, SAC 2013

作者： Jang, Minwoo Kook, Joongjin Ryu, Samin Lee, Kahyun Shin, Sung Kim, Ahreum Park, Youngsu Cho, Eig Hyun School of Computing Soongsil University Seoul Korea Republic of Realistic Media Platform Research Center Korea Electronics Technology Institute Seoul Korea Republic of Mobile Communication Company LG Electronics Seoul Korea Republic of Infra. Solution Development Group Samsung SDS Seoul Korea Republic of Department of Electrical Engineering and Computer Science South Dakota State University Brookings SD 57006 United States

ISBN: (纸本)9781450316569

Software birthmarks are unique and native characteristics of a binary executable program that can be used for detecting software piracy. API (Application Programming Interface) calls in an MS Windows binary executable can be used as software birthmarks when there are no source codes available to detect software similarity. However, it is inefficient to extract birthmarks from all API calls during the execution of a binary executable. In this paper, we propose an efficient scheme for comparing software similarity. To reduce the number of comparisons used in the proposed scheme, we extract only the core API calls that are explicitly used in different programs. The birthmarks used for comparing the similarity between two programs can be obtained by extracting these core API calls. Our experimental results show that this proposed birthmark scheme using core API calls is efficient for evaluating software similarity. Copyright 2013 ACM.

关键词： computer crime

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共311页 << < 277 278 279 280 281 282 283 284 285 286 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：