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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,657 篇 会议
69 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

816 篇 工学
- 500 篇 计算机科学与技术...
- 350 篇 软件工程
- 145 篇 机械工程
- 132 篇 控制科学与工程
- 97 篇 信息与通信工程
- 80 篇 电气工程
- 54 篇 电子科学与技术（可...
- 47 篇 航空宇航科学与技...
- 44 篇 仪器科学与技术
- 43 篇 动力工程及工程热...
- 35 篇 力学（可授工学、理...
- 30 篇 生物医学工程（可授...
- 30 篇 生物工程
- 27 篇 光学工程
- 27 篇 土木工程
- 26 篇 化学工程与技术
- 25 篇 交通运输工程
- 24 篇 建筑学
- 23 篇 材料科学与工程（可...
446 篇 理学
- 360 篇 数学
- 90 篇 物理学
- 64 篇 系统科学
- 64 篇 统计学（可授理学、...
- 40 篇 生物学
- 20 篇 化学
144 篇 管理学
- 117 篇 管理科学与工程(可...
- 51 篇 工商管理
- 33 篇 图书情报与档案管...
20 篇 经济学
- 20 篇 应用经济学
20 篇 医学
- 19 篇 临床医学
15 篇 法学
15 篇 农学
5 篇 教育学
4 篇 军事学
2 篇 文学

主题

269 篇 genetic algorith...
240 篇 algorithm design...
199 篇 evolutionary com...
190 篇 optimization
116 篇 sociology
97 篇 heuristic algori...
94 篇 statistics
93 篇 computational mo...
87 篇 clustering algor...
66 篇 convergence
59 篇 feature extracti...
58 篇 mathematical mod...
56 篇 particle swarm o...
54 篇 signal processin...
54 篇 classification a...
52 篇 approximation al...
48 篇 linear programmi...
45 篇 computer science
45 篇 benchmark testin...
45 篇 training

机构

12 篇 college of compu...
10 篇 school of engine...
8 篇 school of comput...
7 篇 school of comput...
6 篇 department of el...
6 篇 school of comput...
6 篇 college of compu...
6 篇 school of inform...
5 篇 school of comput...
5 篇 shenzhen univers...
4 篇 college of compu...
4 篇 school of electr...
4 篇 southern univers...
4 篇 school of engine...
4 篇 school of comput...
4 篇 department of co...
4 篇 school of electr...
4 篇 department of el...
4 篇 school of softwa...
4 篇 department of au...

作者

10 篇 mengjie zhang
9 篇 zhang mengjie
7 篇 jun zhang
7 篇 quan-ke pan
7 篇 kalyanmoy deb
6 篇 h. ishibuchi
5 篇 hisao ishibuchi
5 篇 m. fatih tasgeti...
5 篇 xue bing
5 篇 f.g. guimaraes
5 篇 yusuke nojima
5 篇 amit konar
5 篇 shahryar rahnama...
5 篇 yong wang
4 篇 ji junkai
4 篇 deb kalyanmoy
4 篇 simon fong
4 篇 jin yaochu
4 篇 g.g. yen
4 篇 yew-soon ong

语言

1,711 篇 英文
11 篇 其他
8 篇 中文

检索条件"任意字段=2016 International Congress on Computation Algorithms in Engineering"

共 1728 条记录，以下是1621-1630 订阅

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

详细简洁

排序：

Vehicle Classification in Acoustic Sensor Networks Based on Hybrid Dictionary Learning

Vehicle Classification in Acoustic Sensor Networks Based on ...

引用

IEEE international Symposium on Dependable, Autonomic and Secure Computing (DASC)

作者： Shuilin Guo Rui Wang Bin Liu Qiyue Wei Yanping Li School of Communication and Information Engineering Shanghai University Shanghai China

In this paper, we consider a single sensor classification problem, focusing on classifying the types of the moving vehicles. To improve the classification accuracy with low-time complexity in complex scenes, the acoustic sensor data sets were captured to measure the physical events and a novel hybrid dictionary learning method for vehicle classification is proposed. The efficient hybrid dictionary is constructed by a synthesis dictionary and an analysis dictionary, in which the analysis dictionary is trained to generate discriminative codes and the synthesis dictionary is trained to achieve class-specific discriminative reconstruction. To further analyze the performance of this proposed method, we extend our approaches to deal with sparse environmental noise. Extensive experiments are conducted on real data sets and the results demonstrate that our proposed approach yields higher classification accuracy with relatively lower time complexity compared to SVM, SRC, KSRC, LC-KSVD and FDDL algorithms.

关键词： Dictionaries Vehicles Feature extraction Encoding Classification algorithms Acoustic sensors Acoustics

来源：评论

学校读者我要写书评

暂无评论

Byzantine Connectivity Testing in the Congested Clique 36

Byzantine Connectivity Testing in the Congested Clique

引用

36th international Symposium on Distributed Computing, DISC 2022

作者： Augustine, John Molla, Anisur Rahaman Pandurangan, Gopal Vasudev, Yadu Department of Computer Science and Engineering Indian Institute of Technology Madras Chennai India Indian Statistical Institute Kolkata India Department of Computer Science University of Houston TX United States

ISBN: (纸本)9783959772556

We initiate the study of distributed graph algorithms under the presence of Byzantine nodes. We consider the fundamental problem of testing the connectivity of a graph in the congested clique model in a Byzantine setting. We are given a n-vertex (arbitrary) graph G embedded in a n-node congested clique where an arbitrary subset of B nodes of the clique of size up to (1/3 - Ε)n (for any arbitrary small constant Ε > 0) can be Byzantine. We consider the full information model where Byzantine nodes can behave arbitrarily, collude with each other, and have unlimited computational power and full knowledge of the states and actions of the honest nodes, including random choices made up to the current round. Our main result is an efficient randomized distributed algorithm that is able to correctly distinguish between two contrasting cases: (1) the graph G \ B (i.e., the graph induced by the removal of the vertices assigned to the Byzantine nodes in the clique) is connected or (2) the graph G is far from connected, i.e., it has at least 2|B| + 1 connected components. Our algorithm runs in O(polylog n) rounds in the congested clique model and guarantees that all honest nodes will decide on the correct case with high probability. Since Byzantine nodes can lie about the vertices assigned to them, we show that this is essentially the best possible that can be done by any algorithm. Our result can be viewed also in the spirit of property testing, where our algorithm is able to distinguish between two contrasting cases while giving no guarantees if the graph falls in the grey area (i.e., neither of the cases occur). Our work is a step towards robust and secure distributed graph computation that can output meaningful results even in the presence of a large number of faulty or malicious nodes. © John Augustine, Anisur Rahaman Molla, Gopal Pandurangan, and Yadu Vasudev.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Accelerated diffusion-based recommendation algorithm on tripartite graphs with GPU clusters

Accelerated diffusion-based recommendation algorithm on trip...

引用

ACIS international Conference on Software engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD)

作者： Mi Li Jie Huang Jingpeng Wang School of Software Engineering Tongji University Shanghai China

Exorbitant computation cost hinders the practical application of recommendation algorithm, especially in time-critical application scenario. Although experiments show that recommendation algorithm based on an integrated diffusion on user-item-tag tripartite graphs can significantly improve accuracy, diversification and novelty of recommendation, it is also very time-consuming. Therefore, a parallel solution is frequently needed to improve the performance of the algorithm. This paper explicitly presents the parallel implementation and optimizations of diffusion-based recommendation on weighted tripartite graphs algorithm using Compute Unified Device Architecture (CUDA) and related optimization solutions including shared memory, stream scheduling and GPU cluster optimization. Compared to the algorithm running on a single CPU core, the unoptimized GPU kernel can achieve 153.9 speedup on average with the input dataset consists of 30000 records on GTX 980. With shared memory applied, the time cost on memory access saves about 50% on dataset of 90000 records and with 2 way streams scheduling, the kernel's performance improves about 7% ~ 13%. Based on the optimized kernel, we evaluate the performance of the algorithm with customized socket communication mechanism on GPU clusters. And compared to a single GPU node, we achieve 7.55 speedup on clusters of 9 GPUs when recommending for 8000 users. Besides this, the speedup of GPU clusters is also 26.1 times of the speedup of our CPU clusters of 9 nodes and 1586.28 times of serial algorithm on one CPU core. It proves that GPU technology can dramatically improve the algorithm's performance.

关键词： Graphics processing units Kernel Clustering algorithms Bipartite graph Algorithm design and analysis Instruction sets Arrays

来源：评论

学校读者我要写书评

暂无评论

The widely linear block quaternion least mean square algorithm for fast computation in 3D audio systems

The widely linear block quaternion least mean square algorit...

引用

IEEE Workshop on Machine Learning for Signal Processing

作者： Francesca Ortolani Danilo Comminiello Aurelio Uncini Dpt. of Information Engineering Sapienza University of Rome Rome Italy

ISBN: (纸本)9781509007479

In this paper we propose an algorithm which operates weight adaptation by means of a periodic law and is based on the Widely Linear Quaternion Least Mean Square (WL-QLMS) algorithm. The WL-QLMS successfully handles real-world signals, either proper or improper. However, because of the introduction of full second order statistics into the algorithm, its computational cost is quadruplicated with respect to its precursor QLMS. The proposed Widely Linear Block Quaternion Least Mean Square (WL-BQLMS) algorithm speeds up the execution, thus revealing itself as a good solution in 3D audio signal processing applications, where huge amounts of data are usually treated and signals are typically improper. Simulations exploiting 3D Ambisonic B-Format audio signals provide a report of the WL-BQLMS behavior in comparison with BQLMS.

关键词： Quaternions Three-dimensional displays Signal processing algorithms Covariance matrices Adaptation models Algebra computational efficiency

来源：评论

学校读者我要写书评

暂无评论

Computing the relative land subsidence at Venice, Italy, over the last fifty years 22

Computing the relative land subsidence at Venice, Italy, ove...

引用

22nd international congress on Modelling and Simulation: Managing Cumulative Risks through Model-Based Processes, MODSIM 2017 - Held jointly with the 25th National Conference of the Australian Society for Operations Research and the DST Group led Defence Operations Research Symposium, DORS 2017

作者： da Lio, C. Strozzi, T. Teatini, P. Tosi, L. Venice Italy GAMMA REMOTE SENSING AG Gümligen Switzerland Department of Civil Environmental and Architectural Engineering University of Padova Padova Italy

ISBN: (纸本)9780987214379

Land subsidence causes various damages to the infrastructures and cultural heritage in many cities worldwide. Urban flooding is one of the main consequences of land subsidence in coastal cities, where it is exacerbated by sea-level rise accompanying global climate change, but also in inland metropolitan areas such as Mexico City, where subsidence zones are increasingly flooded following intense rainstorms. The subsidence of Venice, one of the most beautiful and famous cities in the world, is well known not for the magnitude of subsidence but because subsidence has seriously compromised the heritage and the safety of the city in relation to its small elevation above the sea. The storm that flooded the historical center of Venice on November 4, 1966 dramatically revealed its fragility with respect to land subsidence and sea-level rise, or the Relative Land Subsidence (RLS), i.e. land movement with respect to sea-level changes. That event signaled the beginning of a systematic monitoring of the loss in elevation of the ground surface of Venice with respect to the mean level of the Northern Adriatic (NA) Sea. Tide gauge measurements, available from the beginning of the last century, have been supplied historically by levelling and more recently by Synthetic Aperture Radar (SAR)-based Interferometry. On the occasion of the 50th anniversary of the 1966 flood event, we quantify the RLS experienced by the city over these last five decades with a detail never achieved before. The computation of the loss of elevation has been obtained by processing and superposing the results of levelling surveys carried out in 1961, 1969, 1973, and 1993, together with the results of Interferometric processing of SAR images acquired from satellites: 1993 to 2002 by ERS-1/2, 2003 and 2010 by ENVISAT, 2008 to 2013 by TerraSAR-X, and 2012 to 2016 by COSMO-SkyMED. The records from the tide gauge in Trieste, which is a city on the coast of the NA Sea close to the Alps and known to be stable, are u

关键词： Subsidence

来源：评论

学校读者我要写书评

暂无评论

A fast ray tracing algorithm for network planning based on relative coverage computations

A fast ray tracing algorithm for network planning based on r...

引用

international Conference on Selected Topics in Mobile and Wireless Networking (MoWNeT)

作者： Mohamed Ashour Mohamed Ibrahim Salah Elhoshy Youstina Megalli Tallal El-Shabrawy Hany Hammad M. R. M Rizk Faculty of Information Engineering and Technology German University Cairo Egypt Faculty of Engineering Alexandria University Alexandria Egypt German University in Cairo Cairo EG

ISBN: (纸本)9781509017447

Hot spot coverage requirements of indoor environments necessitate adequate network platforms and optimal network planning. Optimal network planning imposes numerous iterative computations and evaluations of network coverage until the optimal antenna layout is achieved. Typically, iterations within optimization algorithms invoke neighboring search functions where one of the antennas of a given antenna layout solution changes its position while the rest of the antennas' locations are maintained fixed. Such process is repeated successively with the corresponding coverage being evaluated until the optimal antenna layout is declared. Accordingly, the underlying ray tracing algorithm for coverage computations is called repeatedly during the optimization process leading to significantly long optimization convergence times. In this paper, an enhancement to our recently proposed ray tracing algorithm is proposed where computations based on image theory during the optimization routine may be derived from previous achieved solutions rather than overtaking the whole computation process. Simulation results confirm the superior potential for computational time gains achieved by the proposed algorithm.

关键词： Reflection Transmitters Ray tracing Antennas Optimization Layout Planning

来源：评论

学校读者我要写书评

暂无评论

Interpolation Based Progressive Algebraic Chase Decoding of Reed-Solomon Codes

Interpolation Based Progressive Algebraic Chase Decoding of ...

引用

Ad-Hoc and Sensor Networks Symposium

作者： Jiancheng Zhao Li Chen Xiao Ma Martin Johnston School of Information Science and Technology Sun Yat-sen University School of Electrical and Electronic Engineering Newcastle University

ISBN: (纸本)9781479966653

This paper proposes an interpolation based progressive algebraic Chase decoding (PACD) algorithm for Reed-Solomon (RS) codes. Based on the received information, 2~η (η > 0) interpolation test-vectors are constructed. They are ordered using a reliability function, assessing their potential of yielding the intended message. The decoding is performed progressively granting priority to decode the test-vectors that are more likely to yield the intended message, and it will be terminated once the intended message is found. In the proposal, the decoding of a later test-vector utilizes the interpolation information that is generated during the decoding of the earlier ones. It results in the binary tree that represents the evolution of the interpolated polynomial sets growing in a depth-first-search manner. The PACD algorithm has the advantage of adapting its decoding computation to the channel condition, leveraging the average decoding complexity. This channel dependent feature will be validated by our simulation results which show that the PACD algorithm is less complex than various interpolation based algebraic decoding algorithms. We will also demonstrate that it can achieve a high RS decoding performance.

关键词： Algebraic Chase decoding Complexity reduction Progressive decoding Reed-Solomon codes

来源：评论

学校读者我要写书评

暂无评论

A fast algorithm for the separation of dependent sources based on bounded component analysis

A fast algorithm for the separation of dependent sources bas...

引用

IEEE international Conference on Communications in China (ICCC)

作者： Qiao Su Yuehong Shen Changliang Deng Wei Zhao Linyuan Zhang Institute of Communication Engineering PLA University of Science and Technology Nanjing China

In order to separate the mixture of bounded signals faster and more accurately, this paper proposes a Bounded Component Analysis (BCA) algorithm based on the detection and removing of steady state learning curve oscillations (DRSSLCO-BCA). In this algorithm, the assumption of statistic independence is replaced by the source boundedness side information with a weaker assumption so that it can separate both independent and dependent sources up to permutation, scaling and phase ambiguities. The algorithm detects the oscillations of the steady state learning curve by the correlation extent at the steady state and uses the iteration of variable step to remove the oscillations of the steady state learning curve. This leads to a faster computation speed and better separation quality. Computer simulations show that the proposed DRSSLCO-BCA algorithm can separate both the dependent and independent sources efficiently with superior performance of computational cost and the separation quality in comparison with the existing BCA algorithms obviously in the noisy or noiseless case.

关键词： Steady-state Oscillators Algorithm design and analysis Cost function computational efficiency Correlation Noise measurement Algorithm design and analysis Noise measurement Steady state computational efficiency Cost functions Oscillators component analysis Oscillations Learning Curve Bounded

来源：评论

学校读者我要写书评

暂无评论

Joint resource segmentation and transmission rate adaptation in Cloud RAN with Caching as a Service

Joint resource segmentation and transmission rate adaptation...

引用

IEEE Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

作者： Jianhua Tang Tony Q. S. Quek Wee Peng Tay School of Communication and Information Engineering Chongqing University of Posts and Telecommunications China Singapore University of Technology and Design Singapore School of Electrical and Electronic Engineering Nanyang Technological University Singapore

ISBN: (纸本)9781509017508

By introducing Caching as a Service (CaaS) in Cloud radio access network (C-RAN), the joint resource segmentation and transmission rate adaptation problem is investigated in this paper. Specifically, in the baseband unit (BBU) pool of C-RAN, we optimally segment computation and storage resources to different types of virtual machines (VMs), and in the remote radio heads (RRHs), we adjust the beamformers to obtain the cache-based adaptive rate (CBAR). We aim to minimize the system cost, which includes server cost, VM cost and wireless transmission cost. The joint optimization problem is formulated as a mixed-integer nonlinear programming (MINLP) problem, which contains l 0 -norm terms in the objective function and nonconvex constraints. We propose a three-step solution approach, i.e., a general smooth function approximation step, a weighted minimum mean square error (WMMSE) reformulation step and an integer recovery step. Simulation results show that our proposed integer recovery algorithms recover the integer variable values effectively.

关键词： Servers Baseband Wireless communication Function approximation Radio access networks Programming Linear programming

来源：评论

学校读者我要写书评

暂无评论

Opportunistic spectrum access with temporal-spatial reuse in cognitive radio networks

Opportunistic spectrum access with temporal-spatial reuse in...

引用

international Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Yi Zhang Wee Peng Tay Kwok Hung Li Moez Esseghir Dominique Gaïti School of Electrical and Electronic Engineering Nanyang Technological University Singapore Charles Delaunay Institute University of Technology of Troyes France

We formulate and study a multi-user multi-armed bandit (MAB) problem that exploits the temporal-spatial reuse of primary user (PU) channels so that secondary users (SUs) who do not interfere with each other can make use of the same PU channel. We first propose a centralized channel allocation policy that has logarithmic regret, but requires a central processor to solve a NP-complete optimization problem at exponentially increasing time intervals. To avoid the high computation complexity at the central processor and the need for SU synchronization, we propose a heuristic distributed policy that incorporates channel access rank learning in a local procedure at each SU at the cost of a higher regret. We compare the performance of our proposed policies with other distributed policies recently proposed for opportunistic spectrum access. Simulations suggest that our proposed policies significantly outperform the benchmark algorithms when spectrum temporal-spatial reuse is allowed.

关键词： Decision support systems Manganese Cognitive radio Indexes Channel allocation

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共173页 << < 159 160 161 162 163 164 165 166 167 168 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：