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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

4,493 篇 会议
2,967 篇 期刊文献
67 册 图书

馆藏范围

7,527 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

4,755 篇 工学
- 3,660 篇 计算机科学与技术...
- 3,010 篇 软件工程
- 1,056 篇 信息与通信工程
- 595 篇 控制科学与工程
- 581 篇 生物工程
- 503 篇 电气工程
- 356 篇 生物医学工程（可授...
- 341 篇 电子科学与技术（可...
- 318 篇 机械工程
- 261 篇 光学工程
- 199 篇 动力工程及工程热...
- 178 篇 化学工程与技术
- 169 篇 安全科学与工程
- 166 篇 网络空间安全
- 165 篇 交通运输工程
- 154 篇 仪器科学与技术
2,251 篇 理学
- 1,319 篇 数学
- 635 篇 生物学
- 428 篇 物理学
- 412 篇 统计学（可授理学、...
- 230 篇 系统科学
- 190 篇 化学
1,457 篇 管理学
- 860 篇 管理科学与工程(可...
- 640 篇 图书情报与档案管...
- 344 篇 工商管理
358 篇 医学
- 301 篇 临床医学
- 270 篇 基础医学(可授医学...
- 157 篇 公共卫生与预防医...
- 154 篇 药学(可授医学、理...
206 篇 法学
- 161 篇 社会学
130 篇 经济学
98 篇 教育学
85 篇 农学
19 篇 文学
18 篇 艺术学
13 篇 军事学
1 篇 哲学
1 篇 历史学

主题

218 篇 training
207 篇 deep learning
205 篇 feature extracti...
180 篇 computational mo...
165 篇 semantics
161 篇 machine learning
154 篇 educational inst...
150 篇 accuracy
141 篇 computer science
123 篇 optimization
122 篇 software enginee...
122 篇 predictive model...
122 篇 data models
105 篇 cloud computing
104 篇 data mining
101 篇 internet of thin...
91 篇 security
85 篇 neural networks
84 篇 artificial intel...
82 篇 clustering algor...

机构

1,220 篇 college of compu...
156 篇 college of compu...
129 篇 shenzhen univers...
115 篇 college of compu...
107 篇 college of compu...
102 篇 college of compu...
97 篇 college of compu...
93 篇 software college...
91 篇 state key labora...
80 篇 school of softwa...
72 篇 school of comput...
66 篇 national enginee...
62 篇 college of compu...
58 篇 the college of c...
58 篇 college of compu...
57 篇 college of softw...
57 篇 state key labora...
56 篇 college of compu...
53 篇 school of inform...
48 篇 college of softw...

作者

61 篇 shen linlin
48 篇 jingsha he
44 篇 leung victor c.m...
36 篇 laizhong cui
34 篇 zhong ming
34 篇 he jingsha
33 篇 lin qiuzhen
32 篇 zhen ji
32 篇 wang xingwei
31 篇 victor c. m. leu...
30 篇 kaishun wu
30 篇 jianqiang li
29 篇 ismail leila
28 篇 zhou jie
26 篇 leung victor c. ...
25 篇 niyato dusit
25 篇 huang min
25 篇 yan li
25 篇 li yan
24 篇 wu kaishun

语言

7,091 篇 英文
309 篇 其他
132 篇 中文
3 篇 日文
2 篇 朝鲜文

检索条件"机构=Software Engineering in College of Computer Science"

共 7527 条记录，以下是451-460 订阅

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

详细简洁

排序：

WIP: Concept Maps for computer Organization: A Systematic Study 54

WIP: Concept Maps for Computer Organization: A Systematic St...

引用

54th IEEE Frontiers in Education Conference, FIE 2024

作者： Belkhouche, F. Bendjilali, K. Shippensburg University of Pennsylvania Department of Computer Electrical and Software Engineering ShippensburgPA United States Raritan Valley Community College Department of Mathematics and Computer Science BranchburgNJ United States

ISBN: (纸本)9798350351507

This research-to-practice WIP paper describes concept maps for computer organization. A concept map is a tool that can be used to describe the relationship between the topics (or concepts) in a specific field of study. Concept maps are used in a variety of applications to improve curricula and assessment, particularly in K12 and undergraduate STEM education. In this paper we use concept maps for modeling computer organization topics and assess their importance with respect to the depth and breadth levels required for computer science and engineering graduates. The proposed concept maps focus on two aspects: The first one is the idea of the centrality of the topics. Centrality is an important concept in graph theory. Each topic in the concept map is given a level of centrality or a centrality index. The second aspect is the relationship between the topics, particularly between the topics with high level of centrality. The objective of the modeling is to identify the most central topics and come up with a set of more standard learning outcomes for undergraduate level computer organization courses. © 2024 IEEE.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Dynamic Topology Management In Ad-Hoc Networks For Improved Performance 2

Dynamic Topology Management In Ad-Hoc Networks For Improved ...

引用

2nd IEEE International Conference on Advances in Information Technology, ICAIT 2024

作者： Anakath, A.S. Kannadasan, R. Margarat, G. Simi Pandian, A. Pasumpon Antony Sibiya Varghese, V. Department of Computer Science and Engineering Saveetha School of Engineering Saveetha Institute of Medical and Technical Sciences Tamil Nadu Chennai India Department of Software Systems School of Computer Science and Engineering Vellore Institute of Technology VIT University Tamil Nadu Vellore India Department of Computer Science and Engineering New Prince Shri Bhavani College of Engineering and Technology Tamil Nadu Chennai India Department of Computer Science and Engineering CARE College of Engineering Trichy India Department of Artificial Intelligence and Data Science GRT Institute of Engineering and Technology Tamil Nadu Tiruttani India

ISBN: (纸本)9798350383867

Optimization in ad hoc networks is a highly specialized task because the structure of the network is loosely formed, and each node is independently responsible for its operation. In order to obtain a better result from this solely formed networks this report offer extensive Dynamic Topology Management (DTM) method. Dynamic routing protocols lager lines, dividend balancing, Life-saving administration, guarantee of reliability, cross-layer design, security aspects and the on-time monitoring and discovery of topology changes are the main objectives and steps to be accomplished. Real-time Location monitoring and forest structure discovery are made possible by employing adaptive routing protocols, namely Dynamic Source Routing(DSR) and Ad-Hoc On-Demand Distance Vector(AODV). Also, the algorithms are capable of making advance adjustments to routing routes and resource allocations drawn from the mobility patterns forecasting which is vital. Load balancing methods, which distribute traffic in a network evenly, enable the system to run efficiently and avoid problems caused by overloading. Algorithms that are energy-efficient and make the best use of energy resources having their topology's optimized are introduced to the streamlined energy distribution systems. These algorithms are focused on the node's energy level. Through fault tolerance techniques which recognize and handle failures in nodes and partitioned networks, connectedness activity is a continuous one. Through QoS perception, the network topology might automatically be tailored to conform to the given quality criteria, thus not restricting the choice for differing applications. The proposed could have defenses against adversary nodes and their potential DDoS attacks which will enhance network protection. Yet another advantage of an architectural style that promotes cross-layer collaboration is enhanced topology management which is the goal around which the functions of various levels of the protocol stack revolve

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

GoMatching: A Simple Baseline for Video Text Spotting via Long and Short Term Matching 38

GoMatching: A Simple Baseline for Video Text Spotting via Lo...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： He, Haibin Ye, Maoyuan Zhang, Jing Liu, Juhua Du, Bo Tao, Dacheng School of Computer Science National Engineering Research Center for Multimedia Software Institute of Artificial Intelligence Wuhan University China College of Computing & Data Science Nanyang Technological University Singapore

Beyond the text detection and recognition tasks in image text spotting, video text spotting presents an augmented challenge with the inclusion of tracking. While advanced end-to-end trainable methods have shown commendable performance, the pursuit of multi-task optimization may pose the risk of producing sub-optimal outcomes for individual tasks. In this paper, we identify a main bottleneck in the state-of-the-art video text spotter: the limited recognition capability. In response to this issue, we propose to efficiently turn an off-the-shelf query-based image text spotter into a specialist on video and present a simple baseline termed GoMatching, which focuses the training efforts on tracking while maintaining strong recognition performance. To adapt the image text spotter to video datasets, we add a rescoring head to rescore each detected instance's confidence via efficient tuning, leading to a better tracking candidate pool. Additionally, we design a long-short term matching module, termed LST-Matcher, to enhance the spotter's tracking capability by integrating both long- and short-term matching results via Transformer. Based on the above simple designs, GoMatching delivers new records on ICDAR15-video, DSText, BOVText, and our proposed novel test set with arbitrary-shaped text termed ArTVideo, which demonstrates GoMatching's capability to accommodate general, dense, small, arbitrary-shaped, Chinese and English text scenarios while saving considerable training budgets. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An Analysis on Cognitive Radio Adhoc Networks: Categories, Problems, and Solutions 1

引用

14th International Conference on Soft Computing and Pattern Recognition, SoCPaR 2022, and the 14th World Congress on Nature and Biologically Inspired Computing, NaBIC 2022

作者： Vinya, Viyyapu Lokeshwari Sahithi, G. Gopal, S. Venu Rao, G. Venkateswara Shaikh, Mehwish Department of Computer Science and Engineering Vardhaman College of Engineering Telangana Shamshabad India Department of Computer Science and Engineering CVR College of Engineering Telangana Ibrahimpatnam India Department of Artificial Intelligenceand Data Science Vardhaman College of Engineering Telangana Shamshabad India Department of Computer Science and Engineering GIT GITAM-Deemed to be University A.P. Visakhapatnam India Department of Software Engineering Mehran University of Engineering and Technology Jamshoro Pakistan

ISBN: (数字)9783031275241

ISBN: (纸本)9783031275234

The exploitation of finite spectrum resources is being addressed by the new technology known as Cognitive Radio (CR). It has emerged as a potential remedy for the spectrum shortage problem in the following generation of cellular networks by utilizing opportunities in the time, frequency, and spatial domains. Many group-oriented applications that are created for CRAHN deployment have grown significantly in relevance in recent years. Multicasting is a more effective method for enabling applications that rely on group communication. In contrast to traditional wired multicast routing protocols, multicast routing for CRNs must manage a range of challenges, because of the characteristics of CRNs, such as low bandwidth, mobility, and low power. In this paper, we discussed about various types, issues and solutions for CRAHN routing, Multicast Routing, Channel Assignment and Load balancing. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Multicasting

来源：评论

学校读者我要写书评

暂无评论

Cooperative-competitive Game-based Method for Local Path Planning with Obstacle Avoidance in Racing Scenarios 41

Cooperative-competitive Game-based Method for Local Path Pla...

引用

第41届中国控制会议

作者： Lina Li Quan Yuan Shuai Li Chen Wang Guangming Xie College of Computer Science and Technology Changchun University College of Engineering Peking University National Engineering Research Center of Software Engineering Peking University

ISBN: (数字)9789887581536

ISBN: (纸本)9781665482561

In this paper,a cooperative-competitive game based planning method(CCGP) is proposed to address the local path planning with obstacle avoidance in racing *** the racing,the robots in the same group cooperate with each other to achieve the goal,while competing with another group of *** goal of each group of robots is to reach the same target point ahead of the other group of robots,and there is no collision with other robots and static *** cooperation competition relationship is described as a cooperation competition game in *** objective function of each robot is formulated as an optimization problem,and the collision avoidance in robot-robot and robot-obstacle is regarded as *** rationality of the proposed objective function in the local path planning problem is theoretically *** MPC is used iteratively to compute the approximate optimal local trajectory of each robot under Nash equilibrium by considering the best response of other robots,without collision with other robots and *** compare our method with the MPC method by conducting racing simulations in a scene with static *** results show that our method has better performance,and the robots in our group can obstruct and overtake robots of the MPC group,while they avoiding collision with teammates and static obstacles.

关键词： local path planning cooperative-competitive game collision avoidance Nash equilibrium obstacle avoidance

来源：评论

学校读者我要写书评

暂无评论

Can end-user feedback in social media be trusted for software evolution: Exploring and analyzing fake reviews

Can end-user feedback in social media be trusted for softwar...

引用

作者： Khan, Javed Ali Ullah, Tahir Khan, Arif Ali Yasin, Affan Akbar, Muhammad Azeem Aurangzeb, Khursheed Department of Computer Science Faculty of Physics Engineering and Computer Science University of Hertfordshire Hatfield United Kingdom School of Computer & Technology Beijing Institute of Technology Beijing China M3S Empirical Software Engineering Research Unit University of Oulu Oulu Finland School of Software Northwestern Polytechnical University Shaanxi Xian China Software Engineering Department Lappeenranta-Lahti University of Technology Lappeenranta Finland Department of Computer Engineering College of Computer and Information Sciences King Saud University Riyadh Saudi Arabia

End-user feedback in social media platforms, particularly in the app stores, is increasing exponentially with each passing day. software researchers and vendors started to mine end-user feedback by proposing text analytics methods and tools to extract useful information for software evolution and maintenance. In addition, research shows that positive feedback and high-star app ratings attract more users and increase downloads. However, it emerged in the fake review market, where software vendors started incorporating fake reviews against their corresponding applications to improve overall software ratings. For this purpose, we conducted an exploratory study to understand how end-users register and write fake reviews in the Google Play Store. We curated a research data set containing 68,000 end-user comments from the Google Play Store and a fake review generator, that is, the Testimonial generator (TG). Its purpose is to understand fake reviews on these platforms and identify the common patterns potential end-users and professionals use to report fake reviews by critically analyzing the end-user feedback. We conducted a detailed survey at the University of science and Technology Bannu, Pakistan, to identify the intelligence and accuracy of crowd-users in manually identifying fake reviews. In addition, we developed a ground truth to be compared with the results obtained from the automated machine and deep learning (M&DL) classifier experiment. In the survey, 512 end-users participated and recorded their responses in identifying fake reviews. Finally, various M&DL classifiers are employed to classify and identify end-user reviews into real and fake to automate the process. Unlike humans, the M&DL classifiers performed well in automatically classifying reviews into real and fake by obtaining much higher accuracy, precision, recall, and f-measures. The accuracy of manually identifying fake reviews by the crowd-users is 44.4%. In contrast, the M&DL classifiers obtained an

关键词： Application programs

来源：评论

学校读者我要写书评

暂无评论

Generating Black-box Audio Adversarial CAPTCHAs based on Differential Evolution Algorithm

Generating Black-box Audio Adversarial CAPTCHAs based on Dif...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Xinhao Liu Hao Yang Qiao Yan College of Computer Science and Software Engineering Shenzhen University

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

Audio adversarial CAPTCHAs are commonly used on various websites and applications to distinguish human users from automated programs. However, recent advances in deep learning have given rise to several audio recognition methods that pose a challenge to the security of audio CAPTCHAs. In this paper, we propose DE _ES, a novel approach based on the differential evolution algorithm, for generating audio adversarial CAPTCHAs. Our method utilizes a momentum probability update technique to add random noise to the examples and combines differential evolution with gradient estimation to enhance the success rate of attacks. We evaluate the similarity between the adversarial examples and the original examples using audio data visualization techniques. Moreover, we apply our method to generate adversarial CAPTCHAs for two usage scenarios of audio CAPTCHAs: input-based and selection-based, respectively, to demonstrate the feasibility of the proposed algorithm. Our experimental results demonstrate that DE_ES outperforms other heuristic-based generation methods in terms of the success rate of generating audio adversarial examples, while maintaining a lower average editing distance. Thus, our method provides an effective solution for generating robust audio adversarial CAPTCHAs that can, to a certain extent, withstand the attacks of deep learning models, thereby improving the security of voice-based authentication systems.

关键词： Deep learning Federated learning Noise Estimation Data visualization Closed box Authentication

来源：评论

学校读者我要写书评

暂无评论

A Multistage Framework for Detection of Very Small Objects 23

A Multistage Framework for Detection of Very Small Objects

引用

6th International Conference on Machine Vision and Applications, ICMVA 2023

作者： Don, Duleep Rathgamage Aygun, Ramazan Karakaya, Mahmut School of Data Science and Analytics College of Computing and Software Engineering Kennesaw State University MariettaGA30060 United States Department of Computer Science College of Computing and Software Engineering Kennesaw State University MariettaGA30060 United States

ISBN: (纸本)9781450399531

Small object detection is one of the most challenging problems in computer vision. Algorithms based on state-of-the-art object detection methods such as R-CNN, SSD, FPN, and YOLO fail to detect objects of very small sizes. In this study, we propose a novel method to detect very small objects, smaller than 8×8 pixels, that appear in a complex background. The proposed method is a multistage framework consisting of an unsupervised algorithm and three separately trained supervised algorithms. The unsupervised algorithm extracts ROIs from a high-resolution image. Then the ROIs are upsampled using SRGAN, and the enhanced ROIs are detected by our two-stage cascade classifier based on two ResNet50 models. The maximum size of the images used for training the proposed framework is 32×32 pixels. The experiments are conducted using rescaled German Traffic Sign Recognition Benchmark dataset (GTSRB) and downsampled German Traffic Sign Detection Benchmark dataset (GTSDB). Unlike MS COCO and DOTA datasets, the resulting GTSDB turns out to be very challenging for any small object detection algorithm due to not only the size of objects of interest but the complex textures of the background as well. Our experimental results show that the proposed method detects small traffic signs with an average precision of 0.332 at the intersection over union of 0.3. © 2023 ACM.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Rapper: A Parameter-Aware Repair-in-Memory Accelerator for Blockchain Storage Platform

Rapper: A Parameter-Aware Repair-in-Memory Accelerator for B...

引用

IEEE Symposium on High-Performance computer Architecture

作者： Chenlin Ma Yingping Wang Fuwen Chen Jing Liao Yi Wang Rui Mao College of Computer Science and Software Engineering Shenzhen University

Blockchain storage platforms reward storage nodes for keeping user-uploaded data for a certain amount of time. These storage nodes are unstable and can go online or offline unpredictably at any time, leading to potential data loss. To prevent data loss, blockchain storage platforms adopt erasure codes on user-uploaded encrypted data. Data repair processes will be performed to recover the lost data. However, the data repair processes heavily rely on time-consuming erasure coding algorithms, mainly consisting of vector-matrix multiplications. The emerging processing-in-memory technique can efficiently speed up the processing of vector-matrix multiplications. It can be integrated into blockchain storage platforms to solve the data repair issue. This paper presents Rapper, a parameter-aware repair-inmemory accelerator for blockchain storage platforms. Rapper utilizes the computing power of emerging processing-in-memory architecture so that data repair processes can be processed in a parallel manner and the overall efficiency can be improved significantly. Specifically, at the hardware level, the ReRAM memory is reorganized into our proposed double bank, XRU, XGroup, and ReRAM crossbars structure. At the software level, a parallel decoding/encoding strategy is proposed to fully exploit the internal parallelism of ReRAM. We also propose an adaptive parameter-aware mapping to handle various sizes of stripes. To demonstrate the viability of the proposed technique, a representative blockchain storage project Storj is adopted as the default storage infrastructure. Experimental results show that Rapper can achieve a 1.96 × speedup on average compared to the representative scheme.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Dual-stage Teacher-Student Representation Learning Framework for Semi-supervised Cardiac Image Segmentation

A Dual-stage Teacher-Student Representation Learning Framewo...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Yifan Zhang Jiajun Zhao Yang Zhao Xuan Yang College of Computer Science and Software Engineering Shenzhen China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

This study introduces a novel generative adversarial network (GAN)-based Dual-stage Teacher-Student Representation Learning (GDL) framework designed to extract effective representations from unlabeled data for cardiac image segmentation. The GDL framework employs an adversarial augmentation approach, simultaneously training a generation model to produce diverse samples and a teacher-student model to learn image representations iteratively. During the pre-training stage, a generator is trained using a diversity-enhanced contrastive loss to generate diverse augmented samples. Subsequently, in the first stage, the generator is further supervised by enforcing dissimilarity between representations produced by the teacher and student models, aiming to expand the image representation space of generated images. In the second stage, the student model is trained to transfer distilled knowledge acquired from the augmented samples to the teacher model to improve its generalization performance in the image segmentation task. Our proposed model ensures that the diverse generated samples correspond precisely to their pseudo-labels, facilitating learning semantic representations from unlabeled data. Experimental results on public cardiac MR datasets demonstrate that our model surpasses the performance of state-of-the-art semi-supervised learning networks.

关键词： Representation learning Training Image segmentation Biological system modeling Semantics Image representation Semisupervised learning Generative adversarial networks Generators Data models

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 42 43 44 45 46 47 48 49 50 51 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：