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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,684 篇 会议
133 册 图书
89 篇 期刊文献

馆藏范围

2,905 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

1,531 篇 工学
- 1,138 篇 计算机科学与技术...
- 533 篇 软件工程
- 328 篇 电气工程
- 313 篇 信息与通信工程
- 158 篇 控制科学与工程
- 90 篇 生物医学工程（可授...
- 87 篇 机械工程
- 81 篇 生物工程
- 79 篇 电子科学与技术（可...
- 48 篇 光学工程
- 46 篇 仪器科学与技术
- 41 篇 动力工程及工程热...
- 39 篇 材料科学与工程（可...
- 37 篇 安全科学与工程
- 32 篇 化学工程与技术
- 27 篇 土木工程
- 27 篇 交通运输工程
621 篇 理学
- 418 篇 数学
- 116 篇 物理学
- 106 篇 生物学
- 77 篇 统计学（可授理学、...
- 68 篇 系统科学
- 41 篇 化学
241 篇 管理学
- 173 篇 管理科学与工程(可...
- 85 篇 图书情报与档案管...
- 74 篇 工商管理
93 篇 医学
- 65 篇 临床医学
- 52 篇 基础医学(可授医学...
- 29 篇 药学(可授医学、理...
36 篇 法学
- 31 篇 社会学
25 篇 经济学
25 篇 农学
10 篇 教育学
7 篇 文学
2 篇 哲学
2 篇 艺术学
1 篇 军事学

主题

410 篇 complexity theor...
293 篇 computational co...
103 篇 algorithm analys...
76 篇 computational mo...
72 篇 accuracy
67 篇 complexity
65 篇 artificial intel...
63 篇 algorithm design...
62 篇 optimization
57 篇 feature extracti...
55 篇 heuristic algori...
50 篇 training
48 篇 approximation al...
44 篇 computer communi...
44 篇 time complexity
42 篇 genetic algorith...
40 篇 simulation
40 篇 signal processin...
39 篇 decoding
39 篇 mathematical mod...

机构

9 篇 univ warwick dep...
7 篇 univ leicester d...
6 篇 univ western ont...
6 篇 algorithms and c...
6 篇 univ alberta edm...
5 篇 univ oxford comp...
5 篇 univ warwick sch...
4 篇 international is...
4 篇 state key labora...
4 篇 institut univers...
4 篇 faculty of compu...
4 篇 department of co...
4 篇 school of electr...
4 篇 international sc...
4 篇 imperial coll lo...
4 篇 univ calif berke...
4 篇 indian institute...
4 篇 the 38th researc...
3 篇 national mobile ...
3 篇 school of automa...

作者

6 篇 paschos vangelis...
6 篇 szeider stefan
5 篇 rodrigo c. de la...
4 篇 wolfson ouri
4 篇 jun zhang
4 篇 michael wooldrid...
4 篇 ziegler martin
4 篇 rishe naphtali
4 篇 ito sohei
4 篇 baumeister dorot...
3 篇 zeng yonghong
3 篇 wanjiang han
3 篇 hagihara shigeki
3 篇 habaebi mohamed ...
3 篇 nurhayati
3 篇 yuhui shi
3 篇 woeginger gerhar...
3 篇 férée hugo
3 篇 piotr faliszewsk...
3 篇 birks martin

语言

2,812 篇 英文
80 篇 其他
14 篇 中文
1 篇 俄文

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

共 2906 条记录，以下是261-270 订阅

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

详细简洁

排序：

Impact of Machine Learning on Applying the Best Worst Method for Social Sustainability in Manufacturing Supply Chains 7

Impact of Machine Learning on Applying the Best Worst Method...

引用

7th international conference on Circuit Power and Computing Technologies, ICCPCT 2024

作者： Yogi, Kottala Sri Dankan Gowda, V. Kumar Sahu, Atul Jagtap, Madan Mohanrao Srinivas, Ved Abdullah, Ibrahim International University Symbiosis Institute of Business Management Hyderabad Symbiosis Department of Operations Pune India BMS Institute of Technology and Management Department of Electronics and Communication Engineering Karnataka Bangalore India School of Studies in Engineering & Technology Department of Industrial and Production Engineering Koni Chattisgarh Bilaspur India Symbiosis Institute of Operations Management Department of Operations Management Nashik Campus Maharashtra Pune India Thiagarajar School of Management Department of Human Resources Tamil Nadu Madurai India Al-Turath University College Department of Computer Science Baghdad Iraq

ISBN: (纸本)9798350372816

this research is carried out merging ML with BWM to intensify decision making in manufacturing supply chain using social sustainability under light. As companies become more focused on environmental sustainability, the capability of machine learning to effectively assess and prioritize sustainability criteria should be highly valued. through a team of domain experts, the research clearly identifies the most vital social sustainability factors and, afterwards, deploys ML algorithms to analyze and optimize the provided decision-making framework by BWM. the selected approach gives possibility to dynamic weighting of the criteria which is based on real-time data. this way we are able to come up with the more precise and effective sustainability strategies. the results show that the hybrid ML-BWM model is not only an effective tool to enhance the validity and accuracy of evaluations but also one that provides the prudent directions that help the manufacturing sector shape its choice and responses. this paper analyzes the possible outcome of the integration of AI and traditional approach to decision-making process on social aspects of sustainability within supply chain. © 2024 IEEE.

关键词： Smart manufacturing

来源：评论

学校读者我要写书评

暂无评论

DVGN: A Differential Value Guidance Network for Underwater Objects Detection

DVGN: A Differential Value Guidance Network for Underwater O...

引用

Pattern Recognition and Artificial Intelligence (PRAI), international conference on

作者： Shijie Chen Xun Ji He Yang Xu Wang School of Marine Electrical Engineering Dalian Maritime University Dalian Liaoning China

ISBN: (数字)9798350350890

ISBN: (纸本)9798350350906

Although considerable progress has been made in optical underwater objects detection (UOD) in recent years, the task still faces great challenges due to the complexity of the underwater environment and the mimetic behaviour of underwater objects. Existing deep learning-based models usually do not consider the enhancement of underwater object features, resulting in inefficient UOD. In order to solve the above problems, this paper proposes a plug-and-play Differential Value Guidance Network (DVGN) for arbitrarily embedding into an existing model to improve the recognition performance of the model. the salient features of this paper are: 1) We propose a plug-and-play efficient feature fusion method. It can focus on features at different scales and enhance the recognition capability of objects at different scales underwater. 2) through a large number of experiments, it is proved that it can be embedded into different object detection algorithms to effectively improve the object detection capability with the smallest possible increase model parameters.

关键词： Oceans Redundancy Object detection Benchmark testing Feature extraction Pattern recognition complexity theory Artificial intelligence Faces

来源：评论

学校读者我要写书评

暂无评论

Pump-BSKZ: A Novel Sieve Algorithm to Solve Shortest Vector Problem

Pump-BSKZ: A Novel Sieve Algorithm to Solve Shortest Vector ...

引用

Computer Information Science and Application Technology (CISAT), international conference on

作者： Yuchen Pan Rui Jiang Bei Pei Gangyong Chen School of Cyber Science and Engineering Southeast University Nanjing China National Engineering Research Center of Classified Protection and Safeguard Technology for Cybersecurity Shanghai China

ISBN: (数字)9798350375107

ISBN: (纸本)9798350375114

To solve hard problems in lattices is a crucial topic in lattice-based cryptanalysis, where the Shortest Vector Problem (SVP) is one of the most famous lattice problems. Recently, there are two kinds of approaches to solve approximate SVP. the one is Block Korkine-Zolotarev (BKZ)-type lattice reduction algorithms combined with enumeration, which suffers from high time complexity. the other is sieving algorithms such as the General Sieve Kernel (G6K) algorithm, which requires exponential space cost. In order to solve the above problems, in this paper, we propose a novel sieve algorithm, named Pump-BSKZ, to solve the approximate SVP with low time complexity and limited space cost. Firstly, our Pump-BSKZ algorithm can reduce a random lattice basis to a basis with better quality. We design a Block wise Sieving Korbine-Zolotarev (BSKZ) algorithm and apply sieving as a subroutine for solving SVP in local blocks. Secondly, our Pump-BSKZ algorithm can solve SVP in lattice with higher dimension. Based on the reduced basis, we design an improved Pump-sieve algorithm to find a shortest vector in arbitrary n-dimensional lattices. thirdly, we give the formal proof of correctness for our Pump-BSKZ algorithm, then analyze time and space complexity. Finally, experiments done on TU Darmstadt SVP challenge in dimensions 90-130 reveal that our algorithm outperforms both BKZ 2.0 algorithm and G6K algorithm on time and space cost.

关键词： Information science Costs Sieving Lattices Approximation algorithms Vectors complexity theory Time complexity Kernel

来源：评论

学校读者我要写书评

暂无评论

A Multi-keyword Fuzzy Ciphertext Sorting Retrieval Scheme Based on Cloud Servers

A Multi-keyword Fuzzy Ciphertext Sorting Retrieval Scheme Ba...

引用

Computer Information Science and Application Technology (CISAT), international conference on

作者： Yutong Duan Yunshui Zheng School of Electronic and Information Engineering LanZhou Jiaotong University LanZhou China

ISBN: (数字)9798350375107

ISBN: (纸本)9798350375114

With the rapid development of cloud storage and cloud computing services, more and more individuals and enterprises choose to upload data to cloud servers for storage. To ensure data privacy and security, data is encrypted locally. Searchable encryption (SE) technology enables retrieval of encrypted data. this article uses the ASPE algorithm to design a multi-keyword fuzzy ciphertext sorting retrieval extension scheme based on cloud servers. Firstly, a document vector based on keyword partitioning was generated, and efficiency was improved through hierarchical retrieval on two cloud servers. Secondly, combined with the retrieval requirements of railway engineering data, a consistency check bit is designed using hash functions to compare the retrieved data, ensuring its correctness consistently. In the enhancement scheme, the concept of chaos and unilateral inverse matrixes are introduced to enhance the security of the key and make it suitable for multi-user scenarios. Finally, security analysis and time complexity comparison demonstrate that the ERFMS scheme is secure and efficient.

关键词： Chaos Cloud computing Smart contracts Vectors Partitioning algorithms Encryption Servers Time complexity Sorting Indexing

来源：评论

学校读者我要写书评

暂无评论

ConDVC: Bridging Visual and Semantic Spaces with Key Semantics for Video Understanding

ConDVC: Bridging Visual and Semantic Spaces with Key Semanti...

引用

algorithms, Computing and Artificial Intelligence (ACAI), international conference on

作者： Jianxiong Wang Jing Xiao School of Artificial Intelligence South China Normal University Foshan China School of Computer Science South China Normal University Guangzhou China

ISBN: (数字)9798331529314

ISBN: (纸本)9798331529321

Dense video captioning task aims to understand unsegmented video content for accurate event localization and captioning. Recent studies have focused on leveraging inter-task relationships to address this task. However, the complexity of cross-modal learning between video content and captions, particularly without prior knowledge guidance, presents significant challenges in jointly handling these two tasks. this paper introduces a Concept-Guided Dense Video Captioning framework (ConDVC) that uses concepts, i.e., key elements such as objects and actions, as a bridge linking visual and semantic spaces. By employing video-to-text retrieval to gather textual features and integrating these with multimodal features for concept detection, we utilize these concepts as semantic guides during the event matching process. this approach not only provides additional prior information for optimizing both subtasks, event localization and caption generation, but also leverages the prior knowledge capabilities of pretrained models like CLIP to enhance overall model performance. Extensive experiments on the YouCook2 and ActivityNet Captions datasets demonstrate the superiority of ConDVC against state-of-the-art methods without extra data for pretraining.

关键词： Location awareness Measurement Bridges Visualization Accuracy Semantics Feature extraction complexity theory Joining processes Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

A hybrid RBF-FD and WLS mesh-free strong-form approximation method 7

A hybrid RBF-FD and WLS mesh-free strong-form approximation ...

引用

7th international conference on Smart and Sustainable Technologies, SpliTech 2022

作者： Jancic, Mitja Kosec, Gregor JoÅ½ef Stefan Institute Parallel and Distributed Systems Laboratory Jamova cesta 39 Ljubljana1000 Slovenia JoÅ½ef Stefan International Postgraduate School Jamova cesta 39 Ljubljana1000 Slovenia

ISBN: (纸本)9789532901160

Since the advent of mesh-free methods as a tool for the numerical analysis of systems of Partial Differential Equations (PDEs), many variants of differential operator approximation have been proposed. In this work, we propose a local mesh-free strong-form method that combines the stability of Radial Basis Function-Generated Finite Differences (RBF-FD) with the computational effectiveness of Diffuse Approximation Method (DAM), forming a so-called hybrid method. To demonstrate the advantages of a hybrid method, we evaluate its computational complexity and accuracy of the obtained numerical solution by solving a two-dimensional Poisson problem with an exponentially strong source in the computational domain. Finally, we employ the hybrid method to solve a three-dimensional Boussinesq's problem on an isotropic half-space and show that the implementation overhead can be justified. © 2022 University of Split, FESB.

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

ClassA Entropy for the Analysis of Structural complexity of Physiological Signals 48

ClassA Entropy for the Analysis of Structural Complexity of ...

引用

48th IEEE international conference on Acoustics, Speech and Signal Processing, ICASSP 2023

作者： Xiao, Hongjian Li, Ling Mandic, Danilo P. Imperial College London Department of Electrical and Electronic Engineering LondonSW7 2AZ United Kingdom LondonEC1V 0HB United Kingdom

ISBN: (纸本)9781728163277

Despite the recent theoretical boom in Sample Entropy based algorithms for the analysis of physiological and pathological systems, the major issue which prevents their more widespread use remains that of large computational load, particularly in the studies of quantification of structural richness in data. this issue becomes even more prohibitive when it comes to large data sizes and real-time processing. To this end, a new Classification Angle (ClassA) Entropy is introduced for the quantification of structural complexity of real world signals, based on an improved Second Order Difference Plot and Shannon Entropy. In comparison with existing nonlinear techniques, including Real Sum Angle index, Phase Entropy, Gridded Distribution Entropy and Cosine Similarity Entropy, the proposed method offers the advantages of a minimal number of tunable parameters, lower requirement of data size, wider application field and large relaxation of computational load. Simulations on real world physiological data support the approach. © 2023 IEEE.

关键词： Physiology

来源：评论

学校读者我要写书评

暂无评论

Implicit-Explicit Error Indicator based on Approximation Order 7

Implicit-Explicit Error Indicator based on Approximation Ord...

引用

7th international conference on Smart and Sustainable Technologies, SpliTech 2022

作者： Jancic, Mitja Strnisa, Filip Kosec, Gregor Parallel and Distributed Systems Laboratory Joief Stefan Institute Joief Stefan International Postgraduate School Ljubljana Slovenia Parallel and Distributed Systems Laboratory Joief Stefan Institute Ljubljana Slovenia

ISBN: (纸本)9789532901160

With the immense computing power at our disposal, the numerical solution of partial differential equations (PDEs) is becoming a day-to-day task for modern computational scientists. However, the complexity of real-life problems is such that tractable solutions do not exist. this makes it difficult to validate the numerically obtained solution, so good error estimation is crucial in such cases. It allows the user to identify problematic areas in the computational domain that may affect the stability and accuracy of the numerical method. Such areas can then be remedied by either h- or p-adaptive procedures. In this paper, we propose to estimate the error of the numerical solution by solving the same governing problem implicitly and explicitly, using a different approximation order in each case. We demonstrate the newly proposed error indicator on the solution of a synthetic two-dimensional Poisson problem with tractable solution for easier validation. We show that the proposed error indicator has good potential for locating areas of high error. © 2022 University of Split, FESB.

关键词： Poisson equation

来源：评论

学校读者我要写书评

暂无评论

A Novel Approach to Managing Lower Face complexity in Signing Avatars 7

A Novel Approach to Managing Lower Face Complexity in Signin...

引用

7th Workshop on Sign Language Translation and Avatar Technology: the Junction of the Visual and the Textual Challenges and Perspectives, SLTAT 2022

作者： McDonald, John C. Wolfe, Rosalee Johnson, Ronan DePaul University Chicago United States

ISBN: (纸本)9791095546825

An avatar that produces legible, easy-to-understand signing is one of the essential components to an effective automatic signed/spoken translation system. Facial nonmanual signals are essential to natural signing, but unfortunately signing avatars still do not produce acceptable facial expressions, particularly on the lower face. this paper reports on an innovative method to create more realistic lip postures. the approach manages the complexity of creating lip postures, thus making fewer demands on the artists making them. the method will be integral to our efforts to develop libraries containing lip postures to support the generation of facial expressions for several sign languages. © European Language Resources Association (ELRA), licensed under CC-BY-NC 4.0.

关键词： Animation

来源：评论

学校读者我要写书评

暂无评论

On Fair Division with Binary Valuations Respecting Social Networks 8th

On Fair Division with Binary Valuations Respecting Social Ne...

引用

8th international conference on algorithms and Discrete Applied Mathematics

作者： Misra, Neeldhara Nayak, Debanuj Indian Inst Technol Gandhinagar India

ISBN: (纸本)9783030950170;9783030950187

We study the computational complexity of finding fair allocations of indivisible goods in the setting where a social network on the agents is given. Notions of fairness in this context are "localized", that is, agents are only concerned about the bundles allocated to their neighbors, rather than every other agent in the system. We comprehensively address the computational complexity of finding locally envy-free and Pareto efficient allocations in the setting where the agents have binary valuations for the goods and the underlying social network is modeled by an undirected graph. We study the problem in the framework of parameterized complexity. We show that the problem is computationally intractable even in fairly restricted scenarios, for instance, even when the underlying graph is a path. We show NP-hardness for settings where the graph has only two distinct valuations among the agents. We demonstrate W-hardness with respect to the number of goods or the size of the vertex cover of the underlying graph. We also consider notions of proportionality that respect the structure of the underlying graph.

关键词： Fair division Social networks Envy-freeness Parameterized complexity

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共291页 << < 23 24 25 26 27 28 29 30 31 32 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：