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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

781 篇 会议
72 篇 期刊文献
61 册 图书

馆藏范围

912 篇 电子文献
2 种 纸本馆藏

日期分布

学科分类号

504 篇 工学
- 336 篇 计算机科学与技术...
- 199 篇 软件工程
- 95 篇 控制科学与工程
- 88 篇 电气工程
- 71 篇 信息与通信工程
- 40 篇 机械工程
- 29 篇 生物医学工程（可授...
- 27 篇 电子科学与技术（可...
- 27 篇 生物工程
- 25 篇 材料科学与工程（可...
- 24 篇 力学（可授工学、理...
- 24 篇 建筑学
- 21 篇 仪器科学与技术
- 20 篇 光学工程
- 20 篇 土木工程
- 19 篇 化学工程与技术
- 17 篇 航空宇航科学与技...
- 15 篇 交通运输工程
383 篇 理学
- 310 篇 数学
- 66 篇 物理学
- 62 篇 系统科学
- 48 篇 统计学（可授理学、...
- 36 篇 生物学
- 22 篇 化学
93 篇 管理学
- 61 篇 管理科学与工程(可...
- 31 篇 图书情报与档案管...
- 28 篇 工商管理
27 篇 医学
- 24 篇 临床医学
- 17 篇 基础医学(可授医学...
15 篇 法学
- 13 篇 社会学
11 篇 农学
10 篇 经济学
10 篇 教育学
4 篇 军事学
2 篇 文学
1 篇 艺术学

主题

74 篇 discrete wavelet...
49 篇 discrete mathema...
43 篇 discrete cosine ...
42 篇 algorithm analys...
32 篇 discrete fourier...
27 篇 signal processin...
25 篇 discrete event s...
25 篇 feature extracti...
19 篇 algorithms
18 篇 signal processin...
18 篇 genetic algorith...
18 篇 data structures
16 篇 computer communi...
16 篇 image coding
16 篇 numeric computin...
16 篇 watermarking
15 篇 artificial intel...
13 篇 computer graphic...
12 篇 robustness
11 篇 mathematical log...

机构

8 篇 carleton univ sc...
3 篇 università di ca...
3 篇 infn sezione di ...
3 篇 north-west unive...
3 篇 infn sezione di ...
3 篇 indian stat inst...
3 篇 in2p3 lpc campus...
3 篇 institut univers...
3 篇 national centre ...
3 篇 tno technical sc...
3 篇 université de st...
3 篇 simon fraser uni...
3 篇 faculty of compu...
3 篇 nikhef national ...
3 篇 laboratoire univ...
3 篇 university moham...
3 篇 university würzb...
3 篇 université de ha...
3 篇 university of jo...
3 篇 university moham...

作者

8 篇 azar ahmad taher
4 篇 catalani f.
4 篇 de souza v.
4 篇 chudoba j.
4 篇 maheshwari anil
4 篇 ammar hossam has...
4 篇 weili wu
3 篇 chen a.
3 篇 benoit d.m.
3 篇 ferrara g.
3 篇 ardid m.
3 篇 calvo d.
3 篇 gagliardini s.
3 篇 eddymaoui a.
3 篇 kulikovskiy v.
3 篇 labalme m.
3 篇 gal t.
3 篇 bozza c.
3 篇 khatun a.
3 篇 kalekin o.

语言

880 篇 英文
32 篇 其他
3 篇 中文

检索条件"任意字段=6th International Conference on Algorithms and Discrete Applied Mathematics"

共 914 条记录，以下是281-290 订阅

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

详细简洁

排序：

Window Queries for Problems on Intersecting Objects and Maximal Points* 1

引用

4th international conference on algorithms and discrete applied mathematics (CALDAM)

作者： Chanchary, Farah Maheshwari, Anil Smid, Michiel Carleton Univ Sch Comp Sci Ottawa ON K1S 5B6 Canada

ISBN: (数字)9783319741802

ISBN: (纸本)9783319741802;9783319741796

We present data structures that can answer window queries for a sequence of geometric objects, such as points, line segments, triangles and convex c-gons. We first present data structures to solve windowed intersection decision problems using line segments, triangles and convex c-gons. We also present data structures to count points on maximal layer, to decide whether a given point belongs to a maximal layer, and to count k-dominant points for a fixed integer k for a sequence of points in Rd, d >= 2. All data structures presented in this paper answer queries in polylogarithmic time and use subquadratic space.

关键词： Intersection decision problem Maximal point Maximal layer Window query

来源：评论

学校读者我要写书评

暂无评论

Improve Security Algorithm Cryptography Vigenere Cipher Using Chaos Functions 6

Improve Security Algorithm Cryptography Vigenere Cipher Usin...

引用

6th international conference on Cyber and IT Service Management (CITSM)

作者： Triandi, Budi Ekadiansyah, Evri Puspasari, Ratih Iwan, Lili Tanti Rahmad, Fitrianto Univ Potensi Utama Jl Yos Sudarso Km 65 3A Medan 20241 Indonesia

ISBN: (纸本)9781538654330

this paper specifically discusses how chaos functions are applied in the crystallographic algorithm of vigenere cipher, along with the mechanism of chaos function to the vigenere cipher algorithm and the application of chaos theory to the level of ciphertext security which it will produce such as chaos theory that is logistic equation. In the world of cryptography, chaos theory is used to generate numbers at random. this random number will then be used as the key in performing the encryption process. the chaos function is a function that has a sensitive nature to the initial value, meaning that a small change in the initial value will result in a major change in the value of the next function. Such properties can be applied in cryptography to maintain data integrity, especially in stream cipher cryptographic algorithms such as vigenere cipher, vigenere cipher algorithms have problems with very low security levels. In the vigenere cipher algorithm a key, called the initial key, is made of a key longer than the initial key called a key stream that is very easy to solve. the application of chaotic function in vigenere cipher can improve the security of the key used, since the chaos function can generate random numbers for the initial key on the vigenere cipher algorithm that has the sensitive properties at the initial value.

关键词： Chaos function Vigenere cipher Key stream electricity

来源：评论

学校读者我要写书评

暂无评论

Semi-supervised Sparse Representation Classification with Insufficient Samples

Semi-supervised Sparse Representation Classification with In...

引用

international conference on Information Science and Control Engineering (ICISCE)

作者： Bafan Huang Kangkang Deng College of Mathematics and Computer Science Fuzhou University Fuzhou China Center of Discrete Mathematics and Theoretical Computer Science Fuzhou University Fuzhou China

ISBN: (数字)9781728157122

ISBN: (纸本)9781728157139

Sparse representation based classification (SRC) has gained great success in image recognition. In this paper, we propose a generalized CRC method, essentially a SRC using Euler sparse representation, for image classification. To be specific, our CRC first maps the image into a complex space by Euler representation with a negligible effect for outliers and illumination, and then performs a complex SRC method. We also present a fast and efficient algorithm to solve Euler SRC subproblems. Extensive experimental results illustrate that our method outperforms traditional SRC methods and achieves better performance for image classification.

关键词：

来源：评论

学校读者我要写书评

暂无评论

UNSUPERVISED CIPHER CRACKING USING discrete GANS 6

UNSUPERVISED CIPHER CRACKING USING DISCRETE GANS

引用

6th international conference on Learning Representations, ICLR 2018

作者： Gomez, Aidan N. Huang, Sicong Zhang, Ivan Li, Bryan M. Osama, Muhammad Kaiser, Lukasz Department of Computer Science University of Toronto Canada FOR.ai Google Brain

this work details CipherGAN, an architecture inspired by CycleGAN used for inferring the underlying cipher mapping given banks of unpaired ciphertext and plaintext. We demonstrate that CipherGAN is capable of cracking language data enciphered using shift and Vigenere ciphers to a high degree of fidelity and for vocabularies much larger than previously achieved. We present how CycleGAN can be made compatible with discrete data and train in a stable way. We then prove that the technique used in CipherGAN avoids the common problem of uninformative discrimination associated with GANs applied to discrete data. © 2017 international conference on Learning Representations, ICLR. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Network Community Detection using A Backtracking-based discrete State Transition Algorithm

Network Community Detection using A Backtracking-based Discr...

引用

international conference on Informative and Cybernetics for Computational Social Systems (ICCSS)

作者： Ke Yang Xiaojun Zhou Chaojie Li School of Automation Central South University Changsha China

ISBN: (数字)9781728158570

ISBN: (纸本)9781728158587

Finding network communities (i.e. community detection) is a famous topic in network science. By far, many widely concerned community detection approaches are designed by using evolutionary computation methods. Recent years, a new evolutionary algorithm called state transition algorithm (STA) was created and developed. In our previous work, a population-based discrete STA (MDSTA) has been put forwarded to settle network community detection task. Similar to most population-based evolutionary algorithms, MDSTA has a relatively complex algorithm structure which may limit the application of the algorithm. To address this problem, a backtracking-based discrete STA (BDSTA) is designed in this study. BDSTA is an individual-based method, and two kinds of substitute operators based on label-based representation strategy and locus-based representation strategy are used in BDSTA for global search and local search, respectively. Owing to that the individual-based algorithms often fall into a stagnation solution, we employ a backtracking search strategy in the global search procedure. Finally, five real-world networks and the extended GN artificial networks are used to test BDSTA and some state-of-art algorithms. Experimental results prove that BDSTA often get high-quality community partitions and it is more efficient than these state-of-art algorithms.

关键词： state transition algorithm backtracking strategy complex network community detection Network communities complex networks State Change algorithms stormwater treatment areas evolutionary algorithm algorithm structure

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of Supervised Learning algorithms based on Classification Approach

Performance Analysis of Supervised Learning Algorithms based...

引用

IEEE international conference on Engineering Technologies and applied Sciences (ICETAS)

作者： Fazeel Ahmed Khan Adamu Abubakar Ibrahim Mohammad Salman Rais Priyanka Rajpoot Ambareen Khan Mohammad Nishat Akhtar International Islamic University Malaysia Selangor Malaysia School of Electrical and Electronics Engineering Universiti Sains Malaysia Penang Malaysia School of Aerospace Engineering Universiti Sains Malaysia Penang Malaysia

ISBN: (数字)9781728140827

ISBN: (纸本)9781728140834

Machine learning algorithm integrates with various features and methods for learning. the performance metric has a major role in determining the capacity and ability of any machine learning algorithm. the supervised approach supports learning based on predefined parameters. the classification approach classifies the set of data with labels for training and evaluation purposes. this paper applies method of supervised learning algorithm based on classification approach to analyzed in terms of performance metrics. Some algorithms were applied in the experiment process to determine the clear outcome from them. the analysis gives an outcome based on certain parameters to obtain the results to understand the ability of these algorithm and their implementation in any potential use-cases.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Risk Aware k-Min Search Algorithm

Risk Aware k-Min Search Algorithm

引用

IEEE international conference on Engineering Technologies and applied Sciences (ICETAS)

作者： Javeria Iqbal Iftikhar Ahmad Asadullah Shah A B M Asadullah Kulliyyah of Information and Communication Technology International Islamic University Malaysia University of Engineering and Technology Peshawar Pakistan Kulliyyah of Economics and Management Sciences International Islamic University Malaysia

ISBN: (数字)9781728140827

ISBN: (纸本)9781728140834

Online search and trading algorithms are designed with the prime objective of maximizing the overall profit of investors in a financial market. Investors in any financial market tend to manage their risk levels for better overall returns by the end of investment horizon. thus the real world applicability of such algorithms lacks the aspect of risk management policy. We consider the problem of online k-min search, where an online player (investor) wants to to acquire (buy) k units of an asset by using the minimum possible wealth. In this work, we investigate the k-min search problem and introduce the risk aware k-min search algorithm under the risk reward framework. Further, we show that the presented algorithm meets the bounds presented by AI-Binali (Algorithmica, 1999).

关键词：

来源：评论

学校读者我要写书评

暂无评论

Research on Demand Forecast of Aircraft Spare Parts Based on Fractional Order discrete Grey Model

Research on Demand Forecast of Aircraft Spare Parts Based on...

引用

IEEE international conference on Computer and Communications

作者： Qunhai Qiu ChangMao Qin Jiao Shi Haotian Zhou Chin Acdey of Lunch Vehice TechnoogyChin Acdey of Lunch Vehice TechnoogyChin Acdey of Lunch Vehice TechnoogyChin Acdey of Lunch Vehice Technoogy

ISBN: (数字)9781728147437

ISBN: (纸本)9781728147444

Exact spare parts demand forecast is an important task of equipment maintenance support. In spare parts demand forecast of aircraft, there exists problems such as the lack of comparable existing equipments, less historical data of fault or spare parts demand and lack of understanding of the aircraft's own guarantee characteristics. In this paper, a spare parts demand forecast method based on fractional-order discrete gray model is proposed. In this method, a fractional-order cumulative gray model is established from historical data containing "small sample" and "poor information". then, the genetic algorithm is applied to determine the optimal order of the model and the generation coefficient. Finally, the spare parts demand is predicted. Experimental results based on specific examples show that the proposed method can effectively predict the spare parts demand, and have good performance compared with the traditional integer-order model.

关键词： Predictive models Data models Autoregressive processes Atmospheric modeling Aircraft Prediction algorithms Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Pybkgmodel - a background modelling toolbox for the CTA 38

Pybkgmodel - a background modelling toolbox for the CTA

引用

38th international Cosmic Ray conference, ICRC 2023

作者： Strzys, Marcel C. Abe, Shotaro de Bony de Lavergne, Mathieu Hütten, Moritz Mender, Simone Vovk, Ievgen Abe, K. Abe, S. Acharyya, A. Adam, R. Aguasca-Cabot, A. Agudo, I. Alfaro, J. Alvarez-Crespo, N. Alves Batista, R. Amans, J.-P. Amato, E. Ambrosino, F. Angüner, E.O. Antonelli, L.A. Aramo, C. Arcaro, C. Arrabito, L. Asano, K. Aschersleben, J. Ashkar, H. Augusto Stuani, L. Baack, D. Backes, M. Balazs, C. Balbo, M. Baquero Larriva, A. Barbosa Martins, V. de Almeida, U. Barres Barrio, J.A. Bastieri, D. Batista, P.I. Batkovic, I. Batzofin, R. Baxter, J. Beck, G. Becker Tjus, J. Beiske, L. Belardinelli, D. Benbow, W. Bernardini, E. Bernete Medrano, J. Bernlöhr, K. Berti, A. Beshley, V. Bhattacharjee, P. Bhattacharyya, S. Bi, B. Biederbeck, N. Biland, A. Bissaldi, E. Blanch, O. Blazek, J. Boisson, C. Bolmont, J. Bonnoli, G. Bordas, P. Bosnjak, Z. Bradascio, F. Braiding, C. Bronzini, E. Brose, R. Brown, A.M. Brun, F. Brunelli, G. Bulgarelli, A. Burelli, I. Burmistrov, L. Burton, M. Bylund, T. Calisse, P.G. Campoy-Ordaz, A. Cantlay, B.K. Capalbi, M. Caproni, A. Capuzzo-Dolcetta, R. Carlile, C. Caroff, S. Carosi, A. Carosi, R. Carrasco, M.-S. Cascone, E. Cassol, F. Castrejon, N. Catalani, F. Cerasole, D. Cerruti, M. Chaty, S. Chen, A.W. Chernyakova, M. Chiavassa, A. Chudoba, J. Coimbra Araujo, C.H. Conforti, V. Conte, F. Contreras, J.L. Cossou, C. Costa, A. Costantini, H. Cristofari, P. Cuevas, O. Curtis-Ginsberg, Z. D'Amico, G. D'Ammando, F. Dadina, M. Dalchenko, M. David, L. Davids, I.D. Dazzi, F. De Angelis, A. de Bony de Lavergne, M. De Caprio, V. De Cesare, G. de Gouveia Dal Pino, E.M. De Lotto, B. De Lucia, M. de Menezes, R. de Naurois, M. de Ona Wilhelmi, E. De Simone, N. de Souza, V. del Peral, L. del Valle, M.V. Delagnes, E. Delgado Giler, A.G. Delgado, C. Dell'aiera, M. Della Ceca, R. Della Valle, M. della Volpe, D. Depaoli, D. Dettlaff, A. Di Girolamo, T. Di Piano, A. Di Pierro, F. Di Tria, R. Di Venere, L. Díaz-Bahamondes, C. Dib, C. Diebold, S. Dima, R. Dinesh, A. Djannati-Ataï, A. Department of Physics Tokai University 4-1-1 Kita-Kaname Kanagawa Hiratsuka259-1292 Japan Institute for Cosmic Ray Research University of Tokyo 5-1-5 Kashiwa-no-ha Kashiwa Chiba277-8582 Japan University of Alabama Tuscaloosa Department of Physics and Astronomy Gallalee Hall Box 870324 TuscaloosaAL35487-0324 United States Université Côte d'Azur Observatoire de la Côte d'Azur CNRS Laboratoire Lagrange France Laboratoire Leprince-Ringuet CNRS IN2P3 École polytechnique Institut Polytechnique de Paris Palaiseau91120 France Departament de Física Quàntica i Astrofísica Institut de Ciències del Cosmos Universitat de Barcelona IEEC-UB Martí i Franquès 1 Barcelona08028 Spain Instituto de Astrofísica de Andalucía CSIC Glorieta de la Astronomía s/n Granada18008 Spain Pontificia Universidad Católica de Chile Av. Libertador Bernardo O'Higgins 340 Santiago Chile IPARCOS-UCM Instituto de Física de Partículas y del Cosmos EMFTEL Department Universidad Complutense de Madrid MadridE-28040 Spain Instituto de Física Teórica UAM CSIC Departamento de Física Teórica Universidad Autónoma de Madrid c/ Nicolás Cabrera 13-15 Campus de Cantoblanco UAM Madrid28049 Spain LUTH GEPI LERMA Observatoire de Paris Université PSL Université Paris Cité CNRS 5 place Jules Janssen Meudon92190 France INAF Osservatorio Astrofisico di Arcetri Largo E. Fermi 5 Firenze50125 Italy INAF Osservatorio Astronomico di Roma Via di Frascati 33 Monteporzio Catone 00040 Italy TÜBITAK Research Institute for Fundamental Sciences Gebze Kocaeli41470 Turkey INFN Sezione di Napoli Via Cintia ed. G Napoli80126 Italy INFN Sezione di Padova Via Marzolo 8 Padova35131 Italy Laboratoire Univers et Particules de Montpellier Université de Montpellier CNRS IN2P3 CC 72 Place Eugène Bataillon 5 MontpellierF-34095 Cedex France Kapteyn Astronomical Institute University of Groningen Landleven 12 Groningen9747 AD Netherlands Instituto de Física de São Carlos Universidade de

Despite the advancement in background rejection techniques, observation of the very-high-energy gamma-ray sky by imaging atmospheric Cherenkov telescopes (IACTs) are subject to an irreducible background from gamma-like hadron- or electron-induced air showers. the determination of this residual background is crucial for accurate spectral and spatial measurements. the Cherenkov Telescope Array (CTA) will become the next generation of IACTs. To unveil its full potential, the improved reconstruction performance of CTA needs to be coupled with a reliable background estimate across the entire field of view. this may become especially important in the case of the planned surveys of large areas of the sky. In this contribution we will present pybkgmodel, an open-source python software package developed for CTA. It aims at providing in a consistent way the various background modelling methods, based on the experience from current IACTs such as H.E.S.S, MAGIC, and VERITAS. It is designed as a toolbox allowing a user to easily choose the optimal reconstruction approach for various target regions or a combination of several algorithms. We will introduce the design of the package as well as demonstrate its functionality using data for the CTA Large-Sized Telescope prototype (LST-1). © Copyright owned by the author(s) under the terms of the Creative Commons.

关键词： Cosmology

来源：评论

学校读者我要写书评

暂无评论

Multiobjective Evolutionary algorithms NSGA-II and NSGA-III for Software Product Lines Testing Optimization

Multiobjective Evolutionary Algorithms NSGA-II and NSGA-III ...

引用

IEEE international conference on Engineering Technologies and applied Sciences (ICETAS)

作者： Muhammad Abid Jamil Ahmad Alhindi Muhammad Arif Mohamed K Nour Normi Sham Awang Abubakar Tareq Fahad Aljabri College of Computer and Information Science Umm Al Qura university Makkah Saudi Arabia KICT International Islamic university Kuala lumpur Malaysia

ISBN: (数字)9781728140827

ISBN: (纸本)9781728140834

Software Product line (SPL) engineering methodology utilizes reusable components to generate a new system for a specific domain. In fact, the product line establishes requirements, reusable components, architecture, and shared products to develop new products' functionalities. In order to maintain high quality, there is a need for a thorough testing process. Each product in SPL having a different number of features need to be tested. Hence, the testing process of SPL can utilize a multi-objective optimization algorithm to optimize the testing process. this research, reports on the performance of a multi-objective Evolutionary algorithms Non-Dominated Sorting Genetic Algorithm II (NSGA-II) and NSGA-III on Feature Models (FMs) to optimize SPL testing.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共92页 << < 25 26 27 28 29 30 31 32 33 34 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：