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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

241 篇 会议
112 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

235 篇 工学
- 166 篇 计算机科学与技术...
- 121 篇 软件工程
- 83 篇 信息与通信工程
- 37 篇 电气工程
- 36 篇 控制科学与工程
- 31 篇 电子科学与技术（可...
- 16 篇 机械工程
- 13 篇 网络空间安全
- 12 篇 仪器科学与技术
- 11 篇 动力工程及工程热...
- 11 篇 建筑学
- 11 篇 化学工程与技术
- 9 篇 交通运输工程
- 9 篇 生物工程
- 8 篇 力学（可授工学、理...
- 8 篇 航空宇航科学与技...
- 7 篇 光学工程
- 7 篇 土木工程
127 篇 理学
- 81 篇 数学
- 32 篇 物理学
- 25 篇 统计学（可授理学、...
- 19 篇 系统科学
- 16 篇 化学
- 14 篇 生物学
63 篇 管理学
- 43 篇 管理科学与工程(可...
- 24 篇 图书情报与档案管...
- 13 篇 工商管理
10 篇 医学
- 6 篇 基础医学(可授医学...
- 6 篇 临床医学
5 篇 经济学
- 5 篇 应用经济学
4 篇 法学
1 篇 教育学
1 篇 军事学

主题

19 篇 laboratories
13 篇 computer science
12 篇 wireless sensor ...
10 篇 heuristic algori...
9 篇 optimization
9 篇 algorithm design...
9 篇 evolutionary com...
8 篇 statistics
8 篇 bandwidth
8 篇 clustering algor...
7 篇 computational mo...
7 篇 computer network...
6 篇 couplings
6 篇 vectors
6 篇 feature extracti...
6 篇 sociology
6 篇 training
5 篇 linear discrimin...
5 篇 face recognition
5 篇 data mining

机构

43 篇 college of infor...
31 篇 key laboratory o...
25 篇 school of comput...
24 篇 anhui province k...
20 篇 anhui university...
17 篇 anhui province k...
15 篇 department of co...
11 篇 hubei key labora...
11 篇 microsoft resear...
10 篇 national enginee...
10 篇 hubei engineerin...
10 篇 school of softwa...
10 篇 school of inform...
10 篇 school of cyber ...
9 篇 harbin engineeri...
9 篇 school of comput...
9 篇 services computi...
9 篇 the key laborato...
8 篇 school of comput...
8 篇 anhui province k...

作者

37 篇 li yingsong
26 篇 yingsong li
23 篇 wenjian luo
18 篇 luo wenjian
17 篇 xufa wang
11 篇 huang zhixiang
9 篇 junwei qi
9 篇 naijie gu
8 篇 wang xufa
8 篇 hu shengshan
8 篇 shao chenxi
8 篇 zhang leo yu
8 篇 gu naijie
8 篇 li minghui
7 篇 xianbin cao
7 篇 zhang lei
6 篇 chenxi shao
6 篇 qi junwei
6 篇 tao dacheng
6 篇 ping zhu

语言

340 篇 英文
8 篇 中文
5 篇 其他

检索条件"机构=Anhui Key Laboratory of Software Engineering in Computing and Communication"

共 353 条记录，以下是81-90 订阅

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

详细简洁

排序：

Image quality assessment metrics with radon transform

Image quality assessment metrics with radon transform

引用

2008 IEEE International Conference on Systems, Man and Cybernetics, SMC 2008

作者： Pang, Jianxin Zhang, Rong Zhang, Hui Huang, Xuan Liu, Zhen Kai MOE-Microsoft Key Laboratory of Multimedia Computing and Communication Department of Electronic Engineering and Information Science University of Science and Technology of China Hefei Anhui 230027 China

Objective image quality assessment (QA) is a fundamental and challenging job in image processing which evaluates the image quality consistently with human perception automatically. Generally, an image can be segmented into two kinds of areas: structure and texture. And structural information plays a much more important role between the two. The pixels, edges and shape with directional characteristic contribute much more to the structural information. In this paper, the structural information is modeled as the energy of directional projection, which is shown in a directional projection-based map that is built by Radon transform. On the assumption that any image's distortion could be modeled as the difference between the directional projection-based maps of reference and distortion images, we propose a new objective quality assessment method with Radon transform for full reference model, and we also try to explore the feasibility to develop the image QA metrics with scalable efficiency and computational cost. Experimental results show that the proposed Metrics are well consistent with the subjective quality score. © 2008 IEEE.

关键词： Image quality

来源：评论

学校读者我要写书评

暂无评论

A Gong-Si-Shaped Heterogeneous Circular-Polarization Array for 5G Application 5

A Gong-Si-Shaped Heterogeneous Circular-Polarization Array f...

引用

5th IEEE International Conference on Electronic Information and communication Technology, ICEICT 2022

作者： Zhou, Wei Qi, Junwei Li, Yingsong Huang, Zhixiang Yang, Lixia College of Information and Communication Engineering Harbin Engineering University Harbin150001 China Anhui Province Key Laboratory of Target Recognition and Feature Extraction LuAn230088 China Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Hefei China

ISBN: (数字)9781665472111

ISBN: (纸本)9781665472111

In this work, a Gong-Si-shaped circularly polarized (CP) array with power driver for 5G is proposed. The radiator of the constructed CP array consists of two Chinese-like characters ' and '' with the similar size and pronunciation of 'gong' and 'si', Two L-shaped feeding probes of the same size are connected to the designed power driver printed on the bottom layer of ground plate, and the array can radiate circular polarization electromagnetic waves by changing the positions of the L-shaped probes and the angle of the horizontal parts of the L-shaped probes. From the simulating and optimizing, it is finally obtained that the -15 dB bandwidth of modeled Gong-Si-like CP antenna lies in 2.49 - 2.81 GHz and the presented Gong-Si-like CP antenna has a axial bandwidth covering 2.36 - 2.82 GHz, which meets the n41 5G band implementing at 2.515 - 2.675 GHz. © 2022 IEEE.

关键词： Circular polarization

来源：评论

学校读者我要写书评

暂无评论

Differential evolution with a species-based repair strategy for constrained optimization

Differential evolution with a species-based repair strategy ...

引用

Congress on Evolutionary Computation

作者： Chenyang Bu Wenjian Luo Tao Zhu Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei Anhui China

ISBN: (纸本)9781479914869

Evolutionary Algorithms (EAs) with gradient-based repair, which utilize the gradient information of the constraints set, have been proved to be effective. It is known that it would be time-consuming if all infeasible individuals are repaired. Therefore, so far the infeasible individuals to be repaired are randomly selected from the population and the strategy of choosing individuals to be repaired has not been studied yet. In this paper, the Species-based Repair Strategy (SRS) is proposed to select representative infeasible individuals instead of the random selection for gradient-based repair. The proposed SRS strategy has been applied to εDEag which repairs the random selected individuals using the gradient-based repair. The new algorithm is named SRS-εDEag. Experimental results show that SRS-εDEag outperforms εDEag in most benchmarks. Meanwhile, the number of repaired individuals is reduced markedly.

关键词： Maintenance engineering Sociology Statistics Vectors Equations Clustering algorithms Mathematical model

来源：评论

学校读者我要写书评

暂无评论

Evolutionary clustering with differential evolution

Evolutionary clustering with differential evolution

引用

Congress on Evolutionary Computation

作者： Gang Chen Wenjian Luo Tao Zhu Anhui Province key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei Anhui China

ISBN: (纸本)9781479914869

Evolutionary clustering is a hot research topic that clusters the time-stamped data and it is essential to some important applications such as data streams clustering and social network analysis. An evolutionary clustering should accurately reflect the current data at any time step while simultaneously not deviate too drastically from the recent past. In this paper, the differential evolution (DE) is applied to deal with the evolutionary clustering problem. Comparing with the typical k-means, evolutionary clustering based on DE (deEC) could perform a global search in the solution space. Experimental results over synthetic and real-world data sets demonstrate that the deEC provides robust and adaptive solutions.

关键词： Clustering algorithms History Vectors Evolutionary computation Equations Sociology Statistics

来源：评论

学校读者我要写书评

暂无评论

An improved genetic algorithm for dynamic shortest path problems

An improved genetic algorithm for dynamic shortest path prob...

引用

Congress on Evolutionary Computation

作者： Xuezhi Zhu Wenjian Luo Tao Zhu Anhui Province key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei Anhui China

The Shortest Path (SP) problems are conventional combinatorial optimization problems. There are many deterministic algorithms for solving the shortest path problems in static topologies. However, in dynamic topologies, these deterministic algorithms are not efficient due to the necessity of restart. In this paper, an improved Genetic Algorithm (GA) with four local search operators for Dynamic Shortest Path (DSP) problems is proposed. The local search operators are inspired by Dijkstra's Algorithm and carried out when the topology changes to generate local shortest path trees, which are used to promote the performance of the individuals in the population. The experimental results show that the proposed algorithm could obtain the solutions which adapt to new environments rapidly and produce high-quality solutions after environmental changes.

关键词： Sociology Statistics Heuristic algorithms Topology Algorithm design and analysis Digital signal processing Biological cells

来源：评论

学校读者我要写书评

暂无评论

Grasping and folding knots

Grasping and folding knots

引用

IEEE International Conference on Robotics and Automation

作者： Weifu Wang Devin Balkcom Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei Anhui China

ISBN: (纸本)9781467380270

String stretched tightly along a sequence of fixed grasp points takes the shape of a polygonal arc. In this work, we investigate how many points are necessary and sufficient to grasp and tie arbitrary knots while maintaining tension, so that the string remains polygonal. This approach allows reasoning that is entirely geometric, which does not rely on potentially inaccurate dynamic models of the string or detailed knowledge of physical characteristics of the string. Algorithms are proposed to determine the contact locations, and generate the motions needed to tie arbitrary knots. This work shows that a number of grasp points that is linear in the number of crossings in a knot diagram is sufficient to immobilize string in a polygonal shape with the topology of an arbitrary knot, or to fold or unfold the knot from a straight configuration.

关键词： Grasping folding knots

来源：评论

学校读者我要写书评

暂无评论

Recent Advances in Clonal Selection Algorithms and Applications

Recent Advances in Clonal Selection Algorithms and Applicati...

引用

IEEE Symposium Series on Computational Intelligence

作者： Wenjian Luo Xin Lin Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei Anhui China

Clonal selection algorithms (CSAs) are a kind of Artificial Immune Algorithms (AIAs). In this paper, recent advances in clonal selection algorithms are summarized and reviewed. First, the basic framework of clonal selection algorithms is given. Second, various types of applications using clonal selection algorithms are summarized, including global optimization, constrained optimization, combinatorial optimization, multiobjective optimization, dynamic optimization and other applications. Last, a brief conclusion and some remarks about clonal selection algorithms are given.

关键词： Immune Computation Clonal Selection Algorithms Optimization

来源：评论

学校读者我要写书评

暂无评论

A fine-grained algorithm for generating hard-toreverse negative databases

A fine-grained algorithm for generating hard-toreverse negat...

引用

International Workshop on Artificial Immune Systems, AIS 2015

作者： Zhao, Dongdong Luo, Wenjian Liu, Ran Yue, Lihua School of Computer Science and Technology University of Science and Technology of China Hefei Anhui230027 China Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei Anhui230027 China School of Computer Science China University of Geosciences Wuhan430074 China

ISBN: (纸本)9781509002986

The negative database (NDB) is a new technique for privacy preserving and information hiding. It hides information by storing the complementary set instead of the original data. In order to protect the hidden information, NDBs should be hard-to-reverse. In this paper, we propose the Khidden algorithm for generating hard-to-reverse NDBs (called Khidden-NDBs). The K-hidden algorithm could be controlled in a more fine-grained manner than existing NDB generation algorithms. Moreover, in terms of the SAT solvers based on the local search strategy, we formally prove that the K-hidden-NDBs could be more hard-to-reverse than the NDBs generated by the typical p-hidden algorithm. Furthermore, we show that the Khidden-NDB could be more hard-to-reverse (against the local search strategy) than the q-hidden-NDB (NDBs generated by the q-hidden algorithm) when the sizes of NDBs are the same. Finally, as for the Unit Clause heuristic solvers, we prove that the K-hidden-NDB could be the same hard-to-reverse as the qhidden-NDB. © 2015 IEEE.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

The detection of Trojan horse based on the data mining

The detection of Trojan horse based on the data mining

引用

6th International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2009

作者： Tang, Shugang School of Computer and Communication Engineering Tianjin University of Technology Tianjin 300191 China Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin 300191 China

ISBN: (纸本)9780769537351

Trojan horse is a serious security threat to computer network. Traditionally, Trojan Horses are detected using file's dynamic characteristics or behaviors. However, these methods are not available for unknown or un-awakened Trojan horses. Trojan horse always exists as PE (Portable Executable) file format in the Windows system environment, and the PE file has many static characteristics, which contains many runtime characteristics. In this paper, a new detecting method based on PE file's static attributes is proposed, and intelligent information processing techniques are used to analyze those static attributes, such as decision tree, BP network and Finite State Machine. Further, a detection model is established to estimate whether a PE file is a Trojan horse. This thesis is prepared to value the static Trojan characteristic and build a new way to detect the Trojan horse by using the PE file static characteristics. © 2009 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Research on ultra-dependable embedded real time operating system

Research on ultra-dependable embedded real time operating sy...

引用

2011 IEEE/ACM International Conference on Green computing and communications, GreenCom 2011

作者： Chen, Hui Yang, Shi Ping Shanghai Key Laboratory of Trustworthy Computing Software Engineering Institute East China Normal University Shanghai China Guangzhou Haige Communication Industry Group Guangzhou China

ISBN: (纸本)9780769544663

In this paper, to research and design ultra-dependable embedded real time operating system supporting security and safety, spatial and temporal isolation safeguard is proposed and used. Temporal isolation mechanism guarantees a subsystem can exclusively use a pre-allocated processing time without any intervention from other subsystem. On the other hand, spatial isolation implies that a subsystem cannot inadvertently access other subsystem's space resources, like memory, buffers, I/O ports, and registers. Thus, a subsystem is the owner of its resources, such as memory, I/O ports, and processor time units. From this, the real time tasks running in different subsystems never interfere with each other. To support the temporal isolation among subsystems, a two-level scheduling model is designed, which consists of a low-level cyclic schedule at the operating system level and high-level fixed priority schedule at subsystem level. Thus, a real time task in a subsystem can only be scheduled and executed during the static time window allocated to the subsystem, and any task overrun cannot cross the time window boundaries of subsystem. It is very easy to restrain a task time-failure within the subsystem with temporal isolation mechanism. In reference to spatial isolation safeguard, a based on hard currency and error holding mechanism is presented, it apply to most embedded modern processors with memory protection unit, such as i386sx, PowerPC. As a result, an ultra-dependable embedded RTOS supporting temporal and spatial isolation safeguard is implemented and verified. It is called ERTOS designed by software engineering Institute of East China Normal University. © 2011 IEEE.

关键词： Embedded systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共36页 << < 5 6 7 8 9 10 11 12 13 14 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：