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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

24 篇 期刊文献
19 篇 会议

馆藏范围

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

日期分布

学科分类号

33 篇 工学
- 18 篇 电气工程
- 11 篇 计算机科学与技术...
- 8 篇 控制科学与工程
- 5 篇 信息与通信工程
- 3 篇 航空宇航科学与技...
- 2 篇 电子科学与技术（可...
- 2 篇 石油与天然气工程
- 1 篇 力学（可授工学、理...
- 1 篇 材料科学与工程（可...
- 1 篇 化学工程与技术
- 1 篇 生物医学工程（可授...
- 1 篇 软件工程
15 篇 理学
- 8 篇 物理学
- 4 篇 数学
- 3 篇 系统科学
- 1 篇 化学
- 1 篇 统计学（可授理学、...
1 篇 经济学
- 1 篇 理论经济学
1 篇 文学
- 1 篇 外国语言文学
1 篇 医学
- 1 篇 临床医学

主题

43 篇 generalized algo...
12 篇 algorithms
4 篇 robot
2 篇 sensor systems
2 篇 noise reduction
2 篇 complexity class...
2 篇 cosmic strings
2 篇 noise
2 篇 discrete reachin...
2 篇 monte carlo tech...
2 篇 linear models
2 篇 transducers
2 篇 sequential
2 篇 band approach
2 篇 discrete element
2 篇 byways
2 篇 green's function
1 篇 simulating
1 篇 destination
1 篇 3-center nuclear...

机构

2 篇 indian inst tech...
1 篇 department of co...
1 篇 ecole normale su...
1 篇 int comp sci ins...
1 篇 ist nazl fis nuc...
1 篇 caltech dept con...
1 篇 school of energy...
1 篇 yonsei univ dept...
1 篇 univ fed minas g...
1 篇 korea adv inst s...
1 篇 natl chengchi un...
1 篇 uppsala univ dep...
1 篇 chinese acad sci...
1 篇 northwestern uni...
1 篇 wageningen univ ...
1 篇 univ catania dip...
1 篇 ntt human interf...
1 篇 mis université d...
1 篇 delft univ techn...
1 篇 univ aix marseil...

作者

2 篇 bandyopadhyay bi...
2 篇 chakrabarty soho...
1 篇 cacko andrzej
1 篇 s. s. kozat
1 篇 wasserman h
1 篇 parsons benjamin...
1 篇 wu xinyu
1 篇 safouhi h
1 篇 oriols x.
1 篇 xinbiao lu
1 篇 ordentlich e
1 篇 weissman t
1 篇 cappuzzello f.
1 篇 gorskii v. g.
1 篇 daciuk j
1 篇 matni nikolai
1 篇 kim young-keun
1 篇 solovyeva inna
1 篇 tataj emanuel
1 篇 yasuyuki kato

语言

37 篇 英文
5 篇 其他
1 篇 中文

检索条件"主题词=generalized algorithm"

共 43 条记录，以下是21-30 订阅

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

详细简洁

排序：

Generalised algorithm for Modelling of Solar Photo Voltaic Array under Partial Shadowed Conditions 10

Generalised Algorithm for Modelling of Solar Photo Voltaic A...

引用

10th IEEE Power India International Conference (PIICON)

作者： Agarwal, Kusum Lata Sharma, Avdhesh ABES Engn Coll Dept Elect & Elect Engn Ghaziabad UP India MBM Engn Coll Dept Elect Engn Jodhpur Rajasthan India

ISBN: (纸本)9781665459303

generalized algorithm for determining the I-pv-V-pv and P-pv-V-pv curves at given insolation and temperature of solar photovoltaic (SPV) array, under partial shadow conditions is proposed in this paper. The algorithm is proficient of developing the characteristics of SPV array of any configuration with any kind of shadow pattern. Individual module specifications are also inputted. A MATLAB code is developed for the algorithm and I-pv-V-pv and P-pv-V-pv curves of a sample system of [4*3] PV array are identified for ten shadow patterns. For each shadow pattern values of Vmp and Pmp (voltage and peak power) are also identified using the algorithm, which are further required for peak power point tracking (PPPT).

关键词： Solar PV Array Non-uniform Illuminations generalized algorithm

来源：评论

学校读者我要写书评

暂无评论

Universal discrete denoising

Universal discrete denoising

引用

IEEE Information Theory Workshop

作者： Weissman, T Ordentlich, E Seroussi, G Verdú, S Weinberger, M Hewlett Packard Labs Palo Alto CA 94304 USA

ISBN: (纸本)0780376293

We propose a discrete denoising algorithm, that, based on the observation of, the output of a known Discrete Memoryless Channel (DMC), estimates the input sequence to minimize a given fidelity, criterion. The algorithm is universal in the sense that it requires no knowledge of the input sequence or its statistical properties. Yet, asymptotically it performs as well as the optimum denoiser that knows the input sequence distribution. The, proposed denoising algorithm is practical, and can be implemented in O(nlogn) time and O(n(2/3) log n) storage complexity. Extensions to the case of delay-constrained denoising, and to the case of channel uncertainty, are briefly discussed.

关键词： signal denoising computational complexity memoryless systems stochastic processes telecommunication channels discrete denoising algorithm discrete memoryless channel fidelity criterion universal algorithm input sequence estimation storage c Input sequence generalized algorithm memoryless systems signal denoising Markov chain Memoryless channel complexity classes Noise reduction Stochastic Processes Universal

来源：评论

学校读者我要写书评

暂无评论

A template-based English-Chinese translation system using FOPA and UAMRT

A template-based English-Chinese translation system using FO...

引用

6th International Conference on Advanced Language Processing and Web Information Technology

作者： Li Yujian Beijing Univ Technol Coll Comp Sci & Technol Beijing 100022 Peoples R China

ISBN: (纸本)9780769529301

This paper presents a template-based English-Chinese translation system characterized by two important features: Fast Optimal Parsing algorithm (FOPA) and Universal algorithm of Matching and Replacing Templates (UAAMT). First, the FOPA parses an English sentence into an optimal parse tree or template structure quickly. Second, the UAMRT matches each source template with the optimal structure and replaces it with the corresponding target template. The basic idea of the template-based system is to represent all translation knowledge in uniform templates which can be shown as context-free grammar rules. It then translates an English sentence into Chinese with FOPA and UAMRT System evaluation shows encouraging and promising results for quality and speed, and the system may perform better by adding more templates without any other changes.

关键词： jigs(templates) Translation systems parsing tree context-free grammars Translations Translation Translation Process generalized algorithm parsing algorithms English English language system evaluation

来源：评论

学校读者我要写书评

暂无评论

Accelerating MPI Collective Communications through Hierarchical algorithms without Sacrificing Inter-Node Communication Flexibility

Accelerating MPI Collective Communications through Hierarchi...

引用

IEEE 28th International Parallel & Distributed Processing Symposium (IPDPS)

作者： Parsons, Benjamin S. Pai, Vijay S. Purdue Univ W Lafayette IN 47907 USA

ISBN: (纸本)9780769552071

This paper presents and evaluates a universal algorithm to improve the performance of MPI collective communication operations on hierarchical clusters with many-core nodes. This algorithm exploits shared-memory buffers for efficient intra-node communication while still allowing the use of unmodified, hierarchy-unaware traditional collectives for inter-node communication (including collectives like Alltoallv). This algorithm improves on past works that convert a specific collective algorithm into a hierarchical version and are generally restricted to fan-in, fan-out, and Allgather algorithms. Experimental results show impressive performance improvements utilizing a variety of collectives from MPICH as well as the closed-source Cray MPT for the inter-node communication. The experimental evaluation tests the new algorithms with as many as 65536 cores and sees speedups over the baseline averaging 14.2x for Alltoallv, 26x for Allgather, and 32.7x for Reduce-Scatter. The paper further improves inter-node communication by utilizing multiple senders from the same shared memory buffer, achieving additional speedups averaging 2.5x. The discussion also evaluates special-purpose extensions to improve intra-node communication by returning shared memory or copy-on-write protected buffers from the collective.

关键词： Communication Research shared memory message passing mannose phosphate isomerase remote procedure calls generalized algorithm fan-out Hierarchical algorithms performance boost

来源：评论

学校读者我要写书评

暂无评论

Learning Graph Structures in Discrete Markov Random Fields

Learning Graph Structures in Discrete Markov Random Fields

引用

IEEE Conference on Computer Communications (INFOCOM)

作者： Wu, Rui Srikant, R. Ni, Jian Univ Illinois Dept ECE Urbana IL 61801 USA

ISBN: (纸本)9781467310161

We present a general algorithm for learning the structure of discrete Markov random fields from i.i.d. samples. The algorithm either achieves the same computational complexity or lowers the computational complexity of earlier algorithms for several cases, and provides a new low-computational complexity algorithm for the case of Ising models where the underlying graph is the Erdos-Renyi random graph G similar to G (p, c/p).

关键词： Markov random fields complexity classes generalized algorithm Ising model discrete element

来源：评论

学校读者我要写书评

暂无评论

Decoding algebraic geometric codes

Decoding algebraic geometric codes

引用

IEEE Information Theory Workshop

作者： Shokrollahi, MA Wasserman, H Int Comp Sci Inst Berkeley CA 94704 USA

ISBN: (纸本)0780344081

We present a new algorithm for decoding AG-codes significantly beyond the error-correction bound. Specifically, given a word y whose distance to the AG-code is at most e, where e is a parameter depending on the block length and the dimension of the code, our algorithm produces all codewords that have distance less than or equal to e from y. We also discuss modifications of our general algorithm and show how to obtain similar algorithms for binary codes using concatenated codes.

关键词： algebraic geometric codes error correction DECODING Concatenated codes algorithms binary code Napier's constant dimensions Codes generalized algorithm

来源：评论

学校读者我要写书评

暂无评论

A New Path Following algorithm With Uncertainty Information Of Robot's Initial Position and Its Implementation 5

A New Path Following Algorithm With Uncertainty Information ...

引用

5th International Conference on Information Science and Technology (ICIST)

作者： Li, Jinke Fu, Ruiqing Wu, Xinyu Sun, Jianquan Guo, Huiwen Zhang, Shaomin Chinese Acad Sci Shenzhen Inst Adv Technol Guangdong Prov Key Lab Robot & Intelligent Syst Beijing Peoples R China South China Univ Technol Sch Automat Sci & Engn Guangzhou Guangdong Peoples R China Chinese Univ Hong Kong Dept Mech & Automat Engn Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9781479974894

In recent years, researchers come up with lots of path following algorithms. One of their basic assumptions is that the robot's initial position is a single certain point. Actually, as robots rely on sensor data to locate by Kalman filter or Partical filter, it outputs a probability distribution. In this paper, F* describes a new path following algorithm with the robot's initial position is uncertain. It depends on Monte Carlo method and A* algorithm. Some important concepts are introduced and pseudo code is given to show how it works. Experiment results show that it is more effective than general algorithm.

关键词： Robot expanded pseudo code algorithms Probability distribution Sensor Data Monte Carlo technique Kalman filters Uncertainty Byways generalized algorithm

来源：评论

学校读者我要写书评

暂无评论

Multi-agent flocking via generalized control algorithms: Existence and properties

Multi-agent flocking via generalized control algorithms: Exi...

引用

International Conference on Control, Automation, Robotics and Vision

作者： Jun Zhou Huimin Qian Xinbiao Lu School of Energy and Electrical Engineering Hohai University Nanjing 211100 China

ISBN: (纸本)9781509035502

In this paper, we propose a class of generalized flocking algorithms based on the Olfati-Saber's results for self-driving multi-agent networks by introducing some metric weighting matrix and leader-agent-related navigation-weighting coefficients, in which the multi-agents are also driven by distributed continuous-time control algorithms that are defined merely by local position and velocity measurements of neighboring multi-agents as usual. It is shown that the concerned multi-agent systems eventually run into what we call the generalized α-lattice flocking by means of the generalized algorithms, while flocking lattice geometries such as direction variation and lattice deformation (say, shrinkage and enlargement) can be achieved by choosing the weighting matrix and the leader agent coefficients. In the process of flocking, the whole multi-agent system satisfies the Reynold's principles of flocking aggregation, collision avoidance and velocity matching, while possible inter-agent collision is also verified by means of the variation-of-constants formula when initially the agents are aggregative too densely.

关键词： Nickel Artificial neural networks Terminology Electrical engineering Electronic mail Velocity measurement Speed measurement Velocimetry electronic mail ELECTRICAL ENGINEERING FLOCKING terminology Artificial neural networks Nickel generalized algorithm Computer algorithms electrical engineering

来源：评论

学校读者我要写书评

暂无评论

Analysis of Position Optimization Method Applicability in Supply Chain Management Problem

Analysis of Position Optimization Method Applicability in Su...

引用

International Conference on Stability and Control Processes in Memory of V.I. Zubov (SCP)

作者： Solovyeva, Inna Sokolov, Boris Ivanov, Dmitriy St Petersburg State Univ 7-9 Univ Skaya Nab St Petersburg 199034 Russia Russian Acad Sci St Petersburg Inst Informat & Automat St Petersburg Russia Berlin Sch Econ & Law Berlin Germany

ISBN: (纸本)9781467376983

In this study the scheduling supply chain models combination in terms of optimal program control is considered. The SC schedule execution problem is formulated. It is consist of the problem of optimal program control and the problem of positional control. Then for solving considered problem we propose to use mathematical methods of optimal control theory and linear programming, adaptive method. The generalized algorithm is represented and verified on numerical examples.

关键词： Program control computational methods theory of optimal control Supply chain management optimization method Analysis Position control generalized algorithm supply chain Control Theory

来源：评论

学校读者我要写书评

暂无评论

Reverse Engineering Combination Therapies for Evolutionary Dynamics of Disease: An H_∞ Approach

Reverse Engineering Combination Therapies for Evolutionary D...

引用

52nd IEEE Annual Conference on Decision and Control (CDC)

作者： Jonsson, Vanessa Matni, Nikolai Murray, Richard M. CALTECH Dept Control & Dynam Syst Pasadena CA 91125 USA

ISBN: (纸本)9781467357173

We propose a general algorithm for the systematic design of feedback strategies to stabilize the evolutionary dynamics of a generic disease model using an H-infinity approach. We show that designing therapy concentrations can be cast as an H-infinity state feedack synthesis problem, where the feedback gain is constrained to not only be strictly diagonal, but also that its diagonal elements satisfy an overdetermined set of linear equations. Leveraging recent results in positive systems, we develop an algorithm that always yields a stabilizing controller.

关键词： feedback gain Disease Model System design Reverse engineering Linear equation Evolutionary Combined Modality Therapy Diagonal algorithms dynamics Stabilising generalized algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共5页 << < 1 2 3 4 5 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：