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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

998 篇 会议
68 册 图书
10 篇 期刊文献

馆藏范围

1,076 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

697 篇 工学
- 568 篇 计算机科学与技术...
- 497 篇 软件工程
- 147 篇 控制科学与工程
- 132 篇 信息与通信工程
- 89 篇 电气工程
- 70 篇 机械工程
- 59 篇 动力工程及工程热...
- 51 篇 生物工程
- 48 篇 交通运输工程
- 44 篇 电子科学与技术（可...
- 37 篇 安全科学与工程
- 27 篇 光学工程
- 25 篇 生物医学工程（可授...
- 23 篇 仪器科学与技术
- 22 篇 化学工程与技术
- 19 篇 材料科学与工程（可...
- 17 篇 建筑学
- 17 篇 土木工程
393 篇 理学
- 299 篇 数学
- 59 篇 生物学
- 54 篇 系统科学
- 48 篇 物理学
- 39 篇 统计学（可授理学、...
- 28 篇 化学
195 篇 管理学
- 148 篇 管理科学与工程(可...
- 77 篇 工商管理
- 70 篇 图书情报与档案管...
40 篇 教育学
- 40 篇 教育学
37 篇 经济学
- 37 篇 应用经济学
23 篇 法学
- 20 篇 社会学
16 篇 医学
13 篇 农学
2 篇 文学
2 篇 军事学

主题

66 篇 software enginee...
65 篇 linear programmi...
53 篇 programming
40 篇 software enginee...
33 篇 artificial intel...
29 篇 optimization
26 篇 dynamic programm...
25 篇 programming tech...
24 篇 costs
22 篇 computational mo...
19 篇 programming lang...
18 篇 programming prof...
18 篇 integer programm...
18 篇 logics and meani...
17 篇 training
16 篇 computer communi...
16 篇 students
14 篇 machine learning
14 篇 engineering educ...
13 篇 computer science

机构

4 篇 department of sy...
4 篇 zhejiang univers...
4 篇 school of comput...
4 篇 state grid sichu...
4 篇 school of inform...
4 篇 school of mechan...
3 篇 school of automa...
3 篇 school of inform...
3 篇 school of comput...
3 篇 cent res inst el...
3 篇 eindhoven univer...
3 篇 department of co...
3 篇 college of infor...
3 篇 school of electr...
3 篇 school of comput...
3 篇 school of inform...
3 篇 polytechnic inst...
3 篇 department of co...
3 篇 school of inform...
3 篇 school of inform...

作者

4 篇 hideki katagiri
4 篇 sanxing cao
4 篇 yin guodong
3 篇 zhang tao
3 篇 laksono pringgo ...
3 篇 chen hao
3 篇 kosuke kato
3 篇 rosyidi cucuk nu...
3 篇 miller j
3 篇 takano hirotaka
3 篇 asano hiroshi
3 篇 liu wei
3 篇 zhang chen
3 篇 shen tong
3 篇 smith m
3 篇 el-kenawy el-say...
3 篇 yang liu
3 篇 martin a
3 篇 abotaleb mostafa
3 篇 mugridge r

语言

1,033 篇 英文
41 篇 其他
6 篇 中文
1 篇 西班牙文

检索条件"任意字段=6th International Conference on the Art, Science, and Engineering of Programming, Programming 2022"

共 1076 条记录，以下是821-830 订阅

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

详细简洁

排序：

Secure program update using broadcast encryption for clustered wireless sensor networks

Secure program update using broadcast encryption for cluster...

引用

6th international conference on Wireless Communication and Sensor Networks, WCSN-2010

作者： Nirmala, M.B. Manjunath, A.S. Dept. of Computer Science and Engineering Siddaganga Institute of Technology Tumkur Karnataka India

ISBN: (纸本)9781424497287

Securing Network Program update is essential for many crucial military applications. Present Network programming protocols proposed by Hailun Tan et al. provides confidentiality and authentication with high computational effort and power consumption. We have developed a confidential network program update protocol for clustered wireless sensor networks. Our scheme has two phases, key computation phase and network program update phase. In key computation phase, we provide an efficient key computation scheme for securing the program image. the key is dynamically computed using broadcast encryption scheme when required without storing neither any keys before deployment, nor communicating directly. Network program update phase follows an approach based on Deluge, an open source code dissemination protocol, and provides confidentiality along with authentication. An immediate and independent authentication is achieved without time synchronization between the base station and the sensor nodes. the scheme is resilient to malicious program image injection by the compromised nodes. Mobile agents are used to know about the node compromise. We implement our scheme in TinyOS and evaluate the performance. © 2010 IEEE.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

Open exposure of telco capabilities: Identification of critical success factors for location-based services in open telco

Open exposure of telco capabilities: Identification of criti...

引用

6th international conference on Wireless and Mobile Communications, ICWMC 2010

作者： Suikkola, Vesa Department of Computer Science and Engineering Aalto University School of Science and Technology P.O. Box 15400 FI-00076 AALTO Espoo Finland

ISBN: (纸本)9780769541822

As of late, open exposure of telco capabilities has been a target of interest - much due to the success of open application programming interfaces on the Internet services market. Due to the innate ability of the mobile networks to know its users' locations, the location-based services market is an especially interesting area from the operator point of view. Operators could possibly create success in this market by implementing the Open Telco framework;however, key service areas and critical success factors have not been identified yet. this paper reviews the existing literature on Open Telco, location-based services, and network-based positioning technologies and identifies the key location-based service application areas for network-based positioning. Based on this analysis, we present a list of critical success factors for location-based services in Open Telco. the findings indicate that the key application areas in network-positioning based location-based services are social networking, information, and productivity services. the critical success factors were found to be standard interfaces, operator cooperation, and the handling of privacy, security, as well as usability issues with location-based services. © 2010 IEEE.

关键词： Location based services

来源：评论

学校读者我要写书评

暂无评论

Pavement Maintenance and Rehabilitation Decisions Derived by Genetic programming

Pavement Maintenance and Rehabilitation Decisions Derived by...

引用

作者： Chang, Jia-Ruey Chao, Sao-Jeng Department of Civil Engineering and Environmental Informatics MingHsin University of Science and Technology Hsin-Chu Taiwan Department of Civil Engineering National Ilan University I-Lan Taiwan

ISBN: (纸本)9781424459612

the application of genetic programming (GP) to pavement performance evaluation is relatively new. GP was first proposed by John R. Koza as an evolutionary computation technique: a stochastic search method based on the Darwinian principle of 'survival of the fittest', whereby intelligible relationships in a system are automatically extracted and used to generate mathematical expressions or 'programs'. Nowadays, GP has been used as an important problem-solving method for function fitting and classification. In this paper, an empirical study is performed to develop a pavement maintenance and rehabilitation (M&R) decision model by using GP. As part of the research, experienced pavement engineers from the Taiwan Highway Bureau (thB) conducted pavement distress surveys on seven county roads. For each road section, the severity and coverage of existing distresses that required M&R treatments were separately identified and collated into an analytical database containing 2,340 records. these records were then used to train, validate, and apply the M&R decision model. the finding shows that the total accuracy of the evolved M&R decision model was 0.903, 0.877, and 0.878 for the training, validation, and application data set, respectively. It proves that the GP-based M&R decision model process makes the pavement knowledge extraction process more systematic, easier to use and solvable with a higher probability of success - even for complex M&R decision problems. © 2010 IEEE.

关键词： Genetic programming

来源：评论

学校读者我要写书评

暂无评论

A communication-efficient, distributed memory parallel code using discontinuous Galerkin method for compressible flows

A communication-efficient, distributed memory parallel code ...

引用

international conference on Emerging Technologies

作者： Ali, Amjad Syed, Khalid S. Ishaq, Muhammad Hassan, Ahmad Luo, Hong Multan 60800 Pakistan Department of Mechanical and Aerospace Engineering North Carolina State University Raleigh NC 27695 United States

ISBN: (纸本)9781424480586

We present parallelization of a discontinuous Galerkin (DG) code on distributed memory parallel computers for compressible, inviscid fluid flow computations on unstructured meshes. the parallel DG code is based on a Taylor series basis and it uses LU-SGS (Lower-Upper Symmetric Gauss-Seidel) method for solving the linear system obtained by implicit time integration. Cost effective Ethernet based compute cluster composed of commonly available PC components is considered as the parallel computing platform. the parallel solution is based on computational domain partitioning and MPI (Message Passing Interface) programming paradigm. We demonstrate scalability of the developed parallel code on a cluster using two efficient MPI communication procedures. We also demonstrated the dominance of memory-bound nature of the parallel solution over network-bound nature. © 2010 IEEE.

关键词： Cost effectiveness

来源：评论

学校读者我要写书评

暂无评论

Decentralized nearly optimal control of a class of interconnected nonlinear discrete-time systems by using online Hamilton-Bellman-Jacobi formulation

Decentralized nearly optimal control of a class of interconn...

引用

2010 6th IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 international Joint conference on Neural Networks, IJCNN 2010

作者： Mehraeen, S. Jagannathan, S. Department of Electrical and Computer Engineering Missouri University of Science and Technology 1870 Miner Circle Rolla MO 65409 United States

ISBN: (纸本)9781424469178

In this paper, the direct neural dynamic programming technique is utilized to solve the Hamilton Jacobi-Bellman (HJB) equation online and forward-in-time for the decentralized nearly optimal control of nonlinear interconnected discrete-time systems in affine form with unknown internal subsystem and interconnection dynamics. Only the state vector of the local subsystem is considered measurable. the decentralized optimal controller design for each subsystem consists of an action neural network (NN) that is aimed to provide a nearly optimal control signal, and a critic NN which approximates the cost function. the NN weights are tuned online for both the NNs. It is shown that all subsystems signals are uniformly ultimately bounded (UUB) and that the subsystem inputs approach their corresponding nearly optimal control inputs with bounded error. © 2010 IEEE.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

Study on Interactive System for Teaching programming(ISTP) Based on Intelligent Agent

Study on Interactive System for Teaching Programming(ISTP) B...

引用

international conference on Wireless Communications, Networking and Mobile Computing (WiCom)

作者： Pan Guo Honggang Qi Jiangxi Science and Technology Normal University Nanchang Jiangxi China School of Information Science and Engineering Chinese Academy of Sciences Beijing China

Learning to program may be very difficult for students who have no previous programming experience because it requires students to possess a combination of theory, practice and problem solving skills. the topic of this paper is to describe the development of a flexible and interactive learning environment for learning programming based on intelligent agent after comparison of ITS and ILE, called Interactive System for Teaching programming(ISTP).

关键词： programming profession Education Intelligent agent Intelligent systems Computers

来源：评论

学校读者我要写书评

暂无评论

Barriers to modularity - An empirical study to assess the potential for modularisation of Java programs

Barriers to modularity - An empirical study to assess the po...

引用

6th international conference on the Quality of Software Architectures, QoSA 2010

作者： Dietrich, Jens McCartin, Catherine Tempero, Ewan Ali Shah, Syed M. Massey University School of Engineering and Advanced Technology Palmerston North New Zealand Department of Computer Science University of Auckland Auckland New Zealand

ISBN: (纸本)3642138209

To deal with the challenges when building large and complex systems modularisation techniques such as component-based software engineering and aspect-oriented programming have been developed. In the Java space these include dependency injection frameworks and dynamic component models such as OSGi. the question arises as to how easy it will be to transform existing systems to take advantage of these new techniques. Anecdotal evidence from industry suggests that the presence of certain patterns presents barriers to refactoring of monolithic systems into a modular architecture. In this paper, we present such a set of patterns and analyse a large set of open-source systems for occurrences of these patterns. We use a novel, scalable static analyser that we have developed for this purpose. the key findings of this paper are that almost all programs investigated have a significant number of these patterns, implying that modularising will be therefore difficult and expensive. © 2010 Springer-Verlag.

关键词： Software architecture

来源：评论

学校读者我要写书评

暂无评论

Developing an adaptable manufacturing execution system framework

Developing an adaptable manufacturing execution system frame...

引用

6th CIRP international conference on Digital Enterprise Technology, DET 2009

作者： Gang, Huang Jinhang, Li Xiaodong, Yuan State Key Laboratory of Digital Manufacturing Equipment and Technology Huazhong University of Science and Technology Wuhan Hubei China Department of Industrial and Manufacturing System Engineering School of Mechanical Science and Engineering Huazhong University of Science and Technology China

ISBN: (纸本)9783642104299

Manufacturing system now reached a point where it can accommodate various kinds of production models. However, its management and control sub-system, i.e. the manufacturing execution system (MES), is still constructed with relatively dedicated framework. Such lag in the development of MES has inevitably caused some problems. A salient one is the lack of adaptability to effectively cope with the diversity of manufacturing processes. this paper aims to provide some resolutions to this problem. After analyzing the adaptability requirements of A-MES in detail, some key techniques are researched including data integrated adapter, developing configurable factory model, reusable business component and data based script driven mechanism. thereafter, a new kind of adaptable MES framework named A-MES is presented. A-MES is capable of accommodating changes in internal and external manufacturing system with little programming work. Moreover, a implementation system of A-MES is given, which has been successfully applied in different assembly lines in automotive industry. © Springer-Verlag Berlin Heidelberg 2010.

关键词： Manufacture

来源：评论

学校读者我要写书评

暂无评论

A general multi-relational classification approach using feature generation and selection

A general multi-relational classification approach using fea...

引用

6th international conference on Advanced Data Mining and Applications, ADMA 2010

作者： Zou, Miao Wang, Tengjiao Li, Hongyan Yang, Dongqing School of Electronics Engineering and Computer Science Peking University Beijing 100871 China

ISBN: (纸本)3642173128

Multi-relational classification is an important data mining task, since much real world data is organized in multiple relations. the major challenges come from, firstly, the large high dimensional search spaces due to many attributes in multiple relations and, secondly, the high computational cost in feature selection and classifier construction due to the high complexity in the structure of multiple relations. the existing approaches mainly use the inductive logic programming (ILP) techniques to derive hypotheses or extract features for classification. However, those methods often are slow and sometimes cannot provide enough information to build effective classifiers. In this paper, we develop a general approach for accurate and fast multi-relational classification using feature generation and selection. Moreover, we propose a novel similarity-based feature selection method for multi-relational classification. An extensive performance study on several benchmark data sets indicates that our approach is accurate, fast and highly scalable. © 2010 Springer-Verlag.

关键词： Feature Selection

来源：评论

学校读者我要写书评

暂无评论

A cost function based single network adaptive critic architecture for optimal control synthesis for a class of nonlinear systems

A cost function based single network adaptive critic archite...

引用

2010 6th IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 international Joint conference on Neural Networks, IJCNN 2010

作者： Ding, Jie Balakrishnan, S.N. Lewis, Frank L. Department of Mechanical and Aerospace Engineering Missouri University of Science and Technology Rolla MO 65409 United States Automation and Robotics Research Institute University of Texas at Arlington Fort Worth TX 76118-7115 United States

ISBN: (纸本)9781424469178

Approximate dynamic programming implemented with an Adaptive Critic (AC) neural network (NN) structure has evolved as a powerful alternative technique that eliminates the need for excessive computations and storage requirements in solving optimal control problems. A typical AC structure consists of two interacting NNs. In this paper, a new architecture, called the "Cost Function Based Single Network Adaptive Critic (J-SNAC)" is presented. this approach is applicable to a wide class of nonlinear systems where the optimal control (stationary) equation can be explicitly expressed in terms of the state and cost variables. Selection of this terminology is guided by the fact that it eliminates the use of one NN (namely the action network) that is part of a typical dual network AC. In order to demonstrate the benefits and the control synthesis technique in using the J-SNAC, two problems have been solved with the AC and the J-SNAC approaches. Results are presented that show savings of about 50% of the computational costs by J-SNAC while having the same accuracy levels of the dual network structure in solving for optimal control. Convergence of the J-SNAC iterations is discussed as well as the reduction of the iterative process to the familiar algebraic Ricatti equation in the case of linear systems. © 2010 IEEE.

关键词： Linear systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共108页 << < 79 80 81 82 83 84 85 86 87 88 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：