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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

609 篇 会议
226 篇 期刊文献
3 册 图书

馆藏范围

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

日期分布

学科分类号

639 篇 工学
- 540 篇 计算机科学与技术...
- 450 篇 软件工程
- 123 篇 信息与通信工程
- 92 篇 控制科学与工程
- 44 篇 电气工程
- 44 篇 电子科学与技术（可...
- 41 篇 生物工程
- 36 篇 机械工程
- 28 篇 动力工程及工程热...
- 26 篇 光学工程
- 23 篇 化学工程与技术
- 22 篇 建筑学
- 21 篇 材料科学与工程（可...
- 19 篇 安全科学与工程
- 18 篇 仪器科学与技术
- 18 篇 土木工程
- 18 篇 交通运输工程
- 16 篇 生物医学工程（可授...
- 10 篇 航空宇航科学与技...
357 篇 理学
- 260 篇 数学
- 59 篇 物理学
- 56 篇 统计学（可授理学、...
- 52 篇 系统科学
- 43 篇 生物学
- 27 篇 化学
214 篇 管理学
- 120 篇 管理科学与工程(可...
- 110 篇 图书情报与档案管...
- 57 篇 工商管理
25 篇 法学
- 19 篇 社会学
16 篇 经济学
- 16 篇 应用经济学
8 篇 医学
6 篇 教育学
6 篇 农学
4 篇 艺术学
1 篇 文学
1 篇 军事学

主题

22 篇 semantics
13 篇 computational mo...
13 篇 web services
12 篇 data mining
10 篇 computer science
10 篇 optimization
10 篇 forecasting
9 篇 clustering algor...
8 篇 conferences
8 篇 computer archite...
8 篇 neural networks
8 篇 analytical model...
7 篇 ordinary differe...
7 篇 software quality
7 篇 feature extracti...
7 篇 software
7 篇 cloud computing
7 篇 measurement
7 篇 privacy
7 篇 training

机构

89 篇 state key lab. f...
56 篇 state key lab. o...
29 篇 university of ch...
28 篇 state key lab. o...
26 篇 state key lab. o...
22 篇 state key lab. o...
22 篇 computer school ...
14 篇 tianjin key lab....
14 篇 state key lab. f...
13 篇 department of co...
13 篇 school of comput...
12 篇 beijing key lab....
12 篇 state key lab. o...
11 篇 key laboratory o...
11 篇 school of comput...
10 篇 department of co...
10 篇 state key labora...
10 篇 hunan provincial...
10 篇 school of comput...
10 篇 nanjing universi...

作者

23 篇 zhan naijun
20 篇 xue bai
15 篇 liu jin
12 篇 guosheng kang
11 篇 du junping
11 篇 chen ling
10 篇 liu wei
10 篇 wang hongan
10 篇 liu jianxun
9 篇 kang guosheng
9 篇 zhan bohua
8 篇 he keqing
8 篇 bai xue
8 篇 wu enhua
8 篇 sanglu lu
8 篇 he yanxiang
8 篇 dai guozhong
8 篇 jianxun liu
7 篇 zhang degan
7 篇 zhang xiaolong

语言

795 篇 英文
31 篇 中文
12 篇 其他

检索条件"机构=Key Lab. of System Software and State Key Lab. of Computer Science"

共 838 条记录，以下是371-380 订阅

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

详细简洁

排序：

Adversarial Recovery Network for Low-Light Person Re-Identification 23

Adversarial Recovery Network for Low-Light Person Re-Identif...

引用

6th International Conference on Image and Graphics Processing, ICIGP 2023

作者： Xu, Liu Wang, Xiao Yuan, Xin Mao, Zhu Xu, Xin School of Computer Science and Technology Wuhan University of Science and Technology China School of Computer Science and Technology Wuhan University of Science and Technology ChinaHubei Prov. Key Lab. of Intelligent Information Processing and Real-time Industrial System Wuhan University of Science and Technology China

ISBN: (纸本)9781450398572

Person re-identification (re-ID), which is to connect pedestrians with the same identity in different scenarios, has been more widely used in case detection of security. The re-ID datasets and technology have contributed greatly to advancing community research. There are currently no availab.e low-light datasets due to the difficulty of collecting and lab.ling images of people in low-light scenes. As a result, the vast majority of current re-ID methods do not have the recognition capability in low-light scenes. However, the recognition of persons in the low-light surveillance video has become an important issue to be solved for urban security, which plays an important role in improving the crime-solving rate of public safety departments and protecting people's lives and property. In this paper, we propose an Adversarial Recovery Network (ARN) that, unlike other approaches, enables a re-ID model with low-light recognition capability without the need for low-light data. Specifically, we first degrade the original images to generate multi-level low-light images;then obtain recovered images through the adversarial recovery module, and finally input the recovered images into the CNN network to extract pedestrian recognition knowledge. In addition, to validate the effectiveness of the proposed method, we also propose a low-light re-ID dataset (LOLR). Extensive experiments on LOLR have shown that our method outperforms other competitors by a wide margin. The dataset and code are availab.e online at https://***/xl02111/ARN. © 2023 ACM.

关键词： Recovery

来源：评论

学校读者我要写书评

暂无评论

Safe Exit Controllers Synthesis for Continuous-time Stochastic systems

Safe Exit Controllers Synthesis for Continuous-time Stochast...

引用

IEEE Conference on Decision and Control

作者： Bai Xue Key Laboratory of System Software (Chinese Academy of Sciences) and State Key Lab. of Computer Science Institute of Software CAS Beijing China University of Chinese Academy of Sciences Beijing China

ISBN: (数字)9798350316339

ISBN: (纸本)9798350316346

This paper tackles the problem of generating safe exit controllers for continuous-time systems described by stochastic differential equations (SDEs). The primary aim is to develop controllers that maximize the lower bounds of the exit probability that the system escapes from a safe but uncomfortable set within a specified time frame and guide it towards a comfortable set. The paper considers two distinct cases: one in which the boundary of the safe set is a subset of the boundary of the uncomfortable set, and the other where the boundaries of the two sets do not intersect. To begin, we present a sufficient condition for establishing lower bounds on the exit probability in the first case. This condition serves as a guideline for constructing a point-wise optimization using linear programs. The linear programming problem is designed to implicitly synthesize an optimal exit controller online that maximizes the lower bounds of the exit probability. The method employed in the first case is then extended to the second one. Finally, we demonstrate the effectiveness of the proposed approaches on one example.

关键词： Lower bound Sufficient conditions Stochastic systems Differential equations Linear programming Control systems Trajectory Optimization Guidelines

来源：评论

学校读者我要写书评

暂无评论

Applying the value/petri process to ERP software development in China 06

Applying the value/petri process to ERP software development...

引用

28th International Conference on software Engineering 2006, ICSE '06

作者： Huang, LiGuo Boehm, Barry Hu, Hao Ge, Jidong Lü, Jian Qian, Cheng Computer Science Department University of Southern California Los Angeles CA 90089-0781 United States State Key Lab. of Novel Software Tech. Institute of Computer Software Nanjing University 210093 China Neusoft Co. Ltd. Neusoft Park Shenyang 110179 China

ISBN: (纸本)1595933751

Commercial organizations increasingly need software processes sensitive to business value, quick to apply, and capable of early analysis for subprocess consistency and compatibility. This paper presents experience in applying a lightweight synthesis of a Value-Based software Quality Achievement (VBSQA) process and an Object-Petri-Net-based process model (called VBSQAOPN) to achieve a manager-satisfactory process for software quality achievement in an on-going ERP software project in China. The results confirmed that 1) the application of value-based approaches was inherently better than value-neutral approaches adopted by most ERP software projects;2) the VBSQA-OPN model provided project managers with a synchronization and stabilization framework for process activities, success-critical stakeholders and their value propositions;3) process visualization and simulation tools significantly increased management visibility and controllab.lity for the success of software project. Copyright 2006 ACM.

关键词： software engineering

来源：评论

学校读者我要写书评

暂无评论

Modeling parameter interactions in ranking SVM 15

Modeling parameter interactions in ranking SVM

引用

24th ACM International Conference on Information and Knowledge Management, CIKM 2015

作者： Zhang, Yaogong Xu, Jun Lan, Yanyan Guo, Jiafeng Xie, Maoqiang Huang, Yalou Cheng, Xueqi College of Computer and Control Engineering Nankai University China CAS Key Lab. of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China College of Software Nankai University China

ISBN: (纸本)9781450337946

Ranking SVM, which formalizes the problem of learning a ranking model as that of learning a binary SVM on preference pairs of documents, is a state-of-the-art ranking model in information retrieval. The dual form solution of Ranking SVM model can be written as a linear combination of the preference pairs, i.e., w = Σ(i,j)αij(xi - xj), where αij denotes the Lagrange parameters associated with each pair (i,j). It is obvious that there exist significant interactions over the document pairs because two preference pairs could share a same document as their items. Thus it is natural to ask if there also exist interactions over the model parameters αij, which we may leverage to propose better ranking model. This paper aims to answer the question. Firstly, we found that there exists a low-rank structure over the Ranking SVM model parameters αij, which indicates that the interactions do exist. Then, based on the discovery, we made a modification on the original Ranking SVM model by explicitly applying a low-rank constraint to the parameters. Specifically, each parameter αij is decomposed as a product of two low-dimensional vectors, i.e., αij = (υi,υj), where vectors vi and vj correspond to document i and j, respectively. The learning process, thus, becomes to optimize the modified dual form objective function with respect to the low-dimensional vectors. Experimental results on three LETOR datasets show that our method, referred to as Factorized Ranking SVM, can outperform state-of-the-art baselines including the conventional Ranking SVM. © 2015 ACM.

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

3D model comparison through kernel density matching

3D model comparison through kernel density matching

引用

International Conference on Pattern Recognition

作者： Wang, Yiming Lu, Tong Gao, Rongjun Liu, Wenyin State Key Lab. for Novel Software Technology Nanjing University Nanjing 210093 China Department of Computer Science City University of Hong Kong Hong Kong Hong Kong JiangYin High Technology and Information Institute Nanjing University China

ISBN: (纸本)9780769541099

A novel 3D shape matching method is proposed in this paper. We first extract angular and distance feature pairs from pre-processed 3D models, then estimate their kernel densities after quantifying the feature pairs into a fixed number of bins. During 3D matching, we adopt the KL-divergence as a distance of 3D comparison. Experimental results show that our method is effective to match similar 3D shapes, and robust to model deformations or rotation transformations. © 2010 IEEE.

关键词： Pattern recognition

来源：评论

学校读者我要写书评

暂无评论

A naive feature selection method and its application in network intrusion detection

A naive feature selection method and its application in netw...

引用

International Conference on Computational Intelligence and Security

作者： Chen, Tieming Pan, Xiaoming Xuan, Yiguang Ma, Jixia Jiang, Jie College of Computer Sci. and Tech. Zhejiang University of Technology Hangzhou 310023 China State Key Lab. of Software Development Environment Beihang University Beijing 100191 China Zhejiang Key Laboratory of Information Security Hangzhou310012 China

ISBN: (纸本)9780769542973

Network intrusion detection system needs to handle huge data selected from network environments which usually contain lots of irrelevant or redundant features. It makes intrusion detection with high resource consumption, as well as results in poor performance of real-time processing and intrusion detection rate. Without loss of generality, feature selection can effectively improve the classification model performance, study on the feature selection-based intrusion detection method is therefore very necessary. This paper proposes a simple and quick inconsistency-based feature selection method. Data inconsistency is firstly employed to find the optimal features, and the sequential forward search is then utilized to facilitate the selection of subset features. The tests on KDD99 benchmark data show that the proposed feature selection method can directly eliminate irrelevant and redundant features, without degenerating the classification performance. Furthermore, due to experiments, the intrusion detection performance using the proposed method is also a little advantageous than that with the general CFS method. © 2010 IEEE.

关键词： Intrusion detection

来源：评论

学校读者我要写书评

暂无评论

Pick-up tree based route recommendation from taxi trajectories

Pick-up tree based route recommendation from taxi trajectori...

引用

13th International Conference on Web-Age Information Management, WAIM 2012

作者： Hu, Haoran Wu, Zhiang Mao, Bo Zhuang, Yi Cao, Jie Pan, Jingui State Key Lab. for Novel Software Technology Nanjing University Nanjing China Jiangsu Provincial Key Laboratory of E-Business Nanjing University of Finance and Economics Nanjing China College of Computer and Information Engineering Zhejiang Gongshang University Hangzhou China

ISBN: (纸本)9783642322808

Recommending suitable routes to taxi drivers for picking up passengers is helpful to raise their incomes and reduce the gasoline consumption. In this paper, a pick-up tree based route recommender system is proposed to minimize the traveling distance without carrying passengers for a given taxis set. Firstly, we apply clustering approach to the GPS trajectory data of a large number of taxis that indicates state variance from "free" to "occupied", and take the centroids as potential pick-up points. Secondly, we propose a heuristic based on skyline computation to construct a pick-up tree in which current position is its root node that connects all centroids. Then, we present a probability model to estimate gasoline consumption of every route. By adopting the estimated gasoline consumption as the weight of every route, the weighted Round-Robin recommendation method for the set of taxis is proposed. Our experimental results on real-world taxi trajectories data set have shown that the proposed recommendation method effectively reduce the driving distance before carrying passengers, especially when the number of cabs becomes large. Meanwhile, the time-cost of our method is also lower than the existing methods. © 2012 Springer-Verlag.

关键词： Taxicabs

来源：评论

学校读者我要写书评

暂无评论

Feature-oriented writing process reproduction of Chinese calligraphic artwork 14

Feature-oriented writing process reproduction of Chinese cal...

引用

SIGGRAPH Asia 2014 Technical Briefs, SA 2014

作者： Yang, Li-Jie Xu, Tian-Chen Li, Xiao-Shan Wu, En-Hua Faculty of Science and Technology University of Macau Macao China International College Xiamen University Xiamen Fujian China State Key Lab. of CS Institute of Software Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781450328951

Reproducing the writing process of ancient handwritten artworks is a popular way to appreciating and learning the expert skills of Chinese calligraphy. This paper presents a system for reappearing the writing processes of calligraphic characters in different styles. In order to convey the accurate brush skill inside a stroke, a calligraphic character is first decomposed into several strokes, then the writing trajectory and footprint data of each stroke are calculated based on the edge and skeleton, which reveal the relations between shape description and writing skills, and finally the character can be rendered in the oriental ink style dynamically along the trajectory using our writing rhythm and brush footprint models. Consequently, the animation of calligraphy writing can be produced with both shape and spirit features conveyed, and thus provides a visual and relax way to the comprehension of the complicated and difficult techniques in Chinese calligraphy.

关键词： Trajectories

来源：评论

学校读者我要写书评

暂无评论

Improved continuation power flow method for AC/DC power system

Improved continuation power flow method for AC/DC power syst...

引用

2011 IEEE Electrical Power and Energy Conference, EPEC 2011

作者： Liu, Chongru Bose, Anjan Han, Minxiao Chen, Xiuyu School of Electrical and Electronic Engineering North China Electric Power University Beijing China State Key Lab. of Power System Tsinghua University Beijing China School of Electrical Engineering and Computer Science Washington State University Pullman WA United States

ISBN: (纸本)9781457704048

An improved continuation power flow method for the AC/DC system is proposed in this paper. The three level control strategies and the coordination of the control modes for DC systems are presented. Firstly, the load-type continuation power flow is introduced in brief. Secondly, the concept of the three-level control and their coordination are proposed. The reactive power control strategy is classified into two categories: 1) Reactive Power under Control and 2) Voltage Magnitude under Control. If the control angle is out of its range, the converter transformer tap should be changed to restore the angle. The voltage or reactive power demand is achieved by coordinating the three level control strategies. Finally, the details of the proposed method are proposed. Numerical simulations show that the approach presented in this paper has advantages in terms of convergence and speed. © 2011 IEEE.

关键词： Level control

来源：评论

学校读者我要写书评

暂无评论

An evolutionary computational method for N-connection subgraph discovery

An evolutionary computational method for N-connection subgra...

引用

18th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2006

作者： Chen, Enhong Chen, Xujia Sheu, Phillip C.-Y. Qian, Tieyun Department of CS University of Science and Technology of China Hefei Anhui China State Key Lab. of Software Engineering Wuhan University China Department of EECS University of California Irvine CA 92697 Department of Computer Science Huazhong University of Science and Technology Wuhan Hubei China

ISBN: (纸本)0769527280

The Problem of n-connection subgraph discovery (n- CSDP for short) is to find a small sized subgraph that can well capture the relationship among the n given nodes in a large graph. However there have been very few researches directly addressing the CSDP problem. Furthermore the currently availab.e methods, for example, the electricity analogues based algorithm can only be suitable for tackling the 2-keynodes CSDP and does not work anymore when n is greater than two. To deal with this problem, we propose an effective approach to discover the subgraph in two stages. In the first stage we propose a neighbor-growth based method to extract a relatively bigger candidate subgraph compared with that of result subgraph. In the second stage an evolutionary algorithm for optimizing the result subgraph is proposed. For this purpose, UTM code, a transformed representation of the adjacent matrix of graphs is designed to encode the topology of subgraph as individuals. Then corresponding evolutionary operators able to be directly performed on UTM code are given. Thus the efficiency of the algorithm is largely improved. The experimental results obtained on two real large scale graphs with different topology characteristics demonstrate that our method solves n-connection subgraph discovery problems effectively. © 2006 IEEE.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共84页 << < 34 35 36 37 38 39 40 41 42 43 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：