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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

22,879 篇 会议
9,164 篇 期刊文献
64 篇 学位论文

馆藏范围

32,107 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

16,066 篇 工学
- 10,144 篇 计算机科学与技术...
- 4,897 篇 电气工程
- 3,148 篇 软件工程
- 2,691 篇 信息与通信工程
- 1,964 篇 控制科学与工程
- 740 篇 机械工程
- 683 篇 电子科学与技术（可...
- 605 篇 航空宇航科学与技...
- 535 篇 仪器科学与技术
- 230 篇 交通运输工程
- 212 篇 材料科学与工程（可...
- 196 篇 化学工程与技术
- 171 篇 生物工程
- 156 篇 测绘科学与技术
- 137 篇 土木工程
- 135 篇 生物医学工程（可授...
- 133 篇 动力工程及工程热...
10,465 篇 理学
- 9,398 篇 数学
- 877 篇 物理学
- 768 篇 系统科学
- 742 篇 统计学（可授理学、...
- 265 篇 生物学
- 236 篇 化学
- 127 篇 地球物理学
2,499 篇 管理学
- 1,934 篇 管理科学与工程(可...
- 676 篇 工商管理
- 559 篇 图书情报与档案管...
418 篇 经济学
- 387 篇 应用经济学
211 篇 医学
- 175 篇 临床医学
180 篇 法学
- 167 篇 社会学
128 篇 文学
128 篇 农学
37 篇 教育学
27 篇 军事学
11 篇 艺术学
1 篇 哲学
1 篇 历史学

主题

32,107 篇 approximation al...
2,737 篇 algorithm design...
2,351 篇 optimization
2,306 篇 approximation me...
2,175 篇 heuristic algori...
1,424 篇 linear programmi...
1,418 篇 convergence
1,280 篇 computational mo...
1,216 篇 resource managem...
1,142 篇 signal processin...
957 篇 computer science
914 篇 clustering algor...
914 篇 polynomials
911 篇 complexity theor...
789 篇 mathematical mod...
753 篇 vectors
710 篇 programming
653 篇 estimation
621 篇 training
614 篇 transportation

机构

97 篇 univ maryland de...
68 篇 technion israel ...
55 篇 univ waterloo de...
49 篇 cornell univ dep...
44 篇 tsinghua univers...
39 篇 national institu...
39 篇 carnegie mellon ...
38 篇 iit dept comp sc...
35 篇 national mobile ...
34 篇 shandong univ sc...
32 篇 sichuan univ col...
31 篇 school of comput...
31 篇 nanjing univ sta...
29 篇 univ chinese aca...
29 篇 technion haifa
29 篇 princeton univ p...
29 篇 suny stony brook...
28 篇 epfl
28 篇 hong kong polyte...
28 篇 tel aviv univers...

作者

64 篇 woodruff david p...
64 篇 ravi r.
52 篇 kortsarz guy
45 篇 lee euiwoong
43 篇 levin asaf
41 篇 chan timothy m.
40 篇 kumar amit
37 篇 chen zhi-zhong
36 篇 friggstad zachar...
33 篇 kawarabayashi ke...
32 篇 manurangsi pasin
31 篇 wang lusheng
31 篇 chalermsook pari...
30 篇 gudmundsson joac...
29 篇 thai my t.
29 篇 williamson david...
29 篇 carmi paz
28 篇 saha barna
28 篇 zenklusen rico
27 篇 dinitz michael

语言

31,278 篇 英文
679 篇 其他
115 篇 中文
9 篇 日文
8 篇 俄文
3 篇 法文
2 篇 西班牙文
1 篇 土耳其文
1 篇 乌克兰文

检索条件"主题词=approximation algorithms"

共 32107 条记录，以下是4821-4830 订阅

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

详细简洁

排序：

Photorealistic image style transfer based on explicit affine transformation

Photorealistic image style transfer based on explicit affine...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Junjie Kang Jinsong Wu Shiqi Jiang School of Computer Science and Information Security Guilin University of Electronic Technology Guilin China School of Artificial Intelligence Guilin University of Electronic Technology Guilin China Department of Electrical Engineering University of Chile Santiago Chile

ISBN: (数字)9798350390155

ISBN: (纸本)9798350390162

Global or local style transfer often relies on matrix transformations [1], [2], [3], [4] [5]. In any scale of the image feature space, the representation of color can be seen as the projection result of the features at that scale onto different coordinate bases [1], [5]. Numerous studies have also demonstrated the validity of this approach. Starting from early non-neural network-based image style transfer algorithms, there have been approaches that utilize translation and scaling transformations to transform the coordinate bases of images, and most recently, the work of Neural Style Transfer [neural style preset] employs a simple network structure to predict the matrix parameters of affine *** believe that if we want to solve for the global affine transformation matrix, we can completely abandon neural networks and directly solve it through the statistical features of the original image. First, we employ the Euler method to iteratively optimize the squared loss of the covariance matrix, quickly obtaining the optimal transformation matrix. Then, based on this, we adopt a stepwise transformation approach, decomposing the affine transformation into translation, rotation, and scaling transformations. We first determine the translation transformation based on the statistical differences between the content image and the style image. Then, by leveraging the distance-preserving property of rotation transformations, we provide the analytical form of the rotation matrix. Furthermore, we use basis transformation to nonlinearly blend and superimpose image channels, and solve for the optimal rotation matrix under different blending modes. Finally, we linearly combine the rotation matrices under different blending modes to obtain the final approximate result. Extensive experiments have demonstrated that the approximate solution can achieve results comparable to numerical solutions in image and video color transfer tasks. Meanwhile, our algorithm achieves near-opti

关键词： Runtime Image color analysis Neural networks Transforms Streaming media approximation algorithms Prediction algorithms

来源：评论

学校读者我要写书评

暂无评论

Dynamic Slice-Based Privacy-Preserving Data Aggregation for UWSNs

Dynamic Slice-Based Privacy-Preserving Data Aggregation for ...

引用

IEEE Conference on Global Communications (GLOBECOM)

作者： Pengcheng Li Rongxin Zhu Azzedine Boukerche Qiuling Yang School of Computer Science Hainan University Haikou China EECS University of Ottawa Ottawa Canada

ISBN: (数字)9798350351255

ISBN: (纸本)9798350351262

Underwater Wireless Sensor Networks (UWSNs) are integral to marine exploration yet confront significant security concerns. In contrast to terrestrial WSNs, underwater acoustic channels are characterized by their constrained bandwidth, considerable propagation delays, and a higher bit error rate. These factors facilitate adversaries’ ability to intercept network transmissions and acquire sensitive data. Furthermore, the constraints of energy resources in UWSNs pose additional challenges in harmonizing privacy preservation with energy conservation. This study introduces a novel Privacy-Preserving Data Fusion Algorithm (DSPDA) tailored for UWSNs. The DSPDA circumvents the shortcomings of conventional privacy algorithms by employing dynamic sharding to minimize transmission demands and augment data fusion precision, which adjusts the size of data shards relative to nodal distances, thereby safeguarding confidentiality. Furthermore, it enhances network-wide energy optimization by aligning the energy consumption of cluster heads with their respective child nodes, thus averting disproportionate energy depletion and potential network dysfunction. Our simulation results demonstrate that the DSPDA algorithm notably diminishes communication overhead by approximately 37% in comparison to the SMART algorithm and delivers a further 20% efficiency improvement over the EEHA algorithm.

关键词： Wireless sensor networks Privacy Energy consumption Data privacy Heuristic algorithms Simulation Clustering algorithms Data aggregation approximation algorithms Protection

来源：评论

学校读者我要写书评

暂无评论

q-rung orthopair neutrosophic fuzzy rough sets with an application based on multi-criteria decision-making

q-rung orthopair neutrosophic fuzzy rough sets with an appli...

引用

International Conference on Soft Computing and Machine Intelligence (ISCMI)

作者： Kamalpreet Kaur Asha Gupta Department of Mathematics Punjab Engineering College (Deemed to be University) Chandigarh India

ISBN: (数字)9798331518127

ISBN: (纸本)9798331518134

Fuzzy set theory, introduced in the 1960s, has grown significantly through various generalizations, including intuitionistic, pythagorean, and fermatean fuzzy sets. These extensions enhance the theory’s flexibility in managing uncertainty. Also, q-rung orthopair fuzzy sets extend these concepts by broadening the scope of hesitation, offering a more versatile tool for decision-making. Neutrosophic fuzzy sets further incorporate three membership degrees—truth, indeterminacy, and falsity to handle uncertainty better. Meanwhile, rough set theory excels at addressing indiscernibility through relations and approximations. Combining these strengths, q-rung orthopair neutrosophic fuzzy rough sets are introduced in this paper. Based on the proposed theory, an algorithm is designed to rank the alternatives based on various criteria and then an application is discussed, where a student uses the proposed theory to choose the best university from the given choices.

关键词： Fuzzy sets Uncertainty Decision making Rough sets approximation algorithms Fuzzy set theory Machine intelligence

来源：评论

学校读者我要写书评

暂无评论

Solving the Aircraft Landing Problem Using Deep Q-Networks Approach

Solving the Aircraft Landing Problem Using Deep Q-Networks A...

引用

International Conference on Management of Large-Scale System Development (MLSD)

作者： Vladislav Sosedov Matvey Makarevich Elena Kulida Laboratory of Decision Support Systems V.A. Trapeznikov Institute of Control Sciences of RAS Moscow Russia

The article considers the Aircraft Landing Problem (ALP) for the static single runway case and proposes a novel approach based on Deep Q-Networks reinforcement learning algorithm. The proposed approach has the potenti... 详细信息

ISBN: (数字)9798350375718

ISBN: (纸本)9798350375725

关键词： Training Accuracy Neural networks Reinforcement learning Production approximation algorithms Real-time systems Air traffic control Aircraft Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Coordinated Sampling in SDNs with Dynamic Flow Rates

Coordinated Sampling in SDNs with Dynamic Flow Rates

引用

International Conference on Network and Service Management

作者： Soroosh Esmaeilian Mahdi Dolati Sogand Sadrhaghighi Majid Ghaderi Dept. of Computer Science University of Calgary Calgary Canada School of Computer Science IPM Tehran Iran

ISBN: (数字)9783903176669

ISBN: (纸本)9798331505158

Traffic sampling has become an indispensable tool in network management. While there exists a plethora of sampling systems, they generally assume flow rates are stable and predictable over a sampling period. Consequently, when deployed in networks with dynamic flow rates, some flows may be missed or under-sampled, while others are over-sampled. This paper presents the design and evaluation of dSamp, a network-wide sampling system capable of handling dynamic flow rates in Software-Defined Networks (SDNs). The key idea in dSamp is to consider flow rate fluctuations when deciding on which network switches and at what rate to sample each flow. To this end, we develop a general model for sampling allocation with dynamic flow rates, and then design an efficient approximate integer linear program called APX that can be used to compute sampling allocations even in large-scale networks. To show the efficacy of dSamp for network monitoring, we have implemented APX and several existing solutions in ns-3 and conducted extensive experiments using model-driven simulations. Our results indicate that, by considering dynamic flow rates, APX outperforms the existing solutions by up to 10% in sampling more flows at a given sampling rate.

关键词： Fluctuations Computational modeling Dynamic scheduling approximation algorithms Resource management Software defined networking Computational complexity Monitoring

来源：评论

学校读者我要写书评

暂无评论

Frequency sampling scheme for effective MIMO-OFDM channel estimation with SALSA and LS algorithms

Frequency sampling scheme for effective MIMO-OFDM channel es...

引用

Telecommunications Forum (TELFOR)

作者： Anastasia Aderkina Mikhail Makurin Roman Semernya Vladimir Lyachev Huawei Technologies Co. Ltd

ISBN: (数字)9798350391060

ISBN: (纸本)9798350391077

In this paper we consider the channel estimation problem in MIMO-OFDM system, when the base station has a hybrid architecture of antenna array. Considering uplink CE, overhead reduction for pilot resources in time/frequency OFDM grid was studied. Utilizing properties of channel decomposition via sum of Kronecker product factors and applying Tucker format decomposition for every decomposition term, SALSA (Sequential Alternating Least Squares approximation) algorithm was applied for partial channel tensor reconstruction on regularly measured sub-carrier frequencies. LS (Least Square) algorithm was used to reconstruct the whole channel tensor after partial channel tensor estimation at comb frequencies. Additionally, we investigated schemes where sub-carriers set is different for different OFDM symbols. It was shown that significant reduction of pilot sub-carriers can be achieved while keeping good accuracy of CE if positions of regular sampling patterns with large period are shifted in frequency during multiple consecutive symbols. Simulations show the effectiveness of the proposed method of channel estimation by SALSA and LS algorithms in comparison with fixed set of sub-carriers.

关键词： Correlation coefficient Tensors OFDM Channel estimation Symbols approximation algorithms Frequency estimation MIMO Uplink Antenna arrays

来源：评论

学校读者我要写书评

暂无评论

Hybrid Classical-Quantum Simulation of MaxCut using QAOA-in-QAOA

Hybrid Classical-Quantum Simulation of MaxCut using QAOA-in-...

引用

IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Aniello Esposito Tamuz Danzig EMEA Research Lab Hewlett Packard Enterprise Basel Switzerland Classiq Technologies Tel Aviv Israel

ISBN: (数字)9798350364606

ISBN: (纸本)9798350364613

The Quantum approximate optimization algorithm (QAOA) is a leading hybrid classical-quantum algorithm for solving complex combinatorial optimization problems. QAOA-in-QAOA (QAOA 2 ) uses a divide-and-conquer heuristic to solve large-scale Maximum Cut (MaxCut) problems, where many sub-graph problems can be solved in parallel. In this work, an implementation of the QAOA 2 method for the scalable solution of the MaxCut problem is presented, based on the Classiq platform. The framework is executed on an HPE-Cray EX supercomputer by means of the Message Passing Interface (MPI) and the SLURM workload manager. The limits of the Goemans-Williamson (GW) algorithm as a purely classical alternative to QAOA are investigated to understand if QAOA 2 could benefit from solving certain sub-graphs classically. Results from large-scale simulations of up to 33 qubits are presented, showing the advantage of QAOA in certain cases and the efficiency of the implementation, as well as the adequacy of the workflow in the preparation of real quantum devices. For the considered graphs, the best choice for the sub-graphs does not significantly improve results and is still outperformed by GW.

关键词： Analytical models Message passing Conferences Qubit Knowledge based systems Quantum mechanics approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

A Novel Low-Complexity Massive MIMO Detector with Near-Optimum Performance

A Novel Low-Complexity Massive MIMO Detector with Near-Optim...

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： Jinjie Hu Suwen Song Zhongfeng Wang School of Electronic Science and Engineering Nanjing University Nanjing China School of Integrated Circuits Sun Yat-sen University Shenzhen China

ISBN: (数字)9798350330991

ISBN: (纸本)9798350331004

In massive multiple-input multiple-output (MIMO) detection, likelihood ascent search (LAS) is well-known for its near-optimum performance with low complexity. It employs gradient descent to enhance the performance of suboptimal MIMO detectors, specifically minimum mean-square error (MMSE). In this paper, we introduce several new techniques to improve the MMSE-based LAS in terms of either complexity or performance. The MMSE is first replaced with optimized coordinate descent algorithm (OCD), which performs near MMSE with lower complexity. Then, the conventional OCD and LAS are reformulated and approximated to better reuse the computation for gradient descent, which is required in both algorithms. Besides, we also optimize the search strategy of LAS, leading to the improvement in both complexity and performance. The proposed detector, modulation-based successive gradient descent (MB-SGD) algorithm, outperforms MMSE-LAS and the latest low-complexity near-optimum detector in terms of either complexity or performance for 64×8 and 128×8 MIMO systems under 256-QAM. The corresponding architecture for a 128 × 8 256-QAM MIMO system has 75.8% lower latency, 2.02 × higher area efficiency, and 0.3 dB gain when implemented on a ×Xilinx Virtex-7 FPGA compared to OCD’s.

关键词： Circuits and systems Detectors Mean square error methods Massive MIMO Computer architecture approximation algorithms Search problems

来源：评论

学校读者我要写书评

暂无评论

Fast RCS Simulation of Target on the Sea Surface Based on the SBR and Advanced Two-scale Method

Fast RCS Simulation of Target on the Sea Surface Based on th...

引用

Progress in Electromagnetic Research Symposium (PIERS)

作者： Siyuan Wang Zi He Dazhi Ding Lin Liu Ying Zhou Nanjing University of Science and Technology Nanjing China Beijing Institute of Remote Sensing Equipment China

ISBN: (数字)9798350375909

ISBN: (纸本)9798350375916

Plenty of evidence show that the rough sea surface plays a leading role with regard to the composite electromagnetic scattering of the sea surface and the target. Shooting and Bouncing Ray (SBR) tracing mentioned in the related literature may encounter the following two problems. One is that the calculation time to consider the coupling between the two will be greatly increased under fine subdivision. The other is that the calculation accuracy is not high when the sea surface is simulated as a plane. In this paper, the hybrid calculation of Shooting and Bouncing Ray tracing and semi-deterministic complex sea surface with two-scale algorithm is used to predict the electromagnetic scattering. When a ray is irradiated to a surface element on the rough sea surface, a two-scale (KA+AIEM) algorithm is used to calculate the current scattering field. Using the two-scale algorithm, specifically, the scattering contribution of large scale rough surface is calculated by Kirchhoff approximation method and the improved integral equation method is used for the small scale, more accurate electromagnetic scattering calculation can be obtained. This algorithm can effectively shorten the time of sea surface calculation. When the ray is reflected between the target and the rough surface it is necessary to consider the Fresnel reflection coefficient to modify the reflection coefficient. Numerical results show that the scattering intensity of the incident wave is the largest in the mirror direction under different incident angles. Meanwhile, the side of the target and the sea surface form sometimes strong and sometimes weak coupling due to the change of the angle between the target and the sea surface, and the dominant of complex scattering will also change.

关键词： Couplings Sea surface Accuracy Surface waves Electromagnetic scattering Prediction algorithms approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

A Lossless Deamortization for Dynamic Greedy Set Cover

A Lossless Deamortization for Dynamic Greedy Set Cover

引用

Annual IEEE Symposium on Foundations of Computer Science

作者： Shay Solomon Amitai Uzrad Tianyi Zhang Tel Aviv University Tel Aviv Israel

ISBN: (数字)9798331516741

ISBN: (纸本)9798331516758

The dynamic set cover problem has been subject to growing research attention in recent years. In this problem, we are given as input a dynamic universe of at most $n$ elements and a fixed collection of $m$ sets, where each element appears in a most $f$ sets and the cost of each set is in [1/C, 1], and the goal is to efficiently maintain an approximate minimum set cover under element updates. Two algorithms that dynamize the classic greedy algorithm are known, providing $O(\log n)$ and $((1+\epsilon)\ln n)$ -approximation with amortized update times $O(f \log n)$ and, $O(\frac{f \log n}{\epsilon})$ , respectively [GKKP (STOC'17); SU (STOC'23)]. The question of whether one can get approximation $O(\log n)$ (or even worse) with low worst-case update time has remained open — only the naive $O(f\cdot n)$ time bound is known, even for unweighted instances. In this work we devise the first amortized greedy algorithm that is amenable to an efficient deamortization, and also develop a lossless deamortization approach suitable for the set cover problem, the combination of which yields a $((1+\epsilon)\ln n){-}$ approximation algorithm with a worst-case update time of $O(\frac{f \log n}{\epsilon^approximation})$ . Our worst-case time bound — the first to break the naive $O(f\cdot n)$ bound — matches the previous best amortized bound, and actually improves its $\epsilon$ -dependence. Further, to demonstrate the applicability of our deamortization approach, we employ it, in conjunction with the primal-dual amortized algorithm of [BHN (FOCS'19)], to obtain a $((1+\epsilon)f)$ -approximation algorithm with a worst-case update time of $O(\frac{f \log n}{\epsilon^approximation})$ , improving over the previous best bound of $O(\frac{f \cdot \log ^approximation(C n)}{-3})\ [$ BHNW (SODA'21)]. Finally, as direct implications of our results for set cover, we (i) achieve the first nontrivial worst-case update time for the dominating set problem, and (ii) impr

关键词： Greedy algorithms Computer science Costs Heuristic algorithms approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 479 480 481 482 483 484 485 486 487 488 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：