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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

462 篇 会议
17 册 图书
9 篇 期刊文献

馆藏范围

488 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

205 篇 工学
- 151 篇 计算机科学与技术...
- 57 篇 电气工程
- 52 篇 信息与通信工程
- 51 篇 软件工程
- 17 篇 控制科学与工程
- 11 篇 电子科学与技术（可...
- 8 篇 机械工程
- 6 篇 动力工程及工程热...
- 5 篇 仪器科学与技术
- 4 篇 光学工程
- 4 篇 测绘科学与技术
- 4 篇 生物工程
- 3 篇 化学工程与技术
- 2 篇 土木工程
- 2 篇 航空宇航科学与技...
- 2 篇 生物医学工程（可授...
- 2 篇 安全科学与工程
72 篇 理学
- 53 篇 数学
- 13 篇 物理学
- 9 篇 统计学（可授理学、...
- 8 篇 系统科学
- 6 篇 生物学
- 2 篇 化学
- 2 篇 地球物理学
17 篇 管理学
- 9 篇 图书情报与档案管...
- 7 篇 管理科学与工程(可...
- 5 篇 工商管理
6 篇 医学
- 6 篇 临床医学
3 篇 法学
- 3 篇 社会学
2 篇 经济学
- 2 篇 应用经济学
1 篇 教育学
1 篇 农学

主题

109 篇 complexity theor...
100 篇 computational co...
33 篇 time complexity
28 篇 algorithm design...
25 篇 computational mo...
23 篇 heuristic algori...
22 篇 prediction algor...
22 篇 accuracy
19 篇 feature extracti...
18 篇 classification a...
18 篇 clustering algor...
18 篇 partitioning alg...
17 篇 encoding
16 篇 approximation al...
15 篇 optimization
15 篇 signal processin...
14 篇 decoding
14 篇 genetic algorith...
14 篇 algorithm analys...
12 篇 detectors

机构

4 篇 university of pi...
3 篇 inria rennes
2 篇 vienna universit...
2 篇 school of comput...
2 篇 computer network...
2 篇 tu münchen garch...
2 篇 computer science...
2 篇 faculty of engin...
2 篇 isislab - dipart...
2 篇 key laboratory o...
2 篇 tennessee tech u...
2 篇 rwth aachen univ...
2 篇 department of co...
2 篇 universitat poli...
2 篇 vilnius universi...
2 篇 cracs/inesc-tec ...
2 篇 beihang universi...
2 篇 tech univ munich...
2 篇 tu dortmund info...
2 篇 universidad carl...

作者

4 篇 dell'orletta fel...
3 篇 liu yang
3 篇 tingting yang
3 篇 carlos a. coello...
2 篇 ming li
2 篇 yuhui shi
2 篇 michael alexande...
2 篇 holzapfel klaus
2 篇 zhiyang li
2 篇 roberto g. casce...
2 篇 bollig beate
2 篇 geyong min
2 篇 zorzi michele
2 篇 wanlei zhou
2 篇 ali hamzeh
2 篇 strada roberto
2 篇 alexandru costan
2 篇 luís lopes
2 篇 brunato dominiqu...
2 篇 emmanuel jeannot

语言

484 篇 英文
3 篇 其他
1 篇 中文

检索条件"任意字段=5th Italian Conference on Algorithms and Complexity"

共 488 条记录，以下是141-150 订阅

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

详细简洁

排序：

Satellite Fusion Positioning Algorithm Based on GDOP

Satellite Fusion Positioning Algorithm Based on GDOP

引用

Communication, Image and Signal Processing (CCISP), International conference on

作者： Ju Si Yu Gao Xuan Yi Qi Chun Dong School of Information and Electronics Beijing Institute of Technology

ISBN: (数字)9781728185897

ISBN: (纸本)9781728185903

In passive satellite positioning, different positioning methods have different areas of high accuracy. In the TDOA/FDOA positioning method, there is a positioning blind area that runs through the satellites' sub-satellite point, while in the AOA positioning method, the satellite's sub-satellite point is the region with the highest positioning accuracy. Aiming at the problem of positioning blind area in TDOA/FDOA positioning, this paper proposes a Satellite Fusion Positioning Algorithm Based on GDOP. By calculating the theoretical error of AOA positioning and TDOA/FDOA positioning, the average values of its random error is estimated as the weight of the fusion positioning. then use the weight values to fuse the positioning results of the two methods. this algorithm can combine the positioning advantages of each of the two positioning algorithms to effectively improve the problem of positioning blind area in TDOA/FDOA positioning. Moreover, when the variance of the original positioning data is close, the algorithm can reduce the randomness of the positioning results and improve the positioning accuracy.

关键词： Satellites Mathematical model Earth Time complexity Standards Phase measurement Gaussian distribution

来源：评论

学校读者我要写书评

暂无评论

5th International conference on Artificial Intelligence and Security, ICAIS 2019

5th International Conference on Artificial Intelligence and ...

引用

5th International conference on Artificial Intelligence and Security, ICAIS 2019

ISBN: (纸本)9783030242671

the proceedings contain 229 papers. the special focus in this conference is on Artificial Intelligence and Security. the topics include: Multi-function Quantum Cryptography Protocol Based on Bell State;the Attack Case of ECDSA on Blockchain Based on Improved Simple Power Analysis;a Weight-Based Channel Estimation Implementation Algorithm;multi-party Quantum Communication complexity on Composite Boolean-Valued Function;BlockZone: A Blockchain-Based DNS Storage and Retrieval Scheme;robust Analysis of Grid System Based on Complex Network Attack Mode;A Secure Data Aggregation Protocol in VANETs Based on Multi-key FHE;Research on SQL Injection and Defense Technology;a Review of the Factorization Problem of Large Integers;quantum Network Coding Based on Entanglement Distribution;A Comparison of Machine Learning algorithms for Detecting XSS Attacks;a Survey of Privacy-Preserving Techniques for Blockchain;a Survey of Software Reverse Engineering Applications;A Fast IP Matching Algorithm Under Large Traffic;An Effective Load Balance Using Link Bandwidth for SDN-Based Data Centers;zero-Day Vulnerability Risk Assessment and Attack Path Analysis Using Security Metric;research on Content Extraction of Rich Text Web Pages;Network Protocol Analysis Base on WeChat PC Version;bitcoin Network Size Estimation Based on Coupon Collection Model;a Survey of the Software Vulnerability Discovery Using Machine Learning Techniques;Moving Target Defense in Preventing SQL Injection;a Distributed Cryptanalysis Framework Based on Mobile Phones;a Novel threshold Signature Scheme Based on Elliptic Curve with Designated Verifier;A Congestion Control Methodology with Probability Routing Based on MNL for Datacenter Network;fast Failover for Link Failures in Software Defined Networks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

String attractors and combinatorics on words 20

String attractors and combinatorics on words

引用

20th italian conference on theoretical Computer Science, ICTCS 2019

作者： Mantaci, Sabrina Restivo, Antonio Romana, Giuseppe Rosone, Giovanna Sciortino, Marinella University of Palermo Italy University of Pisa Italy

the notion of string attractor has recently been introduced in [Prezza, 2017] and studied in [Kempa and Prezza, 2018] to provide a unifying framework for known dictionary-based compressors. A string attractor for a word w = w[1]w[2] · · · w[n] is a subset Γ of the positions {1, . . ., n}, such that all distinct factors of w have an occurrence crossing at least one of the elements of Γ. While finding the smallest string attractor for a word is a NP-complete problem, it has been proved in [Kempa and Prezza, 2018] that dictionary compressors can be interpreted as algorithms approximating the smallest string attractor for a given word. In this paper we explore the notion of string attractor from a combinatorial point of view, by focusing on several families of finite words. the results presented in the paper suggest that the notion of string attractor can be used to define new tools to investigate combinatorial properties of the words. Copyright © 2019 for this paper by its authors.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

A Novel Adaptive Channel Equalizer Based on Artificial Neural Network Trained by Modified FOA

A Novel Adaptive Channel Equalizer Based on Artificial Neura...

引用

IEEE International conference on Computer and Communications

作者： Zheng Jiali Wenjiang Feng Schoo of Microeecronics nd Counicion Engineering Chongqing UniversiySchoo of Microeecronics nd Counicion Engineering Chongqing Universiy

ISBN: (数字)9781728147437

ISBN: (纸本)9781728147444

this paper addresses the problems in channel equalization of high data rates scenarios. Traditional equalization algorithms tend to fall into local optimum, and the complexity is usually high, requiring a long time to converge, thus not suitable for high data rate scenarios. this paper proposes a low complexity and efficient equalizer using artificial neural network (ANN) trained by modified fruit fly optimization algorithm (FOA). After that, we applied it to four different channels and compared it with the ANN trained with back propagation (BP) and ANN trained with particle swarm optimization (PSO) algorithms under the same conditions. It is obvious from the simulation results that the proposed algorithm outperforms the other two algorithms. the algorithm proposed in this paper requires a shorter convergence time and can converge to a smaller value, and the complexity of the algorithm is very low.

关键词： Artificial neural networks Convergence complexity theory Optimization Adaptive equalizers Simulation

来源：评论

学校读者我要写书评

暂无评论

Genetic algorithms in Model Structure Identification for Fuel Cell Polarization Curve 5

Genetic Algorithms in Model Structure Identification for Fue...

引用

5th International conference on Control, Decision and Information Technologies (CoDIT)

作者： Ohenoja, Markku Sorsa, Aki Leiviska, Kauko Univ Oulu Control Engn Res Grp POB 4300 Oulu 90014 Finland

ISBN: (纸本)9781538650653

Evolutionary optimizers, such as genetic algorithms, have earlier been successfully applied to find the parameter values for the fuel cell polarization curve models. the structure of these, typically semi-empirical, models have evolved during the decades. In this study, the model structures were reviewed and a new model structure was generated. Genetic algorithms were used to determine the optimized model structure with linear model parameters. Four different fuel cells, one with varying operating conditions, were studied. the results show that the model can outperform the semi-empirical model utilized in number of studies without increasing the model complexity.

关键词： Mathematical model Voltage control Fuel cells Numerical models Genetic algorithms Cathodes Data models

来源：评论

学校读者我要写书评

暂无评论

A Graph theoretic Approach for Maximizing Target Coverage using Minimum Directional Sensors in Randomly Deployed Wireless Sensor Networks 5

A Graph Theoretic Approach for Maximizing Target Coverage us...

引用

5th International conference on Networking, Systems and Security (NSysS)

作者： Sarker, Laboni Chakravarty, Sakshar Rahman, Ashikur Bangladesh Univ Engn & Technol Dept CSE Dhaka 1000 Bangladesh

ISBN: (纸本)9781728113241

the coverage maximization by activating minimum number of sensors is one of the most fundamental problems in wireless sensor networks. the use of directional sensors adds new dimension to it. It has great applications in security, tracking, monitoring and surveillance systems. As the problem is known to be NP-hard, most of the previous works attempt different greedy heuristics for achieving a near optimal solution. Unlike other traditional research works, we tackle the problem in a graph theoretic approach and provide novel solutions using different polynomial order graph algorithms. Use of graph models significantly reduces the run time complexity and also provides better approximation.

关键词： Cameras Wireless sensor networks Sensor systems Human computer interaction Time complexity Visualization

来源：评论

学校读者我要写书评

暂无评论

Low-complexity RTS Detection Algorithm in Massive MIMO Systems

Low-Complexity RTS Detection Algorithm in Massive MIMO Syste...

引用

IEEE International conference on Computer and Communications

作者： Erhao Song Yong Li Xiang Zhang Guiming Wei Wireess Sign Processing nd Nework Lborory Beijing Universiy of Poss nd TeecounicionsWireess Sign Processing nd Nework Lborory Beijing Universiy of Poss nd TeecounicionsInsiue of Technoogy nd Sndrds Chin Acdey of Inforion nd Counicions TechnoogyInsiue of Technoogy nd Sndrds Chin Acdey of Inforion nd Counicions Technoogy

ISBN: (数字)9781728147437

ISBN: (纸本)9781728147444

In this paper, we propose a low-complexity uplink signal detection algorithm based on reactive tabu search (RTS) in massive multiple-input multiple-output (MIMO) systems. As the number of antennas increases, conventional RTS algorithm achieves near-maximum likelihood (ML) performance in massive MIMO systems. But the complexity of the initial solution vector is too high. therefore, we propose a symmetric successive over- relaxation RTS (SSOR-RTS) algorithm which achieves the same error rate performance of RTS but with lower complexity. the key idea is to calculate the initial solution vector of RTS algorithm using the SSOR iterative method. A criterion based on ML cost change rate to limit the number of SSOR iterations is also proposed to further reduce the complexity of the RTS algorithm. Simulation results show that the SSOR-RTS and adaptive SSOR- RTS achieve almost the same performance with RTS algorithm at significantly less complexity.

关键词： complexity theory MIMO communication Detection algorithms Signal processing algorithms Antennas Quadrature amplitude modulation Signal to noise ratio

来源：评论

学校读者我要写书评

暂无评论

Low complexity Implementation of Entropy-Constrained Scalar Quantization for Image Compression 5

Low Complexity Implementation of Entropy-Constrained Scalar ...

引用

5th International conference on Systems and Informatics (ICSAI)

作者： Lin, Jianyu Shantou Univ Guangdong Prov Key Lab Digital Signal & Image Pro Dept Elect Engn Shantou Guangdong Peoples R China

ISBN: (纸本)9781728101200

A low complexity implementation of entropy-constrained scalar quantization is introduced for coding the transformed coefficients in image compression. the Laplacian distribution is used to model the local magnitude distribution of the transformed subband coefficients. the entropy-constrained scalar quantizer for a Laplacian distribution is the uniform quantizer with a dead-zone at "0". the sparsity of the quantized coefficients is found and used to determine the Laplacian distribution. then, the threshold of the dead-zone is determined and used to trim the quantized coefficients. Since the Laplacian distribution is determined by the sparsity, the entropy-constrained scalar quantizer is implemented by a table looking process, making the complexity low. Coding results show that the introduced quantizer achieves higher compression efficiency than the double dead-zone scalar quantizer, which is commonly used in high-efficiency image compression algorithms.

关键词： lossy transform image compression entropy-constrained scalar quantiztion compression efficiency

来源：评论

学校读者我要写书评

暂无评论

A Simplified and Efficient Version of Inclined Planes system Optimization Algorithm

A Simplified and Efficient Version of Inclined Planes system...

引用

International conference on Knowledge-Based Engineering and Innovation (KBEI)

作者： Sadegh Mohammadi-Esfahrood Ali Mohammadi Seyed Hamid Zahiri Department of Electrical and Computer Engineering University of Birjand Birjand Iran

the efficiency of heuristic optimization methods has led researchers to considerably use these methods to solve complex engineering problems. Inclined planes system optimization (IPO) is a relatively new heuristic algorithm that is inspired by the dynamic movement of objects on inclined planes without friction. this paper presents a simplified and effective version of IPO (called SIPO) with the aim of simplifying the main IPO equations, creating a powerful trade-off between the concepts of exploitation and exploration, and modifying the complexity of their structural parameters. the performance of the proposed algorithm is measured on 10 benchmark functions. the results clearly demonstrate the improved performance and superiority of SIPO compared to the standard version of the IPO and its improved versions.

关键词： Standards Optimization Benchmark testing Convergence Heuristic algorithms Acceleration complexity theory

来源：评论

学校读者我要写书评

暂无评论

A Partitional Clustering Approach to Persian Spell Checking

A Partitional Clustering Approach to Persian Spell Checking

引用

International conference on Knowledge-Based Engineering and Innovation (KBEI)

作者： Fatemeh Hojati Kermani Shirin Ghanbari Department of Technology Alzahra University Tehran Iran Department of Computer Science and Electronic University of Essex UK

Spell checkers find, suggest and correct incorrect words within documents. Complexities of languages increases the challenge in-hand. Due to the challenges of the Persian language, preprocessing and processing spell checkers requires further analysis and natural language processing. For the past decade, the majority of methods that identify errors in documents have been lexicon-based or probability-based. this paper describes a new approach for Persian spell-checking using a clustered dictionary to save time and storage. Clustering is optimally generated through k-medoids and during processing misspelt words are compared to the centers of the generated clusters rather than the entire dictionary. the proposed spell checker is evaluated using the Faspell spelling error corpus that contains Persian misspellings and is shown to provide suggestions with significant accuracy rates.

关键词： Dictionaries complexity theory Clustering algorithms Partitioning algorithms Natural language processing Phonetics Optical character recognition software

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共49页 << < 11 12 13 14 15 16 17 18 19 20 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：